CombinedText
stringlengths 4
3.42M
|
|---|
-- Copyright (C) 2019 Thierry Rascle <thierr26@free.fr>
-- MIT license. Please refer to the LICENSE file.
with Ada.Assertions,
Apsepp.Test_Reporter_Class,
Apsepp.Test_Node_Class.Private_Test_Reporter;
package body Apsepp.Test_Node_Class is
----------------------------------------------------------------------------
function Initial_Routine_State
(Routine_Index : Test_Routine_Index := 1) return Routine_State
is (Routine_Index => Routine_Index,
Assert_Count => Prot_Test_Assert_Count.Create (0),
Assert_Outcome => Passed);
----------------------------------------------------------------------------
protected body Routine_State_Map_Handler is
-----------------------------------------------------
procedure Switch_Key_If_Needed (Node_Tag : Tag) is
use Routine_State_Hashed_Maps;
procedure Update_Map_With_Work_Data is
C : constant Cursor := M.Find (T);
begin
if C = No_Element then
M.Insert (Key => T,
New_Item => S);
else
M.Replace_Element (Position => C,
New_Item => S);
end if;
end Update_Map_With_Work_Data;
procedure Extract_Work_Data is
C : constant Cursor := M.Find (Node_Tag);
begin
T := Node_Tag;
S := (if C = No_Element then
Initial_Routine_State
else
Element (C));
end Extract_Work_Data;
begin
if T /= Node_Tag then
if T /= No_Tag then
Update_Map_With_Work_Data;
end if;
Extract_Work_Data;
end if;
end Switch_Key_If_Needed;
-----------------------------------------------------
procedure Reset_Routine_State (Node_Tag : Tag;
Routine_Index : Test_Routine_Index) is
begin
Switch_Key_If_Needed (Node_Tag);
S := Initial_Routine_State (Routine_Index);
end Reset_Routine_State;
-----------------------------------------------------
procedure Increment_Assert_Count (Node_Tag : Tag) is
begin
Switch_Key_If_Needed (Node_Tag);
Prot_Test_Assert_Count.Inc (S.Assert_Count);
end Increment_Assert_Count;
-----------------------------------------------------
procedure Set_Failed_Outcome (Node_Tag : Tag) is
begin
Switch_Key_If_Needed (Node_Tag);
S.Assert_Outcome := Failed;
end Set_Failed_Outcome;
-----------------------------------------------------
procedure Get_Assert_Count (Node_Tag : Tag;
Routine_Index : out Test_Routine_Index;
Count : out O_P_I_Test_Assert_Count)
is
begin
Switch_Key_If_Needed (Node_Tag);
Routine_Index := S.Routine_Index;
Count := S.Assert_Count;
end Get_Assert_Count;
-----------------------------------------------------
procedure Get_Assert_Outcome (Node_Tag : Tag;
Outcome : out Test_Outcome) is
begin
Switch_Key_If_Needed (Node_Tag);
Outcome := S.Assert_Outcome;
end Get_Assert_Outcome;
-----------------------------------------------------
procedure Delete (Node_Tag : Tag) is
use Routine_State_Hashed_Maps;
begin
if M.Length = 0 then
T := No_Tag;
else
declare
C : Cursor := M.Find (Node_Tag);
begin
if C /= No_Element then
M.Delete (C);
end if;
if T = Node_Tag and then M.Length > 0 then
declare
C_First : constant Cursor := M.First;
begin
T := Key (C_First);
S := Element (C_First);
end;
elsif T = Node_Tag then
T := No_Tag;
end if;
end;
end if;
end Delete;
-----------------------------------------------------
function Invariant return Boolean
is (
(
T /= No_Tag
or else
M.Length = 0
)
and then
not M.Contains (No_Tag)
);
-----------------------------------------------------
function Count return Count_Type
is (M.Length + (if T = No_Tag or else M.Contains (T) then
0
else
1));
-----------------------------------------------------
function To_Array return Tag_Routine_State_Array is
use Routine_State_Hashed_Maps;
N : constant Count_Type := Count;
Ret : Tag_Routine_State_Array (1 .. N);
procedure Populate_Current is
begin
if N /= 0 then
Ret(1).T := T;
Ret(1).S := S;
end if;
end Populate_Current;
procedure Populate_Others is
K : Index_Type := 1;
procedure Process (C : Cursor) is
Key_C : constant Tag := Key (C);
begin
if Key_C /= T then
K := K + 1;
Ret(K).T := Key_C;
Ret(K).S := Element (C);
end if;
end Process;
begin
M.Iterate (Process'Access);
Ada.Assertions.Assert ((N = 0 and then K = 1)
or else
(N > 0 and then K = N));
end Populate_Others;
begin
Populate_Current;
Populate_Others;
return Ret;
end To_Array;
-----------------------------------------------------
end Routine_State_Map_Handler;
----------------------------------------------------------------------------
procedure Run_Test_Routines (Obj : Test_Node_Interfa'Class;
Outcome : out Test_Outcome;
Kind : Run_Kind) is
use Ada.Assertions,
Private_Test_Reporter;
pragma Unreferenced (Kind);
T : constant Tag := Obj'Tag;
K : Test_Routine_Count := 0;
R : Test_Routine := Null_Test_Routine'Access;
Err : Boolean := False; -- "Unexpected error" flag.
-----------------------------------------------------
function Done return Boolean is
N : constant Test_Routine_Count := Obj.Routine_Count;
Ret : Boolean := K >= N;
begin
if Err and then not Ret then
Ret := True;
Outcome := Failed;
Test_Reporter.Report_Test_Routines_Cancellation (Obj'Tag,
K + 1,
N);
end if;
return Ret;
end Done;
-----------------------------------------------------
begin
Outcome := Passed;
while not Done loop
K := K + 1;
Err := True;
Routine_State_Map_Handler.Reset_Routine_State (T, K);
Test_Reporter.Report_Test_Routine_Start (T, K);
begin
R := Obj.Routine (K);
begin
Obj.Setup_Routine;
declare
Assert_Outcome : Test_Outcome;
begin
R.all;
Err := False;
Routine_State_Map_Handler.Get_Assert_Outcome
(T, Assert_Outcome);
case Assert_Outcome is
when Failed =>
raise Assertion_Error; -- Causes a jump to
-- Assertion_Error handler
-- below. Happens when a test
-- assertion has failed but has
-- been handled in the test
-- routine.
when Passed =>
null;
end case;
Test_Reporter.Report_Passed_Test_Routine (T, K);
exception
when Run_E : Assertion_Error =>
Routine_State_Map_Handler.Get_Assert_Outcome
(T, Assert_Outcome);
Err := False;
Outcome := Failed;
case Assert_Outcome is
when Failed => -- Exception very likely originates in
-- a failed test assertion and not in
-- an "unexpected error".
Test_Reporter.Report_Failed_Test_Routine (T, K);
when Passed => -- Exception may originates in a failed
-- contract.
Test_Reporter.Report_Unexpected_Routine_Exception
(T, K, Run_E);
end case;
when Run_E : others => -- Exception originates in an
-- unexpected error.
Test_Reporter.Report_Unexpected_Routine_Exception
(T, K, Run_E);
end;
exception
when Setup_E : others =>
Test_Reporter.Report_Failed_Test_Routine_Setup
(T, K, Setup_E);
end;
exception
when Access_E : others =>
Test_Reporter.Report_Failed_Test_Routine_Access
(T, K, Access_E);
end;
end loop;
Routine_State_Map_Handler.Delete (T);
end Run_Test_Routines;
----------------------------------------------------------------------------
procedure Assert (Node_Tag : Tag; Cond : Boolean; Message : String := "") is
use Ada.Assertions,
Private_Test_Reporter,
Prot_Test_Assert_Count;
K : Test_Routine_Index;
Count : O_P_I_Test_Assert_Count;
begin
Routine_State_Map_Handler.Increment_Assert_Count (Node_Tag);
Routine_State_Map_Handler.Get_Assert_Count (Node_Tag, K, Count);
if Cond then
Test_Reporter.Report_Passed_Test_Assert
(Node_Tag, K, not Sat (Count), Val (Count));
else
Routine_State_Map_Handler.Set_Failed_Outcome (Node_Tag);
begin
raise Assertion_Error with Message;
exception
when E : others =>
Test_Reporter.Report_Failed_Test_Assert
(Node_Tag, K, not Sat (Count), Val (Count), E);
raise;
end;
end if;
end Assert;
----------------------------------------------------------------------------
begin
Ada.Assertions.Assert (Routine_State_Map_Handler.Invariant);
end Apsepp.Test_Node_Class;
|
pragma Ada_95;
with System;
package ada_main is
pragma Warnings (Off);
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: GPL 2015 (20150428-49)" & ASCII.NUL;
pragma Export (C, GNAT_Version, "__gnat_version");
Ada_Main_Program_Name : constant String := "_ada_eukl" & 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#0de222b4#;
pragma Export (C, u00001, "euklB");
u00002 : constant Version_32 := 16#fbff4c67#;
pragma Export (C, u00002, "system__standard_libraryB");
u00003 : constant Version_32 := 16#f72f352b#;
pragma Export (C, u00003, "system__standard_libraryS");
u00004 : constant Version_32 := 16#3ffc8e18#;
pragma Export (C, u00004, "adaS");
u00005 : constant Version_32 := 16#f64b89a4#;
pragma Export (C, u00005, "ada__integer_text_ioB");
u00006 : constant Version_32 := 16#f1daf268#;
pragma Export (C, u00006, "ada__integer_text_ioS");
u00007 : constant Version_32 := 16#b612ca65#;
pragma Export (C, u00007, "ada__exceptionsB");
u00008 : constant Version_32 := 16#1d190453#;
pragma Export (C, u00008, "ada__exceptionsS");
u00009 : constant Version_32 := 16#a46739c0#;
pragma Export (C, u00009, "ada__exceptions__last_chance_handlerB");
u00010 : constant Version_32 := 16#3aac8c92#;
pragma Export (C, u00010, "ada__exceptions__last_chance_handlerS");
u00011 : constant Version_32 := 16#f4ce8c3a#;
pragma Export (C, u00011, "systemS");
u00012 : constant Version_32 := 16#a207fefe#;
pragma Export (C, u00012, "system__soft_linksB");
u00013 : constant Version_32 := 16#af945ded#;
pragma Export (C, u00013, "system__soft_linksS");
u00014 : constant Version_32 := 16#b01dad17#;
pragma Export (C, u00014, "system__parametersB");
u00015 : constant Version_32 := 16#8ae48145#;
pragma Export (C, u00015, "system__parametersS");
u00016 : constant Version_32 := 16#b19b6653#;
pragma Export (C, u00016, "system__secondary_stackB");
u00017 : constant Version_32 := 16#5faf4353#;
pragma Export (C, u00017, "system__secondary_stackS");
u00018 : constant Version_32 := 16#39a03df9#;
pragma Export (C, u00018, "system__storage_elementsB");
u00019 : constant Version_32 := 16#d90dc63e#;
pragma Export (C, u00019, "system__storage_elementsS");
u00020 : constant Version_32 := 16#41837d1e#;
pragma Export (C, u00020, "system__stack_checkingB");
u00021 : constant Version_32 := 16#7a71e7d2#;
pragma Export (C, u00021, "system__stack_checkingS");
u00022 : constant Version_32 := 16#393398c1#;
pragma Export (C, u00022, "system__exception_tableB");
u00023 : constant Version_32 := 16#5ad7ea2f#;
pragma Export (C, u00023, "system__exception_tableS");
u00024 : constant Version_32 := 16#ce4af020#;
pragma Export (C, u00024, "system__exceptionsB");
u00025 : constant Version_32 := 16#9cade1cc#;
pragma Export (C, u00025, "system__exceptionsS");
u00026 : constant Version_32 := 16#37d758f1#;
pragma Export (C, u00026, "system__exceptions__machineS");
u00027 : constant Version_32 := 16#b895431d#;
pragma Export (C, u00027, "system__exceptions_debugB");
u00028 : constant Version_32 := 16#472c9584#;
pragma Export (C, u00028, "system__exceptions_debugS");
u00029 : constant Version_32 := 16#570325c8#;
pragma Export (C, u00029, "system__img_intB");
u00030 : constant Version_32 := 16#f6156cf8#;
pragma Export (C, u00030, "system__img_intS");
u00031 : constant Version_32 := 16#b98c3e16#;
pragma Export (C, u00031, "system__tracebackB");
u00032 : constant Version_32 := 16#6af355e1#;
pragma Export (C, u00032, "system__tracebackS");
u00033 : constant Version_32 := 16#9ed49525#;
pragma Export (C, u00033, "system__traceback_entriesB");
u00034 : constant Version_32 := 16#f4957a4a#;
pragma Export (C, u00034, "system__traceback_entriesS");
u00035 : constant Version_32 := 16#8c33a517#;
pragma Export (C, u00035, "system__wch_conB");
u00036 : constant Version_32 := 16#efb3aee8#;
pragma Export (C, u00036, "system__wch_conS");
u00037 : constant Version_32 := 16#9721e840#;
pragma Export (C, u00037, "system__wch_stwB");
u00038 : constant Version_32 := 16#c2a282e9#;
pragma Export (C, u00038, "system__wch_stwS");
u00039 : constant Version_32 := 16#92b797cb#;
pragma Export (C, u00039, "system__wch_cnvB");
u00040 : constant Version_32 := 16#e004141b#;
pragma Export (C, u00040, "system__wch_cnvS");
u00041 : constant Version_32 := 16#6033a23f#;
pragma Export (C, u00041, "interfacesS");
u00042 : constant Version_32 := 16#ece6fdb6#;
pragma Export (C, u00042, "system__wch_jisB");
u00043 : constant Version_32 := 16#60740d3a#;
pragma Export (C, u00043, "system__wch_jisS");
u00044 : constant Version_32 := 16#28f088c2#;
pragma Export (C, u00044, "ada__text_ioB");
u00045 : constant Version_32 := 16#1a9b0017#;
pragma Export (C, u00045, "ada__text_ioS");
u00046 : constant Version_32 := 16#10558b11#;
pragma Export (C, u00046, "ada__streamsB");
u00047 : constant Version_32 := 16#2e6701ab#;
pragma Export (C, u00047, "ada__streamsS");
u00048 : constant Version_32 := 16#db5c917c#;
pragma Export (C, u00048, "ada__io_exceptionsS");
u00049 : constant Version_32 := 16#12c8cd7d#;
pragma Export (C, u00049, "ada__tagsB");
u00050 : constant Version_32 := 16#ce72c228#;
pragma Export (C, u00050, "ada__tagsS");
u00051 : constant Version_32 := 16#c3335bfd#;
pragma Export (C, u00051, "system__htableB");
u00052 : constant Version_32 := 16#700c3fd0#;
pragma Export (C, u00052, "system__htableS");
u00053 : constant Version_32 := 16#089f5cd0#;
pragma Export (C, u00053, "system__string_hashB");
u00054 : constant Version_32 := 16#d25254ae#;
pragma Export (C, u00054, "system__string_hashS");
u00055 : constant Version_32 := 16#699628fa#;
pragma Export (C, u00055, "system__unsigned_typesS");
u00056 : constant Version_32 := 16#b44f9ae7#;
pragma Export (C, u00056, "system__val_unsB");
u00057 : constant Version_32 := 16#793ec5c1#;
pragma Export (C, u00057, "system__val_unsS");
u00058 : constant Version_32 := 16#27b600b2#;
pragma Export (C, u00058, "system__val_utilB");
u00059 : constant Version_32 := 16#586e3ac4#;
pragma Export (C, u00059, "system__val_utilS");
u00060 : constant Version_32 := 16#d1060688#;
pragma Export (C, u00060, "system__case_utilB");
u00061 : constant Version_32 := 16#d0c7e5ed#;
pragma Export (C, u00061, "system__case_utilS");
u00062 : constant Version_32 := 16#84a27f0d#;
pragma Export (C, u00062, "interfaces__c_streamsB");
u00063 : constant Version_32 := 16#8bb5f2c0#;
pragma Export (C, u00063, "interfaces__c_streamsS");
u00064 : constant Version_32 := 16#845f5a34#;
pragma Export (C, u00064, "system__crtlS");
u00065 : constant Version_32 := 16#431faf3c#;
pragma Export (C, u00065, "system__file_ioB");
u00066 : constant Version_32 := 16#53bf6d5f#;
pragma Export (C, u00066, "system__file_ioS");
u00067 : constant Version_32 := 16#b7ab275c#;
pragma Export (C, u00067, "ada__finalizationB");
u00068 : constant Version_32 := 16#19f764ca#;
pragma Export (C, u00068, "ada__finalizationS");
u00069 : constant Version_32 := 16#95817ed8#;
pragma Export (C, u00069, "system__finalization_rootB");
u00070 : constant Version_32 := 16#bb3cffaa#;
pragma Export (C, u00070, "system__finalization_rootS");
u00071 : constant Version_32 := 16#769e25e6#;
pragma Export (C, u00071, "interfaces__cB");
u00072 : constant Version_32 := 16#4a38bedb#;
pragma Export (C, u00072, "interfaces__cS");
u00073 : constant Version_32 := 16#ee0f26dd#;
pragma Export (C, u00073, "system__os_libB");
u00074 : constant Version_32 := 16#d7b69782#;
pragma Export (C, u00074, "system__os_libS");
u00075 : constant Version_32 := 16#1a817b8e#;
pragma Export (C, u00075, "system__stringsB");
u00076 : constant Version_32 := 16#8a719d5c#;
pragma Export (C, u00076, "system__stringsS");
u00077 : constant Version_32 := 16#09511692#;
pragma Export (C, u00077, "system__file_control_blockS");
u00078 : constant Version_32 := 16#f6fdca1c#;
pragma Export (C, u00078, "ada__text_io__integer_auxB");
u00079 : constant Version_32 := 16#b9793d30#;
pragma Export (C, u00079, "ada__text_io__integer_auxS");
u00080 : constant Version_32 := 16#181dc502#;
pragma Export (C, u00080, "ada__text_io__generic_auxB");
u00081 : constant Version_32 := 16#a6c327d3#;
pragma Export (C, u00081, "ada__text_io__generic_auxS");
u00082 : constant Version_32 := 16#18d57884#;
pragma Export (C, u00082, "system__img_biuB");
u00083 : constant Version_32 := 16#afb4a0b7#;
pragma Export (C, u00083, "system__img_biuS");
u00084 : constant Version_32 := 16#e7d8734f#;
pragma Export (C, u00084, "system__img_llbB");
u00085 : constant Version_32 := 16#ee73b049#;
pragma Export (C, u00085, "system__img_llbS");
u00086 : constant Version_32 := 16#9777733a#;
pragma Export (C, u00086, "system__img_lliB");
u00087 : constant Version_32 := 16#e581d9eb#;
pragma Export (C, u00087, "system__img_lliS");
u00088 : constant Version_32 := 16#0e8808d4#;
pragma Export (C, u00088, "system__img_llwB");
u00089 : constant Version_32 := 16#471f93df#;
pragma Export (C, u00089, "system__img_llwS");
u00090 : constant Version_32 := 16#428b07f8#;
pragma Export (C, u00090, "system__img_wiuB");
u00091 : constant Version_32 := 16#c1f52725#;
pragma Export (C, u00091, "system__img_wiuS");
u00092 : constant Version_32 := 16#7ebd8839#;
pragma Export (C, u00092, "system__val_intB");
u00093 : constant Version_32 := 16#bc6ba605#;
pragma Export (C, u00093, "system__val_intS");
u00094 : constant Version_32 := 16#b3aa7b17#;
pragma Export (C, u00094, "system__val_lliB");
u00095 : constant Version_32 := 16#6eea6a9a#;
pragma Export (C, u00095, "system__val_lliS");
u00096 : constant Version_32 := 16#06052bd0#;
pragma Export (C, u00096, "system__val_lluB");
u00097 : constant Version_32 := 16#13647f88#;
pragma Export (C, u00097, "system__val_lluS");
u00098 : constant Version_32 := 16#2bce1226#;
pragma Export (C, u00098, "system__memoryB");
u00099 : constant Version_32 := 16#adb3ea0e#;
pragma Export (C, u00099, "system__memoryS");
-- BEGIN ELABORATION ORDER
-- ada%s
-- interfaces%s
-- system%s
-- system.case_util%s
-- system.case_util%b
-- system.htable%s
-- system.img_int%s
-- system.img_int%b
-- system.img_lli%s
-- system.img_lli%b
-- system.parameters%s
-- system.parameters%b
-- system.crtl%s
-- interfaces.c_streams%s
-- interfaces.c_streams%b
-- system.standard_library%s
-- system.exceptions_debug%s
-- system.exceptions_debug%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%b
-- system.strings%s
-- system.strings%b
-- system.os_lib%s
-- system.traceback_entries%s
-- system.traceback_entries%b
-- ada.exceptions%s
-- system.soft_links%s
-- system.unsigned_types%s
-- system.img_biu%s
-- system.img_biu%b
-- system.img_llb%s
-- system.img_llb%b
-- system.img_llw%s
-- system.img_llw%b
-- system.img_wiu%s
-- system.img_wiu%b
-- system.val_int%s
-- system.val_lli%s
-- system.val_llu%s
-- system.val_uns%s
-- system.val_util%s
-- system.val_util%b
-- system.val_uns%b
-- system.val_llu%b
-- system.val_lli%b
-- system.val_int%b
-- system.wch_con%s
-- system.wch_con%b
-- system.wch_cnv%s
-- system.wch_jis%s
-- system.wch_jis%b
-- system.wch_cnv%b
-- system.wch_stw%s
-- system.wch_stw%b
-- ada.exceptions.last_chance_handler%s
-- ada.exceptions.last_chance_handler%b
-- system.exception_table%s
-- system.exception_table%b
-- ada.io_exceptions%s
-- ada.tags%s
-- ada.streams%s
-- ada.streams%b
-- interfaces.c%s
-- system.exceptions%s
-- system.exceptions%b
-- system.exceptions.machine%s
-- system.file_control_block%s
-- system.file_io%s
-- system.finalization_root%s
-- system.finalization_root%b
-- ada.finalization%s
-- ada.finalization%b
-- system.memory%s
-- system.memory%b
-- system.standard_library%b
-- system.secondary_stack%s
-- system.file_io%b
-- interfaces.c%b
-- ada.tags%b
-- system.soft_links%b
-- system.os_lib%b
-- system.secondary_stack%b
-- system.traceback%s
-- ada.exceptions%b
-- system.traceback%b
-- ada.text_io%s
-- ada.text_io%b
-- ada.text_io.generic_aux%s
-- ada.text_io.generic_aux%b
-- ada.text_io.integer_aux%s
-- ada.text_io.integer_aux%b
-- ada.integer_text_io%s
-- ada.integer_text_io%b
-- eukl%b
-- END ELABORATION ORDER
end ada_main;
|
type Person (Gender : Gender_Type) is record
Name : Name_String;
Age : Natural;
Weight : Float;
Case Gender is
when Male =>
Beard_Length : Float;
when Female =>
null;
end case;
end record;
|
with
openGL.Geometry .lit_colored,
openGL.Primitive.indexed;
package body openGL.Model.sphere.lit_colored
is
---------
--- Forge
--
function new_Sphere (Radius : in Real;
lat_Count : in Positive := default_latitude_Count;
long_Count : in Positive := default_longitude_Count;
Color : in lucid_Color) return View
is
Self : constant View := new Item;
begin
Self.Color := Color;
Self.lat_Count := lat_Count;
Self.long_Count := long_Count;
Self.define (Radius);
return Self;
end new_Sphere;
--------------
--- Attributes
--
-- NB: - An extra vertex is required at the end of each latitude ring.
-- - This last vertex has the same site as the rings initial vertex.
-- - The last vertex has 's' texture coord of 1.0, whereas
-- the initial vertex has 's' texture coord of 0.0.
--
overriding
function to_GL_Geometries (Self : access Item; Textures : access Texture.name_Map_of_texture'Class;
Fonts : in Font.font_id_Map_of_font) return Geometry.views
is
pragma unreferenced (Textures, Fonts);
use Geometry,
Geometry.lit_colored;
lat_Count : Positive renames Self.lat_Count;
long_Count : Positive renames Self.long_Count;
Num_lat_strips : constant Positive := lat_Count - 1;
lat_Spacing : constant Real := Degrees_180 / Real (lat_Count - 1);
long_Spacing : constant Real := Degrees_360 / Real (long_Count);
indices_Count : constant long_Index_t := long_Index_t (Num_lat_strips * (long_Count + 1) * 2);
vertex_Count : constant Index_t := 1 + 1 -- North and south pole.
+ Index_t ((long_Count + 1) * (lat_Count - 2)); -- Each latitude ring.
the_Vertices : aliased Geometry.lit_colored.Vertex_array := (1 .. vertex_Count => <>);
the_Sites : aliased Sites := (1 .. vertex_Count => <>);
the_Indices : aliased Indices := (1 .. indices_Count => <>);
Color : constant rgba_Color := to_rgba_Color (Self.Color);
the_Geometry : constant Geometry.lit_colored.view := Geometry.lit_colored.new_Geometry;
begin
set_Sites:
declare
use linear_Algebra,
linear_Algebra_3D;
north_Pole : constant Site := (0.0, 0.5, 0.0);
south_Pole : constant Site := (0.0, -0.5, 0.0);
the_Site : Site := north_Pole;
vert_Id : Index_t := 1; -- Start at '1' (not '0') to account for the northpole.
latitude_line_First : Site;
a, b : Real := 0.0; -- Angular 'cursors' used to track lat/long for texture coords.
begin
the_Sites (the_Vertices'First) := north_Pole;
the_Vertices (the_Vertices'First).Site := north_Pole;
the_Vertices (the_Vertices'First).Normal := Normalised (north_Pole);
the_Vertices (the_Vertices'First).Color := Color;
the_Vertices (the_Vertices'First).Shine := 0.5;
the_Sites (the_Vertices'Last) := south_Pole;
the_Vertices (the_Vertices'Last).Site := south_Pole;
the_Vertices (the_Vertices'Last).Normal := Normalised (south_Pole);
the_Vertices (the_Vertices'Last).Color := Color;
the_Vertices (the_Vertices'Last).Shine := 0.5;
for lat_Id in 2 .. lat_Count - 1
loop
a := 0.0;
b := b + lat_Spacing;
the_Site := the_Site * z_Rotation_from (lat_Spacing);
latitude_line_First := the_Site; -- Store initial latitude lines 1st point.
vert_Id := vert_Id + 1;
the_Sites (vert_Id) := the_Site; -- Add 1st point on a line of latitude.
the_Vertices (vert_Id).Site := the_Site;
the_Vertices (vert_Id).Normal := Normalised (the_Site);
the_Vertices (vert_Id).Color := Color;
the_Vertices (vert_Id).Shine := 0.5;
for long_Id in 1 .. long_Count
loop
a := a + long_Spacing;
if long_Id /= long_Count
then the_Site := the_Site * y_Rotation_from (-long_Spacing);
else the_Site := latitude_line_First; -- Restore the_Vertex back to initial latitude lines 1st point.
end if;
vert_Id := vert_Id + 1;
the_Sites (vert_Id) := the_Site; -- Add each succesive point on a line of latitude.
the_Vertices (vert_Id).Site := the_Site;
the_Vertices (vert_Id).Normal := Normalised (the_Site);
the_Vertices (vert_Id).Color := Color;
the_Vertices (vert_Id).Shine := 0.5;
end loop;
end loop;
end set_Sites;
for i in the_Vertices'Range
loop
the_Vertices (i).Site := the_Vertices (i).Site * Self.Radius * 2.0;
end loop;
set_Indices:
declare
strip_Id : long_Index_t := 0;
Upper : Index_t;
Lower : Index_t;
begin
upper := 1;
lower := 2;
for lat_Strip in 1 .. num_lat_Strips
loop
for Each in 1 .. long_Count + 1
loop
strip_Id := strip_Id + 1; the_Indices (strip_Id) := Upper;
strip_Id := strip_Id + 1; the_Indices (strip_Id) := Lower;
if lat_Strip /= 1 then Upper := Upper + 1; end if;
if lat_Strip /= num_lat_Strips then Lower := Lower + 1; end if;
end loop;
if lat_Strip = 1 then
Upper := 2;
end if;
Lower := Upper + Index_t (long_Count) + 1;
end loop;
end set_Indices;
the_Geometry.is_Transparent (False);
the_Geometry.Vertices_are (the_Vertices);
declare
the_Primitive : constant Primitive.indexed.view
:= Primitive.indexed.new_Primitive (Primitive.triangle_Strip, the_Indices);
begin
the_Geometry.add (Primitive.view (the_Primitive));
end;
return (1 => Geometry.view (the_Geometry));
end to_GL_Geometries;
end openGL.Model.sphere.lit_colored;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- A D A . I N T E R R U P T S . S I G N A L --
-- --
-- S p e c --
-- --
-- Copyright (C) 2000-2005, Free Software Foundation, Inc. --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNARL is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNARL; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
--
--
--
--
--
--
--
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
-- This package encapsulates the procedures for generating interrupts
-- by user programs and avoids importing low level children of System
-- (e.g. System.Interrupt_Management.Operations), or defining an interface
-- to complex system calls.
package Ada.Interrupts.Signal is
procedure Generate_Interrupt (Interrupt : Interrupt_ID);
-- Generate interrupt at the process level
end Ada.Interrupts.Signal;
|
-- Copyright 2017 Jeff Foley. All rights reserved.
-- Use of this source code is governed by Apache 2 LICENSE that can be found in the LICENSE file.
local json = require("json")
name = "ZETAlytics"
type = "api"
function start()
setratelimit(5)
end
function check()
local c
local cfg = datasrc_config()
if cfg ~= nil then
c = cfg.credentials
end
if (c ~= nil and c.key ~= nil and c.key ~= "") then
return true
end
return false
end
function vertical(ctx, domain)
local c
local cfg = datasrc_config()
if cfg ~= nil then
c = cfg.credentials
end
if (c == nil or c.key == nil or c.key == "") then
return
end
local resp
local vurl = buildurl(domain, c.key)
-- Check if the response data is in the graph database
if (cfg.ttl ~= nil and cfg.ttl > 0) then
resp = obtain_response(domain, cfg.ttl)
end
if (resp == nil or resp == "") then
local err
resp, err = request({
url=vurl,
headers={['Content-Type']="application/json"},
})
if (err ~= nil and err ~= "") then
return
end
if (cfg.ttl ~= nil and cfg.ttl > 0) then
cache_response(domain, resp)
end
end
local d = json.decode(resp)
if (d == nil or #(d.results) == 0) then
return
end
for i, r in pairs(d.results) do
sendnames(ctx, r.qname)
end
end
function buildurl(domain, key)
return "https://zonecruncher.com/api/v1/subdomains?q=" .. domain .. "&token=" .. key
end
function sendnames(ctx, content)
local names = find(content, subdomainre)
if names == nil then
return
end
local found = {}
for i, v in pairs(names) do
if found[v] == nil then
newname(ctx, v)
found[v] = true
end
end
end
|
-- SPDX-FileCopyrightText: 2019 Max Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
with Ada.Wide_Wide_Characters.Handling;
with Program.Source_Buffers;
package body Program.Lexical_Handlers is
use all type Program.Scanner_Destinations.Token_Kind;
subtype Hash_Value is Positive range 2 + 2 * 6 .. 12 + 3 * 115;
function Hash (W : Wide_Wide_String) return Hash_Value;
function To_Token
(X : Wide_Wide_String)
return Program.Scanner_Destinations.Token_Kind;
Map : constant array (Program.Scanner_States.Rule_Index range 1 .. 27) of
Program.Scanner_Destinations.Token_Kind :=
(1 => Arrow, 2 => Double_Dot, 3 => Double_Star,
4 => Assignment, 5 => Inequality,
6 => Greater_Or_Equal, 7 => Less_Or_Equal,
8 => Left_Label, 9 => Right_Label, 10 => Box,
11 => Ampersand, 12 => Apostrophe,
13 => Left_Parenthesis, 14 => Right_Parenthesis,
15 => Star, 16 => Plus, 17 => Comma,
18 => Hyphen, 19 => Dot, 20 => Slash,
21 => Colon, 22 => Semicolon, 23 => Less,
24 => Equal, 25 => Greater, 26 => Vertical_Line,
27 => Vertical_Line);
Id : constant Program.Scanner_Destinations.Token_Kind := Identifier;
-- generated by gperf -m 100
Word_Map : constant array (Hash_Value range 22 .. 114)
of Program.Scanner_Destinations.Token_Kind :=
(Else_Keyword,
At_Keyword,
Task_Keyword,
Then_Keyword,
Not_Keyword,
Range_Keyword,
Abs_Keyword,
Renames_Keyword,
Return_Keyword,
End_Keyword,
Terminate_Keyword,
Case_Keyword,
Xor_Keyword,
Abstract_Keyword,
Synchronized_Keyword,
Reverse_Keyword,
And_Keyword,
Exception_Keyword,
Constant_Keyword,
Declare_Keyword,
Access_Keyword,
Record_Keyword,
Accept_Keyword,
Is_Keyword,
In_Keyword,
Type_Keyword,
Entry_Keyword,
Separate_Keyword,
Or_Keyword,
Requeue_Keyword,
Do_Keyword,
Select_Keyword,
When_Keyword,
Exit_Keyword,
Array_Keyword,
Raise_Keyword,
Out_Keyword,
Package_Keyword,
Interface_Keyword,
Pragma_Keyword,
Delta_Keyword,
Use_Keyword,
Digits_Keyword,
Abort_Keyword,
Tagged_Keyword,
Some_Keyword,
Aliased_Keyword,
Elsif_Keyword,
Subtype_Keyword,
Id,
Generic_Keyword,
For_Keyword,
Function_Keyword,
Id,
Mod_Keyword,
Null_Keyword,
Delay_Keyword,
Private_Keyword,
Id, Id,
All_Keyword,
Procedure_Keyword,
New_Keyword,
While_Keyword,
Id,
With_Keyword,
Protected_Keyword,
Others_Keyword,
Id,
If_Keyword,
Goto_Keyword,
Of_Keyword,
Until_Keyword,
Body_Keyword,
Overriding_Keyword,
Id, Id, Id, Id, Id,
Limited_Keyword,
Id,
Begin_Keyword,
Loop_Keyword,
Id, Id, Id, Id, Id, Id, Id, Id,
Rem_Keyword);
Word_Text : constant Wide_Wide_String :=
"else"
& "at"
& "task"
& "then"
& "not"
& "range"
& "abs"
& "renames"
& "return"
& "end"
& "terminate"
& "case"
& "xor"
& "abstract"
& "synchronized"
& "reverse"
& "and"
& "exception"
& "constant"
& "declare"
& "access"
& "record"
& "accept"
& "is"
& "in"
& "type"
& "entry"
& "separate"
& "or"
& "requeue"
& "do"
& "select"
& "when"
& "exit"
& "array"
& "raise"
& "out"
& "package"
& "interface"
& "pragma"
& "delta"
& "use"
& "digits"
& "abort"
& "tagged"
& "some"
& "aliased"
& "elsif"
& "subtype"
& "generic"
& "for"
& "function"
& "mod"
& "null"
& "delay"
& "private"
& "all"
& "procedure"
& "new"
& "while"
& "with"
& "protected"
& "others"
& "if"
& "goto"
& "of"
& "until"
& "body"
& "overriding"
& "limited"
& "begin"
& "loop"
& "rem";
Word_From : constant array (Hash_Value range 22 .. 114) of Natural :=
(1,
5,
7,
11,
15,
18,
23,
26,
33,
39,
42,
51,
55,
58,
66,
78,
85,
88,
97,
105,
112,
118,
124,
130,
132,
134,
138,
143,
151,
153,
160,
162,
168,
172,
176,
181,
186,
189,
196,
205,
211,
216,
219,
225,
230,
236,
240,
247,
252, -- Subtype_Keyword,
0,
259, -- Generic_Keyword,
266, -- For_Keyword,
269, -- Function_Keyword,
0,
277, -- Mod_Keyword,
280, -- Null_Keyword,
284, -- Delay_Keyword,
289, -- Private_Keyword,
0, 0,
296, -- All_Keyword,
299, -- Procedure_Keyw
308, -- New_Keyword,
311, -- While_Keyword,
0,
316, -- With_Keyword,
320, -- Protected_Keywo
329, -- Others_Keyword,
0,
335, -- If_Keyword,
337, -- Goto_Keyword,
341, -- Of_Keyword,
343, -- Until_Keyword,
348, -- Body_Keyword,
352, -- Overriding_Keyword,
0, 0, 0, 0, 0,
362, -- Limited_Keyword,
0,
369, -- Begin_Keyword
374, -- Loop_Keyword,
0, 0, 0, 0, 0, 0, 0, 0,
378); -- Rem_Keyword, Total length 381);
-----------------------
-- Character_Literal --
-----------------------
overriding procedure Character_Literal
(Self : not null access Handler;
Scanner : not null access Program.Scanners.Scanner'Class;
Rule : Program.Scanner_States.Rule_Index;
Token : out Program.Scanner_Destinations.Token_Kind;
Skip : in out Boolean)
is
pragma Unreferenced (Rule);
Value : Program.Scanner_Destinations.Token;
begin
Scanner.Set_Start_Condition (Program.Scanner_States.Allow_Char);
Token := Character_Literal;
Skip := False;
Value := (Kind => Token, Span => Scanner.Get_Span);
Self.Output.New_Token (Value);
Self.Last_Token := Token;
end Character_Literal;
-------------
-- Comment --
-------------
overriding procedure Comment
(Self : not null access Handler;
Scanner : not null access Program.Scanners.Scanner'Class;
Rule : Program.Scanner_States.Rule_Index;
Token : out Program.Scanner_Destinations.Token_Kind;
Skip : in out Boolean)
is
pragma Unreferenced (Self, Scanner, Rule, Token);
begin
Skip := True;
end Comment;
---------------
-- Delimiter --
---------------
overriding procedure Delimiter
(Self : not null access Handler;
Scanner : not null access Program.Scanners.Scanner'Class;
Rule : Program.Scanner_States.Rule_Index;
Token : out Program.Scanner_Destinations.Token_Kind;
Skip : in out Boolean)
is
Value : Program.Scanner_Destinations.Token;
begin
Scanner.Set_Start_Condition (Program.Scanner_States.Allow_Char);
Token := Map (Rule);
Skip := False;
Value := (Kind => Token, Span => Scanner.Get_Span);
Self.Output.New_Token (Value);
Self.Last_Token := Token;
end Delimiter;
-----------
-- Error --
-----------
overriding procedure Error
(Self : not null access Handler;
Scanner : not null access Program.Scanners.Scanner'Class;
Rule : Program.Scanner_States.Rule_Index;
Token : out Program.Scanner_Destinations.Token_Kind;
Skip : in out Boolean)
is
pragma Unreferenced (Rule);
Value : Program.Scanner_Destinations.Token;
begin
Token := Error;
Skip := False;
Value := (Kind => Token, Span => Scanner.Get_Span);
Self.Output.New_Token (Value);
Self.Last_Token := Token;
end Error;
----------
-- Hash --
----------
function Hash (W : Wide_Wide_String) return Hash_Value is
X : constant array (Wide_Wide_Character range 'a' .. 'y') of Positive :=
(13, 51, 17, 11, 6, 52, 41, 38, 37, 115, 6, 33, 51,
7, 39, 29, 29, 9, 6, 8, 48, 15, 37, 13, 29);
function Y (Val : Wide_Wide_Character) return Positive;
function Y (Val : Wide_Wide_Character) return Positive is
begin
if Val in X'Range then
return X (Val);
else
return 115;
end if;
end Y;
Length : constant Positive := W'Length;
Result : Positive := Length; -- 2 .. 12
begin
if Length > 2 then
Result := Result + Y (W (W'First + 2)); -- 6 .. 115
end if;
Result := Result + Y (W (W'First)); -- 6 .. 115
Result := Result + Y (W (Length)); -- 6 .. 115
return Result;
end Hash;
----------------
-- Identifier --
----------------
overriding procedure Identifier
(Self : not null access Handler;
Scanner : not null access Program.Scanners.Scanner'Class;
Rule : Program.Scanner_States.Rule_Index;
Token : out Program.Scanner_Destinations.Token_Kind;
Skip : in out Boolean)
is
pragma Unreferenced (Rule);
Value : Program.Scanner_Destinations.Token;
Span : constant Program.Source_Buffers.Span := Scanner.Get_Span;
Text : constant Wide_Wide_String := Scanner.Get_Source.Text (Span);
Match : constant Wide_Wide_String :=
Ada.Wide_Wide_Characters.Handling.To_Lower (Text);
begin
Token := To_Token (Match);
Skip := False;
if Self.Last_Token = Apostrophe and Token /= Range_Keyword then
Token := Id;
end if;
if Token = Id then
Scanner.Set_Start_Condition (Program.Scanner_States.INITIAL);
else
Scanner.Set_Start_Condition (Program.Scanner_States.Allow_Char);
end if;
Value := (Kind => Token, Span => Scanner.Get_Span);
Self.Output.New_Token (Value);
Self.Last_Token := Token;
end Identifier;
--------------
-- New_Line --
--------------
overriding procedure New_Line
(Self : not null access Handler;
Scanner : not null access Program.Scanners.Scanner'Class;
Rule : Program.Scanner_States.Rule_Index;
Token : out Program.Scanner_Destinations.Token_Kind;
Skip : in out Boolean)
is
pragma Unreferenced (Scanner, Rule, Token);
begin
Skip := True;
Self.Output.New_Line (Self.Line);
Self.Line := Self.Line + 1;
end New_Line;
---------------------
-- Numeric_Literal --
---------------------
overriding procedure Numeric_Literal
(Self : not null access Handler;
Scanner : not null access Program.Scanners.Scanner'Class;
Rule : Program.Scanner_States.Rule_Index;
Token : out Program.Scanner_Destinations.Token_Kind;
Skip : in out Boolean)
is
pragma Unreferenced (Rule);
Value : Program.Scanner_Destinations.Token;
begin
Scanner.Set_Start_Condition (Program.Scanner_States.Allow_Char);
Token := Numeric_Literal;
Skip := False;
Value := (Kind => Token, Span => Scanner.Get_Span);
Self.Output.New_Token (Value);
Self.Last_Token := Token;
end Numeric_Literal;
---------------------------------
-- Obsolescent_Numeric_Literal --
---------------------------------
overriding procedure Obsolescent_Numeric_Literal
(Self : not null access Handler;
Scanner : not null access Program.Scanners.Scanner'Class;
Rule : Program.Scanner_States.Rule_Index;
Token : out Program.Scanner_Destinations.Token_Kind;
Skip : in out Boolean) renames Numeric_Literal;
--------------------------------
-- Obsolescent_String_Literal --
--------------------------------
overriding procedure Obsolescent_String_Literal
(Self : not null access Handler;
Scanner : not null access Program.Scanners.Scanner'Class;
Rule : Program.Scanner_States.Rule_Index;
Token : out Program.Scanner_Destinations.Token_Kind;
Skip : in out Boolean) renames String_Literal;
-----------
-- Space --
-----------
overriding procedure Space
(Self : not null access Handler;
Scanner : not null access Program.Scanners.Scanner'Class;
Rule : Program.Scanner_States.Rule_Index;
Token : out Program.Scanner_Destinations.Token_Kind;
Skip : in out Boolean)
is
pragma Unreferenced (Self, Scanner, Rule, Token);
begin
Skip := True;
end Space;
--------------------
-- String_Literal --
--------------------
overriding procedure String_Literal
(Self : not null access Handler;
Scanner : not null access Program.Scanners.Scanner'Class;
Rule : Program.Scanner_States.Rule_Index;
Token : out Program.Scanner_Destinations.Token_Kind;
Skip : in out Boolean)
is
pragma Unreferenced (Rule);
Value : Program.Scanner_Destinations.Token;
begin
Scanner.Set_Start_Condition (Program.Scanner_States.Allow_Char);
Token := String_Literal;
Skip := False;
Value := (Kind => Token, Span => Scanner.Get_Span);
Self.Output.New_Token (Value);
Self.Last_Token := Token;
end String_Literal;
--------------
-- To_Token --
--------------
function To_Token
(X : Wide_Wide_String)
return Program.Scanner_Destinations.Token_Kind
is
H : Hash_Value;
begin
if X'Length in 2 .. 12 then
H := Hash (X);
if H in Word_From'Range and then
Word_From (H) >= Word_Text'First and then
Word_From (H) + X'Length - 1 <= Word_Text'Last and then
Word_Text (Word_From (H) .. Word_From (H) + X'Length - 1) = X
then
return Word_Map (H);
end if;
end if;
return Identifier;
end To_Token;
end Program.Lexical_Handlers;
|
-- SPDX-FileCopyrightText: 2019 Max Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
with League.Strings;
package Writers is
pragma Preelaborate;
type Writer is tagged private;
function Text
(Self : Writer) return League.Strings.Universal_String;
procedure Clear (Self : in out Writer);
procedure P
(Self : in out Writer;
Text : Wide_Wide_String := "");
procedure N
(Self : in out Writer;
Text : Wide_Wide_String);
procedure P
(Self : in out Writer;
Text : League.Strings.Universal_String);
procedure N
(Self : in out Writer;
Text : League.Strings.Universal_String);
procedure P
(Self : in out Writer;
Text : Wide_Wide_String := "";
Copy : in out Writer'Class);
procedure N
(Self : in out Writer;
Text : Wide_Wide_String;
Copy : in out Writer'Class);
procedure P
(Self : in out Writer;
Text : League.Strings.Universal_String;
Copy : in out Writer'Class);
procedure N
(Self : in out Writer;
Text : League.Strings.Universal_String;
Copy : in out Writer'Class);
procedure N
(Self : in out Writer;
Value : Natural);
procedure N
(Self : in out Writer;
Value : Writer'Class);
private
type Writer is tagged record
Text : League.Strings.Universal_String;
Last_Line : League.Strings.Universal_String;
end record;
end Writers;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . B B . P A R A M E T E R S --
-- --
-- S p e c --
-- --
-- Copyright (C) 1999-2002 Universidad Politecnica de Madrid --
-- Copyright (C) 2003-2005 The European Space Agency --
-- Copyright (C) 2003-2016, AdaCore --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNARL is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- 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. --
-- --
-- The port of GNARL to bare board targets was initially developed by the --
-- Real-Time Systems Group at the Technical University of Madrid. --
-- --
------------------------------------------------------------------------------
-- This package defines basic parameters used by the low level tasking system
-- This is the ERC32/LEON/LEON3 version of this package
pragma Restrictions (No_Elaboration_Code);
with System.BB.Board_Parameters;
package System.BB.Parameters is
pragma Pure;
--------------------
-- Hardware clock --
--------------------
Clock_Frequency : constant := System.BB.Board_Parameters.Clock_Frequency;
-- Frequency of the system clock
Ticks_Per_Second : constant :=
Clock_Frequency / (Board_Parameters.Prescaler_Min + 1);
-- The prescaler is clocked by the system clock. When it underflows, it
-- is reloaded from the prescaler reload register and a timer tick is
-- generated. The effective division rate is therefore equal to the
-- prescaler reload register value plus 1.
----------------
-- Interrupts --
----------------
-- The following are ERC32/LEON/LEON3 definitions and they cannot be
-- modified.
-- These definitions are in this package in order to isolate target
-- dependencies.
Interrupt_Range_Last : constant :=
(if Board_Parameters.Extended_Interrupts_Level /= 0 then 31 else 15);
subtype Interrupt_Range is Natural range 1 .. Interrupt_Range_Last;
-- Number of interrupts in the SPARC architecture
Trap_Vectors : constant := 256;
-- The SPARC arquitecture supports 256 vectors
------------------------
-- Context Management --
------------------------
-- The SPARC processor needs to save:
--
-- * 18 integer registers of 32 bits (7 global, 8 output, PSR, Y, and WIM)
-- for normal processing
--
-- * 33 floating point registers of 32 bits
--
-- * the number of register windows saved to the stack
-- (the input and local registers are saved to the stack).
--
-- * interrupt nesting level corresponding to the task
--
-- * for LEON, to slots for the Cache Control Register
--
-- This would be 55 slots for LEON/LEON3 and 53 otherwise, but
-- this need to be rounded up to an even number to allow more
-- efficient access.
--
-- For LEON, we store the Cache Control Register to be able to keep the
-- cache status per task. We keep the base Cache Control Register (which
-- is not affected by automatic changes related to the freeze-on-interrupt
-- capability) and the actual Cache Control Register (the one directly
-- extracted from the hardware).
Base_CCR_Context_Index : constant := 53;
CCR_Context_Index : constant := 54;
Context_Buffer_Capacity : constant := 56;
------------
-- Stacks --
------------
Interrupt_Stack_Size : constant := 8 * 1024; -- bytes
-- Size of each of the interrupt stacks
----------
-- CPUS --
----------
Max_Number_Of_CPUs : constant := Board_Parameters.Max_Number_Of_CPUs;
-- Maximum number of CPUs
Multiprocessor : constant Boolean := Max_Number_Of_CPUs /= 1;
-- Are we on a multiprocessor board?
end System.BB.Parameters;
|
procedure Very_Large_Value is
begin
if 16#2B.20000000000000000000000000000000000000000#E1 > 0.1 then
null;
end if;
end Very_Large_Value;
|
--//////////////////////////////////////////////////////////
-- //
-- // SFML - Simple and Fast Multimedia Library
-- // Copyright (C) 2007-2009 Laurent Gomila (laurent.gom@gmail.com)
-- //
-- // This software is provided 'as-is', without any express or implied warranty.
-- // In no event will the authors be held liable for any damages arising from the use of this software.
-- //
-- // Permission is granted to anyone to use this software for any purpose,
-- // including commercial applications, and to alter it and redistribute it freely,
-- // subject to the following restrictions:
-- //
-- // 1. The origin of this software must not be misrepresented;
-- // you must not claim that you wrote the original software.
-- // If you use this software in a product, an acknowledgment
-- // in the product documentation would be appreciated but is not required.
-- //
-- // 2. Altered source versions must be plainly marked as such,
-- // and must not be misrepresented as being the original software.
-- //
-- // 3. This notice may not be removed or altered from any source distribution.
-- //
--//////////////////////////////////////////////////////////
--//////////////////////////////////////////////////////////
-- SFML - Simple and Fast Multimedia Library
-- Copyright (C) 2007-2015 Laurent Gomila (laurent@sfml-dev.org)
-- 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;
|
with AdaBase;
with Connect;
with Ada.Text_IO;
with Ada.Exceptions;
procedure MultiQuery is
package CON renames Connect;
package TIO renames Ada.Text_IO;
package EX renames Ada.Exceptions;
numrows : AdaBase.Affected_Rows;
setting : Boolean;
nextone : Boolean;
SQL : constant String :=
"DELETE FROM fruits WHERE color = 'red'; " &
"DELETE FROM fruits WHERE color = 'orange'";
begin
CON.connect_database;
TIO.Put_Line ("This demonstration shows how multiple queries in the " &
"same SQL string are handled.");
TIO.Put_Line ("SQL string used: " & SQL);
TIO.Put_Line ("");
setting := CON.DR.trait_multiquery_enabled;
nextone := not setting;
TIO.Put_Line ("Testing query with MultiQuery option set to " & setting'Img);
TIO.Put_Line ("-- Execution attempt #1 --");
begin
numrows := CON.DR.execute (SQL);
TIO.Put_Line ("Query succeeded");
CON.DR.rollback;
exception
when ouch : others =>
TIO.Put_Line ("Exception: " & EX.Exception_Message (ouch));
TIO.Put_Line ("Failed to test this setting");
end;
TIO.Put_Line ("");
TIO.Put_Line ("Attempt to toggle MultiQuery setting to " & nextone'Img);
begin
CON.DR.set_trait_multiquery_enabled (nextone);
TIO.Put_Line ("-- Execution attempt #2 --");
numrows := CON.DR.execute (SQL);
TIO.Put_Line ("Query succeeded");
CON.DR.rollback;
exception
when ouch : others =>
TIO.Put_Line ("Exception: " & EX.Exception_Message (ouch));
TIO.Put_Line ("Failed to test this setting");
end;
CON.DR.disconnect;
end MultiQuery;
|
-----------------------------------------------------------------------
-- bean - A simple bean example
-- Copyright (C) 2009, 2010 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Beans.Factory;
with EL.Methods.Func_String;
with EL.Methods.Func_Unbounded;
with Ada.Unchecked_Deallocation;
package body Bean is
use EL.Objects;
use Util.Beans.Methods;
use EL.Methods;
FIRST_NAME : constant String := "firstName";
LAST_NAME : constant String := "lastName";
AGE : constant String := "age";
Null_Object : Object;
function Create_Person (First_Name, Last_Name : String;
Age : Natural) return Person_Access is
begin
return new Person '(First_Name => To_Unbounded_String (First_Name),
Last_Name => To_Unbounded_String (Last_Name),
Age => Age);
end Create_Person;
-- Get the value identified by the name.
function Get_Value (From : Person; Name : String) return EL.Objects.Object is
begin
if Name = FIRST_NAME then
return To_Object (From.First_Name);
elsif Name = LAST_NAME then
return To_Object (From.Last_Name);
elsif Name = AGE then
return To_Object (From.Age);
else
return Null_Object;
end if;
end Get_Value;
-- Set the value identified by the name.
procedure Set_Value (From : in out Person;
Name : in String;
Value : in EL.Objects.Object) is
begin
if Name = FIRST_NAME then
From.First_Name := To_Unbounded_String (Value);
elsif Name = LAST_NAME then
From.Last_Name := To_Unbounded_String (Value);
elsif Name = AGE then
From.Age := Natural (To_Integer (Value));
end if;
end Set_Value;
--
function Save (P : in Person; Name : in Unbounded_String) return Unbounded_String is
Result : Unbounded_String;
begin
Result := P.Last_Name & Name;
return Result;
end Save;
function Compute (B : Util.Beans.Basic.Bean'Class;
P1 : EL.Objects.Object) return EL.Objects.Object is
P : Person := Person (B);
begin
return P1;
end Compute;
-- Function to format a string
function Format (Arg : EL.Objects.Object) return EL.Objects.Object is
S : constant String := To_String (Arg);
begin
return To_Object ("[" & S & "]");
end Format;
function Print (P : in Person; Title : in String) return String is
begin
return Title & " ["
& "Name=" & To_String (P.First_Name) & ", "
& "Last_name=" & To_String (P.Last_Name) & "]";
end Print;
package Save_Binding is
new Func_Unbounded.Bind (Bean => Person,
Method => Save,
Name => "save");
package Print_Binding is
new Func_String.Bind (Bean => Person,
Method => Print,
Name => "print");
type Bean_Definition is new Util.Beans.Factory.Bean_Definition with null record;
-- Create a bean.
overriding
function Create (Def : in Bean_Definition)
return Util.Beans.Basic.Readonly_Bean_Access;
-- Free the bean instance.
overriding
procedure Destroy (Def : in Bean_Definition;
Bean : in out Util.Beans.Basic.Readonly_Bean_Access);
-- Create a bean.
overriding
function Create (Def : in Bean_Definition)
return Util.Beans.Basic.Readonly_Bean_Access is
Result : Person_Access := new Person;
begin
return Result.all'Access;
end Create;
-- Free the bean instance.
overriding
procedure Destroy (Def : in Bean_Definition;
Bean : in out Util.Beans.Basic.Readonly_Bean_Access) is
begin
null;
end Destroy;
B : aliased Bean_Definition
:= Bean_Definition '(Method_Count => 2,
Methods => (Save_Binding.Proxy'Access, null)
);
Binding_Array : aliased constant Util.Beans.Methods.Method_Binding_Array
:= (Save_Binding.Proxy'Access, Print_Binding.Proxy'Access);
function Get_Method_Bindings (From : in Person)
return Util.Beans.Methods.Method_Binding_Array_Access is
begin
return Binding_Array'Access;
end Get_Method_Bindings;
procedure Free (Object : in out Person_Access) is
procedure Free is new Ada.Unchecked_Deallocation (Object => Person'Class,
Name => Person_Access);
begin
Free (Object);
end Free;
end Bean;
|
-- Copyright (c) 2017 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with League.Strings;
with WebDriver.Drivers;
package WebDriver.Remote is
function Create
(URL : League.Strings.Universal_String)
return WebDriver.Drivers.Driver'Class;
-- Connect to server ("Remote end")
end WebDriver.Remote;
|
with OpenAL.Context.Error;
with OpenAL.Context;
with OpenAL.Extension.EFX;
with Test;
procedure efx_001 is
package ALC renames OpenAL.Context;
package ALC_Error renames OpenAL.Context.Error;
package AL_EFX renames OpenAL.Extension.EFX;
Device : ALC.Device_t;
Context : ALC.Context_t;
OK : Boolean;
Loaded : Boolean;
EFX : AL_EFX.Extension_t;
TC : Test.Context_t;
use type ALC.Device_t;
use type ALC.Context_t;
use type ALC_Error.Error_t;
procedure Finish is
begin
ALC.Destroy_Context (Context);
ALC.Close_Device (Device);
end Finish;
procedure Init is
begin
Device := ALC.Open_Default_Device;
pragma Assert (Device /= ALC.Invalid_Device);
Context := ALC.Create_Context (Device);
pragma Assert (Context /= ALC.Invalid_Context);
OK := ALC.Make_Context_Current (Context);
pragma Assert (OK);
end Init;
begin
Test.Initialize
(Test_Context => TC,
Program => "efx_001",
Test_DB => "TEST_DB",
Test_Results => "TEST_RESULTS");
Init;
Loaded := True;
if AL_EFX.Is_Present (Device) then
begin
EFX := AL_EFX.Load_Extension;
pragma Assert (EFX'Size > 0);
exception
when others => Loaded := False;
end;
Test.Check (TC, 55, Loaded, "Loaded");
else
Test.Satisfy (TC, 55, Test.Unsupported);
end if;
Finish;
end efx_001;
|
------------------------------------------------------------------------------
-- --
-- GNU ADA RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . T A S K I N G . I N I T I A L I Z A T I O N --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1991-2001, Florida State University --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNARL is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNARL; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. It is --
-- now maintained by Ada Core Technologies Inc. in cooperation with Florida --
-- State University (http://www.gnat.com). --
-- --
------------------------------------------------------------------------------
pragma Style_Checks (All_Checks);
-- Turn off subprogram alpha ordering check, since we group soft link
-- bodies and dummy soft link bodies together separately in this unit.
pragma Polling (Off);
-- Turn polling off for this package. We don't need polling during any
-- of the routines in this package, and more to the point, if we try
-- to poll it can cause infinite loops.
-- This package provides overall initialization of the tasking portion
-- of the RTS. This package must be elaborated before any tasking
-- features are used. It also contains initialization for
-- Ada Task Control Block (ATCB) records.
with Ada.Exceptions;
-- used for Exception_Occurrence_Access.
with System.Tasking;
pragma Elaborate_All (System.Tasking);
-- ensure that the first step initializations have been performed
with System.Task_Primitives;
-- used for Lock
with System.Task_Primitives.Operations;
-- used for Set_Priority
-- Write_Lock
-- Unlock
-- Initialize_Lock
with System.Soft_Links;
-- used for the non-tasking routines (*_NT) that refer to global data.
-- They are needed here before the tasking run time has been elaborated.
with System.Tasking.Debug;
-- used for Trace
with System.Tasking.Task_Attributes;
-- used for All_Attrs_L
with System.Stack_Checking;
package body System.Tasking.Initialization is
package STPO renames System.Task_Primitives.Operations;
package SSL renames System.Soft_Links;
package AE renames Ada.Exceptions;
use System.Task_Primitives.Operations;
Global_Task_Lock : aliased System.Task_Primitives.RTS_Lock;
-- This is a global lock; it is used to execute in mutual exclusion
-- from all other tasks. It is only used by Task_Lock,
-- Task_Unlock, and Final_Task_Unlock.
function Current_Target_Exception return AE.Exception_Occurrence;
pragma Import
(Ada, Current_Target_Exception, "__gnat_current_target_exception");
-- Import this subprogram from the private part of Ada.Exceptions.
-----------------------------------------------------------------
-- Tasking versions of services needed by non-tasking programs --
-----------------------------------------------------------------
procedure Task_Lock;
-- Locks out other tasks. Preceding a section of code by Task_Lock and
-- following it by Task_Unlock creates a critical region. This is used
-- for ensuring that a region of non-tasking code (such as code used to
-- allocate memory) is tasking safe. Note that it is valid for calls to
-- Task_Lock/Task_Unlock to be nested, and this must work properly, i.e.
-- only the corresponding outer level Task_Unlock will actually unlock.
procedure Task_Unlock;
-- Releases lock previously set by call to Task_Lock. In the nested case,
-- all nested locks must be released before other tasks competing for the
-- tasking lock are released.
function Get_Jmpbuf_Address return Address;
procedure Set_Jmpbuf_Address (Addr : Address);
-- Get/Set Jmpbuf_Address for current task
function Get_Sec_Stack_Addr return Address;
procedure Set_Sec_Stack_Addr (Addr : Address);
-- Get/Set location of current task's secondary stack
function Get_Exc_Stack_Addr return Address;
-- Get the exception stack for the current task
procedure Set_Exc_Stack_Addr (Self_ID : Address; Addr : Address);
-- Self_ID is the Task_ID of the task that gets the exception stack.
-- For Self_ID = Null_Address, the current task gets the exception stack.
function Get_Machine_State_Addr return Address;
procedure Set_Machine_State_Addr (Addr : Address);
-- Get/Set the address for storing the current task's machine state
function Get_Current_Excep return SSL.EOA;
-- Comments needed???
procedure Timed_Delay_T (Time : Duration; Mode : Integer);
-- Comments needed???
function Get_Stack_Info return Stack_Checking.Stack_Access;
-- Get access to the current task's Stack_Info
procedure Update_Exception
(X : AE.Exception_Occurrence := Current_Target_Exception);
-- Handle exception setting and check for pending actions
------------------------
-- Local Subprograms --
------------------------
procedure Do_Pending_Action (Self_ID : Task_ID);
-- This is introduced to allow more efficient
-- in-line expansion of Undefer_Abort.
----------------------------
-- Tasking Initialization --
----------------------------
procedure Init_RTS;
-- This procedure completes the initialization of the GNARL. The first
-- part of the initialization is done in the body of System.Tasking.
-- It consists of initializing global locks, and installing tasking
-- versions of certain operations used by the compiler. Init_RTS is called
-- during elaboration.
--------------------------
-- Change_Base_Priority --
--------------------------
-- Call only with abort deferred and holding Self_ID locked.
procedure Change_Base_Priority (T : Task_ID) is
begin
if T.Common.Base_Priority /= T.New_Base_Priority then
T.Common.Base_Priority := T.New_Base_Priority;
Set_Priority (T, T.Common.Base_Priority);
end if;
end Change_Base_Priority;
------------------------
-- Check_Abort_Status --
------------------------
function Check_Abort_Status return Integer is
Self_ID : Task_ID := Self;
begin
if Self_ID /= null and then Self_ID.Deferral_Level = 0
and then Self_ID.Pending_ATC_Level < Self_ID.ATC_Nesting_Level
then
return 1;
else
return 0;
end if;
end Check_Abort_Status;
-----------------
-- Defer_Abort --
-----------------
procedure Defer_Abort (Self_ID : Task_ID) is
begin
pragma Assert (Self_ID.Deferral_Level = 0);
-- pragma Assert
-- (Self_ID.Pending_ATC_Level >= Self_ID.ATC_Nesting_Level);
-- The above check has been useful in detecting mismatched
-- defer/undefer pairs. You may uncomment it when testing on
-- systems that support preemptive abort.
-- If the OS supports preemptive abort (e.g. pthread_kill),
-- it should have happened already. A problem is with systems
-- that do not support preemptive abort, and so rely on polling.
-- On such systems we may get false failures of the assertion,
-- since polling for pending abort does no occur until the abort
-- undefer operation.
-- Even on systems that only poll for abort, the assertion may
-- be useful for catching missed abort completion polling points.
-- The operations that undefer abort poll for pending aborts.
-- This covers most of the places where the core Ada semantics
-- require abort to be caught, without any special attention.
-- However, this generally happens on exit from runtime system
-- call, which means a pending abort will not be noticed on the
-- way into the runtime system. We considered adding a check
-- for pending aborts at this point, but chose not to, because
-- of the overhead. Instead, we searched for RTS calls that
-- where abort completion is required and a task could go
-- farther than Ada allows before undeferring abort; we then
-- modified the code to ensure the abort would be detected.
Self_ID.Deferral_Level := Self_ID.Deferral_Level + 1;
end Defer_Abort;
--------------------------
-- Defer_Abort_Nestable --
--------------------------
procedure Defer_Abort_Nestable (Self_ID : Task_ID) is
begin
-- pragma Assert
-- ((Self_ID.Pending_ATC_Level >= Self_ID.ATC_Nesting_Level or else
-- Self_ID.Deferral_Level > 0));
-- See comment in Defer_Abort on the situations in which it may
-- be useful to uncomment the above assertion.
Self_ID.Deferral_Level := Self_ID.Deferral_Level + 1;
end Defer_Abort_Nestable;
--------------------
-- Defer_Abortion --
--------------------
-- ??????
-- Phase out Defer_Abortion without Self_ID
-- to reduce overhead due to multiple calls to Self
procedure Defer_Abortion is
Self_ID : constant Task_ID := STPO.Self;
begin
Self_ID.Deferral_Level := Self_ID.Deferral_Level + 1;
end Defer_Abortion;
-----------------------
-- Do_Pending_Action --
-----------------------
-- Call only when holding no locks
procedure Do_Pending_Action (Self_ID : Task_ID) is
use type Ada.Exceptions.Exception_Id;
begin
pragma Assert (Self_ID = Self and then Self_ID.Deferral_Level = 0);
-- Needs loop to recheck for pending action in case a new one occurred
-- while we had abort deferred below.
loop
-- Temporarily defer abortion so that we can lock Self_ID.
Self_ID.Deferral_Level := Self_ID.Deferral_Level + 1;
Write_Lock (Self_ID);
Self_ID.Pending_Action := False;
Poll_Base_Priority_Change (Self_ID);
Unlock (Self_ID);
-- Restore the original Deferral value.
Self_ID.Deferral_Level := Self_ID.Deferral_Level - 1;
if not Self_ID.Pending_Action then
if Self_ID.Pending_ATC_Level < Self_ID.ATC_Nesting_Level then
if not Self_ID.Aborting then
Self_ID.Aborting := True;
pragma Debug
(Debug.Trace (Self_ID, "raise Abort_Signal", 'B'));
raise Standard'Abort_Signal;
pragma Assert (not Self_ID.ATC_Hack);
elsif Self_ID.ATC_Hack then
-- The solution really belongs in the Abort_Signal handler
-- for async. entry calls. The present hack is very
-- fragile. It relies that the very next point after
-- Exit_One_ATC_Level at which the task becomes abortable
-- will be the call to Undefer_Abort in the
-- Abort_Signal handler.
Self_ID.ATC_Hack := False;
pragma Debug
(Debug.Trace
(Self_ID, "raise Abort_Signal (ATC hack)", 'B'));
raise Standard'Abort_Signal;
end if;
end if;
return;
end if;
end loop;
end Do_Pending_Action;
-----------------------
-- Final_Task_Unlock --
-----------------------
-- This version is only for use in Terminate_Task, when the task
-- is relinquishing further rights to its own ATCB.
-- There is a very interesting potential race condition there, where
-- the old task may run concurrently with a new task that is allocated
-- the old tasks (now reused) ATCB. The critical thing here is to
-- not make any reference to the ATCB after the lock is released.
-- See also comments on Terminate_Task and Unlock.
procedure Final_Task_Unlock (Self_ID : Task_ID) is
begin
pragma Assert (Self_ID.Global_Task_Lock_Nesting = 1);
Unlock (Global_Task_Lock'Access);
end Final_Task_Unlock;
--------------
-- Init_RTS --
--------------
procedure Init_RTS is
Self_Id : Task_ID;
begin
-- Terminate run time (regular vs restricted) specific initialization
-- of the environment task.
Self_Id := Environment_Task;
Self_Id.Master_of_Task := Environment_Task_Level;
Self_Id.Master_Within := Self_Id.Master_of_Task + 1;
for L in Self_Id.Entry_Calls'Range loop
Self_Id.Entry_Calls (L).Self := Self_Id;
Self_Id.Entry_Calls (L).Level := L;
end loop;
Self_Id.Awake_Count := 1;
Self_Id.Alive_Count := 1;
Self_Id.Master_Within := Library_Task_Level;
-- Normally, a task starts out with internal master nesting level
-- one larger than external master nesting level. It is incremented
-- to one by Enter_Master, which is called in the task body only if
-- the compiler thinks the task may have dependent tasks. There is no
-- corresponding call to Enter_Master for the environment task, so we
-- would need to increment it to 2 here. Instead, we set it to 3.
-- By doing this we reserve the level 2 for server tasks of the runtime
-- system. The environment task does not need to wait for these server
-- Initialize lock used to implement mutual exclusion between all tasks
Initialize_Lock (Global_Task_Lock'Access, STPO.Global_Task_Level);
-- Initialize lock used to implement mutual exclusion in the package
-- System.Task_Attributes.
Initialize_Lock (System.Tasking.Task_Attributes.All_Attrs_L'Access,
All_Attrs_Level);
-- Notify that the tasking run time has been elaborated so that
-- the tasking version of the soft links can be used.
SSL.Abort_Defer := Defer_Abortion'Access;
SSL.Abort_Undefer := Undefer_Abortion'Access;
SSL.Update_Exception := Update_Exception'Access;
SSL.Lock_Task := Task_Lock'Access;
SSL.Unlock_Task := Task_Unlock'Access;
SSL.Get_Jmpbuf_Address := Get_Jmpbuf_Address'Access;
SSL.Set_Jmpbuf_Address := Set_Jmpbuf_Address'Access;
SSL.Get_Sec_Stack_Addr := Get_Sec_Stack_Addr'Access;
SSL.Set_Sec_Stack_Addr := Set_Sec_Stack_Addr'Access;
SSL.Get_Exc_Stack_Addr := Get_Exc_Stack_Addr'Access;
SSL.Set_Exc_Stack_Addr := Set_Exc_Stack_Addr'Access;
SSL.Get_Machine_State_Addr := Get_Machine_State_Addr'Access;
SSL.Set_Machine_State_Addr := Set_Machine_State_Addr'Access;
SSL.Get_Current_Excep := Get_Current_Excep'Access;
SSL.Timed_Delay := Timed_Delay_T'Access;
SSL.Check_Abort_Status := Check_Abort_Status'Access;
SSL.Get_Stack_Info := Get_Stack_Info'Access;
-- No need to create a new Secondary Stack, since we will use the
-- default one created in s-secsta.adb
SSL.Set_Sec_Stack_Addr (SSL.Get_Sec_Stack_Addr_NT);
SSL.Set_Exc_Stack_Addr (Null_Address, SSL.Get_Exc_Stack_Addr_NT);
SSL.Set_Jmpbuf_Address (SSL.Get_Jmpbuf_Address_NT);
SSL.Set_Machine_State_Addr (SSL.Get_Machine_State_Addr_NT);
-- Abortion is deferred in a new ATCB, so we need to undefer abortion
-- at this stage to make the environment task abortable.
Undefer_Abort (Environment_Task);
end Init_RTS;
---------------------------
-- Locked_Abort_To_Level--
---------------------------
-- Abort a task to the specified ATC nesting level.
-- Call this only with T locked.
-- An earlier version of this code contained a call to Wakeup. That
-- should not be necessary here, if Abort_Task is implemented correctly,
-- since Abort_Task should include the effect of Wakeup. However, the
-- above call was in earlier versions of this file, and at least for
-- some targets Abort_Task has not beek doing Wakeup. It should not
-- hurt to uncomment the above call, until the error is corrected for
-- all targets.
-- See extended comments in package body System.Tasking.Abortion
-- for the overall design of the implementation of task abort.
-- If the task is sleeping it will be in an abort-deferred region,
-- and will not have Abort_Signal raised by Abort_Task.
-- Such an "abort deferral" is just to protect the RTS internals,
-- and not necessarily required to enforce Ada semantics.
-- Abort_Task should wake the task up and let it decide if it wants
-- to complete the aborted construct immediately.
-- Note that the effect of the lowl-level Abort_Task is not persistent.
-- If the target task is not blocked, this wakeup will be missed.
-- We don't bother calling Abort_Task if this task is aborting itself,
-- since we are inside the RTS and have abort deferred. Similarly, We
-- don't bother to call Abort_Task if T is terminated, since there is
-- no need to abort a terminated task, and it could be dangerous to try
-- if the task has stopped executing.
-- Note that an earlier version of this code had some false reasoning
-- about being able to reliably wake up a task that had suspended on
-- a blocking system call that does not atomically relase the task's
-- lock (e.g., UNIX nanosleep, which we once thought could be used to
-- implement delays). That still left the possibility of missed
-- wakeups.
-- We cannot safely call Vulnerable_Complete_Activation here,
-- since that requires locking Self_ID.Parent. The anti-deadlock
-- lock ordering rules would then require us to release the lock
-- on Self_ID first, which would create a timing window for other
-- tasks to lock Self_ID. This is significant for tasks that may be
-- aborted before their execution can enter the task body, and so
-- they do not get a chance to call Complete_Task. The actual work
-- for this case is done in Terminate_Task.
procedure Locked_Abort_To_Level
(Self_ID : Task_ID;
T : Task_ID;
L : ATC_Level) is
begin
if not T.Aborting and then T /= Self_ID then
case T.Common.State is
when Unactivated | Terminated =>
pragma Assert (False);
null;
when Runnable =>
-- This is needed to cancel an asynchronous protected entry
-- call during a requeue with abort.
T.Entry_Calls
(T.ATC_Nesting_Level).Cancellation_Attempted := True;
when Interrupt_Server_Blocked_On_Event_Flag =>
null;
when Delay_Sleep |
Async_Select_Sleep |
Interrupt_Server_Idle_Sleep |
Interrupt_Server_Blocked_Interrupt_Sleep |
Timer_Server_Sleep |
AST_Server_Sleep =>
Wakeup (T, T.Common.State);
when Acceptor_Sleep =>
T.Open_Accepts := null;
Wakeup (T, T.Common.State);
when Entry_Caller_Sleep =>
T.Entry_Calls
(T.ATC_Nesting_Level).Cancellation_Attempted := True;
Wakeup (T, T.Common.State);
when Activator_Sleep |
Master_Completion_Sleep |
Master_Phase_2_Sleep |
Asynchronous_Hold =>
null;
end case;
end if;
if T.Pending_ATC_Level > L then
T.Pending_ATC_Level := L;
T.Pending_Action := True;
if L = 0 then
T.Callable := False;
end if;
-- This prevents aborted task from accepting calls
if T.Aborting then
-- The test above is just a heuristic, to reduce wasteful
-- calls to Abort_Task. We are holding T locked, and this
-- value will not be set to False except with T also locked,
-- inside Exit_One_ATC_Level, so we should not miss wakeups.
if T.Common.State = Acceptor_Sleep then
T.Open_Accepts := null;
end if;
elsif T /= Self_ID and then
(T.Common.State = Runnable
or else T.Common.State = Interrupt_Server_Blocked_On_Event_Flag)
-- The task is blocked on a system call waiting for the
-- completion event. In this case Abort_Task may need to take
-- special action in order to succeed. Example system: VMS.
then
Abort_Task (T);
end if;
end if;
end Locked_Abort_To_Level;
-------------------------------
-- Poll_Base_Priority_Change --
-------------------------------
-- Poll for pending base priority change and for held tasks.
-- This should always be called with (only) Self_ID locked.
-- It may temporarily release Self_ID's lock.
-- The call to Yield is to force enqueuing at the
-- tail of the dispatching queue.
-- We must unlock Self_ID for this to take effect,
-- since we are inheriting high active priority from the lock.
-- See also Poll_Base_Priority_Change_At_Entry_Call,
-- in package System.Tasking.Entry_Calls.
-- In this version, we check if the task is held too because
-- doing this only in Do_Pending_Action is not enough.
procedure Poll_Base_Priority_Change (Self_ID : Task_ID) is
begin
if Dynamic_Priority_Support
and then Self_ID.Pending_Priority_Change
then
-- Check for ceiling violations ???
Self_ID.Pending_Priority_Change := False;
if Self_ID.Common.Base_Priority = Self_ID.New_Base_Priority then
Unlock (Self_ID);
Yield;
Write_Lock (Self_ID);
elsif Self_ID.Common.Base_Priority < Self_ID.New_Base_Priority then
Self_ID.Common.Base_Priority := Self_ID.New_Base_Priority;
Set_Priority (Self_ID, Self_ID.Common.Base_Priority);
else
-- Lowering priority
Self_ID.Common.Base_Priority := Self_ID.New_Base_Priority;
Set_Priority (Self_ID, Self_ID.Common.Base_Priority);
Unlock (Self_ID);
Yield;
Write_Lock (Self_ID);
end if;
end if;
end Poll_Base_Priority_Change;
--------------------------------
-- Remove_From_All_Tasks_List --
--------------------------------
procedure Remove_From_All_Tasks_List (T : Task_ID) is
C : Task_ID;
Previous : Task_ID;
begin
pragma Debug
(Debug.Trace ("Remove_From_All_Tasks_List", 'C'));
Lock_All_Tasks_List;
Previous := Null_Task;
C := All_Tasks_List;
while C /= Null_Task loop
if C = T then
if Previous = Null_Task then
All_Tasks_List :=
All_Tasks_List.Common.All_Tasks_Link;
else
Previous.Common.All_Tasks_Link := C.Common.All_Tasks_Link;
end if;
Unlock_All_Tasks_List;
return;
end if;
Previous := C;
C := C.Common.All_Tasks_Link;
end loop;
pragma Assert (False);
end Remove_From_All_Tasks_List;
---------------
-- Task_Lock --
---------------
procedure Task_Lock is
T : Task_ID := STPO.Self;
begin
T.Global_Task_Lock_Nesting := T.Global_Task_Lock_Nesting + 1;
if T.Global_Task_Lock_Nesting = 1 then
Defer_Abort_Nestable (T);
Write_Lock (Global_Task_Lock'Access);
end if;
end Task_Lock;
procedure Task_Lock (Self_ID : Task_ID) is
begin
Self_ID.Global_Task_Lock_Nesting := Self_ID.Global_Task_Lock_Nesting + 1;
if Self_ID.Global_Task_Lock_Nesting = 1 then
Defer_Abort_Nestable (Self_ID);
Write_Lock (Global_Task_Lock'Access);
end if;
end Task_Lock;
-----------------
-- Task_Unlock --
-----------------
procedure Task_Unlock is
T : Task_ID := STPO.Self;
begin
pragma Assert (T.Global_Task_Lock_Nesting > 0);
T.Global_Task_Lock_Nesting := T.Global_Task_Lock_Nesting - 1;
if T.Global_Task_Lock_Nesting = 0 then
Unlock (Global_Task_Lock'Access);
Undefer_Abort_Nestable (T);
end if;
end Task_Unlock;
procedure Task_Unlock (Self_ID : Task_ID) is
begin
Self_ID.Global_Task_Lock_Nesting := Self_ID.Global_Task_Lock_Nesting - 1;
if Self_ID.Global_Task_Lock_Nesting = 0 then
Unlock (Global_Task_Lock'Access);
Undefer_Abort_Nestable (Self_ID);
end if;
end Task_Unlock;
-------------------
-- Undefer_Abort --
-------------------
-- Precondition : Self does not hold any locks!
-- Undefer_Abort is called on any abortion completion point (aka.
-- synchronization point). It performs the following actions if they
-- are pending: (1) change the base priority, (2) abort the task,
-- (3) raise a pending exception.
-- The priority change has to occur before abortion. Otherwise, it would
-- take effect no earlier than the next abortion completion point.
procedure Undefer_Abort (Self_ID : Task_ID) is
begin
pragma Assert (Self_ID.Deferral_Level = 1);
Self_ID.Deferral_Level := Self_ID.Deferral_Level - 1;
if Self_ID.Deferral_Level = 0 then
pragma Assert (Check_No_Locks (Self_ID));
if Self_ID.Pending_Action then
Do_Pending_Action (Self_ID);
end if;
end if;
end Undefer_Abort;
----------------------------
-- Undefer_Abort_Nestable --
----------------------------
-- An earlier version would re-defer abort if an abort is
-- in progress. Then, we modified the effect of the raise
-- statement so that it defers abort until control reaches a
-- handler. That was done to prevent "skipping over" a
-- handler if another asynchronous abort occurs during the
-- propagation of the abort to the handler.
-- There has been talk of reversing that decision, based on
-- a newer implementation of exception propagation. Care must
-- be taken to evaluate how such a change would interact with
-- the above code and all the places where abort-deferral is
-- used to bridge over critical transitions, such as entry to
-- the scope of a region with a finalizer and entry into the
-- body of an accept-procedure.
procedure Undefer_Abort_Nestable (Self_ID : Task_ID) is
begin
pragma Assert (Self_ID.Deferral_Level > 0);
Self_ID.Deferral_Level := Self_ID.Deferral_Level - 1;
if Self_ID.Deferral_Level = 0 then
pragma Assert (Check_No_Locks (Self_ID));
if Self_ID.Pending_Action then
Do_Pending_Action (Self_ID);
end if;
end if;
end Undefer_Abort_Nestable;
----------------------
-- Undefer_Abortion --
----------------------
-- Phase out RTS-internal use of Undefer_Abortion
-- to reduce overhead due to multiple calls to Self.
procedure Undefer_Abortion is
Self_ID : constant Task_ID := STPO.Self;
begin
pragma Assert (Self_ID.Deferral_Level > 0);
Self_ID.Deferral_Level := Self_ID.Deferral_Level - 1;
if Self_ID.Deferral_Level = 0 then
pragma Assert (Check_No_Locks (Self_ID));
if Self_ID.Pending_Action then
Do_Pending_Action (Self_ID);
end if;
end if;
end Undefer_Abortion;
----------------------
-- Update_Exception --
----------------------
-- Call only when holding no locks.
procedure Update_Exception
(X : AE.Exception_Occurrence := Current_Target_Exception)
is
Self_Id : constant Task_ID := Self;
use Ada.Exceptions;
begin
Save_Occurrence (Self_Id.Common.Compiler_Data.Current_Excep, X);
if Self_Id.Deferral_Level = 0 then
if Self_Id.Pending_Action then
Self_Id.Pending_Action := False;
Self_Id.Deferral_Level := Self_Id.Deferral_Level + 1;
Write_Lock (Self_Id);
Self_Id.Pending_Action := False;
Poll_Base_Priority_Change (Self_Id);
Unlock (Self_Id);
Self_Id.Deferral_Level := Self_Id.Deferral_Level - 1;
if Self_Id.Pending_ATC_Level < Self_Id.ATC_Nesting_Level then
if not Self_Id.Aborting then
Self_Id.Aborting := True;
raise Standard'Abort_Signal;
end if;
end if;
end if;
end if;
end Update_Exception;
--------------------------
-- Wakeup_Entry_Caller --
--------------------------
-- This is called at the end of service of an entry call, to abort the
-- caller if he is in an abortable part, and to wake up the caller if it
-- is on Entry_Caller_Sleep. It assumes that the call is already off-queue.
-- (This enforces the rule that a task must be off-queue if its state is
-- Done or Cancelled.) Call it holding the lock of Entry_Call.Self.
-- Timed_Call or Simple_Call:
-- The caller is waiting on Entry_Caller_Sleep, in
-- Wait_For_Completion, or Wait_For_Completion_With_Timeout.
-- Conditional_Call:
-- The caller might be in Wait_For_Completion,
-- waiting for a rendezvous (possibly requeued without abort)
-- to complete.
-- Asynchronous_Call:
-- The caller may be executing in the abortable part o
-- an async. select, or on a time delay,
-- if Entry_Call.State >= Was_Abortable.
procedure Wakeup_Entry_Caller
(Self_ID : Task_ID;
Entry_Call : Entry_Call_Link;
New_State : Entry_Call_State)
is
Caller : constant Task_ID := Entry_Call.Self;
begin
pragma Debug (Debug.Trace
(Self_ID, "Wakeup_Entry_Caller", Caller, 'E'));
pragma Assert (New_State = Done or else New_State = Cancelled);
pragma Assert
(Caller.Common.State /= Terminated
and then Caller.Common.State /= Unactivated);
Entry_Call.State := New_State;
if Entry_Call.Mode = Asynchronous_Call then
-- Abort the caller in his abortable part,
-- but do so only if call has been queued abortably
if Entry_Call.State >= Was_Abortable or else New_State = Done then
Locked_Abort_To_Level (Self_ID, Caller, Entry_Call.Level - 1);
end if;
elsif Caller.Common.State = Entry_Caller_Sleep then
Wakeup (Caller, Entry_Caller_Sleep);
end if;
end Wakeup_Entry_Caller;
----------------------
-- Soft-Link Bodies --
----------------------
function Get_Current_Excep return SSL.EOA is
Me : constant Task_ID := STPO.Self;
begin
return Me.Common.Compiler_Data.Current_Excep'Access;
end Get_Current_Excep;
function Get_Exc_Stack_Addr return Address is
Me : constant Task_ID := STPO.Self;
begin
return Me.Common.Compiler_Data.Exc_Stack_Addr;
end Get_Exc_Stack_Addr;
function Get_Jmpbuf_Address return Address is
Me : constant Task_ID := STPO.Self;
begin
return Me.Common.Compiler_Data.Jmpbuf_Address;
end Get_Jmpbuf_Address;
function Get_Machine_State_Addr return Address is
Me : constant Task_ID := STPO.Self;
begin
return Me.Common.Compiler_Data.Machine_State_Addr;
end Get_Machine_State_Addr;
function Get_Sec_Stack_Addr return Address is
Me : constant Task_ID := STPO.Self;
begin
return Me.Common.Compiler_Data.Sec_Stack_Addr;
end Get_Sec_Stack_Addr;
function Get_Stack_Info return Stack_Checking.Stack_Access is
Me : constant Task_ID := STPO.Self;
begin
return Me.Common.Compiler_Data.Pri_Stack_Info'Access;
end Get_Stack_Info;
procedure Set_Exc_Stack_Addr (Self_ID : Address; Addr : Address) is
Me : Task_ID := To_Task_Id (Self_ID);
begin
if Me = Null_Task then
Me := STPO.Self;
end if;
Me.Common.Compiler_Data.Exc_Stack_Addr := Addr;
end Set_Exc_Stack_Addr;
procedure Set_Jmpbuf_Address (Addr : Address) is
Me : Task_ID := STPO.Self;
begin
Me.Common.Compiler_Data.Jmpbuf_Address := Addr;
end Set_Jmpbuf_Address;
procedure Set_Machine_State_Addr (Addr : Address) is
Me : Task_ID := STPO.Self;
begin
Me.Common.Compiler_Data.Machine_State_Addr := Addr;
end Set_Machine_State_Addr;
procedure Set_Sec_Stack_Addr (Addr : Address) is
Me : Task_ID := STPO.Self;
begin
Me.Common.Compiler_Data.Sec_Stack_Addr := Addr;
end Set_Sec_Stack_Addr;
procedure Timed_Delay_T (Time : Duration; Mode : Integer) is
Self_ID : constant Task_ID := Self;
begin
STPO.Timed_Delay (Self_ID, Time, Mode);
end Timed_Delay_T;
------------------------
-- Soft-Link Dummies --
------------------------
-- These are dummies for subprograms that are only needed by certain
-- optional run-time system packages. If they are needed, the soft
-- links will be redirected to the real subprogram by elaboration of
-- the subprogram body where the real subprogram is declared.
procedure Finalize_Attributes (T : Task_ID) is
begin
null;
end Finalize_Attributes;
procedure Initialize_Attributes (T : Task_ID) is
begin
null;
end Initialize_Attributes;
begin
Init_RTS;
end System.Tasking.Initialization;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . T E X T _ I O . C O M P L E X _ I O --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2009, 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/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Ada.Numerics.Generic_Complex_Types;
generic
with package Complex_Types is new Ada.Numerics.Generic_Complex_Types (<>);
package Ada.Text_IO.Complex_IO is
Default_Fore : Field := 2;
Default_Aft : Field := Complex_Types.Real'Digits - 1;
Default_Exp : Field := 3;
procedure Get
(File : File_Type;
Item : out Complex_Types.Complex;
Width : Field := 0);
procedure Get
(Item : out Complex_Types.Complex;
Width : Field := 0);
procedure Put
(File : File_Type;
Item : Complex_Types.Complex;
Fore : Field := Default_Fore;
Aft : Field := Default_Aft;
Exp : Field := Default_Exp);
procedure Put
(Item : Complex_Types.Complex;
Fore : Field := Default_Fore;
Aft : Field := Default_Aft;
Exp : Field := Default_Exp);
procedure Get
(From : String;
Item : out Complex_Types.Complex;
Last : out Positive);
procedure Put
(To : out String;
Item : Complex_Types.Complex;
Aft : Field := Default_Aft;
Exp : Field := Default_Exp);
private
pragma Inline (Get);
pragma Inline (Put);
end Ada.Text_IO.Complex_IO;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Elements;
with AMF.Internals.Helpers;
with AMF.Internals.Tables.UML_Attributes;
with AMF.UML.Components;
with AMF.Visitors.Standard_Profile_L3_Iterators;
with AMF.Visitors.Standard_Profile_L3_Visitors;
package body AMF.Internals.Standard_Profile_L3_Build_Components is
------------------------
-- Get_Base_Component --
------------------------
overriding function Get_Base_Component
(Self : not null access constant Standard_Profile_L3_Build_Component_Proxy)
return AMF.UML.Components.UML_Component_Access is
begin
return
AMF.UML.Components.UML_Component_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Base_Component
(Self.Element)));
end Get_Base_Component;
------------------------
-- Set_Base_Component --
------------------------
overriding procedure Set_Base_Component
(Self : not null access Standard_Profile_L3_Build_Component_Proxy;
To : AMF.UML.Components.UML_Component_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Base_Component
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Base_Component;
-------------------
-- Enter_Element --
-------------------
overriding procedure Enter_Element
(Self : not null access constant Standard_Profile_L3_Build_Component_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.Standard_Profile_L3_Visitors.Standard_Profile_L3_Visitor'Class then
AMF.Visitors.Standard_Profile_L3_Visitors.Standard_Profile_L3_Visitor'Class
(Visitor).Enter_Build_Component
(AMF.Standard_Profile_L3.Build_Components.Standard_Profile_L3_Build_Component_Access (Self),
Control);
end if;
end Enter_Element;
-------------------
-- Leave_Element --
-------------------
overriding procedure Leave_Element
(Self : not null access constant Standard_Profile_L3_Build_Component_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.Standard_Profile_L3_Visitors.Standard_Profile_L3_Visitor'Class then
AMF.Visitors.Standard_Profile_L3_Visitors.Standard_Profile_L3_Visitor'Class
(Visitor).Leave_Build_Component
(AMF.Standard_Profile_L3.Build_Components.Standard_Profile_L3_Build_Component_Access (Self),
Control);
end if;
end Leave_Element;
-------------------
-- Visit_Element --
-------------------
overriding procedure Visit_Element
(Self : not null access constant Standard_Profile_L3_Build_Component_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Iterator in AMF.Visitors.Standard_Profile_L3_Iterators.Standard_Profile_L3_Iterator'Class then
AMF.Visitors.Standard_Profile_L3_Iterators.Standard_Profile_L3_Iterator'Class
(Iterator).Visit_Build_Component
(Visitor,
AMF.Standard_Profile_L3.Build_Components.Standard_Profile_L3_Build_Component_Access (Self),
Control);
end if;
end Visit_Element;
end AMF.Internals.Standard_Profile_L3_Build_Components;
|
-- C87B14A.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 OVERLOADING RESOLUTION USES THE RULE THAT:
--
-- IN SUBTYPE INDICATIONS WITH INDEX CONSTRAINTS, THE LOWER AND UPPER
-- BOUNDS MUST BE OF THE INDEX BASE TYPE.
--
-- TEST (A): INDEX CONSTRAINTS WITH OVERLOADED FUNCTIONS.
-- TRH 30 JUNE 82
WITH REPORT; USE REPORT;
PROCEDURE C87B14A IS
SUBTYPE WHOLE IS INTEGER RANGE 0 .. INTEGER'LAST;
SUBTYPE BASE10 IS INTEGER RANGE 0 .. 9;
TYPE LIST IS ARRAY (INTEGER RANGE <>) OF BOOLEAN;
TYPE GRID IS ARRAY (INTEGER RANGE <>, INTEGER RANGE <>) OF BOOLEAN;
FUNCTION F1 RETURN WHOLE IS
BEGIN
RETURN 1;
END F1;
FUNCTION F1 RETURN BOOLEAN IS
BEGIN
FAILED ("RESOLUTION INCORRECT - INDEX CONSTRAINTS " &
" IN SUBTYPE INDICATIONS");
RETURN TRUE;
END F1;
FUNCTION F2 RETURN BASE10 IS
BEGIN
RETURN 2;
END F2;
FUNCTION F2 RETURN FLOAT IS
BEGIN
FAILED ("RESOLUTION INCORRECT - INDEX CONSTRAINTS " &
" IN SUBTYPE INDICATIONS");
RETURN 2.0;
END F2;
BEGIN
TEST ("C87B14A","OVERLOADED EXPRESSIONS IN INDEX CONSTRAINTS " &
"OF SUBTYPE INDICATIONS");
DECLARE
SUBTYPE LIST1 IS LIST (1 .. F1);
SUBTYPE LIST2 IS LIST (F1 .. 1);
SUBTYPE LIST3 IS LIST (F2 .. F2);
SUBTYPE LIST4 IS LIST (F1 .. F2);
SUBTYPE GRID1 IS GRID (1 .. F1, F1 .. 1);
SUBTYPE GRID2 IS GRID (F1 .. 2, 2 .. F2);
SUBTYPE GRID3 IS GRID (F1 .. F1, F2 .. F2);
SUBTYPE GRID4 IS GRID (F1 .. F2, 1 .. 2);
BEGIN
NULL;
END;
RESULT;
END C87B14A;
|
with Memory.RAM; use Memory.RAM;
with Memory.SPM; use Memory.SPM;
package body Test.SPM is
procedure Run_Tests is
ram : constant RAM_Pointer := Create_RAM(latency => 100,
word_size => 8);
spm : SPM_Pointer := Create_SPM(ram, 1024, 1);
begin
Check(Get_Time(spm.all) = 0);
Check(Get_Writes(spm.all) = 0);
Check(Get_Cost(spm.all) = 1);
Read(spm.all, 0, 1);
Check(Get_Time(spm.all) = 1);
Check(Get_Writes(spm.all) = 0);
Read(spm.all, 1024 - 8, 8);
Check(Get_Time(spm.all) = 2);
Check(Get_Writes(spm.all) = 0);
Read(spm.all, 1024, 4);
Check(Get_Time(spm.all) = 102);
Check(Get_Writes(spm.all) = 0);
Read(spm.all, 1023, 2);
Check(Get_Time(spm.all) = 202);
Check(Get_Writes(spm.all) = 0);
Write(spm.all, 1024, 1);
Check(Get_Time(spm.all) = 302);
Check(Get_Writes(spm.all) = 1);
Write(spm.all, 8, 1);
Check(Get_Time(spm.all) = 303);
Check(Get_Writes(spm.all) = 1);
Write(spm.all, 8192, 16);
Check(Get_Time(spm.all) = 503);
Check(Get_Writes(spm.all) = 2);
Destroy(Memory_Pointer(spm));
end Run_Tests;
end Test.SPM;
|
------------------------------------------------------------------------------
-- Copyright (c) 2011, 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.Strings; use Ada.Strings;
procedure Natools.Chunked_Strings.Tests.CXA4011
(Report : in out Natools.Tests.Reporter'Class)
is
package NT renames Natools.Tests;
procedure Test (Test_Name : String;
C_1 : Character;
C_2 : Character;
Name_1 : String;
Name_2 : String);
procedure Test (Test_Name : String;
C_1 : Character;
C_2 : Character;
Name_1 : String;
Name_2 : String) is
begin
if C_1 = C_2 then
NT.Item (Report, Test_Name, NT.Success);
else
NT.Item (Report, Test_Name, NT.Fail);
NT.Info (Report, Name_1 & ": " & Character'Image (C_1));
NT.Info (Report, Name_2 & ": " & Character'Image (C_2));
end if;
end Test;
begin
NT.Section (Report, "Port of ACATS CXA4011");
declare
Cad_String : constant Chunked_String
:= To_Chunked_String ("cad");
Complete_String : constant Chunked_String
:= To_Chunked_String ("Incomplete")
& Ada.Strings.Space
& To_Chunked_String ("String");
Incomplete_String : Chunked_String
:= To_Chunked_String ("ncomplete Strin");
Incorrect_Spelling : Chunked_String
:= To_Chunked_String ("Guob Dai");
Magic_String : constant Chunked_String
:= To_Chunked_String ("abracadabra");
Incantation : Chunked_String := Magic_String;
A_Small_G : constant Character := 'g';
A_Small_D : constant Character := 'd';
ABCD_Set : constant Maps.Character_Set := Maps.To_Set ("abcd");
B_Set : constant Maps.Character_Set := Maps.To_Set ("b");
AB_Set : constant Maps.Character_Set
:= Maps."OR" (Maps.To_Set ('a'), B_Set);
Code_Map : constant Maps.Character_Mapping
:= Maps.To_Mapping (From => "abcd", To => "wxyz");
Reverse_Code_Map : constant Maps.Character_Mapping
:= Maps.To_Mapping (From => "wxyz", To => "abcd");
Non_Existent_Map : constant Maps.Character_Mapping
:= Maps.To_Mapping (From => "jkl", To => "mno");
Token_Start : array (1 .. 3) of Positive;
Token_End : array (1 .. 3) of Natural := (0, 0, 0);
Matching_Letters : Natural := 0;
Tests : array (1 .. 5) of Boolean;
begin
declare
Name : constant String := "Operator ""&""";
Tests : array (1 .. 3) of Boolean;
begin
Incomplete_String := 'I' & Incomplete_String;
Incomplete_String := Incomplete_String & A_Small_G;
if not Is_Valid (Incomplete_String)
or not Is_Valid (Complete_String)
then
NT.Item (Report, Name, NT.Error);
if not Is_Valid (Incomplete_String) then
NT.Info (Report, "Incomplete_String is invalid");
end if;
if not Is_Valid (Complete_String) then
NT.Info (Report, "Complete_String is invalid");
end if;
else
Tests (1) := Incomplete_String < Complete_String;
Tests (2) := Incomplete_String > Complete_String;
Tests (3) := Incomplete_String /= Complete_String;
if Tests (1) or Tests (2) or Tests (3) then
NT.Item (Report, Name, NT.Fail);
NT.Info (Report, "Incomplete_String: """
& To_String (Incomplete_String) & '"');
NT.Info (Report, "Complete_String: """
& To_String (Complete_String) & '"');
if Tests (1) then
NT.Info (Report, "-> Incomplete_String < Complete_String");
end if;
if Tests (2) then
NT.Info (Report, "-> Incomplete_String < Complete_String");
end if;
if Tests (3) then
NT.Info (Report, "-> Incomplete_String /= Complete_String");
end if;
else
NT.Item (Report, Name, NT.Success);
end if;
end if;
exception
when Error : others => NT.Report_Exception (Report, Name, Error);
end;
NT.Section (Report, "Function Element");
declare
Name : constant String := "Element of complete vs constant";
begin
Test (Name,
Element (Incomplete_String, Length (Incomplete_String)),
A_Small_G,
"Element (""" & To_String (Incomplete_String)
& ',' & Natural'Image (Length (Incomplete_String)) & ')',
"A_Small_G");
exception
when Error : others => NT.Report_Exception (Report, Name, Error);
end;
declare
Name : constant String := "Element of complete vs Element of Tail";
begin
Test (Name,
Element (Incomplete_String, 2),
Element (Tail (Incomplete_String, 2), 1),
"Element (""" & To_String (Incomplete_String) & ", 2)",
"Element (""" & To_String (Tail (Incomplete_String, 2))
& ", 1)");
exception
when Error : others => NT.Report_Exception (Report, Name, Error);
end;
declare
Name : constant String := "Element of Head vs Element of constant";
begin
Test (Name,
Element (Head (Incomplete_String, 4), 2),
Element (To_Chunked_String ("wnqz"), 2),
"Element (""" & To_String (Head (Incomplete_String, 4))
& ", 2)",
"Element (""wnqz"", 2)");
exception
when Error : others => NT.Report_Exception (Report, Name, Error);
end;
NT.End_Section (Report);
declare
Name : constant String := "Procedure Replace_Element";
begin
Replace_Element (Incorrect_Spelling, 2, 'o');
Replace_Element (Incorrect_Spelling,
Index (Incorrect_Spelling, B_Set),
A_Small_D);
Replace_Element (Source => Incorrect_Spelling,
Index => Length (Incorrect_Spelling),
By => 'y');
Test (Report, Name, Incorrect_Spelling, "Good Day");
exception
when Error : others => NT.Report_Exception (Report, Name, Error);
end;
-- Function Count
Matching_Letters := Count (Source => Magic_String,
Set => ABCD_Set);
NT.Item (Report, "Function Count with Set parameter",
NT.To_Result (Matching_Letters = 9));
if Matching_Letters /= 9 then
NT.Info
(Report,
"Count (""" & To_String (Magic_String) & """, ABCD_Set) "
& Natural'Image (Matching_Letters)
& " (should be 9)");
Dump (Report, Magic_String);
end if;
Tests (1) := Count (Magic_String, "ab")
= Count (Magic_String, "ac") + Count (Magic_String, "ad");
Tests (2) := Count (Magic_String, "ab") = 2;
NT.Item (Report, "Function Count with String parameter",
NT.To_Result (Tests (1) and Tests (2)));
if not Tests (1) or not Tests (2) then
NT.Info
(Report,
"Count (""" & To_String (Magic_String) & """, ""ab"") "
& Natural'Image (Count (Magic_String, "ab"))
& " (should be 2)");
NT.Info
(Report,
"Count (""" & To_String (Magic_String) & """, ""ac"") "
& Natural'Image (Count (Magic_String, "ac")));
NT.Info
(Report,
"Count (""" & To_String (Magic_String) & """, ""ad"") "
& Natural'Image (Count (Magic_String, "ad")));
end if;
-- Find_Token
Find_Token (Magic_String,
AB_Set,
Ada.Strings.Inside,
Token_Start (1),
Token_End (1));
Tests (1) := Natural (Token_Start (1)) = To_String (Magic_String)'First
and Token_End (1) = Index (Magic_String, B_Set);
Find_Token (Source => Magic_String,
Set => ABCD_Set,
Test => Ada.Strings.Outside,
First => Token_Start (2),
Last => Token_End (2));
Tests (2) := Natural (Token_Start (2)) = 3 and Token_End (2) = 3;
Find_Token (Magic_String,
Maps.To_Set (A_Small_G),
Ada.Strings.Inside,
First => Token_Start (3),
Last => Token_End (3));
Tests (3) := Token_Start (3) = To_String (Magic_String)'First
and Token_End (3) = 0;
NT.Item (Report, "Procedure Find_Token",
NT.To_Result (Tests (1) and Tests (2) and Tests (3)));
if not Tests (1) then
NT.Info (Report,
"Start: "
& Positive'Image (Token_Start (1)) & " /= "
& Positive'Image (To_String (Magic_String)'First)
& " (should be both 1)");
NT.Info (Report,
"End: "
& Natural'Image (Token_End (1)) & " /= "
& Natural'Image (Index (Magic_String, B_Set))
& " (should be both 2)");
end if;
if not Tests (2) then
NT.Info
(Report,
"Start: " & Positive'Image (Token_Start (2)) & " (should be 3)");
NT.Info
(Report,
"End: " & Natural'Image (Token_End (2)) & " (should be 3)");
end if;
if not Tests (3) then
NT.Info
(Report,
"Start: "
& Positive'Image (Token_Start (3)) & " /= "
& Positive'Image (To_String (Magic_String)'First)
& " (should be 1)");
NT.Info
(Report,
"End: "
& Natural'Image (Token_End (3)) & " (should be 0)");
end if;
-- Translate
Incantation := Translate (Magic_String, Code_Map);
Tests (1) := Incantation = To_Chunked_String ("wxrwywzwxrw");
NT.Item (Report, "Function Translate",
NT.To_Result (Tests (1)));
if not Tests (1) then
NT.Info (Report,
'"' & To_String (Incantation)
& """ /= ""wxrwywzwxrw""");
end if;
Translate (Incantation, Reverse_Code_Map);
Tests (1) := Incantation = Translate (Magic_String, Non_Existent_Map);
NT.Item
(Report, "Procedure Translate", NT.To_Result (Tests (1)));
if not Tests (1) then
NT.Info (Report,
'"' & To_String (Incantation) & """ /= """
& To_String (Translate (Magic_String,
Non_Existent_Map))
& """ (should be """
& To_String (Magic_String) & """)");
end if;
-- Trim
declare
XYZ_Set : constant Maps.Character_Set := Maps.To_Set ("xyz");
PQR_Set : constant Maps.Character_Set := Maps.To_Set ("pqr");
Pad : constant Chunked_String := To_Chunked_String ("Pad");
The_New_Ada : constant Chunked_String := To_Chunked_String ("Ada9X");
Space_Array : constant array (1 .. 4) of Chunked_String
:= (To_Chunked_String (" Pad "),
To_Chunked_String ("Pad "),
To_Chunked_String (" Pad"),
Pad);
String_Array : constant array (1 .. 5) of Chunked_String
:= (To_Chunked_String ("xyzxAda9Xpqr"),
To_Chunked_String ("Ada9Xqqrp"),
To_Chunked_String ("zxyxAda9Xqpqr"),
To_Chunked_String ("xxxyAda9X"),
The_New_Ada);
begin
for I in 1 .. 4 loop
Tests (I) := Trim (Space_Array (I), Ada.Strings.Both) = Pad;
end loop;
NT.Item
(Report, "Trim spaces",
NT.To_Result (Tests (1) and Tests (2)
and Tests (3) and Tests (4)));
for I in 1 .. 4 loop
if not Tests (I) then
NT.Info
(Report,
"Part" & Positive'Image (I) & ": Trim ("""
& To_String (Space_Array (I)) & """, Both) -> """
& To_String (Trim (Space_Array (I), Ada.Strings.Both))
& """ (shoud be """ & To_String (Pad) & '"');
end if;
end loop;
for I in 1 .. 5 loop
Tests (I) := Trim (String_Array (I),
Left => XYZ_Set,
Right => PQR_Set)
= The_New_Ada;
end loop;
NT.Item
(Report, "Trim sets of characters",
NT.To_Result (Tests (1) and Tests (2) and Tests (3)
and Tests (4) and Tests (5)));
for I in 1 .. 5 loop
if not Tests (I) then
NT.Info
(Report,
"Part" & Positive'Image (I) & ": Trim ("""
& To_String (String_Array (I))
& """, XYZ_Set, PQR_Set) -> """
& To_String (Trim (String_Array (I), XYZ_Set, PQR_Set))
& """ (shoud be """ & To_String (The_New_Ada) & '"');
end if;
end loop;
end;
-- Delete
Tests (1) := Delete (Source => Delete (Magic_String,
8, Length (Magic_String)),
From => To_String (Magic_String)'First,
Through => 4)
= Cad_String;
NT.Item (Report, "Function Delete",
NT.To_Result (Tests (1)));
if not Tests (1) then
NT.Info
(Report,
'"' & To_String (Delete (Delete (Magic_String,
8, Length (Magic_String)),
To_String (Magic_String)'First, 4))
& """ /= """ & To_String (Cad_String) & '"');
end if;
-- Constructors "*"
declare
SOS : Chunked_String;
Dot : constant Chunked_String := To_Chunked_String ("Dot_");
Dash : constant String := "Dash_";
Distress : constant Chunked_String
:= To_Chunked_String ("Dot_Dot_Dot_")
& To_Chunked_String ("Dash_Dash_Dash_")
& To_Chunked_String ("Dot_Dot_Dot");
Repeat : constant Natural := 3;
Separator : constant Character := '_';
Separator_Set : constant Maps.Character_Set
:= Maps.To_Set (Separator);
begin
SOS := Repeat * Dot;
SOS := SOS & Repeat * Dash & Repeat * Dot;
if Trim (SOS, Maps.Null_Set, Separator_Set) /= Distress then
NT.Item (Report, "Function ""*""", NT.Fail);
NT.Info
(Report,
'"' & To_String (Trim (SOS, Maps.Null_Set, Separator_Set))
& """ /= """ & To_String (Distress) & '"');
else
NT.Item (Report, "Function ""*""",
NT.Success);
end if;
end;
exception
when Error : others =>
NT.Report_Exception (Report, "Preparation", Error);
end;
NT.End_Section (Report);
end Natools.Chunked_Strings.Tests.CXA4011;
|
with NCurses; use NCurses;
with Board; use Board;
with Ada.exceptions;
with Ada.Text_IO;
with Ada.Strings.Fixed; use Ada.Strings.Fixed;
with GNAT.Command_Line; use GNAT.Command_Line;
with GNAT.Sockets; use GNAT.Sockets;
procedure Chess is
-- pragma Suppress(All_Checks);
type Game_Options is (None, Network, Local);
procedure Print_and_Clear (Item : in String) with Inline is
begin
Attribute_On(3);
Pretty_Print_Line_Window(Item);
Refresh;
delay 1.0;
Print_Board;
end Print_and_Clear;
Player_Select_Request : Cordinate_Type;
Player_Move_Request : Cordinate_Type;
Temp : Byte;
Game_Status : Game_Options := None;
Port : Port_Type := 0;
Is_Host : Boolean := False;
-- Address_String : String (1..15) := (others=>' ');
Address_String : String := "192.168.1.53";
Client : Socket_Type;
Address : Sock_Addr_Type;
Channel : Stream_Access;
Receiver : Socket_Type;
Connection : Socket_Type;
Initial_Move : Boolean := True;
begin
loop
case Getopt ("l n h p: i:") is
when 'l' =>
if Game_Status = None then
Game_Status := Local;
else
Ada.Text_IO.Put_Line("Conflicting agument : '-l'");
return;
end if;
when 'n' =>
if Game_Status = None then
Game_Status := Network;
else
Ada.Text_IO.Put_Line("Conflicting agument : '-n'");
return;
end if;
when 'p' =>
Port := Port_Type'Value(Parameter);
when 'h' =>
Is_Host := True;
when 'i' =>
Move(Parameter, Address_String);
when others =>
exit;
end case;
end loop;
if Game_Status = Network then
if (Port = 0 or Address_String = 15*' ') then
Ada.Text_IO.Put_Line("Argument Error");
return;
end if;
if Is_Host then
Create_Socket (Receiver);
Set_Socket_Option
(Socket => Receiver,
Option => (Name=>Reuse_Address, Enabled => True));
Bind_Socket
(Socket => Receiver,
Address => (Family=>Family_Inet,
Addr=>Inet_Addr (Address_String),
Port=>Port));
Listen_Socket (Socket => Receiver);
Accept_Socket
(Server => Receiver,
Socket => Connection,
Address => Address);
-- Put_Line("Client connected from " & Image (Address));
Channel := Stream (Connection);
else
Create_Socket (Client);
Address.Addr := Inet_Addr(Address_String);
Address.Port := Port;
Connect_Socket (Client, Address);
Channel := Stream (Client);
end if;
end if;
Init_Scr;
Start_Color_Init;
Reset_Board;
Print_Board;
Game_Loop : loop
if Initial_Move then
Initial_Move := False;
if Is_Host then
goto HOST_START;
end if;
end if;
Wait_For_Input : loop
begin
if Game_Status = Network then
Get_Variables(Channel);
end if;
Print_Board;
if Is_Winner in 1..2 then
Print_and_Clear("Player" & Integer'Image(Is_Winner) & " is the winner");
goto FINISH;
end if;
exit;
exception
when others => Print_Board;
end;
end loop Wait_For_Input;
<<HOST_START>>
Move_Loop : loop
begin
Temp := Get_Input;
if Temp /= 16#FF# then
Player_Select_Request := (Y=>Position(Temp / 2**4), X=>Position(Temp and 16#0F#));
Pretty_Print_Line_Window("Selected " &
Character'Val(Character'Pos('A') + Integer(Player_Select_Request.X)) &
" -" & Integer'Image(Integer(Player_Select_Request.Y) + 1));
Temp := Get_Input;
if Temp /= 16#FF# then
Player_Move_Request := (Y=>Position(Temp / 2**4), X=>Position(Temp and 16#0F#));
if Player_Select_Request /= Player_Move_Request then
Move(Player_Select_Request, Player_Move_Request);
End_Turn;
Print_Board;
if Game_Status = Network then
Set_Variables(Channel);
end if;
if Is_Winner in 1..2 then
Print_and_Clear("Player" & Integer'Image(Is_Winner) & " is the winner");
goto FINISH;
end if;
exit;
else
Print_and_Clear("Same Position");
end if;
else
Print_and_Clear("Input not in range");
end if;
else
Print_and_Clear("Input not in range");
end if;
exception
when Collision => Print_and_Clear("Piece in the way");
when Empty_Zone => Print_and_Clear("No piece there");
when Not_Allowed => Print_and_Clear("Move is illegal");
when Error : Others =>
End_Win;
Ada.Text_IO.Put("Unexpected Exception : " & Ada.Exceptions.Exception_Information(Error));
exit;
end;
end loop Move_Loop;
end loop Game_Loop;
<<FINISH>>
End_Win;
end Chess;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . T A S K I N G . U T I L I T I E S --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
-- This package provides RTS Internal Declarations.
-- These declarations are not part of the GNARLI
with Ada.Unchecked_Conversion;
with System.Task_Primitives;
package System.Tasking.Utilities is
function ATCB_To_Address is new
Ada.Unchecked_Conversion (Task_Id, System.Task_Primitives.Task_Address);
---------------------------------
-- Task_Stage Related routines --
---------------------------------
function Make_Independent return Boolean;
-- Move the current task to the outermost level (level 2) of the master
-- hierarchy of the environment task. That is one level further out
-- than normal tasks defined in library-level packages (level 3). The
-- environment task will wait for level 3 tasks to terminate normally,
-- then it will abort all the level 2 tasks. See Finalize_Global_Tasks
-- procedure for more information.
--
-- This is a dangerous operation, and should never be used on nested tasks
-- or tasks that depend on any objects that might be finalized earlier than
-- the termination of the environment task. It is primarily for internal
-- use by the GNARL, to prevent such internal server tasks from preventing
-- a partition from terminating.
--
-- Also note that the run time assumes that the parent of an independent
-- task is the environment task. If this is not the case, Make_Independent
-- will change the task's parent. This assumption is particularly
-- important for master level completion and for the computation of
-- Independent_Task_Count.
--
-- NOTE WELL: Make_Independent should be called before the task reaches its
-- "begin", like this:
--
-- task body Some_Independent_Task is
-- ...
-- Ignore : constant Boolean := Make_Independent;
-- ...
-- begin
--
-- The return value is meaningless; the only reason this is a function is
-- to get around the Ada limitation that makes a procedure call
-- syntactically illegal before the "begin".
--
-- Calling it before "begin" ensures that the call completes before the
-- activating task can proceed. This is important for preventing race
-- conditions. For example, if the environment task reaches
-- Finalize_Global_Tasks before some task has finished Make_Independent,
-- the program can hang.
--
-- Note also that if a package declares independent tasks, it should not
-- initialize its package-body data after "begin" of the package, because
-- that's where the tasks are activated. Initializing such data before the
-- task activation helps prevent the tasks from accessing uninitialized
-- data.
Independent_Task_Count : Natural := 0;
-- Number of independent tasks. This counter is incremented each time
-- Make_Independent is called. Note that if a server task terminates,
-- this counter will not be decremented. Since Make_Independent locks
-- the environment task (because every independent task depends on it),
-- this counter is protected by the environment task's lock.
---------------------------------
-- Task Abort Related Routines --
---------------------------------
procedure Cancel_Queued_Entry_Calls (T : Task_Id);
-- Cancel any entry calls queued on target task.
-- Call this while holding T's lock.
procedure Exit_One_ATC_Level (Self_ID : Task_Id);
pragma Inline (Exit_One_ATC_Level);
-- Call only with abort deferred and holding lock of Self_ID.
-- This is a bit of common code for all entry calls.
-- The effect is to exit one level of ATC nesting.
procedure Abort_One_Task (Self_ID : Task_Id; T : Task_Id);
-- Similar to Locked_Abort_To_Level (Self_ID, T, Level_Completed_Task),
-- but:
-- (1) caller should be holding no locks
-- (2) may be called for tasks that have not yet been activated
-- (3) always aborts whole task
procedure Abort_Tasks (Tasks : Task_List);
-- Abort_Tasks is called to initiate abort, however, the actual
-- aborting is done by aborted task by means of Abort_Handler
procedure Make_Passive (Self_ID : Task_Id; Task_Completed : Boolean);
-- Update counts to indicate current task is either terminated or
-- accepting on a terminate alternative. Call holding no locks except
-- Global_Task_Lock when calling from Terminate_Task.
end System.Tasking.Utilities;
|
--
-- Copyright (C) 2019, AdaCore
--
-- This spec has been automatically generated from FE310.svd
pragma Ada_2012;
pragma Style_Checks (Off);
with System;
package Interfaces.FE310.PLIC is
pragma Preelaborate;
pragma No_Elaboration_Code_All;
---------------
-- Registers --
---------------
subtype PRIORITY_PRIORITY_Field is Interfaces.FE310.UInt3;
-- PLIC Interrupt Priority Register.
type PRIORITY_Register is record
PRIORITY : PRIORITY_PRIORITY_Field := 16#0#;
-- unspecified
Reserved_3_31 : Interfaces.FE310.UInt29 := 16#0#;
end record
with Volatile, Size => 32,
Bit_Order => System.Low_Order_First;
for PRIORITY_Register use record
PRIORITY at 0 range 0 .. 2;
Reserved_3_31 at 0 range 3 .. 31;
end record;
-- PLIC Interrupt Priority Register.
type PRIORITY_Registers is array (0 .. 51) of PRIORITY_Register;
-- PENDING_INT array
type PENDING_INT_Field_Array is array (0 .. 31) of Boolean
with Component_Size => 1, Size => 32;
-- PLIC Interrupt Pending Register.
type PENDING_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- INT as a value
Val : Interfaces.FE310.UInt32;
when True =>
-- INT as an array
Arr : PENDING_INT_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile,
Bit_Order => System.Low_Order_First;
for PENDING_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-- PLIC Interrupt Pending Register.
type PENDING_Registers is array (0 .. 1) of PENDING_Register;
---------------------------------------
-- TARGET_ENABLE cluster's Registers --
---------------------------------------
-- ENABLE_TARGET_ENABLE_INT array
type ENABLE_TARGET_ENABLE_INT_Field_Array is array (0 .. 31) of Boolean
with Component_Size => 1, Size => 32;
-- PLIC Interrupt Enable Register.
type ENABLE_TARGET_ENABLE_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- INT as a value
Val : Interfaces.FE310.UInt32;
when True =>
-- INT as an array
Arr : ENABLE_TARGET_ENABLE_INT_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile,
Bit_Order => System.Low_Order_First;
for ENABLE_TARGET_ENABLE_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-- PLIC Interrupt Enable Register.
type ENABLE_TARGET_ENABLE_Registers is array (0 .. 1)
of ENABLE_TARGET_ENABLE_Register;
type TARGET_ENABLE_Cluster is record
-- PLIC Interrupt Enable Register.
ENABLE : aliased ENABLE_TARGET_ENABLE_Registers;
end record
with Size => 64;
for TARGET_ENABLE_Cluster use record
ENABLE at 0 range 0 .. 63;
end record;
--------------------------------
-- TARGET cluster's Registers --
--------------------------------
subtype THRESHOLD_TARGET_THRESHOLD_Field is Interfaces.FE310.UInt3;
-- PLIC Interrupt Priority Threshold Register.
type THRESHOLD_TARGET_Register is record
THRESHOLD : THRESHOLD_TARGET_THRESHOLD_Field := 16#0#;
-- unspecified
Reserved_3_31 : Interfaces.FE310.UInt29 := 16#0#;
end record
with Volatile, Size => 32,
Bit_Order => System.Low_Order_First;
for THRESHOLD_TARGET_Register use record
THRESHOLD at 0 range 0 .. 2;
Reserved_3_31 at 0 range 3 .. 31;
end record;
type TARGET_Disc is
(Laim,
Omplete);
type TARGET_Cluster
(Discriminent : TARGET_Disc := Laim)
is record
-- PLIC Interrupt Priority Threshold Register.
THRESHOLD : aliased THRESHOLD_TARGET_Register;
case Discriminent is
when Laim =>
-- PLIC Claim Register.
CLAIM : aliased Interfaces.FE310.UInt32;
when Omplete =>
-- PLIC Complete Register.
COMPLETE : aliased Interfaces.FE310.UInt32;
end case;
end record
with Unchecked_Union, Size => 64;
for TARGET_Cluster use record
THRESHOLD at 16#0# range 0 .. 31;
CLAIM at 16#4# range 0 .. 31;
COMPLETE at 16#4# range 0 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Platform-Level Interrupt Controller.
type PLIC_Peripheral is record
-- PLIC Interrupt Priority Register.
PRIORITY : aliased PRIORITY_Registers;
-- PLIC Interrupt Pending Register.
PENDING : aliased PENDING_Registers;
TARGET_ENABLE : aliased TARGET_ENABLE_Cluster;
TARGET : aliased TARGET_Cluster;
end record
with Volatile;
for PLIC_Peripheral use record
PRIORITY at 16#0# range 0 .. 1663;
PENDING at 16#1000# range 0 .. 63;
TARGET_ENABLE at 16#2080# range 0 .. 63;
TARGET at 16#201000# range 0 .. 63;
end record;
-- Platform-Level Interrupt Controller.
PLIC_Periph : aliased PLIC_Peripheral
with Import, Address => PLIC_Base;
end Interfaces.FE310.PLIC;
|
-----------------------------------------------------------------------
-- awa-images-servlets -- Serve files saved in the storage service
-- Copyright (C) 2016 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
package body AWA.Images.Servlets is
-- ------------------------------
-- Load the data content that correspond to the GET request and get the name as well
-- as mime-type and date.
-- ------------------------------
overriding
procedure Load (Server : in Image_Servlet;
Request : in out ASF.Requests.Request'Class;
Name : out Ada.Strings.Unbounded.Unbounded_String;
Mime : out Ada.Strings.Unbounded.Unbounded_String;
Date : out Ada.Calendar.Time;
Data : out ADO.Blob_Ref) is
begin
AWA.Storages.Servlets.Storage_Servlet (Server).Load (Request, Name, Mime, Date, Data);
Name := Ada.Strings.Unbounded.To_Unbounded_String ("");
end Load;
end AWA.Images.Servlets;
|
-----------------------------------------------------------------------
-- awa-mail-module-tests -- Unit tests for Mail module
-- Copyright (C) 2012, 2017 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Test_Caller;
with AWA.Events;
package body AWA.Mail.Modules.Tests is
package Caller is new Util.Test_Caller (Test, "Mail.Modules");
procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite) is
begin
Caller.Add_Test (Suite, "Test AWA.Mail.Module.Create_Message",
Test_Create_Message'Access);
Caller.Add_Test (Suite, "Test AWA.Mail.Module.Create_Message (CC:)",
Test_Cc_Message'Access);
Caller.Add_Test (Suite, "Test AWA.Mail.Module.Create_Message (BCC:)",
Test_Bcc_Message'Access);
end Add_Tests;
-- ------------------------------
-- Create an email message with the given template and verify its content.
-- ------------------------------
procedure Test_Mail_Message (T : in out Test;
Name : in String) is
use Util.Beans.Objects;
Mail : constant AWA.Mail.Modules.Mail_Module_Access := AWA.Mail.Modules.Get_Mail_Module;
Event : AWA.Events.Module_Event;
Props : Util.Beans.Objects.Maps.Map;
begin
T.Assert (Mail /= null, "There is no current mail module");
Props.Insert ("name", To_Object (String '("joe")));
Props.Insert ("email", To_Object (String '("joe.rogers@somewhere.org")));
Mail.Send_Mail (Template => Name,
Props => Props,
Content => Event);
end Test_Mail_Message;
-- ------------------------------
-- Create an email message and verify its content.
-- ------------------------------
procedure Test_Create_Message (T : in out Test) is
begin
T.Test_Mail_Message ("mail-info.html");
end Test_Create_Message;
-- ------------------------------
-- Create an email message with Cc: and verify its content.
-- ------------------------------
procedure Test_Cc_Message (T : in out Test) is
begin
T.Test_Mail_Message ("mail-cc.html");
end Test_Cc_Message;
-- ------------------------------
-- Create an email message with Bcc: and verify its content.
-- ------------------------------
procedure Test_Bcc_Message (T : in out Test) is
begin
T.Test_Mail_Message ("mail-bcc.html");
end Test_Bcc_Message;
end AWA.Mail.Modules.Tests;
|
-- 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 Tcl.Lists.Test_Data.Tests is
type Test is new GNATtest_Generated.GNATtest_Standard.Tcl.Lists.Test_Data
.Test with
null record;
procedure Test_Split_List_908c8a_2f822c(Gnattest_T: in out Test);
-- tcl-lists.ads:63:4:Split_List:Test_Split_List
procedure Test_Split_List_Variable_b25096_53b238(Gnattest_T: in out Test);
-- tcl-lists.ads:86:4:Split_List_Variable:Test_Split_List_Variable
procedure Test_Merge_List_46a169_8803ae(Gnattest_T: in out Test);
-- tcl-lists.ads:112:4:Merge_List:Test_Merge_List
end Tcl.Lists.Test_Data.Tests;
-- end read only
|
with Approximation, Ada.Numerics.Elementary_Functions;
procedure Test_Approximations is
package A is new Approximation(Float,
Ada.Numerics.Elementary_Functions.Sqrt,
Ada.Numerics.Elementary_Functions."**");
use type A.Number;
X1: A.Number := A.Approx(100.0, 1.1);
Y1: A.Number := A.Approx( 50.0, 1.2);
X2: A.Number := A.Approx(200.0, 2.2);
Y2: A.Number := A.Approx(100.0, 2.3);
begin
A.Put_Line("Distance:",
((X1-X2)**2 + (Y1 - Y2)**2)**0.5,
Sigma_Fore => 1);
end Test_Approximations;
|
<?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>AXIvideo2Mat</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>13</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>AXI_video_strm_V_data_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>AXI_video_strm.V.data.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>AXI_video_strm_V_keep_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>AXI_video_strm.V.keep.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>AXI_video_strm_V_strb_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>AXI_video_strm.V.strb.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_4">
<Value>
<Obj>
<type>1</type>
<id>4</id>
<name>AXI_video_strm_V_user_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>AXI_video_strm.V.user.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_5">
<Value>
<Obj>
<type>1</type>
<id>5</id>
<name>AXI_video_strm_V_last_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>AXI_video_strm.V.last.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_6">
<Value>
<Obj>
<type>1</type>
<id>6</id>
<name>AXI_video_strm_V_id_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>AXI_video_strm.V.id.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_7">
<Value>
<Obj>
<type>1</type>
<id>7</id>
<name>AXI_video_strm_V_dest_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>AXI_video_strm.V.dest.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_8">
<Value>
<Obj>
<type>1</type>
<id>8</id>
<name>img_rows_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>img.rows.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>12</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="_9">
<Value>
<Obj>
<type>1</type>
<id>9</id>
<name>img_cols_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>12</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="_10">
<Value>
<Obj>
<type>1</type>
<id>10</id>
<name>img_data_stream_0_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>img.data_stream[0].V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_11">
<Value>
<Obj>
<type>1</type>
<id>11</id>
<name>img_data_stream_1_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>img.data_stream[1].V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_12">
<Value>
<Obj>
<type>1</type>
<id>12</id>
<name>img_data_stream_2_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>img.data_stream[2].V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_13">
<Value>
<Obj>
<type>1</type>
<id>13</id>
<name>img_cols_V_out</name>
<fileName></fileName>
<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>12</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>56</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>img_cols_V_read</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>121</item>
<item>122</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.88</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>124</item>
<item>125</item>
<item>126</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.88</m_delay>
<m_topoIndex>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>img_rows_V_read</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>127</item>
<item>128</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.88</m_delay>
<m_topoIndex>3</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>rows_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>rows.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>129</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>cols_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>cols.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>130</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name></name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>63</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>C:\Users\byronxu\Documents\6.S193</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>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>63</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>131</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>empty</name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>68</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>68</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>34</bitwidth>
</Value>
<oprand_edges>
<count>8</count>
<item_version>0</item_version>
<item>133</item>
<item>134</item>
<item>135</item>
<item>136</item>
<item>137</item>
<item>138</item>
<item>139</item>
<item>140</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>7</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>tmp_data_V</name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>68</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>68</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.data.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>141</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>8</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>tmp_user_V</name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>68</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>68</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.user.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>142</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>9</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>tmp_last_V</name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>68</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>68</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.last.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>143</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>10</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name></name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>65</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>65</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>144</item>
<item>145</item>
<item>146</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>11</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>sof_1_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>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>148</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>12</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>47</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>2</count>
<item_version>0</item_version>
<item>150</item>
<item>151</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.76</m_delay>
<m_topoIndex>13</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name></name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>71</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>152</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.76</m_delay>
<m_topoIndex>14</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>axi_last_V1_i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>tmp.last.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>153</item>
<item>154</item>
<item>155</item>
<item>156</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>15</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>51</id>
<name>axi_data_V1_i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>tmp.data.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>157</item>
<item>158</item>
<item>159</item>
<item>160</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>16</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name>t_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>161</item>
<item>162</item>
<item>164</item>
<item>165</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>17</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>exitcond3_i</name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>71</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>167</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.47</m_delay>
<m_topoIndex>18</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>i_V</name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>168</item>
<item>169</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.55</m_delay>
<m_topoIndex>19</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name></name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>71</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>170</item>
<item>171</item>
<item>172</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>20</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name></name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>73</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>73</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>173</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.76</m_delay>
<m_topoIndex>21</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>62</id>
<name>eol</name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>100</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>100</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>eol</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>174</item>
<item>175</item>
<item>176</item>
<item>177</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>23</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>63</id>
<name>axi_data_V_1_i</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>24</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>178</item>
<item>179</item>
<item>180</item>
<item>181</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>24</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>64</id>
<name>t_V_4</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>j.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>182</item>
<item>183</item>
<item>184</item>
<item>185</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>25</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>65</id>
<name>eol_i</name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>187</item>
<item>188</item>
<item>189</item>
<item>190</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>26</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>66</id>
<name>exitcond_i</name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>73</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>73</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>191</item>
<item>192</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.47</m_delay>
<m_topoIndex>27</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>68</id>
<name>j_V</name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>73</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>73</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>j.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>193</item>
<item>194</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.55</m_delay>
<m_topoIndex>28</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>69</id>
<name></name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>73</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>73</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>195</item>
<item>196</item>
<item>197</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>29</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>71</id>
<name>sof_1_i_load</name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>199</item>
<item>677</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>30</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>75</id>
<name>brmerge_i</name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>200</item>
<item>201</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.97</m_delay>
<m_topoIndex>31</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>76</id>
<name></name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>202</item>
<item>203</item>
<item>204</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.76</m_delay>
<m_topoIndex>32</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>78</id>
<name>empty_70</name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>34</bitwidth>
</Value>
<oprand_edges>
<count>9</count>
<item_version>0</item_version>
<item>205</item>
<item>206</item>
<item>207</item>
<item>208</item>
<item>209</item>
<item>210</item>
<item>211</item>
<item>212</item>
<item>675</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>33</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>79</id>
<name>tmp_data_V_1</name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.data.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>213</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>34</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>80</id>
<name>tmp_last_V_1</name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.last.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>214</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>35</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>81</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>215</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.76</m_delay>
<m_topoIndex>36</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>83</id>
<name>axi_last_V_2_i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>axi.last.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>216</item>
<item>217</item>
<item>218</item>
<item>219</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>37</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>84</id>
<name>p_Val2_s</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>axi.data.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>220</item>
<item>221</item>
<item>222</item>
<item>223</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>38</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>85</id>
<name>tmp</name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_axi_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>AXIGetBitFields&lt;24, unsigned char&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_axi_io.h</first>
<second>AXIGetBitFields&lt;24, unsigned char&gt;</second>
</first>
<second>49</second>
</item>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>92</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>224</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>39</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_52">
<Value>
<Obj>
<type>0</type>
<id>86</id>
<name>tmp_20</name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_axi_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>AXIGetBitFields&lt;24, unsigned char&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_axi_io.h</first>
<second>AXIGetBitFields&lt;24, unsigned char&gt;</second>
</first>
<second>49</second>
</item>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>92</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>226</item>
<item>227</item>
<item>229</item>
<item>231</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>40</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_53">
<Value>
<Obj>
<type>0</type>
<id>87</id>
<name>tmp_21</name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_axi_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>AXIGetBitFields&lt;24, unsigned char&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_axi_io.h</first>
<second>AXIGetBitFields&lt;24, unsigned char&gt;</second>
</first>
<second>49</second>
</item>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>92</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>232</item>
<item>233</item>
<item>235</item>
<item>237</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>41</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_54">
<Value>
<Obj>
<type>0</type>
<id>90</id>
<name></name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_core.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>703</lineNumber>
<contextFuncName>write</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_core.h</first>
<second>operator&lt;&lt;</second>
</first>
<second>717</second>
</item>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_core.h</first>
<second>write</second>
</first>
<second>703</second>
</item>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>94</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>239</item>
<item>240</item>
<item>241</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.88</m_delay>
<m_topoIndex>43</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_55">
<Value>
<Obj>
<type>0</type>
<id>91</id>
<name></name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_core.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>703</lineNumber>
<contextFuncName>write</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_core.h</first>
<second>operator&lt;&lt;</second>
</first>
<second>717</second>
</item>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_core.h</first>
<second>write</second>
</first>
<second>703</second>
</item>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>94</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>242</item>
<item>243</item>
<item>244</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.88</m_delay>
<m_topoIndex>44</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_56">
<Value>
<Obj>
<type>0</type>
<id>92</id>
<name></name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_core.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>703</lineNumber>
<contextFuncName>write</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_core.h</first>
<second>operator&lt;&lt;</second>
</first>
<second>717</second>
</item>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_core.h</first>
<second>write</second>
</first>
<second>703</second>
</item>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>94</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>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.88</m_delay>
<m_topoIndex>45</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_57">
<Value>
<Obj>
<type>0</type>
<id>95</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>4</count>
<item_version>0</item_version>
<item>248</item>
<item>249</item>
<item>678</item>
<item>679</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.76</m_delay>
<m_topoIndex>42</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_58">
<Value>
<Obj>
<type>0</type>
<id>96</id>
<name></name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>73</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>73</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>250</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>46</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_59">
<Value>
<Obj>
<type>0</type>
<id>98</id>
<name></name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>96</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>96</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>198</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.76</m_delay>
<m_topoIndex>47</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_60">
<Value>
<Obj>
<type>0</type>
<id>100</id>
<name>axi_last_V_3_i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>axi.last.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>251</item>
<item>252</item>
<item>253</item>
<item>254</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>48</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_61">
<Value>
<Obj>
<type>0</type>
<id>101</id>
<name>axi_data_V_3_i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>axi.data.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>255</item>
<item>256</item>
<item>257</item>
<item>258</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>49</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_62">
<Value>
<Obj>
<type>0</type>
<id>102</id>
<name>eol_2_i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>axi.last.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>259</item>
<item>260</item>
<item>261</item>
<item>262</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>50</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_63">
<Value>
<Obj>
<type>0</type>
<id>103</id>
<name></name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>96</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>96</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>263</item>
<item>264</item>
<item>265</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>51</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_64">
<Value>
<Obj>
<type>0</type>
<id>109</id>
<name>empty_73</name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>100</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>100</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>34</bitwidth>
</Value>
<oprand_edges>
<count>9</count>
<item_version>0</item_version>
<item>266</item>
<item>267</item>
<item>268</item>
<item>269</item>
<item>270</item>
<item>271</item>
<item>272</item>
<item>273</item>
<item>676</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>52</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_65">
<Value>
<Obj>
<type>0</type>
<id>110</id>
<name>tmp_data_V_2</name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>100</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>100</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.data.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>274</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>53</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_66">
<Value>
<Obj>
<type>0</type>
<id>111</id>
<name>tmp_last_V_2</name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>100</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>100</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.last.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>275</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>54</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_67">
<Value>
<Obj>
<type>0</type>
<id>113</id>
<name></name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>103</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>103</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>276</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>55</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_68">
<Value>
<Obj>
<type>0</type>
<id>116</id>
<name></name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_io.h</first>
<second>AXIvideo2Mat&lt;24, 1080, 1920, 4096&gt;</second>
</first>
<second>71</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>277</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>56</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_69">
<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>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>22</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>8</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_70">
<Value>
<Obj>
<type>2</type>
<id>147</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="_71">
<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>1</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_72">
<Value>
<Obj>
<type>2</type>
<id>163</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_73">
<Value>
<Obj>
<type>2</type>
<id>186</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="_74">
<Value>
<Obj>
<type>2</type>
<id>228</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="_75">
<Value>
<Obj>
<type>2</type>
<id>230</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>15</content>
</item>
<item class_id_reference="16" object_id="_76">
<Value>
<Obj>
<type>2</type>
<id>234</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>16</content>
</item>
<item class_id_reference="16" object_id="_77">
<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>23</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>14</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_78">
<Obj>
<type>3</type>
<id>34</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>6</count>
<item_version>0</item_version>
<item>26</item>
<item>28</item>
<item>30</item>
<item>31</item>
<item>32</item>
<item>33</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_79">
<Obj>
<type>3</type>
<id>45</id>
<name>._crit_edge1.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>39</item>
<item>40</item>
<item>41</item>
<item>42</item>
<item>44</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_80">
<Obj>
<type>3</type>
<id>49</id>
<name>.preheader232.i.preheader</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>46</item>
<item>47</item>
<item>48</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_81">
<Obj>
<type>3</type>
<id>57</id>
<name>.preheader232.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>50</item>
<item>51</item>
<item>52</item>
<item>53</item>
<item>55</item>
<item>56</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_82">
<Obj>
<type>3</type>
<id>61</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>60</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_83">
<Obj>
<type>3</type>
<id>70</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>7</count>
<item_version>0</item_version>
<item>62</item>
<item>63</item>
<item>64</item>
<item>65</item>
<item>66</item>
<item>68</item>
<item>69</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_84">
<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>3</count>
<item_version>0</item_version>
<item>71</item>
<item>75</item>
<item>76</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_85">
<Obj>
<type>3</type>
<id>82</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>78</item>
<item>79</item>
<item>80</item>
<item>81</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_86">
<Obj>
<type>3</type>
<id>97</id>
<name>._crit_edge2.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>10</count>
<item_version>0</item_version>
<item>83</item>
<item>84</item>
<item>85</item>
<item>86</item>
<item>87</item>
<item>90</item>
<item>91</item>
<item>92</item>
<item>95</item>
<item>96</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_87">
<Obj>
<type>3</type>
<id>99</id>
<name>.preheader.i.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>1</count>
<item_version>0</item_version>
<item>98</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_88">
<Obj>
<type>3</type>
<id>104</id>
<name>.preheader.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>100</item>
<item>101</item>
<item>102</item>
<item>103</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_89">
<Obj>
<type>3</type>
<id>114</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>109</item>
<item>110</item>
<item>111</item>
<item>113</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_90">
<Obj>
<type>3</type>
<id>117</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>116</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_91">
<Obj>
<type>3</type>
<id>119</id>
<name>.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>118</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>157</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_92">
<id>122</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_93">
<id>125</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_94">
<id>126</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_95">
<id>128</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_96">
<id>129</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="_97">
<id>130</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_98">
<id>131</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="_99">
<id>134</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_100">
<id>135</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_101">
<id>136</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_102">
<id>137</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_103">
<id>138</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_104">
<id>139</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_105">
<id>140</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_106">
<id>141</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_107">
<id>142</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_108">
<id>143</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_109">
<id>144</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_110">
<id>145</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_111">
<id>146</id>
<edge_type>2</edge_type>
<source_obj>49</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_112">
<id>148</id>
<edge_type>1</edge_type>
<source_obj>147</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_113">
<id>150</id>
<edge_type>1</edge_type>
<source_obj>149</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_114">
<id>151</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_115">
<id>152</id>
<edge_type>2</edge_type>
<source_obj>57</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_116">
<id>153</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_117">
<id>154</id>
<edge_type>2</edge_type>
<source_obj>117</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_118">
<id>155</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_119">
<id>156</id>
<edge_type>2</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="_120">
<id>157</id>
<edge_type>1</edge_type>
<source_obj>101</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_121">
<id>158</id>
<edge_type>2</edge_type>
<source_obj>117</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_122">
<id>159</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_123">
<id>160</id>
<edge_type>2</edge_type>
<source_obj>49</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_124">
<id>161</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_125">
<id>162</id>
<edge_type>2</edge_type>
<source_obj>117</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_126">
<id>164</id>
<edge_type>1</edge_type>
<source_obj>163</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_127">
<id>165</id>
<edge_type>2</edge_type>
<source_obj>49</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_128">
<id>166</id>
<edge_type>1</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="_129">
<id>167</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_130">
<id>168</id>
<edge_type>1</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="_131">
<id>169</id>
<edge_type>1</edge_type>
<source_obj>147</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_132">
<id>170</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="_133">
<id>171</id>
<edge_type>2</edge_type>
<source_obj>61</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_134">
<id>172</id>
<edge_type>2</edge_type>
<source_obj>119</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_135">
<id>173</id>
<edge_type>2</edge_type>
<source_obj>70</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_136">
<id>174</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>62</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_137">
<id>175</id>
<edge_type>2</edge_type>
<source_obj>61</source_obj>
<sink_obj>62</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_138">
<id>176</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>62</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_139">
<id>177</id>
<edge_type>2</edge_type>
<source_obj>97</source_obj>
<sink_obj>62</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_140">
<id>178</id>
<edge_type>1</edge_type>
<source_obj>51</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_141">
<id>179</id>
<edge_type>2</edge_type>
<source_obj>61</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_142">
<id>180</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_143">
<id>181</id>
<edge_type>2</edge_type>
<source_obj>97</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_144">
<id>182</id>
<edge_type>1</edge_type>
<source_obj>163</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_145">
<id>183</id>
<edge_type>2</edge_type>
<source_obj>61</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_146">
<id>184</id>
<edge_type>1</edge_type>
<source_obj>68</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_147">
<id>185</id>
<edge_type>2</edge_type>
<source_obj>97</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_148">
<id>187</id>
<edge_type>1</edge_type>
<source_obj>186</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_149">
<id>188</id>
<edge_type>2</edge_type>
<source_obj>61</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_150">
<id>189</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_151">
<id>190</id>
<edge_type>2</edge_type>
<source_obj>97</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_152">
<id>191</id>
<edge_type>1</edge_type>
<source_obj>64</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_153">
<id>192</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_154">
<id>193</id>
<edge_type>1</edge_type>
<source_obj>64</source_obj>
<sink_obj>68</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_155">
<id>194</id>
<edge_type>1</edge_type>
<source_obj>147</source_obj>
<sink_obj>68</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_156">
<id>195</id>
<edge_type>1</edge_type>
<source_obj>66</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_157">
<id>196</id>
<edge_type>2</edge_type>
<source_obj>77</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_158">
<id>197</id>
<edge_type>2</edge_type>
<source_obj>99</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_159">
<id>198</id>
<edge_type>2</edge_type>
<source_obj>104</source_obj>
<sink_obj>98</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_160">
<id>199</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_161">
<id>200</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>75</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_162">
<id>201</id>
<edge_type>1</edge_type>
<source_obj>65</source_obj>
<sink_obj>75</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_163">
<id>202</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="_164">
<id>203</id>
<edge_type>2</edge_type>
<source_obj>82</source_obj>
<sink_obj>76</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_165">
<id>204</id>
<edge_type>2</edge_type>
<source_obj>97</source_obj>
<sink_obj>76</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_166">
<id>206</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_167">
<id>207</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_168">
<id>208</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_169">
<id>209</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_170">
<id>210</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_171">
<id>211</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_172">
<id>212</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_173">
<id>213</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="_174">
<id>214</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_175">
<id>215</id>
<edge_type>2</edge_type>
<source_obj>97</source_obj>
<sink_obj>81</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_176">
<id>216</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>83</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_177">
<id>217</id>
<edge_type>2</edge_type>
<source_obj>82</source_obj>
<sink_obj>83</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_178">
<id>218</id>
<edge_type>1</edge_type>
<source_obj>62</source_obj>
<sink_obj>83</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_179">
<id>219</id>
<edge_type>2</edge_type>
<source_obj>77</source_obj>
<sink_obj>83</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_180">
<id>220</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>84</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_181">
<id>221</id>
<edge_type>2</edge_type>
<source_obj>82</source_obj>
<sink_obj>84</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_182">
<id>222</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>84</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_183">
<id>223</id>
<edge_type>2</edge_type>
<source_obj>77</source_obj>
<sink_obj>84</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_184">
<id>224</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="_185">
<id>227</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_186">
<id>229</id>
<edge_type>1</edge_type>
<source_obj>228</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_187">
<id>231</id>
<edge_type>1</edge_type>
<source_obj>230</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_188">
<id>233</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_189">
<id>235</id>
<edge_type>1</edge_type>
<source_obj>234</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_190">
<id>237</id>
<edge_type>1</edge_type>
<source_obj>236</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_191">
<id>240</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_192">
<id>241</id>
<edge_type>1</edge_type>
<source_obj>85</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_193">
<id>243</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_194">
<id>244</id>
<edge_type>1</edge_type>
<source_obj>86</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_195">
<id>246</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>92</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_196">
<id>247</id>
<edge_type>1</edge_type>
<source_obj>87</source_obj>
<sink_obj>92</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_197">
<id>248</id>
<edge_type>1</edge_type>
<source_obj>186</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_198">
<id>249</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_199">
<id>250</id>
<edge_type>2</edge_type>
<source_obj>70</source_obj>
<sink_obj>96</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_200">
<id>251</id>
<edge_type>1</edge_type>
<source_obj>111</source_obj>
<sink_obj>100</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_201">
<id>252</id>
<edge_type>2</edge_type>
<source_obj>114</source_obj>
<sink_obj>100</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_202">
<id>253</id>
<edge_type>1</edge_type>
<source_obj>62</source_obj>
<sink_obj>100</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_203">
<id>254</id>
<edge_type>2</edge_type>
<source_obj>99</source_obj>
<sink_obj>100</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_204">
<id>255</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_205">
<id>256</id>
<edge_type>2</edge_type>
<source_obj>114</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_206">
<id>257</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_207">
<id>258</id>
<edge_type>2</edge_type>
<source_obj>99</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_208">
<id>259</id>
<edge_type>1</edge_type>
<source_obj>111</source_obj>
<sink_obj>102</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_209">
<id>260</id>
<edge_type>2</edge_type>
<source_obj>114</source_obj>
<sink_obj>102</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_210">
<id>261</id>
<edge_type>1</edge_type>
<source_obj>65</source_obj>
<sink_obj>102</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_211">
<id>262</id>
<edge_type>2</edge_type>
<source_obj>99</source_obj>
<sink_obj>102</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_212">
<id>263</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="_213">
<id>264</id>
<edge_type>2</edge_type>
<source_obj>114</source_obj>
<sink_obj>103</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_214">
<id>265</id>
<edge_type>2</edge_type>
<source_obj>117</source_obj>
<sink_obj>103</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_215">
<id>267</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>109</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_216">
<id>268</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>109</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_217">
<id>269</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>109</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_218">
<id>270</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>109</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_219">
<id>271</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>109</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_220">
<id>272</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>109</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_221">
<id>273</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>109</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_222">
<id>274</id>
<edge_type>1</edge_type>
<source_obj>109</source_obj>
<sink_obj>110</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_223">
<id>275</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="_224">
<id>276</id>
<edge_type>2</edge_type>
<source_obj>104</source_obj>
<sink_obj>113</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_225">
<id>277</id>
<edge_type>2</edge_type>
<source_obj>57</source_obj>
<sink_obj>116</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_226">
<id>657</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="_227">
<id>658</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_228">
<id>659</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_229">
<id>660</id>
<edge_type>2</edge_type>
<source_obj>49</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_230">
<id>661</id>
<edge_type>2</edge_type>
<source_obj>57</source_obj>
<sink_obj>119</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_231">
<id>662</id>
<edge_type>2</edge_type>
<source_obj>57</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_232">
<id>663</id>
<edge_type>2</edge_type>
<source_obj>61</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_233">
<id>664</id>
<edge_type>2</edge_type>
<source_obj>70</source_obj>
<sink_obj>99</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_234">
<id>665</id>
<edge_type>2</edge_type>
<source_obj>70</source_obj>
<sink_obj>77</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_235">
<id>666</id>
<edge_type>2</edge_type>
<source_obj>77</source_obj>
<sink_obj>97</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_236">
<id>667</id>
<edge_type>2</edge_type>
<source_obj>77</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_237">
<id>668</id>
<edge_type>2</edge_type>
<source_obj>82</source_obj>
<sink_obj>97</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_238">
<id>669</id>
<edge_type>2</edge_type>
<source_obj>97</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_239">
<id>670</id>
<edge_type>2</edge_type>
<source_obj>99</source_obj>
<sink_obj>104</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_240">
<id>671</id>
<edge_type>2</edge_type>
<source_obj>104</source_obj>
<sink_obj>117</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_241">
<id>672</id>
<edge_type>2</edge_type>
<source_obj>104</source_obj>
<sink_obj>114</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_242">
<id>673</id>
<edge_type>2</edge_type>
<source_obj>114</source_obj>
<sink_obj>104</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_243">
<id>674</id>
<edge_type>2</edge_type>
<source_obj>117</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_244">
<id>675</id>
<edge_type>4</edge_type>
<source_obj>39</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_245">
<id>676</id>
<edge_type>4</edge_type>
<source_obj>39</source_obj>
<sink_obj>109</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_246">
<id>677</id>
<edge_type>4</edge_type>
<source_obj>47</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_247">
<id>678</id>
<edge_type>4</edge_type>
<source_obj>47</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_248">
<id>679</id>
<edge_type>4</edge_type>
<source_obj>71</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>11</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_249">
<mId>1</mId>
<mTag>AXIvideo2Mat</mTag>
<mType>0</mType>
<sub_regions>
<count>5</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</item>
<item>5</item>
<item>11</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>3</mMinLatency>
<mMaxLatency>2079003</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_250">
<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>34</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_251">
<mId>3</mId>
<mTag>loop_wait_for_start</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</basic_blocks>
<mII>1</mII>
<mDepth>1</mDepth>
<mMinTripCount>0</mMinTripCount>
<mMaxTripCount>0</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_252">
<mId>4</mId>
<mTag>Region 1</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_253">
<mId>5</mId>
<mTag>loop_height</mTag>
<mType>1</mType>
<sub_regions>
<count>5</count>
<item_version>0</item_version>
<item>6</item>
<item>7</item>
<item>8</item>
<item>9</item>
<item>10</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>0</mMinTripCount>
<mMaxTripCount>1080</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>2079000</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_254">
<mId>6</mId>
<mTag>Region 2</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>57</item>
<item>61</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_255">
<mId>7</mId>
<mTag>loop_width</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>4</count>
<item_version>0</item_version>
<item>70</item>
<item>77</item>
<item>82</item>
<item>97</item>
</basic_blocks>
<mII>1</mII>
<mDepth>2</mDepth>
<mMinTripCount>0</mMinTripCount>
<mMaxTripCount>1920</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>1920</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_256">
<mId>8</mId>
<mTag>Region 3</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>99</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_257">
<mId>9</mId>
<mTag>loop_wait_for_eol</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>104</item>
<item>114</item>
</basic_blocks>
<mII>1</mII>
<mDepth>1</mDepth>
<mMinTripCount>0</mMinTripCount>
<mMaxTripCount>0</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_258">
<mId>10</mId>
<mTag>Region 4</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>117</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_259">
<mId>11</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>119</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="-1"></fsm>
<res class_id="-1"></res>
<node_label_latency class_id="26" tracking_level="0" version="0">
<count>56</count>
<item_version>0</item_version>
<item class_id="27" tracking_level="0" version="0">
<first>26</first>
<second class_id="28" tracking_level="0" version="0">
<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>32</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>62</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>63</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>65</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>66</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>69</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>71</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>75</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>76</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>78</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>79</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>80</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>81</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>83</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>84</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>85</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>86</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>87</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>90</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>91</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>92</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>95</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>96</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>98</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>100</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>101</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>102</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>103</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>109</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>110</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>111</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>113</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>116</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>118</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="29" tracking_level="0" version="0">
<count>14</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="0" version="0">
<first>34</first>
<second class_id="31" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>70</first>
<second>
<first>4</first>
<second>4</second>
</second>
</item>
<item>
<first>77</first>
<second>
<first>4</first>
<second>5</second>
</second>
</item>
<item>
<first>82</first>
<second>
<first>4</first>
<second>4</second>
</second>
</item>
<item>
<first>97</first>
<second>
<first>4</first>
<second>5</second>
</second>
</item>
<item>
<first>99</first>
<second>
<first>5</first>
<second>5</second>
</second>
</item>
<item>
<first>104</first>
<second>
<first>6</first>
<second>6</second>
</second>
</item>
<item>
<first>114</first>
<second>
<first>6</first>
<second>6</second>
</second>
</item>
<item>
<first>117</first>
<second>
<first>7</first>
<second>7</second>
</second>
</item>
<item>
<first>119</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="32" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="1" version="0" object_id="_260">
<region_name>loop_wait_for_start</region_name>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>45</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>1</pipe_depth>
</item>
<item class_id_reference="33" object_id="_261">
<region_name>loop_width</region_name>
<basic_blocks>
<count>4</count>
<item_version>0</item_version>
<item>70</item>
<item>77</item>
<item>82</item>
<item>97</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="33" object_id="_262">
<region_name>hls_label_6</region_name>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>97</item>
</basic_blocks>
<nodes>
<count>6</count>
<item_version>0</item_version>
<item>88</item>
<item>89</item>
<item>90</item>
<item>91</item>
<item>92</item>
<item>93</item>
</nodes>
<anchor_node>88</anchor_node>
<region_type>1</region_type>
<interval>0</interval>
<pipe_depth>0</pipe_depth>
</item>
<item class_id_reference="33" object_id="_263">
<region_name>loop_wait_for_eol</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>104</item>
<item>114</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>1</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="34" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="35" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="36" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_reg_nodes>
<dp_regname_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="37" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_port_io_nodes>
<port2core class_id="38" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Elements.Generic_Hash;
function AMF.DI.Diagram_Elements.Hash is
new AMF.Elements.Generic_Hash (DI_Diagram_Element, DI_Diagram_Element_Access);
|
procedure Diff (X, Y : in Natural; Z : out Natural) with
SPARK_Mode,
Depends => (Z => (X, Y))
is
begin
Z := X + X;
end Diff;
|
------------------------------------------------------------------------------
-- --
-- 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 <Juergen.Pfeifer@T-Online.de> 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;
|
-- public domain
with Ada.Calendar;
with Ada.Strings.Maps;
with Interfaces;
package String_Ops is
pragma Elaborate_Body;
type String_Pointer_Type is access String;
-- All the control characters plus space and non-breaking-space.
--
function Is_White_Space
(Char : in Character) return Boolean;
-- The Stuff routines place the source into the target,
-- padding with space or zeros.
--
procedure Stuff
(This : in String;
Into : out String);
procedure Stuff_Right
(This : in String;
Into : out String);
procedure Stuff_Number
(Number : in Integer;
Into : out String);
procedure Stuff_Hex
(Number : in Interfaces.Unsigned_32;
Into : out String);
-- Kills Ada comments from The_String
--
function Drop_Ada_Comments
(The_String : String) return String;
function Drop_Vole_Comments
(The_String : String) return String;
function Up_Case
(The_String : String) return String;
function Down_Case
(The_String : String) return String;
-- Discards blanks from the front and back end
-- of The_String.
--
function Trim_Blanks
(The_String : String) return String;
-- Many times the important string will be enclosed in
-- quotation marks or brackets. This trims one character
-- off of each end.
--
function Trim_One_From_Both_Ends(The_String : String) return String;
-- Discards non-printable characters from
-- The_String.
--
function Filter
(The_String : String) return String;
-- Return the first substring of Str (deliniated by white space).
-- Note: Str is assumed to not start with white space.
--
function First
(Str : in String) return String;
-- Return the second part of Str.
--
function Rest
(Str : in String) return String;
-- Return the second substring of Str (deliniated by white space).
--
function Second
(Str : in String) return String;
-- This returns the Rest of the Rest.
--
function Second_Rest
(Str : in String) return String;
-- Return the third substring of Str (deliniated by white space).
--
function Third
(Str : in String) return String;
-- Return the Nth substring of Str (deliniated by white space).
--
function Nth
(Str : in String;
N : in Positive) return String;
-- Return the Nth substring of Str (deliniated by Set).
--
function Nth
(Str : in String;
N : in Positive;
Set : in Ada.Strings.Maps.Character_Set) return String;
-- This is a caseless compare.
--
function Same(L, R : in String) return Boolean;
-- This is a specialized "=" for strings. For
-- the length of the smaller of Check and Master,
-- both strings must be the same.
--
function Conformance
(Master : in String;
Check : in String) return Boolean;
-- Returns a string in the form "16#0000_0000#"
--
function Integer_To_Hex_String
(Value : in Interfaces.Unsigned_32) return String;
-- These return images without leading blanks.
--
function Str
(Int : Integer) return String;
function Str
(Int : Interfaces.Unsigned_32) return String;
-- This "image" routine will only resort to scientific notation
-- if the number is too large or too small.
--
function Img
(Flt : Float) return String;
-- This will take a number (floating point or integer) from the
-- string and return a Float.
--
function Value
(Str : String) return Float;
function Img
(Int : Integer) return String renames Str;
function Value
(Str : String) return Integer;
function Long_Date
(Date : in Ada.Calendar.Time := Ada.Calendar.Clock) return String;
function Short_Date
(Date : in Ada.Calendar.Time := Ada.Calendar.Clock) return String;
function Date_As_Filename
(Date : in Ada.Calendar.Time := Ada.Calendar.Clock) return String;
function IP_Address
(Addr : Interfaces.Unsigned_32) return String;
-----------------------------------------------------------------------------
generic
type Selection_Type is (<>); -- enumeration
package Selection_Ops is
-- Return true if and only if Str passes "Conformance"
-- to the image of a member of Selection_Type.
-- Str is up cased before conformance checking.
--
function String_Matches
(Str : in String) return Boolean;
-- Return the number of "Conformance" matches.
--
function String_Matches
(Str : in String) return Natural;
-- Returns the first member of Selection_Type to
-- conform to Str, or the first member of
-- Selection_Type.
--
function To_Selection
(Str : in String) return Selection_Type;
end Selection_Ops;
end String_Ops;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with League.Holders.Generic_Enumerations;
package AMF.UMLDI.Holders.UML_Association_Or_Connector_Or_Link_Shape_Kinds is
new League.Holders.Generic_Enumerations
(AMF.UMLDI.UMLDI_UML_Association_Or_Connector_Or_Link_Shape_Kind);
pragma Preelaborate (AMF.UMLDI.Holders.UML_Association_Or_Connector_Or_Link_Shape_Kinds);
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 2 3 --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
-- Handling of packed arrays with Component_Size = 23
package System.Pack_23 is
pragma Preelaborate;
Bits : constant := 23;
type Bits_23 is mod 2 ** Bits;
for Bits_23'Size use Bits;
function Get_23 (Arr : System.Address; N : Natural) return Bits_23;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned.
procedure Set_23 (Arr : System.Address; N : Natural; E : Bits_23);
-- 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_23;
|
-- Copyright 2019-2020 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with System;
with Pck; use Pck;
procedure Foo is
type Key is (Alpha, Omega);
type Inner(Disc : Key := Omega) is record
case Disc is
when Alpha =>
Small : Integer range 0..255;
when others =>
Large : Integer range 255..510;
end case;
end record;
pragma Unchecked_Union (Inner);
type Outer(Disc : Key := Alpha) is record
case Disc is
when Alpha =>
Field_One : Integer range 0..255;
when others =>
Field_Two : Integer range 255..510;
end case;
end record;
pragma Unchecked_Union (Outer);
type Pair is record
Pone : Inner;
Ptwo : Outer;
end record;
Value : Pair;
begin
Do_Nothing (Value'Address); -- BREAK
end Foo;
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2016-2018, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with Ada.Interrupts;
package STM32.DMA.Interrupts is
protected type DMA_Interrupt_Controller
(Controller : not null access DMA_Controller;
Stream : DMA_Stream_Selector;
ID : Ada.Interrupts.Interrupt_ID;
Priority : System.Interrupt_Priority)
is
pragma Interrupt_Priority (Priority);
procedure Start_Transfer (Source : Address;
Destination : Address;
Data_Count : UInt16);
procedure Abort_Transfer (Result : out DMA_Error_Code);
procedure Clear_Transfer_State;
function Buffer_Error return Boolean;
entry Wait_For_Completion (Status : out DMA_Error_Code);
private
procedure Interrupt_Handler;
pragma Attach_Handler (Interrupt_Handler, ID);
No_Transfer_In_Progess : Boolean := True;
Last_Status : DMA_Error_Code := DMA_No_Error;
Had_Buffer_Error : Boolean := False;
end DMA_Interrupt_Controller;
type DMA_Interrupt_Controller_Access is access all DMA_Interrupt_Controller;
end STM32.DMA.Interrupts;
|
-- convert UCD/UnicodeData.txt, UCD/CompositionExclusions.txt
-- bin/ucd_normalization -r $UCD/UnicodeData.txt $UCD/CompositionExclusions.txt > ../source/strings/a-ucdnor.ads
-- bin/ucd_normalization -u $UCD/UnicodeData.txt $UCD/CompositionExclusions.txt > ../source/strings/a-ucnoun.ads
with Ada.Command_Line; use Ada.Command_Line;
with Ada.Containers.Ordered_Maps;
with Ada.Containers.Ordered_Sets;
with Ada.Integer_Text_IO; use Ada.Integer_Text_IO;
with Ada.Strings; use Ada.Strings;
with Ada.Strings.Fixed; use Ada.Strings.Fixed;
with Ada.Strings.Maps.Constants; use Ada.Strings.Maps.Constants;
with Ada.Strings.Wide_Wide_Unbounded; use Ada.Strings.Wide_Wide_Unbounded;
with Ada.Text_IO; use Ada.Text_IO;
procedure ucd_normalization is
function Value (S : String) return Wide_Wide_Character is
Img : constant String := "Hex_" & (1 .. 8 - S'Length => '0') & S;
begin
return Wide_Wide_Character'Value (Img);
end Value;
procedure Put_16 (Item : Integer) is
begin
if Item >= 16#10000# then
Put (Item, Width => 1, Base => 16);
else
declare
S : String (1 .. 8); -- "16#XXXX#"
begin
Put (S, Item, Base => 16);
S (1) := '1';
S (2) := '6';
S (3) := '#';
for I in reverse 4 .. 6 loop
if S (I) = '#' then
S (4 .. I) := (others => '0');
exit;
end if;
end loop;
Put (S);
end;
end if;
end Put_16;
function NFS_Exclusion (C : Wide_Wide_Character) return Boolean is
begin
case Wide_Wide_Character'Pos (C) is
when 16#2000# .. 16#2FFF#
| 16#F900# .. 16#FAFF#
| 16#2F800# .. 16#2FAFF# =>
return True;
when others =>
return False;
end case;
end NFS_Exclusion;
package Decomposite_Maps is new Ada.Containers.Ordered_Maps (
Wide_Wide_Character,
Ada.Strings.Wide_Wide_Unbounded.Unbounded_Wide_Wide_String);
use Decomposite_Maps;
package WWC_Sets is new Ada.Containers.Ordered_Sets (
Wide_Wide_Character);
use WWC_Sets;
NFD : Decomposite_Maps.Map;
Exclusions : WWC_Sets.Set;
type Kind_Type is (Decomposition, Excluded, Singleton);
type Bit is (In_16, In_32);
function Get_Bit (C : Wide_Wide_Character) return Bit is
begin
if C > Wide_Wide_Character'Val (16#FFFF#) then
return In_32;
else
return In_16;
end if;
end Get_Bit;
function Get_Bit (S : Ada.Strings.Wide_Wide_Unbounded.Unbounded_Wide_Wide_String) return Bit is
begin
for I in 1 .. Length (S) loop
if Get_Bit (Element (S, I)) = In_32 then
return In_32;
end if;
end loop;
return In_16;
end Get_Bit;
type Normalization is (D, C);
Total_Num : array (Boolean, Normalization) of Natural;
Num : array (Boolean, Kind_Type, Bit) of Natural;
type Output_Kind is (Reversible, Unreversible);
Output : Output_Kind;
begin
if Argument (1) = "-r" then
Output := Reversible;
elsif Argument (1) = "-u" then
Output := Unreversible;
else
raise Data_Error with "-r or -u";
end if;
declare
File : Ada.Text_IO.File_Type;
begin
Open (File, In_File, Argument (2));
while not End_Of_File (File) loop
declare
Line : constant String := Get_Line (File);
type Range_Type is record
First : Positive;
Last : Natural;
end record;
Fields : array (1 .. 14) of Range_Type;
P : Positive := Line'First;
N : Natural;
Token_First : Positive;
Token_Last : Natural;
Code : Wide_Wide_Character;
Alt : Ada.Strings.Wide_Wide_Unbounded.Unbounded_Wide_Wide_String;
begin
for I in Fields'Range loop
N := P;
while N <= Line'Last and then Line (N) /= ';' loop
N := N + 1;
end loop;
if (N <= Line'Last) /= (I < Field'Last) then
raise Data_Error with Line & " -- 2A";
end if;
Fields (I).First := P;
Fields (I).Last := N - 1;
P := N + 1; -- skip ';'
end loop;
Code := Value (Line (Fields (1).First .. Fields (1).Last));
if Fields (6).First <= Fields (6).Last then -- normalization
if Line (Fields (6).First) = '<' then
null; -- skip NFKD
else -- NFD
Alt := Null_Unbounded_Wide_Wide_String;
P := Fields (6).First;
while P <= Fields (6).Last loop
Find_Token (
Line (P .. Fields (6).Last),
Hexadecimal_Digit_Set,
Inside,
Token_First,
Token_Last);
if Token_First /= P then
raise Data_Error with Line & " -- 2B";
end if;
Append (Alt, Value (Line (Token_First .. Token_Last)));
P := Token_Last + 1;
exit when P > Fields (6).Last;
N := Index_Non_Blank (Line (P .. Fields (6).Last));
if N = 0 then
raise Data_Error with Line & " -- 2C";
end if;
P := N;
end loop;
Insert (NFD, Code, Alt);
end if;
end if;
end;
end loop;
Close (File);
end;
declare
I : Decomposite_Maps.Cursor := First (NFD);
begin
while Has_Element (I) loop
if not NFS_Exclusion (Key (I)) then
declare
J : Decomposite_Maps.Cursor := Next (I);
begin
while Has_Element (J) loop
if Element (I) = Element (J) then
raise Data_Error with "dup";
end if;
J := Next (J);
end loop;
end;
end if;
I := Next (I);
end loop;
end;
declare
File : Ada.Text_IO.File_Type;
begin
Open (File, In_File, Argument (3));
while not End_Of_File (File) loop
declare
Line : constant String := Get_Line (File);
P : Positive := Line'First;
Token_First : Positive;
Token_Last : Natural;
First : Wide_Wide_Character;
begin
if Line'Length = 0 or else Line (P) = '#' then
null; -- comment
else
Find_Token (
Line (P .. Line'Last),
Hexadecimal_Digit_Set,
Inside,
Token_First,
Token_Last);
if Token_First /= P then
raise Data_Error with Line & " -- 3A";
end if;
First := Value (Line (Token_First .. Token_Last));
P := Token_Last + 1;
if Line (P) = '.' then
raise Data_Error with Line & " -- 3B";
end if;
if not Contains (NFD, First) then
raise Data_Error with Line & " -- 3C";
end if;
Insert (Exclusions, First);
end if;
end;
end loop;
Close (File);
end;
-- # (4) Non-Starter Decompositions
-- # 0344 COMBINING GREEK DIALYTIKA TONOS
-- # 0F73 TIBETAN VOWEL SIGN II
-- # 0F75 TIBETAN VOWEL SIGN UU
-- # 0F81 TIBETAN VOWEL SIGN REVERSED II
Insert (Exclusions, Wide_Wide_Character'Val (16#0344#));
Insert (Exclusions, Wide_Wide_Character'Val (16#0F73#));
Insert (Exclusions, Wide_Wide_Character'Val (16#0F75#));
Insert (Exclusions, Wide_Wide_Character'Val (16#0F81#));
-- count
for NFSE in Boolean loop
for K in Kind_Type loop
for B in Bit loop
Num (NFSE, K, B) := 0;
end loop;
end loop;
for N in Normalization loop
Total_Num (NFSE, N) := 0;
end loop;
end loop;
declare
I : Decomposite_Maps.Cursor := First (NFD);
begin
while Has_Element (I) loop
declare
NFSE : Boolean := NFS_Exclusion (Key (I));
B : Bit := Bit'Max (Get_Bit (Key (I)), Get_Bit (Element (I)));
K : Kind_Type;
begin
if Contains (Exclusions, Key (I)) then
K := Excluded;
elsif Length (Element (I)) > 1 then
K := Decomposition;
Total_Num (NFSE, C) := Total_Num (NFSE, C) + 1;
else
K := Singleton;
end if;
Num (NFSE, K, B) := Num (NFSE, K, B) + 1;
Total_Num (NFSE, D) := Total_Num (NFSE, D) + 1;
end;
I := Next (I);
end loop;
end;
-- output the Ada spec
case Output is
when Reversible =>
Put_Line ("pragma License (Unrestricted);");
Put_Line ("-- implementation unit,");
Put_Line ("-- translated from UnicodeData.txt (6), CompositionExclusions.txt");
Put_Line ("package Ada.UCD.Normalization is");
Put_Line (" pragma Pure;");
New_Line;
Put_Line (" -- excluding U+2000..U+2FFF, U+F900..U+FAFF, and U+2F800..U+2FAFF");
New_Line;
Put (" NFD_Total : constant := ");
Put (Total_Num (False, D), Width => 1);
Put (";");
New_Line;
Put (" NFC_Total : constant := ");
Put (Total_Num (False, C), Width => 1);
Put (";");
New_Line;
New_Line;
when Unreversible =>
Put_Line ("pragma License (Unrestricted);");
Put_Line ("-- implementation unit,");
Put_Line ("-- translated from UnicodeData.txt (6), CompositionExclusions.txt");
Put_Line ("package Ada.UCD.Normalization.Unreversible is");
Put_Line (" pragma Pure;");
New_Line;
Put_Line (" -- including U+2000..U+2FFF, U+F900..U+FAFF, and U+2F800..U+2FAFF");
New_Line;
Put (" NFD_Unreversible_Total : constant := ");
Put (Total_Num (True, D), Width => 1);
Put (";");
New_Line;
Put (" NFC_Unreversible_Total : constant := ");
Put (Total_Num (True, C), Width => 1);
Put (";");
New_Line;
New_Line;
end case;
declare
NFSE : constant Boolean := Output = Unreversible;
begin
for K in Kind_Type loop
for B in Bit loop
if Num (NFSE, K, B) /= 0 then
Put (" NFD_");
if NFSE then
Put ("Unreversible_");
end if;
case K is
when Decomposition => Put ("D_");
when Excluded => Put ("E_");
when Singleton => Put ("S_");
end case;
Put ("Table_");
case B is
when In_16 => Put ("XXXX");
when In_32 => Put ("XXXXXXXX");
end case;
Put (" : constant Map_");
case B is
when In_16 => Put ("16");
when In_32 => Put ("32");
end case;
Put ("x");
case K is
when Decomposition | Excluded => Put ("2");
when Singleton => Put ("1");
end case;
Put ("_Type (1 .. ");
Put (Num (NFSE, K, B), Width => 1);
Put (") := (");
New_Line;
declare
I : Decomposite_Maps.Cursor := First (NFD);
Second : Boolean := False;
begin
while Has_Element (I) loop
declare
Item_NFSE : Boolean := NFS_Exclusion (Key (I));
Item_B : Bit := Bit'Max (Get_Bit (Key (I)), Get_Bit (Element (I)));
Item_K : Kind_Type;
begin
if Contains (Exclusions, Key (I)) then
Item_K := Excluded;
elsif Length (Element (I)) > 1 then
Item_K := Decomposition;
else
Item_K := Singleton;
end if;
if Item_NFSE = NFSE
and then Item_K = K
and then Item_B = B
then
if Second then
Put (",");
New_Line;
end if;
Put (" ");
if Num (NFSE, K, B) = 1 then
Put ("1 => ");
end if;
Put ("(");
Put_16 (Wide_Wide_Character'Pos (Key (I)));
Put (", ");
if K = Singleton then
Put_16 (
Wide_Wide_Character'Pos (
Element (Element (I), 1)));
else
declare
E : Ada.Strings.Wide_Wide_Unbounded.Unbounded_Wide_Wide_String
renames Element (I);
begin
Put ("(");
for EI in 1 .. Length (E) loop
if EI > 1 then
Put (", ");
end if;
Put_16 (
Wide_Wide_Character'Pos (
Element (E, EI)));
end loop;
Put (")");
end;
end if;
Put (")");
Second := True;
end if;
end;
I := Next (I);
end loop;
Put (");");
New_Line;
end;
New_Line;
end if;
end loop;
end loop;
end;
case Output is
when Reversible =>
Put_Line ("end Ada.UCD.Normalization;");
when Unreversible =>
Put_Line ("end Ada.UCD.Normalization.Unreversible;");
end case;
end ucd_normalization;
|
-- 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 Statistics.Test_Data.Tests is
type Test is new GNATtest_Generated.GNATtest_Standard.Statistics.Test_Data
.Test with
null record;
procedure Test_UpdateDestroyedShips_708ec3_001497(Gnattest_T: in out Test);
-- statistics.ads:92:4:UpdateDestroyedShips:Test_UpdateDestroyedShips
procedure Test_ClearGameStats_97edec_dc3936(Gnattest_T: in out Test);
-- statistics.ads:101:4:ClearGameStats:Test_ClearGameStats
procedure Test_UpdateFinishedGoals_9c0615_51796d(Gnattest_T: in out Test);
-- statistics.ads:112:4:UpdateFinishedGoals:Test_UpdateFinishedGoals
procedure Test_UpdateFinishedMissions_cda9ad_a624ba
(Gnattest_T: in out Test);
-- statistics.ads:123:4:UpdateFinishedMissions:Test_UpdateFinishedMissions
procedure Test_UpdateCraftingOrders_24cc96_7fc6ac(Gnattest_T: in out Test);
-- statistics.ads:134:4:UpdateCraftingOrders:Test_UpdateCraftingOrders
procedure Test_UpdateKilledMobs_0403d9_0ca136(Gnattest_T: in out Test);
-- statistics.ads:146:4:UpdateKilledMobs:Test_UpdateKilledMobs
procedure Test_GetGamePoints_e274aa_4eed1d(Gnattest_T: in out Test);
-- statistics.ads:158:4:GetGamePoints:Test_GetGamePoints
end Statistics.Test_Data.Tests;
-- end read only
|
-- Copyright (C) 2019 Thierry Rascle <thierr26@free.fr>
-- MIT license. Please refer to the LICENSE file.
with Apsepp.Generic_Shared_Instance;
with Apsepp.Output_Class; use Apsepp.Output_Class;
package Apsepp.Output is
package Shared_Instance is new Generic_Shared_Instance (Output_Interfa);
subtype Output_Access is Shared_Instance.Instance_Type_Access;
function Output return Output_Access renames Shared_Instance.Instance;
end Apsepp.Output;
|
-- This file is generated by SWIG. Please do not modify by hand.
--
with Interfaces.C;
with Interfaces.C;
with Interfaces.C.Pointers;
package xcb.xcb_keycode32_iterator_t is
-- Item
--
type Item is record
data : access xcb.xcb_keycode32_t;
the_rem : aliased Interfaces.C.int;
index : aliased Interfaces.C.int;
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C.size_t range <>) of aliased xcb.xcb_keycode32_iterator_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_keycode32_iterator_t.Item,
Element_Array => xcb.xcb_keycode32_iterator_t.Item_Array,
Default_Terminator => (others => <>));
subtype Pointer is C_Pointers.Pointer;
-- Pointer_Array
--
type Pointer_Array is
array
(Interfaces.C.size_t range <>) of aliased xcb.xcb_keycode32_iterator_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_keycode32_iterator_t.Pointer,
Element_Array => xcb.xcb_keycode32_iterator_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_keycode32_iterator_t;
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- ADA.CONTAINERS.HASH_TABLES --
-- --
-- S p e c --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
package Ada.Containers.Hash_Tables is
pragma Preelaborate;
generic
type Node_Type (<>) is limited private;
type Node_Access is access Node_Type;
package Generic_Hash_Table_Types is
type Buckets_Type is array (Hash_Type range <>) of Node_Access;
type Buckets_Access is access Buckets_Type;
type Hash_Table_Type is tagged record
Buckets : Buckets_Access;
Length : Count_Type := 0;
Busy : Natural := 0;
Lock : Natural := 0;
end record;
end Generic_Hash_Table_Types;
end Ada.Containers.Hash_Tables;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 2 8 --
-- --
-- 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.Storage_Elements;
with System.Unsigned_Types;
package body System.Pack_28 is
subtype Bit_Order is System.Bit_Order;
Reverse_Bit_Order : constant Bit_Order :=
Bit_Order'Val (1 - Bit_Order'Pos (System.Default_Bit_Order));
subtype Ofs is System.Storage_Elements.Storage_Offset;
subtype Uns is System.Unsigned_Types.Unsigned;
subtype N07 is System.Unsigned_Types.Unsigned range 0 .. 7;
use type System.Storage_Elements.Storage_Offset;
use type System.Unsigned_Types.Unsigned;
type Cluster is record
E0, E1, E2, E3, E4, E5, E6, E7 : Bits_28;
end record;
for Cluster use record
E0 at 0 range 0 * Bits .. 0 * Bits + Bits - 1;
E1 at 0 range 1 * Bits .. 1 * Bits + Bits - 1;
E2 at 0 range 2 * Bits .. 2 * Bits + Bits - 1;
E3 at 0 range 3 * Bits .. 3 * Bits + Bits - 1;
E4 at 0 range 4 * Bits .. 4 * Bits + Bits - 1;
E5 at 0 range 5 * Bits .. 5 * Bits + Bits - 1;
E6 at 0 range 6 * Bits .. 6 * Bits + Bits - 1;
E7 at 0 range 7 * Bits .. 7 * Bits + Bits - 1;
end record;
for Cluster'Size use Bits * 8;
for Cluster'Alignment use Integer'Min (Standard'Maximum_Alignment,
1 +
1 * Boolean'Pos (Bits mod 2 = 0) +
2 * Boolean'Pos (Bits mod 4 = 0));
-- Use maximum possible alignment, given the bit field size, since this
-- will result in the most efficient code possible for the field.
type Cluster_Ref is access Cluster;
type Rev_Cluster is new Cluster
with Bit_Order => Reverse_Bit_Order,
Scalar_Storage_Order => Reverse_Bit_Order;
type Rev_Cluster_Ref is access Rev_Cluster;
-- The following declarations are for the case where the address
-- passed to GetU_28 or SetU_28 is not guaranteed to be aligned.
-- These routines are used when the packed array is itself a
-- component of a packed record, and therefore may not be aligned.
type ClusterU is new Cluster;
for ClusterU'Alignment use 1;
type ClusterU_Ref is access ClusterU;
type Rev_ClusterU is new ClusterU
with Bit_Order => Reverse_Bit_Order,
Scalar_Storage_Order => Reverse_Bit_Order;
type Rev_ClusterU_Ref is access Rev_ClusterU;
------------
-- Get_28 --
------------
function Get_28
(Arr : System.Address;
N : Natural;
Rev_SSO : Boolean) return Bits_28
is
A : constant System.Address := Arr + Bits * Ofs (Uns (N) / 8);
C : Cluster_Ref with Address => A'Address, Import;
RC : Rev_Cluster_Ref with Address => A'Address, Import;
begin
if Rev_SSO then
case N07 (Uns (N) mod 8) is
when 0 => return RC.E0;
when 1 => return RC.E1;
when 2 => return RC.E2;
when 3 => return RC.E3;
when 4 => return RC.E4;
when 5 => return RC.E5;
when 6 => return RC.E6;
when 7 => return RC.E7;
end case;
else
case N07 (Uns (N) mod 8) is
when 0 => return C.E0;
when 1 => return C.E1;
when 2 => return C.E2;
when 3 => return C.E3;
when 4 => return C.E4;
when 5 => return C.E5;
when 6 => return C.E6;
when 7 => return C.E7;
end case;
end if;
end Get_28;
-------------
-- GetU_28 --
-------------
function GetU_28
(Arr : System.Address;
N : Natural;
Rev_SSO : Boolean) return Bits_28
is
A : constant System.Address := Arr + Bits * Ofs (Uns (N) / 8);
C : ClusterU_Ref with Address => A'Address, Import;
RC : Rev_ClusterU_Ref with Address => A'Address, Import;
begin
if Rev_SSO then
case N07 (Uns (N) mod 8) is
when 0 => return RC.E0;
when 1 => return RC.E1;
when 2 => return RC.E2;
when 3 => return RC.E3;
when 4 => return RC.E4;
when 5 => return RC.E5;
when 6 => return RC.E6;
when 7 => return RC.E7;
end case;
else
case N07 (Uns (N) mod 8) is
when 0 => return C.E0;
when 1 => return C.E1;
when 2 => return C.E2;
when 3 => return C.E3;
when 4 => return C.E4;
when 5 => return C.E5;
when 6 => return C.E6;
when 7 => return C.E7;
end case;
end if;
end GetU_28;
------------
-- Set_28 --
------------
procedure Set_28
(Arr : System.Address;
N : Natural;
E : Bits_28;
Rev_SSO : Boolean)
is
A : constant System.Address := Arr + Bits * Ofs (Uns (N) / 8);
C : Cluster_Ref with Address => A'Address, Import;
RC : Rev_Cluster_Ref with Address => A'Address, Import;
begin
if Rev_SSO then
case N07 (Uns (N) mod 8) is
when 0 => RC.E0 := E;
when 1 => RC.E1 := E;
when 2 => RC.E2 := E;
when 3 => RC.E3 := E;
when 4 => RC.E4 := E;
when 5 => RC.E5 := E;
when 6 => RC.E6 := E;
when 7 => RC.E7 := E;
end case;
else
case N07 (Uns (N) mod 8) is
when 0 => C.E0 := E;
when 1 => C.E1 := E;
when 2 => C.E2 := E;
when 3 => C.E3 := E;
when 4 => C.E4 := E;
when 5 => C.E5 := E;
when 6 => C.E6 := E;
when 7 => C.E7 := E;
end case;
end if;
end Set_28;
-------------
-- SetU_28 --
-------------
procedure SetU_28
(Arr : System.Address;
N : Natural;
E : Bits_28;
Rev_SSO : Boolean)
is
A : constant System.Address := Arr + Bits * Ofs (Uns (N) / 8);
C : ClusterU_Ref with Address => A'Address, Import;
RC : Rev_ClusterU_Ref with Address => A'Address, Import;
begin
if Rev_SSO then
case N07 (Uns (N) mod 8) is
when 0 => RC.E0 := E;
when 1 => RC.E1 := E;
when 2 => RC.E2 := E;
when 3 => RC.E3 := E;
when 4 => RC.E4 := E;
when 5 => RC.E5 := E;
when 6 => RC.E6 := E;
when 7 => RC.E7 := E;
end case;
else
case N07 (Uns (N) mod 8) is
when 0 => C.E0 := E;
when 1 => C.E1 := E;
when 2 => C.E2 := E;
when 3 => C.E3 := E;
when 4 => C.E4 := E;
when 5 => C.E5 := E;
when 6 => C.E6 := E;
when 7 => C.E7 := E;
end case;
end if;
end SetU_28;
end System.Pack_28;
|
pragma License (Unrestricted);
private with System.UTF_Conversions.From_8_To_16;
private with System.UTF_Conversions.From_8_To_32;
private with System.UTF_Conversions.From_16_To_32;
private with System.UTF_Conversions.From_16_To_8;
private with System.UTF_Conversions.From_32_To_8;
private with System.UTF_Conversions.From_32_To_16;
package Ada.Characters.Conversions is
pragma Pure;
-- extended
-- Use Is_Wide_String instead of Is_Wide_Character for multi-byte sequence.
-- Is_Wide_String checks if all code-points of Item can be converted to
-- UTF-16 Wide_String (each code-point is in BMP or surrogate pair).
-- These functions Is_XXX_String assume Item contains a legal sequence.
function Is_Wide_Character (Item : Character) return Boolean;
function Is_Wide_String (Item : String) return Boolean;
-- extended
-- Use Is_Wide_Wide_String instead of Is_Wide_Wide_Character for multi-byte
-- sequence.
-- UTF-8 String can always be converted to UTF-32 Wide_Wide_String.
function Is_Wide_Wide_Character (Item : Character) return Boolean
renames Is_Wide_Character;
-- function Is_Wide_Wide_String (Item : String) return Boolean; -- True
-- Do not use Is_Character for Item that is greater than 16#7F#.
-- UTF-16 Wide_String can always be converted to UTF-8 String.
function Is_Character (Item : Wide_Character) return Boolean;
function Is_String (Item : Wide_String) return Boolean; -- True
-- extended
-- Do not use Is_Wide_Wide_Character for surrogate pair.
-- UTF-16 Wide_String can always be converted to UTF-32 Wide_Wide_String.
function Is_Wide_Wide_Character (Item : Wide_Character) return Boolean;
-- function Is_Wide_Wide_String (Item : Wide_String) return Boolean; -- True
-- Do not use Is_Character for Item that is greater than 16#7F#.
-- UTF-32 Wide_Wide_String can always be converted to UTF-8 String.
function Is_Character (Item : Wide_Wide_Character) return Boolean;
function Is_String (Item : Wide_Wide_String) return Boolean; -- True
-- Use Is_Wide_String instead of Is_Wide_Character for Item that is greater
-- than 16#FFFF#.
function Is_Wide_Character (Item : Wide_Wide_Character) return Boolean;
function Is_Wide_String (Item : Wide_Wide_String) return Boolean;
pragma Inline (Is_Character);
pragma Inline (Is_Wide_Character);
pragma Inline (Is_Wide_Wide_Character);
pragma Inline (Is_String);
-- modified
-- These functions use Substitute if Item contains illegal byte sequence.
function To_Wide_Character (
Item : Character;
Substitute : Wide_Character := ' ') -- additional
return Wide_Character;
function To_Wide_String (
Item : String;
Substitute : Wide_String := " ") -- additional
return Wide_String;
-- modified
function To_Wide_Wide_Character (
Item : Character;
Substitute : Wide_Wide_Character := ' ') -- additional
return Wide_Wide_Character;
function To_Wide_Wide_String (
Item : String;
Substitute : Wide_Wide_String := " ") -- additional
return Wide_Wide_String;
-- modified
function To_Wide_Wide_Character (
Item : Wide_Character;
Substitute : Wide_Wide_Character := ' ') -- additional
return Wide_Wide_Character;
function To_Wide_Wide_String (
Item : Wide_String;
Substitute : Wide_Wide_String := " ") -- additional
return Wide_Wide_String;
function To_Character (
Item : Wide_Character;
Substitute : Character := ' ')
return Character;
function To_String (
Item : Wide_String;
Substitute : Character := ' ')
return String;
-- extended
function To_String (
Item : Wide_String;
Substitute : String)
return String;
function To_Character (
Item : Wide_Wide_Character;
Substitute : Character := ' ')
return Character;
function To_String (
Item : Wide_Wide_String;
Substitute : Character := ' ')
return String;
-- extended
function To_String (
Item : Wide_Wide_String;
Substitute : String)
return String;
function To_Wide_Character (
Item : Wide_Wide_Character;
Substitute : Wide_Character := ' ')
return Wide_Character;
function To_Wide_String (
Item : Wide_Wide_String;
Substitute : Wide_Character := ' ')
return Wide_String;
-- extended
function To_Wide_String (
Item : Wide_Wide_String;
Substitute : Wide_String)
return Wide_String;
pragma Inline (To_String); -- renamed, or normal inline
pragma Inline (To_Wide_String); -- renamed, or normal inline
pragma Inline (To_Wide_Wide_String); -- renamed, or normal inline
-- extended
-- There are subprograms for code-point based decoding iteration.
procedure Get (
Item : String;
Last : out Natural;
Value : out Wide_Wide_Character;
Substitute : Wide_Wide_Character := ' ');
procedure Get (
Item : String;
Last : out Natural;
Value : out Wide_Wide_Character;
Is_Illegal_Sequence : out Boolean);
procedure Get_Reverse (
Item : String;
First : out Positive;
Value : out Wide_Wide_Character;
Substitute : Wide_Wide_Character := ' ');
procedure Get_Reverse (
Item : String;
First : out Positive;
Value : out Wide_Wide_Character;
Is_Illegal_Sequence : out Boolean);
procedure Get (
Item : Wide_String;
Last : out Natural;
Value : out Wide_Wide_Character;
Substitute : Wide_Wide_Character := ' ');
procedure Get (
Item : Wide_String;
Last : out Natural;
Value : out Wide_Wide_Character;
Is_Illegal_Sequence : out Boolean);
procedure Get_Reverse (
Item : Wide_String;
First : out Positive;
Value : out Wide_Wide_Character;
Substitute : Wide_Wide_Character := ' ');
procedure Get_Reverse (
Item : Wide_String;
First : out Positive;
Value : out Wide_Wide_Character;
Is_Illegal_Sequence : out Boolean);
procedure Get (
Item : Wide_Wide_String;
Last : out Natural;
Value : out Wide_Wide_Character;
Substitute : Wide_Wide_Character := ' ');
procedure Get (
Item : Wide_Wide_String;
Last : out Natural;
Value : out Wide_Wide_Character;
Is_Illegal_Sequence : out Boolean);
procedure Get_Reverse (
Item : Wide_Wide_String;
First : out Positive;
Value : out Wide_Wide_Character;
Substitute : Wide_Wide_Character := ' ');
procedure Get_Reverse (
Item : Wide_Wide_String;
First : out Positive;
Value : out Wide_Wide_Character;
Is_Illegal_Sequence : out Boolean);
-- extended
-- Encoding subprograms:
procedure Put (
Value : Wide_Wide_Character;
Item : out String;
Last : out Natural);
procedure Put (
Value : Wide_Wide_Character;
Item : out Wide_String;
Last : out Natural);
procedure Put (
Value : Wide_Wide_Character;
Item : out Wide_Wide_String;
Last : out Natural);
-- extended
-- Max lengths of each one multi-byte character,
-- and the rates of expansion:
Max_Length_In_String : constant := 6;
Max_Length_In_Wide_String : constant := 2;
Max_Length_In_Wide_Wide_String : constant := 1;
Expanding_From_String_To_Wide_String : constant := 1;
Expanding_From_String_To_Wide_Wide_String : constant := 1;
Expanding_From_Wide_String_To_String : constant := 3;
Expanding_From_Wide_String_To_Wide_Wide_String : constant := 1;
Expanding_From_Wide_Wide_String_To_String : constant := 6;
Expanding_From_Wide_Wide_String_To_Wide_String : constant := 2;
Expanding_From_String_To_UTF_8 : constant := 1;
Expanding_From_String_To_UTF_16 : constant := 1;
Expanding_From_String_To_UTF_32 : constant := 1;
Expanding_From_Wide_String_To_UTF_8 : constant := 3;
Expanding_From_Wide_String_To_UTF_16 : constant := 1;
Expanding_From_Wide_String_To_UTF_32 : constant := 1;
Expanding_From_Wide_Wide_String_To_UTF_8 : constant := 6;
Expanding_From_Wide_Wide_String_To_UTF_16 : constant := 2;
Expanding_From_Wide_Wide_String_To_UTF_32 : constant := 1;
Expanding_From_UTF_8_To_String : constant := 1;
Expanding_From_UTF_8_To_Wide_String : constant := 1;
Expanding_From_UTF_8_To_Wide_Wide_String : constant := 1;
Expanding_From_UTF_16_To_String : constant := 3;
Expanding_From_UTF_16_To_Wide_String : constant := 1;
Expanding_From_UTF_16_To_Wide_Wide_String : constant := 1;
Expanding_From_UTF_32_To_String : constant := 6;
Expanding_From_UTF_32_To_Wide_String : constant := 2;
Expanding_From_UTF_32_To_Wide_Wide_String : constant := 1;
private
function To_Wide_String (
Item : String;
Substitute : Wide_String := " ")
return Wide_String
renames System.UTF_Conversions.From_8_To_16.Convert;
function To_Wide_Wide_String (
Item : String;
Substitute : Wide_Wide_String := " ")
return Wide_Wide_String
renames System.UTF_Conversions.From_8_To_32.Convert;
function To_Wide_Wide_String (
Item : Wide_String;
Substitute : Wide_Wide_String := " ")
return Wide_Wide_String
renames System.UTF_Conversions.From_16_To_32.Convert;
function To_String (
Item : Wide_String;
Substitute : String)
return String
renames System.UTF_Conversions.From_16_To_8.Convert;
function To_String (
Item : Wide_Wide_String;
Substitute : String)
return String
renames System.UTF_Conversions.From_32_To_8.Convert;
function To_Wide_String (
Item : Wide_Wide_String;
Substitute : Wide_String)
return Wide_String
renames System.UTF_Conversions.From_32_To_16.Convert;
end Ada.Characters.Conversions;
|
------------------------------------------------------------------------------
-- G E L A A S I S --
-- ASIS implementation for Gela project, a portable Ada compiler --
-- http://gela.ada-ru.org --
-- - - - - - - - - - - - - - - - --
-- Read copyright and license at the end of this file --
------------------------------------------------------------------------------
-- $Revision: 209 $ $Date: 2013-11-30 21:03:24 +0200 (Сб., 30 нояб. 2013) $
with Ada.Finalization;
package Symbols is
type Symbol is mod 16#110001#;
type Symbol_Array is array (Positive range <>) of Symbol;
type Symbol_Set is private;
function To_Range (Single : Symbol) return Symbol_Set;
function To_Range (Sequence : Symbol_Array) return Symbol_Set;
function To_Range (Lower, Upper : Symbol) return Symbol_Set;
function "or" (Left, Right : Symbol_Set) return Symbol_Set;
function "and" (Left, Right : Symbol_Set) return Symbol_Set;
function "-" (Left, Right : Symbol_Set) return Symbol_Set;
function "*" (Left, Right : Symbol_Set) return Boolean;
function Intersect (Left, Right : Symbol_Set) return Boolean renames "*";
function Is_Empty (Left : Symbol_Set) return Boolean;
function Is_Equal (Left, Right : Symbol_Set) return Boolean;
function Range_Image
(Left : Symbol_Set;
Indent : String) return String;
Empty : constant Symbol_Set;
Not_A_Symbol : constant Symbol := Symbol'Last;
type Symbol_Set_Array is array (Positive range <>) of Symbol_Set;
function Distinct_Symbol_Sets
(Next : in Symbol_Set_Array) return Symbol_Set_Array;
private
package F renames Ada.Finalization;
type Set_Node;
type Node_Access is access all Set_Node;
type Symbol_Set is new F.Controlled with record
Node : Node_Access;
end record;
type Symbol_Range is record
Lower, Upper : Symbol;
end record;
function "*" (Left, Right : Symbol_Range) return Boolean;
function "or" (Left, Right : Symbol_Range) return Symbol_Range;
function "and" (Left, Right : Symbol_Range) return Symbol_Range;
type Symbol_Ranges is array (Positive range <>) of Symbol_Range;
type Set_Node (Length : Natural) is record
Count : Natural;
Ranges : Symbol_Ranges (1 .. Length);
end record;
procedure Adjust (Object : in out Symbol_Set);
procedure Finalize (Object : in out Symbol_Set);
Empty_Node : aliased Set_Node :=
(0, 2, (others => (Not_A_Symbol, Not_A_Symbol)));
Empty : constant Symbol_Set := (F.Controlled with Empty_Node'Access);
pragma Inline ("*");
pragma Inline (Is_Empty);
pragma Inline (Is_Equal);
end Symbols;
------------------------------------------------------------------------------
-- Copyright (c) 2006-2013, Maxim Reznik
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
--
-- * Redistributions of source code must retain the above copyright notice,
-- this list of conditions and the following disclaimer.
-- * Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
-- * Neither the name of the Maxim Reznik, IE nor the names of its
-- contributors may be used to endorse or promote products derived from
-- this software without specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
-- LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
-- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-- POSSIBILITY OF SUCH DAMAGE.
------------------------------------------------------------------------------
|
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
package body Program.Nodes.Selected_Components is
function Create
(Prefix : not null Program.Elements.Expressions.Expression_Access;
Dot_Token : not null Program.Lexical_Elements.Lexical_Element_Access;
Selector : not null Program.Elements.Expressions.Expression_Access)
return Selected_Component is
begin
return Result : Selected_Component :=
(Prefix => Prefix, Dot_Token => Dot_Token, Selector => Selector,
Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
function Create
(Prefix : not null Program.Elements.Expressions
.Expression_Access;
Selector : not null Program.Elements.Expressions
.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_Selected_Component is
begin
return Result : Implicit_Selected_Component :=
(Prefix => Prefix, Selector => Selector,
Is_Part_Of_Implicit => Is_Part_Of_Implicit,
Is_Part_Of_Inherited => Is_Part_Of_Inherited,
Is_Part_Of_Instance => Is_Part_Of_Instance, Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
overriding function Prefix
(Self : Base_Selected_Component)
return not null Program.Elements.Expressions.Expression_Access is
begin
return Self.Prefix;
end Prefix;
overriding function Selector
(Self : Base_Selected_Component)
return not null Program.Elements.Expressions.Expression_Access is
begin
return Self.Selector;
end Selector;
overriding function Dot_Token
(Self : Selected_Component)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Dot_Token;
end Dot_Token;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Selected_Component)
return Boolean is
begin
return Self.Is_Part_Of_Implicit;
end Is_Part_Of_Implicit;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Selected_Component)
return Boolean is
begin
return Self.Is_Part_Of_Inherited;
end Is_Part_Of_Inherited;
overriding function Is_Part_Of_Instance
(Self : Implicit_Selected_Component)
return Boolean is
begin
return Self.Is_Part_Of_Instance;
end Is_Part_Of_Instance;
procedure Initialize
(Self : aliased in out Base_Selected_Component'Class) is
begin
Set_Enclosing_Element (Self.Prefix, Self'Unchecked_Access);
Set_Enclosing_Element (Self.Selector, Self'Unchecked_Access);
null;
end Initialize;
overriding function Is_Selected_Component_Element
(Self : Base_Selected_Component)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Selected_Component_Element;
overriding function Is_Expression_Element
(Self : Base_Selected_Component)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Expression_Element;
overriding procedure Visit
(Self : not null access Base_Selected_Component;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class) is
begin
Visitor.Selected_Component (Self);
end Visit;
overriding function To_Selected_Component_Text
(Self : aliased in out Selected_Component)
return Program.Elements.Selected_Components
.Selected_Component_Text_Access is
begin
return Self'Unchecked_Access;
end To_Selected_Component_Text;
overriding function To_Selected_Component_Text
(Self : aliased in out Implicit_Selected_Component)
return Program.Elements.Selected_Components
.Selected_Component_Text_Access is
pragma Unreferenced (Self);
begin
return null;
end To_Selected_Component_Text;
end Program.Nodes.Selected_Components;
|
-----------------------------------------------------------------------
-- gen-model-list -- List bean interface for model objects
-- Copyright (C) 2009, 2010, 2011, 2012 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Beans.Objects;
with Util.Beans.Basic;
with Gen.Model;
with Ada.Containers.Vectors;
generic
type T is new Gen.Model.Definition with private;
type T_Access is access all T'Class;
package Gen.Model.List is
-- Compare the two definitions.
function "<" (Left, Right : in T_Access) return Boolean;
package Vectors is
new Ada.Containers.Vectors (Index_Type => Natural,
Element_Type => T_Access,
"=" => "=");
package Sorting is new Vectors.Generic_Sorting;
subtype Cursor is Vectors.Cursor;
subtype Vector is Vectors.Vector;
function Has_Element (Position : Cursor) return Boolean
renames Vectors.Has_Element;
function Element (Position : Cursor) return T_Access
renames Vectors.Element;
procedure Next (Position : in out Cursor)
renames Vectors.Next;
type List_Definition is limited new Util.Beans.Basic.List_Bean with private;
-- Get the first item of the list
function First (Def : List_Definition) return Cursor;
-- Get the number of elements in the list.
overriding
function Get_Count (From : List_Definition) return Natural;
-- Set the current row index. Valid row indexes start at 1.
overriding
procedure Set_Row_Index (From : in out List_Definition;
Index : in Natural);
-- Get the element at the current row index.
overriding
function Get_Row (From : List_Definition) return Util.Beans.Objects.Object;
-- Get the value identified by the name.
-- If the name cannot be found, the method should return the Null object.
overriding
function Get_Value (From : List_Definition;
Name : String) return Util.Beans.Objects.Object;
-- Append the item in the list
procedure Append (Def : in out List_Definition;
Item : in T_Access);
-- Sort the list of items on their names.
procedure Sort (List : in out List_Definition);
generic
with function "<" (Left, Right : T_Access) return Boolean is <>;
procedure Sort_On (List : in out List_Definition);
-- Find a definition given the name.
-- Returns the definition object or null.
function Find (Def : in List_Definition;
Name : in String) return T_Access;
-- Iterate over the elements of the list executing the <tt>Process</tt> procedure.
procedure Iterate (Def : in List_Definition;
Process : not null access procedure (Item : in T_Access));
private
type List_Definition is limited new Util.Beans.Basic.List_Bean with record
Nodes : Vectors.Vector;
Row : Natural := 0;
Value_Bean : Util.Beans.Objects.Object;
end record;
end Gen.Model.List;
|
-- This package has been generated automatically by GNATtest.
-- Do not edit any part of it, see GNATtest documentation for more details.
-- begin read only
with Gnattest_Generated;
package Ships.Test_Data.Tests.Modules_Container.Test_Data.Tests is
type Test is new GNATtest_Generated.GNATtest_Standard.Ships.Test_Data.Tests
.Modules_Container
.Test_Data
.New_Test with
null record;
end Ships.Test_Data.Tests.Modules_Container.Test_Data.Tests;
-- end read only
|
------------------------------------------------------------------------------
-- --
-- Ada binding for OpenGL/WebGL --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2016-2018, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with WebAPI.WebGL.Shaders;
package OpenGL.Shaders.Internals is
pragma Preelaborate;
function Get_WebGL_Shader
(Self : not null access OpenGL_Shader'Class)
return WebAPI.WebGL.Shaders.WebGL_Shader_Access;
end OpenGL.Shaders.Internals;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T C H O P --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1998-2001 Ada Core Technologies, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- GNAT is maintained by Ada Core Technologies Inc (http://www.gnat.com). --
-- --
------------------------------------------------------------------------------
with Ada.Command_Line; use Ada.Command_Line;
with Ada.Text_IO; use Ada.Text_IO;
with GNAT.Command_Line; use GNAT.Command_Line;
with GNAT.OS_Lib; use GNAT.OS_Lib;
with GNAT.Heap_Sort_G;
with GNAT.Table;
with Gnatvsn;
with Hostparm;
procedure Gnatchop is
Cwrite : constant String :=
"GNATCHOP " &
Gnatvsn.Gnat_Version_String &
" Copyright 1998-2000, Ada Core Technologies Inc.";
Terminate_Program : exception;
-- Used to terminate execution immediately
Config_File_Name : constant String_Access := new String'("gnat.adc");
-- The name of the file holding the GNAT configuration pragmas
Gnat_Cmd : String_Access;
-- Command to execute the GNAT compiler
Gnat_Args : Argument_List_Access := new Argument_List'
(new String'("-c"), new String'("-x"), new String'("ada"),
new String'("-gnats"), new String'("-gnatu"));
-- Arguments used in Gnat_Cmd call
EOF : constant Character := Character'Val (26);
-- Special character to signal end of file. Not required in input
-- files, but properly treated if present. Not generated in output
-- files except as a result of copying input file.
--------------------
-- File arguments --
--------------------
subtype File_Num is Natural;
subtype File_Offset is Natural;
type File_Entry is record
Name : String_Access;
-- Name of chop file or directory
SR_Name : String_Access;
-- Null unless the chop file starts with a source reference pragma
-- in which case this field points to the file name from this pragma.
end record;
package File is new GNAT.Table
(Table_Component_Type => File_Entry,
Table_Index_Type => File_Num,
Table_Low_Bound => 1,
Table_Initial => 100,
Table_Increment => 100);
Directory : String_Access;
-- Record name of directory, or a null string if no directory given
Compilation_Mode : Boolean := False;
Overwrite_Files : Boolean := False;
Preserve_Mode : Boolean := False;
Quiet_Mode : Boolean := False;
Source_References : Boolean := False;
Verbose_Mode : Boolean := False;
Exit_On_Error : Boolean := False;
-- Global options
Write_gnat_adc : Boolean := False;
-- Gets set true if we append to gnat.adc or create a new gnat.adc.
-- Used to inhibit complaint about no units generated.
---------------
-- Unit list --
---------------
type Line_Num is new Natural;
-- Line number (for source reference pragmas)
type Unit_Count_Type is new Integer;
subtype Unit_Num is Unit_Count_Type range 1 .. Unit_Count_Type'Last;
-- Used to refer to unit number in unit table
type SUnit_Num is new Integer;
-- Used to refer to entry in sorted units table. Note that entry
-- zero is only for use by Heapsort, and is not otherwise referenced.
type Unit_Kind is (Unit_Spec, Unit_Body, Config_Pragmas);
-- Structure to contain all necessary information for one unit.
-- Entries are also temporarily used to record config pragma sequences.
type Unit_Info is record
File_Name : String_Access;
-- File name from GNAT output line
Chop_File : File_Num;
-- File number in chop file sequence
Start_Line : Line_Num;
-- Line number from GNAT output line
Offset : File_Offset;
-- Offset name from GNAT output line
SR_Present : Boolean;
-- Set True if SR parameter present
Length : File_Offset;
-- A length of 0 means that the Unit is the last one in the file
Kind : Unit_Kind;
-- Indicates kind of unit
Sorted_Index : SUnit_Num;
-- Index of unit in sorted unit list
Bufferg : String_Access;
-- Pointer to buffer containing configuration pragmas to be
-- prepended. Null if no pragmas to be prepended.
end record;
-- The following table stores the unit offset information
package Unit is new GNAT.Table
(Table_Component_Type => Unit_Info,
Table_Index_Type => Unit_Count_Type,
Table_Low_Bound => 1,
Table_Initial => 500,
Table_Increment => 100);
-- The following table is used as a sorted index to the Unit.Table.
-- The entries in Unit.Table are not moved, instead we just shuffle
-- the entries in Sorted_Units. Note that the zeroeth entry in this
-- table is used by GNAT.Heap_Sort_G.
package Sorted_Units is new GNAT.Table
(Table_Component_Type => Unit_Num,
Table_Index_Type => SUnit_Num,
Table_Low_Bound => 0,
Table_Initial => 500,
Table_Increment => 100);
function Is_Duplicated (U : SUnit_Num) return Boolean;
-- Returns true if U is duplicated by a later unit.
-- Note that this function returns false for the last entry.
procedure Sort_Units;
-- Sort units and set up sorted unit table.
----------------------
-- File_Descriptors --
----------------------
function dup (handle : File_Descriptor) return File_Descriptor;
function dup2 (from, to : File_Descriptor) return File_Descriptor;
-- File descriptor based functions needed for redirecting stdin/stdout
pragma Import (C, dup, "dup");
pragma Import (C, dup2, "dup2");
---------------------
-- Local variables --
---------------------
Warning_Count : Natural := 0;
-- Count of warnings issued so far
-----------------------
-- Local subprograms --
-----------------------
procedure Error_Msg (Message : String);
-- Produce an error message on standard error output
procedure File_Time_Stamp (Name : C_File_Name; Time : OS_Time);
-- Given the name of a file or directory, Name, set the
-- time stamp. This function must be used for an unopened file.
function Files_Exist return Boolean;
-- Check Unit.Table for possible file names that already exist
-- in the file system. Returns true if files exist, False otherwise
function Get_Maximum_File_Name_Length return Integer;
pragma Import (C, Get_Maximum_File_Name_Length,
"__gnat_get_maximum_file_name_length");
-- Function to get maximum file name length for system
Maximum_File_Name_Length : constant Integer := Get_Maximum_File_Name_Length;
Maximum_File_Name_Length_String : constant String :=
Integer'Image
(Maximum_File_Name_Length);
function Locate_Executable (Program_Name : String) return String_Access;
-- Locate executable for given program name. This takes into account
-- the target-prefix of the current command.
subtype EOL_Length is Natural range 0 .. 2;
-- Possible lengths of end of line sequence
type EOL_String (Len : EOL_Length := 0) is record
Str : String (1 .. Len);
end record;
function Get_EOL
(Source : access String;
Start : Positive)
return EOL_String;
-- Return the line terminator used in the passed string
procedure Parse_EOL (Source : access String; Ptr : in out Positive);
-- On return Source (Ptr) is the first character of the next line
-- or EOF. Source.all must be terminated by EOF.
function Parse_File (Num : File_Num) return Boolean;
-- Calls the GNAT compiler to parse the given source file and parses the
-- output using Parse_Offset_Info. Returns True if parse operation
-- completes, False if some system error (e.g. failure to read the
-- offset information) occurs.
procedure Parse_Offset_Info (Chop_File : File_Num; Source : access String);
-- Parses the output of the compiler indicating the offsets
-- and names of the compilation units in Chop_File.
procedure Parse_Token
(Source : access String;
Ptr : in out Positive;
Token_Ptr : out Positive);
-- Skips any separators and stores the start of the token in Token_Ptr.
-- Then stores the position of the next separator in Ptr.
-- On return Source (Token_Ptr .. Ptr - 1) is the token.
procedure Read_File
(FD : File_Descriptor;
Contents : out String_Access;
Success : out Boolean);
-- Reads file associated with FS into the newly allocated
-- string Contents.
-- [VMS] Success is true iff the number of bytes read is less than or
-- equal to the file size.
-- [Other] Success is true iff the number of bytes read is equal to
-- the file size.
function Report_Duplicate_Units return Boolean;
-- Output messages about duplicate units in the input files in Unit.Table
-- Returns True if any duplicates found, Fals if no duplicates found.
function Scan_Arguments return Boolean;
-- Scan command line options and set global variables accordingly.
-- Also scan out file and directory arguments. Returns True if scan
-- was successful, and False if the scan fails for any reason.
procedure Usage;
-- Output message on standard output describing syntax of gnatchop command
procedure Warning_Msg (Message : String);
-- Output a warning message on standard error and update warning count
function Write_Chopped_Files (Input : File_Num) return Boolean;
-- Write all units that result from chopping the Input file
procedure Write_Config_File (Input : File_Num; U : Unit_Num);
-- Call to write configuration pragmas (append them to gnat.adc)
-- Input is the file number for the chop file and U identifies the
-- unit entry for the configuration pragmas.
function Get_Config_Pragmas
(Input : File_Num;
U : Unit_Num)
return String_Access;
-- Call to read configuration pragmas from given unit entry, and
-- return a buffer containing the pragmas to be appended to
-- following units. Input is the file number for the chop file and
-- U identifies the unit entry for the configuration pragmas.
procedure Write_Source_Reference_Pragma
(Info : Unit_Info;
Line : Line_Num;
FD : File_Descriptor;
EOL : EOL_String;
Success : in out Boolean);
-- If Success is True on entry, writes a source reference pragma using
-- the chop file from Info, and the given line number. On return Success
-- indicates whether the write succeeded. If Success is False on entry,
-- or if the global flag Source_References is False, then the call to
-- Write_Source_Reference_Pragma has no effect. EOL indicates the end
-- of line sequence to be written at the end of the pragma.
procedure Write_Unit
(Source : access String;
Num : Unit_Num;
TS_Time : OS_Time;
Success : out Boolean);
-- Write one compilation unit of the source to file
---------------
-- Error_Msg --
---------------
procedure Error_Msg (Message : String) is
begin
Put_Line (Standard_Error, Message);
Set_Exit_Status (Failure);
if Exit_On_Error then
raise Terminate_Program;
end if;
end Error_Msg;
---------------------
-- File_Time_Stamp --
---------------------
procedure File_Time_Stamp (Name : C_File_Name; Time : OS_Time) is
procedure Set_File_Time (Name : C_File_Name; Time : OS_Time);
pragma Import (C, Set_File_Time, "__gnat_set_file_time_name");
begin
Set_File_Time (Name, Time);
end File_Time_Stamp;
-----------------
-- Files_Exist --
-----------------
function Files_Exist return Boolean is
Exists : Boolean := False;
begin
for SNum in 1 .. SUnit_Num (Unit.Last) loop
-- Only check and report for the last instance of duplicated files
if not Is_Duplicated (SNum) then
declare
Info : Unit_Info := Unit.Table (Sorted_Units.Table (SNum));
begin
if Is_Writable_File (Info.File_Name.all) then
if Hostparm.OpenVMS then
Error_Msg
(Info.File_Name.all
& " already exists, use /OVERWRITE to overwrite");
else
Error_Msg (Info.File_Name.all
& " already exists, use -w to overwrite");
end if;
Exists := True;
end if;
end;
end if;
end loop;
return Exists;
end Files_Exist;
------------------------
-- Get_Config_Pragmas --
------------------------
function Get_Config_Pragmas
(Input : File_Num;
U : Unit_Num)
return String_Access
is
Info : Unit_Info renames Unit.Table (U);
FD : File_Descriptor;
Name : aliased constant String :=
File.Table (Input).Name.all & ASCII.Nul;
Length : File_Offset;
Buffer : String_Access;
Success : Boolean;
Result : String_Access;
begin
FD := Open_Read (Name'Address, Binary);
if FD = Invalid_FD then
Error_Msg ("cannot open " & File.Table (Input).Name.all);
return null;
end if;
Read_File (FD, Buffer, Success);
-- A length of 0 indicates that the rest of the file belongs to
-- this unit. The actual length must be calculated now. Take into
-- account that the last character (EOF) must not be written.
if Info.Length = 0 then
Length := Buffer'Last - (Buffer'First + Info.Offset);
else
Length := Info.Length;
end if;
Result := new String'(Buffer (1 .. Length));
Close (FD);
return Result;
end Get_Config_Pragmas;
-------------
-- Get_EOL --
-------------
function Get_EOL
(Source : access String;
Start : Positive)
return EOL_String
is
Ptr : Positive := Start;
First : Positive;
Last : Natural;
begin
-- Skip to end of line
while Source (Ptr) /= ASCII.CR and then
Source (Ptr) /= ASCII.LF and then
Source (Ptr) /= EOF
loop
Ptr := Ptr + 1;
end loop;
Last := Ptr;
if Source (Ptr) /= EOF then
-- Found CR or LF
First := Ptr;
else
First := Ptr + 1;
end if;
-- Recognize CR/LF or LF/CR combination
if (Source (Ptr + 1) = ASCII.CR or Source (Ptr + 1) = ASCII.LF)
and then Source (Ptr) /= Source (Ptr + 1)
then
Last := First + 1;
end if;
return (Len => Last + 1 - First, Str => Source (First .. Last));
end Get_EOL;
-------------------
-- Is_Duplicated --
-------------------
function Is_Duplicated (U : SUnit_Num) return Boolean is
begin
return U < SUnit_Num (Unit.Last)
and then
Unit.Table (Sorted_Units.Table (U)).File_Name.all =
Unit.Table (Sorted_Units.Table (U + 1)).File_Name.all;
end Is_Duplicated;
-----------------------
-- Locate_Executable --
-----------------------
function Locate_Executable (Program_Name : String) return String_Access is
Current_Command : constant String := Command_Name;
End_Of_Prefix : Natural;
Start_Of_Prefix : Positive := Current_Command'First;
Result : String_Access;
begin
-- Find Start_Of_Prefix
for J in reverse Current_Command'Range loop
if Current_Command (J) = '/' or
Current_Command (J) = Directory_Separator or
Current_Command (J) = ':'
then
Start_Of_Prefix := J + 1;
exit;
end if;
end loop;
-- Find End_Of_Prefix
End_Of_Prefix := Start_Of_Prefix - 1;
for J in reverse Start_Of_Prefix .. Current_Command'Last loop
if Current_Command (J) = '-' then
End_Of_Prefix := J;
exit;
end if;
end loop;
declare
Command : constant String :=
Current_Command (Start_Of_Prefix .. End_Of_Prefix) &
Program_Name;
begin
Result := Locate_Exec_On_Path (Command);
if Result = null then
Error_Msg
(Command & ": installation problem, executable not found");
end if;
end;
return Result;
end Locate_Executable;
---------------
-- Parse_EOL --
---------------
procedure Parse_EOL (Source : access String; Ptr : in out Positive) is
begin
-- Skip to end of line
while Source (Ptr) /= ASCII.CR and then Source (Ptr) /= ASCII.LF
and then Source (Ptr) /= EOF
loop
Ptr := Ptr + 1;
end loop;
if Source (Ptr) /= EOF then
Ptr := Ptr + 1; -- skip CR or LF
end if;
-- Skip past CR/LF or LF/CR combination
if (Source (Ptr) = ASCII.CR or Source (Ptr) = ASCII.LF)
and then Source (Ptr) /= Source (Ptr - 1)
then
Ptr := Ptr + 1;
end if;
end Parse_EOL;
----------------
-- Parse_File --
----------------
function Parse_File (Num : File_Num) return Boolean is
Chop_Name : constant String_Access := File.Table (Num).Name;
Offset_Name : Temp_File_Name;
Offset_FD : File_Descriptor;
Save_Stdout : File_Descriptor := dup (Standout);
Buffer : String_Access;
Success : Boolean;
Failure : exception;
begin
-- Display copy of GNAT command if verbose mode
if Verbose_Mode then
Put (Gnat_Cmd.all);
for J in 1 .. Gnat_Args'Length loop
Put (' ');
Put (Gnat_Args (J).all);
end loop;
Put (' ');
Put_Line (Chop_Name.all);
end if;
-- Create temporary file
Create_Temp_File (Offset_FD, Offset_Name);
if Offset_FD = Invalid_FD then
Error_Msg ("gnatchop: cannot create temporary file");
Close (Save_Stdout);
return False;
end if;
-- Redirect Stdout to this temporary file in the Unix way
if dup2 (Offset_FD, Standout) = Invalid_FD then
Error_Msg ("gnatchop: cannot redirect stdout to temporary file");
Close (Save_Stdout);
Close (Offset_FD);
return False;
end if;
-- Call Gnat on the source filename argument with special options
-- to generate offset information. If this special compilation completes
-- successfully then we can do the actual gnatchop operation.
Spawn (Gnat_Cmd.all, Gnat_Args.all & Chop_Name, Success);
if not Success then
Error_Msg (Chop_Name.all & ": parse errors detected");
Error_Msg (Chop_Name.all & ": chop may not be successful");
end if;
-- Restore stdout
if dup2 (Save_Stdout, Standout) = Invalid_FD then
Error_Msg ("gnatchop: cannot restore stdout");
end if;
-- Reopen the file to start reading from the beginning
Close (Offset_FD);
Close (Save_Stdout);
Offset_FD := Open_Read (Offset_Name'Address, Binary);
if Offset_FD = Invalid_FD then
Error_Msg ("gnatchop: cannot access offset info");
raise Failure;
end if;
Read_File (Offset_FD, Buffer, Success);
if not Success then
Error_Msg ("gnatchop: error reading offset info");
Close (Offset_FD);
raise Failure;
else
Parse_Offset_Info (Num, Buffer);
end if;
-- Close and delete temporary file
Close (Offset_FD);
Delete_File (Offset_Name'Address, Success);
return Success;
exception
when Failure | Terminate_Program =>
Close (Offset_FD);
Delete_File (Offset_Name'Address, Success);
return False;
end Parse_File;
-----------------------
-- Parse_Offset_Info --
-----------------------
procedure Parse_Offset_Info
(Chop_File : File_Num;
Source : access String)
is
First_Unit : Unit_Num := Unit.Last + 1;
Bufferg : String_Access := null;
Parse_Ptr : File_Offset := Source'First;
Token_Ptr : File_Offset;
Info : Unit_Info;
function Match (Literal : String) return Boolean;
-- Checks if given string appears at the current Token_Ptr location
-- and if so, bumps Parse_Ptr past the token and returns True. If
-- the string is not present, sets Parse_Ptr to Token_Ptr and
-- returns False.
-----------
-- Match --
-----------
function Match (Literal : String) return Boolean is
begin
Parse_Token (Source, Parse_Ptr, Token_Ptr);
if Source'Last + 1 - Token_Ptr < Literal'Length
or else
Source (Token_Ptr .. Token_Ptr + Literal'Length - 1) /= Literal
then
Parse_Ptr := Token_Ptr;
return False;
end if;
Parse_Ptr := Token_Ptr + Literal'Length;
return True;
end Match;
-- Start of processing for Parse_Offset_Info
begin
loop
-- Set default values, should get changed for all
-- units/pragmas except for the last
Info.Chop_File := Chop_File;
Info.Length := 0;
-- Parse the current line of offset information into Info
-- and exit the loop if there are any errors or on EOF.
-- First case, parse a line in the following format:
-- Unit x (spec) line 7, file offset 142, [SR, ]file name x.ads
-- Note that the unit name can be an operator name in quotes.
-- This is of course illegal, but both GNAT and gnatchop handle
-- the case so that this error does not intefere with chopping.
-- The SR ir present indicates that a source reference pragma
-- was processed as part of this unit (and that therefore no
-- Source_Reference pragma should be generated.
if Match ("Unit") then
Parse_Token (Source, Parse_Ptr, Token_Ptr);
if Match ("(body)") then
Info.Kind := Unit_Body;
elsif Match ("(spec)") then
Info.Kind := Unit_Spec;
else
exit;
end if;
exit when not Match ("line");
Parse_Token (Source, Parse_Ptr, Token_Ptr);
Info.Start_Line := Line_Num'Value
(Source (Token_Ptr .. Parse_Ptr - 1));
exit when not Match ("file offset");
Parse_Token (Source, Parse_Ptr, Token_Ptr);
Info.Offset := File_Offset'Value
(Source (Token_Ptr .. Parse_Ptr - 1));
Info.SR_Present := Match ("SR, ");
exit when not Match ("file name");
Parse_Token (Source, Parse_Ptr, Token_Ptr);
Info.File_Name := new String'
(Directory.all & Source (Token_Ptr .. Parse_Ptr - 1));
Parse_EOL (Source, Parse_Ptr);
-- Second case, parse a line of the following form
-- Configuration pragmas at line 10, file offset 223
elsif Match ("Configuration pragmas at") then
Info.Kind := Config_Pragmas;
Info.File_Name := Config_File_Name;
exit when not Match ("line");
Parse_Token (Source, Parse_Ptr, Token_Ptr);
Info.Start_Line := Line_Num'Value
(Source (Token_Ptr .. Parse_Ptr - 1));
exit when not Match ("file offset");
Parse_Token (Source, Parse_Ptr, Token_Ptr);
Info.Offset := File_Offset'Value
(Source (Token_Ptr .. Parse_Ptr - 1));
Parse_EOL (Source, Parse_Ptr);
-- Third case, parse a line of the following form
-- Source_Reference pragma for file "filename"
-- This appears at the start of the file only, and indicates
-- the name to be used on any generated Source_Reference pragmas.
elsif Match ("Source_Reference pragma for file ") then
Parse_Token (Source, Parse_Ptr, Token_Ptr);
File.Table (Chop_File).SR_Name :=
new String'(Source (Token_Ptr + 1 .. Parse_Ptr - 2));
Parse_EOL (Source, Parse_Ptr);
goto Continue;
-- Unrecognized keyword or end of file
else
exit;
end if;
-- Store the data in the Info record in the Unit.Table
Unit.Increment_Last;
Unit.Table (Unit.Last) := Info;
-- If this is not the first unit from the file, calculate
-- the length of the previous unit as difference of the offsets
if Unit.Last > First_Unit then
Unit.Table (Unit.Last - 1).Length :=
Info.Offset - Unit.Table (Unit.Last - 1).Offset;
end if;
-- If not in compilation mode combine current unit with any
-- preceding configuration pragmas.
if not Compilation_Mode
and then Unit.Last > First_Unit
and then Unit.Table (Unit.Last - 1).Kind = Config_Pragmas
then
Info.Start_Line := Unit.Table (Unit.Last - 1).Start_Line;
Info.Offset := Unit.Table (Unit.Last - 1).Offset;
-- Delete the configuration pragma entry
Unit.Table (Unit.Last - 1) := Info;
Unit.Decrement_Last;
end if;
-- If in compilation mode, and previous entry is the initial
-- entry for the file and is for configuration pragmas, then
-- they are to be appended to every unit in the file.
if Compilation_Mode
and then Unit.Last = First_Unit + 1
and then Unit.Table (First_Unit).Kind = Config_Pragmas
then
Bufferg :=
Get_Config_Pragmas
(Unit.Table (Unit.Last - 1).Chop_File, First_Unit);
Unit.Table (Unit.Last - 1) := Info;
Unit.Decrement_Last;
end if;
Unit.Table (Unit.Last).Bufferg := Bufferg;
-- If in compilation mode, and this is not the first item,
-- combine configuration pragmas with previous unit, which
-- will cause an error message to be generated when the unit
-- is compiled.
if Compilation_Mode
and then Unit.Last > First_Unit
and then Unit.Table (Unit.Last).Kind = Config_Pragmas
then
Unit.Decrement_Last;
end if;
<<Continue>>
null;
end loop;
-- Find out if the loop was exited prematurely because of
-- an error or if the EOF marker was found.
if Source (Parse_Ptr) /= EOF then
Error_Msg
(File.Table (Chop_File).Name.all & ": error parsing offset info");
return;
end if;
-- Handle case of a chop file consisting only of config pragmas
if Unit.Last = First_Unit
and then Unit.Table (Unit.Last).Kind = Config_Pragmas
then
-- In compilation mode, we append such a file to gnat.adc
if Compilation_Mode then
Write_Config_File (Unit.Table (Unit.Last).Chop_File, First_Unit);
Unit.Decrement_Last;
-- In default (non-compilation) mode, this is invalid
else
Error_Msg
(File.Table (Chop_File).Name.all &
": no units found (only pragmas)");
Unit.Decrement_Last;
end if;
end if;
-- Handle case of a chop file ending with config pragmas. This can
-- happen only in default non-compilation mode, since in compilation
-- mode such configuration pragmas are part of the preceding unit.
-- We simply concatenate such pragmas to the previous file which
-- will cause a compilation error, which is appropriate.
if Unit.Last > First_Unit
and then Unit.Table (Unit.Last).Kind = Config_Pragmas
then
Unit.Decrement_Last;
end if;
end Parse_Offset_Info;
-----------------
-- Parse_Token --
-----------------
procedure Parse_Token
(Source : access String;
Ptr : in out Positive;
Token_Ptr : out Positive)
is
In_Quotes : Boolean := False;
begin
-- Skip separators
while Source (Ptr) = ' ' or Source (Ptr) = ',' loop
Ptr := Ptr + 1;
end loop;
Token_Ptr := Ptr;
-- Find end-of-token
while (In_Quotes or else not (Source (Ptr) = ' ' or Source (Ptr) = ','))
and then Source (Ptr) >= ' '
loop
if Source (Ptr) = '"' then
In_Quotes := not In_Quotes;
end if;
Ptr := Ptr + 1;
end loop;
end Parse_Token;
---------------
-- Read_File --
---------------
procedure Read_File
(FD : File_Descriptor;
Contents : out String_Access;
Success : out Boolean)
is
Length : constant File_Offset := File_Offset (File_Length (FD));
-- Include room for EOF char
Buffer : constant String_Access := new String (1 .. Length + 1);
This_Read : Integer;
Read_Ptr : File_Offset := 1;
begin
loop
This_Read := Read (FD,
A => Buffer (Read_Ptr)'Address,
N => Length + 1 - Read_Ptr);
Read_Ptr := Read_Ptr + Integer'Max (This_Read, 0);
exit when This_Read <= 0;
end loop;
Buffer (Read_Ptr) := EOF;
Contents := new String (1 .. Read_Ptr);
Contents.all := Buffer (1 .. Read_Ptr);
-- Things aren't simple on VMS due to the plethora of file types
-- and organizations. It seems clear that there shouldn't be more
-- bytes read than are contained in the file though.
if Hostparm.OpenVMS then
Success := Read_Ptr <= Length + 1;
else
Success := Read_Ptr = Length + 1;
end if;
end Read_File;
----------------------------
-- Report_Duplicate_Units --
----------------------------
function Report_Duplicate_Units return Boolean is
US : SUnit_Num;
U : Unit_Num;
Duplicates : Boolean := False;
begin
US := 1;
while US < SUnit_Num (Unit.Last) loop
U := Sorted_Units.Table (US);
if Is_Duplicated (US) then
Duplicates := True;
-- Move to last two versions of duplicated file to make it clearer
-- to understand which file is retained in case of overwriting.
while US + 1 < SUnit_Num (Unit.Last) loop
exit when not Is_Duplicated (US + 1);
US := US + 1;
end loop;
U := Sorted_Units.Table (US);
if Overwrite_Files then
Warning_Msg (Unit.Table (U).File_Name.all
& " is duplicated (all but last will be skipped)");
elsif Unit.Table (U).Chop_File =
Unit.Table (Sorted_Units.Table (US + 1)).Chop_File
then
Error_Msg (Unit.Table (U).File_Name.all
& " is duplicated in "
& File.Table (Unit.Table (U).Chop_File).Name.all);
else
Error_Msg (Unit.Table (U).File_Name.all
& " in "
& File.Table (Unit.Table (U).Chop_File).Name.all
& " is duplicated in "
& File.Table
(Unit.Table
(Sorted_Units.Table (US + 1)).Chop_File).Name.all);
end if;
end if;
US := US + 1;
end loop;
if Duplicates and not Overwrite_Files then
if Hostparm.OpenVMS then
Put_Line
("use /OVERWRITE to overwrite files and keep last version");
else
Put_Line ("use -w to overwrite files and keep last version");
end if;
end if;
return Duplicates;
end Report_Duplicate_Units;
--------------------
-- Scan_Arguments --
--------------------
function Scan_Arguments return Boolean is
Kset : Boolean := False;
-- Set true if -k switch found
begin
Initialize_Option_Scan;
-- Scan options first
loop
case Getopt ("c gnat? h k? p q r v w x") is
when ASCII.NUL =>
exit;
when 'c' =>
Compilation_Mode := True;
when 'g' =>
Gnat_Args :=
new Argument_List'(Gnat_Args.all &
new String'("-gnat" & Parameter));
when 'h' =>
Usage;
raise Terminate_Program;
when 'k' =>
declare
Param : String_Access := new String'(Parameter);
begin
if Param.all /= "" then
for J in Param'Range loop
if Param (J) not in '0' .. '9' then
if Hostparm.OpenVMS then
Error_Msg ("/FILE_NAME_MAX_LENGTH=nnn" &
" requires numeric parameter");
else
Error_Msg ("-k# requires numeric parameter");
end if;
return False;
end if;
end loop;
else
if Hostparm.OpenVMS then
Param := new String'("39");
else
Param := new String'("8");
end if;
end if;
Gnat_Args :=
new Argument_List'(Gnat_Args.all &
new String'("-gnatk" & Param.all));
Kset := True;
end;
when 'p' =>
Preserve_Mode := True;
when 'q' =>
Quiet_Mode := True;
when 'r' =>
Source_References := True;
when 'v' =>
Verbose_Mode := True;
Put_Line (Standard_Error, Cwrite);
when 'w' =>
Overwrite_Files := True;
when 'x' =>
Exit_On_Error := True;
when others =>
null;
end case;
end loop;
if not Kset and then Maximum_File_Name_Length > 0 then
-- If this system has restricted filename lengths, tell gnat1
-- about them, removing the leading blank from the image string.
Gnat_Args :=
new Argument_List'(Gnat_Args.all
& new String'("-gnatk"
& Maximum_File_Name_Length_String
(Maximum_File_Name_Length_String'First + 1
.. Maximum_File_Name_Length_String'Last)));
end if;
-- Scan file names
loop
declare
S : constant String := Get_Argument (Do_Expansion => True);
begin
exit when S = "";
File.Increment_Last;
File.Table (File.Last).Name := new String'(S);
File.Table (File.Last).SR_Name := null;
end;
end loop;
-- Case of more than one file where last file is a directory
if File.Last > 1
and then Is_Directory (File.Table (File.Last).Name.all)
then
Directory := File.Table (File.Last).Name;
File.Decrement_Last;
-- Make sure Directory is terminated with a directory separator,
-- so we can generate the output by just appending a filename.
if Directory (Directory'Last) /= Directory_Separator
and then Directory (Directory'Last) /= '/'
then
Directory := new String'(Directory.all & Directory_Separator);
end if;
-- At least one filename must be given
elsif File.Last = 0 then
Usage;
return False;
-- No directory given, set directory to null, so that we can just
-- concatenate the directory name to the file name unconditionally.
else
Directory := new String'("");
end if;
-- Finally check all filename arguments
for File_Num in 1 .. File.Last loop
declare
F : constant String := File.Table (File_Num).Name.all;
begin
if Is_Directory (F) then
Error_Msg (F & " is a directory, cannot be chopped");
return False;
elsif not Is_Regular_File (F) then
Error_Msg (F & " not found");
return False;
end if;
end;
end loop;
return True;
exception
when Invalid_Switch =>
Error_Msg ("invalid switch " & Full_Switch);
return False;
when Invalid_Parameter =>
if Hostparm.OpenVMS then
Error_Msg ("/FILE_NAME_MAX_LENGTH=nnn qualifier" &
" requires numeric parameter");
else
Error_Msg ("-k switch requires numeric parameter");
end if;
return False;
end Scan_Arguments;
----------------
-- Sort_Units --
----------------
procedure Sort_Units is
procedure Move (From : Natural; To : Natural);
-- Procedure used to sort the unit list
-- Unit.Table (To) := Unit_List (From); used by sort
function Lt (Left, Right : Natural) return Boolean;
-- Compares Left and Right units based on file name (first),
-- Chop_File (second) and Offset (third). This ordering is
-- important to keep the last version in case of duplicate files.
package Unit_Sort is new GNAT.Heap_Sort_G (Move, Lt);
-- Used for sorting on filename to detect duplicates
--------
-- Lt --
--------
function Lt (Left, Right : Natural) return Boolean is
L : Unit_Info renames
Unit.Table (Sorted_Units.Table (SUnit_Num (Left)));
R : Unit_Info renames
Unit.Table (Sorted_Units.Table (SUnit_Num (Right)));
begin
return L.File_Name.all < R.File_Name.all
or else (L.File_Name.all = R.File_Name.all
and then (L.Chop_File < R.Chop_File
or else (L.Chop_File = R.Chop_File
and then L.Offset < R.Offset)));
end Lt;
----------
-- Move --
----------
procedure Move (From : Natural; To : Natural) is
begin
Sorted_Units.Table (SUnit_Num (To)) :=
Sorted_Units.Table (SUnit_Num (From));
end Move;
-- Start of processing for Sort_Units
begin
Sorted_Units.Set_Last (SUnit_Num (Unit.Last));
for J in 1 .. Unit.Last loop
Sorted_Units.Table (SUnit_Num (J)) := J;
end loop;
-- Sort Unit.Table, using Sorted_Units.Table (0) as scratch
Unit_Sort.Sort (Natural (Unit.Last));
-- Set the Sorted_Index fields in the unit tables.
for J in 1 .. SUnit_Num (Unit.Last) loop
Unit.Table (Sorted_Units.Table (J)).Sorted_Index := J;
end loop;
end Sort_Units;
-----------
-- Usage --
-----------
procedure Usage is
begin
Put_Line
("Usage: gnatchop [-c] [-h] [-k#] " &
"[-r] [-p] [-q] [-v] [-w] [-x] file [file ...] [dir]");
New_Line;
Put_Line
(" -c compilation mode, configuration pragmas " &
"follow RM rules");
Put_Line
(" -gnatxxx passes the -gnatxxx switch to gnat parser");
Put_Line
(" -h help: output this usage information");
Put_Line
(" -k# krunch file names of generated files to " &
"no more than # characters");
Put_Line
(" -k krunch file names of generated files to " &
"no more than 8 characters");
Put_Line
(" -p preserve time stamp, output files will " &
"have same stamp as input");
Put_Line
(" -q quiet mode, no output of generated file " &
"names");
Put_Line
(" -r generate Source_Reference pragmas refer" &
"encing original source file");
Put_Line
(" -v verbose mode, output version and generat" &
"ed commands");
Put_Line
(" -w overwrite existing filenames");
Put_Line
(" -x exit on error");
New_Line;
Put_Line
(" file... list of source files to be chopped");
Put_Line
(" dir directory location for split files (defa" &
"ult = current directory)");
end Usage;
-----------------
-- Warning_Msg --
-----------------
procedure Warning_Msg (Message : String) is
begin
Warning_Count := Warning_Count + 1;
Put_Line (Standard_Error, "warning: " & Message);
end Warning_Msg;
-------------------------
-- Write_Chopped_Files --
-------------------------
function Write_Chopped_Files (Input : File_Num) return Boolean is
Name : aliased constant String :=
File.Table (Input).Name.all & ASCII.Nul;
FD : File_Descriptor;
Buffer : String_Access;
Success : Boolean;
TS_Time : OS_Time;
begin
FD := Open_Read (Name'Address, Binary);
TS_Time := File_Time_Stamp (FD);
if FD = Invalid_FD then
Error_Msg ("cannot open " & File.Table (Input).Name.all);
return False;
end if;
Read_File (FD, Buffer, Success);
if not Success then
Error_Msg ("cannot read " & File.Table (Input).Name.all);
Close (FD);
return False;
end if;
if not Quiet_Mode then
Put_Line ("splitting " & File.Table (Input).Name.all & " into:");
end if;
-- Only chop those units that come from this file
for Num in 1 .. Unit.Last loop
if Unit.Table (Num).Chop_File = Input then
Write_Unit (Buffer, Num, TS_Time, Success);
exit when not Success;
end if;
end loop;
Close (FD);
return Success;
end Write_Chopped_Files;
-----------------------
-- Write_Config_File --
-----------------------
procedure Write_Config_File (Input : File_Num; U : Unit_Num) is
FD : File_Descriptor;
Name : aliased constant String := "gnat.adc" & ASCII.NUL;
Buffer : String_Access;
Success : Boolean;
Append : Boolean;
Buffera : String_Access;
Bufferl : Natural;
begin
Write_gnat_adc := True;
FD := Open_Read_Write (Name'Address, Binary);
if FD = Invalid_FD then
FD := Create_File (Name'Address, Binary);
Append := False;
if not Quiet_Mode then
Put_Line ("writing configuration pragmas from " &
File.Table (Input).Name.all & " to gnat.adc");
end if;
else
Append := True;
if not Quiet_Mode then
Put_Line
("appending configuration pragmas from " &
File.Table (Input).Name.all & " to gnat.adc");
end if;
end if;
Success := FD /= Invalid_FD;
if not Success then
Error_Msg ("cannot create gnat.adc");
return;
end if;
-- In append mode, acquire existing gnat.adc file
if Append then
Read_File (FD, Buffera, Success);
if not Success then
Error_Msg ("cannot read gnat.adc");
return;
end if;
-- Find location of EOF byte if any to exclude from append
Bufferl := 1;
while Bufferl <= Buffera'Last
and then Buffera (Bufferl) /= EOF
loop
Bufferl := Bufferl + 1;
end loop;
Bufferl := Bufferl - 1;
Close (FD);
-- Write existing gnat.adc to new gnat.adc file
FD := Create_File (Name'Address, Binary);
Success := Write (FD, Buffera (1)'Address, Bufferl) = Bufferl;
if not Success then
Error_Msg ("error writing gnat.adc");
return;
end if;
end if;
Buffer := Get_Config_Pragmas (Input, U);
if Buffer /= null then
Success := Write (FD, Buffer.all'Address, Buffer'Length) =
Buffer'Length;
if not Success then
Error_Msg ("disk full writing gnat.adc");
return;
end if;
end if;
Close (FD);
end Write_Config_File;
-----------------------------------
-- Write_Source_Reference_Pragma --
-----------------------------------
procedure Write_Source_Reference_Pragma
(Info : Unit_Info;
Line : Line_Num;
FD : File_Descriptor;
EOL : EOL_String;
Success : in out Boolean)
is
FTE : File_Entry renames File.Table (Info.Chop_File);
Nam : String_Access;
begin
if Success and Source_References and not Info.SR_Present then
if FTE.SR_Name /= null then
Nam := FTE.SR_Name;
else
Nam := FTE.Name;
end if;
declare
Reference : aliased String :=
"pragma Source_Reference (000000, """
& Nam.all & """);" & EOL.Str;
Pos : Positive := Reference'First;
Lin : Line_Num := Line;
begin
while Reference (Pos + 1) /= ',' loop
Pos := Pos + 1;
end loop;
while Reference (Pos) = '0' loop
Reference (Pos) := Character'Val
(Character'Pos ('0') + Lin mod 10);
Lin := Lin / 10;
Pos := Pos - 1;
end loop;
-- Assume there are enough zeroes for any program length
pragma Assert (Lin = 0);
Success :=
Write (FD, Reference'Address, Reference'Length)
= Reference'Length;
end;
end if;
end Write_Source_Reference_Pragma;
----------------
-- Write_Unit --
----------------
procedure Write_Unit
(Source : access String;
Num : Unit_Num;
TS_Time : OS_Time;
Success : out Boolean)
is
Info : Unit_Info renames Unit.Table (Num);
FD : File_Descriptor;
Name : aliased constant String := Info.File_Name.all & ASCII.NUL;
Length : File_Offset;
EOL : constant EOL_String :=
Get_EOL (Source, Source'First + Info.Offset);
begin
-- Skip duplicated files
if Is_Duplicated (Info.Sorted_Index) then
Put_Line (" " & Info.File_Name.all & " skipped");
Success := Overwrite_Files;
return;
end if;
if Overwrite_Files then
FD := Create_File (Name'Address, Binary);
else
FD := Create_New_File (Name'Address, Binary);
end if;
Success := FD /= Invalid_FD;
if not Success then
Error_Msg ("cannot create " & Info.File_Name.all);
return;
end if;
-- A length of 0 indicates that the rest of the file belongs to
-- this unit. The actual length must be calculated now. Take into
-- account that the last character (EOF) must not be written.
if Info.Length = 0 then
Length := Source'Last - (Source'First + Info.Offset);
else
Length := Info.Length;
end if;
-- Prepend configuration pragmas if necessary
if Success and then Info.Bufferg /= null then
Write_Source_Reference_Pragma (Info, 1, FD, EOL, Success);
Success :=
Write (FD, Info.Bufferg.all'Address, Info.Bufferg'Length) =
Info.Bufferg'Length;
end if;
Write_Source_Reference_Pragma (Info, Info.Start_Line, FD, EOL, Success);
if Success then
Success := Write (FD, Source (Source'First + Info.Offset)'Address,
Length) = Length;
end if;
if not Success then
Error_Msg ("disk full writing " & Info.File_Name.all);
return;
end if;
if not Quiet_Mode then
Put_Line (" " & Info.File_Name.all);
end if;
Close (FD);
if Preserve_Mode then
File_Time_Stamp (Name'Address, TS_Time);
end if;
end Write_Unit;
-- Start of processing for gnatchop
begin
-- Check presence of required executables
Gnat_Cmd := Locate_Executable ("gcc");
if Gnat_Cmd = null then
goto No_Files_Written;
end if;
-- Process command line options and initialize global variables
if not Scan_Arguments then
Set_Exit_Status (Failure);
return;
end if;
-- First parse all files and read offset information
for Num in 1 .. File.Last loop
if not Parse_File (Num) then
goto No_Files_Written;
end if;
end loop;
-- Check if any units have been found (assumes non-empty Unit.Table)
if Unit.Last = 0 then
if not Write_gnat_adc then
Error_Msg ("no compilation units found");
end if;
goto No_Files_Written;
end if;
Sort_Units;
-- Check if any duplicate files would be created. If so, emit
-- a warning if Overwrite_Files is true, otherwise generate an error.
if Report_Duplicate_Units and then not Overwrite_Files then
goto No_Files_Written;
end if;
-- Check if any files exist, if so do not write anything
-- Because all files have been parsed and checked already,
-- there won't be any duplicates
if not Overwrite_Files and then Files_Exist then
goto No_Files_Written;
end if;
-- After this point, all source files are read in succession
-- and chopped into their destination files.
-- As the Source_File_Name pragmas are handled as logical file 0,
-- write it first.
for F in 1 .. File.Last loop
if not Write_Chopped_Files (F) then
Set_Exit_Status (Failure);
return;
end if;
end loop;
if Warning_Count > 0 then
declare
Warnings_Msg : String := Warning_Count'Img & " warning(s)";
begin
Error_Msg (Warnings_Msg (2 .. Warnings_Msg'Last));
end;
end if;
return;
<<No_Files_Written>>
-- Special error exit for all situations where no files have
-- been written.
if not Write_gnat_adc then
Error_Msg ("no source files written");
end if;
return;
exception
when Terminate_Program =>
null;
end Gnatchop;
|
-- Abstract :
--
-- see spec
--
-- Copyright (C) 2014 - 2019 All Rights Reserved.
--
-- 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 MERCHAN- TABILITY or FITNESS FOR A
-- PARTICULAR PURPOSE.
--
-- As a special exception under Section 7 of GPL version 3, you are granted
-- additional permissions described in the GCC Runtime Library Exception,
-- version 3.1, as published by the Free Software Foundation.
pragma License (Modified_GPL);
package body WisiToken.Parse.LR.Parser_Lists is
function Parser_Stack_Image
(Stack : in Parser_Stacks.Stack;
Descriptor : in WisiToken.Descriptor;
Tree : in Syntax_Trees.Tree;
Depth : in SAL.Base_Peek_Type := 0)
return String
is
use Ada.Strings.Unbounded;
Last : constant SAL.Base_Peek_Type :=
(if Depth = 0
then Stack.Depth
else SAL.Base_Peek_Type'Min (Depth, Stack.Depth));
Result : Unbounded_String := +"(";
begin
for I in 1 .. Last loop
declare
use all type WisiToken.Syntax_Trees.Node_Index;
Item : Parser_Stack_Item renames Stack.Peek (I);
begin
Result := Result &
((if Item.State = Unknown_State then " " else Trimmed_Image (Item.State)) & " :" &
(if I = Stack.Depth
then ""
else
(if Item.Token = Syntax_Trees.Invalid_Node_Index -- From recover fast-forward
then ""
else Tree.Image (Item.Token, Descriptor) & ", ")));
end;
end loop;
return To_String (Result & ")");
end Parser_Stack_Image;
function New_List (Shared_Tree : in Syntax_Trees.Base_Tree_Access) return List
is
First_Parser_Label : constant := 0;
Parser : Parser_State := (Label => First_Parser_Label, others => <>);
begin
Parser.Tree.Initialize (Shared_Tree, Flush => True);
return Result : List
do
Result.Parser_Label := First_Parser_Label;
Result.Elements.Append (Parser);
end return;
end New_List;
function Last_Label (List : in Parser_Lists.List) return Natural
is begin
return List.Parser_Label;
end Last_Label;
function Count (List : in Parser_Lists.List) return SAL.Base_Peek_Type
is begin
return List.Elements.Length;
end Count;
function First (List : aliased in out Parser_Lists.List'Class) return Cursor
is begin
return (Elements => List.Elements'Access, Ptr => List.Elements.First);
end First;
procedure Next (Cursor : in out Parser_Lists.Cursor)
is begin
Parser_State_Lists.Next (Cursor.Ptr);
end Next;
function Is_Done (Cursor : in Parser_Lists.Cursor) return Boolean
is
use Parser_State_Lists;
begin
return Cursor.Ptr = No_Element;
end Is_Done;
function Active_Parser_Count (Cursor : in Parser_Lists.Cursor) return SAL.Base_Peek_Type
is begin
return Cursor.Elements.Length;
end Active_Parser_Count;
function Label (Cursor : in Parser_Lists.Cursor) return Natural
is begin
return Parser_State_Lists.Constant_Ref (Cursor.Ptr).Label;
end Label;
function Total_Recover_Cost (Cursor : in Parser_Lists.Cursor) return Integer
is
Result : Integer := 0;
begin
for Error of Parser_State_Lists.Constant_Ref (Cursor.Ptr).Errors loop
Result := Error.Recover.Cost;
end loop;
return Result;
end Total_Recover_Cost;
function Max_Recover_Ops_Length (Cursor : in Parser_Lists.Cursor) return Ada.Containers.Count_Type
is
use Ada.Containers;
use Config_Op_Arrays;
Result : Count_Type := 0;
Errors : Parse_Error_Lists.List renames Parser_State_Lists.Constant_Ref (Cursor.Ptr).Errors;
begin
for Error of Errors loop
if Length (Error.Recover.Ops) > Result then
Result := Length (Error.Recover.Ops);
end if;
end loop;
return Result;
end Max_Recover_Ops_Length;
function Min_Recover_Cost (Cursor : in Parser_Lists.Cursor) return Integer
is
Result : Integer := Integer'Last;
Errors : Parse_Error_Lists.List renames Parser_State_Lists.Constant_Ref (Cursor.Ptr).Errors;
begin
for Error of Errors loop
if Error.Recover.Cost < Result then
Result := Error.Recover.Cost;
end if;
end loop;
return Result;
end Min_Recover_Cost;
procedure Set_Verb (Cursor : in Parser_Lists.Cursor; Verb : in All_Parse_Action_Verbs)
is begin
Parser_State_Lists.Variable_Ref (Cursor.Ptr).Verb := Verb;
end Set_Verb;
function Verb (Cursor : in Parser_Lists.Cursor) return All_Parse_Action_Verbs
is begin
return Parser_State_Lists.Constant_Ref (Cursor.Ptr).Verb;
end Verb;
procedure Terminate_Parser
(Parsers : in out List;
Current : in out Cursor'Class;
Message : in String;
Trace : in out WisiToken.Trace'Class;
Terminals : in Base_Token_Arrays.Vector)
is
State : Parser_State renames Parser_State_Lists.Constant_Ref (Current.Ptr).Element.all;
begin
if Trace_Parse > Outline then
Trace.Put_Line
(Integer'Image (Current.Label) & ": terminate (" &
Trimmed_Image (Integer (Parsers.Count) - 1) & " active)" &
": " & Message & Image
(State.Tree.Min_Terminal_Index (State.Current_Token),
Terminals, Trace.Descriptor.all));
end if;
Current.Free;
if Parsers.Count = 1 then
Parsers.First.State_Ref.Tree.Flush;
end if;
end Terminate_Parser;
procedure Duplicate_State
(Parsers : in out List;
Current : in out Cursor'Class;
Trace : in out WisiToken.Trace'Class;
Terminals : in Base_Token_Arrays.Vector)
is
use all type Ada.Containers.Count_Type;
function Compare
(Stack_1 : in Parser_Stacks.Stack;
Tree_1 : in Syntax_Trees.Tree;
Stack_2 : in Parser_Stacks.Stack;
Tree_2 : in Syntax_Trees.Tree)
return Boolean
is
begin
if Stack_1.Depth /= Stack_2.Depth then
return False;
else
for I in reverse 1 .. Stack_1.Depth - 1 loop
-- Assume they differ near the top; no point in comparing bottom
-- item. The syntax trees will differ even if the tokens on the stack
-- are the same, so compare the tokens.
declare
Item_1 : Parser_Stack_Item renames Stack_1 (I);
Item_2 : Parser_Stack_Item renames Stack_2 (I);
begin
if Item_1.State /= Item_2.State then
return False;
else
if not Syntax_Trees.Same_Token (Tree_1, Item_1.Token, Tree_2, Item_2.Token) then
return False;
end if;
end if;
end;
end loop;
return True;
end if;
end Compare;
Other : Cursor := Parsers.First;
begin
loop
exit when Other.Is_Done;
declare
Other_Parser : Parser_State renames Other.State_Ref;
begin
if Other.Label /= Current.Label and then
Other.Verb /= Error and then
Compare
(Other_Parser.Stack, Other_Parser.Tree, Current.State_Ref.Stack, Current.State_Ref.Tree)
then
exit;
end if;
end;
Other.Next;
end loop;
if not Other.Is_Done then
-- Both have the same number of errors, otherwise one would have been
-- terminated earlier.
if Other.Total_Recover_Cost = Current.Total_Recover_Cost then
if Other.Max_Recover_Ops_Length = Current.Max_Recover_Ops_Length then
Parsers.Terminate_Parser (Other, "duplicate state: random", Trace, Terminals);
else
if Other.Max_Recover_Ops_Length > Current.Max_Recover_Ops_Length then
null;
else
Other := Cursor (Current);
Current.Next;
end if;
Parsers.Terminate_Parser (Other, "duplicate state: ops length", Trace, Terminals);
end if;
else
if Other.Total_Recover_Cost > Current.Total_Recover_Cost then
null;
else
Other := Cursor (Current);
Current.Next;
end if;
Parsers.Terminate_Parser (Other, "duplicate state: cost", Trace, Terminals);
end if;
end if;
end Duplicate_State;
function State_Ref (Position : in Cursor) return State_Reference
is begin
return (Element => Parser_State_Lists.Constant_Ref (Position.Ptr).Element);
end State_Ref;
function First_State_Ref (List : in Parser_Lists.List'Class) return State_Reference
is begin
return (Element => Parser_State_Lists.Constant_Ref (List.Elements.First).Element);
end First_State_Ref;
function First_Constant_State_Ref (List : in Parser_Lists.List'Class) return Constant_State_Reference
is begin
return (Element => Parser_State_Lists.Constant_Ref (List.Elements.First).Element);
end First_Constant_State_Ref;
procedure Put_Top_10 (Trace : in out WisiToken.Trace'Class; Cursor : in Parser_Lists.Cursor)
is
Parser_State : Parser_Lists.Parser_State renames Parser_State_Lists.Constant_Ref (Cursor.Ptr);
begin
Trace.Put (Natural'Image (Parser_State.Label) & " stack: ");
Trace.Put_Line (Image (Parser_State.Stack, Trace.Descriptor.all, Parser_State.Tree, Depth => 10));
end Put_Top_10;
procedure Prepend_Copy
(List : in out Parser_Lists.List;
Cursor : in Parser_Lists.Cursor'Class)
is
New_Item : Parser_State;
begin
List.Parser_Label := List.Parser_Label + 1;
declare
Item : Parser_State renames Parser_State_Lists.Variable_Ref (Cursor.Ptr);
-- We can't do 'Prepend' in the scope of this 'renames';
-- that would be tampering with cursors.
begin
Item.Tree.Set_Flush_False;
-- We specify all items individually, rather copy Item and then
-- override a few, to avoid copying large items like Recover.
-- We copy Recover.Enqueue_Count .. Check_Count for unit tests.
New_Item :=
(Shared_Token => Item.Shared_Token,
Recover_Insert_Delete => Item.Recover_Insert_Delete,
Prev_Deleted => Item.Prev_Deleted,
Current_Token => Item.Current_Token,
Inc_Shared_Token => Item.Inc_Shared_Token,
Stack => Item.Stack,
Tree => Item.Tree,
Recover =>
(Enqueue_Count => Item.Recover.Enqueue_Count,
Config_Full_Count => Item.Recover.Config_Full_Count,
Check_Count => Item.Recover.Check_Count,
others => <>),
Resume_Active => Item.Resume_Active,
Resume_Token_Goal => Item.Resume_Token_Goal,
Conflict_During_Resume => Item.Conflict_During_Resume,
Zombie_Token_Count => 0,
Errors => Item.Errors,
Label => List.Parser_Label,
Verb => Item.Verb);
end;
List.Elements.Prepend (New_Item);
end Prepend_Copy;
procedure Free (Cursor : in out Parser_Lists.Cursor'Class)
is
Temp : Parser_State_Lists.Cursor := Cursor.Ptr;
begin
Parser_State_Lists.Next (Cursor.Ptr);
Parser_State_Lists.Delete (Cursor.Elements.all, Temp);
end Free;
----------
-- stuff for iterators
function To_Cursor (Ptr : in Parser_Node_Access) return Cursor
is begin
return (Ptr.Elements, Ptr.Ptr);
end To_Cursor;
function Constant_Reference
(Container : aliased in List'Class;
Position : in Parser_Node_Access)
return Constant_Reference_Type
is
pragma Unreferenced (Container);
begin
return (Element => Parser_State_Lists.Constant_Ref (Position.Ptr).Element);
end Constant_Reference;
function Reference
(Container : aliased in out List'Class;
Position : in Parser_Node_Access)
return State_Reference
is
pragma Unreferenced (Container);
begin
return (Element => Parser_State_Lists.Variable_Ref (Position.Ptr).Element);
end Reference;
function Persistent_State_Ref (Position : in Parser_Node_Access) return State_Access
is begin
return State_Access (Parser_State_Lists.Persistent_Ref (Position.Ptr));
end Persistent_State_Ref;
type List_Access is access all List;
type Iterator is new Iterator_Interfaces.Forward_Iterator with record
Container : List_Access;
end record;
overriding function First (Object : Iterator) return Parser_Node_Access;
overriding function Next
(Object : in Iterator;
Position : in Parser_Node_Access)
return Parser_Node_Access;
overriding function First (Object : Iterator) return Parser_Node_Access
is begin
return (Elements => Object.Container.Elements'Access, Ptr => Object.Container.Elements.First);
end First;
overriding function Next
(Object : in Iterator;
Position : in Parser_Node_Access)
return Parser_Node_Access
is
pragma Unreferenced (Object);
begin
return (Position.Elements, Parser_State_Lists.Next (Position.Ptr));
end Next;
function Iterate (Container : aliased in out List) return Iterator_Interfaces.Forward_Iterator'Class
is begin
return Iterator'(Container => Container'Access);
end Iterate;
function Has_Element (Iterator : in Parser_Node_Access) return Boolean
is begin
return Parser_State_Lists.Has_Element (Iterator.Ptr);
end Has_Element;
function Label (Iterator : in Parser_State) return Natural
is begin
return Iterator.Label;
end Label;
function Verb (Iterator : in Parser_State) return All_Parse_Action_Verbs
is begin
return Iterator.Verb;
end Verb;
procedure Set_Verb (Iterator : in out Parser_State; Verb : in All_Parse_Action_Verbs)
is begin
Iterator.Verb := Verb;
end Set_Verb;
end WisiToken.Parse.LR.Parser_Lists;
|
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="15">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName/>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>dct_2d</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_block</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in_block</originalName>
<rtlName/>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>64</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_block</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>out_block</originalName>
<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>70</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_3">
<Value>
<Obj>
<type>0</type>
<id>4</id>
<name>row_outbuf</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>row_outbuf_U</rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>110</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>5</id>
<name>col_outbuf</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>col_outbuf_U</rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>111</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>6</id>
<name>col_inbuf</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>/usr/local/labs/SDS/current/ge46bod/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>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>col_inbuf</originalName>
<rtlName>col_inbuf_U</rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>112</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>3</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>7</id>
<name>_ln74</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>74</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>113</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.73</m_delay>
<m_topoIndex>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>i_0</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>115</item>
<item>116</item>
<item>117</item>
<item>118</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>icmp_ln74</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>74</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>icmp_ln74_fu_190_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>119</item>
<item>121</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.72</m_delay>
<m_topoIndex>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>i</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>74</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName>i_fu_196_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>122</item>
<item>124</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.80</m_delay>
<m_topoIndex>7</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name>_ln74</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>74</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>125</item>
<item>126</item>
<item>127</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>8</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>_ln75</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>grp_dct_1d2_fu_175</rtlName>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>6</count>
<item_version>0</item_version>
<item>130</item>
<item>131</item>
<item>132</item>
<item>133</item>
<item>134</item>
<item>258</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.73</m_delay>
<m_topoIndex>9</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>_ln74</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>74</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>135</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>11</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>_ln79</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>79</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>79</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>128</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.73</m_delay>
<m_topoIndex>10</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>j_0</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>136</item>
<item>137</item>
<item>138</item>
<item>139</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>12</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>icmp_ln79</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>79</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>79</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>icmp_ln79_fu_202_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>140</item>
<item>141</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.72</m_delay>
<m_topoIndex>13</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>j</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>79</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>79</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName>j_fu_208_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>142</item>
<item>143</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.80</m_delay>
<m_topoIndex>14</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>_ln79</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>79</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>79</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>144</item>
<item>145</item>
<item>146</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>15</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>zext_ln82</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>zext_ln82_fu_214_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>148</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>16</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>tmp_2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_2_fu_218_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>150</item>
<item>151</item>
<item>153</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>17</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>zext_ln81</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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/>
<rtlName>zext_ln81_fu_226_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>154</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>18</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>_ln81</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>155</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.73</m_delay>
<m_topoIndex>19</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>i_1</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>156</item>
<item>157</item>
<item>158</item>
<item>159</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>21</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>icmp_ln81</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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/>
<rtlName>icmp_ln81_fu_230_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>160</item>
<item>161</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.72</m_delay>
<m_topoIndex>22</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>i_5</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>i</originalName>
<rtlName>i_5_fu_236_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>162</item>
<item>163</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.80</m_delay>
<m_topoIndex>23</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name>_ln81</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>164</item>
<item>165</item>
<item>166</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>24</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>zext_ln82_1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>zext_ln82_1_fu_242_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>167</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>25</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>tmp_3</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_3_fu_246_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>168</item>
<item>169</item>
<item>170</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>26</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>zext_ln82_2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>zext_ln82_2_fu_254_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>171</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>27</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>add_ln82</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>add_ln82_fu_258_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>172</item>
<item>173</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.85</m_delay>
<m_topoIndex>28</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>zext_ln82_3</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>zext_ln82_3_fu_263_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>174</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>29</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>row_outbuf_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>175</item>
<item>177</item>
<item>178</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>30</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name>add_ln82_1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>add_ln82_1_fu_268_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>179</item>
<item>180</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.85</m_delay>
<m_topoIndex>31</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name>zext_ln82_4</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>zext_ln82_4_fu_273_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>181</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>34</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name>col_inbuf_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>182</item>
<item>183</item>
<item>184</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>35</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>row_outbuf_load</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>185</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.29</m_delay>
<m_topoIndex>32</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>51</id>
<name>col_inbuf_addr_write_ln82</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>186</item>
<item>187</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.29</m_delay>
<m_topoIndex>36</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name>_ln81</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>188</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>37</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>_ln79</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>79</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>79</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>189</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>33</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name>_ln85</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>85</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>85</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>147</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.73</m_delay>
<m_topoIndex>20</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>59</id>
<name>i_2</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>190</item>
<item>191</item>
<item>192</item>
<item>193</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>38</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name>icmp_ln85</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>85</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>85</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>icmp_ln85_fu_277_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>194</item>
<item>195</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.72</m_delay>
<m_topoIndex>39</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>62</id>
<name>i_4</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>85</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>85</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName>i_4_fu_283_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>196</item>
<item>197</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.80</m_delay>
<m_topoIndex>40</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>63</id>
<name>_ln85</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>85</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>85</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>198</item>
<item>199</item>
<item>200</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>41</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>66</id>
<name>_ln86</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>86</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>86</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>grp_dct_1d2_fu_175</rtlName>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>6</count>
<item_version>0</item_version>
<item>202</item>
<item>203</item>
<item>204</item>
<item>205</item>
<item>206</item>
<item>259</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.73</m_delay>
<m_topoIndex>42</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>67</id>
<name>_ln85</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>85</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>85</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>207</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>44</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>69</id>
<name>_ln90</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>90</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>90</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>201</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.73</m_delay>
<m_topoIndex>43</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>71</id>
<name>j_1</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>208</item>
<item>209</item>
<item>210</item>
<item>211</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>45</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>72</id>
<name>icmp_ln90</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>90</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>90</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>icmp_ln90_fu_289_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>212</item>
<item>213</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.72</m_delay>
<m_topoIndex>46</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>74</id>
<name>j_2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>90</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>90</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName>j_2_fu_295_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>214</item>
<item>215</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.80</m_delay>
<m_topoIndex>47</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>75</id>
<name>_ln90</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>90</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>90</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>216</item>
<item>217</item>
<item>218</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>48</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>79</id>
<name>zext_ln93</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>93</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>93</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>zext_ln93_fu_301_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>219</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>49</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_52">
<Value>
<Obj>
<type>0</type>
<id>80</id>
<name>tmp_4</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>93</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>93</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_4_fu_305_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>220</item>
<item>221</item>
<item>222</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>50</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_53">
<Value>
<Obj>
<type>0</type>
<id>81</id>
<name>zext_ln92</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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/>
<rtlName>zext_ln92_fu_313_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>223</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>51</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_54">
<Value>
<Obj>
<type>0</type>
<id>82</id>
<name>_ln92</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>224</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.73</m_delay>
<m_topoIndex>52</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_55">
<Value>
<Obj>
<type>0</type>
<id>84</id>
<name>i_3</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>225</item>
<item>226</item>
<item>227</item>
<item>228</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>54</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_56">
<Value>
<Obj>
<type>0</type>
<id>85</id>
<name>icmp_ln92</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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/>
<rtlName>icmp_ln92_fu_317_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>229</item>
<item>230</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.72</m_delay>
<m_topoIndex>55</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_57">
<Value>
<Obj>
<type>0</type>
<id>87</id>
<name>i_6</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>i</originalName>
<rtlName>i_6_fu_323_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>231</item>
<item>232</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.80</m_delay>
<m_topoIndex>56</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_58">
<Value>
<Obj>
<type>0</type>
<id>88</id>
<name>_ln92</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>233</item>
<item>234</item>
<item>235</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>57</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_59">
<Value>
<Obj>
<type>0</type>
<id>91</id>
<name>zext_ln93_1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>93</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>93</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>zext_ln93_1_fu_329_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>236</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>58</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_60">
<Value>
<Obj>
<type>0</type>
<id>92</id>
<name>add_ln93</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>93</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>93</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>add_ln93_fu_333_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>237</item>
<item>238</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.85</m_delay>
<m_topoIndex>59</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_61">
<Value>
<Obj>
<type>0</type>
<id>93</id>
<name>zext_ln93_2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>93</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>93</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>zext_ln93_2_fu_360_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>239</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>67</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_62">
<Value>
<Obj>
<type>0</type>
<id>94</id>
<name>out_block_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>93</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>93</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>240</item>
<item>241</item>
<item>242</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>68</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_63">
<Value>
<Obj>
<type>0</type>
<id>95</id>
<name>tmp_5</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>93</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>93</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_5_fu_338_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>243</item>
<item>244</item>
<item>245</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>60</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_64">
<Value>
<Obj>
<type>0</type>
<id>96</id>
<name>zext_ln93_3</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>93</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>93</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>zext_ln93_3_fu_346_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>246</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>61</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_65">
<Value>
<Obj>
<type>0</type>
<id>97</id>
<name>add_ln93_1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>93</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>93</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>add_ln93_1_fu_350_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>247</item>
<item>248</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.85</m_delay>
<m_topoIndex>62</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_66">
<Value>
<Obj>
<type>0</type>
<id>98</id>
<name>zext_ln93_4</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>93</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>93</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>zext_ln93_4_fu_355_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>249</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>63</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_67">
<Value>
<Obj>
<type>0</type>
<id>99</id>
<name>col_outbuf_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>93</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>93</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>250</item>
<item>251</item>
<item>252</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>64</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_68">
<Value>
<Obj>
<type>0</type>
<id>100</id>
<name>col_outbuf_load</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>93</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>93</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>253</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.29</m_delay>
<m_topoIndex>65</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_69">
<Value>
<Obj>
<type>0</type>
<id>101</id>
<name>out_block_addr_write_ln93</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>93</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>93</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>254</item>
<item>255</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.29</m_delay>
<m_topoIndex>69</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_70">
<Value>
<Obj>
<type>0</type>
<id>102</id>
<name>_ln92</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>256</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>70</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_71">
<Value>
<Obj>
<type>0</type>
<id>105</id>
<name>_ln90</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>90</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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>90</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>257</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>66</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_72">
<Value>
<Obj>
<type>0</type>
<id>107</id>
<name>_ln94</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/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/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>53</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_73">
<Value>
<Obj>
<type>2</type>
<id>109</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_74">
<Value>
<Obj>
<type>2</type>
<id>114</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_75">
<Value>
<Obj>
<type>2</type>
<id>120</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_76">
<Value>
<Obj>
<type>2</type>
<id>123</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_77">
<Value>
<Obj>
<type>2</type>
<id>129</id>
<name>dct_1d2</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:dct_1d2></content>
</item>
<item class_id_reference="16" object_id="_78">
<Value>
<Obj>
<type>2</type>
<id>152</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_79">
<Value>
<Obj>
<type>2</type>
<id>176</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</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="_80">
<Obj>
<type>3</type>
<id>8</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>4</item>
<item>5</item>
<item>6</item>
<item>7</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_81">
<Obj>
<type>3</type>
<id>14</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>9</item>
<item>10</item>
<item>12</item>
<item>13</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_82">
<Obj>
<type>3</type>
<id>18</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>16</item>
<item>17</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_83">
<Obj>
<type>3</type>
<id>20</id>
<name>.preheader2.preheader</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_84">
<Obj>
<type>3</type>
<id>26</id>
<name>.preheader2</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>21</item>
<item>22</item>
<item>24</item>
<item>25</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_85">
<Obj>
<type>3</type>
<id>33</id>
<name>Xpose_Row_Outer_Loop_begin</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>29</item>
<item>30</item>
<item>31</item>
<item>32</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_86">
<Obj>
<type>3</type>
<id>39</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>34</item>
<item>35</item>
<item>37</item>
<item>38</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_87">
<Obj>
<type>3</type>
<id>53</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>12</count>
<item_version>0</item_version>
<item>41</item>
<item>42</item>
<item>43</item>
<item>44</item>
<item>45</item>
<item>46</item>
<item>47</item>
<item>48</item>
<item>49</item>
<item>50</item>
<item>51</item>
<item>52</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_88">
<Obj>
<type>3</type>
<id>56</id>
<name>Xpose_Row_Outer_Loop_end</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_89">
<Obj>
<type>3</type>
<id>58</id>
<name>.preheader1.preheader</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_90">
<Obj>
<type>3</type>
<id>64</id>
<name>.preheader1</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>59</item>
<item>60</item>
<item>62</item>
<item>63</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_91">
<Obj>
<type>3</type>
<id>68</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>66</item>
<item>67</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_92">
<Obj>
<type>3</type>
<id>70</id>
<name>.preheader.preheader</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>69</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_93">
<Obj>
<type>3</type>
<id>76</id>
<name>.preheader</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>71</item>
<item>72</item>
<item>74</item>
<item>75</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_94">
<Obj>
<type>3</type>
<id>83</id>
<name>Xpose_Col_Outer_Loop_begin</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>79</item>
<item>80</item>
<item>81</item>
<item>82</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_95">
<Obj>
<type>3</type>
<id>89</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>84</item>
<item>85</item>
<item>87</item>
<item>88</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_96">
<Obj>
<type>3</type>
<id>103</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>12</count>
<item_version>0</item_version>
<item>91</item>
<item>92</item>
<item>93</item>
<item>94</item>
<item>95</item>
<item>96</item>
<item>97</item>
<item>98</item>
<item>99</item>
<item>100</item>
<item>101</item>
<item>102</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_97">
<Obj>
<type>3</type>
<id>106</id>
<name>Xpose_Col_Outer_Loop_end</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>105</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_98">
<Obj>
<type>3</type>
<id>108</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>107</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>163</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_99">
<id>110</id>
<edge_type>1</edge_type>
<source_obj>109</source_obj>
<sink_obj>4</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_100">
<id>111</id>
<edge_type>1</edge_type>
<source_obj>109</source_obj>
<sink_obj>5</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_101">
<id>112</id>
<edge_type>1</edge_type>
<source_obj>109</source_obj>
<sink_obj>6</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_102">
<id>113</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>7</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_103">
<id>115</id>
<edge_type>1</edge_type>
<source_obj>114</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_104">
<id>116</id>
<edge_type>2</edge_type>
<source_obj>8</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_105">
<id>117</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_106">
<id>118</id>
<edge_type>2</edge_type>
<source_obj>18</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_107">
<id>119</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>10</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_108">
<id>121</id>
<edge_type>1</edge_type>
<source_obj>120</source_obj>
<sink_obj>10</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_109">
<id>122</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>12</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_110">
<id>124</id>
<edge_type>1</edge_type>
<source_obj>123</source_obj>
<sink_obj>12</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_111">
<id>125</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>13</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_112">
<id>126</id>
<edge_type>2</edge_type>
<source_obj>18</source_obj>
<sink_obj>13</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_113">
<id>127</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>13</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_114">
<id>128</id>
<edge_type>2</edge_type>
<source_obj>26</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_115">
<id>130</id>
<edge_type>1</edge_type>
<source_obj>129</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_116">
<id>131</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="_117">
<id>132</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_118">
<id>133</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_119">
<id>134</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_120">
<id>135</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>17</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_121">
<id>136</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_122">
<id>137</id>
<edge_type>2</edge_type>
<source_obj>56</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_123">
<id>138</id>
<edge_type>1</edge_type>
<source_obj>114</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_124">
<id>139</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_125">
<id>140</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="_126">
<id>141</id>
<edge_type>1</edge_type>
<source_obj>120</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_127">
<id>142</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_128">
<id>143</id>
<edge_type>1</edge_type>
<source_obj>123</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_129">
<id>144</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_130">
<id>145</id>
<edge_type>2</edge_type>
<source_obj>33</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_131">
<id>146</id>
<edge_type>2</edge_type>
<source_obj>58</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_132">
<id>147</id>
<edge_type>2</edge_type>
<source_obj>64</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_133">
<id>148</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_134">
<id>151</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_135">
<id>153</id>
<edge_type>1</edge_type>
<source_obj>152</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_136">
<id>154</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="_137">
<id>155</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_138">
<id>156</id>
<edge_type>1</edge_type>
<source_obj>114</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_139">
<id>157</id>
<edge_type>2</edge_type>
<source_obj>33</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_140">
<id>158</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_141">
<id>159</id>
<edge_type>2</edge_type>
<source_obj>53</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_142">
<id>160</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_143">
<id>161</id>
<edge_type>1</edge_type>
<source_obj>120</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_144">
<id>162</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_145">
<id>163</id>
<edge_type>1</edge_type>
<source_obj>123</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_146">
<id>164</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_147">
<id>165</id>
<edge_type>2</edge_type>
<source_obj>53</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_148">
<id>166</id>
<edge_type>2</edge_type>
<source_obj>56</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_149">
<id>167</id>
<edge_type>1</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="_150">
<id>169</id>
<edge_type>1</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="_151">
<id>170</id>
<edge_type>1</edge_type>
<source_obj>152</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_152">
<id>171</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_153">
<id>172</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_154">
<id>173</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_155">
<id>174</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_156">
<id>175</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_157">
<id>177</id>
<edge_type>1</edge_type>
<source_obj>176</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_158">
<id>178</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_159">
<id>179</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_160">
<id>180</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_161">
<id>181</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_162">
<id>182</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_163">
<id>183</id>
<edge_type>1</edge_type>
<source_obj>176</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_164">
<id>184</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="_165">
<id>185</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_166">
<id>186</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_167">
<id>187</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_168">
<id>188</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_169">
<id>189</id>
<edge_type>2</edge_type>
<source_obj>26</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_170">
<id>190</id>
<edge_type>1</edge_type>
<source_obj>62</source_obj>
<sink_obj>59</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_171">
<id>191</id>
<edge_type>2</edge_type>
<source_obj>68</source_obj>
<sink_obj>59</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_172">
<id>192</id>
<edge_type>1</edge_type>
<source_obj>114</source_obj>
<sink_obj>59</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_173">
<id>193</id>
<edge_type>2</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="_174">
<id>194</id>
<edge_type>1</edge_type>
<source_obj>59</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_175">
<id>195</id>
<edge_type>1</edge_type>
<source_obj>120</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_176">
<id>196</id>
<edge_type>1</edge_type>
<source_obj>59</source_obj>
<sink_obj>62</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_177">
<id>197</id>
<edge_type>1</edge_type>
<source_obj>123</source_obj>
<sink_obj>62</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_178">
<id>198</id>
<edge_type>1</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="_179">
<id>199</id>
<edge_type>2</edge_type>
<source_obj>68</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_180">
<id>200</id>
<edge_type>2</edge_type>
<source_obj>70</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_181">
<id>201</id>
<edge_type>2</edge_type>
<source_obj>76</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_182">
<id>202</id>
<edge_type>1</edge_type>
<source_obj>129</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_183">
<id>203</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_184">
<id>204</id>
<edge_type>1</edge_type>
<source_obj>59</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_185">
<id>205</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_186">
<id>206</id>
<edge_type>1</edge_type>
<source_obj>59</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_187">
<id>207</id>
<edge_type>2</edge_type>
<source_obj>64</source_obj>
<sink_obj>67</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_188">
<id>208</id>
<edge_type>1</edge_type>
<source_obj>74</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_189">
<id>209</id>
<edge_type>2</edge_type>
<source_obj>106</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_190">
<id>210</id>
<edge_type>1</edge_type>
<source_obj>114</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_191">
<id>211</id>
<edge_type>2</edge_type>
<source_obj>70</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_192">
<id>212</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>72</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_193">
<id>213</id>
<edge_type>1</edge_type>
<source_obj>120</source_obj>
<sink_obj>72</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_194">
<id>214</id>
<edge_type>1</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="_195">
<id>215</id>
<edge_type>1</edge_type>
<source_obj>123</source_obj>
<sink_obj>74</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_196">
<id>216</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>75</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_197">
<id>217</id>
<edge_type>2</edge_type>
<source_obj>83</source_obj>
<sink_obj>75</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_198">
<id>218</id>
<edge_type>2</edge_type>
<source_obj>108</source_obj>
<sink_obj>75</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_199">
<id>219</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>79</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_200">
<id>221</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_201">
<id>222</id>
<edge_type>1</edge_type>
<source_obj>152</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_202">
<id>223</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>81</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_203">
<id>224</id>
<edge_type>2</edge_type>
<source_obj>89</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_204">
<id>225</id>
<edge_type>1</edge_type>
<source_obj>114</source_obj>
<sink_obj>84</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_205">
<id>226</id>
<edge_type>2</edge_type>
<source_obj>83</source_obj>
<sink_obj>84</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_206">
<id>227</id>
<edge_type>1</edge_type>
<source_obj>87</source_obj>
<sink_obj>84</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_207">
<id>228</id>
<edge_type>2</edge_type>
<source_obj>103</source_obj>
<sink_obj>84</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_208">
<id>229</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="_209">
<id>230</id>
<edge_type>1</edge_type>
<source_obj>120</source_obj>
<sink_obj>85</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_210">
<id>231</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_211">
<id>232</id>
<edge_type>1</edge_type>
<source_obj>123</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_212">
<id>233</id>
<edge_type>1</edge_type>
<source_obj>85</source_obj>
<sink_obj>88</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_213">
<id>234</id>
<edge_type>2</edge_type>
<source_obj>103</source_obj>
<sink_obj>88</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_214">
<id>235</id>
<edge_type>2</edge_type>
<source_obj>106</source_obj>
<sink_obj>88</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_215">
<id>236</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_216">
<id>237</id>
<edge_type>1</edge_type>
<source_obj>91</source_obj>
<sink_obj>92</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_217">
<id>238</id>
<edge_type>1</edge_type>
<source_obj>81</source_obj>
<sink_obj>92</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_218">
<id>239</id>
<edge_type>1</edge_type>
<source_obj>92</source_obj>
<sink_obj>93</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_219">
<id>240</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>94</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_220">
<id>241</id>
<edge_type>1</edge_type>
<source_obj>176</source_obj>
<sink_obj>94</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_221">
<id>242</id>
<edge_type>1</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="_222">
<id>244</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_223">
<id>245</id>
<edge_type>1</edge_type>
<source_obj>152</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_224">
<id>246</id>
<edge_type>1</edge_type>
<source_obj>95</source_obj>
<sink_obj>96</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_225">
<id>247</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>97</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_226">
<id>248</id>
<edge_type>1</edge_type>
<source_obj>96</source_obj>
<sink_obj>97</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_227">
<id>249</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>98</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_228">
<id>250</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>99</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_229">
<id>251</id>
<edge_type>1</edge_type>
<source_obj>176</source_obj>
<sink_obj>99</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_230">
<id>252</id>
<edge_type>1</edge_type>
<source_obj>98</source_obj>
<sink_obj>99</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_231">
<id>253</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>100</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_232">
<id>254</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_233">
<id>255</id>
<edge_type>1</edge_type>
<source_obj>94</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_234">
<id>256</id>
<edge_type>2</edge_type>
<source_obj>89</source_obj>
<sink_obj>102</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_235">
<id>257</id>
<edge_type>2</edge_type>
<source_obj>76</source_obj>
<sink_obj>105</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_236">
<id>258</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_237">
<id>259</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_238">
<id>317</id>
<edge_type>2</edge_type>
<source_obj>8</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_239">
<id>318</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>20</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_240">
<id>319</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_241">
<id>320</id>
<edge_type>2</edge_type>
<source_obj>18</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_242">
<id>321</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_243">
<id>322</id>
<edge_type>2</edge_type>
<source_obj>26</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_244">
<id>323</id>
<edge_type>2</edge_type>
<source_obj>26</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_245">
<id>324</id>
<edge_type>2</edge_type>
<source_obj>33</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_246">
<id>325</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_247">
<id>326</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_248">
<id>327</id>
<edge_type>2</edge_type>
<source_obj>53</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_249">
<id>328</id>
<edge_type>2</edge_type>
<source_obj>56</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_250">
<id>329</id>
<edge_type>2</edge_type>
<source_obj>58</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_251">
<id>330</id>
<edge_type>2</edge_type>
<source_obj>64</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_252">
<id>331</id>
<edge_type>2</edge_type>
<source_obj>64</source_obj>
<sink_obj>68</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_253">
<id>332</id>
<edge_type>2</edge_type>
<source_obj>68</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_254">
<id>333</id>
<edge_type>2</edge_type>
<source_obj>70</source_obj>
<sink_obj>76</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_255">
<id>334</id>
<edge_type>2</edge_type>
<source_obj>76</source_obj>
<sink_obj>108</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_256">
<id>335</id>
<edge_type>2</edge_type>
<source_obj>76</source_obj>
<sink_obj>83</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_257">
<id>336</id>
<edge_type>2</edge_type>
<source_obj>83</source_obj>
<sink_obj>89</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_258">
<id>337</id>
<edge_type>2</edge_type>
<source_obj>89</source_obj>
<sink_obj>106</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_259">
<id>338</id>
<edge_type>2</edge_type>
<source_obj>89</source_obj>
<sink_obj>103</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_260">
<id>339</id>
<edge_type>2</edge_type>
<source_obj>103</source_obj>
<sink_obj>89</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_261">
<id>340</id>
<edge_type>2</edge_type>
<source_obj>106</source_obj>
<sink_obj>76</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>16</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_262">
<mId>1</mId>
<mTag>dct_2d</mTag>
<mType>0</mType>
<sub_regions>
<count>9</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</item>
<item>5</item>
<item>9</item>
<item>10</item>
<item>11</item>
<item>12</item>
<item>16</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>2644</mMinLatency>
<mMaxLatency>2644</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_263">
<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>8</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_264">
<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>14</item>
<item>18</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>8</mMinTripCount>
<mMaxTripCount>8</mMaxTripCount>
<mMinLatency>1176</mMinLatency>
<mMaxLatency>1176</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_265">
<mId>4</mId>
<mTag>Region 1</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_266">
<mId>5</mId>
<mTag>Xpose_Row_Outer_Loop</mTag>
<mType>1</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>6</item>
<item>7</item>
<item>8</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>8</mMinTripCount>
<mMaxTripCount>8</mMaxTripCount>
<mMinLatency>144</mMinLatency>
<mMaxLatency>144</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_267">
<mId>6</mId>
<mTag>Region 2</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>26</item>
<item>33</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_268">
<mId>7</mId>
<mTag>Xpose_Row_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>39</item>
<item>53</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>8</mMinTripCount>
<mMaxTripCount>8</mMaxTripCount>
<mMinLatency>16</mMinLatency>
<mMaxLatency>16</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_269">
<mId>8</mId>
<mTag>Region 3</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>56</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_270">
<mId>9</mId>
<mTag>Region 4</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>58</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_271">
<mId>10</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>64</item>
<item>68</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>8</mMinTripCount>
<mMaxTripCount>8</mMaxTripCount>
<mMinLatency>1176</mMinLatency>
<mMaxLatency>1176</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_272">
<mId>11</mId>
<mTag>Region 5</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>70</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_273">
<mId>12</mId>
<mTag>Xpose_Col_Outer_Loop</mTag>
<mType>1</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>13</item>
<item>14</item>
<item>15</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>8</mMinTripCount>
<mMaxTripCount>8</mMaxTripCount>
<mMinLatency>144</mMinLatency>
<mMaxLatency>144</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_274">
<mId>13</mId>
<mTag>Region 6</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>76</item>
<item>83</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_275">
<mId>14</mId>
<mTag>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>89</item>
<item>103</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>8</mMinTripCount>
<mMaxTripCount>8</mMaxTripCount>
<mMinLatency>16</mMinLatency>
<mMaxLatency>16</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_276">
<mId>15</mId>
<mTag>Region 7</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>106</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_277">
<mId>16</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>108</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_278">
<states class_id="25" tracking_level="0" version="0">
<count>11</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_279">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_280">
<id>4</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_281">
<id>5</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_282">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_283">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_284">
<id>2</id>
<operations>
<count>7</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_285">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_286">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_287">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_288">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_289">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_290">
<id>16</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_291">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_292">
<id>3</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_293">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_294">
<id>16</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_295">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_296">
<id>4</id>
<operations>
<count>12</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_297">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_298">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_299">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_300">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_301">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_302">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_303">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_304">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_305">
<id>30</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_306">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_307">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_308">
<id>57</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_309">
<id>5</id>
<operations>
<count>15</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_310">
<id>34</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_311">
<id>35</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_312">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_313">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_314">
<id>38</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_315">
<id>41</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_316">
<id>42</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_317">
<id>43</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_318">
<id>44</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_319">
<id>45</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_320">
<id>46</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_321">
<id>47</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_322">
<id>50</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_323">
<id>54</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_324">
<id>55</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_325">
<id>6</id>
<operations>
<count>6</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_326">
<id>40</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_327">
<id>48</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_328">
<id>49</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_329">
<id>50</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_330">
<id>51</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_331">
<id>52</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_332">
<id>7</id>
<operations>
<count>7</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_333">
<id>59</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_334">
<id>60</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_335">
<id>61</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_336">
<id>62</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_337">
<id>63</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_338">
<id>66</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_339">
<id>69</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_340">
<id>8</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_341">
<id>65</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_342">
<id>66</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_343">
<id>67</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_344">
<id>9</id>
<operations>
<count>12</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_345">
<id>71</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_346">
<id>72</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_347">
<id>73</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_348">
<id>74</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_349">
<id>75</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_350">
<id>77</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_351">
<id>78</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_352">
<id>79</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_353">
<id>80</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_354">
<id>81</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_355">
<id>82</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_356">
<id>107</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_357">
<id>10</id>
<operations>
<count>15</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_358">
<id>84</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_359">
<id>85</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_360">
<id>86</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_361">
<id>87</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_362">
<id>88</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_363">
<id>91</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_364">
<id>92</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_365">
<id>95</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_366">
<id>96</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_367">
<id>97</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_368">
<id>98</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_369">
<id>99</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_370">
<id>100</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_371">
<id>104</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_372">
<id>105</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_373">
<id>11</id>
<operations>
<count>6</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_374">
<id>90</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_375">
<id>93</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_376">
<id>94</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_377">
<id>100</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_378">
<id>101</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_379">
<id>102</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>16</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_380">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>-1</id>
<sop class_id="32" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_381">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>-1</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>10</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_382">
<inState>3</inState>
<outState>2</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_383">
<inState>2</inState>
<outState>4</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>10</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_384">
<inState>4</inState>
<outState>5</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>22</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_385">
<inState>5</inState>
<outState>6</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>35</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_386">
<inState>6</inState>
<outState>5</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_387">
<inState>5</inState>
<outState>4</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>35</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_388">
<inState>4</inState>
<outState>7</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>22</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_389">
<inState>7</inState>
<outState>8</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>60</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_390">
<inState>8</inState>
<outState>7</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_391">
<inState>7</inState>
<outState>9</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>60</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_392">
<inState>9</inState>
<outState>10</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>72</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_393">
<inState>10</inState>
<outState>11</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>85</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_394">
<inState>11</inState>
<outState>10</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_395">
<inState>10</inState>
<outState>9</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>85</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="36" tracking_level="1" version="0" object_id="_396">
<dp_component_resource class_id="37" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>grp_dct_1d2_fu_175 (dct_1d2)</first>
<second class_id="39" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="40" tracking_level="0" version="0">
<first>BRAM</first>
<second>0</second>
</item>
<item>
<first>DSP48E</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>85</second>
</item>
<item>
<first>LUT</first>
<second>196</second>
</item>
</second>
</item>
</dp_component_resource>
<dp_expression_resource>
<count>16</count>
<item_version>0</item_version>
<item>
<first>add_ln82_1_fu_268_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>8</second>
</item>
<item>
<first>(1P1)</first>
<second>8</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>15</second>
</item>
</second>
</item>
<item>
<first>add_ln82_fu_258_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>8</second>
</item>
<item>
<first>(1P1)</first>
<second>8</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>15</second>
</item>
</second>
</item>
<item>
<first>add_ln93_1_fu_350_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>8</second>
</item>
<item>
<first>(1P1)</first>
<second>8</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>15</second>
</item>
</second>
</item>
<item>
<first>add_ln93_fu_333_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>8</second>
</item>
<item>
<first>(1P1)</first>
<second>8</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>15</second>
</item>
</second>
</item>
<item>
<first>i_4_fu_283_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>12</second>
</item>
</second>
</item>
<item>
<first>i_5_fu_236_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>12</second>
</item>
</second>
</item>
<item>
<first>i_6_fu_323_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>12</second>
</item>
</second>
</item>
<item>
<first>i_fu_196_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>12</second>
</item>
</second>
</item>
<item>
<first>icmp_ln74_fu_190_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>5</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>11</second>
</item>
</second>
</item>
<item>
<first>icmp_ln79_fu_202_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>5</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>11</second>
</item>
</second>
</item>
<item>
<first>icmp_ln81_fu_230_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>5</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>11</second>
</item>
</second>
</item>
<item>
<first>icmp_ln85_fu_277_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>5</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>11</second>
</item>
</second>
</item>
<item>
<first>icmp_ln90_fu_289_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>5</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>11</second>
</item>
</second>
</item>
<item>
<first>icmp_ln92_fu_317_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>5</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>11</second>
</item>
</second>
</item>
<item>
<first>j_2_fu_295_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>12</second>
</item>
</second>
</item>
<item>
<first>j_fu_208_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>12</second>
</item>
</second>
</item>
</dp_expression_resource>
<dp_fifo_resource>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_resource>
<dp_memory_resource>
<count>3</count>
<item_version>0</item_version>
<item>
<first>col_inbuf_U</first>
<second>
<count>8</count>
<item_version>0</item_version>
<item>
<first>(0Words)</first>
<second>64</second>
</item>
<item>
<first>(1Bits)</first>
<second>16</second>
</item>
<item>
<first>(2Banks)</first>
<second>1</second>
</item>
<item>
<first>(3W*Bits*Banks)</first>
<second>1024</second>
</item>
<item>
<first>BRAM</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>0</second>
</item>
<item>
<first>URAM</first>
<second>0</second>
</item>
</second>
</item>
<item>
<first>col_outbuf_U</first>
<second>
<count>8</count>
<item_version>0</item_version>
<item>
<first>(0Words)</first>
<second>64</second>
</item>
<item>
<first>(1Bits)</first>
<second>16</second>
</item>
<item>
<first>(2Banks)</first>
<second>1</second>
</item>
<item>
<first>(3W*Bits*Banks)</first>
<second>1024</second>
</item>
<item>
<first>BRAM</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>0</second>
</item>
<item>
<first>URAM</first>
<second>0</second>
</item>
</second>
</item>
<item>
<first>row_outbuf_U</first>
<second>
<count>8</count>
<item_version>0</item_version>
<item>
<first>(0Words)</first>
<second>64</second>
</item>
<item>
<first>(1Bits)</first>
<second>16</second>
</item>
<item>
<first>(2Banks)</first>
<second>1</second>
</item>
<item>
<first>(3W*Bits*Banks)</first>
<second>1024</second>
</item>
<item>
<first>BRAM</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>0</second>
</item>
<item>
<first>URAM</first>
<second>0</second>
</item>
</second>
</item>
</dp_memory_resource>
<dp_multiplexer_resource>
<count>19</count>
<item_version>0</item_version>
<item>
<first>ap_NS_fsm</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>12</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>12</second>
</item>
<item>
<first>LUT</first>
<second>53</second>
</item>
</second>
</item>
<item>
<first>col_inbuf_address0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>6</second>
</item>
<item>
<first>(2Count)</first>
<second>18</second>
</item>
<item>
<first>LUT</first>
<second>15</second>
</item>
</second>
</item>
<item>
<first>col_inbuf_ce0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>3</second>
</item>
<item>
<first>LUT</first>
<second>15</second>
</item>
</second>
</item>
<item>
<first>col_outbuf_address0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>6</second>
</item>
<item>
<first>(2Count)</first>
<second>18</second>
</item>
<item>
<first>LUT</first>
<second>15</second>
</item>
</second>
</item>
<item>
<first>col_outbuf_ce0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>3</second>
</item>
<item>
<first>LUT</first>
<second>15</second>
</item>
</second>
</item>
<item>
<first>col_outbuf_we0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>grp_dct_1d2_fu_175_dst_offset</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>12</second>
</item>
<item>
<first>LUT</first>
<second>15</second>
</item>
</second>
</item>
<item>
<first>grp_dct_1d2_fu_175_src_offset</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>12</second>
</item>
<item>
<first>LUT</first>
<second>15</second>
</item>
</second>
</item>
<item>
<first>grp_dct_1d2_fu_175_src_q0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>16</second>
</item>
<item>
<first>(2Count)</first>
<second>48</second>
</item>
<item>
<first>LUT</first>
<second>15</second>
</item>
</second>
</item>
<item>
<first>i_0_reg_107</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>8</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>i_1_reg_130</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>8</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>i_2_reg_141</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>8</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>i_3_reg_164</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>8</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>in_block_ce0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>j_0_reg_119</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>8</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>j_1_reg_153</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>8</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>row_outbuf_address0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>6</second>
</item>
<item>
<first>(2Count)</first>
<second>18</second>
</item>
<item>
<first>LUT</first>
<second>15</second>
</item>
</second>
</item>
<item>
<first>row_outbuf_ce0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>3</second>
</item>
<item>
<first>LUT</first>
<second>15</second>
</item>
</second>
</item>
<item>
<first>row_outbuf_we0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
</dp_multiplexer_resource>
<dp_register_resource>
<count>20</count>
<item_version>0</item_version>
<item>
<first>add_ln82_1_reg_403</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>8</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>8</second>
</item>
</second>
</item>
<item>
<first>add_ln93_reg_442</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>8</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>8</second>
</item>
</second>
</item>
<item>
<first>ap_CS_fsm</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>11</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>11</second>
</item>
</second>
</item>
<item>
<first>grp_dct_1d2_fu_175_ap_start_reg</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>i_0_reg_107</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_1_reg_130</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_2_reg_141</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_3_reg_164</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_4_reg_411</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_5_reg_393</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_6_reg_437</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_reg_367</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>j_0_reg_119</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>j_1_reg_153</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>j_2_reg_419</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>j_reg_375</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>zext_ln81_reg_385</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>8</second>
</item>
<item>
<first>(Consts)</first>
<second>4</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>zext_ln82_reg_380</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>8</second>
</item>
<item>
<first>(Consts)</first>
<second>4</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>zext_ln92_reg_429</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>8</second>
</item>
<item>
<first>(Consts)</first>
<second>4</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>zext_ln93_reg_424</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>8</second>
</item>
<item>
<first>(Consts)</first>
<second>4</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
</dp_register_resource>
<dp_dsp_resource>
<count>1</count>
<item_version>0</item_version>
<item>
<first>grp_dct_1d2_fu_175</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
</dp_dsp_resource>
<dp_component_map class_id="41" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="42" tracking_level="0" version="0">
<first>grp_dct_1d2_fu_175 (dct_1d2)</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>16</item>
<item>66</item>
</second>
</item>
</dp_component_map>
<dp_expression_map>
<count>16</count>
<item_version>0</item_version>
<item>
<first>add_ln82_1_fu_268_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>add_ln82_fu_258_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>add_ln93_1_fu_350_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>97</item>
</second>
</item>
<item>
<first>add_ln93_fu_333_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>92</item>
</second>
</item>
<item>
<first>i_4_fu_283_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>i_5_fu_236_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>i_6_fu_323_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
<item>
<first>i_fu_196_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>icmp_ln74_fu_190_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>icmp_ln79_fu_202_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>icmp_ln81_fu_230_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>icmp_ln85_fu_277_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>icmp_ln90_fu_289_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>icmp_ln92_fu_317_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>j_2_fu_295_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>74</item>
</second>
</item>
<item>
<first>j_fu_208_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
</dp_expression_map>
<dp_fifo_map>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_map>
<dp_memory_map>
<count>3</count>
<item_version>0</item_version>
<item>
<first>col_inbuf_U</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>134</item>
</second>
</item>
<item>
<first>col_outbuf_U</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>125</item>
</second>
</item>
<item>
<first>row_outbuf_U</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>116</item>
</second>
</item>
</dp_memory_map>
</res>
<node_label_latency class_id="43" tracking_level="0" version="0">
<count>70</count>
<item_version>0</item_version>
<item class_id="44" tracking_level="0" version="0">
<first>4</first>
<second class_id="45" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>5</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>6</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>7</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>9</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>4</first>
<second>1</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>62</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>63</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>66</first>
<second>
<first>6</first>
<second>1</second>
</second>
</item>
<item>
<first>67</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>69</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>71</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>72</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>74</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>75</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>79</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>80</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>81</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>82</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>84</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>85</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>87</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>88</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>91</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>92</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>93</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>94</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>95</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>96</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>97</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>98</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>99</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>100</first>
<second>
<first>9</first>
<second>1</second>
</second>
</item>
<item>
<first>101</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>102</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>105</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>107</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="46" tracking_level="0" version="0">
<count>19</count>
<item_version>0</item_version>
<item class_id="47" tracking_level="0" version="0">
<first>8</first>
<second class_id="48" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>1</first>
<second>2</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>3</first>
<second>4</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>3</first>
<second>4</second>
</second>
</item>
<item>
<first>70</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>76</first>
<second>
<first>4</first>
<second>4</second>
</second>
</item>
<item>
<first>83</first>
<second>
<first>4</first>
<second>4</second>
</second>
</item>
<item>
<first>89</first>
<second>
<first>5</first>
<second>5</second>
</second>
</item>
<item>
<first>103</first>
<second>
<first>5</first>
<second>6</second>
</second>
</item>
<item>
<first>106</first>
<second>
<first>5</first>
<second>5</second>
</second>
</item>
<item>
<first>108</first>
<second>
<first>4</first>
<second>4</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="49" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</regions>
<dp_fu_nodes class_id="50" tracking_level="0" version="0">
<count>50</count>
<item_version>0</item_version>
<item class_id="51" tracking_level="0" version="0">
<first>44</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>4</item>
</second>
</item>
<item>
<first>48</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>5</item>
</second>
</item>
<item>
<first>52</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>6</item>
</second>
</item>
<item>
<first>56</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>62</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>50</item>
<item>50</item>
</second>
</item>
<item>
<first>68</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>74</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>81</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>99</item>
</second>
</item>
<item>
<first>87</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>100</item>
<item>100</item>
</second>
</item>
<item>
<first>93</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</second>
</item>
<item>
<first>100</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>101</item>
</second>
</item>
<item>
<first>111</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>123</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>134</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>145</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>157</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</second>
</item>
<item>
<first>168</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>175</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>16</item>
<item>16</item>
<item>66</item>
<item>66</item>
</second>
</item>
<item>
<first>190</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>196</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>202</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>208</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>214</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>218</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>226</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>230</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>236</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>242</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>246</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>254</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>258</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>263</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>268</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>273</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>277</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>283</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>289</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>295</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>74</item>
</second>
</item>
<item>
<first>301</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>305</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>80</item>
</second>
</item>
<item>
<first>313</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>317</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>323</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
<item>
<first>329</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>91</item>
</second>
</item>
<item>
<first>333</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>92</item>
</second>
</item>
<item>
<first>338</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>95</item>
</second>
</item>
<item>
<first>346</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>96</item>
</second>
</item>
<item>
<first>350</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>97</item>
</second>
</item>
<item>
<first>355</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>98</item>
</second>
</item>
<item>
<first>360</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>93</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="53" tracking_level="0" version="0">
<count>45</count>
<item_version>0</item_version>
<item class_id="54" tracking_level="0" version="0">
<first>add_ln82_1_fu_268</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>add_ln82_fu_258</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>add_ln93_1_fu_350</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>97</item>
</second>
</item>
<item>
<first>add_ln93_fu_333</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>92</item>
</second>
</item>
<item>
<first>col_inbuf_addr_gep_fu_68</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>col_inbuf_alloca_fu_52</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>6</item>
</second>
</item>
<item>
<first>col_outbuf_addr_gep_fu_81</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>99</item>
</second>
</item>
<item>
<first>col_outbuf_alloca_fu_48</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>5</item>
</second>
</item>
<item>
<first>i_0_phi_fu_111</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>i_1_phi_fu_134</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>i_2_phi_fu_145</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>i_3_phi_fu_168</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>i_4_fu_283</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>i_5_fu_236</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>i_6_fu_323</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
<item>
<first>i_fu_196</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>icmp_ln74_fu_190</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>icmp_ln79_fu_202</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>icmp_ln81_fu_230</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>icmp_ln85_fu_277</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>icmp_ln90_fu_289</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>icmp_ln92_fu_317</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>j_0_phi_fu_123</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>j_1_phi_fu_157</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</second>
</item>
<item>
<first>j_2_fu_295</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>74</item>
</second>
</item>
<item>
<first>j_fu_208</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>out_block_addr_gep_fu_93</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</second>
</item>
<item>
<first>row_outbuf_addr_gep_fu_56</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>row_outbuf_alloca_fu_44</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>4</item>
</second>
</item>
<item>
<first>tmp_2_fu_218</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>tmp_3_fu_246</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>tmp_4_fu_305</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>80</item>
</second>
</item>
<item>
<first>tmp_5_fu_338</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>95</item>
</second>
</item>
<item>
<first>zext_ln81_fu_226</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>zext_ln82_1_fu_242</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>zext_ln82_2_fu_254</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>zext_ln82_3_fu_263</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>zext_ln82_4_fu_273</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>zext_ln82_fu_214</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>zext_ln92_fu_313</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>zext_ln93_1_fu_329</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>91</item>
</second>
</item>
<item>
<first>zext_ln93_2_fu_360</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>93</item>
</second>
</item>
<item>
<first>zext_ln93_3_fu_346</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>96</item>
</second>
</item>
<item>
<first>zext_ln93_4_fu_355</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>98</item>
</second>
</item>
<item>
<first>zext_ln93_fu_301</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>1</count>
<item_version>0</item_version>
<item>
<first>grp_dct_1d2_fu_175</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>16</item>
<item>16</item>
<item>66</item>
<item>66</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="55" tracking_level="0" version="0">
<count>8</count>
<item_version>0</item_version>
<item class_id="56" tracking_level="0" version="0">
<first class_id="57" tracking_level="0" version="0">
<first>col_inbuf</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>
<first>col_inbuf</first>
<second>100</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>
<first>col_outbuf</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>100</item>
<item>100</item>
</second>
</item>
<item>
<first>
<first>col_outbuf</first>
<second>100</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>
<first>dct_coeff_table</first>
<second>100</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>16</item>
<item>66</item>
</second>
</item>
<item>
<first>
<first>out_block</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>101</item>
</second>
</item>
<item>
<first>
<first>row_outbuf</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>50</item>
<item>50</item>
</second>
</item>
<item>
<first>
<first>row_outbuf</first>
<second>100</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>20</count>
<item_version>0</item_version>
<item>
<first>107</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>119</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>130</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>141</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>153</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</second>
</item>
<item>
<first>164</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>367</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>375</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>380</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>385</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>393</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>398</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>403</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>411</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>419</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>74</item>
</second>
</item>
<item>
<first>424</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>429</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>437</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
<item>
<first>442</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>92</item>
</second>
</item>
<item>
<first>447</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>99</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>20</count>
<item_version>0</item_version>
<item>
<first>add_ln82_1_reg_403</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>add_ln93_reg_442</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>92</item>
</second>
</item>
<item>
<first>col_outbuf_addr_reg_447</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>99</item>
</second>
</item>
<item>
<first>i_0_reg_107</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>i_1_reg_130</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>i_2_reg_141</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>i_3_reg_164</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>i_4_reg_411</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>i_5_reg_393</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>i_6_reg_437</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
<item>
<first>i_reg_367</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>j_0_reg_119</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>j_1_reg_153</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</second>
</item>
<item>
<first>j_2_reg_419</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>74</item>
</second>
</item>
<item>
<first>j_reg_375</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>row_outbuf_addr_reg_398</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>zext_ln81_reg_385</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>zext_ln82_reg_380</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>zext_ln92_reg_429</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>zext_ln93_reg_424</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>6</count>
<item_version>0</item_version>
<item>
<first>107</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>119</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>130</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>141</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>153</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</second>
</item>
<item>
<first>164</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>6</count>
<item_version>0</item_version>
<item>
<first>i_0_reg_107</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>i_1_reg_130</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>i_2_reg_141</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>i_3_reg_164</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>j_0_reg_119</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>j_1_reg_153</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="58" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="59" 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>101</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="60" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="61" tracking_level="0" version="0">
<first>1</first>
<second>RAM</second>
</item>
<item>
<first>2</first>
<second>RAM</second>
</item>
</port2core>
<node2core>
<count>3</count>
<item_version>0</item_version>
<item>
<first>4</first>
<second>RAM</second>
</item>
<item>
<first>5</first>
<second>RAM</second>
</item>
<item>
<first>6</first>
<second>RAM</second>
</item>
</node2core>
</syndb>
</boost_serialization>
|
--------------------------------------------------------------------------------------------------------------------
-- Copyright (c) 2013-2020, Luke A. Guest
--
-- This software is provided 'as-is', without any express or implied
-- warranty. In no event will the authors be held liable for any damages
-- arising from the use of this software.
--
-- Permission is granted to anyone to use this software for any purpose,
-- including commercial applications, and to alter it and redistribute it
-- freely, subject to the following restrictions:
--
-- 1. The origin of this software must not be misrepresented; you must not
-- claim that you wrote the original software. If you use this software
-- in a product, an acknowledgment in the product documentation would be
-- appreciated but is not required.
--
-- 2. Altered source versions must be plainly marked as such, and must not be
-- misrepresented as being the original software.
--
-- 3. This notice may not be removed or altered from any source
-- distribution.
--------------------------------------------------------------------------------------------------------------------
-- SDL.Video.Renderers
--
-- Renderer.
--------------------------------------------------------------------------------------------------------------------
with Ada.Finalization;
private with SDL.C_Pointers;
with SDL.Video.Palettes;
with SDL.Video.Rectangles;
with SDL.Video.Textures;
with SDL.Video.Windows;
package SDL.Video.Renderers is
pragma Preelaborate;
-- TODO: Finish this.
Renderer_Error : exception;
type Renderer_Flags is mod 2 ** 32 with
Convention => C;
Default_Renderer_Flags : constant Renderer_Flags := 16#0000_0000#;
Software : constant Renderer_Flags := 16#0000_0001#;
Accelerated : constant Renderer_Flags := 16#0000_0002#;
Present_V_Sync : constant Renderer_Flags := 16#0000_0004#;
Target_Texture : constant Renderer_Flags := 16#0000_0008#;
type Renderer_Flip is (None, Horizontal, Vertical, Both);
-- SDL_RendererInfo
function Total_Drivers return Positive with
Inline => True;
-- SDL_GetRenderDriverInfo
type Renderer is new Ada.Finalization.Limited_Controlled with private;
Null_Renderer : constant Renderer;
overriding
procedure Finalize (Self : in out Renderer);
function Get_Blend_Mode (Self : in Renderer) return Blend_Modes;
procedure Set_Blend_Mode (Self : in out Renderer; Mode : in Blend_Modes);
function Get_Draw_Colour (Self : in Renderer) return SDL.Video.Palettes.Colour;
procedure Set_Draw_Colour (Self : in out Renderer; Colour : in SDL.Video.Palettes.Colour);
-- SDL_GetRendererInfo
procedure Clear (Self : in out Renderer);
procedure Copy
(Self : in out Renderer;
Copy_From : in SDL.Video.Textures.Texture);
procedure Copy
(Self : in out Renderer;
Copy_From : in SDL.Video.Textures.Texture;
From : in SDL.Video.Rectangles.Rectangle;
To : in SDL.Video.Rectangles.Rectangle);
procedure Copy
(Self : in out Renderer;
Copy_From : in SDL.Video.Textures.Texture;
To : in SDL.Video.Rectangles.Rectangle);
procedure Copy
(Self : in out Renderer;
Copy_From : in SDL.Video.Textures.Texture;
From : in SDL.Video.Rectangles.Rectangle;
To : in SDL.Video.Rectangles.Rectangle;
Angle : in Long_Float;
Centre : in SDL.Video.Rectangles.Point;
Flip : in Renderer_Flip);
procedure Draw (Self : in out Renderer; Line : in SDL.Video.Rectangles.Line_Segment);
procedure Draw (Self : in out Renderer; Lines : in SDL.Video.Rectangles.Line_Arrays);
procedure Draw (Self : in out Renderer; Point : in SDL.Video.Rectangles.Point);
procedure Draw (Self : in out Renderer; Points : in SDL.Video.Rectangles.Point_Arrays);
procedure Draw (Self : in out Renderer; Rectangle : in SDL.Video.Rectangles.Rectangle);
procedure Draw (Self : in out Renderer; Rectangles : in SDL.Video.Rectangles.Rectangle_Arrays);
procedure Fill (Self : in out Renderer; Rectangle : in SDL.Video.Rectangles.Rectangle);
procedure Fill (Self : in out Renderer; Rectangles : in SDL.Video.Rectangles.Rectangle_Arrays);
procedure Get_Clip (Self : in Renderer; Rectangle : out SDL.Video.Rectangles.Rectangle);
procedure Set_Clip (Self : in out Renderer; Rectangle : in SDL.Video.Rectangles.Rectangle);
procedure Get_Logical_Size (Self : in Renderer; Size : out SDL.Sizes);
procedure Set_Logical_Size (Self : in out Renderer; Size : in SDL.Sizes);
procedure Get_Scale (Self : in Renderer; X, Y : out Float);
procedure Set_Scale (Self : in out Renderer; X, Y : in Float);
procedure Get_Viewport (Self : in Renderer; Rectangle : out SDL.Video.Rectangles.Rectangle);
procedure Set_Viewport (Self : in out Renderer; Rectangle : in SDL.Video.Rectangles.Rectangle);
procedure Present (Self : in Renderer);
-- SDL_RenderReadPixels
function Supports_Targets (Self : in Renderer) return Boolean;
procedure Set_Target (Self : in out Renderer; Target : in SDL.Video.Textures.Texture);
function Get_Renderer (Window : in SDL.Video.Windows.Window) return Renderer;
private
type Renderer is new Ada.Finalization.Limited_Controlled with
record
Internal : SDL.C_Pointers.Renderer_Pointer := null;
Owns : Boolean := True; -- Does this Window type own the Internal data?
end record;
function Get_Internal_Renderer (Self : in Renderer) return SDL.C_Pointers.Renderer_Pointer with
Export => True,
Convention => Ada;
Null_Renderer : constant Renderer := (Ada.Finalization.Limited_Controlled with
Internal => null,
Owns => True);
end SDL.Video.Renderers;
|
-- Copyright 2021 Jeff Foley. All rights reserved.
-- Use of this source code is governed by Apache 2 LICENSE that can be found in the LICENSE file.
name = "AnubisDB"
type = "api"
function start()
set_rate_limit(1)
end
function vertical(ctx, domain)
scrape(ctx, {['url']=build_url(domain)})
end
function build_url(domain)
return "https://jldc.me/anubis/subdomains/" .. domain
end
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2016, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with Cortex_M.NVIC;
package body nRF51.Interrupts is
------------------
-- Set_Priority --
------------------
procedure Set_Priority (Int : Interrupt_Name; Prio : Interrupt_Priority) is
begin
Cortex_M.NVIC.Set_Priority (Int'Enum_Rep, Prio);
end Set_Priority;
------------
-- Enable --
------------
procedure Enable (Int : Interrupt_Name) is
begin
Cortex_M.NVIC.Enable (Int'Enum_Rep);
end Enable;
-------------
-- Disable --
-------------
procedure Disable (Int : Interrupt_Name) is
begin
Cortex_M.NVIC.Disable (Int'Enum_Rep);
end Disable;
-------------
-- Pending --
-------------
function Pending (Int : Interrupt_Name) return Boolean is
begin
return Cortex_M.NVIC.Pending (Int'Enum_Rep);
end Pending;
end nRF51.Interrupts;
|
generic
type Element_Type is private;
type Index_Type is (<>);
type Collection is array(Index_Type range <>) of Element_Type;
with function "<" (Left, right : element_type) return boolean is <>;
procedure Generic_Heapsort(Item : in out Collection);
|
-------------------------------------------------------------------------------
-- 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.Index;
-------------------------------------------------------------------------------
-- Input/Output operations
-------------------------------------------------------------------------------
package LSC.Internal.IO is
pragma Pure;
-- Output string @T@
procedure Put (T : String)
with Depends => (null => T);
-- Output string @T@ followed by a line terminator
procedure Put_Line (T : String)
with Depends => (null => T);
-- Start a new line
procedure New_Line
with Depends => null;
-- Read one byte from input
function Read_Byte return Types.Byte;
-- True if End_Of_Stream is reached
function End_Of_Stream return Boolean;
-- Output byte @Item@
procedure Print_Byte (Item : in Types.Byte)
with Depends => (null => Item);
-- Output 32-bit word @Item@
procedure Print_Word32 (Item : in Types.Word32)
with Depends => (null => Item);
-- Output 64-bit word @Item@
procedure Print_Word64 (Item : in Types.Word64)
with Depends => (null => Item);
-- Output index @I@
procedure Print_Index (I : in Types.Index)
with Depends => (null => I);
-- Output natural number @I@
procedure Print_Natural (I : in Natural)
with Depends => (null => I);
-- Output @Block@, an array of 32-bit words
--
-- @Space@ - Number of spaces to separate Word32 values <br>
-- @Break@ - Insert a line terminator after @Break@ Word32 values <br>
-- @Newln@ - Insert a line terminator after printing all Word32 values <br>
--
procedure Print_Word32_Array (Block : in Types.Word32_Array_Type;
Space : in Natural;
Break : in Types.Index;
Newln : in Boolean)
with
Depends => (null => (Block, Space, Break, Newln)),
Pre =>
Break > 0;
-- Output @Block@, an array of 64-bit words
--
-- @Space@ - Number of spaces to separate Word64 values <br>
-- @Break@ - Insert a line terminator after @Break@ Word64 values <br>
-- @Newln@ - Insert a line terminator after printing all Word64 values <br>
--
procedure Print_Word64_Array (Block : in Types.Word64_Array_Type;
Space : in Natural;
Break : in Types.Index;
Newln : in Boolean)
with
Depends => (null => (Block, Space, Break, Newln)),
Pre =>
Break > 0;
end LSC.Internal.IO;
|
<?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>Sobel_Loop_1_proc374</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>12</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>p_src_mat_rows_read</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>p_src_mat_cols_read</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>p_src_mat_data_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>307200</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>p_src_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></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_5">
<Value>
<Obj>
<type>1</type>
<id>5</id>
<name>p_dst_matx_rows_read</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_6">
<Value>
<Obj>
<type>1</type>
<id>6</id>
<name>p_dst_matx_cols_read</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_7">
<Value>
<Obj>
<type>1</type>
<id>7</id>
<name>p_dst_maty_cols_read</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_8">
<Value>
<Obj>
<type>1</type>
<id>8</id>
<name>p_src_mat_rows_read_out</name>
<fileName></fileName>
<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>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_9">
<Value>
<Obj>
<type>1</type>
<id>9</id>
<name>p_src_mat_cols_read_out</name>
<fileName></fileName>
<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>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_10">
<Value>
<Obj>
<type>1</type>
<id>10</id>
<name>p_dst_matx_rows_read_out</name>
<fileName></fileName>
<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>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_11">
<Value>
<Obj>
<type>1</type>
<id>11</id>
<name>p_dst_matx_cols_read_out</name>
<fileName></fileName>
<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>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_12">
<Value>
<Obj>
<type>1</type>
<id>12</id>
<name>p_dst_maty_cols_read_out</name>
<fileName></fileName>
<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>
<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>34</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>p_dst_maty_cols_read_2</name>
<fileName></fileName>
<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>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>68</item>
<item>69</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>p_dst_matx_cols_read_2</name>
<fileName></fileName>
<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>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>70</item>
<item>71</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>p_dst_matx_rows_read_2</name>
<fileName></fileName>
<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>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>72</item>
<item>73</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>p_src_mat_cols_read_2</name>
<fileName></fileName>
<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>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>74</item>
<item>75</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>p_src_mat_rows_read_2</name>
<fileName></fileName>
<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>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>76</item>
<item>77</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>20</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>79</item>
<item>80</item>
<item>81</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>3.63</m_delay>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>82</item>
<item>83</item>
<item>84</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>3.63</m_delay>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>85</item>
<item>86</item>
<item>87</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>3.63</m_delay>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</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>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>88</item>
<item>89</item>
<item>90</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>3.63</m_delay>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>91</item>
<item>92</item>
<item>93</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>3.63</m_delay>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>tmp</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory>
<lineNumber>1468</lineNumber>
<contextFuncName>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>C:/Users/yakup/workspace/bitirme_v4/Release</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>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second>
</first>
<second>1468</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>20</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>30</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>95</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>1.76</m_delay>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>i_i_i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>31</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>97</item>
<item>98</item>
<item>99</item>
<item>100</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>i_cast_i_i</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory>
<lineNumber>1460</lineNumber>
<contextFuncName>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second>
</first>
<second>1460</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>101</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>tmp_13</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory>
<lineNumber>1460</lineNumber>
<contextFuncName>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second>
</first>
<second>1460</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>20</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>102</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>tmp_i_i</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory>
<lineNumber>1460</lineNumber>
<contextFuncName>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second>
</first>
<second>1460</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>103</item>
<item>104</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>2.47</m_delay>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>i</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory>
<lineNumber>1460</lineNumber>
<contextFuncName>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second>
</first>
<second>1460</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>31</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>106</item>
<item>107</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>2.52</m_delay>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name></name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory>
<lineNumber>1460</lineNumber>
<contextFuncName>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second>
</first>
<second>1460</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>108</item>
<item>109</item>
<item>110</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>tmp_21_i_i</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory>
<lineNumber>1468</lineNumber>
<contextFuncName>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second>
</first>
<second>1468</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>20</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>125</item>
<item>126</item>
</oprand_edges>
<opcode>mul</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>5.86</m_delay>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name></name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory>
<lineNumber>1463</lineNumber>
<contextFuncName>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second>
</first>
<second>1463</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>127</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>1.76</m_delay>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>j_i_i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>31</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>112</item>
<item>113</item>
<item>114</item>
<item>115</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>j_cast_i_i</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory>
<lineNumber>1463</lineNumber>
<contextFuncName>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second>
</first>
<second>1463</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>116</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>tmp_14</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory>
<lineNumber>1463</lineNumber>
<contextFuncName>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second>
</first>
<second>1463</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>20</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>117</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name>tmp_i_i_36</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory>
<lineNumber>1463</lineNumber>
<contextFuncName>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second>
</first>
<second>1463</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>118</item>
<item>119</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>2.47</m_delay>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name>j</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory>
<lineNumber>1463</lineNumber>
<contextFuncName>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second>
</first>
<second>1463</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>31</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>120</item>
<item>121</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>2.52</m_delay>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name></name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory>
<lineNumber>1463</lineNumber>
<contextFuncName>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second>
</first>
<second>1463</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>122</item>
<item>123</item>
<item>124</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>54</id>
<name>p_sum1_i_i</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory>
<lineNumber>1468</lineNumber>
<contextFuncName>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second>
</first>
<second>1468</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>20</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>128</item>
<item>129</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>2.19</m_delay>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>p_sum1_cast_i_i</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory>
<lineNumber>1468</lineNumber>
<contextFuncName>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second>
</first>
<second>1468</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>130</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name>p_src_mat_data_V_addr</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory>
<lineNumber>1468</lineNumber>
<contextFuncName>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second>
</first>
<second>1468</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>19</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>131</item>
<item>133</item>
<item>134</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name>tmp_V</name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory>
<lineNumber>1468</lineNumber>
<contextFuncName>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second>
</first>
<second>1468</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>135</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>3.25</m_delay>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name></name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory>
<lineNumber>1468</lineNumber>
<contextFuncName>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second>
</first>
<second>1468</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>137</item>
<item>138</item>
<item>139</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>3.63</m_delay>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name></name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory>
<lineNumber>1463</lineNumber>
<contextFuncName>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second>
</first>
<second>1463</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>140</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>63</id>
<name></name>
<fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName>
<fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory>
<lineNumber>1460</lineNumber>
<contextFuncName>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:/Users/yakup/workspace/bitirme_v4/Release</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first>
<second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second>
</first>
<second>1460</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>111</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>65</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_delay>0.00</m_delay>
</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="_47">
<Value>
<Obj>
<type>2</type>
<id>96</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>31</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_48">
<Value>
<Obj>
<type>2</type>
<id>105</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>31</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_49">
<Value>
<Obj>
<type>2</type>
<id>132</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_50">
<Obj>
<type>3</type>
<id>31</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>12</count>
<item_version>0</item_version>
<item>15</item>
<item>16</item>
<item>17</item>
<item>18</item>
<item>19</item>
<item>20</item>
<item>22</item>
<item>24</item>
<item>26</item>
<item>28</item>
<item>29</item>
<item>30</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_51">
<Obj>
<type>3</type>
<id>38</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>6</count>
<item_version>0</item_version>
<item>32</item>
<item>33</item>
<item>34</item>
<item>35</item>
<item>36</item>
<item>37</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_52">
<Obj>
<type>3</type>
<id>43</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>41</item>
<item>42</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_53">
<Obj>
<type>3</type>
<id>50</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>6</count>
<item_version>0</item_version>
<item>44</item>
<item>45</item>
<item>46</item>
<item>47</item>
<item>48</item>
<item>49</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_54">
<Obj>
<type>3</type>
<id>61</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>6</count>
<item_version>0</item_version>
<item>54</item>
<item>55</item>
<item>56</item>
<item>57</item>
<item>58</item>
<item>60</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_55">
<Obj>
<type>3</type>
<id>64</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>63</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_56">
<Obj>
<type>3</type>
<id>66</id>
<name>.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>65</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>65</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_57">
<id>69</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_58">
<id>71</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_59">
<id>73</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>17</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_60">
<id>75</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_61">
<id>77</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_62">
<id>80</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>20</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_63">
<id>81</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>20</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_64">
<id>83</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_65">
<id>84</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_66">
<id>86</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_67">
<id>87</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_68">
<id>89</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_69">
<id>90</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_70">
<id>92</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_71">
<id>93</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_72">
<id>94</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_73">
<id>95</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_74">
<id>97</id>
<edge_type>1</edge_type>
<source_obj>96</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_75">
<id>98</id>
<edge_type>2</edge_type>
<source_obj>31</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_76">
<id>99</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_77">
<id>100</id>
<edge_type>2</edge_type>
<source_obj>64</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_78">
<id>101</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_79">
<id>102</id>
<edge_type>1</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="_80">
<id>103</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_81">
<id>104</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_82">
<id>106</id>
<edge_type>1</edge_type>
<source_obj>105</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_83">
<id>107</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_84">
<id>108</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_85">
<id>109</id>
<edge_type>2</edge_type>
<source_obj>66</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_86">
<id>110</id>
<edge_type>2</edge_type>
<source_obj>43</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_87">
<id>111</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_88">
<id>112</id>
<edge_type>1</edge_type>
<source_obj>96</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_89">
<id>113</id>
<edge_type>2</edge_type>
<source_obj>43</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_90">
<id>114</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_91">
<id>115</id>
<edge_type>2</edge_type>
<source_obj>61</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_92">
<id>116</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_93">
<id>117</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_94">
<id>118</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_95">
<id>119</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="_96">
<id>120</id>
<edge_type>1</edge_type>
<source_obj>105</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_97">
<id>121</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_98">
<id>122</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="_99">
<id>123</id>
<edge_type>2</edge_type>
<source_obj>64</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_100">
<id>124</id>
<edge_type>2</edge_type>
<source_obj>61</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_101">
<id>125</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_102">
<id>126</id>
<edge_type>1</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="_103">
<id>127</id>
<edge_type>2</edge_type>
<source_obj>50</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_104">
<id>128</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_105">
<id>129</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="_106">
<id>130</id>
<edge_type>1</edge_type>
<source_obj>54</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_107">
<id>131</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_108">
<id>133</id>
<edge_type>1</edge_type>
<source_obj>132</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_109">
<id>134</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_110">
<id>135</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_111">
<id>138</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_112">
<id>139</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="_113">
<id>140</id>
<edge_type>2</edge_type>
<source_obj>50</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_114">
<id>284</id>
<edge_type>2</edge_type>
<source_obj>31</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_115">
<id>285</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_116">
<id>286</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_117">
<id>287</id>
<edge_type>2</edge_type>
<source_obj>43</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_118">
<id>288</id>
<edge_type>2</edge_type>
<source_obj>50</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_119">
<id>289</id>
<edge_type>2</edge_type>
<source_obj>50</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_120">
<id>290</id>
<edge_type>2</edge_type>
<source_obj>61</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_121">
<id>291</id>
<edge_type>2</edge_type>
<source_obj>64</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>1</is_back_edge>
</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="_122">
<mId>1</mId>
<mTag>Sobel_Loop_1_proc374</mTag>
<mType>0</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>2</item>
<item>3</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>308641</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_123">
<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>31</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="_124">
<mId>3</mId>
<mTag>Loop 1</mTag>
<mType>1</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>4</item>
<item>5</item>
<item>6</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>480</mMaxTripCount>
<mMinLatency>308640</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_125">
<mId>4</mId>
<mTag>Region 1</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>38</item>
<item>43</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="_126">
<mId>5</mId>
<mTag>Loop 1.1</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>50</item>
<item>61</item>
</basic_blocks>
<mII>1</mII>
<mDepth>2</mDepth>
<mMinTripCount>1</mMinTripCount>
<mMaxTripCount>640</mMaxTripCount>
<mMinLatency>640</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_127">
<mId>6</mId>
<mTag>Region 2</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>64</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="_128">
<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>66</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="-1"></fsm>
<res class_id="-1"></res>
<node_label_latency class_id="26" tracking_level="0" version="0">
<count>34</count>
<item_version>0</item_version>
<item class_id="27" tracking_level="0" version="0">
<first>15</first>
<second class_id="28" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>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>26</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>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>35</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>1</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>46</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>48</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>54</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>2</first>
<second>1</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>63</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>65</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="29" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="0" version="0">
<first>31</first>
<second class_id="31" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>2</first>
<second>3</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>66</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="32" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="1" version="0" object_id="_129">
<region_name>Loop 1.1</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>50</item>
<item>61</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="34" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="35" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="36" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_reg_nodes>
<dp_regname_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="37" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_port_io_nodes>
<port2core class_id="38" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
|
-- { dg-do compile }
with System;
package SSO1 is
type R is record -- { dg-error "inconsistent with bit order" }
B : Boolean;
end record;
for R'Bit_Order use System.Low_Order_First;
for R'Scalar_Storage_Order use System.High_Order_First; -- { dg-warning "no component clause" }
type RW is record
B : Boolean;
end record;
for RW'Bit_Order use System.Low_Order_First;
for RW'Scalar_Storage_Order use System.Low_Order_First; -- { dg-warning "no component clause" }
end SSO1;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . O S _ I N T E R F A C E --
-- --
-- B o d y --
-- --
-- Copyright (C) 1991-2017, Florida State University --
-- Copyright (C) 1995-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/>. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
-- This version is for POSIX-like operating systems
-- This package encapsulates all direct interfaces to OS services
-- that are needed by children of System.
with Interfaces.C; use Interfaces.C;
package body System.OS_Interface is
--------------------
-- Get_Stack_Base --
--------------------
function Get_Stack_Base (thread : pthread_t) return Address is
pragma Warnings (Off, thread);
begin
return Null_Address;
end Get_Stack_Base;
------------------
-- pthread_init --
------------------
procedure pthread_init is
begin
null;
end pthread_init;
-----------------
-- To_Duration --
-----------------
function To_Duration (TS : timespec) return Duration is
begin
return Duration (TS.tv_sec) + Duration (TS.tv_nsec) / 10#1#E9;
end To_Duration;
------------------------
-- To_Target_Priority --
------------------------
function To_Target_Priority
(Prio : System.Any_Priority) return Interfaces.C.int
is
begin
return Interfaces.C.int (Prio);
end To_Target_Priority;
-----------------
-- To_Timespec --
-----------------
function To_Timespec (D : Duration) return timespec is
S : time_t;
F : Duration;
begin
S := time_t (Long_Long_Integer (D));
F := D - Duration (S);
-- If F has negative value due to a round-up, adjust for positive F
-- value.
if F < 0.0 then
S := S - 1;
F := F + 1.0;
end if;
return timespec'(tv_sec => S,
tv_nsec => long (Long_Long_Integer (F * 10#1#E9)));
end To_Timespec;
end System.OS_Interface;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- I N T E R F A C E S . V X W O R K S --
-- --
-- S p e c --
-- --
-- Copyright (C) 1999-2005, AdaCore --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNARL is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNARL; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
-- This package provides a limited binding to the VxWorks API
-- In particular, it interfaces with the VxWorks hardware interrupt
-- facilities, allowing the use of low-latency direct-vectored
-- interrupt handlers. Note that such handlers have a variety of
-- restrictions regarding system calls and language constructs. In particular,
-- the use of exception handlers and functions returning variable-length
-- objects cannot be used. Less restrictive, but higher-latency handlers can
-- be written using Ada protected procedures, Ada 83 style interrupt entries,
-- or by signalling an Ada task from within an interrupt handler using a
-- binary semaphore as described in the VxWorks Programmer's Manual.
--
-- For complete documentation of the operations in this package, please
-- consult the VxWorks Programmer's Manual and VxWorks Reference Manual.
with System.VxWorks;
package Interfaces.VxWorks is
pragma Preelaborate;
------------------------------------------------------------------------
-- Here is a complete example that shows how to handle the Interrupt 0x14
-- with a direct-vectored interrupt handler in Ada using this package:
-- with Interfaces.VxWorks; use Interfaces.VxWorks;
-- with System;
--
-- package P is
--
-- Count : Integer;
-- pragma Atomic (Count);
--
-- Level : constant := 1;
-- -- Interrupt level used by this example
--
-- procedure Handler (parameter : System.Address);
--
-- end P;
--
-- package body P is
--
-- procedure Handler (parameter : System.Address) is
-- S : STATUS;
-- begin
-- Count := Count + 1;
-- logMsg ("received an interrupt" & ASCII.LF & ASCII.Nul);
--
-- -- Acknowledge VME interrupt
-- S := sysBusIntAck (intLevel => Level);
-- end Handler;
-- end P;
--
-- with Interfaces.VxWorks; use Interfaces.VxWorks;
-- with Ada.Text_IO; use Ada.Text_IO;
--
-- with P; use P;
-- procedure Useint is
-- -- Be sure to use a reasonable interrupt number for the target
-- -- board!
-- -- This one is the unused VME graphics interrupt on the PPC MV2604
-- Interrupt : constant := 16#14#;
--
-- task T;
--
-- S : STATUS;
--
-- task body T is
-- begin
-- loop
-- Put_Line ("Generating an interrupt...");
-- delay 1.0;
--
-- -- Generate VME interrupt, using interrupt number
-- S := sysBusIntGen (1, Interrupt);
-- end loop;
-- end T;
--
-- begin
-- S := sysIntEnable (intLevel => Level);
-- S := intConnect (INUM_TO_IVEC (Interrupt), handler'Access);
--
-- loop
-- delay 2.0;
-- Put_Line ("value of count:" & P.Count'Img);
-- end loop;
-- end Useint;
-------------------------------------
subtype int is Integer;
type STATUS is new int;
-- Equivalent of the C type STATUS
OK : constant STATUS := 0;
ERROR : constant STATUS := -1;
type VOIDFUNCPTR is access procedure (parameter : System.Address);
type Interrupt_Vector is new System.Address;
type Exception_Vector is new System.Address;
function intConnect
(vector : Interrupt_Vector;
handler : VOIDFUNCPTR;
parameter : System.Address := System.Null_Address) return STATUS;
-- Binding to the C routine intConnect. Use this to set up an
-- user handler. The routine generates a wrapper around the user
-- handler to save and restore context
function intContext return int;
-- Binding to the C routine intContext. This function returns 1 only
-- if the current execution state is in interrupt context.
function intVecGet
(Vector : Interrupt_Vector) return VOIDFUNCPTR;
-- Binding to the C routine intVecGet. Use this to get the
-- existing handler for later restoral
procedure intVecSet
(Vector : Interrupt_Vector;
Handler : VOIDFUNCPTR);
-- Binding to the C routine intVecSet. Use this to restore a
-- handler obtained using intVecGet
function INUM_TO_IVEC (intNum : int) return Interrupt_Vector;
-- Equivalent to the C macro INUM_TO_IVEC used to convert an interrupt
-- number to an interrupt vector
function sysIntEnable (intLevel : int) return STATUS;
-- Binding to the C routine sysIntEnable
function sysIntDisable (intLevel : int) return STATUS;
-- Binding to the C routine sysIntDisable
function sysBusIntAck (intLevel : int) return STATUS;
-- Binding to the C routine sysBusIntAck
function sysBusIntGen (intLevel : int; Intnum : int) return STATUS;
-- Binding to the C routine sysBusIntGen. Note that the T2
-- documentation implies that a vector address is the proper
-- argument - it's not. The interrupt number in the range
-- 0 .. 255 (for 68K and PPC) is the correct agument.
procedure logMsg
(fmt : String; arg1, arg2, arg3, arg4, arg5, arg6 : int := 0);
-- Binding to the C routine logMsg. Note that it is the caller's
-- responsibility to ensure that fmt is a null-terminated string
-- (e.g logMsg ("Interrupt" & ASCII.NUL))
type FP_CONTEXT is private;
-- Floating point context save and restore. Handlers using floating
-- point must be bracketed with these calls. The pFpContext parameter
-- should be an object of type FP_CONTEXT that is
-- declared local to the handler.
procedure fppRestore (pFpContext : in out FP_CONTEXT);
-- Restore floating point context
procedure fppSave (pFpContext : in out FP_CONTEXT);
-- Save floating point context
private
type FP_CONTEXT is new System.VxWorks.FP_CONTEXT;
-- Target-dependent floating point context type
pragma Import (C, intConnect, "intConnect");
pragma Import (C, intContext, "intContext");
pragma Import (C, intVecGet, "intVecGet");
pragma Import (C, intVecSet, "intVecSet");
pragma Import (C, INUM_TO_IVEC, "__gnat_inum_to_ivec");
pragma Import (C, sysIntEnable, "sysIntEnable");
pragma Import (C, sysIntDisable, "sysIntDisable");
pragma Import (C, sysBusIntAck, "sysBusIntAck");
pragma Import (C, sysBusIntGen, "sysBusIntGen");
pragma Import (C, logMsg, "logMsg");
pragma Import (C, fppRestore, "fppRestore");
pragma Import (C, fppSave, "fppSave");
end Interfaces.VxWorks;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- E V A L _ F A T --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2016, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING3. If not, go to --
-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Einfo; use Einfo;
with Errout; use Errout;
with Sem_Util; use Sem_Util;
package body Eval_Fat is
Radix : constant Int := 2;
-- This code is currently only correct for the radix 2 case. We use the
-- symbolic value Radix where possible to help in the unlikely case of
-- anyone ever having to adjust this code for another value, and for
-- documentation purposes.
-- Another assumption is that the range of the floating-point type is
-- symmetric around zero.
type Radix_Power_Table is array (Int range 1 .. 4) of Int;
Radix_Powers : constant Radix_Power_Table :=
(Radix ** 1, Radix ** 2, Radix ** 3, Radix ** 4);
-----------------------
-- Local Subprograms --
-----------------------
procedure Decompose
(RT : R;
X : T;
Fraction : out T;
Exponent : out UI;
Mode : Rounding_Mode := Round);
-- Decomposes a non-zero floating-point number into fraction and exponent
-- parts. The fraction is in the interval 1.0 / Radix .. T'Pred (1.0) and
-- uses Rbase = Radix. The result is rounded to a nearest machine number.
--------------
-- Adjacent --
--------------
function Adjacent (RT : R; X, Towards : T) return T is
begin
if Towards = X then
return X;
elsif Towards > X then
return Succ (RT, X);
else
return Pred (RT, X);
end if;
end Adjacent;
-------------
-- Ceiling --
-------------
function Ceiling (RT : R; X : T) return T is
XT : constant T := Truncation (RT, X);
begin
if UR_Is_Negative (X) then
return XT;
elsif X = XT then
return X;
else
return XT + Ureal_1;
end if;
end Ceiling;
-------------
-- Compose --
-------------
function Compose (RT : R; Fraction : T; Exponent : UI) return T is
Arg_Frac : T;
Arg_Exp : UI;
pragma Warnings (Off, Arg_Exp);
begin
Decompose (RT, Fraction, Arg_Frac, Arg_Exp);
return Scaling (RT, Arg_Frac, Exponent);
end Compose;
---------------
-- Copy_Sign --
---------------
function Copy_Sign (RT : R; Value, Sign : T) return T is
pragma Warnings (Off, RT);
Result : T;
begin
Result := abs Value;
if UR_Is_Negative (Sign) then
return -Result;
else
return Result;
end if;
end Copy_Sign;
---------------
-- Decompose --
---------------
procedure Decompose
(RT : R;
X : T;
Fraction : out T;
Exponent : out UI;
Mode : Rounding_Mode := Round)
is
Int_F : UI;
begin
Decompose_Int (RT, abs X, Int_F, Exponent, Mode);
Fraction := UR_From_Components
(Num => Int_F,
Den => Machine_Mantissa_Value (RT),
Rbase => Radix,
Negative => False);
if UR_Is_Negative (X) then
Fraction := -Fraction;
end if;
return;
end Decompose;
-------------------
-- Decompose_Int --
-------------------
-- This procedure should be modified with care, as there are many non-
-- obvious details that may cause problems that are hard to detect. For
-- zero arguments, Fraction and Exponent are set to zero. Note that sign
-- of zero cannot be preserved.
procedure Decompose_Int
(RT : R;
X : T;
Fraction : out UI;
Exponent : out UI;
Mode : Rounding_Mode)
is
Base : Int := Rbase (X);
N : UI := abs Numerator (X);
D : UI := Denominator (X);
N_Times_Radix : UI;
Even : Boolean;
-- True iff Fraction is even
Most_Significant_Digit : constant UI :=
Radix ** (Machine_Mantissa_Value (RT) - 1);
Uintp_Mark : Uintp.Save_Mark;
-- The code is divided into blocks that systematically release
-- intermediate values (this routine generates lots of junk).
begin
if N = Uint_0 then
Fraction := Uint_0;
Exponent := Uint_0;
return;
end if;
Calculate_D_And_Exponent_1 : begin
Uintp_Mark := Mark;
Exponent := Uint_0;
-- In cases where Base > 1, the actual denominator is Base**D. For
-- cases where Base is a power of Radix, use the value 1 for the
-- Denominator and adjust the exponent.
-- Note: Exponent has different sign from D, because D is a divisor
for Power in 1 .. Radix_Powers'Last loop
if Base = Radix_Powers (Power) then
Exponent := -D * Power;
Base := 0;
D := Uint_1;
exit;
end if;
end loop;
Release_And_Save (Uintp_Mark, D, Exponent);
end Calculate_D_And_Exponent_1;
if Base > 0 then
Calculate_Exponent : begin
Uintp_Mark := Mark;
-- For bases that are a multiple of the Radix, divide the base by
-- Radix and adjust the Exponent. This will help because D will be
-- much smaller and faster to process.
-- This occurs for decimal bases on machines with binary floating-
-- point for example. When calculating 1E40, with Radix = 2, N
-- will be 93 bits instead of 133.
-- N E
-- ------ * Radix
-- D
-- Base
-- N E
-- = -------------------------- * Radix
-- D D
-- (Base/Radix) * Radix
-- N E-D
-- = --------------- * Radix
-- D
-- (Base/Radix)
-- This code is commented out, because it causes numerous
-- failures in the regression suite. To be studied ???
while False and then Base > 0 and then Base mod Radix = 0 loop
Base := Base / Radix;
Exponent := Exponent + D;
end loop;
Release_And_Save (Uintp_Mark, Exponent);
end Calculate_Exponent;
-- For remaining bases we must actually compute the exponentiation
-- Because the exponentiation can be negative, and D must be integer,
-- the numerator is corrected instead.
Calculate_N_And_D : begin
Uintp_Mark := Mark;
if D < 0 then
N := N * Base ** (-D);
D := Uint_1;
else
D := Base ** D;
end if;
Release_And_Save (Uintp_Mark, N, D);
end Calculate_N_And_D;
Base := 0;
end if;
-- Now scale N and D so that N / D is a value in the interval [1.0 /
-- Radix, 1.0) and adjust Exponent accordingly, so the value N / D *
-- Radix ** Exponent remains unchanged.
-- Step 1 - Adjust N so N / D >= 1 / Radix, or N = 0
-- N and D are positive, so N / D >= 1 / Radix implies N * Radix >= D.
-- As this scaling is not possible for N is Uint_0, zero is handled
-- explicitly at the start of this subprogram.
Calculate_N_And_Exponent : begin
Uintp_Mark := Mark;
N_Times_Radix := N * Radix;
while not (N_Times_Radix >= D) loop
N := N_Times_Radix;
Exponent := Exponent - 1;
N_Times_Radix := N * Radix;
end loop;
Release_And_Save (Uintp_Mark, N, Exponent);
end Calculate_N_And_Exponent;
-- Step 2 - Adjust D so N / D < 1
-- Scale up D so N / D < 1, so N < D
Calculate_D_And_Exponent_2 : begin
Uintp_Mark := Mark;
while not (N < D) loop
-- As N / D >= 1, N / (D * Radix) will be at least 1 / Radix, so
-- the result of Step 1 stays valid
D := D * Radix;
Exponent := Exponent + 1;
end loop;
Release_And_Save (Uintp_Mark, D, Exponent);
end Calculate_D_And_Exponent_2;
-- Here the value N / D is in the range [1.0 / Radix .. 1.0)
-- Now find the fraction by doing a very simple-minded division until
-- enough digits have been computed.
-- This division works for all radices, but is only efficient for a
-- binary radix. It is just like a manual division algorithm, but
-- instead of moving the denominator one digit right, we move the
-- numerator one digit left so the numerator and denominator remain
-- integral.
Fraction := Uint_0;
Even := True;
Calculate_Fraction_And_N : begin
Uintp_Mark := Mark;
loop
while N >= D loop
N := N - D;
Fraction := Fraction + 1;
Even := not Even;
end loop;
-- Stop when the result is in [1.0 / Radix, 1.0)
exit when Fraction >= Most_Significant_Digit;
N := N * Radix;
Fraction := Fraction * Radix;
Even := True;
end loop;
Release_And_Save (Uintp_Mark, Fraction, N);
end Calculate_Fraction_And_N;
Calculate_Fraction_And_Exponent : begin
Uintp_Mark := Mark;
-- Determine correct rounding based on the remainder which is in
-- N and the divisor D. The rounding is performed on the absolute
-- value of X, so Ceiling and Floor need to check for the sign of
-- X explicitly.
case Mode is
when Round_Even =>
-- This rounding mode corresponds to the unbiased rounding
-- method that is used at run time. When the real value is
-- exactly between two machine numbers, choose the machine
-- number with its least significant bit equal to zero.
-- The recommendation advice in RM 4.9(38) is that static
-- expressions are rounded to machine numbers in the same
-- way as the target machine does.
if (Even and then N * 2 > D)
or else
(not Even and then N * 2 >= D)
then
Fraction := Fraction + 1;
end if;
when Round =>
-- Do not round to even as is done with IEEE arithmetic, but
-- instead round away from zero when the result is exactly
-- between two machine numbers. This biased rounding method
-- should not be used to convert static expressions to
-- machine numbers, see AI95-268.
if N * 2 >= D then
Fraction := Fraction + 1;
end if;
when Ceiling =>
if N > Uint_0 and then not UR_Is_Negative (X) then
Fraction := Fraction + 1;
end if;
when Floor =>
if N > Uint_0 and then UR_Is_Negative (X) then
Fraction := Fraction + 1;
end if;
end case;
-- The result must be normalized to [1.0/Radix, 1.0), so adjust if
-- the result is 1.0 because of rounding.
if Fraction = Most_Significant_Digit * Radix then
Fraction := Most_Significant_Digit;
Exponent := Exponent + 1;
end if;
-- Put back sign after applying the rounding
if UR_Is_Negative (X) then
Fraction := -Fraction;
end if;
Release_And_Save (Uintp_Mark, Fraction, Exponent);
end Calculate_Fraction_And_Exponent;
end Decompose_Int;
--------------
-- Exponent --
--------------
function Exponent (RT : R; X : T) return UI is
X_Frac : UI;
X_Exp : UI;
pragma Warnings (Off, X_Frac);
begin
Decompose_Int (RT, X, X_Frac, X_Exp, Round_Even);
return X_Exp;
end Exponent;
-----------
-- Floor --
-----------
function Floor (RT : R; X : T) return T is
XT : constant T := Truncation (RT, X);
begin
if UR_Is_Positive (X) then
return XT;
elsif XT = X then
return X;
else
return XT - Ureal_1;
end if;
end Floor;
--------------
-- Fraction --
--------------
function Fraction (RT : R; X : T) return T is
X_Frac : T;
X_Exp : UI;
pragma Warnings (Off, X_Exp);
begin
Decompose (RT, X, X_Frac, X_Exp);
return X_Frac;
end Fraction;
------------------
-- Leading_Part --
------------------
function Leading_Part (RT : R; X : T; Radix_Digits : UI) return T is
RD : constant UI := UI_Min (Radix_Digits, Machine_Mantissa_Value (RT));
L : UI;
Y : T;
begin
L := Exponent (RT, X) - RD;
Y := UR_From_Uint (UR_Trunc (Scaling (RT, X, -L)));
return Scaling (RT, Y, L);
end Leading_Part;
-------------
-- Machine --
-------------
function Machine
(RT : R;
X : T;
Mode : Rounding_Mode;
Enode : Node_Id) return T
is
X_Frac : T;
X_Exp : UI;
Emin : constant UI := Machine_Emin_Value (RT);
begin
Decompose (RT, X, X_Frac, X_Exp, Mode);
-- Case of denormalized number or (gradual) underflow
-- A denormalized number is one with the minimum exponent Emin, but that
-- breaks the assumption that the first digit of the mantissa is a one.
-- This allows the first non-zero digit to be in any of the remaining
-- Mant - 1 spots. The gap between subsequent denormalized numbers is
-- the same as for the smallest normalized numbers. However, the number
-- of significant digits left decreases as a result of the mantissa now
-- having leading seros.
if X_Exp < Emin then
declare
Emin_Den : constant UI := Machine_Emin_Value (RT)
- Machine_Mantissa_Value (RT) + Uint_1;
begin
if X_Exp < Emin_Den or not Has_Denormals (RT) then
if Has_Signed_Zeros (RT) and then UR_Is_Negative (X) then
Error_Msg_N
("floating-point value underflows to -0.0??", Enode);
return Ureal_M_0;
else
Error_Msg_N
("floating-point value underflows to 0.0??", Enode);
return Ureal_0;
end if;
elsif Has_Denormals (RT) then
-- Emin - Mant <= X_Exp < Emin, so result is denormal. Handle
-- gradual underflow by first computing the number of
-- significant bits still available for the mantissa and
-- then truncating the fraction to this number of bits.
-- If this value is different from the original fraction,
-- precision is lost due to gradual underflow.
-- We probably should round here and prevent double rounding as
-- a result of first rounding to a model number and then to a
-- machine number. However, this is an extremely rare case that
-- is not worth the extra complexity. In any case, a warning is
-- issued in cases where gradual underflow occurs.
declare
Denorm_Sig_Bits : constant UI := X_Exp - Emin_Den + 1;
X_Frac_Denorm : constant T := UR_From_Components
(UR_Trunc (Scaling (RT, abs X_Frac, Denorm_Sig_Bits)),
Denorm_Sig_Bits,
Radix,
UR_Is_Negative (X));
begin
if X_Frac_Denorm /= X_Frac then
Error_Msg_N
("gradual underflow causes loss of precision??",
Enode);
X_Frac := X_Frac_Denorm;
end if;
end;
end if;
end;
end if;
return Scaling (RT, X_Frac, X_Exp);
end Machine;
-----------
-- Model --
-----------
function Model (RT : R; X : T) return T is
X_Frac : T;
X_Exp : UI;
begin
Decompose (RT, X, X_Frac, X_Exp);
return Compose (RT, X_Frac, X_Exp);
end Model;
----------
-- Pred --
----------
function Pred (RT : R; X : T) return T is
begin
return -Succ (RT, -X);
end Pred;
---------------
-- Remainder --
---------------
function Remainder (RT : R; X, Y : T) return T is
A : T;
B : T;
Arg : T;
P : T;
Arg_Frac : T;
P_Frac : T;
Sign_X : T;
IEEE_Rem : T;
Arg_Exp : UI;
P_Exp : UI;
K : UI;
P_Even : Boolean;
pragma Warnings (Off, Arg_Frac);
begin
if UR_Is_Positive (X) then
Sign_X := Ureal_1;
else
Sign_X := -Ureal_1;
end if;
Arg := abs X;
P := abs Y;
if Arg < P then
P_Even := True;
IEEE_Rem := Arg;
P_Exp := Exponent (RT, P);
else
-- ??? what about zero cases?
Decompose (RT, Arg, Arg_Frac, Arg_Exp);
Decompose (RT, P, P_Frac, P_Exp);
P := Compose (RT, P_Frac, Arg_Exp);
K := Arg_Exp - P_Exp;
P_Even := True;
IEEE_Rem := Arg;
for Cnt in reverse 0 .. UI_To_Int (K) loop
if IEEE_Rem >= P then
P_Even := False;
IEEE_Rem := IEEE_Rem - P;
else
P_Even := True;
end if;
P := P * Ureal_Half;
end loop;
end if;
-- That completes the calculation of modulus remainder. The final step
-- is get the IEEE remainder. Here we compare Rem with (abs Y) / 2.
if P_Exp >= 0 then
A := IEEE_Rem;
B := abs Y * Ureal_Half;
else
A := IEEE_Rem * Ureal_2;
B := abs Y;
end if;
if A > B or else (A = B and then not P_Even) then
IEEE_Rem := IEEE_Rem - abs Y;
end if;
return Sign_X * IEEE_Rem;
end Remainder;
--------------
-- Rounding --
--------------
function Rounding (RT : R; X : T) return T is
Result : T;
Tail : T;
begin
Result := Truncation (RT, abs X);
Tail := abs X - Result;
if Tail >= Ureal_Half then
Result := Result + Ureal_1;
end if;
if UR_Is_Negative (X) then
return -Result;
else
return Result;
end if;
end Rounding;
-------------
-- Scaling --
-------------
function Scaling (RT : R; X : T; Adjustment : UI) return T is
pragma Warnings (Off, RT);
begin
if Rbase (X) = Radix then
return UR_From_Components
(Num => Numerator (X),
Den => Denominator (X) - Adjustment,
Rbase => Radix,
Negative => UR_Is_Negative (X));
elsif Adjustment >= 0 then
return X * Radix ** Adjustment;
else
return X / Radix ** (-Adjustment);
end if;
end Scaling;
----------
-- Succ --
----------
function Succ (RT : R; X : T) return T is
Emin : constant UI := Machine_Emin_Value (RT);
Mantissa : constant UI := Machine_Mantissa_Value (RT);
Exp : UI := UI_Max (Emin, Exponent (RT, X));
Frac : T;
New_Frac : T;
begin
if UR_Is_Zero (X) then
Exp := Emin;
end if;
-- Set exponent such that the radix point will be directly following the
-- mantissa after scaling.
if Has_Denormals (RT) or Exp /= Emin then
Exp := Exp - Mantissa;
else
Exp := Exp - 1;
end if;
Frac := Scaling (RT, X, -Exp);
New_Frac := Ceiling (RT, Frac);
if New_Frac = Frac then
if New_Frac = Scaling (RT, -Ureal_1, Mantissa - 1) then
New_Frac := New_Frac + Scaling (RT, Ureal_1, Uint_Minus_1);
else
New_Frac := New_Frac + Ureal_1;
end if;
end if;
return Scaling (RT, New_Frac, Exp);
end Succ;
----------------
-- Truncation --
----------------
function Truncation (RT : R; X : T) return T is
pragma Warnings (Off, RT);
begin
return UR_From_Uint (UR_Trunc (X));
end Truncation;
-----------------------
-- Unbiased_Rounding --
-----------------------
function Unbiased_Rounding (RT : R; X : T) return T is
Abs_X : constant T := abs X;
Result : T;
Tail : T;
begin
Result := Truncation (RT, Abs_X);
Tail := Abs_X - Result;
if Tail > Ureal_Half then
Result := Result + Ureal_1;
elsif Tail = Ureal_Half then
Result := Ureal_2 *
Truncation (RT, (Result / Ureal_2) + Ureal_Half);
end if;
if UR_Is_Negative (X) then
return -Result;
elsif UR_Is_Positive (X) then
return Result;
-- For zero case, make sure sign of zero is preserved
else
return X;
end if;
end Unbiased_Rounding;
end Eval_Fat;
|
with Ada.Calendar;
private with Ada.Finalization;
package taglib is
type File (<>) is tagged limited private;
type Tag (<>) is tagged limited private;
type AudioProperties (<>) is tagged limited private;
procedure set_strings_unicode (unicode : Boolean);
procedure set_string_management_enabled (management : Boolean);
type File_Type is
(MPEG,
OggVorbis,
FLAC,
MPC,
OggFlac,
WavPack,
Speex,
TrueAudio,
MP4,
ASF);
function file_new (filename : String) return File;
function file_new (filename : String; c_type : File_Type) return File;
function is_valid (F : File) return Boolean;
function Get_Tag (F : File'Class) return Tag;
function Get_AudioProperties (F : File'Class) return AudioProperties;
procedure save (F : File);
function title (T : Tag) return String;
function artist (T : Tag) return String;
function album (T : Tag) return String;
function comment (T : Tag) return String;
function genre (T : Tag) return String;
function year (T : Tag) return Ada.Calendar.Year_Number;
function Track (T : Tag) return Natural;
procedure set_title (T : in out Tag; title : String);
procedure set_artist (T : in out Tag; artist : String);
procedure set_album (T : in out Tag; album : String);
procedure set_comment (T : in out Tag; comment : String);
procedure set_genre (T : in out Tag; genre : String);
procedure set_year (T : in out Tag; year : Ada.Calendar.Year_Number);
procedure set_track (T : in out Tag; Track : Positive);
procedure tag_free_strings;
function length (Properties : AudioProperties) return Natural;
function bitrate (Properties : AudioProperties) return Natural;
function samplerate (Properties : AudioProperties) return Natural;
function channels (Properties : AudioProperties) return Natural;
type ID3v2_Encoding is
(Latin1,
UTF16,
UTF16BE,
UTF8);
procedure set_default_text_encoding (encoding : ID3v2_Encoding);
private
type TagLib_File;
type TagLib_File_Access is access all TagLib_File with Storage_Size => 0;
type File is new Ada.Finalization.Limited_Controlled with record
Dummy : TagLib_File_Access;
end record;
procedure Finalize (Object : in out File);
type Taglib_Tag;
type Taglib_Tag_Access is access all Taglib_Tag with Storage_Size => 0;
type Tag is new Ada.Finalization.Limited_Controlled with record
dummy : Taglib_Tag_Access;
end record;
type TagLib_AudioProperties;
type TagLib_AudioProperties_Access is access all TagLib_AudioProperties with Storage_Size => 0;
type AudioProperties is new Ada.Finalization.Limited_Controlled with record
dummy : TagLib_AudioProperties_Access;
end record;
type Package_Controler is new Ada.Finalization.Limited_Controlled with null record;
end taglib;
|
------------------------------------------------------------------------------
-- --
-- Unicode Utilities --
-- --
-- Unicode Character Database (UCD) Facilities --
-- --
-- ------------------------------------------------------------------------ --
-- --
-- Copyright (C) 2019, ANNEXI-STRAYLINE Trans-Human Ltd. --
-- All rights reserved. --
-- --
-- Original Contributors: --
-- * Richard Wai (ANNEXI-STRAYLINE) --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- --
-- * Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A --
-- PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- This unit parses CaseFolding.txt to generate the function body for
-- Unicode.Case_Folding.Simple
procedure Unicode.UCD.Generate_Case_Folding.Simple
(CaseFolding_Path: in String := "CaseFolding.txt";
Body_Path : in String := "aura-unicode-case_folding-simple.adb");
-- note The Body file is open in Create mode.
|
-- Copyright 2013-2020 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package body Pck is
procedure Do_Nothing (A : System.Address) is
begin
null;
end Do_Nothing;
end Pck;
|
package kv.avm is
pragma Pure;
end kv.avm;
|
-- Copyright 2011-2016 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with Pck; use Pck;
procedure Foo is
begin
Hello;
There;
end Foo;
|
-- Copyright 2005-2015 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
procedure P is
type Index is (One, Two, Three);
type Table is array (Integer range 1 .. 3) of Integer;
type ETable is array (Index) of Integer;
type RTable is array (Index range Two .. Three) of Integer;
type UTable is array (Positive range <>) of Integer;
type PTable is array (Index) of Boolean;
pragma Pack (PTable);
function Get_UTable (I : Integer) return UTable is
begin
return Utable'(1 => I, 2 => 2, 3 => 3);
end Get_UTable;
One_Two_Three : Table := (1, 2, 3);
E_One_Two_Three : ETable := (1, 2, 3);
R_Two_Three : RTable := (2, 3);
U_One_Two_Three : UTable := Get_UTable (1);
P_One_Two_Three : PTable := (False, True, True);
Few_Reps : UTable := (1, 2, 3, 3, 3, 3, 3, 4, 5);
Many_Reps : UTable := (1, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 5);
Empty : array (1 .. 0) of Integer := (others => 0);
begin
One_Two_Three (1) := 4; -- START
E_One_Two_Three (One) := 4;
R_Two_Three (Two) := 4;
U_One_Two_Three (U_One_Two_Three'First) := 4;
P_One_Two_Three (One) := True;
Few_Reps (Few_Reps'First) := 2;
Many_Reps (Many_Reps'First) := 2;
Empty := (others => 1);
end P;
|
-----------------------------------------------------------------------
-- gen-commands-project -- Project creation command for dynamo
-- Copyright (C) 2011 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
package Gen.Commands.Project is
-- ------------------------------
-- Generator Command
-- ------------------------------
type Command is new Gen.Commands.Command with null record;
-- Execute the command with the arguments.
procedure Execute (Cmd : in Command;
Generator : in out Gen.Generator.Handler);
-- Write the help associated with the command.
procedure Help (Cmd : in Command;
Generator : in out Gen.Generator.Handler);
end Gen.Commands.Project;
|
-- This file is covered by the Internet Software Consortium (ISC) License
-- Reference: ../License.txt
with JohnnyText;
with Config;
with Definitions; use Definitions;
package Parameters is
package JT renames JohnnyText;
live_system : constant String := "LiveSystem";
no_ccache : constant String := "disabled";
synth_confdir : constant String := host_localbase & "/etc/synth";
type configuration_record is
record
operating_sys : JT.Text;
profile : JT.Text;
dir_system : JT.Text;
dir_repository : JT.Text;
dir_packages : JT.Text;
dir_portsdir : JT.Text;
dir_distfiles : JT.Text;
dir_buildbase : JT.Text;
dir_logs : JT.Text;
dir_ccache : JT.Text;
dir_options : JT.Text;
num_builders : builders;
jobs_limit : builders;
tmpfs_workdir : Boolean;
tmpfs_localbase : Boolean;
avec_ncurses : Boolean;
defer_prebuilt : Boolean;
end record;
configuration : configuration_record;
active_profile : JT.Text;
update_config : exception;
-- This procedure will create a default configuration file if one
-- does not already exist, otherwise it will it load it. In every case,
-- the "configuration" record will be populated after this is run.
-- returns "True" on success
function load_configuration (num_cores : cpu_range) return Boolean;
-- Maybe a previously valid directory path has been removed. This
-- function returns true when all the paths still work.
-- The configuration must be loaded before it's run, of course.
function all_paths_valid return Boolean;
procedure write_configuration (profile : String := live_system);
procedure write_blank_section (section : String);
function sections_list return JT.Text;
function alternative_profiles_exist return Boolean;
function default_profile (new_profile : String;
num_cores : cpu_range) return configuration_record;
function load_specific_profile (profile : String; num_cores : cpu_range)
return configuration_record;
procedure write_master_section;
procedure delete_profile (profile : String);
private
internal_config : Config.Configuration;
distfiles_loc : JT.Text;
memory_megs : Natural := 0;
make_query : exception;
bad_opsys : exception;
-- Default Sizing by number of CPUS
-- 1 CPU :: 1 Builder, 1 job per builder
-- 2/3 CPU :: 2 builders, 2 jobs per builder
-- 4/5 CPU :: 3 builders, 3 jobs per builder
-- 6/7 CPU :: 4 builders, 3 jobs per builder
-- 8/9 CPU :: 6 builders, 4 jobs per builder
-- 10/11 CPU :: 8 builders, 4 jobs per builder
-- 12+ CPU :: floor (75% * CPU), 5 jobs per builder
-- Each section is identical, but represents a profile
-- Selection 1 is the live system, a.k.a "[LiveSystem]"
-- If /usr/dports exists, that will be the default ports tree directory,
-- otherwise /usr/ports is.
-- The OpSys and distfiles are queried so "std_opsys" and "std_distfiles"
-- values are really not used at all.
-- LS_Builders : Integer (Queried, see cpu-based presets)
-- LS_Jobs_limit : Integer (Queried, see cpu-based presets)
LS_Packages : constant String := "/var/synth/live_packages";
LS_Logs : constant String := "/var/log/synth";
LS_Buildbase : constant String := "/usr/obj/synth-live";
conf_location : constant String := synth_confdir & "/synth.ini";
std_ports_loc : constant String := "/usr/ports";
std_dports_loc : constant String := "/usr/dports";
std_pkgsrc_loc : constant String := "/usr/pkgsrc";
std_distfiles : constant String := "/usr/ports/distfiles";
std_options : constant String := "/var/db/ports";
std_sysbase : constant String := "/";
std_opsys : constant String := "UnKnown";
master_section : constant String := "Global Configuration";
Field_01 : constant String := "Directory_packages";
Field_02 : constant String := "Directory_repository";
Field_03 : constant String := "Directory_portsdir";
Field_04 : constant String := "Directory_distfiles";
Field_05 : constant String := "Directory_buildbase";
Field_06 : constant String := "Directory_logs";
Field_07 : constant String := "Directory_ccache";
Field_08 : constant String := "Number_of_builders";
Field_09 : constant String := "Max_jobs_per_builder";
Field_10 : constant String := "Tmpfs_workdir";
Field_11 : constant String := "Tmpfs_localbase";
Field_12 : constant String := "Operating_system";
Field_13 : constant String := "Directory_options";
Field_14 : constant String := "Directory_system";
Field_15 : constant String := "Display_with_ncurses";
Field_16 : constant String := "leverage_prebuilt";
global_01 : constant String := "profile_selected";
procedure default_parallelism (num_cores : cpu_range;
num_builders : out Integer;
jobs_per_builder : out Integer);
-- These pull requested configuration information. If they aren't set,
-- they'll set it to the default (which it also returns);
function extract_string (profile, mark, default : String) return JT.Text;
function extract_boolean (profile, mark : String; default : Boolean)
return Boolean;
function extract_integer (profile, mark : String; default : Integer)
return Integer;
function section_exists (profile, mark : String) return Boolean;
function all_params_present (profile : String) return Boolean;
function all_global_present return Boolean;
function generated_section return String;
function param_set (profile, field : String) return Boolean;
function query_generic (portsdir, value : String) return String;
function query_generic_core (command : String) return String;
function query_distfiles (portsdir : String) return String;
function query_opsys (portsdir : String) return String;
function query_portsdir return String;
function enough_memory (num_builders : builders; opsys : JT.Text) return Boolean;
function determine_portsdirs return String;
procedure query_physical_memory;
procedure query_physical_memory_linux;
procedure query_physical_memory_sunos;
procedure mkdirp_from_file (filename : String);
end Parameters;
|
with Ada.Text_IO;
with CryptAda.Digests.Message_Digests.MD4;
with CryptAda.Digests.Hashes;
with CryptAda.Pragmatics;
with CryptAda.Utils.Format;
procedure RC_MD4 is
use CryptAda.Digests.Message_Digests;
use CryptAda.Digests;
use CryptAda.Pragmatics;
function To_Byte_Array (Item : String) return Byte_Array is
Result : Byte_Array (Item'Range);
begin
for I in Result'Range loop
Result (I) := Byte (Character'Pos (Item (I)));
end loop;
return Result;
end To_Byte_Array;
Text : constant String := "Rosetta Code";
Bytes : constant Byte_Array := To_Byte_Array (Text);
Handle : constant Message_Digest_Handle := MD4.Get_Message_Digest_Handle;
Pointer : constant Message_Digest_Ptr := Get_Message_Digest_Ptr (Handle);
Hash : Hashes.Hash;
begin
Digest_Start (Pointer);
Digest_Update (Pointer, Bytes);
Digest_End (Pointer, Hash);
Ada.Text_IO.Put_Line
("""" & Text & """: " & CryptAda.Utils.Format.To_Hex_String (Hashes.Get_Bytes (Hash)));
end RC_MD4;
|
-- 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_list_installed_colormaps_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;
cmaps_len : aliased Interfaces.Unsigned_16;
pad1 : aliased swig.int8_t_Array (0 .. 21);
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb.xcb_list_installed_colormaps_reply_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_list_installed_colormaps_reply_t.Item,
Element_Array => xcb.xcb_list_installed_colormaps_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_list_installed_colormaps_reply_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_list_installed_colormaps_reply_t.Pointer,
Element_Array => xcb.xcb_list_installed_colormaps_reply_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_list_installed_colormaps_reply_t;
|
-- Copyright (c) 2015-2017 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
package Incr.Parsers is
pragma Pure;
end Incr.Parsers;
|
pragma Ada_2012;
pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
with System;
limited with color_h;
with error_h;
with Interfaces.C.Strings;
package tileset_h is
-- BSD 3-Clause License
-- *
-- * Copyright © 2008-2021, Jice and the libtcod contributors.
-- * All rights reserved.
-- *
-- * 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.
--
type TCOD_Tileset;
type TCOD_TilesetObserver;
type TCOD_TilesetObserver is record
tileset : access TCOD_Tileset; -- tileset.h:43
next : access TCOD_TilesetObserver; -- tileset.h:44
userdata : System.Address; -- tileset.h:45
on_observer_delete : access procedure (arg1 : access TCOD_TilesetObserver); -- tileset.h:46
on_tile_changed : access function (arg1 : access TCOD_TilesetObserver; arg2 : int) return int; -- tileset.h:47
end record
with Convention => C_Pass_By_Copy; -- tileset.h:42
type TCOD_Tileset is record
tile_width : aliased int; -- tileset.h:50
tile_height : aliased int; -- tileset.h:51
tile_length : aliased int; -- tileset.h:52
tiles_capacity : aliased int; -- tileset.h:53
tiles_count : aliased int; -- tileset.h:54
pixels : access color_h.TCOD_ColorRGBA; -- tileset.h:55
character_map_length : aliased int; -- tileset.h:56
character_map : access int; -- tileset.h:57
observer_list : access TCOD_TilesetObserver; -- tileset.h:58
virtual_columns : aliased int; -- tileset.h:59
ref_count : aliased int; -- tileset.h:60
end record
with Convention => C_Pass_By_Copy; -- tileset.h:49
-- clang-format off
--*
-- A character mapping of a Code Page 437 tileset to Unicode.
--
TCOD_CHARMAP_CP437 : aliased array (0 .. 255) of aliased int -- tileset.h:67
with Import => True,
Convention => C,
External_Name => "TCOD_CHARMAP_CP437";
--*
-- A character mapping of a deprecated TCOD tileset to Unicode.
--
TCOD_CHARMAP_TCOD : aliased array (0 .. 255) of aliased int -- tileset.h:104
with Import => True,
Convention => C,
External_Name => "TCOD_CHARMAP_TCOD";
-- clang-format on
--*
-- * Create a new tile-set with the given tile size.
--
function TCOD_tileset_new (arg1 : int; arg2 : int) return access TCOD_Tileset -- tileset.h:146
with Import => True,
Convention => C,
External_Name => "TCOD_tileset_new";
--*
-- * Delete a tile-set.
--
procedure TCOD_tileset_delete (tileset : access TCOD_Tileset) -- tileset.h:150
with Import => True,
Convention => C,
External_Name => "TCOD_tileset_delete";
--*
-- * Return the pixel width of tiles in this tileset.
-- *
-- * The tileset functions are provisional, the API may change in the future.
--
function TCOD_tileset_get_tile_width_u (tileset : access constant TCOD_Tileset) return int -- tileset.h:157
with Import => True,
Convention => C,
External_Name => "TCOD_tileset_get_tile_width_";
--*
-- * Return the pixel height of tiles in this tileset.
-- *
-- * The tileset functions are provisional, the API may change in the future.
--
function TCOD_tileset_get_tile_height_u (tileset : access constant TCOD_Tileset) return int -- tileset.h:164
with Import => True,
Convention => C,
External_Name => "TCOD_tileset_get_tile_height_";
--*
-- * Fetch a tile, outputting its data to a pixel buffer.
-- *
-- * `codepoint` is the index for the tile. Unicode is recommend.
-- *
-- * `buffer` is a pointer to a contiguous row-major array of pixels. The tile
-- * data will be outputted here. This pointer can be NULL if you only want to
-- * know if the tileset has a specific tile.
-- *
-- * Returns 0 if the tile exists. Returns a negative value on an error or if
-- * the tileset does not have a tile for this codepoint.
-- *
-- * The tileset functions are provisional, the API may change in the future.
--
function TCOD_tileset_get_tile_u
(tileset : access constant TCOD_Tileset;
codepoint : int;
buffer : access color_h.TCOD_ColorRGBA) return error_h.TCOD_Error -- tileset.h:181
with Import => True,
Convention => C,
External_Name => "TCOD_tileset_get_tile_";
--*
-- * Upload a tile from a pixel buffer into this tileset.
-- *
-- * `codepoint` is the index for the tile. Unicode is recommend.
-- *
-- * `buffer` is a pointer to a contiguous row-major array of pixels.
-- * This can not be NULL.
-- *
-- * The tileset functions are provisional, the API may change in the future.
--
function TCOD_tileset_set_tile_u
(tileset : access TCOD_Tileset;
codepoint : int;
buffer : access constant color_h.TCOD_ColorRGBA) return error_h.TCOD_Error -- tileset.h:194
with Import => True,
Convention => C,
External_Name => "TCOD_tileset_set_tile_";
--*
-- Load a PNG font as a tilesheet and return a TCOD_Tileset.
-- `filename` is the path to a PNG file.
-- `columns` and `rows` are the shape of the tileset in the image. The tile
-- size will be derived from these parameters and the size of the image.
-- `charmap[n]` is an array of which codepoints to assign to which tiles.
-- Tiles are assigned in row-major order.
-- `TCOD_CHARMAP_CP437` or `TCOD_CHARMAP_TCOD` could be used here.
--
function TCOD_tileset_load
(arg1 : Interfaces.C.Strings.chars_ptr;
arg2 : int;
arg3 : int;
arg4 : int;
arg5 : access int) return access TCOD_Tileset -- tileset.h:209
with Import => True,
Convention => C,
External_Name => "TCOD_tileset_load";
--*
-- Load a PNG font from memory and return a TCOD_Tileset.
-- `buffer[buffer_length]` is the PNG data to load.
-- The remaining parameters are the same as `TCOD_tileset_load`.
--
function TCOD_tileset_load_mem
(arg1 : size_t;
arg2 : access unsigned_char;
arg3 : int;
arg4 : int;
arg5 : int;
arg6 : access int) return access TCOD_Tileset -- tileset.h:220
with Import => True,
Convention => C,
External_Name => "TCOD_tileset_load_mem";
--*
-- Load raw RGBA data and return a TCOD_Tileset.
-- `pixels[width*height]` is a row-major RGBA-ordered byte array.
-- The remaining parameters are the same as `TCOD_tileset_load`.
--
function TCOD_tileset_load_raw
(arg1 : int;
arg2 : int;
arg3 : access constant color_h.TCOD_ColorRGBA;
arg4 : int;
arg5 : int;
arg6 : int;
arg7 : access int) return access TCOD_Tileset -- tileset.h:231
with Import => True,
Convention => C,
External_Name => "TCOD_tileset_load_raw";
--*
-- * Assign a codepoint to an existing tile based on its tile ID.
-- *
-- * Returns the tile ID on success.
-- *
-- * Returns a negative value on error.
--
function TCOD_tileset_assign_tile
(tileset : access TCOD_Tileset;
tile_id : int;
codepoint : int) return int -- tileset.h:248
with Import => True,
Convention => C,
External_Name => "TCOD_tileset_assign_tile";
--*
-- * Return a pointer to the tile for `codepoint`.
-- *
-- * Returns NULL if no tile exists for codepoint.
--
function TCOD_tileset_get_tile (arg1 : access constant TCOD_Tileset; arg2 : int) return access constant color_h.TCOD_ColorRGBA -- tileset.h:255
with Import => True,
Convention => C,
External_Name => "TCOD_tileset_get_tile";
--*
-- * Return a new observer to this tileset.
-- *
-- * For internal use.
--
function TCOD_tileset_observer_new (arg1 : access TCOD_Tileset) return access TCOD_TilesetObserver -- tileset.h:262
with Import => True,
Convention => C,
External_Name => "TCOD_tileset_observer_new";
--*
-- * Delete an existing observer.
-- *
-- * Will call this observers on_observer_delete callback.
-- *
-- * For internal use.
--
procedure TCOD_tileset_observer_delete (observer : access TCOD_TilesetObserver) -- tileset.h:270
with Import => True,
Convention => C,
External_Name => "TCOD_tileset_observer_delete";
--*
-- * Called to notify any observers that a tile has been changed. This may
-- * cause running atlases to update or mark cache consoles as dirty.
-- *
-- * For internal use.
--
procedure TCOD_tileset_notify_tile_changed (tileset : access TCOD_Tileset; tile_id : int) -- tileset.h:277
with Import => True,
Convention => C,
External_Name => "TCOD_tileset_notify_tile_changed";
--*
-- * Reserve memory for a specific amount of tiles.
-- *
-- * For internal use.
--
function TCOD_tileset_reserve (tileset : access TCOD_Tileset; desired : int) return error_h.TCOD_Error -- tileset.h:284
with Import => True,
Convention => C,
External_Name => "TCOD_tileset_reserve";
-- extern "C"
-- namespace tcod
end tileset_h;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with AMF.Internals.UML_Data_Types;
with AMF.String_Collections;
with AMF.UML.Classifier_Template_Parameters;
with AMF.UML.Classifiers.Collections;
with AMF.UML.Collaboration_Uses.Collections;
with AMF.UML.Constraints.Collections;
with AMF.UML.Dependencies.Collections;
with AMF.UML.Element_Imports.Collections;
with AMF.UML.Features.Collections;
with AMF.UML.Generalization_Sets.Collections;
with AMF.UML.Generalizations.Collections;
with AMF.UML.Named_Elements.Collections;
with AMF.UML.Namespaces;
with AMF.UML.Operations.Collections;
with AMF.UML.Package_Imports.Collections;
with AMF.UML.Packageable_Elements.Collections;
with AMF.UML.Packages.Collections;
with AMF.UML.Parameterable_Elements.Collections;
with AMF.UML.Primitive_Types;
with AMF.UML.Properties.Collections;
with AMF.UML.Redefinable_Elements.Collections;
with AMF.UML.Redefinable_Template_Signatures;
with AMF.UML.String_Expressions;
with AMF.UML.Substitutions.Collections;
with AMF.UML.Template_Bindings.Collections;
with AMF.UML.Template_Parameters;
with AMF.UML.Template_Signatures;
with AMF.UML.Types;
with AMF.UML.Use_Cases.Collections;
with AMF.Visitors;
package AMF.Internals.UML_Primitive_Types is
type UML_Primitive_Type_Proxy is
limited new AMF.Internals.UML_Data_Types.UML_Data_Type_Proxy
and AMF.UML.Primitive_Types.UML_Primitive_Type with null record;
overriding function Get_Owned_Attribute
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Properties.Collections.Ordered_Set_Of_UML_Property;
-- Getter of DataType::ownedAttribute.
--
-- The Attributes owned by the DataType.
overriding function Get_Owned_Operation
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Operations.Collections.Ordered_Set_Of_UML_Operation;
-- Getter of DataType::ownedOperation.
--
-- The Operations owned by the DataType.
overriding function Get_Attribute
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Properties.Collections.Set_Of_UML_Property;
-- Getter of Classifier::attribute.
--
-- Refers to all of the Properties that are direct (i.e. not inherited or
-- imported) attributes of the classifier.
overriding function Get_Collaboration_Use
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Collaboration_Uses.Collections.Set_Of_UML_Collaboration_Use;
-- Getter of Classifier::collaborationUse.
--
-- References the collaboration uses owned by the classifier.
overriding function Get_Feature
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Features.Collections.Set_Of_UML_Feature;
-- Getter of Classifier::feature.
--
-- Specifies each feature defined in the classifier.
-- Note that there may be members of the Classifier that are of the type
-- Feature but are not included in this association, e.g. inherited
-- features.
overriding function Get_General
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier;
-- Getter of Classifier::general.
--
-- Specifies the general Classifiers for this Classifier.
-- References the general classifier in the Generalization relationship.
overriding function Get_Generalization
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Generalizations.Collections.Set_Of_UML_Generalization;
-- Getter of Classifier::generalization.
--
-- Specifies the Generalization relationships for this Classifier. These
-- Generalizations navigaten to more general classifiers in the
-- generalization hierarchy.
overriding function Get_Inherited_Member
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Getter of Classifier::inheritedMember.
--
-- Specifies all elements inherited by this classifier from the general
-- classifiers.
overriding function Get_Is_Abstract
(Self : not null access constant UML_Primitive_Type_Proxy)
return Boolean;
-- Getter of Classifier::isAbstract.
--
-- If true, the Classifier does not provide a complete declaration and can
-- typically not be instantiated. An abstract classifier is intended to be
-- used by other classifiers e.g. as the target of general
-- metarelationships or generalization relationships.
overriding function Get_Is_Final_Specialization
(Self : not null access constant UML_Primitive_Type_Proxy)
return Boolean;
-- Getter of Classifier::isFinalSpecialization.
--
-- If true, the Classifier cannot be specialized by generalization. Note
-- that this property is preserved through package merge operations; that
-- is, the capability to specialize a Classifier (i.e.,
-- isFinalSpecialization =false) must be preserved in the resulting
-- Classifier of a package merge operation where a Classifier with
-- isFinalSpecialization =false is merged with a matching Classifier with
-- isFinalSpecialization =true: the resulting Classifier will have
-- isFinalSpecialization =false.
overriding procedure Set_Is_Final_Specialization
(Self : not null access UML_Primitive_Type_Proxy;
To : Boolean);
-- Setter of Classifier::isFinalSpecialization.
--
-- If true, the Classifier cannot be specialized by generalization. Note
-- that this property is preserved through package merge operations; that
-- is, the capability to specialize a Classifier (i.e.,
-- isFinalSpecialization =false) must be preserved in the resulting
-- Classifier of a package merge operation where a Classifier with
-- isFinalSpecialization =false is merged with a matching Classifier with
-- isFinalSpecialization =true: the resulting Classifier will have
-- isFinalSpecialization =false.
overriding function Get_Owned_Template_Signature
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Redefinable_Template_Signatures.UML_Redefinable_Template_Signature_Access;
-- Getter of Classifier::ownedTemplateSignature.
--
-- The optional template signature specifying the formal template
-- parameters.
overriding procedure Set_Owned_Template_Signature
(Self : not null access UML_Primitive_Type_Proxy;
To : AMF.UML.Redefinable_Template_Signatures.UML_Redefinable_Template_Signature_Access);
-- Setter of Classifier::ownedTemplateSignature.
--
-- The optional template signature specifying the formal template
-- parameters.
overriding function Get_Owned_Use_Case
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Use_Cases.Collections.Set_Of_UML_Use_Case;
-- Getter of Classifier::ownedUseCase.
--
-- References the use cases owned by this classifier.
overriding function Get_Powertype_Extent
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Generalization_Sets.Collections.Set_Of_UML_Generalization_Set;
-- Getter of Classifier::powertypeExtent.
--
-- Designates the GeneralizationSet of which the associated Classifier is
-- a power type.
overriding function Get_Redefined_Classifier
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier;
-- Getter of Classifier::redefinedClassifier.
--
-- References the Classifiers that are redefined by this Classifier.
overriding function Get_Representation
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Collaboration_Uses.UML_Collaboration_Use_Access;
-- Getter of Classifier::representation.
--
-- References a collaboration use which indicates the collaboration that
-- represents this classifier.
overriding procedure Set_Representation
(Self : not null access UML_Primitive_Type_Proxy;
To : AMF.UML.Collaboration_Uses.UML_Collaboration_Use_Access);
-- Setter of Classifier::representation.
--
-- References a collaboration use which indicates the collaboration that
-- represents this classifier.
overriding function Get_Substitution
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Substitutions.Collections.Set_Of_UML_Substitution;
-- Getter of Classifier::substitution.
--
-- References the substitutions that are owned by this Classifier.
overriding function Get_Template_Parameter
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Classifier_Template_Parameters.UML_Classifier_Template_Parameter_Access;
-- Getter of Classifier::templateParameter.
--
-- The template parameter that exposes this element as a formal parameter.
overriding procedure Set_Template_Parameter
(Self : not null access UML_Primitive_Type_Proxy;
To : AMF.UML.Classifier_Template_Parameters.UML_Classifier_Template_Parameter_Access);
-- Setter of Classifier::templateParameter.
--
-- The template parameter that exposes this element as a formal parameter.
overriding function Get_Use_Case
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Use_Cases.Collections.Set_Of_UML_Use_Case;
-- Getter of Classifier::useCase.
--
-- The set of use cases for which this Classifier is the subject.
overriding function Get_Element_Import
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Element_Imports.Collections.Set_Of_UML_Element_Import;
-- Getter of Namespace::elementImport.
--
-- References the ElementImports owned by the Namespace.
overriding function Get_Imported_Member
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element;
-- Getter of Namespace::importedMember.
--
-- References the PackageableElements that are members of this Namespace
-- as a result of either PackageImports or ElementImports.
overriding function Get_Member
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Getter of Namespace::member.
--
-- A collection of NamedElements identifiable within the Namespace, either
-- by being owned or by being introduced by importing or inheritance.
overriding function Get_Owned_Member
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Getter of Namespace::ownedMember.
--
-- A collection of NamedElements owned by the Namespace.
overriding function Get_Owned_Rule
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Constraints.Collections.Set_Of_UML_Constraint;
-- Getter of Namespace::ownedRule.
--
-- Specifies a set of Constraints owned by this Namespace.
overriding function Get_Package_Import
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Package_Imports.Collections.Set_Of_UML_Package_Import;
-- Getter of Namespace::packageImport.
--
-- References the PackageImports owned by the Namespace.
overriding function Get_Client_Dependency
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency;
-- Getter of NamedElement::clientDependency.
--
-- Indicates the dependencies that reference the client.
overriding function Get_Name_Expression
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.String_Expressions.UML_String_Expression_Access;
-- Getter of NamedElement::nameExpression.
--
-- The string expression used to define the name of this named element.
overriding procedure Set_Name_Expression
(Self : not null access UML_Primitive_Type_Proxy;
To : AMF.UML.String_Expressions.UML_String_Expression_Access);
-- Setter of NamedElement::nameExpression.
--
-- The string expression used to define the name of this named element.
overriding function Get_Namespace
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access;
-- Getter of NamedElement::namespace.
--
-- Specifies the namespace that owns the NamedElement.
overriding function Get_Qualified_Name
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.Optional_String;
-- Getter of NamedElement::qualifiedName.
--
-- A name which allows the NamedElement to be identified within a
-- hierarchy of nested Namespaces. It is constructed from the names of the
-- containing namespaces starting at the root of the hierarchy and ending
-- with the name of the NamedElement itself.
overriding function Get_Package
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Packages.UML_Package_Access;
-- Getter of Type::package.
--
-- Specifies the owning package of this classifier, if any.
overriding procedure Set_Package
(Self : not null access UML_Primitive_Type_Proxy;
To : AMF.UML.Packages.UML_Package_Access);
-- Setter of Type::package.
--
-- Specifies the owning package of this classifier, if any.
overriding function Get_Owning_Template_Parameter
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Template_Parameters.UML_Template_Parameter_Access;
-- Getter of ParameterableElement::owningTemplateParameter.
--
-- The formal template parameter that owns this element.
overriding procedure Set_Owning_Template_Parameter
(Self : not null access UML_Primitive_Type_Proxy;
To : AMF.UML.Template_Parameters.UML_Template_Parameter_Access);
-- Setter of ParameterableElement::owningTemplateParameter.
--
-- The formal template parameter that owns this element.
overriding function Get_Template_Parameter
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Template_Parameters.UML_Template_Parameter_Access;
-- Getter of ParameterableElement::templateParameter.
--
-- The template parameter that exposes this element as a formal parameter.
overriding procedure Set_Template_Parameter
(Self : not null access UML_Primitive_Type_Proxy;
To : AMF.UML.Template_Parameters.UML_Template_Parameter_Access);
-- Setter of ParameterableElement::templateParameter.
--
-- The template parameter that exposes this element as a formal parameter.
overriding function Get_Owned_Template_Signature
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Template_Signatures.UML_Template_Signature_Access;
-- Getter of TemplateableElement::ownedTemplateSignature.
--
-- The optional template signature specifying the formal template
-- parameters.
overriding procedure Set_Owned_Template_Signature
(Self : not null access UML_Primitive_Type_Proxy;
To : AMF.UML.Template_Signatures.UML_Template_Signature_Access);
-- Setter of TemplateableElement::ownedTemplateSignature.
--
-- The optional template signature specifying the formal template
-- parameters.
overriding function Get_Template_Binding
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Template_Bindings.Collections.Set_Of_UML_Template_Binding;
-- Getter of TemplateableElement::templateBinding.
--
-- The optional bindings from this element to templates.
overriding function Get_Is_Leaf
(Self : not null access constant UML_Primitive_Type_Proxy)
return Boolean;
-- Getter of RedefinableElement::isLeaf.
--
-- Indicates whether it is possible to further redefine a
-- RedefinableElement. If the value is true, then it is not possible to
-- further redefine the RedefinableElement. Note that this property is
-- preserved through package merge operations; that is, the capability to
-- redefine a RedefinableElement (i.e., isLeaf=false) must be preserved in
-- the resulting RedefinableElement of a package merge operation where a
-- RedefinableElement with isLeaf=false is merged with a matching
-- RedefinableElement with isLeaf=true: the resulting RedefinableElement
-- will have isLeaf=false. Default value is false.
overriding procedure Set_Is_Leaf
(Self : not null access UML_Primitive_Type_Proxy;
To : Boolean);
-- Setter of RedefinableElement::isLeaf.
--
-- Indicates whether it is possible to further redefine a
-- RedefinableElement. If the value is true, then it is not possible to
-- further redefine the RedefinableElement. Note that this property is
-- preserved through package merge operations; that is, the capability to
-- redefine a RedefinableElement (i.e., isLeaf=false) must be preserved in
-- the resulting RedefinableElement of a package merge operation where a
-- RedefinableElement with isLeaf=false is merged with a matching
-- RedefinableElement with isLeaf=true: the resulting RedefinableElement
-- will have isLeaf=false. Default value is false.
overriding function Get_Redefined_Element
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Redefinable_Elements.Collections.Set_Of_UML_Redefinable_Element;
-- Getter of RedefinableElement::redefinedElement.
--
-- The redefinable element that is being redefined by this element.
overriding function Get_Redefinition_Context
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier;
-- Getter of RedefinableElement::redefinitionContext.
--
-- References the contexts that this element may be redefined from.
overriding function Inherit
(Self : not null access constant UML_Primitive_Type_Proxy;
Inhs : AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Operation DataType::inherit.
--
-- The inherit operation is overridden to exclude redefined properties.
overriding function All_Features
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Features.Collections.Set_Of_UML_Feature;
-- Operation Classifier::allFeatures.
--
-- The query allFeatures() gives all of the features in the namespace of
-- the classifier. In general, through mechanisms such as inheritance,
-- this will be a larger set than feature.
overriding function Conforms_To
(Self : not null access constant UML_Primitive_Type_Proxy;
Other : AMF.UML.Classifiers.UML_Classifier_Access)
return Boolean;
-- Operation Classifier::conformsTo.
--
-- The query conformsTo() gives true for a classifier that defines a type
-- that conforms to another. This is used, for example, in the
-- specification of signature conformance for operations.
overriding function General
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier;
-- Operation Classifier::general.
--
-- The general classifiers are the classifiers referenced by the
-- generalization relationships.
overriding function Has_Visibility_Of
(Self : not null access constant UML_Primitive_Type_Proxy;
N : AMF.UML.Named_Elements.UML_Named_Element_Access)
return Boolean;
-- Operation Classifier::hasVisibilityOf.
--
-- The query hasVisibilityOf() determines whether a named element is
-- visible in the classifier. By default all are visible. It is only
-- called when the argument is something owned by a parent.
overriding function Inheritable_Members
(Self : not null access constant UML_Primitive_Type_Proxy;
C : AMF.UML.Classifiers.UML_Classifier_Access)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Operation Classifier::inheritableMembers.
--
-- The query inheritableMembers() gives all of the members of a classifier
-- that may be inherited in one of its descendants, subject to whatever
-- visibility restrictions apply.
overriding function Inherited_Member
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Operation Classifier::inheritedMember.
--
-- The inheritedMember association is derived by inheriting the
-- inheritable members of the parents.
-- The inheritedMember association is derived by inheriting the
-- inheritable members of the parents.
overriding function Is_Template
(Self : not null access constant UML_Primitive_Type_Proxy)
return Boolean;
-- Operation Classifier::isTemplate.
--
-- The query isTemplate() returns whether this templateable element is
-- actually a template.
overriding function May_Specialize_Type
(Self : not null access constant UML_Primitive_Type_Proxy;
C : AMF.UML.Classifiers.UML_Classifier_Access)
return Boolean;
-- Operation Classifier::maySpecializeType.
--
-- The query maySpecializeType() determines whether this classifier may
-- have a generalization relationship to classifiers of the specified
-- type. By default a classifier may specialize classifiers of the same or
-- a more general type. It is intended to be redefined by classifiers that
-- have different specialization constraints.
overriding function Exclude_Collisions
(Self : not null access constant UML_Primitive_Type_Proxy;
Imps : AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element;
-- Operation Namespace::excludeCollisions.
--
-- The query excludeCollisions() excludes from a set of
-- PackageableElements any that would not be distinguishable from each
-- other in this namespace.
overriding function Get_Names_Of_Member
(Self : not null access constant UML_Primitive_Type_Proxy;
Element : AMF.UML.Named_Elements.UML_Named_Element_Access)
return AMF.String_Collections.Set_Of_String;
-- Operation Namespace::getNamesOfMember.
--
-- The query getNamesOfMember() takes importing into account. It gives
-- back the set of names that an element would have in an importing
-- namespace, either because it is owned, or if not owned then imported
-- individually, or if not individually then from a package.
-- The query getNamesOfMember() gives a set of all of the names that a
-- member would have in a Namespace. In general a member can have multiple
-- names in a Namespace if it is imported more than once with different
-- aliases. The query takes account of importing. It gives back the set of
-- names that an element would have in an importing namespace, either
-- because it is owned, or if not owned then imported individually, or if
-- not individually then from a package.
overriding function Import_Members
(Self : not null access constant UML_Primitive_Type_Proxy;
Imps : AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element;
-- Operation Namespace::importMembers.
--
-- The query importMembers() defines which of a set of PackageableElements
-- are actually imported into the namespace. This excludes hidden ones,
-- i.e., those which have names that conflict with names of owned members,
-- and also excludes elements which would have the same name when imported.
overriding function Imported_Member
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element;
-- Operation Namespace::importedMember.
--
-- The importedMember property is derived from the ElementImports and the
-- PackageImports. References the PackageableElements that are members of
-- this Namespace as a result of either PackageImports or ElementImports.
overriding function Members_Are_Distinguishable
(Self : not null access constant UML_Primitive_Type_Proxy)
return Boolean;
-- Operation Namespace::membersAreDistinguishable.
--
-- The Boolean query membersAreDistinguishable() determines whether all of
-- the namespace's members are distinguishable within it.
overriding function Owned_Member
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Operation Namespace::ownedMember.
--
-- Missing derivation for Namespace::/ownedMember : NamedElement
overriding function All_Owning_Packages
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Packages.Collections.Set_Of_UML_Package;
-- Operation NamedElement::allOwningPackages.
--
-- The query allOwningPackages() returns all the directly or indirectly
-- owning packages.
overriding function Is_Distinguishable_From
(Self : not null access constant UML_Primitive_Type_Proxy;
N : AMF.UML.Named_Elements.UML_Named_Element_Access;
Ns : AMF.UML.Namespaces.UML_Namespace_Access)
return Boolean;
-- Operation NamedElement::isDistinguishableFrom.
--
-- The query isDistinguishableFrom() determines whether two NamedElements
-- may logically co-exist within a Namespace. By default, two named
-- elements are distinguishable if (a) they have unrelated types or (b)
-- they have related types but different names.
overriding function Namespace
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access;
-- Operation NamedElement::namespace.
--
-- Missing derivation for NamedElement::/namespace : Namespace
overriding function Conforms_To
(Self : not null access constant UML_Primitive_Type_Proxy;
Other : AMF.UML.Types.UML_Type_Access)
return Boolean;
-- Operation Type::conformsTo.
--
-- The query conformsTo() gives true for a type that conforms to another.
-- By default, two types do not conform to each other. This query is
-- intended to be redefined for specific conformance situations.
overriding function Is_Compatible_With
(Self : not null access constant UML_Primitive_Type_Proxy;
P : AMF.UML.Parameterable_Elements.UML_Parameterable_Element_Access)
return Boolean;
-- Operation ParameterableElement::isCompatibleWith.
--
-- The query isCompatibleWith() determines if this parameterable element
-- is compatible with the specified parameterable element. By default
-- parameterable element P is compatible with parameterable element Q if
-- the kind of P is the same or a subtype as the kind of Q. Subclasses
-- should override this operation to specify different compatibility
-- constraints.
overriding function Is_Template_Parameter
(Self : not null access constant UML_Primitive_Type_Proxy)
return Boolean;
-- Operation ParameterableElement::isTemplateParameter.
--
-- The query isTemplateParameter() determines if this parameterable
-- element is exposed as a formal template parameter.
overriding function Parameterable_Elements
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Parameterable_Elements.Collections.Set_Of_UML_Parameterable_Element;
-- Operation TemplateableElement::parameterableElements.
--
-- The query parameterableElements() returns the set of elements that may
-- be used as the parametered elements for a template parameter of this
-- templateable element. By default, this set includes all the owned
-- elements. Subclasses may override this operation if they choose to
-- restrict the set of parameterable elements.
overriding function Is_Consistent_With
(Self : not null access constant UML_Primitive_Type_Proxy;
Redefinee : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean;
-- Operation RedefinableElement::isConsistentWith.
--
-- The query isConsistentWith() specifies, for any two RedefinableElements
-- in a context in which redefinition is possible, whether redefinition
-- would be logically consistent. By default, this is false; this
-- operation must be overridden for subclasses of RedefinableElement to
-- define the consistency conditions.
overriding function Is_Redefinition_Context_Valid
(Self : not null access constant UML_Primitive_Type_Proxy;
Redefined : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean;
-- Operation RedefinableElement::isRedefinitionContextValid.
--
-- The query isRedefinitionContextValid() specifies whether the
-- redefinition contexts of this RedefinableElement are properly related
-- to the redefinition contexts of the specified RedefinableElement to
-- allow this element to redefine the other. By default at least one of
-- the redefinition contexts of this element must be a specialization of
-- at least one of the redefinition contexts of the specified element.
overriding procedure Enter_Element
(Self : not null access constant UML_Primitive_Type_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of visitor interface.
overriding procedure Leave_Element
(Self : not null access constant UML_Primitive_Type_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of visitor interface.
overriding procedure Visit_Element
(Self : not null access constant UML_Primitive_Type_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of iterator interface.
end AMF.Internals.UML_Primitive_Types;
|
with Ada.Text_IO; use Ada.Text_IO;
with Filesystem.Native; use Filesystem.Native;
with Test_Directories; use Test_Directories;
with File_Block_Drivers; use File_Block_Drivers;
with File_IO; use File_IO;
with Filesystem.FAT; use Filesystem.FAT;
with HAL.Filesystem;
with GNAT.MD5; use GNAT.MD5;
with Ada.Streams;
with Compare_Files;
procedure TC_FAT_Write is
use type HAL.Filesystem.Status_Code;
package Hash renames GNAT.MD5;
Test_File_Size : constant := 2000;
function Write_File (Filename : String) return String;
function Check_File (Filename : String; Md5 : String) return Boolean;
function Delete_Tree (Filename : String) return Boolean;
function Check_Read_Test_Dir return Boolean;
----------------
-- Write_File --
----------------
function Write_File (Filename : String) return String is
FD : File_Descriptor;
Status : Status_Code;
Context : aliased GNAT.MD5.Context := GNAT.MD5.Initial_Context;
Buffer : Ada.Streams.Stream_Element_Array (1 .. Test_File_Size);
Last : Ada.Streams.Stream_Element_Offset;
Size : File_Size;
use type Ada.Streams.Stream_Element_Offset;
begin
Status := Open (FD, Filename, Write_Only);
if Status /= OK then
Put_Line ("Cannot open file: '" & Filename & "'");
Put_Line ("Status: " & Status'Img);
return "";
end if;
Size := Buffer'Length;
Buffer := (others => 42);
Last := Ada.Streams.Stream_Element_Offset (Size);
Hash.Update (Context, Buffer (1 .. Last));
if Write (FD, Buffer'Address, Size) /= Size then
Put_Line ("Cannot write file: '" & Filename & "'");
Put_Line ("Status: " & Status'Img);
return "";
end if;
Close (FD);
return Hash.Digest (Context);
end Write_File;
----------------
-- Check_File --
----------------
function Check_File (Filename : String;
Md5 : String)
return Boolean
is
FD : File_Descriptor;
Status : Status_Code;
begin
Status := Open (FD, Filename, Read_Only);
if Status /= OK then
Put_Line ("Cannot open file: '" & Filename & "'");
Put_Line ("Status: " & Status'Img);
return False;
end if;
if Size (FD) /= Test_File_Size then
Put_Line ("Error: wrong file size: " & Size (FD)'Img &
" (expected " & Test_File_Size'Img & ")");
return False;
end if;
declare
Hash_Str : constant String := Compare_Files.Compute_Hash (FD);
begin
if Hash_Str /= Md5 then
Put_Line ("Error: Hash is different than filename");
return False;
else
return True;
end if;
end;
end Check_File;
-----------------
-- Delete_Tree --
-----------------
function Delete_Tree (Filename : String) return Boolean is
Dir : Directory_Descriptor;
Status : Status_Code;
begin
Status := Open (Dir, Filename);
if Status /= OK then
Put_Line ("Cannot open directory: '" & Filename & "'");
Put_Line ("Status: " & Status'Img);
return False;
end if;
loop
declare
Ent : constant Directory_Entry := Read (Dir);
begin
if Ent /= Invalid_Dir_Entry then
declare
Sub : constant String := Filename & "/" & Ent.Name;
begin
if Ent.Name = "." or else Ent.Name = ".." then
null; -- do nothing
elsif Ent.Subdirectory then
if not Delete_Tree (Sub) then
return False;
end if;
elsif not Ent.Symlink then
Status := Unlink (Sub);
if Status /= OK then
Put_Line ("Cannot delete file: '" & Sub & "' :" &
Status'Img);
return False;
end if;
end if;
end;
else
exit;
end if;
end;
end loop;
Status := Remove_Directory (Filename);
if Status /= OK then
Put_Line ("Cannot delete dir: '" & Filename & "' :" & Status'Img);
return False;
else
return True;
end if;
end Delete_Tree;
-------------------------
-- Check_Read_Test_Dir --
-------------------------
function Check_Read_Test_Dir return Boolean is
Dir : Directory_Descriptor;
Status : Status_Code;
Filename : constant String := "/disk_img/read_test/";
begin
Status := Open (Dir, Filename);
if Status /= OK then
Put_Line ("Cannot open directory: '" & Filename & "'");
Put_Line ("Status: " & Status'Img);
return False;
else
Close (Dir);
return True;
end if;
end Check_Read_Test_Dir;
Disk_Img_Path : constant String := "/" & Test_Dir_Mount_Name & "/fat.fs";
Copy_Disk_Img_Path : constant String := "/" & Test_Dir_Mount_Name & "/obj/fat.fs.copy";
Disk : aliased File_Block_Driver;
FAT_FS : access FAT_Filesystem;
Status : Status_Code;
HALFS_Status : HAL.Filesystem.Status_Code;
begin
Test_Directories.Mount_Test_Directory;
-- Make a copy of the disk image
if Copy_File (Disk_Img_Path, Copy_Disk_Img_Path) /= OK then
raise Program_Error with "Cannot copy disk image";
end if;
Status := Disk.Open (Copy_Disk_Img_Path, Read_Write);
if Status /= OK then
Put_Line ("Cannot open disk image '" & Copy_Disk_Img_Path & "': " &
Status'Img);
return;
end if;
declare
begin
FAT_FS := new FAT_Filesystem;
HALFS_Status := Open (Controller => Disk'Unchecked_Access,
LBA => 0,
FS => FAT_FS.all);
if HALFS_Status /= HAL.Filesystem.OK then
Put_Line ("Cannot open FAT FS - Status:" & HALFS_Status'Img);
return;
end if;
Status := Mount_Volume (Mount_Point => "disk_img",
FS => FAT_FS);
if Status /= OK then
Put_Line ("Cannot mount volume - Status: " & Status'Img);
return;
end if;
-- Check if the "read_test" directory is here
if Check_Read_Test_Dir then
Put_Line ("PASS");
else
Put_Line ("FAIL");
end if;
-- Make some room for the file that we will create
if not Delete_Tree ("/disk_img/read_test/lvl1_b") then
Put_Line ("Cannot delete directory lvl1_b");
end if;
if not Delete_Tree ("/disk_img/read_test/lvl1_c") then
Put_Line ("Cannot delete directory lvl1_c");
end if;
if Check_File (Filename => "/disk_img/write_test",
Md5 => Write_File ("/disk_img/write_test"))
then
Put_Line ("PASS");
else
Put_Line ("FAIL");
end if;
-- Check if the "read_test" directory is still here
if Check_Read_Test_Dir then
Put_Line ("PASS");
else
Put_Line ("FAIL");
end if;
end;
end TC_FAT_Write;
|
-- Copyright 2019 Michael Casadevall <michael@casadevall.pro>
--
-- 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 DNSCatcher.DNS.Processor.Packet; use DNSCatcher.DNS.Processor.Packet;
-- @summary
-- RData Unknown_Parser is a catch-all for any RRTypes that do not have
-- specific handling in this package. It exists to prevent crashes and to
-- store these rrtypes in a generic form as a failsafe.
--
-- @description
-- The unknown packet parser is the last resort used by the RData package.
-- Aside from the generic Type and TTL values, the unknown handler simply
-- contains a binary representation of a given class
--
package DNSCatcher.DNS.Processor.RData.Unknown_Parser is
-- Unknown RData Type
type Parsed_Unknown_RData is
new DNSCatcher.DNS.Processor.RData.Parsed_RData with private;
type Parsed_Unknown_RData_Access is access all Parsed_Unknown_RData;
-- Converts a RR record to logicial representation
--
-- @value This
-- Class object
--
-- @value DNS_Header
-- DNS Packet Header
--
-- @value Parsed_RR
-- Any parsed Resource Record from Processor.Packet
--
procedure From_Parsed_RR
(This : in out Parsed_Unknown_RData;
DNS_Header : DNS_Packet_Header;
Parsed_RR : Parsed_DNS_Resource_Record);
-- Represents RData as a String for debug logging
--
-- @value This
-- Class object
--
-- @returns
-- String saying "UNKNOWN"
--
function RData_To_String
(This : in Parsed_Unknown_RData)
return String;
-- Represents the resource record packet as a whole as a string
--
-- @value This
-- Class object
--
-- @returns
-- String that states "UNKNOWN"
--
function Print_Packet
(This : in Parsed_Unknown_RData)
return String;
-- Frees and deallocates the class object
--
-- @value This
-- Class object to deallocate
--
procedure Delete (This : in out Parsed_Unknown_RData);
private
type Parsed_Unknown_RData is new DNSCatcher.DNS.Processor.RData
.Parsed_RData with
record
RData : Unbounded_String;
end record;
end DNSCatcher.DNS.Processor.RData.Unknown_Parser;
|
<?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>dilate_0_0_2160_3840_0_3_3_1_1_s</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>4</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>imgHelper2_4102</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName>FIFO_SRL</coreName>
<coreId>49</coreId>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>imgHelper3_4103</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName>FIFO_SRL</coreName>
<coreId>49</coreId>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>p_src_rows</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName>FIFO_SRL</coreName>
<coreId>49</coreId>
</Obj>
<bitwidth>32</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>4</id>
<name>p_src_cols</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName>FIFO_SRL</coreName>
<coreId>52</coreId>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>p_src_rows_read</name>
<fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>340</lineNumber>
<contextFuncName>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</contextFuncName>
<contextNormFuncName>dilate_0_0_2160_3840_0_3_3_1_1_s</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second class_id="11" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="12" tracking_level="0" version="0">
<first class_id="13" tracking_level="0" version="0">
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</first>
<second>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</second>
</first>
<second>340</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control>auto</control>
<opType>fifo</opType>
<implIndex>srl</implIndex>
<coreName>FIFO_SRL</coreName>
<coreId>81</coreId>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>19</item>
<item>20</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.28</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>p_src_cols_read</name>
<fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>341</lineNumber>
<contextFuncName>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</contextFuncName>
<contextNormFuncName>dilate_0_0_2160_3840_0_3_3_1_1_s</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</first>
<second>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</second>
</first>
<second>341</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control>auto</control>
<opType>fifo</opType>
<implIndex>srl</implIndex>
<coreName>FIFO_SRL</coreName>
<coreId>81</coreId>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>21</item>
<item>22</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.28</m_delay>
<m_topoIndex>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name>trunc_ln340</name>
<fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>340</lineNumber>
<contextFuncName>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</contextFuncName>
<contextNormFuncName>dilate_0_0_2160_3840_0_3_3_1_1_s</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</first>
<second>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</second>
</first>
<second>340</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>113</coreId>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>3</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name>trunc_ln341</name>
<fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>341</lineNumber>
<contextFuncName>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</contextFuncName>
<contextNormFuncName>dilate_0_0_2160_3840_0_3_3_1_1_s</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</first>
<second>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</second>
</first>
<second>341</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>113</coreId>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>_ln376</name>
<fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>376</lineNumber>
<contextFuncName>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</contextFuncName>
<contextNormFuncName>dilate_0_0_2160_3840_0_3_3_1_1_s</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</first>
<second>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</second>
</first>
<second>376</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>113</coreId>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>26</item>
<item>27</item>
<item>28</item>
<item>29</item>
<item>30</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>_ln0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>49</coreId>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_11">
<Value>
<Obj>
<type>2</type>
<id>25</id>
<name>xfdilate_2160_3840_1_0_1_0_3841_3_3_s</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>97</coreId>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:xfdilate<2160, 3840, 1, 0, 1, 0, 3841, 3, 3>></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="_12">
<Obj>
<type>3</type>
<id>17</id>
<name>dilate<0, 0, 2160, 3840, 0, 3, 3, 1, 1></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>1768189039</coreId>
</Obj>
<node_objs>
<count>6</count>
<item_version>0</item_version>
<item>11</item>
<item>12</item>
<item>13</item>
<item>14</item>
<item>15</item>
<item>16</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="_13">
<id>20</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>11</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_14">
<id>22</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>12</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_15">
<id>23</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>13</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_16">
<id>24</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_17">
<id>26</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_18">
<id>27</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_19">
<id>28</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_20">
<id>29</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_21">
<id>30</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>15</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="_22">
<mId>1</mId>
<mTag>dilate<0, 0, 2160, 3840, 0, 3, 3, 1, 1></mTag>
<mNormTag>dilate_0_0_2160_3840_0_3_3_1_1_s</mNormTag>
<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>17</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>13</mMinLatency>
<mMaxLatency>8319373</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_23">
<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="_24">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_25">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_26">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_27">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_28">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_29">
<id>15</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_30">
<id>2</id>
<operations>
<count>8</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_31">
<id>5</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_32">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_33">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_34">
<id>8</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_35">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_36">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_37">
<id>15</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_38">
<id>16</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="_39">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>-1</id>
<sop class_id="32" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="-1"></res>
<node_label_latency class_id="35" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="36" tracking_level="0" version="0">
<first>11</first>
<second class_id="37" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>16</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>1</count>
<item_version>0</item_version>
<item class_id="39" tracking_level="0" version="0">
<first>17</first>
<second class_id="40" tracking_level="0" version="0">
<first>0</first>
<second>1</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="41" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</regions>
<dp_fu_nodes class_id="42" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="43" tracking_level="0" version="0">
<first>30</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>36</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>42</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>15</item>
<item>15</item>
</second>
</item>
<item>
<first>52</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>57</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="45" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="46" tracking_level="0" version="0">
<first>trunc_ln340_fu_52</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>trunc_ln341_fu_57</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>1</count>
<item_version>0</item_version>
<item>
<first>grp_xfdilate_2160_3840_1_0_1_0_3841_3_3_s_fu_42</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>15</item>
<item>15</item>
</second>
</item>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>2</count>
<item_version>0</item_version>
<item>
<first>p_src_cols_read_read_fu_36</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>p_src_rows_read_read_fu_30</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</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="47" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>2</count>
<item_version>0</item_version>
<item>
<first>62</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>67</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>2</count>
<item_version>0</item_version>
<item>
<first>trunc_ln340_reg_62</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>trunc_ln341_reg_67</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="48" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="49" tracking_level="0" version="0">
<first>imgHelper2_4102</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>call</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
</second>
</item>
<item>
<first>imgHelper3_4103</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>call</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
</second>
</item>
<item>
<first>p_src_cols</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
</second>
</item>
<item>
<first>p_src_rows</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core>
<count>4</count>
<item_version>0</item_version>
<item>
<first>1</first>
<second>
<first>1150</first>
<second>10</second>
</second>
</item>
<item>
<first>2</first>
<second>
<first>1151</first>
<second>10</second>
</second>
</item>
<item>
<first>3</first>
<second>
<first>1150</first>
<second>10</second>
</second>
</item>
<item>
<first>4</first>
<second>
<first>1150</first>
<second>10</second>
</second>
</item>
</port2core>
<node2core>
<count>3</count>
<item_version>0</item_version>
<item>
<first>11</first>
<second>
<first>1150</first>
<second>10</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>1150</first>
<second>10</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>-1</first>
<second>-1</second>
</second>
</item>
</node2core>
</syndb>
</boost_serialization>
|
package body NCurses is
procedure Start_Color_Init is
begin
Start_Color;
Init_Color_Pair(1, COLOR_WHITE, COLOR_BLACK);
Init_Color_Pair(2, COLOR_BLACK, COLOR_WHITE);
Init_Color_Pair(3, COLOR_RED, COLOR_BLACK);
Setup;
end Start_Color_Init;
procedure Pretty_Print_Window (Item : in String) is
begin
Print_Window(Item & ASCII.nul);
end Pretty_Print_Window;
procedure Pretty_Print_Line_Window (Item : in String) is
begin
Print_Window(Item & ASCII.lf & ASCII.nul);
end Pretty_Print_Line_Window;
end NCurses;
|
with impact.d3.Vector;
with impact.d3.collision.Proxy;
with Interfaces.C;
with ada.unchecked_Deallocation;
with impact.d3.Scalar;
with impact.d3.Containers;
-- #include "impact.d3.convex_HullShape.h"
-- #include "BulletCollision/CollisionShapes/impact.d3.collision.Margin.h"
--
-- #include "LinearMath/impact.d3.Quaternion.h"
-- #include "LinearMath/btSerializer.h"
package body impact.d3.Shape.convex.internal.polyhedral.hull
--
--
--
is
----------
--- Forge
--
function to_hull_Shape (points : access math.Real := null;
numPoints : in Natural := 0;
stride : in Integer := math.Vector_3'Size / 8) return Item
is
Self : Item;
pointsAddress : impact.d3.Containers.real_Pointer;
begin
Self.setShapeType (impact.d3.collision.Proxy.CONVEX_HULL_SHAPE_PROXYTYPE);
Self.m_unscaledPoints := new c_Vector_3_array (1 .. numPoints);
Self.m_point_Count := numPoints;
pointsAddress := points;
for i in 1 .. numPoints
loop
declare
use impact.d3.Containers.real_Pointers;
point : impact.d3.Containers.real_Pointer := pointsAddress;
begin
Self.m_unscaledPoints (i)(0) := point.all; increment (Point);
Self.m_unscaledPoints (i)(1) := point.all; increment (Point);
Self.m_unscaledPoints (i)(2) := point.all;
pointsAddress := pointsAddress + Interfaces.C.ptrdiff_t (stride);
end;
end loop;
Self.recalcLocalAabb;
return Self;
end to_hull_Shape;
---------------
--- Attributes
--
overriding function getName (Self : in Item) return String
is
pragma Unreferenced (Self);
begin
return "Convex";
end getName;
-- Currently just for debugging (drawing), perhaps future support for algebraic continuous collision detection
--
-- Please note that you can debug-draw impact.d3.convex_HullShape with the Raytracer Demo
--
overriding function getNumVertices (Self : in Item) return Integer
is
begin
return Self.m_point_Count;
end getNumVertices;
overriding function getNumEdges (Self : in Item) return Integer
is
begin
return Self.m_point_Count;
end getNumEdges;
overriding function getNumPlanes (Self : in Item) return Integer
is
pragma Unreferenced (Self);
begin
return 0;
end getNumPlanes;
overriding procedure getVertex (Self : in Item; i : in Integer;
vtx : out math.Vector_3)
is
begin
vtx := Self.getScaledPoint (i);
end getVertex;
overriding procedure getEdge (Self : in Item; i : in Integer;
pa, pb : out math.Vector_3)
is
index0 : constant Integer := i mod Self.m_point_Count;
index1 : constant Integer := (i + 1) mod Self.m_point_Count;
begin
pa := Self.getScaledPoint (index0);
pb := Self.getScaledPoint (index1);
end getEdge;
overriding procedure getPlane (Self : in Item; planeNormal : out math.Vector_3;
planeSupport : out math.Vector_3;
i : in Integer)
is
begin
raise Program_Error;
end getPlane;
-- not yet
--
overriding function isInside (Self : in Item; pt : in math.Vector_3;
tolerance : in math.Real) return Boolean
is
begin
raise Program_Error;
return False;
end isInside;
procedure addPoint (Self : in out Item; point : in math.Vector_3)
is
begin
Self.m_point_Count := Self.m_point_Count + 1;
if Self.m_point_Count > Self.m_unscaledPoints'Length then
declare
procedure free is new ada.unchecked_Deallocation (c_Vector_3_array, access_c_Vector_3_array);
new_Points : constant access_c_Vector_3_array := new c_Vector_3_array (1 .. 2 * Self.m_unscaledPoints'Length);
begin
new_Points (Self.m_unscaledPoints'Range) := Self.m_unscaledPoints.all;
free (Self.m_unscaledPoints);
Self.m_unscaledPoints := new_Points;
end;
end if;
Self.m_unscaledPoints (Self.m_point_Count) := to_C (point);
Self.recalcLocalAabb;
end addPoint;
function getUnscaledPoints (Self : in Item ) return access c_Vector_3
is
begin
return Self.m_unscaledPoints (1)'Access;
end getUnscaledPoints;
function getScaledPoint (Self : in Item; i : in Integer) return math.Vector_3
is
use impact.d3.Vector;
begin
return scaled (to_Math (Self.m_unscaledPoints (i)),
by => Self.getLocalScaling);
end getScaledPoint;
function getNumPoints (Self : in Item) return Natural
is
begin
return Self.m_point_Count;
end getNumPoints;
overriding function localGetSupportingVertex (Self : in Item; vec : in Math.Vector_3) return Math.Vector_3
is
use impact.d3.Vector, math.Vectors;
supVertex : math.Vector_3 := Self.localGetSupportingVertexWithoutMargin (vec);
vecnorm : math.Vector_3;
begin
if Self.getMargin /= 0.0 then
vecnorm := vec;
if length2 (vecnorm) < impact.d3.Scalar.SIMD_EPSILON * impact.d3.Scalar.SIMD_EPSILON then
vecnorm := (-1.0, -1.0, -1.0);
end if;
normalize (vecnorm);
supVertex := supVertex + Self.getMargin * vecnorm;
end if;
return supVertex;
end localGetSupportingVertex;
overriding function localGetSupportingVertexWithoutMargin (Self : in Item; vec : in Math.Vector_3) return Math.Vector_3
is
use impact.d3.Vector, Math.Vectors;
supVec : math.Vector_3 := math.Origin_3d;
newDot,
maxDot : math.Real := -BT_LARGE_FLOAT;
vtx : math.Vector_3;
begin
for i in 1 .. Integer (Self.m_point_Count)
loop
vtx := Scaled (to_Math (Self.m_unscaledPoints (i)),
by => Self.getLocalScaling);
newDot := dot (vec, vtx);
if newDot > maxDot then
maxDot := newDot;
supVec := vtx;
end if;
end loop;
return supVec;
end localGetSupportingVertexWithoutMargin;
overriding procedure batchedUnitVectorGetSupportingVertexWithoutMargin (Self : in Item; vectors : in Vector_3_array;
supportVerticesOut : out Vector_3_array;
numVectors : in Integer)
is
use impact.d3.Vector;
newDot : math.Real;
vec,
vtx : math.Vector_3;
begin
-- Use 'w' component of supportVerticesOut ?
for i in 1 .. numVectors
loop
supportVerticesOut (i) (4) := -BT_LARGE_FLOAT;
end loop;
for i in 1 .. Self.m_point_Count
loop
vtx := Self.getScaledPoint (i);
for j in 1 .. numVectors
loop
vec := vectors (j);
newDot := dot (vec, vtx);
if newDot > supportVerticesOut (j)(4) then
-- WARNING: don't swap next lines, the w component would get overwritten!
--
supportVerticesOut (j) := vtx;
supportVerticesOut (j)(4) := newDot;
end if;
end loop;
end loop;
end batchedUnitVectorGetSupportingVertexWithoutMargin;
procedure project (Self : in Item'Class; t : in Transform_3d;
dir : in Math.Vector_3;
min, max : out Real)
is
use linear_Algebra_3d,
impact.d3.Vector;
numVerts : constant Integer := Self.m_point_Count;
witnesPtMin,
witnesPtMax : math.Vector_3;
pragma Unreferenced (witnesPtMin, witnesPtMax);
vtx, pt : math.Vector_3;
dp, tmp : math.Real;
begin
min := math.Real'Last;
max := math.Real'First;
for i in 1 .. numVerts
loop
vtx := Scaled (to_Math (Self.m_unscaledPoints (i)),
by => Self.getLocalScaling);
pt := t * vtx;
dp := dot (pt, dir);
if dp < min then
min := dp;
witnesPtMin := pt;
end if;
if dp > max then
max := dp;
witnesPtMax := pt;
end if;
end loop;
if min > max then
tmp := min;
min := max;
max := tmp;
end if;
end project;
overriding procedure setLocalScaling (Self : in out Item; scaling : in Math.Vector_3)
is
begin
Self.set_m_localScaling (scaling);
Self.recalcLocalAabb;
end setLocalScaling;
end impact.d3.Shape.convex.internal.polyhedral.hull;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M --
-- --
-- S p e c --
-- (RiscV64 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. --
-- --
------------------------------------------------------------------------------
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.0;
-- Storage-related Declarations
type Address is private;
pragma Preelaborable_Initialization (Address);
Null_Address : constant Address;
Storage_Unit : constant := 8;
Word_Size : constant := Standard'Word_Size;
Memory_Size : constant := 2 ** Word_Size;
-- Address comparison
function "<" (Left, Right : Address) return Boolean;
function "<=" (Left, Right : Address) return Boolean;
function ">" (Left, Right : Address) return Boolean;
function ">=" (Left, Right : Address) return Boolean;
function "=" (Left, Right : Address) return Boolean;
pragma Import (Intrinsic, "<");
pragma Import (Intrinsic, "<=");
pragma Import (Intrinsic, ">");
pragma Import (Intrinsic, ">=");
pragma Import (Intrinsic, "=");
-- Other System-Dependent Declarations
type Bit_Order is (High_Order_First, Low_Order_First);
Default_Bit_Order : constant Bit_Order :=
Bit_Order'Val (Standard'Default_Bit_Order);
pragma Warnings (Off, Default_Bit_Order); -- kill constant condition warning
-- Priority-related Declarations (RM D.1)
Nbr_Interrupt_Priority : constant Positive := 7;
-- There are 8 priority levels on the FE310/FU540 but value zero is
-- reserved to mean "never interrupt".
Max_Interrupt_Priority : constant Positive := 255;
Min_Interrupt_Priority : constant Positive :=
Max_Interrupt_Priority - Nbr_Interrupt_Priority + 1;
Max_Priority : constant Positive :=
Min_Interrupt_Priority - 1;
subtype Any_Priority
is Integer range 0 .. Max_Interrupt_Priority;
subtype Priority
is Any_Priority range 0 .. Max_Priority;
subtype Interrupt_Priority
is Any_Priority range Min_Interrupt_Priority .. Max_Interrupt_Priority;
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 := False;
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;
end System;
|
-- C45274B.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 THE MEMBERSHIP OPERATOR IN ( NOT IN ) ALWAYS
-- YIELDS TRUE (RESP. FALSE ) FOR
--
-- * RECORD TYPES WITHOUT DISCRIMINANTS;
-- * PRIVATE TYPES WITHOUT DISCRIMINANTS;
-- * LIMITED PRIVATE TYPES WITHOUT DISCRIMINANTS;
-->> * (UNCONSTRAINED) RECORD TYPES WITH DISCRIMINANTS;
-->> * (UNCONSTRAINED) PRIVATE TYPES WITH DISCRIMINANTS;
-->> * (UNCONSTRAINED) LIMITED PRIVATE TYPES WITH DISCRIMINANTS.
-- RM 3/03/82
WITH REPORT;
USE REPORT;
PROCEDURE C45274B IS
BEGIN
TEST ( "C45274B" , "CHECK THAT THE MEMBERSHIP OPERATOR IN " &
" ( NOT IN ) YIELDS TRUE (RESP. FALSE )" &
" FOR UNCONSTRAINED TYPES WITH DISCRIMINANTS" );
-------------------------------------------------------------------
-------- UNCONSTRAINED RECORD TYPES WITH DISCRIMINANTS ----------
DECLARE
TYPE REC ( DISCR : BOOLEAN ) IS
RECORD
A , B : INTEGER ;
END RECORD ;
X : REC(FALSE) := ( FALSE , 19 , 81 );
TYPE REC0 ( DISCR : BOOLEAN := FALSE ) IS
RECORD
A , B : INTEGER ;
END RECORD ;
Y : REC0 := ( TRUE , 19 , 81 );
BEGIN
IF X IN REC THEN
NULL;
ELSE
FAILED( "WRONG VALUE: 'IN', 1A" );
END IF;
IF Y NOT IN REC0 THEN
FAILED( "WRONG VALUE: 'NOT IN', 1B" );
ELSE
NULL;
END IF;
EXCEPTION
WHEN OTHERS =>
FAILED( "1 - 'IN' ( 'NOT IN' ) RAISED AN EXCEPTION");
END;
-------------------------------------------------------------------
------- UNCONSTRAINED PRIVATE TYPES WITH DISCRIMINANTS ----------
DECLARE
PACKAGE P IS
TYPE PRIV ( DISCR : BOOLEAN ) IS PRIVATE;
PRIVATE
TYPE PRIV ( DISCR : BOOLEAN ) IS
RECORD
A , B : INTEGER ;
END RECORD ;
END P ;
USE P ;
X : PRIV(FALSE) ;
PACKAGE BODY P IS
BEGIN
X := ( FALSE , 19 , 91 );
END P ;
BEGIN
IF X IN PRIV THEN
NULL;
ELSE
FAILED( "WRONG VALUE: 'IN', 2" );
END IF;
IF X NOT IN PRIV THEN
FAILED( "WRONG VALUE: 'NOT IN', 2" );
ELSE
NULL;
END IF;
EXCEPTION
WHEN OTHERS =>
FAILED( "2 - 'IN' ( 'NOT IN' ) RAISED AN EXCEPTION");
END;
-------------------------------------------------------------------
--------- UNCONSTRAINED LIM. PRIV. TYPES WITH DISCRIM. ----------
DECLARE
PACKAGE P IS
TYPE LP ( DISCR : BOOLEAN := FALSE ) IS LIMITED PRIVATE;
PRIVATE
TYPE LP ( DISCR : BOOLEAN := FALSE ) IS
RECORD
A , B : INTEGER ;
END RECORD ;
END P ;
USE P ;
X : LP(TRUE) ;
PACKAGE BODY P IS
BEGIN
X := ( TRUE , 19 , 91 );
END P ;
BEGIN
IF X IN LP THEN
NULL;
ELSE
FAILED( "WRONG VALUE: 'IN', 3" );
END IF;
IF X NOT IN LP THEN
FAILED( "WRONG VALUE: 'NOT IN', 3" );
ELSE
NULL;
END IF;
EXCEPTION
WHEN OTHERS =>
FAILED( "3 - 'IN' ( 'NOT IN' ) RAISED AN EXCEPTION");
END;
-------------------------------------------------------------------
DECLARE
PACKAGE P IS
TYPE LP ( DISCR : BOOLEAN := FALSE ) IS LIMITED PRIVATE;
PRIVATE
TYPE LP ( DISCR : BOOLEAN := FALSE ) IS
RECORD
A , B : INTEGER ;
END RECORD ;
END P ;
USE P ;
Y : LP(TRUE) ;
-- CHECK THAT NO EXCEPTION FOR UNINITIALIZED VARIABLE
BEGIN
IF Y IN LP THEN
NULL;
ELSE
FAILED( "WRONG VALUE: 'IN', 3BIS" );
END IF;
IF Y NOT IN LP THEN
FAILED( "WRONG VALUE: 'NOT IN', 3BIS" );
ELSE
NULL;
END IF;
EXCEPTION
WHEN OTHERS =>
FAILED( "3BIS - UNINITIALIZED VARIABLE - 'IN' " &
"( 'NOT IN' ) RAISED AN EXCEPTION" );
END;
-------------------------------------------------------------------
RESULT;
END C45274B ;
|
package Nodes is
-- Type Node definition
type Node is tagged private;
type Node_Ptr is access Node;
private
-- Type node data-structre
type Node is tagged
record
end record;
end Nodes;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- SQL Database Access --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with Matreshka.Internals.SQL_Drivers.MySQL.Databases;
package body Matreshka.Internals.SQL_Drivers.MySQL.Factory is
type MySQL_Factory is new Abstract_Factory with null record;
overriding function Create
(Self : not null access MySQL_Factory) return not null Database_Access;
------------
-- Create --
------------
overriding function Create
(Self : not null access MySQL_Factory) return not null Database_Access is
begin
return new Databases.MySQL_Database;
end Create;
use type Interfaces.C.int;
Factory : aliased MySQL_Factory;
begin
-- Initialize client library or embedded server.
if mysql_library_init (0, null, null) /= 0 then
raise Program_Error;
end if;
-- Register factory.
Register
(League.Strings.To_Universal_String ("MYSQL"), Factory'Access);
end Matreshka.Internals.SQL_Drivers.MySQL.Factory;
|
with ada.text_io; use ada.text_io;
with spi; use spi;
with stdint_h; use stdint_h;
with Interfaces.C.Strings; use Interfaces.C.Strings;
with ada.command_line; use ada.command_line;
with ada.exceptions; use ada.exceptions;
procedure Send_Byte is
device : aliased SPI_Device;
tx_buf : aliased uint8_t;
rx_buf : aliased uint8_t;
procedure display_usage is
begin
put_line("Usage: ada_send_byte [DEVICE_PATH] [BYTE]\n");
put_line(" DEVICE_PATH: Full path to SPI device file.\n");
put_line(" BYTE: Byte to send (in hexidecimal)\n");
end display_usage;
begin
-- Validate argument count --
if argument_count < 2 then
display_usage;
return;
end if;
-- Convert byte parameter to binary --
tx_buf := uint8_t'value("16#" & argument(2) & "#");
-- Open the SPI device --
Open(Device => device'access,
Device_Path => New_String(argument(1)),
Mode => 0,
Bits => 8,
Freq => 20000);
-- Transfer one byte over SPI --
Transfer(Device => device'access,
Transmit_Buffer => tx_buf'access,
Receive_Buffer => rx_buf'access,
C_Delay => 0,
Length => 1);
-- Close the SPI device --
Close(Device => device'access);
exception
when error: others =>
put(Exception_Information(error));
end Send_Byte;
|
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Float_Text_IO; use Ada.Float_Text_IO;
with Ada.Integer_Text_IO; use Ada.Integer_Text_IO;
with Ada.Float_Text_IO; use Ada.Float_Text_IO;
with Sf.System.Sleep; use Sf, Sf.System, Sf.System.Sleep;
with Sf.System.Time; use Sf.System.Time;
with Sf.Audio.Music; use Sf.Audio, Sf.Audio.Music;
with Sf.Audio.SoundStatus; use Sf.Audio.SoundStatus;
with Ada.Command_Line;
procedure Main is
Music : sfMusic_Ptr;
Duration : sfTime;
ChCount : sfUint32;
SampRate : sfUint32;
begin
Music := createFromFile (Ada.Command_Line.Argument (1));
if Music = null then
Put_Line ("Music file not found!");
return;
end if;
setLoop (Music, sfFalse);
setPitch (Music, 1.0);
setVolume (Music, 100.0);
Duration := getDuration (Music);
ChCount := getChannelCount (Music);
SampRate := getSampleRate (Music);
Put ("Duration : ");
Put (Integer (asMilliseconds (Duration)));
Put (" milliseconds");
New_Line;
Put ("Channels count : ");
Put (Integer (ChCount), 0);
Put (" channels");
New_Line;
Put ("Sample rate : ");
Put (Integer (SampRate), 0);
Put (" channels/second");
New_Line;
play (Music);
Put ("Playing... ");
while getStatus (Music) = sfPlaying loop
-- Display the playing position
Put (Integer (asMilliseconds (getPlayingOffset(Music))));
Put (" ");
delay 0.1;
end loop;
destroy (Music);
end Main;
|
pragma Style_Checks ("NM32766");
pragma Wide_Character_Encoding (Brackets);
---------------------------------------------------
-- This file has been generated automatically from
-- cbsg.idl
-- by IAC (IDL to Ada Compiler) 20.0w (rev. 90136cd4).
---------------------------------------------------
-- NOTE: If you modify this file by hand, your
-- changes will be lost when you re-run the
-- IDL to Ada compiler.
---------------------------------------------------
-- Source: cbsg.idl
-- module CorbaCBSG
-- {
-- struct timestamped_Sentence {
-- long timestamp;
-- string sentence;
-- };
--
-- interface CBSG
-- {
-- timestamped_Sentence createTimestampedSentence();
-- string createSentence();
-- string createWorkshop();
-- string createShortWorkshop();
-- string createFinancialReport();
-- };
-- };
-- End source: cbsg.idl -- 17 lines
---------------------------------------------------
with PolyORB.Std;
with CORBA;
pragma Elaborate_All (CORBA);
package CorbaCBSG is
Repository_Id : constant PolyORB.Std.String :=
"IDL:CorbaCBSG:1.0";
type timestamped_Sentence is
record
timestamp : CORBA.Long;
sentence : CORBA.String;
end record;
timestamped_Sentence_Repository_Id : constant PolyORB.Std.String :=
"IDL:CorbaCBSG/timestamped_Sentence:1.0";
end CorbaCBSG;
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2019, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
package SiFive is
end SiFive;
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2016, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with HAL.Real_Time_Clock;
package STM32.RTC is
type RTC_Device is new HAL.Real_Time_Clock.RTC_Device with private;
overriding
procedure Set (This : in out RTC_Device;
Time : HAL.Real_Time_Clock.RTC_Time;
Date : HAL.Real_Time_Clock.RTC_Date);
overriding
procedure Get (This : in out RTC_Device;
Time : out HAL.Real_Time_Clock.RTC_Time;
Date : out HAL.Real_Time_Clock.RTC_Date);
overriding
function Get_Time (This : RTC_Device) return HAL.Real_Time_Clock.RTC_Time;
overriding
function Get_Date (This : RTC_Device) return HAL.Real_Time_Clock.RTC_Date;
procedure Enable (This : in out RTC_Device);
procedure Disable (This : in out RTC_Device);
private
type RTC_Device is new HAL.Real_Time_Clock.RTC_Device with
null record;
end STM32.RTC;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- E X P _ C G --
-- --
-- B o d y --
-- --
-- Copyright (C) 2010-2014, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING3. If not, go to --
-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Atree; use Atree;
with Einfo; use Einfo;
with Elists; use Elists;
with Exp_Disp; use Exp_Disp;
with Exp_Dbug; use Exp_Dbug;
with Exp_Tss; use Exp_Tss;
with Lib; use Lib;
with Namet; use Namet;
with Opt; use Opt;
with Output; use Output;
with Sem_Aux; use Sem_Aux;
with Sem_Disp; use Sem_Disp;
with Sem_Type; use Sem_Type;
with Sem_Util; use Sem_Util;
with Sinfo; use Sinfo;
with Sinput; use Sinput;
with Snames; use Snames;
with System; use System;
with Table;
with Uintp; use Uintp;
package body Exp_CG is
-- We duplicate here some declarations from packages Interfaces.C and
-- Interfaces.C_Streams because adding their dependence to the frontend
-- causes bootstrapping problems with old versions of the compiler.
subtype FILEs is System.Address;
-- Corresponds to the C type FILE*
subtype C_chars is System.Address;
-- Pointer to null-terminated array of characters
function fputs (Strng : C_chars; Stream : FILEs) return Integer;
pragma Import (C, fputs, "fputs");
-- Import the file stream associated with the "ci" output file. Done to
-- generate the output in the file created and left opened by routine
-- toplev.c before calling gnat1drv.
Callgraph_Info_File : FILEs;
pragma Import (C, Callgraph_Info_File);
package Call_Graph_Nodes is new Table.Table (
Table_Component_Type => Node_Id,
Table_Index_Type => Natural,
Table_Low_Bound => 1,
Table_Initial => 50,
Table_Increment => 100,
Table_Name => "Call_Graph_Nodes");
-- This table records nodes associated with dispatching calls and tagged
-- type declarations found in the main compilation unit. Used as an
-- auxiliary storage because the call-graph output requires fully qualified
-- names and they are not available until the backend is called.
function Is_Predefined_Dispatching_Operation (E : Entity_Id) return Boolean;
-- Determines if E is a predefined primitive operation.
-- Note: This routine should replace the routine with the same name that is
-- currently available in exp_disp because it extends its functionality to
-- handle fully qualified names ???
function Slot_Number (Prim : Entity_Id) return Uint;
-- Returns the slot number associated with Prim. For predefined primitives
-- the slot is returned as a negative number.
procedure Write_Output (Str : String);
-- Used to print a line in the output file (this is used as the
-- argument for a call to Set_Special_Output in package Output).
procedure Write_Call_Info (Call : Node_Id);
-- Subsidiary of Generate_CG_Output that generates the output associated
-- with a dispatching call.
procedure Write_Type_Info (Typ : Entity_Id);
-- Subsidiary of Generate_CG_Output that generates the output associated
-- with a tagged type declaration.
------------------------
-- Generate_CG_Output --
------------------------
procedure Generate_CG_Output is
N : Node_Id;
begin
-- No output if the "ci" output file has not been previously opened
-- by toplev.c
if Callgraph_Info_File = Null_Address then
return;
end if;
-- Setup write routine, create the output file and generate the output
Set_Special_Output (Write_Output'Access);
for J in Call_Graph_Nodes.First .. Call_Graph_Nodes.Last loop
N := Call_Graph_Nodes.Table (J);
if Nkind (N) in N_Subprogram_Call then
Write_Call_Info (N);
else pragma Assert (Nkind (N) = N_Defining_Identifier);
-- The type may be a private untagged type whose completion is
-- tagged, in which case we must use the full tagged view.
if not Is_Tagged_Type (N) and then Is_Private_Type (N) then
N := Full_View (N);
end if;
pragma Assert (Is_Tagged_Type (N));
Write_Type_Info (N);
end if;
end loop;
Set_Special_Output (null);
end Generate_CG_Output;
----------------
-- Initialize --
----------------
procedure Initialize is
begin
Call_Graph_Nodes.Init;
end Initialize;
-----------------------------------------
-- Is_Predefined_Dispatching_Operation --
-----------------------------------------
function Is_Predefined_Dispatching_Operation
(E : Entity_Id) return Boolean
is
function Homonym_Suffix_Length (E : Entity_Id) return Natural;
-- Returns the length of the homonym suffix corresponding to E.
-- Note: This routine relies on the functionality provided by routines
-- of Exp_Dbug. Further work needed here to decide if it should be
-- located in that package???
---------------------------
-- Homonym_Suffix_Length --
---------------------------
function Homonym_Suffix_Length (E : Entity_Id) return Natural is
Prefix_Length : constant := 2;
-- Length of prefix "__"
H : Entity_Id;
Nr : Nat := 1;
begin
if not Has_Homonym (E) then
return 0;
else
H := Homonym (E);
while Present (H) loop
if Scope (H) = Scope (E) then
Nr := Nr + 1;
end if;
H := Homonym (H);
end loop;
if Nr = 1 then
return 0;
-- Prefix "__" followed by number
else
declare
Result : Natural := Prefix_Length + 1;
begin
while Nr >= 10 loop
Result := Result + 1;
Nr := Nr / 10;
end loop;
return Result;
end;
end if;
end if;
end Homonym_Suffix_Length;
-- Local variables
Full_Name : constant String := Get_Name_String (Chars (E));
Suffix_Length : Natural;
TSS_Name : TSS_Name_Type;
-- Start of processing for Is_Predefined_Dispatching_Operation
begin
if not Is_Dispatching_Operation (E) then
return False;
end if;
-- Search for and strip suffix for body-nested package entities
Suffix_Length := Homonym_Suffix_Length (E);
for J in reverse Full_Name'First + 2 .. Full_Name'Last loop
if Full_Name (J) = 'X' then
-- Include the "X", "Xb", "Xn", ... in the part of the
-- suffix to be removed.
Suffix_Length := Suffix_Length + Full_Name'Last - J + 1;
exit;
end if;
exit when Full_Name (J) /= 'b' and then Full_Name (J) /= 'n';
end loop;
-- Most predefined primitives have internally generated names. Equality
-- must be treated differently; the predefined operation is recognized
-- as a homogeneous binary operator that returns Boolean.
if Full_Name'Length > TSS_Name_Type'Length then
TSS_Name :=
TSS_Name_Type
(Full_Name
(Full_Name'Last - TSS_Name'Length - Suffix_Length + 1
.. Full_Name'Last - Suffix_Length));
if TSS_Name = TSS_Stream_Read
or else TSS_Name = TSS_Stream_Write
or else TSS_Name = TSS_Stream_Input
or else TSS_Name = TSS_Stream_Output
or else TSS_Name = TSS_Deep_Adjust
or else TSS_Name = TSS_Deep_Finalize
then
return True;
elsif not Has_Fully_Qualified_Name (E) then
if Nam_In (Chars (E), Name_uSize, Name_uAlignment, Name_uAssign)
or else
(Chars (E) = Name_Op_Eq
and then Etype (First_Formal (E)) = Etype (Last_Formal (E)))
or else Is_Predefined_Interface_Primitive (E)
then
return True;
end if;
-- Handle fully qualified names
else
declare
type Names_Table is array (Positive range <>) of Name_Id;
Predef_Names_95 : constant Names_Table :=
(Name_uSize,
Name_uAlignment,
Name_Op_Eq,
Name_uAssign);
Predef_Names_05 : constant Names_Table :=
(Name_uDisp_Asynchronous_Select,
Name_uDisp_Conditional_Select,
Name_uDisp_Get_Prim_Op_Kind,
Name_uDisp_Get_Task_Id,
Name_uDisp_Requeue,
Name_uDisp_Timed_Select);
begin
for J in Predef_Names_95'Range loop
Get_Name_String (Predef_Names_95 (J));
-- The predefined primitive operations are identified by the
-- names "_size", "_alignment", etc. If we try a pattern
-- matching against this string, we can wrongly match other
-- primitive operations like "get_size". To avoid this, we
-- add the "__" scope separator, which can only prepend
-- predefined primitive operations because other primitive
-- operations can neither start with an underline nor
-- contain two consecutive underlines in its name.
if Full_Name'Last - Suffix_Length > Name_Len + 2
and then
Full_Name
(Full_Name'Last - Name_Len - 2 - Suffix_Length + 1
.. Full_Name'Last - Suffix_Length) =
"__" & Name_Buffer (1 .. Name_Len)
then
-- For the equality operator the type of the two operands
-- must also match.
return Predef_Names_95 (J) /= Name_Op_Eq
or else
Etype (First_Formal (E)) = Etype (Last_Formal (E));
end if;
end loop;
if Ada_Version >= Ada_2005 then
for J in Predef_Names_05'Range loop
Get_Name_String (Predef_Names_05 (J));
if Full_Name'Last - Suffix_Length > Name_Len + 2
and then
Full_Name
(Full_Name'Last - Name_Len - 2 - Suffix_Length + 1
.. Full_Name'Last - Suffix_Length) =
"__" & Name_Buffer (1 .. Name_Len)
then
return True;
end if;
end loop;
end if;
end;
end if;
end if;
return False;
end Is_Predefined_Dispatching_Operation;
----------------------
-- Register_CG_Node --
----------------------
procedure Register_CG_Node (N : Node_Id) is
begin
if Nkind (N) in N_Subprogram_Call then
if Current_Scope = Main_Unit_Entity
or else Entity_Is_In_Main_Unit (Current_Scope)
then
-- Register a copy of the dispatching call node. Needed since the
-- node containing a dispatching call is rewritten by the
-- expander.
declare
Copy : constant Node_Id := New_Copy (N);
Par : Node_Id;
begin
-- Determine the enclosing scope to use when generating the
-- call graph. This must be done now to avoid problems with
-- control structures that may be rewritten during expansion.
Par := Parent (N);
while Nkind (Par) /= N_Subprogram_Body
and then Nkind (Parent (Par)) /= N_Compilation_Unit
loop
Par := Parent (Par);
pragma Assert (Present (Par));
end loop;
Set_Parent (Copy, Par);
Call_Graph_Nodes.Append (Copy);
end;
end if;
else pragma Assert (Nkind (N) = N_Defining_Identifier);
if Entity_Is_In_Main_Unit (N) then
Call_Graph_Nodes.Append (N);
end if;
end if;
end Register_CG_Node;
-----------------
-- Slot_Number --
-----------------
function Slot_Number (Prim : Entity_Id) return Uint is
E : constant Entity_Id := Ultimate_Alias (Prim);
begin
if Is_Predefined_Dispatching_Operation (E) then
return -DT_Position (E);
else
return DT_Position (E);
end if;
end Slot_Number;
------------------
-- Write_Output --
------------------
procedure Write_Output (Str : String) is
Nul : constant Character := Character'First;
Line : String (Str'First .. Str'Last + 1);
Errno : Integer;
begin
-- Add the null character to the string as required by fputs
Line := Str & Nul;
Errno := fputs (Line'Address, Callgraph_Info_File);
pragma Assert (Errno >= 0);
end Write_Output;
---------------------
-- Write_Call_Info --
---------------------
procedure Write_Call_Info (Call : Node_Id) is
Ctrl_Arg : constant Node_Id := Controlling_Argument (Call);
Ctrl_Typ : constant Entity_Id := Base_Type (Etype (Ctrl_Arg));
Prim : constant Entity_Id := Entity (Sinfo.Name (Call));
P : constant Node_Id := Parent (Call);
begin
Write_Str ("edge: { sourcename: ");
Write_Char ('"');
-- The parent node is the construct that contains the call: subprogram
-- body or library-level package. Display the qualified name of the
-- entity of the construct. For a subprogram, it is the entity of the
-- spec, which carries a homonym counter when it is overloaded.
if Nkind (P) = N_Subprogram_Body
and then not Acts_As_Spec (P)
then
Get_External_Name (Corresponding_Spec (P));
else
Get_External_Name (Defining_Entity (P));
end if;
Write_Str (Name_Buffer (1 .. Name_Len));
if Nkind (P) = N_Package_Declaration then
Write_Str ("___elabs");
elsif Nkind (P) = N_Package_Body then
Write_Str ("___elabb");
end if;
Write_Char ('"');
Write_Eol;
-- The targetname is a triple:
-- N: the index in a vtable used for dispatch
-- V: the type who's vtable is used
-- S: the static type of the expression
Write_Str (" targetname: ");
Write_Char ('"');
pragma Assert (No (Interface_Alias (Prim)));
-- The check on Is_Ancestor is done here to avoid problems with
-- renamings of primitives. For example:
-- type Root is tagged ...
-- procedure Base (Obj : Root);
-- procedure Base2 (Obj : Root) renames Base;
if Present (Alias (Prim))
and then
Is_Ancestor
(Find_Dispatching_Type (Ultimate_Alias (Prim)),
Root_Type (Ctrl_Typ),
Use_Full_View => True)
then
-- This is a special case in which we generate in the ci file the
-- slot number of the renaming primitive (i.e. Base2) but instead of
-- generating the name of this renaming entity we reference directly
-- the renamed entity (i.e. Base).
Write_Int (UI_To_Int (Slot_Number (Prim)));
Write_Char (':');
Write_Name
(Chars (Find_Dispatching_Type (Ultimate_Alias (Prim))));
else
Write_Int (UI_To_Int (Slot_Number (Prim)));
Write_Char (':');
Write_Name (Chars (Root_Type (Ctrl_Typ)));
end if;
Write_Char (',');
Write_Name (Chars (Root_Type (Ctrl_Typ)));
Write_Char ('"');
Write_Eol;
Write_Str (" label: ");
Write_Char ('"');
Write_Location (Sloc (Call));
Write_Char ('"');
Write_Eol;
Write_Char ('}');
Write_Eol;
end Write_Call_Info;
---------------------
-- Write_Type_Info --
---------------------
procedure Write_Type_Info (Typ : Entity_Id) is
Elmt : Elmt_Id;
Prim : Node_Id;
Parent_Typ : Entity_Id;
Separator_Needed : Boolean := False;
begin
-- Initialize Parent_Typ handling private types
Parent_Typ := Etype (Typ);
if Present (Full_View (Parent_Typ)) then
Parent_Typ := Full_View (Parent_Typ);
end if;
Write_Str ("class {");
Write_Eol;
Write_Str (" classname: ");
Write_Char ('"');
Write_Name (Chars (Typ));
Write_Char ('"');
Write_Eol;
Write_Str (" label: ");
Write_Char ('"');
Write_Name (Chars (Typ));
Write_Char ('\');
Write_Location (Sloc (Typ));
Write_Char ('"');
Write_Eol;
if Parent_Typ /= Typ then
Write_Str (" parent: ");
Write_Char ('"');
Write_Name (Chars (Parent_Typ));
-- Note: Einfo prefix not needed if this routine is moved to
-- exp_disp???
if Present (Einfo.Interfaces (Typ))
and then not Is_Empty_Elmt_List (Einfo.Interfaces (Typ))
then
Elmt := First_Elmt (Einfo.Interfaces (Typ));
while Present (Elmt) loop
Write_Str (", ");
Write_Name (Chars (Node (Elmt)));
Next_Elmt (Elmt);
end loop;
end if;
Write_Char ('"');
Write_Eol;
end if;
Write_Str (" virtuals: ");
Write_Char ('"');
Elmt := First_Elmt (Primitive_Operations (Typ));
while Present (Elmt) loop
Prim := Node (Elmt);
-- Skip internal entities associated with overridden interface
-- primitives, and also inherited primitives.
if Present (Interface_Alias (Prim))
or else
(Present (Alias (Prim))
and then Find_Dispatching_Type (Prim) /=
Find_Dispatching_Type (Alias (Prim)))
then
goto Continue;
end if;
-- Do not generate separator for output of first primitive
if Separator_Needed then
Write_Str ("\n");
Write_Eol;
Write_Str (" ");
else
Separator_Needed := True;
end if;
Write_Int (UI_To_Int (Slot_Number (Prim)));
Write_Char (':');
-- Handle renamed primitives
if Present (Alias (Prim)) then
Write_Name (Chars (Ultimate_Alias (Prim)));
else
Write_Name (Chars (Prim));
end if;
-- Display overriding of parent primitives
if Present (Overridden_Operation (Prim))
and then
Is_Ancestor
(Find_Dispatching_Type (Overridden_Operation (Prim)), Typ,
Use_Full_View => True)
then
Write_Char (',');
Write_Int
(UI_To_Int (Slot_Number (Overridden_Operation (Prim))));
Write_Char (':');
Write_Name
(Chars (Find_Dispatching_Type (Overridden_Operation (Prim))));
end if;
-- Display overriding of interface primitives
if Has_Interfaces (Typ) then
declare
Prim_Elmt : Elmt_Id;
Prim_Op : Node_Id;
Int_Alias : Entity_Id;
begin
Prim_Elmt := First_Elmt (Primitive_Operations (Typ));
while Present (Prim_Elmt) loop
Prim_Op := Node (Prim_Elmt);
Int_Alias := Interface_Alias (Prim_Op);
if Present (Int_Alias)
and then
not Is_Ancestor (Find_Dispatching_Type (Int_Alias), Typ,
Use_Full_View => True)
and then (Alias (Prim_Op)) = Prim
then
Write_Char (',');
Write_Int (UI_To_Int (Slot_Number (Int_Alias)));
Write_Char (':');
Write_Name (Chars (Find_Dispatching_Type (Int_Alias)));
end if;
Next_Elmt (Prim_Elmt);
end loop;
end;
end if;
<<Continue>>
Next_Elmt (Elmt);
end loop;
Write_Char ('"');
Write_Eol;
Write_Char ('}');
Write_Eol;
end Write_Type_Info;
end Exp_CG;
|
-- CE2108H.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- OBJECTIVE:
-- CHECK THAT AN EXTERNAL DIRECT FILE SPECIFIED BY A NON-NULL
-- STRING NAME IS ACCESSIBLE AFTER THE COMPLETION OF THE MAIN
-- PROGRAM.
-- THIS TEST CHECKS THE CREATION OF A DIRECT FILE WHICH WAS
-- CREATED BY CE2108G.ADA.
-- APPLICABILITY CRITERIA:
-- THIS TEST IS APPLICABLE ONLY TO IMPLEMENTATIONS WHICH SUPPORT
-- DIRECT FILES.
-- HISTORY:
-- TBN 07/16/87 CREATED ORIGINAL TESTED.
WITH REPORT; USE REPORT;
WITH DIRECT_IO;
PROCEDURE CE2108H IS
PACKAGE DIR IS NEW DIRECT_IO (INTEGER);
USE DIR;
INCOMPLETE : EXCEPTION;
CHECK_SUPPORT, FILE_NAME : FILE_TYPE;
PREVENT_EMPTY_FILE : NATURAL := 0;
BEGIN
TEST ("CE2108H", "CHECK THAT AN EXTERNAL DIRECT FILE SPECIFIED " &
"BY A NON-NULL STRING NAME IS ACCESSIBLE AFTER " &
"THE COMPLETION OF THE MAIN PROGRAM");
-- TEST FOR DIRECT FILE SUPPORT.
BEGIN
CREATE (CHECK_SUPPORT, OUT_FILE, LEGAL_FILE_NAME);
BEGIN
DELETE (CHECK_SUPPORT);
EXCEPTION
WHEN USE_ERROR =>
NULL;
END;
EXCEPTION
WHEN USE_ERROR =>
NOT_APPLICABLE ("USE_ERROR RAISED ON DIRECT CREATE " &
"WITH OUT_FILE MODE");
RAISE INCOMPLETE;
WHEN NAME_ERROR =>
NOT_APPLICABLE ("NAME_ERROR RAISED ON DIRECT CREATE " &
"WITH OUT_FILE MODE");
RAISE INCOMPLETE;
WHEN OTHERS =>
FAILED ("UNEXPECTED EXCEPTION RAISED ON DIRECT CREATE");
RAISE INCOMPLETE;
END;
-- BEGIN TEST OBJECTIVE.
BEGIN
OPEN (FILE_NAME, IN_FILE, LEGAL_FILE_NAME(1, "CE2108G"));
EXCEPTION
WHEN USE_ERROR =>
NOT_APPLICABLE ("USE_ERROR RAISED ON OPEN WITH " &
"IN_FILE MODE");
RAISE INCOMPLETE;
END;
READ (FILE_NAME, PREVENT_EMPTY_FILE);
IF PREVENT_EMPTY_FILE /= 5 THEN
FAILED ("OPENED WRONG FILE OR DATA ERROR");
END IF;
BEGIN
DELETE (FILE_NAME);
EXCEPTION
WHEN USE_ERROR =>
COMMENT ("IMPLEMENTATION WOULD NOT ALLOW DELETION OF " &
"EXTERNAL FILE");
END;
RESULT;
EXCEPTION
WHEN INCOMPLETE =>
RESULT;
END CE2108H;
|
with Ada.Containers.Vectors;
package wa1 is
type Repr(<>) is private;
type Abstract_Base is interface;
function ToRepr(AB : Abstract_Base) return Repr is abstract;
procedure FromRepr(AB : in out Abstract_Base; rp : Repr) is abstract;
procedure Set_Smth (AB : in out Abstract_Base'Class; smth : Integer);
-----------------------------------------------
type Base is new Abstract_Base with private;
overriding
function ToRepr(B : Base) return Repr;
overriding
procedure FromRepr(B : in out Base; R : Repr);
private
type Smth_Array is array (Positive range <>) of Integer;
type Repr(Size : Natural) is record
smth : Integer;
sa : Smth_Array(1..Size);
end record;
----------------------------------------------------------------
package ACV is new Ada.Containers.Vectors(Positive, Integer);
type Base is new Abstract_Base with record
smth : Integer;
sv : ACV.Vector;
end record;
end wa1;
|
-- Abstract :
--
-- See spec.
--
-- Copyright (C) 2018 - 2019 Free Software Foundation, Inc.
--
-- This library is free software; you can redistribute it and/or modify it
-- under terms of the GNU General Public License as published by the Free
-- Software Foundation; either version 3, or (at your option) any later
-- version. This library is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHAN-
-- TABILITY or FITNESS FOR A PARTICULAR PURPOSE.
-- As a special exception under Section 7 of GPL version 3, you are granted
-- additional permissions described in the GCC Runtime Library Exception,
-- version 3.1, as published by the Free Software Foundation.
pragma License (Modified_GPL);
with Ada.Characters.Handling;
with Ada.Exceptions;
with Ada.Strings.Unbounded;
with Ada.Text_IO;
with GNAT.Regexp;
with SAL.Generic_Decimal_Image;
with System.Assertions;
with WisiToken.Generate; use WisiToken.Generate;
with Wisitoken_Grammar_Actions; use Wisitoken_Grammar_Actions;
package body WisiToken_Grammar_Runtime is
use WisiToken;
----------
-- Body subprograms, misc order
procedure Raise_Programmer_Error
(Label : in String;
Tree : in WisiToken.Syntax_Trees.Tree;
Node : in WisiToken.Syntax_Trees.Node_Index);
pragma No_Return (Raise_Programmer_Error);
procedure Raise_Programmer_Error
(Label : in String;
Tree : in WisiToken.Syntax_Trees.Tree;
Node : in WisiToken.Syntax_Trees.Node_Index)
is begin
raise SAL.Programmer_Error with Label & WisiToken.Syntax_Trees.Node_Index'Image (Node) &
":" & Tree.Image (Node, Wisitoken_Grammar_Actions.Descriptor, Include_Children => True);
end Raise_Programmer_Error;
function Get_Line
(Data : in User_Data_Type;
Tree : in Syntax_Trees.Tree;
Node : in WisiToken.Syntax_Trees.Valid_Node_Index)
return WisiToken.Line_Number_Type
is
-- Find a source line for Node.
use WisiToken.Syntax_Trees;
Temp : Node_Index := Node;
begin
loop
if Tree.Min_Terminal_Index (Temp) = Invalid_Token_Index then
-- Node is empty or all virtual_identifiers; try parents.
Temp := Tree.Parent (Temp);
exit when Temp = Invalid_Node_Index;
else
return Data.Terminals.all (Tree.Min_Terminal_Index (Temp)).Line;
end if;
end loop;
return Invalid_Line_Number;
end Get_Line;
function Get_Text
(Data : in User_Data_Type;
Tree : in Syntax_Trees.Tree;
Tree_Index : in Syntax_Trees.Valid_Node_Index;
Strip_Quotes : in Boolean := False)
return String
is
use all type Syntax_Trees.Node_Label;
function Strip_Delimiters (Tree_Index : in Syntax_Trees.Valid_Node_Index) return String
is
Region : Buffer_Region renames Data.Terminals.all (Tree.Terminal (Tree_Index)).Byte_Region;
begin
if -Tree.ID (Tree_Index) in RAW_CODE_ID | REGEXP_ID | ACTION_ID then
-- Strip delimiters. We don't strip leading/trailing spaces to preserve indent.
return Data.Grammar_Lexer.Buffer_Text ((Region.First + 2, Region.Last - 2));
elsif -Tree.ID (Tree_Index) in STRING_LITERAL_1_ID | STRING_LITERAL_2_ID and Strip_Quotes then
return Data.Grammar_Lexer.Buffer_Text ((Region.First + 1, Region.Last - 1));
else
return Data.Grammar_Lexer.Buffer_Text (Region);
end if;
end Strip_Delimiters;
begin
case Tree.Label (Tree_Index) is
when Shared_Terminal =>
return Strip_Delimiters (Tree_Index);
when Virtual_Terminal =>
-- Terminal keyword inserted during tree edit. We could check for
-- Identifier, but that will be caught later.
return Image (Tree.ID (Tree_Index), Wisitoken_Grammar_Actions.Descriptor);
when Virtual_Identifier =>
if Strip_Quotes then
declare
Quoted : constant String := -Data.Tokens.Virtual_Identifiers (Tree.Identifier (Tree_Index));
begin
return Quoted (Quoted'First + 1 .. Quoted'Last - 1);
end;
else
return -Data.Tokens.Virtual_Identifiers (Tree.Identifier (Tree_Index));
end if;
when Nonterm =>
declare
use all type Ada.Strings.Unbounded.Unbounded_String;
Result : Ada.Strings.Unbounded.Unbounded_String;
Tree_Indices : constant Syntax_Trees.Valid_Node_Index_Array := Tree.Get_Terminals (Tree_Index);
Need_Space : Boolean := False;
begin
for Tree_Index of Tree_Indices loop
Result := Result & (if Need_Space then " " else "") &
Get_Text (Data, Tree, Tree_Index, Strip_Quotes);
Need_Space := True;
end loop;
return -Result;
end;
end case;
end Get_Text;
function Get_Child_Text
(Data : in User_Data_Type;
Tree : in Syntax_Trees.Tree;
Parent : in Syntax_Trees.Valid_Node_Index;
Child : in SAL.Peek_Type;
Strip_Quotes : in Boolean := False)
return String
is
Tree_Indices : constant Syntax_Trees.Valid_Node_Index_Array := Tree.Get_Terminals (Parent);
begin
return Get_Text (Data, Tree, Tree_Indices (Child), Strip_Quotes);
end Get_Child_Text;
procedure Start_If_1
(Data : in out User_Data_Type;
Tree : in Syntax_Trees.Tree;
A_Index : in Syntax_Trees.Valid_Node_Index;
B_Index : in Syntax_Trees.Valid_Node_Index)
is
use all type WisiToken.BNF.Generate_Algorithm;
use all type WisiToken.BNF.Lexer_Type;
begin
if "lexer" = Get_Text (Data, Tree, A_Index) then
Data.If_Lexer_Present := True;
Data.Ignore_Lines := Data.User_Lexer /= WisiToken.BNF.To_Lexer (Get_Text (Data, Tree, B_Index));
elsif "parser" = Get_Text (Data, Tree, A_Index) then
Data.If_Parser_Present := True;
Data.Ignore_Lines := Data.User_Parser /= WisiToken.BNF.Generate_Algorithm'Value
(Get_Text (Data, Tree, B_Index));
else
raise Grammar_Error with
Error_Message
(Data.Grammar_Lexer.File_Name, Data.Terminals.all (Tree.Min_Terminal_Index (A_Index)).Line,
"invalid '%if'; must be one of {lexer | parser}");
end if;
end Start_If_1;
function Get_RHS
(Data : in out User_Data_Type;
Tree : in Syntax_Trees.Tree;
Labels : in out WisiToken.BNF.String_Arrays.Vector;
Token : in Syntax_Trees.Valid_Node_Index)
return WisiToken.BNF.RHS_Type
is
use all type WisiToken.Syntax_Trees.Node_Index;
use all type SAL.Base_Peek_Type;
Children : constant Syntax_Trees.Valid_Node_Index_Array := Tree.Children (Token);
begin
pragma Assert (-Tree.ID (Token) = rhs_ID);
return RHS : WisiToken.BNF.RHS_Type do
RHS.Source_Line := Get_Line (Data, Tree, Token);
if Children'Length > 0 then
for I of Tree.Get_IDs (Children (1), +rhs_element_ID) loop
case Tree.RHS_Index (I) is
when 0 =>
-- rhs_item
RHS.Tokens.Append
((Label => +"",
Identifier => +Get_Text (Data, Tree, Tree.Child (I, 1))));
when 1 =>
-- IDENTIFIER = rhs_item
declare
Label : constant String := Get_Text (Data, Tree, Tree.Child (I, 1));
begin
RHS.Tokens.Append
((Label => +Label,
Identifier => +Get_Text (Data, Tree, Tree.Child (I, 3))));
if (for all L of Labels => -L /= Label) then
Labels.Append (+Label);
end if;
end;
when others =>
Raise_Programmer_Error ("Get_RHS; unimplimented token", Tree, I);
end case;
end loop;
if Children'Last >= 2 then
declare
Text : constant String := Get_Text (Data, Tree, Children (2));
begin
if Text'Length > 0 and (for some C of Text => C /= ' ') then
RHS.Action := +Text;
Data.Action_Count := Data.Action_Count + 1;
end if;
end;
end if;
if Children'Last >= 3 then
RHS.Check := +Get_Text (Data, Tree, Children (3));
Data.Check_Count := Data.Check_Count + 1;
end if;
end if;
end return;
exception
when SAL.Programmer_Error =>
raise;
when E : others =>
declare
use Ada.Exceptions;
begin
Raise_Programmer_Error ("Get_RHS: " & Exception_Name (E) & ": " & Exception_Message (E), Tree, Token);
end;
end Get_RHS;
procedure Get_Right_Hand_Sides
(Data : in out User_Data_Type;
Tree : in WisiToken.Syntax_Trees.Tree;
Right_Hand_Sides : in out WisiToken.BNF.RHS_Lists.List;
Labels : in out WisiToken.BNF.String_Arrays.Vector;
Token : in WisiToken.Syntax_Trees.Valid_Node_Index)
is
Tokens : constant Syntax_Trees.Valid_Node_Index_Array := Tree.Children (Token);
begin
pragma Assert (-Tree.ID (Token) = rhs_list_ID);
case Tree.RHS_Index (Token) is
when 0 =>
-- | rhs
if not Data.Ignore_Lines then
Right_Hand_Sides.Append (Get_RHS (Data, Tree, Labels, Tokens (1)));
end if;
when 1 =>
-- | rhs_list BAR rhs
Get_Right_Hand_Sides (Data, Tree, Right_Hand_Sides, Labels, Tokens (1));
if not Data.Ignore_Lines then
Right_Hand_Sides.Append (Get_RHS (Data, Tree, Labels, Tokens (3)));
end if;
when 2 =>
-- | rhs_list PERCENT IF IDENTIFIER EQUAL IDENTIFIER
Get_Right_Hand_Sides (Data, Tree, Right_Hand_Sides, Labels, Tokens (1));
Start_If_1 (Data, Tree, Tokens (4), Tokens (6));
when 3 =>
-- | rhs_list PERCENT END IF
Get_Right_Hand_Sides (Data, Tree, Right_Hand_Sides, Labels, Tokens (1));
Data.Ignore_Lines := False;
when others =>
Raise_Programmer_Error ("Get_Right_Hand_Sides", Tree, Token);
end case;
end Get_Right_Hand_Sides;
----------
-- Public subprograms, declaration order
overriding
procedure Set_Lexer_Terminals
(User_Data : in out User_Data_Type;
Lexer : in WisiToken.Lexer.Handle;
Terminals : in Base_Token_Array_Access)
is begin
User_Data.Grammar_Lexer := Lexer;
User_Data.Terminals := Terminals;
end Set_Lexer_Terminals;
overriding procedure Reset (Data : in out User_Data_Type)
is begin
-- Preserve data set in Phase Meta, or by Set_Lexer_Terminals, or by
-- wisitoken-bnf-generate.
-- Preserve Grammar_Lexer
-- Preserve User_Lexer
-- Preserve User_Parser
-- Perserve Generate_Set
-- Preserve Meta_Syntax
-- Preserve Phase
-- Preserve Terminals
-- Preserve Non_Grammar
-- EBNF_Nodes handled in Initialize_Actions
Data.Raw_Code := (others => <>);
Data.Language_Params :=
(Case_Insensitive => Data.Language_Params.Case_Insensitive,
others => <>);
Data.Tokens :=
(Virtual_Identifiers => Data.Tokens.Virtual_Identifiers,
others => <>);
Data.Conflicts.Clear;
Data.McKenzie_Recover := (others => <>);
Data.Rule_Count := 0;
Data.Action_Count := 0;
Data.Check_Count := 0;
Data.Label_Count := 0;
Data.If_Lexer_Present := False;
Data.If_Parser_Present := False;
Data.Ignore_Lines := False;
end Reset;
overriding procedure Initialize_Actions
(Data : in out User_Data_Type;
Tree : in WisiToken.Syntax_Trees.Tree'Class)
is begin
Data.EBNF_Nodes.Clear;
Data.EBNF_Nodes.Set_First_Last (Tree.First_Index, Tree.Last_Index);
end Initialize_Actions;
overriding
procedure Lexer_To_Augmented
(Data : in out User_Data_Type;
Token : in WisiToken.Base_Token;
Lexer : not null access WisiToken.Lexer.Instance'Class)
is
pragma Unreferenced (Lexer);
use all type Ada.Containers.Count_Type;
begin
if Token.ID < Wisitoken_Grammar_Actions.Descriptor.First_Terminal then
-- Non-grammar token
if Data.Non_Grammar.Length = 0 then
Data.Non_Grammar.Set_First_Last (0, 0);
end if;
if Data.Terminals.Length = 0 then
Data.Non_Grammar (0).Append (Token);
else
Data.Non_Grammar.Set_Last (Data.Terminals.Last_Index);
Data.Non_Grammar (Data.Terminals.Last_Index).Append (Token);
end if;
end if;
end Lexer_To_Augmented;
procedure Start_If
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in WisiToken.Syntax_Trees.Tree;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is begin
-- all phases
Start_If_1 (User_Data_Type (User_Data), Tree, Tokens (3), Tokens (5));
end Start_If;
procedure End_If (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class)
is
Data : User_Data_Type renames User_Data_Type (User_Data);
begin
-- all phases
Data.Ignore_Lines := False;
end End_If;
procedure Add_Declaration
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in WisiToken.Syntax_Trees.Tree;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
use all type WisiToken.Syntax_Trees.Node_Label;
use all type Ada.Strings.Unbounded.Unbounded_String;
Data : User_Data_Type renames User_Data_Type (User_Data);
function Token (Index : in SAL.Peek_Type) return Base_Token
is
use all type SAL.Base_Peek_Type;
begin
if Tokens'Last < Index then
raise SAL.Programmer_Error;
elsif Tree.Label (Tokens (Index)) /= WisiToken.Syntax_Trees.Shared_Terminal then
raise SAL.Programmer_Error with "token at " & Image (Tree.Byte_Region (Tokens (Index))) &
" is a " & WisiToken.Syntax_Trees.Node_Label'Image (Tree.Label (Tokens (Index))) &
", expecting Shared_Terminal";
else
return Data.Terminals.all (Tree.Terminal (Tokens (Index)));
end if;
end Token;
function Enum_ID (Index : in SAL.Peek_Type) return Token_Enum_ID
is (To_Token_Enum (Token (Index).ID));
begin
if Data.Phase = Meta then
if Tree.Label (Tokens (2)) = WisiToken.Syntax_Trees.Shared_Terminal then
case Enum_ID (2) is
when IDENTIFIER_ID =>
declare
Kind : constant String := Data.Grammar_Lexer.Buffer_Text (Token (2).Byte_Region);
begin
if Kind = "case_insensitive" then
Data.Language_Params.Case_Insensitive := True;
elsif Kind = "generate" then
declare
use all type SAL.Base_Peek_Type;
Children : constant Syntax_Trees.Valid_Node_Index_Array := Tree.Get_Terminals (Tokens (3));
Tuple : WisiToken.BNF.Generate_Tuple;
begin
Tuple.Gen_Alg := WisiToken.BNF.To_Generate_Algorithm (Get_Text (Data, Tree, Children (1)));
if Children'Last >= 2 then
Tuple.Out_Lang := WisiToken.BNF.To_Output_Language (Get_Text (Data, Tree, Children (2)));
end if;
for I in 3 .. SAL.Base_Peek_Type (Children'Length) loop
declare
Text : constant String := Get_Text (Data, Tree, Children (I));
begin
if Text = "text_rep" then
Tuple.Text_Rep := True;
elsif (for some I of WisiToken.BNF.Lexer_Image => Text = I.all) then
Tuple.Lexer := WisiToken.BNF.To_Lexer (Text);
elsif (for some I in WisiToken.BNF.Valid_Interface =>
WisiToken.BNF.To_Lower (Text) = WisiToken.BNF.To_Lower
(WisiToken.BNF.Valid_Interface'Image (I)))
then
Tuple.Interface_Kind := WisiToken.BNF.Valid_Interface'Value (Text);
else
declare
Token : Base_Token renames Data.Terminals.all (Tree.Terminal (Children (I)));
begin
raise Grammar_Error with Error_Message
(Data.Grammar_Lexer.File_Name, Token.Line, Token.Column,
"invalid generate param '" & Text & "'");
end;
end if;
end;
end loop;
WisiToken.BNF.Add (Data.Generate_Set, Tuple);
end;
elsif Kind = "meta_syntax" then
if Data.Meta_Syntax = Unknown then
-- Don't overwrite; somebody set it for a reason.
declare
Value_Str : constant String := WisiToken.BNF.To_Lower (Get_Text (Data, Tree, Tokens (3)));
begin
if Value_Str = "bnf" then
Data.Meta_Syntax := BNF_Syntax;
elsif Value_Str = "ebnf" then
Data.Meta_Syntax := EBNF_Syntax;
Data.EBNF_Nodes (Tree.Find_Ancestor (Tokens (2), +declaration_ID)) := True;
else
Put_Error ("invalid value for %meta_syntax; must be BNF | EBNF.");
end if;
end;
end if;
end if;
end;
when others =>
null;
end case;
end if;
return;
end if;
-- Add declaration to User_Data.Generate_Set, Language_Params,
-- Tokens, Conflicts, or McKenzie_Recover.
if Data.Ignore_Lines then
return;
end if;
case Tree.Label (Tokens (2)) is
when Syntax_Trees.Nonterm =>
-- must be token_keyword_non_grammar
declare
Children : Syntax_Trees.Valid_Node_Index_Array renames Tree.Children (Tokens (2));
Child_1_ID : constant Token_Enum_ID := To_Token_Enum (Tree.ID (Children (1)));
begin
case Child_1_ID is
when Wisitoken_Grammar_Actions.TOKEN_ID =>
WisiToken.BNF.Add_Token
(Data.Tokens.Tokens,
Kind => Get_Text (Data, Tree, Children (3)),
Name => Get_Text (Data, Tree, Tokens (3)),
Value => Get_Text (Data, Tree, Tokens (4)));
when KEYWORD_ID =>
Data.Tokens.Keywords.Append
((Name => +Get_Text (Data, Tree, Tokens (3)),
Value => +Get_Text (Data, Tree, Tokens (4))));
when NON_GRAMMAR_ID =>
WisiToken.BNF.Add_Token
(Data.Tokens.Non_Grammar,
Kind => Get_Text (Data, Tree, Children (3)),
Name => Get_Text (Data, Tree, Tokens (3)),
Value => Get_Text (Data, Tree, Tokens (4)));
when others =>
raise SAL.Programmer_Error;
end case;
end;
when Syntax_Trees.Shared_Terminal =>
case Enum_ID (2) is
when CODE_ID =>
declare
Location : WisiToken.BNF.Raw_Code_Location;
-- % code identifier_list raw_code
-- 1 2 3 4
--
-- identifier_list = "action spec context"
-- identifier_list children = identifier_list IDENTIFIER_ID
-- children = identifier_list IDENTIFIER_ID
-- children = IDENTIFIER_ID
function Get_Loc_List return Base_Token_Array
is
use all type SAL.Base_Peek_Type;
use WisiToken.Syntax_Trees;
Node : Valid_Node_Index := Tokens (3);
Result : Base_Token_Array (1 .. 3);
First : SAL.Peek_Type := Result'Last + 1;
begin
loop
pragma Assert (-Tree.ID (Node) = identifier_list_ID);
exit when not Tree.Has_Children (Node);
declare
Children : constant Valid_Node_Index_Array := Tree.Children (Node);
begin
if Children'Length = 1 then
-- identifier_list : IDENTIFIER
First := First - 1;
Result (First) := Data.Terminals.all (Tree.Terminal (Children (1)));
exit;
elsif Children'Length = 2 then
-- identifier_list : identifier_list IDENTIFIER
First := First - 1;
Result (First) := Data.Terminals.all (Tree.Terminal (Children (2)));
Node := Children (1);
else
raise SAL.Programmer_Error;
end if;
end;
end loop;
return Result (First .. Result'Last);
end Get_Loc_List;
Loc_List : constant Base_Token_Array := Get_Loc_List;
function Get_Loc (Index : in SAL.Peek_Type) return String
is (Data.Grammar_Lexer.Buffer_Text (Loc_List (Index).Byte_Region));
begin
if Get_Loc (Loc_List'First) = "actions" then
Location :=
(if Get_Loc (2) = "spec" then
(if Get_Loc (3) = "context" then WisiToken.BNF.Actions_Spec_Context
elsif Get_Loc (3) = "pre" then WisiToken.BNF.Actions_Spec_Pre
elsif Get_Loc (3) = "post" then WisiToken.BNF.Actions_Spec_Post
else raise Grammar_Error with
Error_Message
(Data.Grammar_Lexer.File_Name, Loc_List (2).Line,
"expecting {context | pre | post}"))
elsif Get_Loc (2) = "body" then
(if Get_Loc (3) = "context" then WisiToken.BNF.Actions_Body_Context
elsif Get_Loc (3) = "pre" then WisiToken.BNF.Actions_Body_Pre
elsif Get_Loc (3) = "post" then WisiToken.BNF.Actions_Body_Post
else raise Grammar_Error with
Error_Message
(Data.Grammar_Lexer.File_Name, Loc_List (2).Line,
"expecting {context | pre | post}"))
else raise Grammar_Error);
elsif Get_Loc (Loc_List'First) = "copyright_license" then
Location := WisiToken.BNF.Copyright_License;
else
raise Grammar_Error with
Error_Message
(Data.Grammar_Lexer.File_Name, Loc_List (Loc_List'First).Line,
"expecting {actions | copyright_license}");
end if;
Data.Raw_Code (Location) := WisiToken.BNF.Split_Lines (Get_Text (Data, Tree, Tokens (4)));
exception
when Grammar_Error =>
Put_Error
(Error_Message
(Data.Grammar_Lexer.File_Name, Token (2).Line, Token (2).Column,
"invalid raw code location; actions {spec | body} {context | pre | post}"));
end;
when IDENTIFIER_ID =>
declare
Kind : constant String := Data.Grammar_Lexer.Buffer_Text (Token (2).Byte_Region);
begin
-- Alphabetical by Kind
if Kind = "case_insensitive" then
-- Not in phase Other
null;
elsif Kind = "conflict" then
declare
Tree_Indices : constant Syntax_Trees.Valid_Node_Index_Array := Tree.Get_Terminals
(Tokens (3));
-- %conflict <action_a>/<action_b> in state <LHS_A>, <LHS_B> on token <on>
-- 1 2 3 4 5 6 7 8 9 10 11
begin
Data.Conflicts.Append
((Source_Line => Data.Terminals.all (Tree.Terminal (Tree_Indices (1))).Line,
Action_A => +Get_Text (Data, Tree, Tree_Indices (1)),
LHS_A => +Get_Text (Data, Tree, Tree_Indices (6)),
Action_B => +Get_Text (Data, Tree, Tree_Indices (3)),
LHS_B => +Get_Text (Data, Tree, Tree_Indices (8)),
On => +Get_Text (Data, Tree, Tree_Indices (11))));
end;
elsif Kind = "end" then
-- matching '%if' specified current lexer.
null;
elsif Kind = "elisp_face" then
Data.Tokens.Faces.Append (Get_Text (Data, Tree, Tokens (3), Strip_Quotes => True));
elsif Kind = "elisp_indent" then
Data.Tokens.Indents.Append
((Name => +Get_Child_Text (Data, Tree, Tokens (3), 1, Strip_Quotes => True),
Value => +Get_Child_Text (Data, Tree, Tokens (3), 2)));
elsif Kind = "elisp_action" then
Data.Tokens.Actions.Insert
(Key => +Get_Child_Text (Data, Tree, Tokens (3), 2),
New_Item =>
(Action_Label => +Get_Child_Text (Data, Tree, Tokens (3), 1),
Ada_Name => +Get_Child_Text (Data, Tree, Tokens (3), 3)));
elsif Kind = "end_names_optional_option" then
Data.Language_Params.End_Names_Optional_Option := +Get_Text (Data, Tree, Tokens (3));
elsif Kind = "generate" then
-- Not in Other phase
null;
elsif Kind = "language_runtime" then
Data.Language_Params.Language_Runtime_Name :=
+Get_Text (Data, Tree, Tokens (3), Strip_Quotes => True);
elsif Kind = "mckenzie_check_limit" then
Data.Language_Params.Error_Recover := True;
Data.McKenzie_Recover.Check_Limit := Token_Index'Value (Get_Text (Data, Tree, Tokens (3)));
elsif Kind = "mckenzie_check_delta_limit" then
Data.Language_Params.Error_Recover := True;
Data.McKenzie_Recover.Check_Delta_Limit := Integer'Value (Get_Text (Data, Tree, Tokens (3)));
elsif Kind = "mckenzie_cost_default" then
if Tree.Get_Terminals (Tokens (3))'Length /= 4 then
raise Grammar_Error with
Error_Message
(Data.Grammar_Lexer.File_Name, Data.Terminals.all (Tree.Min_Terminal_Index (Tokens (3))).Line,
"too " & (if Tree.Get_Terminals (Tokens (3))'Length > 4 then "many" else "few") &
" default costs; should be 'insert, delete, push back, ignore check fail'.");
end if;
Data.Language_Params.Error_Recover := True;
Data.McKenzie_Recover.Source_Line := Data.Terminals.all (Tree.Min_Terminal_Index (Tokens (1))).Line;
Data.McKenzie_Recover.Default_Insert := Natural'Value
(Get_Child_Text (Data, Tree, Tokens (3), 1));
Data.McKenzie_Recover.Default_Delete_Terminal := Natural'Value
(Get_Child_Text (Data, Tree, Tokens (3), 2));
Data.McKenzie_Recover.Default_Push_Back := Natural'Value
(Get_Child_Text (Data, Tree, Tokens (3), 3));
Data.McKenzie_Recover.Ignore_Check_Fail := Natural'Value
(Get_Child_Text (Data, Tree, Tokens (3), 4));
elsif Kind = "mckenzie_cost_delete" then
Data.Language_Params.Error_Recover := True;
Data.McKenzie_Recover.Delete.Append
((+Get_Child_Text (Data, Tree, Tokens (3), 1),
+Get_Child_Text (Data, Tree, Tokens (3), 2)));
elsif Kind = "mckenzie_cost_fast_forward" then
Data.Language_Params.Error_Recover := True;
Data.McKenzie_Recover.Fast_Forward :=
Integer'Value (Get_Text (Data, Tree, Tokens (3)));
elsif Kind = "mckenzie_cost_insert" then
Data.Language_Params.Error_Recover := True;
Data.McKenzie_Recover.Insert.Append
((+Get_Child_Text (Data, Tree, Tokens (3), 1),
+Get_Child_Text (Data, Tree, Tokens (3), 2)));
elsif Kind = "mckenzie_cost_matching_begin" then
Data.Language_Params.Error_Recover := True;
Data.McKenzie_Recover.Matching_Begin :=
Integer'Value (Get_Text (Data, Tree, Tokens (3)));
elsif Kind = "mckenzie_cost_push_back" then
Data.Language_Params.Error_Recover := True;
Data.McKenzie_Recover.Push_Back.Append
((+Get_Child_Text (Data, Tree, Tokens (3), 1),
+Get_Child_Text (Data, Tree, Tokens (3), 2)));
elsif Kind = "mckenzie_cost_undo_reduce" then
Data.Language_Params.Error_Recover := True;
Data.McKenzie_Recover.Undo_Reduce.Append
((+Get_Child_Text (Data, Tree, Tokens (3), 1),
+Get_Child_Text (Data, Tree, Tokens (3), 2)));
elsif Kind = "mckenzie_enqueue_limit" then
Data.Language_Params.Error_Recover := True;
Data.McKenzie_Recover.Enqueue_Limit := Natural'Value (Get_Text (Data, Tree, Tokens (3)));
elsif Kind = "mckenzie_minimal_complete_cost_delta" then
Data.Language_Params.Error_Recover := True;
Data.McKenzie_Recover.Minimal_Complete_Cost_Delta :=
Integer'Value (Get_Text (Data, Tree, Tokens (3)));
elsif Kind = "meta_syntax" then
-- not in Other phase
null;
elsif Kind = "no_enum" then
Data.Language_Params.Declare_Enums := False;
elsif Kind = "no_language_runtime" then
Data.Language_Params.Use_Language_Runtime := False;
elsif Kind = "partial_recursion" then
Data.Language_Params.Partial_Recursion := True;
elsif Kind = "start" then
Data.Language_Params.Start_Token := +Get_Text (Data, Tree, Tokens (3));
elsif Kind = "re2c_regexp" then
Data.Tokens.re2c_Regexps.Append
((+Get_Child_Text (Data, Tree, Tokens (3), 1),
+Get_Child_Text (Data, Tree, Tokens (3), 2)));
else
raise Grammar_Error with Error_Message
(Data.Grammar_Lexer.File_Name, Token (2).Line, Token (2).Column, "unexpected syntax");
end if;
end;
when others =>
raise Grammar_Error with Error_Message
(Data.Grammar_Lexer.File_Name, Token (2).Line, Token (2).Column, "unexpected syntax");
end case;
when Syntax_Trees.Virtual_Terminal | Syntax_Trees.Virtual_Identifier =>
raise SAL.Programmer_Error;
end case;
end Add_Declaration;
procedure Add_Nonterminal
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in WisiToken.Syntax_Trees.Tree;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
use all type Ada.Containers.Count_Type;
use WisiToken.Syntax_Trees;
Data : User_Data_Type renames User_Data_Type (User_Data);
LHS_Node : constant Valid_Node_Index := Tokens (1);
LHS_String : constant String := Get_Text (Data, Tree, LHS_Node);
Right_Hand_Sides : WisiToken.BNF.RHS_Lists.List;
Labels : WisiToken.BNF.String_Arrays.Vector;
begin
if Data.Phase = Meta or Data.Ignore_Lines then
return;
end if;
Data.Rule_Count := Data.Rule_Count + 1;
Get_Right_Hand_Sides (Data, Tree, Right_Hand_Sides, Labels, Tokens (3));
if WisiToken.BNF.Is_Present (Data.Tokens.Rules, LHS_String) then
case Tree.Label (LHS_Node) is
when Shared_Terminal =>
declare
LHS_Token : Base_Token renames Data.Terminals.all (Tree.Terminal (LHS_Node));
begin
raise Grammar_Error with Error_Message
(Data.Grammar_Lexer.File_Name, LHS_Token.Line, LHS_Token.Column, "duplicate nonterm");
end;
when Virtual_Identifier =>
raise Grammar_Error with Error_Message
(Data.Grammar_Lexer.File_Name, 1, 1, "duplicate virtual nonterm '" & LHS_String & "'");
when others =>
Raise_Programmer_Error ("Add_Nonterminal", Tree, LHS_Node);
end case;
else
Data.Label_Count := Data.Label_Count + Labels.Length;
Data.Tokens.Rules.Append
((+LHS_String, Right_Hand_Sides, Labels,
Source_Line =>
(case Tree.Label (LHS_Node) is
when Shared_Terminal => Data.Terminals.all (Tree.Min_Terminal_Index (LHS_Node)).Line,
when Virtual_Identifier => Invalid_Line_Number, -- IMPROVEME: get line from Right_Hand_Sides
when others => raise SAL.Programmer_Error)));
end if;
end Add_Nonterminal;
procedure Check_EBNF
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in WisiToken.Syntax_Trees.Tree;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array;
Token : in WisiToken.Positive_Index_Type)
is
Data : User_Data_Type renames User_Data_Type (User_Data);
begin
case Data.Phase is
when Meta =>
Data.EBNF_Nodes (Tokens (Token)) := True;
if Data.Meta_Syntax /= EBNF_Syntax then
declare
Tok : Base_Token renames Data.Terminals.all (Tree.Min_Terminal_Index (Tokens (Token)));
begin
raise Grammar_Error with Error_Message
(Data.Grammar_Lexer.File_Name, Tok.Line, Tok.Column,
"EBNF syntax used, but BNF specified; set '%meta_syntax EBNF'");
end;
end if;
when Other =>
Raise_Programmer_Error ("untranslated EBNF node", Tree, Tree.Parent (Tokens (Token)));
end case;
end Check_EBNF;
procedure Translate_EBNF_To_BNF
(Tree : in out WisiToken.Syntax_Trees.Tree;
Data : in out User_Data_Type)
is
use WisiToken.Syntax_Trees;
Copied_EBNF_Nodes : WisiToken.Syntax_Trees.Valid_Node_Index_Arrays.Vector;
Symbol_Regexp : constant GNAT.Regexp.Regexp := GNAT.Regexp.Compile
((if Data.Language_Params.Case_Insensitive
then "[A-Z0-9_]+"
else "[a-zA-Z0-9_]+"),
Case_Sensitive => not Data.Language_Params.Case_Insensitive);
procedure Clear_EBNF_Node (Node : in Valid_Node_Index)
is begin
if Node in Data.EBNF_Nodes.First_Index .. Data.EBNF_Nodes.Last_Index then
Data.EBNF_Nodes (Node) := False;
-- else in Copied_EBNF_Nodes; don't need to delete from there.
end if;
end Clear_EBNF_Node;
function New_Identifier (Text : in String) return Identifier_Index
is
ID : constant Identifier_Index := Base_Identifier_Index (Data.Tokens.Virtual_Identifiers.Length) + 1;
begin
Data.Tokens.Virtual_Identifiers.Append (+Text);
return ID;
end New_Identifier;
Keyword_Ident : constant Identifier_Index := New_Identifier ("keyword");
Percent_Ident : constant Identifier_Index := New_Identifier ("percent");
function Next_Nonterm_Name (Suffix : in String := "") return Identifier_Index
is
function Image is new SAL.Generic_Decimal_Image (Identifier_Index);
ID : constant Identifier_Index := Identifier_Index (Data.Tokens.Virtual_Identifiers.Length) + 1;
begin
if ID > 999 then
-- We assume 3 digits below
raise SAL.Programmer_Error with "more than 3 digits needed for virtual identifiers in EBNF translate";
end if;
Data.Tokens.Virtual_Identifiers.Append (+("nonterminal_" & Image (ID, Width => 3) & Suffix));
return ID;
end Next_Nonterm_Name;
function Tree_Add_Nonterminal
(Child_1 : in Valid_Node_Index;
Child_2 : in Valid_Node_Index;
Child_3 : in Valid_Node_Index;
Child_4 : in Valid_Node_Index)
return Valid_Node_Index
is begin
-- Work around GNAT error about arbitrary evaluation order in
-- aggregates (no error about the arbitrary order in subprogram
-- parameter_assocation_lists!).
return Tree.Add_Nonterm
(Production => (+nonterminal_ID, 0),
Children => (Child_1, Child_2, Child_3, Child_4),
Action => Wisitoken_Grammar_Actions.nonterminal_0'Access);
end Tree_Add_Nonterminal;
function List_Root (Item : in Valid_Node_Index) return Valid_Node_Index
is
List_ID : constant WisiToken.Token_ID := Tree.ID (Item);
Node : Valid_Node_Index := Item;
begin
loop
exit when Tree.ID (Tree.Parent (Node)) /= List_ID;
Node := Tree.Parent (Node);
end loop;
return Node;
end List_Root;
function List_Singleton (Root : in Valid_Node_Index) return Boolean
is begin
return Tree.RHS_Index (Root) = 0;
end List_Singleton;
function First_List_Element (Root : in Valid_Node_Index; Element_ID : in WisiToken.Token_ID) return Node_Index
is
List_ID : constant WisiToken.Token_ID := Tree.ID (Root);
-- Return the first child with Element_ID in list of List_IDs. This
-- is not the same as Find_Descendant, because we check the children
-- first, and only the first child.
Node : Node_Index := Root;
begin
loop
declare
Children : constant Valid_Node_Index_Array := Tree.Children (Node);
begin
if Tree.ID (Children (1)) = List_ID then
Node := Children (1);
elsif Tree.ID (Children (1)) = Element_ID then
Node := Children (1);
exit;
else
Raise_Programmer_Error ("first_list_element", Tree, Node);
end if;
end;
end loop;
return Node;
end First_List_Element;
function Last_List_Element (Root : in Valid_Node_Index) return Node_Index
is
-- Tree is one of:
--
-- case a: single element list
-- element_list : root
-- | element: Last
--
-- case c: no next
-- element_list: root
-- | element_list
-- | | element:
-- | element: Last
Children : constant Valid_Node_Index_Array := Tree.Children (Root);
begin
return Children (Children'Last);
end Last_List_Element;
function Next_List_Element
(Element : in Valid_Node_Index;
List_ID : in WisiToken.Token_ID)
return Node_Index
with Pre => Tree.Parent (Element, 2) /= Invalid_Node_Index and then
Tree.ID (Tree.Parent (Element)) = List_ID
is
use all type SAL.Base_Peek_Type;
-- Tree is one of:
--
-- case a: first element, no next
-- rhs
-- | rhs_item_list
-- | | rhs_item: Element
-- | action
--
-- case b: first element, next
-- rhs_item_list
-- | rhs_item_list
-- | | rhs_item: Element
-- | rhs_item: next element
--
-- case c: non-first element, no next
-- rhs
-- | rhs_item_list
-- | | rhs_item_list
-- | | | rhs_item:
-- | | rhs_item: Element
-- | action
--
-- case d: non-first element, next
-- rhs_item_list
-- | rhs_item_list
-- | | rhs_item_list
-- | | | rhs_item:
-- | | rhs_item: Element
-- | rhs_item: next element
Element_ID : constant WisiToken.Token_ID := Tree.ID (Element);
Grand_Parent : constant Valid_Node_Index := Tree.Parent (Element, 2);
Aunts : constant Valid_Node_Index_Array := Tree.Children (Grand_Parent);
Last_List_Child : SAL.Base_Peek_Type := Aunts'First - 1;
begin
if Tree.ID (Grand_Parent) /= List_ID then
-- No next
return Invalid_Node_Index;
end if;
-- Children may be non-list items; ACTION in an rhs_list, for example.
for I in Aunts'Range loop
if Tree.ID (Aunts (I)) in List_ID | Element_ID then
Last_List_Child := I;
end if;
end loop;
if Last_List_Child = 1 then
-- No next
return Invalid_Node_Index;
else
return Aunts (2);
end if;
end Next_List_Element;
function Prev_List_Element
(Element : in Valid_Node_Index;
List_ID : in WisiToken.Token_ID)
return Node_Index
with Pre => Tree.Parent (Element) /= Invalid_Node_Index and then
Tree.ID (Tree.Parent (Element)) = List_ID
is
-- Tree is one of:
--
-- case a: first element, no prev
-- ?
-- | rhs_item_list
-- | | rhs_item: Element
--
-- case b: second element
-- ?
-- | rhs_item_list
-- | | rhs_item: prev item
-- | rhs_item: Element
--
-- case c: nth element
-- ?
-- | rhs_item_list
-- | | rhs_item_list
-- | | | rhs_item:
-- | | rhs_item: prev element
-- | rhs_item: Element
Parent : constant Valid_Node_Index := Tree.Parent (Element);
begin
if Element = Tree.Child (Parent, 1) then
-- No prev
return Invalid_Node_Index;
else
declare
Prev_Children : constant Valid_Node_Index_Array := Tree.Children (Tree.Child (Parent, 1));
begin
return Prev_Children (Prev_Children'Last);
end;
end if;
end Prev_List_Element;
procedure Append_Element
(Tail_List : in Valid_Node_Index;
New_Element : in Valid_Node_Index;
Separator_ID : in WisiToken.Token_ID := Invalid_Token_ID)
is
-- Tail_List is preserved.
-- Current tree is one of:
--
-- case a:
-- rhs_list: Tail_List
-- | rhs: Orig_Element_1
--
-- case b:
-- rhs_list: Tail_List
-- | rhs_list: Orig_List_1
-- | | rhs: Orig_Element_1
-- | BAR
-- | rhs: Orig_Element_2
-- New tree:
--
-- case a:
-- rhs_list: keep Tail_List
-- | rhs_list: new
-- | | rhs: keep; Orig_Element_1
-- | BAR
-- | rhs: New_Element
--
-- case b:
-- rhs_list: keep Tail_List
-- | rhs_list: new;
-- | | rhs_list: keep Orig_List_1
-- | | | rhs: keep Orig_Element_1
-- | | BAR: keep
-- | | rhs: keep Orig_Element_2
-- | BAR: new
-- | rhs: New_Element
List_ID : constant WisiToken.Token_ID := Tree.ID (Tail_List);
Children : constant Valid_Node_Index_Array := Tree.Children (Tail_List);
New_List_Item : constant Valid_Node_Index := Tree.Add_Nonterm
((List_ID, (if Children'Length = 1 then 0 else 1)), Children);
begin
if Separator_ID = Invalid_Token_ID then
Tree.Set_Children (Tail_List, (List_ID, 1), (New_List_Item, New_Element));
else
Tree.Set_Children
(Tail_List, (List_ID, 1), (New_List_Item, Tree.Add_Terminal (Separator_ID), New_Element));
end if;
end Append_Element;
procedure Insert_Optional_RHS (B : in Valid_Node_Index)
is
-- B is an optional item in an rhs_item_list :
-- | a b? c
--
-- Insert a second rhs_item_list without B
--
-- The containing elment may be rhs or rhs_alternative_list
Container : constant Valid_Node_Index := Tree.Find_Ancestor
(B, (+rhs_ID, +rhs_alternative_list_ID));
Orig_RHS_Element_C_Head : constant Node_Index := Next_List_Element
(Tree.Parent (B, 2), +rhs_item_list_ID);
Orig_RHS_Item_List_C_Root : constant Valid_Node_Index := List_Root (Tree.Parent (B, 3));
Orig_RHS_Item_List_A_Root : constant Valid_Node_Index := Tree.Child (Tree.Parent (B, 3), 1);
Orig_RHS_Element_A_Head : constant Node_Index :=
(if Orig_RHS_Item_List_A_Root = Tree.Parent (B, 2)
then Invalid_Node_Index -- a is empty
else First_List_Element (Orig_RHS_Item_List_A_Root, +rhs_element_ID));
Container_List : constant Valid_Node_Index :=
(if Tree.ID (Container) = +rhs_ID then Tree.Parent (Container) else Container);
New_RHS_Item_List_A : Node_Index := Invalid_Node_Index;
New_RHS_Item_List_C : Node_Index := Invalid_Node_Index;
New_RHS_AC : Valid_Node_Index;
function Add_Actions (RHS_Item_List : Valid_Node_Index) return Valid_Node_Index
with Pre => Tree.ID (Container) = +rhs_ID
is
Orig_RHS_Children : constant Valid_Node_Index_Array := Tree.Children (Container);
begin
case Tree.RHS_Index (Container) is
when 1 =>
return Tree.Add_Nonterm ((+rhs_ID, 1), (1 => RHS_Item_List));
when 2 =>
return Tree.Add_Nonterm
((+rhs_ID, 2),
(1 => RHS_Item_List,
2 => Tree.Add_Terminal
(Tree.Min_Terminal_Index (Orig_RHS_Children (2)),
Data.Terminals.all)));
when 3 =>
return Tree.Add_Nonterm
((+rhs_ID, 3),
(1 => RHS_Item_List,
2 => Tree.Add_Terminal
(Tree.Min_Terminal_Index (Orig_RHS_Children (2)),
Data.Terminals.all),
3 => Tree.Add_Terminal
(Tree.Min_Terminal_Index (Orig_RHS_Children (3)),
Data.Terminals.all)));
when others =>
Raise_Programmer_Error
("translate_ebnf_to_bnf insert_optional_rhs unimplemented RHS", Tree, Container);
end case;
end Add_Actions;
begin
if Orig_RHS_Element_A_Head /= Invalid_Node_Index then
-- a is not empty
New_RHS_Item_List_A := Tree.Copy_Subtree
(Last => Orig_RHS_Element_A_Head,
Root => Orig_RHS_Item_List_A_Root);
if Trace_Generate > Extra then
Ada.Text_IO.New_Line;
Ada.Text_IO.Put_Line ("new a:");
Tree.Print_Tree (Wisitoken_Grammar_Actions.Descriptor, New_RHS_Item_List_A);
end if;
end if;
if Orig_RHS_Element_C_Head /= Invalid_Node_Index then
-- c is not empty
New_RHS_Item_List_C := Tree.Copy_Subtree
(Last => Orig_RHS_Element_C_Head,
Root => Orig_RHS_Item_List_C_Root);
if Trace_Generate > Extra then
Ada.Text_IO.New_Line;
Ada.Text_IO.Put_Line ("new c:");
Tree.Print_Tree (Wisitoken_Grammar_Actions.Descriptor, New_RHS_Item_List_C);
end if;
end if;
if New_RHS_Item_List_C = Invalid_Node_Index then
if New_RHS_Item_List_A = Invalid_Node_Index then
-- a c is empty; there cannot be any actions.
New_RHS_AC :=
(if Tree.ID (Container) = +rhs_ID
then Tree.Add_Nonterm ((+rhs_ID, 0), (1 .. 0 => Invalid_Node_Index))
else Tree.Add_Nonterm ((+rhs_item_list_ID, 0), (1 .. 0 => Invalid_Node_Index)));
else
-- c is empty
New_RHS_AC :=
(if Tree.ID (Container) = +rhs_ID
then Add_Actions (New_RHS_Item_List_A)
else New_RHS_Item_List_A);
end if;
else
-- c is not empty
if New_RHS_Item_List_A = Invalid_Node_Index then
-- a is empty
New_RHS_AC :=
(if Tree.ID (Container) = +rhs_ID
then Add_Actions (New_RHS_Item_List_C)
else New_RHS_Item_List_C);
else
declare
Tail_Element_A : constant Valid_Node_Index := Last_List_Element (New_RHS_Item_List_A);
Head_Element_B : constant Valid_Node_Index := First_List_Element
(New_RHS_Item_List_C, +rhs_element_ID);
begin
Tree.Set_Children
(Tree.Parent (Head_Element_B),
(+rhs_item_list_ID, 1),
(Tree.Parent (Tail_Element_A), Head_Element_B));
end;
New_RHS_AC :=
(if Tree.ID (Container) = +rhs_ID
then Add_Actions (New_RHS_Item_List_C)
else New_RHS_Item_List_C);
end if;
end if;
if Trace_Generate > Extra then
Ada.Text_IO.New_Line;
Ada.Text_IO.Put_Line ("new ac:");
Tree.Print_Tree (Wisitoken_Grammar_Actions.Descriptor, New_RHS_AC);
end if;
-- Record copied EBNF nodes
declare
procedure Record_Copied_Node
(Tree : in out WisiToken.Syntax_Trees.Tree;
Node : in WisiToken.Syntax_Trees.Valid_Node_Index)
is begin
if To_Token_Enum (Tree.ID (Node)) in
rhs_optional_item_ID |
rhs_multiple_item_ID |
rhs_group_item_ID |
rhs_attribute_ID |
STRING_LITERAL_2_ID
then
Copied_EBNF_Nodes.Append (Node);
end if;
end Record_Copied_Node;
begin
Tree.Process_Tree (Record_Copied_Node'Access, New_RHS_AC);
end;
Append_Element (Container_List, New_RHS_AC, +BAR_ID);
end Insert_Optional_RHS;
Compilation_Unit_List_Tail : constant Valid_Node_Index := Tree.Child (Tree.Root, 1);
procedure Add_Compilation_Unit (Unit : in Valid_Node_Index; Prepend : in Boolean := False)
is
Comp_Unit : constant Valid_Node_Index := Tree.Add_Nonterm
((+compilation_unit_ID, (if Tree.ID (Unit) = +declaration_ID then 0 else 1)),
(1 => Unit));
begin
if Prepend then
Append_Element
(Tree.Parent (First_List_Element (Compilation_Unit_List_Tail, +compilation_unit_ID)), Comp_Unit);
else
Append_Element (Compilation_Unit_List_Tail, Comp_Unit);
end if;
if Trace_Generate > Extra then
Ada.Text_IO.New_Line;
Ada.Text_IO.Put_Line ("new comp_unit:");
Tree.Print_Tree (Wisitoken_Grammar_Actions.Descriptor, Unit);
end if;
end Add_Compilation_Unit;
function To_RHS_List (RHS_Element : in Valid_Node_Index) return Valid_Node_Index
with Pre => Tree.ID (RHS_Element) = +rhs_element_ID
is
RHS_Item_List : constant Valid_Node_Index := Tree.Add_Nonterm ((+rhs_item_list_ID, 0), (1 => RHS_Element));
RHS : constant Valid_Node_Index := Tree.Add_Nonterm ((+rhs_ID, 1), (1 => RHS_Item_List));
begin
return Tree.Add_Nonterm ((+rhs_list_ID, 0), (1 => RHS));
end To_RHS_List;
function Convert_RHS_Alternative (Content : in Valid_Node_Index) return Valid_Node_Index
is
-- Convert rhs_alternative_list rooted at Content to an rhs_list
Node : Valid_Node_Index := Content;
begin
loop
exit when Tree.RHS_Index (Node) = 0;
-- current tree:
-- rhs_alternative_list : Node
-- | rhs_alternative_list: Node.Child (1)
-- | | ...
-- | BAR: Node.child (2)
-- | rhs_item_list: Node.Child (3)
-- new tree:
-- rhs_list: Node
-- | rhs_alternative_list: keep Node.Child (1)
-- | | ...
-- | BAR: keep
-- | rhs: new
-- | | rhs_item_list: keep Node,Child (3)
Tree.Set_Children
(Node,
(+rhs_list_ID, 1),
(1 => Tree.Child (Node, 1),
2 => Tree.Child (Node, 2),
3 => Tree.Add_Nonterm
((+rhs_ID, 1),
(1 => Tree.Child (Node, 3)))));
Clear_EBNF_Node (Node);
Node := Tree.Child (Node, 1);
end loop;
-- current tree:
-- rhs_alternative_list : Node
-- | rhs_item_list: Node.Child (1)
-- new tree:
-- rhs_list: Node
-- | rhs: new
-- | | rhs_item_list: Node.Child (1)
Tree.Set_Children
(Node,
(+rhs_list_ID, 0),
(1 => Tree.Add_Nonterm ((+rhs_ID, 1), (1 => Tree.Child (Node, 1)))));
Clear_EBNF_Node (Content);
return Content;
end Convert_RHS_Alternative;
procedure New_Nonterminal
(New_Identifier : in Identifier_Index;
Content : in Valid_Node_Index)
with Pre => To_Token_Enum (Tree.ID (Content)) in rhs_alternative_list_ID | rhs_element_ID
is
-- Convert subtree rooted at Content to an rhs_list contained by a new nonterminal
-- named New_Identifier.
New_Nonterm : constant Valid_Node_Index := Tree_Add_Nonterminal
(Child_1 => Tree.Add_Identifier (+IDENTIFIER_ID, New_Identifier, Tree.Byte_Region (Content)),
Child_2 => Tree.Add_Terminal (+COLON_ID),
Child_3 =>
(case To_Token_Enum (Tree.ID (Content)) is
when rhs_element_ID => To_RHS_List (Content),
when rhs_alternative_list_ID => Convert_RHS_Alternative (Content),
when others => raise SAL.Programmer_Error with "new_nonterminal unimplemented content" &
Tree.Image (Content, Wisitoken_Grammar_Actions.Descriptor)),
Child_4 => Tree.Add_Nonterm
((+semicolon_opt_ID, 0),
(1 => Tree.Add_Terminal (+SEMICOLON_ID))));
begin
Add_Compilation_Unit (New_Nonterm);
end New_Nonterminal;
procedure New_Nonterminal_List_1
(List_Nonterm : in Identifier_Index;
RHS_Element_1 : in Valid_Node_Index;
RHS_Element_3 : in Valid_Node_Index;
Byte_Region : in Buffer_Region)
is
-- nonterminal: foo_list
-- | IDENTIFIER: "foo_list" List_Nonterm
-- | COLON:
-- | rhs_list:
-- | | rhs_list: RHS_List_2
-- | | | rhs: RHS_2
-- | | | | rhs_item_list: RHS_Item_List_1
-- | | | | | rhs_element: RHS_Element_1
-- | | | | | | rhs_item: RHS_Item_1
-- | | | | | | | IDENTIFIER: List_Element
-- | | BAR:
-- | | rhs: RHS_3
-- | | | rhs_item_list: RHS_Item_List_2
-- | | | | | rhs_item_list: RHS_Item_List_3
-- | | | | | | rhs_element: RHS_Element_2
-- | | | | | | | rhs_item: RHS_Item_2
-- | | | | | | | | IDENTIFIER: List_Nonterm
-- | | | | rhs_element: RHS_Element_3
-- | | | | | rhs_item: RHS_Item_3
-- | | | | | | IDENTIFIER: List_Element
-- | semicolon_opt:
-- | | SEMICOLON:
RHS_Item_2 : constant Valid_Node_Index := Tree.Add_Nonterm
((+rhs_item_ID, 0), (1 => Tree.Add_Identifier (+IDENTIFIER_ID, List_Nonterm, Byte_Region)));
RHS_Element_2 : constant Valid_Node_Index := Tree.Add_Nonterm ((+rhs_element_ID, 0), (1 => RHS_Item_2));
RHS_Item_List_1 : constant Valid_Node_Index := Tree.Add_Nonterm ((+rhs_item_list_ID, 0), (1 => RHS_Element_1));
RHS_Item_List_3 : constant Valid_Node_Index := Tree.Add_Nonterm ((+rhs_item_list_ID, 0), (1 => RHS_Element_2));
RHS_Item_List_2 : constant Valid_Node_Index := Tree.Add_Nonterm
((+rhs_item_list_ID, 1), (1 => RHS_Item_List_3, 2 => RHS_Element_3));
RHS_2 : constant Valid_Node_Index := Tree.Add_Nonterm ((+rhs_ID, 1), (1 => RHS_Item_List_1));
RHS_3 : constant Valid_Node_Index := Tree.Add_Nonterm ((+rhs_ID, 1), (1 => RHS_Item_List_2));
Bar_1 : constant Valid_Node_Index := Tree.Add_Terminal (+BAR_ID);
RHS_List_2 : constant Valid_Node_Index := Tree.Add_Nonterm ((+rhs_list_ID, 0), (1 => RHS_2));
List_Nonterminal : constant Valid_Node_Index := Tree_Add_Nonterminal
(Child_1 => Tree.Add_Identifier (+IDENTIFIER_ID, List_Nonterm, Byte_Region),
Child_2 => Tree.Add_Terminal (+COLON_ID),
Child_3 => Tree.Add_Nonterm
((+rhs_list_ID, 1),
(1 => RHS_List_2,
2 => Bar_1,
3 => RHS_3)),
Child_4 => Tree.Add_Nonterm
((+semicolon_opt_ID, 0),
(1 => Tree.Add_Terminal (+SEMICOLON_ID))));
begin
Add_Compilation_Unit (List_Nonterminal);
end New_Nonterminal_List_1;
procedure New_Nonterminal_List
(List_Nonterm : in Identifier_Index;
List_Element : in Identifier_Index;
Byte_Region : in Buffer_Region)
is
RHS_Item_1 : constant Valid_Node_Index := Tree.Add_Nonterm
((+rhs_item_ID, 0), (1 => Tree.Add_Identifier (+IDENTIFIER_ID, List_Element, Byte_Region)));
RHS_Item_3 : constant Valid_Node_Index := Tree.Add_Nonterm
((+rhs_item_ID, 0), (1 => Tree.Add_Identifier (+IDENTIFIER_ID, List_Element, Byte_Region)));
RHS_Element_1 : constant Valid_Node_Index := Tree.Add_Nonterm ((+rhs_element_ID, 0), (1 => RHS_Item_1));
RHS_Element_3 : constant Valid_Node_Index := Tree.Add_Nonterm ((+rhs_element_ID, 0), (1 => RHS_Item_3));
begin
New_Nonterminal_List_1 (List_Nonterm, RHS_Element_1, RHS_Element_3, Byte_Region);
end New_Nonterminal_List;
procedure New_Nonterminal_List
(List_Nonterm : in Identifier_Index;
List_Element : in Token_Index;
Terminals : in Base_Token_Arrays.Vector;
Byte_Region : in Buffer_Region)
is
RHS_Item_1 : constant Valid_Node_Index := Tree.Add_Nonterm
((+rhs_item_ID, 0), (1 => Tree.Add_Terminal (List_Element, Terminals)));
RHS_Item_3 : constant Valid_Node_Index := Tree.Add_Nonterm
((+rhs_item_ID, 0), (1 => Tree.Add_Terminal (List_Element, Terminals)));
RHS_Element_1 : constant Valid_Node_Index := Tree.Add_Nonterm ((+rhs_element_ID, 0), (1 => RHS_Item_1));
RHS_Element_3 : constant Valid_Node_Index := Tree.Add_Nonterm ((+rhs_element_ID, 0), (1 => RHS_Item_3));
begin
New_Nonterminal_List_1 (List_Nonterm, RHS_Element_1, RHS_Element_3, Byte_Region);
end New_Nonterminal_List;
procedure Process_Node (Node : in Valid_Node_Index)
is begin
if Trace_Generate > Detail then
Ada.Text_IO.New_Line;
Ada.Text_IO.Put_Line ("translate node" & Node_Index'Image (Node));
end if;
case To_Token_Enum (Tree.ID (Node)) is
-- Token_Enum_ID alphabetical order
when declaration_ID =>
-- Must be "%meta_syntax EBNF"; change to BNF
declare
Decl_Item : constant Valid_Node_Index := Tree.Find_Descendant
(Tree.Child (Node, 3), +declaration_item_ID);
Children : Valid_Node_Index_Array := Tree.Children (Decl_Item);
begin
Children (1) := Tree.Add_Identifier
(+IDENTIFIER_ID, New_Identifier ("BNF"), Tree.Byte_Region (Decl_Item));
Tree.Set_Children (Decl_Item, (+declaration_item_ID, 1), Children);
end;
when rhs_alternative_list_ID =>
-- All handled by New_Nonterminal*
raise SAL.Not_Implemented with Tree.Image (Node, Wisitoken_Grammar_Actions.Descriptor);
when rhs_attribute_ID =>
-- Just delete it
--
-- Current tree (so far, attributes are always the first item in an rhs):
--
-- rhs:
-- | ...
-- | rhs_item_list: RHS_Item_List.Parent 2
-- | | rhs_item_list: RHS_Item_List.Parent 1
-- | | | rhs_item_list: RHS_Item_List
-- | | | | rhs_element: Parent (Node, 2)
-- | | | | | rhs_item: Parent (Node, 1)
-- | | | | | | rhs_attribute: Node
-- | | | rhs_element: next_element 1
-- | | rhs_element: next_element 2
--
-- New tree:
--
-- rhs:
-- | ...
-- | rhs_item_list: keep RHS_Item_List.Parent
-- | | rhs_element: keep next_element 1
-- | rhs_element: kepp next_element 2
declare
RHS_Item_List : constant Valid_Node_Index := Tree.Parent (Node, 3);
Parent : constant Valid_Node_Index := Tree.Parent (RHS_Item_List);
begin
if Tree.RHS_Index (RHS_Item_List) /= 0 then
-- Not first
Raise_Programmer_Error ("translate_ebnf_to_bnf rhs_attribute_id unimplemented", Tree, Node);
end if;
Tree.Set_Children
(Parent,
(+rhs_item_list_ID, 0),
(1 => Tree.Child (Parent, 2)));
end;
when rhs_group_item_ID =>
-- Current tree:
--
-- rhs_element: Parent (Node, 2)
-- | rhs_item: Parent (Node, 1)
-- | | rhs_group_item: Node
-- | | | LEFT_PAREN
-- | | | rhs_alternative_list: Child (Node, 2)
-- | | | RIGHT_PAREN
-- See if there's an existing nonterminal for this content.
declare
Element_Content : constant String := Get_Text (Data, Tree, Tree.Child (Node, 2));
Temp : Node_Index := First_List_Element
(Tree.Child (Tree.Root, 1), +compilation_unit_ID);
Name_Node : Node_Index;
New_Ident : Base_Identifier_Index := Invalid_Identifier_Index;
begin
loop
pragma Assert (Tree.ID (Temp) = +compilation_unit_ID);
if Tree.Production_ID (Tree.Child (Temp, 1)) = (+nonterminal_ID, 0) then
-- Target nonterm is:
--
-- (compilation_unit_1, (111 . 128))
-- | (nonterminal_0, (111 . 128))
-- | | 7;(IDENTIFIER, (111 . 128))
-- | | (COLON)
-- | | (rhs_list_1, (111 . 128))
-- | | | ...
declare
RHS_List_1 : constant Node_Index := Tree.Child (Tree.Child (Temp, 1), 3);
begin
if RHS_List_1 /= Invalid_Node_Index and then
Element_Content = Get_Text (Data, Tree, RHS_List_1)
then
Name_Node := Tree.Child (Tree.Child (Temp, 1), 1);
case Tree.Label (Name_Node) is
when Shared_Terminal =>
New_Ident := New_Identifier (Get_Text (Data, Tree, Name_Node));
when Virtual_Identifier =>
New_Ident := Tree.Identifier (Name_Node);
when others =>
Raise_Programmer_Error ("process_node rhs_group_item", Tree, Name_Node);
end case;
exit;
end if;
end;
end if;
Temp := Next_List_Element (Temp, +compilation_unit_list_ID);
exit when Temp = Invalid_Node_Index;
end loop;
if New_Ident = Invalid_Identifier_Index then
New_Ident := Next_Nonterm_Name;
New_Nonterminal (New_Ident, Tree.Child (Node, 2));
end if;
Tree.Set_Node_Identifier (Node, +IDENTIFIER_ID, New_Ident);
Tree.Set_Children (Tree.Parent (Node), (+rhs_item_ID, 0), (1 => Node));
Clear_EBNF_Node (Node);
end;
when rhs_multiple_item_ID =>
-- We have one of:
--
-- | a { b } c
-- | a { b } - c
-- | a ( b ) + c
-- | a ( b ) * c
-- | a b+ c
-- | a b* c
--
-- Replace it with a new canonical list nonterminal:
--
-- nonterminal_nnn
-- : b
-- | nonterminal_nnn_list b
--
-- and a second RHS if it can be empty:
-- | a c
-- Current tree:
--
-- rhs_item: Parent (Node, 1)
-- | rhs_multiple_item: Node
-- | | LEFT_BRACE | LEFT_PAREN
-- | | rhs_alternative_list
-- | | | ...
-- | | RIGHT_BRACE | RIGHT_PAREN
-- | | [MINUS | PLUS | STAR]
-- or:
--
-- rhs_item: Parent (Node, 1)
-- | rhs_multiple_item: Node
-- | | IDENTIFIER
-- | | PLUS | STAR
declare
Done : Boolean := False;
RHS_Index : constant Integer := Tree.RHS_Index (Node);
Plus_Minus_Star : constant Node_Index := Tree.Child
(Node, (if RHS_Index in 0 .. 3 then 4 else 2));
Allow_Empty : constant Boolean := Plus_Minus_Star = Invalid_Node_Index or else
Tree.ID (Plus_Minus_Star) in +STAR_ID;
Parent_RHS_Item : constant Valid_Node_Index := Tree.Parent (Node);
List_Nonterm_Virtual_Name : Base_Identifier_Index := Invalid_Identifier_Index;
List_Nonterm_Terminal_Name : Base_Token_Index := Invalid_Token_Index;
List_Element : Base_Identifier_Index := Invalid_Identifier_Index;
procedure Check_Canonical_List
is
-- In EBNF, a canonical list with a separator looks like:
--
-- enumConstants : enumConstant (',' enumConstant)* ;
--
-- or, with no separator:
--
-- SwitchLabels : SwitchLabel {SwitchLabel} ;
--
-- The tokens may have labels.
--
-- Handling these cases specially this eliminates a conflict between
-- reducing to enumConstants and reducing to the introduced nonterm
-- list.
--
-- Alternately, the no separator case can be:
--
-- enumConstants : enumConstant+ ;
--
-- Handling this no separator case specially would not eliminate any conflicts.
use all type SAL.Base_Peek_Type;
Alt_List_Items : constant Valid_Node_Index_Array := Tree.Get_IDs (Node, +rhs_item_ID);
RHS_Element : constant Valid_Node_Index := Tree.Parent (Node, 2);
Element_1 : constant Node_Index := Prev_List_Element
(RHS_Element, +rhs_item_list_ID);
RHS_2 : constant Valid_Node_Index := Tree.Find_Ancestor
(Node, (+rhs_ID, +rhs_alternative_list_ID));
begin
if Tree.ID (RHS_2) = +rhs_alternative_list_ID then return; end if;
if not (Alt_List_Items'Last in 1 .. 2) then return; end if;
if Element_1 = Invalid_Node_Index or else
Get_Text (Data, Tree, Tree.Get_IDs (Element_1, +rhs_item_ID)(1)) /=
Get_Text (Data, Tree, Alt_List_Items (Alt_List_Items'Last))
then
return;
end if;
if Invalid_Node_Index /= Next_List_Element (RHS_Element, +rhs_item_list_ID) then return; end if;
if Invalid_Node_Index /= Next_List_Element (RHS_2, +rhs_list_ID) or
Invalid_Node_Index /= Prev_List_Element (RHS_2, +rhs_list_ID)
then
return;
end if;
-- We have a canonical list declaration. Rewrite it to:
--
-- with separator:
-- rhs_list: keep
-- | rhs_list:
-- | | rhs: new, RHS_1
-- | | | rhs_item_list: new, RHS_Item_List_1
-- | | | | rhs_element: keep, Element_1
-- | | | | | rhs_item: keep
-- | | | | | | IDENTIFIER: keep; element name
-- | BAR: new
-- | rhs: keep, RHS_2
-- | | rhs_item_list: new, RHS_Item_List_2
-- | | | rhs_item_list: keep, rhs_item_list_3
-- | | | | rhs_item_list: keep, rhs_item_list_4
-- | | | | | rhs_element: new
-- | | | | | | rhs_item: new
-- | | | | | | | IDENTIFIER: new, list name
-- | | | | rhs_element: keep
-- | | | | | rhs_item: keep
-- | | | | | | IDENTIFIER: keep, separator
-- | | | rhs_element: keep, alt_list_elements (last)
-- | | | | rhs_item: keep
-- | | | | | IDENTIFIER: keep, element name
--
-- no separator:
-- rhs_list: keep
-- | rhs_list:
-- | | rhs: new, RHS_1
-- | | | rhs_item_list: new, RHS_Item_List_1
-- | | | | rhs_element: keep, Element_1
-- | | | | | rhs_item: keep
-- | | | | | | IDENTIFIER: keep; element name
-- | BAR: new
-- | rhs: keep, RHS_2
-- | | rhs_item_list: keep, rhs_item_list_3
-- | | | rhs_item_list: new, rhs_item_list_4
-- | | | | rhs_element: new
-- | | | | | rhs_item: new
-- | | | | | | IDENTIFIER: new, list name
-- | | | rhs_element: keep, alt_list_elements (last)
-- | | | | rhs_item: keep
-- | | | | | IDENTIFIER: keep, element name
declare
List_Name_Node : constant Valid_Node_Index := Tree.Find_Ancestor (RHS_2, +nonterminal_ID);
List_Name_Tok : constant Token_Index := Tree.Min_Terminal_Index (List_Name_Node);
List_Name_Region : constant Buffer_Region := Data.Terminals.all (List_Name_Tok).Byte_Region;
List_Name : constant String := Data.Grammar_Lexer.Buffer_Text (List_Name_Region);
RHS_2_Index : constant Integer := Tree.RHS_Index (RHS_2);
RHS_2_Children : Valid_Node_Index_Array := Tree.Children (RHS_2);
RHS_Item_List_1 : constant Valid_Node_Index := Tree.Add_Nonterm
((+rhs_item_list_ID, 0), (1 => Element_1));
RHS_1_Action : constant Node_Index :=
(case RHS_2_Index is
when 2 | 3 => Tree.Add_Terminal
(Tree.Min_Terminal_Index (RHS_2_Children (2)), Data.Terminals.all),
when others => Invalid_Node_Index);
RHS_1_Check : constant Node_Index :=
(case RHS_2_Index is
when 3 => Tree.Add_Terminal
(Tree.Min_Terminal_Index (RHS_2_Children (3)), Data.Terminals.all),
when others => Invalid_Node_Index);
RHS_1 : constant Valid_Node_Index :=
(case RHS_2_Index is
when 1 => Tree.Add_Nonterm ((+rhs_ID, 1), (1 => RHS_Item_List_1)),
when 2 => Tree.Add_Nonterm ((+rhs_ID, 2), (1 => RHS_Item_List_1, 2 => RHS_1_Action)),
when 3 => Tree.Add_Nonterm
((+rhs_ID, 3), (1 => RHS_Item_List_1, 2 => RHS_1_Action, 3 => RHS_1_Check)),
when others => raise SAL.Programmer_Error);
Bar : constant Valid_Node_Index := Tree.Add_Terminal (+BAR_ID);
RHS_Item_List_3 : constant Valid_Node_Index := Tree.Child (RHS_2, 1);
RHS_Item_List_4 : constant Valid_Node_Index := Tree.Child (RHS_Item_List_3, 1);
New_List_Name_Term : constant Valid_Node_Index := Tree.Add_Terminal
(List_Name_Tok, Data.Terminals.all);
New_List_Name_Item : constant Valid_Node_Index := Tree.Add_Nonterm
((+rhs_item_ID, 0),
(1 => New_List_Name_Term));
New_List_Name_Label : constant Node_Index :=
(if Tree.RHS_Index (Element_1) = 1
then -- tokens have labels
Tree.Add_Identifier (+IDENTIFIER_ID, New_Identifier (List_Name), List_Name_Region)
else Invalid_Node_Index);
New_List_Name_Element : constant Valid_Node_Index :=
(if Tree.RHS_Index (Element_1) = 1
then -- tokens have labels
Tree.Add_Nonterm
((+rhs_element_ID, 1),
(1 => New_List_Name_Label,
2 => Tree.Add_Terminal (+EQUAL_ID),
3 => New_List_Name_Item))
else
Tree.Add_Nonterm ((+rhs_element_ID, 0), (1 => New_List_Name_Item)));
Alt_List_Elements : constant Valid_Node_Index_Array := Tree.Get_IDs (Node, +rhs_element_ID);
RHS_Item_List_2 : constant Node_Index :=
(if Alt_List_Elements'Last = 1
then Invalid_Node_Index -- no separator
else Tree.Add_Nonterm
((+rhs_item_list_ID, 1),
(1 => RHS_Item_List_3,
2 => Alt_List_Elements (Alt_List_Elements'Last))));
begin
Tree.Set_Children (RHS_Item_List_4, (+rhs_item_list_ID, 0), (1 => New_List_Name_Element));
Tree.Set_Children
(RHS_Item_List_3,
(+rhs_item_list_ID, 1),
(1 => RHS_Item_List_4,
2 => Alt_List_Elements (1)));
RHS_2_Children (1) :=
(if Alt_List_Elements'Last = 1
then RHS_Item_List_3 -- no separator
else RHS_Item_List_2);
Tree.Set_Children (RHS_2, (+rhs_ID, Tree.RHS_Index (RHS_2)), RHS_2_Children);
Tree.Set_Children
(Tree.Parent (RHS_2),
(+rhs_list_ID, 1),
(1 => Tree.Add_Nonterm ((+rhs_list_ID, 0), (1 => RHS_1)),
2 => Bar,
3 => RHS_2));
end;
Done := True;
Clear_EBNF_Node (Node);
if Trace_Generate > Extra then
Ada.Text_IO.New_Line;
Ada.Text_IO.Put_Line ("edited rhs_list:");
Tree.Print_Tree (Wisitoken_Grammar_Actions.Descriptor, Tree.Parent (RHS_2));
end if;
end Check_Canonical_List;
procedure Find_List_Nonterminal_2 (Element_Content : in String)
is
-- Look for a virtual pair of nonterms implementing a list of Element_Content.
-- If found, set List_Nonterm_Virtual_Name, List_Element
Temp : Node_Index := First_List_Element (Tree.Child (Tree.Root, 1), +compilation_unit_ID);
Name_Node : Node_Index;
begin
loop
pragma Assert (Tree.ID (Temp) = +compilation_unit_ID);
if Tree.Production_ID (Tree.Child (Temp, 1)) = (+nonterminal_ID, 0) and
Tree.Is_Virtual (Tree.Child (Temp, 1))
then
if Element_Content = Get_Text (Data, Tree, Tree.Child (Tree.Child (Temp, 1), 3)) then
Name_Node := Tree.Child (Tree.Child (Temp, 1), 1);
case Tree.Label (Name_Node) is
when Virtual_Identifier =>
List_Element := Tree.Identifier (Name_Node);
when others =>
Raise_Programmer_Error
("unimplemented Find_List_Nonterminal_2 case '" & Element_Content & "'",
Tree, Name_Node);
end case;
-- list nonterm is the next nonterminal
Temp := Next_List_Element (Temp, +compilation_unit_list_ID);
Name_Node := Tree.Child (Tree.Child (Temp, 1), 1);
case Tree.Label (Name_Node) is
when Virtual_Identifier =>
List_Nonterm_Virtual_Name := Tree.Identifier (Name_Node);
when others =>
raise SAL.Programmer_Error;
end case;
exit;
end if;
end if;
Temp := Next_List_Element (Temp, +compilation_unit_list_ID);
exit when Temp = Invalid_Node_Index;
end loop;
end Find_List_Nonterminal_2;
procedure Find_List_Nonterminal_1 (Element_Content : in String)
is
-- Search for a nonterm (virtual or not) implementing a list for
-- Element_Content, which is a single rhs_element; no List_Element
-- Nonterminal. If found, set List_Nonterm_Virtual_Name or
-- List_Nonterm_Terminal_Name
Temp : Node_Index := First_List_Element (Tree.Child (Tree.Root, 1), +compilation_unit_ID);
begin
loop
pragma Assert (Tree.ID (Temp) = +compilation_unit_ID);
if Tree.Production_ID (Tree.Child (Temp, 1)) = (+nonterminal_ID, 0) then
-- Target List_Nonterm is:
--
-- nonterminal_nnn_list
-- : element
-- | nonterminal_nnn_list element
--
-- compilation_unit
-- | nonterminal
-- | | IDENTIFIER : list_nonterm
-- | | COLON
-- | | rhs_list: rhs_list_1
-- | | | rhs_list: rhs_list_2
-- | | | | rhs
-- | | | | | ... List_element
-- | | | BAR
-- | | | rhs: ... list_nonterm list_element
declare
Name_Node : constant Node_Index := Tree.Child (Tree.Child (Temp, 1), 1);
RHS_List_1 : constant Node_Index := Tree.Child (Tree.Child (Temp, 1), 3);
RHS_List_2 : constant Node_Index :=
(if RHS_List_1 = Invalid_Node_Index
then Invalid_Node_Index
else Tree.Child (RHS_List_1, 1));
begin
if RHS_List_2 /= Invalid_Node_Index and
Tree.Child (RHS_List_1, 3) /= Invalid_Node_Index and -- second rhs present
Tree.Child (RHS_List_2, 3) = Invalid_Node_Index -- no third rhs
then
declare
RHS_1 : constant String := Get_Text (Data, Tree, RHS_List_2);
RHS_2 : constant String := Get_Text (Data, Tree, Tree.Child (RHS_List_1, 3));
Expected_RHS_2 : constant String := Get_Text (Data, Tree, Name_Node) & " " &
Element_Content;
begin
if Element_Content = RHS_1 and RHS_2 = Expected_RHS_2 then
case Tree.Label (Name_Node) is
when Shared_Terminal =>
List_Nonterm_Terminal_Name := Tree.Min_Terminal_Index (Name_Node);
when Virtual_Identifier =>
List_Nonterm_Virtual_Name := Tree.Identifier (Name_Node);
when others =>
Raise_Programmer_Error
("unimplemented Find_List_Nonterminal_1 case '" & Element_Content & "'",
Tree, Name_Node);
end case;
exit;
end if;
end;
end if;
end;
end if;
Temp := Next_List_Element (Temp, +compilation_unit_list_ID);
exit when Temp = Invalid_Node_Index;
end loop;
end Find_List_Nonterminal_1;
begin
-- Check if this is a recognized pattern
Check_Canonical_List;
if Done then return; end if;
-- Check to see if there is an already declared nonterminal
-- list with the same content; if not, create one.
case Tree.RHS_Index (Node) is
when 0 .. 3 =>
-- { rhs_alternative_list } -?
-- ( rhs_alternative_list ) [+*]
if 0 = Tree.RHS_Index (Tree.Child (Node, 2)) and then
0 = Tree.RHS_Index (Tree.Child (Tree.Child (Node, 2), 1))
then
-- Only one element in the rhs_alternative_list, and in the rhs_item_list
Find_List_Nonterminal_1 (Get_Text (Data, Tree, Tree.Child (Node, 2)));
if List_Nonterm_Virtual_Name = Invalid_Identifier_Index and
List_Nonterm_Terminal_Name = Invalid_Token_Index
then
List_Nonterm_Virtual_Name := Next_Nonterm_Name ("_list");
New_Nonterminal_List
(List_Nonterm_Virtual_Name, Tree.Min_Terminal_Index (Tree.Child (Node, 2)),
Data.Terminals.all, Tree.Byte_Region (Node));
end if;
else
Find_List_Nonterminal_2 (Get_Text (Data, Tree, Tree.Child (Node, 2)));
if List_Nonterm_Virtual_Name = Invalid_Identifier_Index then
List_Nonterm_Virtual_Name := Next_Nonterm_Name ("_list");
List_Element := Next_Nonterm_Name;
New_Nonterminal (List_Element, Tree.Child (Node, 2));
New_Nonterminal_List (List_Nonterm_Virtual_Name, List_Element, Tree.Byte_Region (Node));
end if;
end if;
when 4 | 5 =>
-- IDENTIFIER + | *
Find_List_Nonterminal_1 (Get_Text (Data, Tree, Tree.Child (Node, 1)));
if List_Nonterm_Virtual_Name = Invalid_Identifier_Index then
List_Nonterm_Virtual_Name := Next_Nonterm_Name ("_list");
New_Nonterminal_List
(List_Nonterm_Virtual_Name, Tree.Min_Terminal_Index (Tree.Child (Node, 1)), Data.Terminals.all,
Tree.Byte_Region (Node));
end if;
when others =>
Raise_Programmer_Error ("translate_ebnf_to_bnf rhs_multiple_item unimplmented", Tree, Node);
end case;
if Allow_Empty then
Insert_Optional_RHS (Node);
end if;
declare
Child : constant Valid_Node_Index :=
(if List_Nonterm_Virtual_Name /= Invalid_Identifier_Index
then Tree.Add_Identifier
(+IDENTIFIER_ID, List_Nonterm_Virtual_Name, Tree.Byte_Region (Parent_RHS_Item))
elsif List_Nonterm_Terminal_Name /= Invalid_Token_Index
then Tree.Add_Terminal (List_Nonterm_Terminal_Name, Data.Terminals.all)
else raise SAL.Programmer_Error);
begin
Tree.Set_Children (Parent_RHS_Item, (+rhs_item_ID, 0), (1 => Child));
end;
Clear_EBNF_Node (Node);
if Trace_Generate > Extra then
Ada.Text_IO.New_Line;
Ada.Text_IO.Put_Line ("edited rhs_item:");
Tree.Print_Tree (Wisitoken_Grammar_Actions.Descriptor, Parent_RHS_Item);
end if;
exception
when E : System.Assertions.Assert_Failure =>
Raise_Programmer_Error
("translate_ebnf_to_bnf multiple_item assert: " & Ada.Exceptions.Exception_Message (E), Tree, Node);
end;
when rhs_optional_item_ID =>
-- Source looks like:
--
-- | a [b] c
--
-- where 'a', 'b', 'c' are token sequences. Translate to:
--
-- | a nonterm_b c
-- | a c
--
-- where 'nonterm_b' is a new nonterminal containing b, unless b is
-- simple enough to inline.
--
-- See nested_ebnf_optional.wy for an example of nested optional
-- items.
--
-- current tree:
--
-- | rhs_list:
-- | | rhs | rhs_alternative_list:
-- | | | rhs_item_list
-- | | | | rhs_item_list
-- | | | ...
-- | | | | | | rhs_element:
-- | | | | | | | rhs_item: contains a tail
-- | | | | | rhs_element:
-- | | | | | | rhs_item: contains b
-- | | | | | | | rhs_optional_item: Node
-- | | | | | | | | LEFT_BRACKET: Node.Children (1)
-- | | | | | | | | rhs_alternative_item_list: Node.Children (2) b
-- | | | | | | | | RIGHT_BRACKET: Node.Children (3)
-- | | | | rhs_element: head of c
-- | | | | | rhs_item: head of c
declare
Name_Ident : Base_Identifier_Index := Invalid_Identifier_Index;
Name_Terminal : Base_Token_Index := Invalid_Token_Index;
Name_Label : Base_Token_Index := Invalid_Token_Index;
Found : Boolean := False;
begin
case Tree.RHS_Index (Node) is
when 0 | 1 =>
-- : LEFT_BRACKET rhs_alternative_list RIGHT_BRACKET
-- | LEFT_PAREN rhs_alternative_list RIGHT_PAREN QUESTION
-- Check for special cases
if List_Singleton (Tree.Child (Node, 2)) then
if List_Singleton (Tree.Child (Tree.Child (Node, 2), 1)) then
-- Single item in rhs_alternative_list and rhs_item_list; just use it.
--
-- Single alternative, multiple rhs_items handled below
declare
Name_Element_Node : Valid_Node_Index;
Name_Identifier_Node : Node_Index;
begin
Found := True;
Name_Element_Node := First_List_Element
(Tree.Child (Tree.Child (Node, 2), 1), +rhs_element_ID);
if Tree.RHS_Index (Name_Element_Node) = 0 then
Name_Identifier_Node := Tree.Child (Tree.Child (Name_Element_Node, 1), 1);
else
-- Name has a label
Name_Label := Tree.Min_Terminal_Index (Tree.Child (Name_Element_Node, 1));
Name_Identifier_Node := Tree.Child (Tree.Child (Name_Element_Node, 3), 1);
end if;
case Tree.Label (Name_Identifier_Node) is
when Virtual_Identifier =>
Name_Ident := Tree.Identifier (Name_Identifier_Node);
when Shared_Terminal =>
Name_Terminal := Tree.Min_Terminal_Index (Name_Identifier_Node);
when others =>
Raise_Programmer_Error ("unhandled rhs_optional case ", Tree, Name_Identifier_Node);
end case;
end;
end if;
else
-- See if we've already created a nonterminal for this.
declare
New_Text : constant String := Get_Text (Data, Tree, Tree.Child (Node, 2));
Temp : Node_Index := First_List_Element
(Tree.Child (Tree.Root, 1), +compilation_unit_ID);
Name_Identifier_Node : Node_Index;
begin
loop
pragma Assert (Tree.ID (Temp) = +compilation_unit_ID);
if Tree.Production_ID (Tree.Child (Temp, 1)) = (+nonterminal_ID, 0) then
if New_Text = Get_Text (Data, Tree, Tree.Child (Tree.Child (Temp, 1), 3)) then
Found := True;
Name_Identifier_Node := Tree.Child (Tree.Child (Temp, 1), 1);
case Tree.Label (Name_Identifier_Node) is
when Virtual_Identifier =>
Name_Ident := Tree.Identifier (Name_Identifier_Node);
when others =>
Raise_Programmer_Error
("unhandled rhs_optional case '" & New_Text & "'", Tree, Name_Identifier_Node);
end case;
exit;
end if;
end if;
Temp := Next_List_Element (Temp, +compilation_unit_list_ID);
exit when Found or Temp = Invalid_Node_Index;
end loop;
end;
end if;
if Found then
-- Use previously created nonterminal
if Name_Ident /= Invalid_Identifier_Index then
Tree.Set_Node_Identifier (Node, +IDENTIFIER_ID, Name_Ident);
-- Change RHS_Index, delete Check_EBNF action
Tree.Set_Children (Tree.Parent (Node), (+rhs_item_ID, 0), (1 => Node));
elsif Name_Terminal /= Invalid_Token_Index then
Tree.Set_Children
(Tree.Parent (Node),
(+rhs_item_ID, 0),
(1 => Tree.Add_Terminal (Name_Terminal, Data.Terminals.all)));
else
raise SAL.Programmer_Error;
end if;
if Name_Label /= Invalid_Token_Index then
declare
Label_Node : constant Valid_Node_Index := Tree.Add_Terminal
(Name_Label, Data.Terminals.all);
Equal_Node : constant Valid_Node_Index := Tree.Add_Terminal (+EQUAL_ID);
begin
Tree.Set_Children
(Tree.Parent (Tree.Parent (Node)),
(+rhs_element_ID, 1),
(1 => Label_Node,
2 => Equal_Node,
3 => Tree.Parent (Node)));
end;
end if;
else
-- Create a new nonterm, or handle more special cases
if List_Singleton (Tree.Child (Node, 2)) then
-- Single alternative, multiple rhs_items
--
-- No separate nonterminal, so token labels stay in the same RHS for
-- actions. Splice together rhs_item_lists a, b, c
declare
Root_List_A : constant Valid_Node_Index := Tree.Child (Tree.Parent (Node, 3), 1);
Tail_Element_A : constant Node_Index :=
(if Root_List_A = Tree.Parent (Node, 2)
then Invalid_Node_Index -- a is empty
else Last_List_Element (Root_List_A));
Root_List_B : constant Valid_Node_Index := Tree.Child (Tree.Child (Node, 2), 1);
Head_Element_B : constant Valid_Node_Index := First_List_Element
(Root_List_B, +rhs_element_ID);
Tail_Element_B : constant Valid_Node_Index := Last_List_Element (Root_List_B);
Root_List_C : constant Valid_Node_Index := List_Root (Tree.Parent (Node, 3));
Head_Element_C : constant Node_Index := Next_List_Element
(Tree.Parent (Node, 2), +rhs_item_list_ID);
RHS : constant Valid_Node_Index := Tree.Parent (Root_List_C);
RHS_Children : Valid_Node_Index_Array := Tree.Children (RHS);
begin
if Tail_Element_A = Invalid_Node_Index and Head_Element_C = Invalid_Node_Index then
-- A, C both empty
RHS_Children (1) := Tree.Child (Root_List_B, 1);
Tree.Set_Children (RHS, Tree.Production_ID (RHS), RHS_Children);
elsif Tail_Element_A = Invalid_Node_Index then
-- A empty, C not empty
declare
Parent_B2 : constant Valid_Node_Index := Tree.Parent (Tail_Element_B);
Parent_C : constant Valid_Node_Index := Tree.Parent (Head_Element_C);
begin
Tree.Set_Children (Parent_C, (+rhs_item_list_ID, 1), (Parent_B2, Head_Element_C));
-- Head_Element_C remains the list root.
end;
elsif Head_Element_C = Invalid_Node_Index then
-- A not empty, C empty.
declare
Parent_A : constant Valid_Node_Index := Tree.Parent (Tail_Element_A);
Parent_B : constant Valid_Node_Index := Tree.Parent (Head_Element_B);
begin
Tree.Set_Children (Parent_B, (+rhs_item_list_ID, 1), (Parent_A, Head_Element_B));
RHS_Children (1) := Root_List_B;
Tree.Set_Children (RHS, Tree.Production_ID (RHS), RHS_Children);
end;
else
-- A, C both not empty
declare
Parent_A : constant Valid_Node_Index := Tree.Parent (Tail_Element_A);
Parent_B1 : constant Valid_Node_Index := Tree.Parent (Head_Element_B);
Parent_B2 : constant Valid_Node_Index := Tree.Parent (Tail_Element_B);
Parent_C : constant Valid_Node_Index := Tree.Parent (Head_Element_C);
begin
Tree.Set_Children (Parent_B1, (+rhs_item_list_ID, 1), (Parent_A, Head_Element_B));
Tree.Set_Children (Parent_C, (+rhs_item_list_ID, 1), (Parent_B2, Head_Element_C));
-- Head_Element_C remains the list root.
end;
end if;
if Trace_Generate > Extra then
Ada.Text_IO.New_Line;
Ada.Text_IO.Put_Line ("edited rhs:");
Tree.Print_Tree (Wisitoken_Grammar_Actions.Descriptor, RHS);
end if;
end;
else
declare
Nonterm_B : constant Identifier_Index := Next_Nonterm_Name ("");
begin
New_Nonterminal (Nonterm_B, Tree.Child (Node, 2));
Tree.Set_Node_Identifier (Node, +IDENTIFIER_ID, Nonterm_B);
end;
Tree.Set_Children (Tree.Parent (Node), (+rhs_item_ID, 0), (1 => Node));
end if;
end if;
when 2 =>
-- | IDENTIFIER QUESTION
Tree.Set_Children (Tree.Parent (Node), (+rhs_item_ID, 0), (1 => Tree.Child (Node, 1)));
when 3 =>
-- | STRING_LITERAL_2 QUESTION
Tree.Set_Children (Tree.Parent (Node), (+rhs_item_ID, 1), (1 => Tree.Child (Node, 1)));
when others =>
Raise_Programmer_Error ("translate_ebnf_to_bnf rhs_optional_item unimplmented", Tree, Node);
end case;
Clear_EBNF_Node (Node);
Insert_Optional_RHS (Node);
end;
when STRING_LITERAL_2_ID =>
declare
Value : constant String := Get_Text (Data, Tree, Node, Strip_Quotes => True);
Name_Ident : Identifier_Index;
Found : Boolean := False;
begin
-- See if Value is already declared
declare
Temp : Node_Index := First_List_Element (Tree.Child (Tree.Root, 1), +compilation_unit_ID);
Decl : Node_Index;
begin
loop
pragma Assert (Tree.ID (Temp) = +compilation_unit_ID);
if Tree.Production_ID (Tree.Child (Temp, 1)) = (+declaration_ID, 0) then
Decl := Tree.Child (Temp, 1);
declare
Value_Node : constant Valid_Node_Index := Tree.Child (Tree.Child (Decl, 4), 1);
begin
if Tree.ID (Value_Node) = +declaration_item_ID and then
Tree.ID (Tree.Child (Value_Node, 1)) in
+IDENTIFIER_ID | +STRING_LITERAL_1_ID | +STRING_LITERAL_2_ID and then
Value = Get_Text (Data, Tree, Tree.Child (Value_Node, 1), Strip_Quotes => True)
then
Found := True;
case Tree.Label (Tree.Child (Decl, 3)) is
when Shared_Terminal =>
Name_Ident := New_Identifier (Get_Text (Data, Tree, Tree.Child (Decl, 3)));
when Virtual_Identifier =>
Name_Ident := Tree.Identifier (Tree.Child (Decl, 3));
when others =>
raise SAL.Programmer_Error;
end case;
end if;
end;
end if;
Temp := Next_List_Element (Temp, +compilation_unit_list_ID);
exit when Temp = Invalid_Node_Index;
end loop;
end;
if not Found then
if GNAT.Regexp.Match (Value, Symbol_Regexp) then
Name_Ident := New_Identifier (Ada.Characters.Handling.To_Upper (Value));
else
Put_Error
(Error_Message
(Data.Grammar_Lexer.File_Name, Get_Line (Data, Tree, Node),
"punctuation token '" & Value & "' not declared"));
return;
end if;
end if;
declare
Parent : constant Valid_Node_Index := Tree.Parent (Node);
begin
case To_Token_Enum (Tree.ID (Parent)) is
when rhs_item_ID =>
Tree.Set_Children
(Tree.Parent (Node),
(+rhs_item_ID, 0),
(1 => Tree.Add_Identifier (+IDENTIFIER_ID, Name_Ident, Tree.Byte_Region (Node))));
when rhs_optional_item_ID =>
Tree.Set_Children
(Tree.Parent (Node),
(+rhs_optional_item_ID, 2),
(1 => Tree.Add_Identifier (+IDENTIFIER_ID, Name_Ident, Tree.Byte_Region (Node))));
when others =>
Raise_Programmer_Error ("translate_ebnf_to_bnf string_literal_2 unimplemented", Tree, Node);
end case;
end;
Clear_EBNF_Node (Node);
if Found then return; end if;
-- Declare token for keyword string literal
declare
Keyword : constant Valid_Node_Index := Tree.Add_Identifier
(+KEYWORD_ID, Keyword_Ident, Tree.Byte_Region (Node));
Kind : constant Valid_Node_Index := Tree.Add_Nonterm
((+token_keyword_non_grammar_ID, 0),
(1 => Keyword));
Value_Literal : constant Valid_Node_Index := Tree.Add_Identifier
(+STRING_LITERAL_1_ID, New_Identifier ('"' & Value & '"'), Tree.Byte_Region (Node));
Decl_Item : constant Valid_Node_Index := Tree.Add_Nonterm
((+declaration_item_ID, 1),
(1 => Value_Literal));
Decl_Item_List : constant Valid_Node_Index := Tree.Add_Nonterm
((+declaration_item_list_ID, 0),
(1 => Decl_Item));
Percent : constant Valid_Node_Index := Tree.Add_Identifier
(+PERCENT_ID, Percent_Ident, Tree.Byte_Region (Node));
Name : constant Valid_Node_Index := Tree.Add_Identifier
(+IDENTIFIER_ID, Name_Ident, Tree.Byte_Region (Node));
Decl : constant Valid_Node_Index := Tree.Add_Nonterm
((+declaration_ID, 0), (Percent, Kind, Name, Decl_Item_List), Action => declaration_0'Access);
begin
Add_Compilation_Unit (Decl, Prepend => True);
end;
end;
when others =>
Raise_Programmer_Error ("unimplemented EBNF node", Tree, Node);
end case;
exception
when SAL.Programmer_Error =>
raise;
when E : others =>
Raise_Programmer_Error
("unhandled exception " & Ada.Exceptions.Exception_Name (E) & ": " &
Ada.Exceptions.Exception_Message (E),
Tree, Node);
end Process_Node;
begin
-- Process nodes in node increasing order, so contained items are
-- translated first, so duplicates of the containing item can be found
for I in Data.EBNF_Nodes.First_Index .. Data.EBNF_Nodes.Last_Index loop
if Data.EBNF_Nodes (I) then
Process_Node (I);
end if;
end loop;
-- Processing copied nodes may produce more copied nodes, so we can't
-- use a 'for' loop.
declare
use all type SAL.Base_Peek_Type;
I : SAL.Base_Peek_Type := Copied_EBNF_Nodes.First_Index;
begin
loop
exit when I > Copied_EBNF_Nodes.Last_Index;
Process_Node (Copied_EBNF_Nodes (I));
I := I + 1;
end loop;
end;
Data.Meta_Syntax := BNF_Syntax;
if Trace_Generate > Detail then
Ada.Text_IO.New_Line;
Ada.Text_IO.Put_Line ("Identifiers:");
for I in Data.Tokens.Virtual_Identifiers.First_Index .. Data.Tokens.Virtual_Identifiers.Last_Index loop
Ada.Text_IO.Put_Line (Base_Identifier_Index'Image (I) & " " & (-Data.Tokens.Virtual_Identifiers (I)));
end loop;
end if;
exception
when E : SAL.Not_Implemented =>
Ada.Text_IO.Put_Line
(Ada.Text_IO.Standard_Error, "Translate_EBNF_To_BNF not implemented: " & Ada.Exceptions.Exception_Message (E));
end Translate_EBNF_To_BNF;
procedure Print_Source
(File_Name : in String;
Tree : in WisiToken.Syntax_Trees.Tree;
Data : in User_Data_Type)
is
use Ada.Text_IO;
use WisiToken.Syntax_Trees;
File : File_Type;
Comments_Include_Newline : Boolean;
procedure Put_Comments (Node : in Valid_Node_Index)
is
Token : constant Base_Token_Index := Tree.Max_Terminal_Index (Node);
begin
-- Not all tokens have trailing non_grammar, so Data.Non_Grammar may
-- not have entries for every token.
Comments_Include_Newline := False;
if Token /= Invalid_Token_Index and then
Token in Data.Non_Grammar.First_Index .. Data.Non_Grammar.Last_Index
then
declare
Tokens : Base_Token_Arrays.Vector renames Data.Non_Grammar (Token);
begin
for Token of Tokens loop
if Token.ID = +NEW_LINE_ID then
Comments_Include_Newline := True;
end if;
Put (File, Data.Grammar_Lexer.Buffer_Text (Token.Byte_Region));
end loop;
end;
end if;
end Put_Comments;
procedure Put_Declaration_Item (Node : in Valid_Node_Index)
is
Children : constant Valid_Node_Index_Array := Tree.Children (Node);
begin
case To_Token_Enum (Tree.ID (Children (1))) is
when IDENTIFIER_ID | NUMERIC_LITERAL_ID | STRING_LITERAL_1_ID | STRING_LITERAL_2_ID =>
Put (File, ' ' & Get_Text (Data, Tree, Children (1)));
when REGEXP_ID =>
Put (File, " %[" & Get_Text (Data, Tree, Children (1)) & "]%");
when others =>
Put (File, Image (Tree.ID (Children (1)), Wisitoken_Grammar_Actions.Descriptor));
end case;
end Put_Declaration_Item;
procedure Put_Declaration_Item_List (Node : in Valid_Node_Index)
is
Children : constant Valid_Node_Index_Array := Tree.Children (Node);
begin
if Children'Length = 1 then
Put_Declaration_Item (Children (1));
else
Put_Declaration_Item_List (Children (1));
Put_Declaration_Item (Children (2));
end if;
end Put_Declaration_Item_List;
procedure Put_Identifier_List (Node : in Valid_Node_Index)
is
Children : constant Valid_Node_Index_Array := Tree.Children (Node);
begin
if Children'Length = 1 then
Put (File, Get_Text (Data, Tree, Children (1)));
else
Put_Identifier_List (Children (1));
Put (File, ' ');
Put (File, Get_Text (Data, Tree, Children (2)));
end if;
end Put_Identifier_List;
procedure Put_RHS_Element (Node : in Valid_Node_Index)
with Pre => Tree.ID (Node) = +rhs_element_ID
is begin
-- We don't raise an exception for errors here; it's easier to debug from the
-- mangled source listing.
case Tree.RHS_Index (Node) is
when 0 =>
Put (File, Get_Text (Data, Tree, Node));
when 1 =>
-- Output no spaces around "="
declare
Children : constant Valid_Node_Index_Array := Tree.Children (Node);
begin
Put (File, Get_Text (Data, Tree, Children (1)) & "=" & Get_Text (Data, Tree, Children (3)));
end;
when others =>
New_Line (File);
Put (File, " ;; not translated: " & Node_Index'Image (Node) & ":" &
Tree.Image (Node, Wisitoken_Grammar_Actions.Descriptor, Include_Children => True));
end case;
exception
when SAL.Programmer_Error =>
raise;
when E : others =>
declare
use Ada.Exceptions;
begin
Raise_Programmer_Error
("Put_RHS_Element: " & Exception_Name (E) & ": " & Exception_Message (E), Tree, Node);
end;
end Put_RHS_Element;
procedure Put_RHS_Item_List (Node : in Valid_Node_Index)
with Pre => Tree.ID (Node) = +rhs_item_list_ID
is
Children : constant Valid_Node_Index_Array := Tree.Children (Node);
begin
if Children'Length = 1 then
Put_RHS_Element (Children (1));
else
Put_RHS_Item_List (Children (1));
Put (File, ' ');
Put_RHS_Element (Children (2));
end if;
exception
when SAL.Programmer_Error =>
raise;
when E : others =>
declare
use Ada.Exceptions;
begin
Raise_Programmer_Error
("Put_RHS_Item_List: " & Exception_Name (E) & ": " & Exception_Message (E), Tree, Node);
end;
end Put_RHS_Item_List;
procedure Put_RHS
(Node : in Valid_Node_Index;
First : in Boolean;
Virtual : in Boolean)
with Pre => Tree.ID (Node) = +rhs_ID
is
Children : constant Valid_Node_Index_Array := Tree.Children (Node);
begin
Put (File, (if First then " : " else " | "));
case Tree.RHS_Index (Node) is
when 0 =>
if Virtual then
Put_Line (File, ";; empty");
else
Put_Comments (Tree.Parent (Node));
end if;
when 1 .. 3 =>
Put_RHS_Item_List (Children (1));
if Virtual then
New_Line (File);
else
Put_Comments (Children (1));
end if;
if Tree.RHS_Index (Node) > 1 then
Put (File, " %(" & Get_Text (Data, Tree, Children (2)) & ")%"); -- action
if Virtual then
New_Line (File);
else
Put_Comments (Children (2));
end if;
if Tree.RHS_Index (Node) > 2 then
Put (File, " %(" & Get_Text (Data, Tree, Children (3)) & ")%"); -- check
if Virtual then
New_Line (File);
else
Put_Comments (Children (3));
end if;
end if;
end if;
when others =>
Raise_Programmer_Error ("Put_RHS", Tree, Node);
end case;
exception
when SAL.Programmer_Error =>
raise;
when E : others =>
declare
use Ada.Exceptions;
begin
Raise_Programmer_Error ("Put_RHS: " & Exception_Name (E) & ": " & Exception_Message (E), Tree, Node);
end;
end Put_RHS;
procedure Put_RHS_List
(Node : in Valid_Node_Index;
First : in out Boolean;
Virtual : in Boolean)
with Pre => Tree.ID (Node) = +rhs_list_ID
is
Children : constant Valid_Node_Index_Array := Tree.Children (Node);
begin
case Tree.RHS_Index (Node) is
when 0 =>
Put_RHS (Children (1), First, Virtual or Children (1) > Data.EBNF_Nodes.Last_Index);
First := False;
when 1 =>
Put_RHS_List (Children (1), First, Virtual);
Put_RHS (Children (3), First => False, Virtual => Virtual or Children (3) > Data.EBNF_Nodes.Last_Index);
when 2 =>
Put
(File, "%if " & Get_Text (Data, Tree, Children (3)) & " = " & Get_Text (Data, Tree, Children (4)));
Put_Comments (Node);
when 3 =>
Put (File, "%end if");
Put_Comments (Node);
when others =>
Raise_Programmer_Error ("Put_RHS_List", Tree, Node);
end case;
exception
when SAL.Programmer_Error =>
raise;
when E : others =>
declare
use Ada.Exceptions;
begin
Raise_Programmer_Error ("Put_RHS_List: " & Exception_Name (E) & ": " & Exception_Message (E), Tree, Node);
end;
end Put_RHS_List;
procedure Process_Node (Node : in Valid_Node_Index)
is begin
case To_Token_Enum (Tree.ID (Node)) is
-- Enum_Token_ID alphabetical order
when compilation_unit_ID =>
Process_Node (Tree.Child (Node, 1));
when compilation_unit_list_ID =>
declare
Children : constant Valid_Node_Index_Array := Tree.Children (Node);
begin
case To_Token_Enum (Tree.ID (Children (1))) is
when compilation_unit_list_ID =>
Process_Node (Children (1));
Process_Node (Children (2));
when compilation_unit_ID =>
Process_Node (Children (1));
when others =>
raise SAL.Programmer_Error;
end case;
end;
when declaration_ID =>
declare
Children : constant Valid_Node_Index_Array := Tree.Children (Node);
begin
case Tree.RHS_Index (Node) is
when 0 =>
case Tree.RHS_Index (Children (2)) is
when 0 =>
Put (File, "%keyword");
when 1 =>
Put (File, "%non_grammar <" & Get_Text (Data, Tree, Tree.Child (Children (2), 3)) & ">");
when 2 =>
Put (File, "%token <" & Get_Text (Data, Tree, Tree.Child (Children (2), 3)) & ">");
when others =>
raise SAL.Programmer_Error;
end case;
Put (File, " " & Get_Text (Data, Tree, Children (3)));
Put_Declaration_Item_List (Children (4));
if Tree.Is_Virtual (Children (4)) then
New_Line (File);
else
Put_Comments (Children (4));
end if;
when 1 =>
Put (File, "%code ");
Put_Identifier_List (Children (3));
Put (File, " %{" & Get_Text (Data, Tree, Children (4)) & "}%"); -- RAW_CODE
Put_Comments (Node);
when 2 =>
declare
Key : constant String := Get_Text (Data, Tree, Children (2));
begin
if Key = "conflict" then
Put (File, Data.Grammar_Lexer.Buffer_Text (Tree.Byte_Region (Node)));
else
Put (File, "%" & Key);
Put_Declaration_Item_List (Children (3));
end if;
end;
Put_Comments (Children (3));
when 3 =>
Put (File, "%" & Get_Text (Data, Tree, Children (2)));
Put_Comments (Children (2));
when 4 =>
Put
(File, "%if" & Get_Text (Data, Tree, Children (2)) & " = " & Get_Text (Data, Tree, Children (4)));
Put_Comments (Node);
when 5 =>
Put (File, "%end if");
Put_Comments (Node);
when others =>
raise SAL.Programmer_Error;
end case;
end;
when nonterminal_ID =>
declare
Children : constant Valid_Node_Index_Array := Tree.Children (Node);
Virtual : constant Boolean := Tree.Label (Children (1)) = Virtual_Identifier;
First : Boolean := True;
begin
Put (File, Get_Text (Data, Tree, Children (1)));
if Virtual then
New_Line (File);
else
Put_Comments (Children (1));
if not Comments_Include_Newline then
New_Line (File);
end if;
end if;
Put_RHS_List (Children (3), First, Virtual);
if Tree.Children (Children (4))'Length > 0 then
if Virtual then
Put_Line (File, " ;");
else
Put (File, " ;");
Put_Comments (Children (4));
end if;
end if;
end;
when wisitoken_accept_ID =>
Process_Node (Tree.Child (Node, 1));
when others =>
raise SAL.Not_Implemented with Image (Tree.ID (Node), Wisitoken_Grammar_Actions.Descriptor);
end case;
end Process_Node;
begin
Create (File, Out_File, File_Name);
Put_Line (File, ";;; generated from " & Data.Grammar_Lexer.File_Name & " -*- buffer-read-only:t -*-");
Put_Line (File, ";;;");
declare
Tokens : Base_Token_Arrays.Vector renames Data.Non_Grammar (0);
begin
for Token of Tokens loop
Put (File, Data.Grammar_Lexer.Buffer_Text (Token.Byte_Region));
end loop;
end;
Process_Node (Tree.Root);
Close (File);
exception
when E : SAL.Not_Implemented =>
Close (File);
Ada.Text_IO.Put_Line
(Ada.Text_IO.Standard_Error, "Print_Source not implemented: " & Ada.Exceptions.Exception_Message (E));
end Print_Source;
end WisiToken_Grammar_Runtime;
-- Local Variables:
-- ada-which-func-parse-size: 30000
-- End:
|
-- CC1005B.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 GENERIC UNIT'S IDENTIFIER CAN BE USED IN ITS
-- FORMAL PART:
--
-- (A) AS THE SELECTOR IN AN EXPANDED NAME TO DENOTE AN ENTITY IN THE
-- VISIBLE PART OF A PACKAGE, OR TO DENOTE AN ENTITY IMMEDIATELY
-- ENCLOSED IN A CONSTRUCT OTHER THAN THE CONSTRUCT IMMEDIATELY
-- ENCLOSING THE GENERIC UNIT.
--
-- (B) AS A SELECTOR TO DENOTE A COMPONENT OF A RECORD OBJECT,
-- AS THE NAME OF A RECORD OR DISCRIMINANT COMPONENT IN A RECORD
-- AGGREGATE, AND AS THE NAME OF A FORMAL PARAMETER IN A
-- FUNCTION CALL.
-- HISTORY:
-- BCB 08/03/88 CREATED ORIGINAL TEST.
-- JRL 03/20/92 DELETED TEST IN BLOCK STATEMENT; CONSOLIDATED
-- WITH CC1005C.
WITH REPORT; USE REPORT;
PROCEDURE CC1005B IS
S : INTEGER := IDENT_INT(0);
PACKAGE CC1005B IS
I : INTEGER;
S : INTEGER := IDENT_INT(5);
GENERIC
S : INTEGER := IDENT_INT(10);
V : INTEGER := STANDARD.CC1005B.S;
W : INTEGER := STANDARD.CC1005B.CC1005B.S;
FUNCTION CC1005B RETURN INTEGER;
END CC1005B;
PACKAGE BODY CC1005B IS
FUNCTION CC1005B RETURN INTEGER IS
BEGIN
IF NOT EQUAL(V,0) THEN
FAILED ("WRONG VALUE OF S USED IN ASSIGNMENT OF V");
END IF;
IF NOT EQUAL(W,5) THEN
FAILED ("WRONG VALUE OF S USED IN ASSIGNMENT OF W");
END IF;
RETURN 0;
END CC1005B;
FUNCTION NEW_CC IS NEW CC1005B;
BEGIN
TEST ("CC1005B", "CHECK THAT A GENERIC UNIT'S IDENTIFIER " &
"CAN BE USED IN ITS FORMAL PART: AS THE " &
"SELECTOR IN AN EXPANDED NAME TO DENOTE " &
"AN ENTITY IN THE VISIBLE PART OF A " &
"PACKAGE, OR TO DENOTE AN ENTITY " &
"IMMEDIATELY ENCLOSED IN A CONSTRUCT " &
"OTHER THAN THE CONSTRUCT IMMEDIATELY " &
"ENCLOSING THE GENERIC UNIT; AND AS A " &
"SELECTOR TO DENOTE A COMPONENT OF A " &
"RECORD OBJECT, AS THE NAME OF A RECORD " &
"OR DISCRIMINANT COMPONENT IN A RECORD " &
"AGGREGATE, AND AS THE NAME OF A FORMAL " &
"PARAMETER IN A FUNCTION CALL");
I := NEW_CC;
END CC1005B;
FUNCTION F (P : INTEGER) RETURN INTEGER IS
BEGIN
RETURN P;
END F;
BEGIN
BLOCK1:
DECLARE
TYPE REC IS RECORD
P : INTEGER := IDENT_INT(0);
END RECORD;
TYPE REC2 (P : INTEGER) IS RECORD
NULL;
END RECORD;
R : REC;
J : INTEGER;
GENERIC
V : INTEGER := R.P;
X : REC := (P => IDENT_INT(10));
Y : REC2 := (P => IDENT_INT(15));
Z : INTEGER := F(P => IDENT_INT(20));
FUNCTION P RETURN INTEGER;
FUNCTION P RETURN INTEGER IS
BEGIN
IF NOT EQUAL(V,0) THEN
FAILED ("WRONG VALUE OF P USED IN ASSIGNMENT " &
"OF V");
END IF;
IF NOT EQUAL(X.P,10) THEN
FAILED ("WRONG VALUE USED IN ASSIGNMENT OF X.P");
END IF;
IF NOT EQUAL(Y.P,15) THEN
FAILED ("WRONG VALUE USED IN ASSIGNMENT OF Y.P");
END IF;
IF NOT EQUAL(Z,20) THEN
FAILED ("WRONG VALUE OF P USED IN ASSIGNMENT " &
"OF Z");
END IF;
RETURN 0;
END P;
FUNCTION NEW_P IS NEW P;
BEGIN
J := NEW_P;
END BLOCK1;
RESULT;
END CC1005B;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . T A S K I N G . I N I T I A L I Z A T I O N --
-- --
-- B o d y --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
pragma Style_Checks (All_Checks);
-- Turn off subprogram alpha ordering check, since we group soft link bodies
-- and dummy soft link bodies together separately in this unit.
pragma Polling (Off);
-- Turn polling off for this package. We don't need polling during any of the
-- routines in this package, and more to the point, if we try to poll it can
-- cause infinite loops.
with Ada.Exceptions;
with System.Task_Primitives;
with System.Task_Primitives.Operations;
with System.Soft_Links;
with System.Soft_Links.Tasking;
with System.Tasking.Debug;
with System.Tasking.Task_Attributes;
with System.Parameters;
with System.Secondary_Stack;
pragma Elaborate_All (System.Secondary_Stack);
pragma Unreferenced (System.Secondary_Stack);
-- Make sure the body of Secondary_Stack is elaborated before calling
-- Init_Tasking_Soft_Links. See comments for this routine for explanation.
package body System.Tasking.Initialization is
package STPO renames System.Task_Primitives.Operations;
package SSL renames System.Soft_Links;
use Parameters;
use Task_Primitives.Operations;
Global_Task_Lock : aliased System.Task_Primitives.RTS_Lock;
-- This is a global lock; it is used to execute in mutual exclusion from
-- all other tasks. It is only used by Task_Lock, Task_Unlock, and
-- Final_Task_Unlock.
----------------------------------------------------------------------
-- Tasking versions of some services needed by non-tasking programs --
----------------------------------------------------------------------
procedure Abort_Defer;
-- NON-INLINE versions without Self_ID for soft links
procedure Abort_Undefer;
-- NON-INLINE versions without Self_ID for soft links
procedure Task_Lock;
-- Locks out other tasks. Preceding a section of code by Task_Lock and
-- following it by Task_Unlock creates a critical region. This is used
-- for ensuring that a region of non-tasking code (such as code used to
-- allocate memory) is tasking safe. Note that it is valid for calls to
-- Task_Lock/Task_Unlock to be nested, and this must work properly, i.e.
-- only the corresponding outer level Task_Unlock will actually unlock.
procedure Task_Unlock;
-- Releases lock previously set by call to Task_Lock. In the nested case,
-- all nested locks must be released before other tasks competing for the
-- tasking lock are released.
function Get_Current_Excep return SSL.EOA;
-- Task-safe version of SSL.Get_Current_Excep
function Task_Name return String;
-- Returns current task's name
------------------------
-- Local Subprograms --
------------------------
----------------------------
-- Tasking Initialization --
----------------------------
procedure Init_RTS;
-- This procedure completes the initialization of the GNARL. The first part
-- of the initialization is done in the body of System.Tasking. It consists
-- of initializing global locks, and installing tasking versions of certain
-- operations used by the compiler. Init_RTS is called during elaboration.
--------------------------
-- Change_Base_Priority --
--------------------------
-- Call only with abort deferred and holding Self_ID locked
procedure Change_Base_Priority (T : Task_Id) is
begin
if T.Common.Base_Priority /= T.New_Base_Priority then
T.Common.Base_Priority := T.New_Base_Priority;
Set_Priority (T, T.Common.Base_Priority);
end if;
end Change_Base_Priority;
------------------------
-- Check_Abort_Status --
------------------------
function Check_Abort_Status return Integer is
Self_ID : constant Task_Id := Self;
begin
if Self_ID /= null
and then Self_ID.Deferral_Level = 0
and then Self_ID.Pending_ATC_Level < Self_ID.ATC_Nesting_Level
then
return 1;
else
return 0;
end if;
end Check_Abort_Status;
-----------------
-- Defer_Abort --
-----------------
procedure Defer_Abort (Self_ID : Task_Id) is
begin
if No_Abort then
return;
end if;
pragma Assert (Self_ID.Deferral_Level = 0);
-- pragma Assert
-- (Self_ID.Pending_ATC_Level >= Self_ID.ATC_Nesting_Level);
-- The above check has been useful in detecting mismatched defer/undefer
-- pairs. You may uncomment it when testing on systems that support
-- preemptive abort.
-- If the OS supports preemptive abort (e.g. pthread_kill), it should
-- have happened already. A problem is with systems that do not support
-- preemptive abort, and so rely on polling. On such systems we may get
-- false failures of the assertion, since polling for pending abort does
-- no occur until the abort undefer operation.
-- Even on systems that only poll for abort, the assertion may be useful
-- for catching missed abort completion polling points. The operations
-- that undefer abort poll for pending aborts. This covers most of the
-- places where the core Ada semantics require abort to be caught,
-- without any special attention. However, this generally happens on
-- exit from runtime system call, which means a pending abort will not
-- be noticed on the way into the runtime system. We considered adding a
-- check for pending aborts at this point, but chose not to, because of
-- the overhead. Instead, we searched for RTS calls where abort
-- completion is required and a task could go farther than Ada allows
-- before undeferring abort; we then modified the code to ensure the
-- abort would be detected.
Self_ID.Deferral_Level := Self_ID.Deferral_Level + 1;
end Defer_Abort;
--------------------------
-- Defer_Abort_Nestable --
--------------------------
procedure Defer_Abort_Nestable (Self_ID : Task_Id) is
begin
if No_Abort then
return;
end if;
-- The following assertion is by default disabled. See the comment in
-- Defer_Abort on the situations in which it may be useful to uncomment
-- this assertion and enable the test.
-- pragma Assert
-- (Self_ID.Pending_ATC_Level >= Self_ID.ATC_Nesting_Level or else
-- Self_ID.Deferral_Level > 0);
Self_ID.Deferral_Level := Self_ID.Deferral_Level + 1;
end Defer_Abort_Nestable;
-----------------
-- Abort_Defer --
-----------------
procedure Abort_Defer is
Self_ID : Task_Id;
begin
if No_Abort then
return;
end if;
Self_ID := STPO.Self;
Self_ID.Deferral_Level := Self_ID.Deferral_Level + 1;
end Abort_Defer;
-----------------------
-- Get_Current_Excep --
-----------------------
function Get_Current_Excep return SSL.EOA is
begin
return STPO.Self.Common.Compiler_Data.Current_Excep'Access;
end Get_Current_Excep;
-----------------------
-- Do_Pending_Action --
-----------------------
-- Call only when holding no locks
procedure Do_Pending_Action (Self_ID : Task_Id) is
use type Ada.Exceptions.Exception_Id;
begin
pragma Assert (Self_ID = Self and then Self_ID.Deferral_Level = 0);
-- Needs loop to recheck for pending action in case a new one occurred
-- while we had abort deferred below.
loop
-- Temporarily defer abort so that we can lock Self_ID
Self_ID.Deferral_Level := Self_ID.Deferral_Level + 1;
if Single_Lock then
Lock_RTS;
end if;
Write_Lock (Self_ID);
Self_ID.Pending_Action := False;
Unlock (Self_ID);
if Single_Lock then
Unlock_RTS;
end if;
-- Restore the original Deferral value
Self_ID.Deferral_Level := Self_ID.Deferral_Level - 1;
if not Self_ID.Pending_Action then
if Self_ID.Pending_ATC_Level < Self_ID.ATC_Nesting_Level then
if not Self_ID.Aborting then
Self_ID.Aborting := True;
pragma Debug
(Debug.Trace (Self_ID, "raise Abort_Signal", 'B'));
raise Standard'Abort_Signal;
pragma Assert (not Self_ID.ATC_Hack);
elsif Self_ID.ATC_Hack then
-- The solution really belongs in the Abort_Signal handler
-- for async. entry calls. The present hack is very
-- fragile. It relies that the very next point after
-- Exit_One_ATC_Level at which the task becomes abortable
-- will be the call to Undefer_Abort in the
-- Abort_Signal handler.
Self_ID.ATC_Hack := False;
pragma Debug
(Debug.Trace
(Self_ID, "raise Abort_Signal (ATC hack)", 'B'));
raise Standard'Abort_Signal;
end if;
end if;
return;
end if;
end loop;
end Do_Pending_Action;
-----------------------
-- Final_Task_Unlock --
-----------------------
-- This version is only for use in Terminate_Task, when the task is
-- relinquishing further rights to its own ATCB.
-- There is a very interesting potential race condition there, where the
-- old task may run concurrently with a new task that is allocated the old
-- tasks (now reused) ATCB. The critical thing here is to not make any
-- reference to the ATCB after the lock is released. See also comments on
-- Terminate_Task and Unlock.
procedure Final_Task_Unlock (Self_ID : Task_Id) is
begin
pragma Assert (Self_ID.Common.Global_Task_Lock_Nesting = 1);
Unlock (Global_Task_Lock'Access, Global_Lock => True);
end Final_Task_Unlock;
--------------
-- Init_RTS --
--------------
procedure Init_RTS is
Self_Id : Task_Id;
begin
Tasking.Initialize;
-- Terminate run time (regular vs restricted) specific initialization
-- of the environment task.
Self_Id := Environment_Task;
Self_Id.Master_of_Task := Environment_Task_Level;
Self_Id.Master_Within := Self_Id.Master_of_Task + 1;
for L in Self_Id.Entry_Calls'Range loop
Self_Id.Entry_Calls (L).Self := Self_Id;
Self_Id.Entry_Calls (L).Level := L;
end loop;
Self_Id.Awake_Count := 1;
Self_Id.Alive_Count := 1;
-- Normally, a task starts out with internal master nesting level one
-- larger than external master nesting level. It is incremented to one
-- by Enter_Master, which is called in the task body only if the
-- compiler thinks the task may have dependent tasks. There is no
-- corresponding call to Enter_Master for the environment task, so we
-- would need to increment it to 2 here. Instead, we set it to 3. By
-- doing this we reserve the level 2 for server tasks of the runtime
-- system. The environment task does not need to wait for these server
Self_Id.Master_Within := Library_Task_Level;
-- Initialize lock used to implement mutual exclusion between all tasks
Initialize_Lock (Global_Task_Lock'Access, STPO.Global_Task_Level);
-- Notify that the tasking run time has been elaborated so that
-- the tasking version of the soft links can be used.
if not No_Abort then
SSL.Abort_Defer := Abort_Defer'Access;
SSL.Abort_Undefer := Abort_Undefer'Access;
end if;
SSL.Lock_Task := Task_Lock'Access;
SSL.Unlock_Task := Task_Unlock'Access;
SSL.Check_Abort_Status := Check_Abort_Status'Access;
SSL.Task_Name := Task_Name'Access;
SSL.Get_Current_Excep := Get_Current_Excep'Access;
-- Initialize the tasking soft links (if not done yet) that are common
-- to the full and the restricted run times.
SSL.Tasking.Init_Tasking_Soft_Links;
-- Abort is deferred in a new ATCB, so we need to undefer abort at this
-- stage to make the environment task abortable.
Undefer_Abort (Environment_Task);
end Init_RTS;
---------------------------
-- Locked_Abort_To_Level--
---------------------------
-- Abort a task to the specified ATC nesting level.
-- Call this only with T locked.
-- An earlier version of this code contained a call to Wakeup. That should
-- not be necessary here, if Abort_Task is implemented correctly, since
-- Abort_Task should include the effect of Wakeup. However, the above call
-- was in earlier versions of this file, and at least for some targets
-- Abort_Task has not been doing Wakeup. It should not hurt to uncomment
-- the above call, until the error is corrected for all targets.
-- See extended comments in package body System.Tasking.Abort for the
-- overall design of the implementation of task abort.
-- ??? there is no such package ???
-- If the task is sleeping it will be in an abort-deferred region, and will
-- not have Abort_Signal raised by Abort_Task. Such an "abort deferral" is
-- just to protect the RTS internals, and not necessarily required to
-- enforce Ada semantics. Abort_Task should wake the task up and let it
-- decide if it wants to complete the aborted construct immediately.
-- Note that the effect of the low-level Abort_Task is not persistent.
-- If the target task is not blocked, this wakeup will be missed.
-- We don't bother calling Abort_Task if this task is aborting itself,
-- since we are inside the RTS and have abort deferred. Similarly, We don't
-- bother to call Abort_Task if T is terminated, since there is no need to
-- abort a terminated task, and it could be dangerous to try if the task
-- has stopped executing.
-- Note that an earlier version of this code had some false reasoning about
-- being able to reliably wake up a task that had suspended on a blocking
-- system call that does not atomically release the task's lock (e.g., UNIX
-- nanosleep, which we once thought could be used to implement delays).
-- That still left the possibility of missed wakeups.
-- We cannot safely call Vulnerable_Complete_Activation here, since that
-- requires locking Self_ID.Parent. The anti-deadlock lock ordering rules
-- would then require us to release the lock on Self_ID first, which would
-- create a timing window for other tasks to lock Self_ID. This is
-- significant for tasks that may be aborted before their execution can
-- enter the task body, and so they do not get a chance to call
-- Complete_Task. The actual work for this case is done in Terminate_Task.
procedure Locked_Abort_To_Level
(Self_ID : Task_Id;
T : Task_Id;
L : ATC_Level)
is
begin
if not T.Aborting and then T /= Self_ID then
case T.Common.State is
when Terminated
| Unactivated
=>
pragma Assert (False);
null;
when Activating
| Runnable
=>
-- This is needed to cancel an asynchronous protected entry
-- call during a requeue with abort.
T.Entry_Calls
(T.ATC_Nesting_Level).Cancellation_Attempted := True;
when Interrupt_Server_Blocked_On_Event_Flag =>
null;
when AST_Server_Sleep
| Async_Select_Sleep
| Delay_Sleep
| Interrupt_Server_Blocked_Interrupt_Sleep
| Interrupt_Server_Idle_Sleep
| Timer_Server_Sleep
=>
Wakeup (T, T.Common.State);
when Acceptor_Delay_Sleep
| Acceptor_Sleep
=>
T.Open_Accepts := null;
Wakeup (T, T.Common.State);
when Entry_Caller_Sleep =>
T.Entry_Calls
(T.ATC_Nesting_Level).Cancellation_Attempted := True;
Wakeup (T, T.Common.State);
when Activator_Sleep
| Asynchronous_Hold
| Master_Completion_Sleep
| Master_Phase_2_Sleep
=>
null;
end case;
end if;
if T.Pending_ATC_Level > L then
T.Pending_ATC_Level := L;
T.Pending_Action := True;
if L = 0 then
T.Callable := False;
end if;
-- This prevents aborted task from accepting calls
if T.Aborting then
-- The test above is just a heuristic, to reduce wasteful
-- calls to Abort_Task. We are holding T locked, and this
-- value will not be set to False except with T also locked,
-- inside Exit_One_ATC_Level, so we should not miss wakeups.
if T.Common.State = Acceptor_Sleep
or else
T.Common.State = Acceptor_Delay_Sleep
then
T.Open_Accepts := null;
end if;
elsif T /= Self_ID and then
(T.Common.State = Runnable
or else T.Common.State = Interrupt_Server_Blocked_On_Event_Flag)
-- The task is blocked on a system call waiting for the
-- completion event. In this case Abort_Task may need to take
-- special action in order to succeed.
then
Abort_Task (T);
end if;
end if;
end Locked_Abort_To_Level;
--------------------------------
-- Remove_From_All_Tasks_List --
--------------------------------
procedure Remove_From_All_Tasks_List (T : Task_Id) is
C : Task_Id;
Previous : Task_Id;
begin
pragma Debug
(Debug.Trace (Self, "Remove_From_All_Tasks_List", 'C'));
Previous := Null_Task;
C := All_Tasks_List;
while C /= Null_Task loop
if C = T then
if Previous = Null_Task then
All_Tasks_List := All_Tasks_List.Common.All_Tasks_Link;
else
Previous.Common.All_Tasks_Link := C.Common.All_Tasks_Link;
end if;
return;
end if;
Previous := C;
C := C.Common.All_Tasks_Link;
end loop;
pragma Assert (False);
end Remove_From_All_Tasks_List;
---------------
-- Task_Lock --
---------------
procedure Task_Lock (Self_ID : Task_Id) is
begin
Self_ID.Common.Global_Task_Lock_Nesting :=
Self_ID.Common.Global_Task_Lock_Nesting + 1;
if Self_ID.Common.Global_Task_Lock_Nesting = 1 then
Defer_Abort_Nestable (Self_ID);
Write_Lock (Global_Task_Lock'Access, Global_Lock => True);
end if;
end Task_Lock;
procedure Task_Lock is
begin
Task_Lock (STPO.Self);
end Task_Lock;
---------------
-- Task_Name --
---------------
function Task_Name return String is
Self_Id : constant Task_Id := STPO.Self;
begin
return Self_Id.Common.Task_Image (1 .. Self_Id.Common.Task_Image_Len);
end Task_Name;
-----------------
-- Task_Unlock --
-----------------
procedure Task_Unlock (Self_ID : Task_Id) is
begin
pragma Assert (Self_ID.Common.Global_Task_Lock_Nesting > 0);
Self_ID.Common.Global_Task_Lock_Nesting :=
Self_ID.Common.Global_Task_Lock_Nesting - 1;
if Self_ID.Common.Global_Task_Lock_Nesting = 0 then
Unlock (Global_Task_Lock'Access, Global_Lock => True);
Undefer_Abort_Nestable (Self_ID);
end if;
end Task_Unlock;
procedure Task_Unlock is
begin
Task_Unlock (STPO.Self);
end Task_Unlock;
-------------------
-- Undefer_Abort --
-------------------
-- Precondition : Self does not hold any locks
-- Undefer_Abort is called on any abort completion point (aka.
-- synchronization point). It performs the following actions if they
-- are pending: (1) change the base priority, (2) abort the task.
-- The priority change has to occur before abort. Otherwise, it would
-- take effect no earlier than the next abort completion point.
procedure Undefer_Abort (Self_ID : Task_Id) is
begin
if No_Abort then
return;
end if;
pragma Assert (Self_ID.Deferral_Level = 1);
Self_ID.Deferral_Level := Self_ID.Deferral_Level - 1;
if Self_ID.Deferral_Level = 0 then
pragma Assert (Check_No_Locks (Self_ID));
if Self_ID.Pending_Action then
Do_Pending_Action (Self_ID);
end if;
end if;
end Undefer_Abort;
----------------------------
-- Undefer_Abort_Nestable --
----------------------------
-- An earlier version would re-defer abort if an abort is in progress.
-- Then, we modified the effect of the raise statement so that it defers
-- abort until control reaches a handler. That was done to prevent
-- "skipping over" a handler if another asynchronous abort occurs during
-- the propagation of the abort to the handler.
-- There has been talk of reversing that decision, based on a newer
-- implementation of exception propagation. Care must be taken to evaluate
-- how such a change would interact with the above code and all the places
-- where abort-deferral is used to bridge over critical transitions, such
-- as entry to the scope of a region with a finalizer and entry into the
-- body of an accept-procedure.
procedure Undefer_Abort_Nestable (Self_ID : Task_Id) is
begin
if No_Abort then
return;
end if;
pragma Assert (Self_ID.Deferral_Level > 0);
Self_ID.Deferral_Level := Self_ID.Deferral_Level - 1;
if Self_ID.Deferral_Level = 0 then
pragma Assert (Check_No_Locks (Self_ID));
if Self_ID.Pending_Action then
Do_Pending_Action (Self_ID);
end if;
end if;
end Undefer_Abort_Nestable;
-------------------
-- Abort_Undefer --
-------------------
procedure Abort_Undefer is
Self_ID : Task_Id;
begin
if No_Abort then
return;
end if;
Self_ID := STPO.Self;
if Self_ID.Deferral_Level = 0 then
-- In case there are different views on whether Abort is supported
-- between the expander and the run time, we may end up with
-- Self_ID.Deferral_Level being equal to zero, when called from
-- the procedure created by the expander that corresponds to a
-- task body. In this case, there's nothing to be done.
-- See related code in System.Tasking.Stages.Create_Task resetting
-- Deferral_Level when System.Restrictions.Abort_Allowed is False.
return;
end if;
pragma Assert (Self_ID.Deferral_Level > 0);
Self_ID.Deferral_Level := Self_ID.Deferral_Level - 1;
if Self_ID.Deferral_Level = 0 then
pragma Assert (Check_No_Locks (Self_ID));
if Self_ID.Pending_Action then
Do_Pending_Action (Self_ID);
end if;
end if;
end Abort_Undefer;
--------------------------
-- Wakeup_Entry_Caller --
--------------------------
-- This is called at the end of service of an entry call, to abort the
-- caller if he is in an abortable part, and to wake up the caller if it
-- is on Entry_Caller_Sleep. It assumes that the call is already off-queue.
-- (This enforces the rule that a task must be off-queue if its state is
-- Done or Cancelled.) Call it holding the lock of Entry_Call.Self.
-- Timed_Call or Simple_Call:
-- The caller is waiting on Entry_Caller_Sleep, in
-- Wait_For_Completion, or Wait_For_Completion_With_Timeout.
-- Conditional_Call:
-- The caller might be in Wait_For_Completion,
-- waiting for a rendezvous (possibly requeued without abort)
-- to complete.
-- Asynchronous_Call:
-- The caller may be executing in the abortable part o
-- an async. select, or on a time delay,
-- if Entry_Call.State >= Was_Abortable.
procedure Wakeup_Entry_Caller
(Self_ID : Task_Id;
Entry_Call : Entry_Call_Link;
New_State : Entry_Call_State)
is
Caller : constant Task_Id := Entry_Call.Self;
begin
pragma Debug (Debug.Trace
(Self_ID, "Wakeup_Entry_Caller", 'E', Caller));
pragma Assert (New_State = Done or else New_State = Cancelled);
pragma Assert (Caller.Common.State /= Unactivated);
Entry_Call.State := New_State;
if Entry_Call.Mode = Asynchronous_Call then
-- Abort the caller in his abortable part, but do so only if call has
-- been queued abortably.
if Entry_Call.State >= Was_Abortable or else New_State = Done then
Locked_Abort_To_Level (Self_ID, Caller, Entry_Call.Level - 1);
end if;
elsif Caller.Common.State = Entry_Caller_Sleep then
Wakeup (Caller, Entry_Caller_Sleep);
end if;
end Wakeup_Entry_Caller;
-------------------------
-- Finalize_Attributes --
-------------------------
procedure Finalize_Attributes (T : Task_Id) is
Attr : Atomic_Address;
begin
for J in T.Attributes'Range loop
Attr := T.Attributes (J);
if Attr /= 0 and then Task_Attributes.Require_Finalization (J) then
Task_Attributes.To_Attribute (Attr).Free (Attr);
T.Attributes (J) := 0;
end if;
end loop;
end Finalize_Attributes;
begin
Init_RTS;
end System.Tasking.Initialization;
|
-- CE3906F.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- OBJECTIVE:
-- CHECK THAT THE SET PARAMETER AFFECTS THE CASE OF IDENTIFIERS,
-- BUT NOT CHARACTER LITERALS. CHECK THAT CHARACTER LITERALS ARE
-- ENCLOSED IN APOSTROPHES.
-- APPLICABILITY CRITERIA:
-- THIS TEST IS APPLICABLE ONLY TO IMPLEMENTATIONS WHICH
-- SUPPORT TEXT FILES.
-- HISTORY:
-- JBG 12/30/82
-- VKG 01/12/83
-- RJW 11/04/86 REVISED TEST TO OUTPUT A NON_APPLICABLE
-- RESULT WHEN FILES ARE NOT SUPPORTED.
-- DWC 09/18/87 CORRECTED EXCEPTION HANDLING.
WITH TEXT_IO; USE TEXT_IO;
WITH REPORT; USE REPORT;
WITH CHECK_FILE;
PROCEDURE CE3906F IS
TYPE ENUM IS (REDISH,GREENISH,YELLOWISH);
PACKAGE ENUM_IO IS NEW ENUMERATION_IO(ENUM);
PACKAGE CHAR_IO IS NEW ENUMERATION_IO(CHARACTER);
USE ENUM_IO; USE CHAR_IO;
INCOMPLETE : EXCEPTION;
FT : FILE_TYPE;
BEGIN
TEST ("CE3906F", "CHECK THE CASE OF ENUMERATION IO OUTPUT");
BEGIN
CREATE (FT);
EXCEPTION
WHEN USE_ERROR =>
NOT_APPLICABLE ("USE_ERROR RAISED; TEXT " &
"CREATE FOR TEMP FILE WITH " &
"OUT_FILE MODE - 1");
RAISE INCOMPLETE;
END;
IF ENUM_IO.DEFAULT_WIDTH /= 0 THEN
FAILED ("INITIAL DEFAULT WIDTH INCORRECT");
END IF;
IF CHAR_IO.DEFAULT_SETTING /= UPPER_CASE THEN
FAILED ("INITIAL DEFAULT_SETTING INCORRECT");
END IF;
PUT (FT, 'A', SET => LOWER_CASE);
NEW_LINE (FT);
PUT (FT, 'a', SET => LOWER_CASE);
NEW_LINE (FT);
PUT (FT, REDISH, SET => LOWER_CASE);
NEW_LINE (FT);
ENUM_IO.DEFAULT_SETTING := LOWER_CASE;
CHAR_IO.PUT (FT, 'C');
NEW_LINE (FT);
CHAR_IO.PUT (FT, 'b');
NEW_LINE (FT);
PUT (FT, REDISH);
NEW_LINE (FT);
PUT (FT, GREENISH, SET => LOWER_CASE);
NEW_LINE (FT);
PUT (FT, YELLOWISH, SET => UPPER_CASE);
CHECK_FILE (FT, "'A'#'a'#redish#'C'#'b'#redish#greenish#"
& "YELLOWISH#@%");
RESULT;
EXCEPTION
WHEN INCOMPLETE =>
RESULT;
END CE3906F;
|
-- This file is generated by SWIG. Please do not modify by hand.
--
with Interfaces;
with Interfaces.C;
with Interfaces.C.Pointers;
package xcb.xcb_glx_delete_textures_request_t is
-- Item
--
type Item is record
major_opcode : aliased Interfaces.Unsigned_8;
minor_opcode : aliased Interfaces.Unsigned_8;
length : aliased Interfaces.Unsigned_16;
context_tag : aliased xcb.xcb_glx_context_tag_t;
n : aliased Interfaces.Integer_32;
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb.xcb_glx_delete_textures_request_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_delete_textures_request_t.Item,
Element_Array => xcb.xcb_glx_delete_textures_request_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_delete_textures_request_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_delete_textures_request_t.Pointer,
Element_Array => xcb.xcb_glx_delete_textures_request_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_glx_delete_textures_request_t;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- G N A T . M E M O R Y _ D U M P --
-- --
-- S p e c --
-- --
-- Copyright (C) 2003-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. --
-- --
------------------------------------------------------------------------------
-- A routine for dumping memory to either standard output or standard error.
-- Uses GNAT.IO for actual output (use the controls in GNAT.IO to specify
-- the destination of the output, which by default is Standard_Output).
with System;
package GNAT.Memory_Dump is
pragma Preelaborate;
procedure Dump (Addr : System.Address; Count : Natural);
-- Dumps indicated number (Count) of bytes, starting at the address given
-- by Addr. The coding of this routine in its current form assumes the
-- case of a byte addressable machine (and is therefore inapplicable to
-- machines like the AAMP, where the storage unit is not 8 bits). The
-- output is one or more lines in the following format, which is for the
-- case of 32-bit addresses (64-bit addressea are handled appropriately):
--
-- 0234_3368: 66 67 68 . . . 73 74 75 "fghijklmnopqstuv"
--
-- All but the last line have 16 bytes. A question mark is used in the
-- string data to indicate a non-printable character.
end GNAT.Memory_Dump;
|
-----------------------------------------------------------------------
-- Ada Labs --
-- --
-- Copyright (C) 2008-2009, AdaCore --
-- --
-- Labs 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. You should have received --
-- a copy of the GNU General Public License along with this program; --
-- if not, write to the Free Software Foundation, Inc., 59 Temple --
-- Place - Suite 330, Boston, MA 02111-1307, USA. --
-----------------------------------------------------------------------
package Display is
type Color_Component_T is mod 2**8;
type RGBA_T is record
R : Color_Component_T;
G : Color_Component_T;
B : Color_Component_T;
A : Color_Component_T;
end record with Pack, Size => 32;
Transparent : RGBA_T := (R => 0, G => 0, B => 0, A => 0);
Black : RGBA_T := (R => 0, G => 0, B => 0, A => 255);
White : RGBA_T := (R => 255, G => 255, B => 255, A => 255);
Blue : RGBA_T := (R => 0, G => 0, B => 255, A => 255);
Green : RGBA_T := (R => 0, G => 255, B => 0, A => 255);
Red : RGBA_T := (R => 255, G => 0, B => 0, A => 255);
Cyan : RGBA_T := (R => 0, G => 255, B => 255, A => 255);
Magenta : RGBA_T := (R => 255, G => 0, B => 255, A => 255);
Yellow : RGBA_T := (R => 255, G => 255, B => 0, A => 255);
Gray : RGBA_T := (R => 128, G => 128, B => 128, A => 255);
Display_Error : exception;
type Button_Type is (Left, Right);
type Mouse_Position is record
X, Y : Float;
Button : Button_Type;
end record;
No_Mouse_Position : constant Mouse_Position := (-10_000.0, -10_000.0, Right);
end Display;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- G N A T . H T A B L E --
-- --
-- S p e c --
-- --
-- Copyright (C) 1995-2019, 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. --
-- --
------------------------------------------------------------------------------
-- Hash table searching routines
-- This package contains two separate packages. The Simple_HTable package
-- provides a very simple abstraction that associates one element to one
-- key value and takes care of all allocations automatically using the heap.
-- The Static_HTable package provides a more complex interface that allows
-- complete control over allocation.
-- See file s-htable.ads for full documentation of the interface
pragma Compiler_Unit_Warning;
with System.HTable;
package GNAT.HTable is
pragma Preelaborate;
pragma Elaborate_Body;
-- The elaborate body is because we have a dummy body to deal with
-- bootstrap path problems (we used to have a real body, and now we don't
-- need it any more, but the bootstrap requires that we have a dummy body,
-- since otherwise the old body gets picked up; also, we can't use pragma
-- No_Body because older bootstrap compilers don't support that).
generic package Simple_HTable renames System.HTable.Simple_HTable;
generic package Static_HTable renames System.HTable.Static_HTable;
generic function Hash renames System.HTable.Hash;
end GNAT.HTable;
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.