CombinedText stringlengths 4 3.42M |
|---|
-- This package is intended to set up and tear down the test environment.
-- Once created by GNATtest, this package will never be overwritten
-- automatically. Contents of this package can be modified in any way
-- except for sections surrounded by a 'read only' marker.
with AUnit.Test_Fixtures;
package Tk.Winfo.Test_Data is
-- begin read only
type Test is new AUnit.Test_Fixtures.Test_Fixture
-- end read only
with null record;
procedure Set_Up(Gnattest_T: in out Test);
procedure Tear_Down(Gnattest_T: in out Test);
end Tk.Winfo.Test_Data;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . A T O M I C _ C O U N T E R S --
-- --
-- B o d y --
-- --
-- Copyright (C) 2011-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This implementation of the package for x86 processor. GCC can't generate
-- code for atomic builtins for 386 CPU. Only increment/decrement instructions
-- are supported, thus this implementaton uses machine code insertions to
-- access the necessary instructions.
with System.Machine_Code;
package body System.Atomic_Counters is
-- Add comments showing in normal asm language what we generate???
---------------
-- Decrement --
---------------
function Decrement (Item : aliased in out Atomic_Unsigned) return Boolean is
Aux : Boolean;
begin
System.Machine_Code.Asm
(Template =>
"lock%; decl" & ASCII.HT & "%0" & ASCII.LF & ASCII.HT
& "sete %1",
Outputs =>
(Atomic_Unsigned'Asm_Output ("=m", Item),
Boolean'Asm_Output ("=qm", Aux)),
Inputs => Atomic_Unsigned'Asm_Input ("m", Item),
Volatile => True);
return Aux;
end Decrement;
procedure Decrement (Item : aliased in out Atomic_Unsigned) is
begin
if Decrement (Item) then
null;
end if;
end Decrement;
function Decrement (Item : in out Atomic_Counter) return Boolean is
begin
return Decrement (Item.Value);
end Decrement;
---------------
-- Increment --
---------------
procedure Increment (Item : aliased in out Atomic_Unsigned) is
begin
System.Machine_Code.Asm
(Template => "lock%; incl" & ASCII.HT & "%0",
Outputs => Atomic_Unsigned'Asm_Output ("=m", Item),
Inputs => Atomic_Unsigned'Asm_Input ("m", Item),
Volatile => True);
end Increment;
procedure Increment (Item : in out Atomic_Counter) is
begin
Increment (Item.Value);
end Increment;
----------------
-- Initialize --
----------------
procedure Initialize (Item : out Atomic_Counter) is
begin
Item.Value := 1;
end Initialize;
------------
-- Is_One --
------------
function Is_One (Item : Atomic_Counter) return Boolean is
begin
return Item.Value = 1;
end Is_One;
end System.Atomic_Counters;
|
------------------------------------------------------------------------------
-- --
-- ASIS-for-GNAT IMPLEMENTATION COMPONENTS --
-- --
-- A 4 G . G N A T _ I N T --
-- --
-- B o d y --
-- --
-- Copyright (C) 1995-2012, Free Software Foundation, Inc. --
-- --
-- ASIS-for-GNAT is free software; you can redistribute it and/or modify it --
-- under terms of the GNU General Public License as published by the Free --
-- Software Foundation; either version 2, or (at your option) any later --
-- version. ASIS-for-GNAT is distributed in the hope that it will be use- --
-- ful, but WITHOUT ANY WARRANTY; without even the implied warranty of MER- --
-- CHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General --
-- Public License for more details. You should have received a copy of the --
-- GNU General Public License distributed with ASIS-for-GNAT; see file --
-- COPYING. If not, write to the Free Software Foundation, 51 Franklin --
-- Street, Fifth Floor, Boston, MA 02110-1301, USA. --
-- --
-- --
-- --
-- --
-- --
-- --
-- --
-- --
-- ASIS-for-GNAT was originally developed by the ASIS-for-GNAT team at the --
-- Software Engineering Laboratory of the Swiss Federal Institute of --
-- Technology (LGL-EPFL) in Lausanne, Switzerland, in cooperation with the --
-- Scientific Research Computer Center of Moscow State University (SRCC --
-- MSU), Russia, with funding partially provided by grants from the Swiss --
-- National Science Foundation and the Swiss Academy of Engineering --
-- Sciences. ASIS-for-GNAT is now maintained by AdaCore --
-- (http://www.adacore.com). --
-- --
------------------------------------------------------------------------------
with Ada.Exceptions;
with Ada.Strings.Fixed; use Ada.Strings.Fixed;
with Ada.Text_IO; use Ada.Text_IO;
with GNAT.Directory_Operations; use GNAT.Directory_Operations;
with Asis.Errors;
with Asis.Exceptions; use Asis.Exceptions;
with Asis.Extensions; use Asis.Extensions;
with A4G.A_Debug; use A4G.A_Debug;
with A4G.A_Opt; use A4G.A_Opt;
with A4G.A_Output; use A4G.A_Output;
with A4G.Contt; use A4G.Contt;
with A4G.Vcheck; use A4G.Vcheck;
with Aspects;
with Atree;
with Csets;
with Elists;
with Fname;
with Gnatvsn;
with Lib;
with Namet;
with Nlists;
with Opt; use Opt;
with Repinfo;
with Sem_Aux;
with Sinput;
with Stand;
with Stringt;
with Uintp;
with Urealp;
with Tree_IO;
package body A4G.GNAT_Int is
LT : String renames ASIS_Line_Terminator;
Standard_GCC : constant String_Access :=
GNAT.OS_Lib.Locate_Exec_On_Path ("gcc");
-----------------
-- Create_Tree --
-----------------
procedure Create_Tree (Source_File : String_Access;
Context : Context_Id;
Is_Predefined : Boolean;
Success : out Boolean)
is
begin
if Is_Predefined then
Compile (Source_File => Source_File,
Args => (1 => GNAT_Flag),
Success => Success,
GCC => Gcc_To_Call (Context));
else
Compile (Source_File => Source_File,
Args => I_Options (Context),
Success => Success,
GCC => Gcc_To_Call (Context));
end if;
exception
when others =>
Raise_ASIS_Failed ("A4G.GNAT_Int.Create_Tree:" & LT &
" check the path and environment settings for gcc!");
end Create_Tree;
-------------
-- Execute --
-------------
function Execute
(Program : String_Access;
Args : Argument_List;
Compiler_Out : String := "";
Display_Call : Boolean := A4G.A_Debug.Debug_Mode)
return Boolean
is
Success : Boolean;
Return_Code : Integer;
Execute : String_Access := Program;
begin
if Execute = null then
Execute := Standard_GCC;
end if;
if Display_Call then
Put (Standard_Error, Execute.all);
for J in Args'Range loop
Put (Standard_Error, " ");
Put (Standard_Error, Args (J).all);
end loop;
New_Line (Standard_Error);
end if;
if Execute = null then
Ada.Exceptions.Raise_Exception
(Program_Error'Identity,
"A4G.GNAT_Int.Execute: Can not locate program to execute");
end if;
if Compiler_Out /= "" then
GNAT.OS_Lib.Spawn
(Execute.all,
Args,
Compiler_Out,
Success,
Return_Code);
Success := Return_Code = 0;
else
GNAT.OS_Lib.Spawn (Execute.all, Args, Success);
end if;
return Success;
end Execute;
----------------------------------------------
-- General Interfaces between GNAT and ASIS --
----------------------------------------------
function A_Time (T : Time_Stamp_Type) return Time is
Year : Year_Number;
Month : Month_Number;
Day : Day_Number;
Hours : Integer range 0 .. 23;
Minutes : Integer range 0 .. 59;
Seconds : Integer range 0 .. 59;
Day_Time : Day_Duration;
begin
Split_Time_Stamp
(TS => T,
Year => Nat (Year),
Month => Nat (Month),
Day => Nat (Day),
Hour => Nat (Hours),
Minutes => Nat (Minutes),
Seconds => Nat (Seconds));
Day_Time := Duration (Seconds + 60 * Minutes + 3600 * Hours);
return Time_Of (Year, Month, Day, Day_Time);
end A_Time;
--------------------------------
-- Tree_In_With_Version_Check --
--------------------------------
procedure Tree_In_With_Version_Check
(Desc : File_Descriptor;
Cont : Context_Id;
Success : out Boolean)
is
Cont_Mode : constant Context_Mode := Context_Processing_Mode (Cont);
File_Closed : Boolean := False;
ASIS_GNAT_V : constant String := Gnatvsn.Gnat_Version_String;
First_A_Idx : Natural := ASIS_GNAT_V'First;
Last_A_Idx : Natural;
First_T_Idx : Natural;
Last_T_Idx : Natural;
begin
Success := False;
Tree_IO.Tree_Read_Initialize (Desc);
Opt.Tree_Read;
-- GNAT/ASIS version check first
if Tree_ASIS_Version_Number /= Tree_IO.ASIS_Version_Number then
Close (Desc, File_Closed);
Ada.Exceptions.Raise_Exception
(Program_Error'Identity, "Inconsistent versions of GNAT and ASIS");
end if;
-- Check that ASIS Pro uses the tree created by GNAT Pro
First_T_Idx := Tree_Version_String'First;
if ASIS_GNAT_V (First_A_Idx .. First_A_Idx + 2) = "Pro"
and then Tree_Version_String (First_T_Idx .. First_T_Idx + 2) /=
"Pro"
then
Close (Desc, File_Closed);
Ada.Exceptions.Raise_Exception
(Program_Error'Identity, "ASIS Pro can be used with GNAT Pro only");
end if;
if Strong_Version_Check then
-- We check only the dates here!
First_A_Idx :=
Index (Source => ASIS_GNAT_V,
Pattern => "(") + 1;
First_T_Idx :=
Index (Source => Tree_Version_String.all,
Pattern => "(") + 1;
Last_A_Idx := Index (Source => ASIS_GNAT_V,
Pattern => ")") - 1;
if Index (Source => ASIS_GNAT_V, Pattern => "-") /= 0 then
Last_A_Idx := Index (Source => ASIS_GNAT_V,
Pattern => "-") - 1;
end if;
Last_T_Idx := Index (Source => Tree_Version_String.all,
Pattern => ")") - 1;
if Index (Source => Tree_Version_String.all, Pattern => "-") /=
0
then
Last_T_Idx :=
Index (Source => Tree_Version_String.all,
Pattern => "-") - 1;
end if;
if ASIS_GNAT_V (First_A_Idx .. Last_A_Idx) /=
Tree_Version_String (First_T_Idx .. Last_T_Idx)
then
Close (Desc, File_Closed);
Ada.Exceptions.Raise_Exception
(Program_Error'Identity,
"Inconsistent versions of GNAT [" & Tree_Version_String.all &
"] and ASIS [" & ASIS_GNAT_V & ']');
end if;
end if;
-- Check if we are in Ada 2012 mode and need aspects...
-- if Opt.Ada_Version_Config = Ada_2012 then
-- -- For now, reading aspects is protected by the debug '.A' flag
-- Debug.Debug_Flag_Dot_AA := True;
-- end if;
if Operating_Mode /= Check_Semantics then
if Cont_Mode = One_Tree then
-- If in one-tree mode we can not read the only tree we have,
-- there is no reason to continue, so raising an exception
-- is the only choice:
Close (Desc, File_Closed);
-- We did not check File_Closed here, because the fact that the
-- tree is not compile-only seems to be more important for ASIS
Set_Error_Status
(Status => Asis.Errors.Use_Error,
Diagnosis => "Asis.Ada_Environments.Open:"
& ASIS_Line_Terminator
& "tree file "
& Base_Name (A_Name_Buffer (1 .. A_Name_Len))
& " is not compile-only");
raise ASIS_Failed;
elsif Cont_Mode = N_Trees
or else
Cont_Mode = All_Trees
then
-- no need to read the rest of this tree file, but
-- we can continue even if we can not read some trees...
ASIS_Warning
(Message => "Asis.Ada_Environments.Open: "
& ASIS_Line_Terminator
& "tree file "
& Base_Name (A_Name_Buffer (1 .. A_Name_Len))
& " is not compile-only, ignored",
Error => Asis.Errors.Use_Error);
end if;
-- debug stuff...
if (Debug_Flag_O or else
Debug_Lib_Model or else
Debug_Mode)
and then
Cont_Mode /= One_Tree and then
Cont_Mode /= N_Trees
then
Put (Standard_Error, "The tree file ");
Put (Standard_Error, Base_Name (A_Name_Buffer (1 .. A_Name_Len)));
Put (Standard_Error, " is not compile-only");
New_Line (Standard_Error);
end if;
else
Atree.Tree_Read;
Elists.Tree_Read;
Fname.Tree_Read;
Lib.Tree_Read;
Namet.Tree_Read;
Nlists.Tree_Read;
Sem_Aux.Tree_Read;
Sinput.Tree_Read;
Stand.Tree_Read;
Stringt.Tree_Read;
Uintp.Tree_Read;
Urealp.Tree_Read;
Repinfo.Tree_Read;
Aspects.Tree_Read;
Csets.Initialize;
-- debug stuff...
if Debug_Flag_O or else
Debug_Lib_Model or else
Debug_Mode
then
Put (Standard_Error, "The tree file ");
Put (Standard_Error, Base_Name (A_Name_Buffer (1 .. A_Name_Len)));
Put (Standard_Error, " is OK");
New_Line (Standard_Error);
end if;
Success := True;
end if;
Close (Desc, File_Closed);
if not File_Closed then
Raise_ASIS_Failed
(Diagnosis => "Asis.Ada_Environments.Open: " &
"Can not close tree file: " &
Base_Name (A_Name_Buffer (1 .. A_Name_Len)) &
ASIS_Line_Terminator &
"disk is full or file may be used by other program",
Stat => Asis.Errors.Data_Error);
end if;
exception
when Tree_IO.Tree_Format_Error =>
Close (Desc, File_Closed);
Ada.Exceptions.Raise_Exception
(Program_Error'Identity, "Inconsistent versions of GNAT and ASIS");
end Tree_In_With_Version_Check;
end A4G.GNAT_Int;
|
with SPARKNaCl; use SPARKNaCl;
with SPARKNaCl.Debug; use SPARKNaCl.Debug;
with SPARKNaCl.Sign; use SPARKNaCl.Sign;
with Ada.Text_IO; use Ada.Text_IO;
with Interfaces; use Interfaces;
with Random;
procedure Sign
is
Raw_SK : Bytes_32;
PK : Signing_PK;
SK : Signing_SK;
M : constant Byte_Seq (0 .. 255) := (0 => 16#55#, others => 16#aa#);
SM : Byte_Seq (0 .. 319) := (others => 0);
M2 : Byte_Seq (0 .. 319) := (others => 0);
M3 : Byte_Seq (0 .. 255);
ML : I32;
S : Boolean;
-- I : I64 := 1;
begin
-- loop
-- Put_Line ("Iteration " & I'Img);
Random.Random_Bytes (Raw_SK);
Keypair (Raw_SK, PK, SK);
begin
Sign (SM, M, SK);
exception
when Constraint_Error =>
Debug.DH ("In Sign, SK was ", Serialize (SK));
raise;
end;
begin
Open (M2, S, ML, SM, PK);
exception
when Constraint_Error =>
Debug.DH ("In Open, PK was ", Serialize (PK));
Debug.DH ("In Open, SM was ", SM);
raise;
end;
M3 := M2 (0 .. 255);
-- I := I + 1;
DH ("M3 is ", M3);
Put_Line ("Status is " & Img (S));
Put_Line ("ML is " & ML'Img);
-- end loop;
end Sign;
|
generic
type Element_Type is private;
package Linked_List is
type List_Type is limited private;
...
private
type List_Element;
type List_Element_Ptr is access list_element;
type List_Element is
record
Prev : List_Element_Ptr;
Data : Element_Type;
Next : List_Element_Ptr;
end record;
type List_Type is
record
Head : List_Element_Ptr; -- Pointer to first element.
Tail : List_Element_Ptr; -- Pointer to last element.
Cursor : List_Element_Ptr; -- Pointer to cursor element.
Count : Natural := 0; -- Number of items in list.
Traversing : Boolean := False; -- True when in a traversal.
end record;
end Linked_List;
|
-------------------------------------------------------------------------------
-- LSE -- L-System Editor
-- Author: Heziode
--
-- License:
-- MIT License
--
-- Copyright (c) 2018 Quentin Dauprat (Heziode) <Heziode@protonmail.com>
--
-- Permission is hereby granted, free of charge, to any person obtaining a
-- copy of this software and associated documentation files (the "Software"),
-- to deal in the Software without restriction, including without limitation
-- the rights to use, copy, modify, merge, publish, distribute, sublicense,
-- and/or sell copies of the Software, and to permit persons to whom the
-- Software is furnished to do so, subject to the following conditions:
--
-- The above copyright notice and this permission notice shall be included in
-- all copies or substantial portions of the Software.
--
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
-- FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
-- DEALINGS IN THE SOFTWARE.
-------------------------------------------------------------------------------
with Ada.Containers.Indefinite_Holders;
with LSE.Utils.Coordinate_2D;
use LSE.Utils.Coordinate_2D;
-- @description
-- This package provide a pointer of 2D coordinate.
--
package LSE.Utils.Coordinate_2D_Ptr is new Ada.Containers.Indefinite_Holders
(Coordinate);
|
-- This spec has been automatically generated from STM32F103.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with System;
package STM32_SVD.RTC is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype CRH_SECIE_Field is STM32_SVD.Bit;
subtype CRH_ALRIE_Field is STM32_SVD.Bit;
subtype CRH_OWIE_Field is STM32_SVD.Bit;
-- RTC Control Register High
type CRH_Register is record
-- Second interrupt Enable
SECIE : CRH_SECIE_Field := 16#0#;
-- Alarm interrupt Enable
ALRIE : CRH_ALRIE_Field := 16#0#;
-- Overflow interrupt Enable
OWIE : CRH_OWIE_Field := 16#0#;
-- unspecified
Reserved_3_31 : STM32_SVD.UInt29 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CRH_Register use record
SECIE at 0 range 0 .. 0;
ALRIE at 0 range 1 .. 1;
OWIE at 0 range 2 .. 2;
Reserved_3_31 at 0 range 3 .. 31;
end record;
subtype CRL_SECF_Field is STM32_SVD.Bit;
subtype CRL_ALRF_Field is STM32_SVD.Bit;
subtype CRL_OWF_Field is STM32_SVD.Bit;
subtype CRL_RSF_Field is STM32_SVD.Bit;
subtype CRL_CNF_Field is STM32_SVD.Bit;
subtype CRL_RTOFF_Field is STM32_SVD.Bit;
-- RTC Control Register Low
type CRL_Register is record
-- Second Flag
SECF : CRL_SECF_Field := 16#0#;
-- Alarm Flag
ALRF : CRL_ALRF_Field := 16#0#;
-- Overflow Flag
OWF : CRL_OWF_Field := 16#0#;
-- Registers Synchronized Flag
RSF : CRL_RSF_Field := 16#0#;
-- Configuration Flag
CNF : CRL_CNF_Field := 16#0#;
-- Read-only. RTC operation OFF
RTOFF : CRL_RTOFF_Field := 16#1#;
-- unspecified
Reserved_6_31 : STM32_SVD.UInt26 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CRL_Register use record
SECF at 0 range 0 .. 0;
ALRF at 0 range 1 .. 1;
OWF at 0 range 2 .. 2;
RSF at 0 range 3 .. 3;
CNF at 0 range 4 .. 4;
RTOFF at 0 range 5 .. 5;
Reserved_6_31 at 0 range 6 .. 31;
end record;
subtype PRLH_PRLH_Field is STM32_SVD.UInt4;
-- RTC Prescaler Load Register High
type PRLH_Register is record
-- Write-only. RTC Prescaler Load Register High
PRLH : PRLH_PRLH_Field := 16#0#;
-- unspecified
Reserved_4_31 : STM32_SVD.UInt28 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for PRLH_Register use record
PRLH at 0 range 0 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
subtype PRLL_PRLL_Field is STM32_SVD.UInt16;
-- RTC Prescaler Load Register Low
type PRLL_Register is record
-- Write-only. RTC Prescaler Divider Register Low
PRLL : PRLL_PRLL_Field := 16#8000#;
-- unspecified
Reserved_16_31 : STM32_SVD.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for PRLL_Register use record
PRLL at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype DIVH_DIVH_Field is STM32_SVD.UInt4;
-- RTC Prescaler Divider Register High
type DIVH_Register is record
-- Read-only. RTC prescaler divider register high
DIVH : DIVH_DIVH_Field;
-- unspecified
Reserved_4_31 : STM32_SVD.UInt28;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DIVH_Register use record
DIVH at 0 range 0 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
subtype DIVL_DIVL_Field is STM32_SVD.UInt16;
-- RTC Prescaler Divider Register Low
type DIVL_Register is record
-- Read-only. RTC prescaler divider register Low
DIVL : DIVL_DIVL_Field;
-- unspecified
Reserved_16_31 : STM32_SVD.UInt16;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DIVL_Register use record
DIVL at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CNTH_CNTH_Field is STM32_SVD.UInt16;
-- RTC Counter Register High
type CNTH_Register is record
-- RTC counter register high
CNTH : CNTH_CNTH_Field := 16#0#;
-- unspecified
Reserved_16_31 : STM32_SVD.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CNTH_Register use record
CNTH at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CNTL_CNTL_Field is STM32_SVD.UInt16;
-- RTC Counter Register Low
type CNTL_Register is record
-- RTC counter register Low
CNTL : CNTL_CNTL_Field := 16#0#;
-- unspecified
Reserved_16_31 : STM32_SVD.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CNTL_Register use record
CNTL at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype ALRH_ALRH_Field is STM32_SVD.UInt16;
-- RTC Alarm Register High
type ALRH_Register is record
-- Write-only. RTC alarm register high
ALRH : ALRH_ALRH_Field := 16#FFFF#;
-- unspecified
Reserved_16_31 : STM32_SVD.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ALRH_Register use record
ALRH at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype ALRL_ALRL_Field is STM32_SVD.UInt16;
-- RTC Alarm Register Low
type ALRL_Register is record
-- Write-only. RTC alarm register low
ALRL : ALRL_ALRL_Field := 16#FFFF#;
-- unspecified
Reserved_16_31 : STM32_SVD.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ALRL_Register use record
ALRL at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Real time clock
type RTC_Peripheral is record
-- RTC Control Register High
CRH : aliased CRH_Register;
-- RTC Control Register Low
CRL : aliased CRL_Register;
-- RTC Prescaler Load Register High
PRLH : aliased PRLH_Register;
-- RTC Prescaler Load Register Low
PRLL : aliased PRLL_Register;
-- RTC Prescaler Divider Register High
DIVH : aliased DIVH_Register;
-- RTC Prescaler Divider Register Low
DIVL : aliased DIVL_Register;
-- RTC Counter Register High
CNTH : aliased CNTH_Register;
-- RTC Counter Register Low
CNTL : aliased CNTL_Register;
-- RTC Alarm Register High
ALRH : aliased ALRH_Register;
-- RTC Alarm Register Low
ALRL : aliased ALRL_Register;
end record
with Volatile;
for RTC_Peripheral use record
CRH at 16#0# range 0 .. 31;
CRL at 16#4# range 0 .. 31;
PRLH at 16#8# range 0 .. 31;
PRLL at 16#C# range 0 .. 31;
DIVH at 16#10# range 0 .. 31;
DIVL at 16#14# range 0 .. 31;
CNTH at 16#18# range 0 .. 31;
CNTL at 16#1C# range 0 .. 31;
ALRH at 16#20# range 0 .. 31;
ALRL at 16#24# range 0 .. 31;
end record;
-- Real time clock
RTC_Periph : aliased RTC_Peripheral
with Import, Address => System'To_Address (16#40002800#);
end STM32_SVD.RTC;
|
package body Markov is
function Parse (S : String_Array) return Ruleset is
Result : Ruleset (Length => S'Length);
begin
for I in S'Range loop
if Length (S (I)) = 0 or else Element (S (I), 1) = '#' then
Result.Entries (I) := (Kind => Comment, Text => S (I));
else
declare
Separator : Natural;
Terminating : Boolean;
Target : Unbounded_String;
begin
Separator := Index (S (I), " -> ");
if Separator = 0 then
raise Constraint_Error;
end if;
Target :=
Unbounded_Slice
(Source => S (I),
Low => Separator + 4,
High => Length (S (I)));
Terminating := Length (Target) > 0
and then Element (Target, 1) = '.';
if Terminating then
Delete (Source => Target, From => 1, Through => 1);
end if;
Result.Entries (I) :=
(Kind => Rule,
Source => Unbounded_Slice
(Source => S (I),
Low => 1,
High => Separator - 1),
Target => Target,
Is_Terminating => Terminating);
end;
end if;
end loop;
return Result;
end Parse;
procedure Apply
(R : Rule_Entry;
S : in out Unbounded_String;
Modified : in out Boolean)
is
Pattern : String := To_String (R.Source);
Where : Natural := Index (S, Pattern);
begin
while Where /= 0 loop
Modified := True;
Replace_Slice
(Source => S,
Low => Where,
High => Where + Pattern'Length - 1,
By => To_String (R.Target));
Where := Index (S, Pattern, Where + Length (R.Target));
end loop;
end Apply;
function Apply (R : Ruleset; S : String) return String is
Result : Unbounded_String := To_Unbounded_String (S);
Current_Rule : Set_Entry;
Modified : Boolean := False;
begin
loop
Modified := False;
for I in R.Entries'Range loop
Current_Rule := R.Entries (I);
if Current_Rule.Kind = Rule then
Apply (Current_Rule, Result, Modified);
exit when Current_Rule.Is_Terminating or else Modified;
end if;
end loop;
exit when not Modified;
end loop;
return To_String (Result);
end Apply;
end Markov;
|
with ULog;
with ULog.GPS;
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Tags;
with Interfaces;
-- Rules for conversion in OO programming:
-- 1. SPECIFIC TYPES: only up-cast (towards ancestors/base) possible
-- * view conversion, i.e., components not in parent are hidden
-- * tag stays untouched (really? then why no dispatching?)
-- * no initialization necessary
-- * not dispatching
-- 2. CLASS-WIDE TYPES: both directions (ancestors <> descendant) possible
-- * view conversions
-- * requires initialization with specific
-- * dispatch works
-- 3. VIEW RENAMING: to rename result of a view conversion
-- * view the result as target type
-- * optimal performance
-- * requires "initialization" with specific
-- * dispatch works
-- X. VIEW CONVERSION: if both source and target type are tagged, or
-- if appearing in a call as IN OUT or OUT paramete.
-- Y. VALUE CONVERSION: everything else
-- Z. DYAMIC DISPATCHING
--
procedure main is
msg : ULog.Message; -- root type for polymorphism
msg_gps : ULog.GPS.Message;
-- this procedure takes any member of the Ulog.Message class and makes dispatching calls
procedure dispatcher (msg : ULog.Message'Class) is
-- accepts any argument of tyme ULog.Message and its descendants
s : Interfaces.Unsigned_16 := ULog.Size (msg); -- dynamic dispatching
begin
Put_Line ("Dispatched Tag =" & Ada.Tags.Expanded_Name (msg'Tag));
Put_Line ("Dispatched type=" & msg.Describe_Func); -- this is not dispatching
Put_Line ("Dispatched Size=" & s'Img);
end dispatcher;
-- this procedure applies the parent view (polymorphism)
procedure consume (msg : ULog.Message'Class) is
viewconversion : ULog.Message renames ULog.Message (msg);
-- renaming declaration...not a new object. but a view conversion.
-- why is this better then class-wide?
classwide : ULog.Message'Class := msg;
-- that can dispatch, but every such type needs initialization
-- with specific type
upcast : ULog.Message := ULog.Message (msg); -- not a view conv?
-- looses dispatch functionality (is the tag the same?)
begin
Put_Line ("Original Tag =" & Ada.Tags.Expanded_Name (msg'Tag));
Put_Line ("Original type=" & msg.Describe_Func);
Put_Line ("-----------------");
if ULog.Message'Class (upcast) in ULog.GPS.Message then
Put_Line ("Upcast still is GPS");
else
Put_Line ("Upcast lost its tag");
end if;
declare
tmp : ULog.Message'Class := upcast;
begin
Put_Line ("upcasted Tag =" & Ada.Tags.Expanded_Name (tmp'Tag));
end;
Put_Line ("-----------------");
Put_Line ("viewconversion:");
dispatcher (viewconversion); -- working
Put_Line ("-----------------");
Put_Line ("classwide:");
dispatcher (classwide);
Put_Line ("-----------------"); -- working
Put_Line ("upcast:");
dispatcher (ULog.Message'Class (upcast)); -- not dispatching
end consume;
m2 : Ulog.GPS.Message;
m1 : Ulog.Message;
n : String (1 .. 3);
begin
consume (msg_gps);
m2 := msg_gps.Copy;
m2.Describe_Func(namestring => n); -- dispatching to gps
Ada.Text_IO.Put_Line("I am a " & n);
end main;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY COMPONENTS --
-- --
-- S Y S T E M . C O M P A R E _ A R R A Y _ U N S I G N E D _ 6 4 --
-- --
-- B o d y --
-- --
-- Copyright (C) 2002-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.Address_Operations; use System.Address_Operations;
with Ada.Unchecked_Conversion;
package body System.Compare_Array_Unsigned_64 is
type Word is mod 2 ** 64;
-- Used to process operands by words
type Uword is new Word;
for Uword'Alignment use 1;
-- Used to process operands when unaligned
type WP is access Word;
type UP is access Uword;
function W is new Ada.Unchecked_Conversion (Address, WP);
function U is new Ada.Unchecked_Conversion (Address, UP);
-----------------------
-- Compare_Array_U64 --
-----------------------
function Compare_Array_U64
(Left : System.Address;
Right : System.Address;
Left_Len : Natural;
Right_Len : Natural) return Integer
is
Clen : Natural := Natural'Min (Left_Len, Right_Len);
-- Number of elements left to compare
L : Address := Left;
R : Address := Right;
-- Pointers to next elements to compare
begin
-- Case of going by aligned double words
if ModA (OrA (Left, Right), 8) = 0 then
while Clen /= 0 loop
if W (L).all /= W (R).all then
if W (L).all > W (R).all then
return +1;
else
return -1;
end if;
end if;
Clen := Clen - 1;
L := AddA (L, 8);
R := AddA (R, 8);
end loop;
-- Case of going by unaligned double words
else
while Clen /= 0 loop
if U (L).all /= U (R).all then
if U (L).all > U (R).all then
return +1;
else
return -1;
end if;
end if;
Clen := Clen - 1;
L := AddA (L, 8);
R := AddA (R, 8);
end loop;
end if;
-- Here if common section equal, result decided by lengths
if Left_Len = Right_Len then
return 0;
elsif Left_Len > Right_Len then
return +1;
else
return -1;
end if;
end Compare_Array_U64;
end System.Compare_Array_Unsigned_64;
|
-- Task 2 of RTPL WS17/18
-- Team members: Hannes B. and Gabriel Z.
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Integer_Text_IO;
package body counting with SPARK_Mode is
-- Procedure for option 1
procedure opt1 is
-- Integer values for user input
I1 : Integer := 1;
I2 : Integer := 2;
begin
-- Get user input
Put_Line ("Please input two integers between 1 and 100.");
Put ("First: ");
Ada.Integer_Text_IO.Get (I1);
Put ("Second: ");
Ada.Integer_Text_IO.Get (I2);
-- Call the counting funtion
myCount (myRange'Value (I1'Image), myRange'Value (I2'Image));
exception when others =>
Put_Line ("Exception occured due to incorrect user input.");
Put_Line ("Please start over!");
end opt1;
-- Counting procedure
procedure myCount (start_value : in myRange; end_value : in myRange) is
begin
Put ("Start counting from" & start_value'Image);
Put_Line (" to" & end_value'Image & ":");
-- Start the counting depending on the different cases
if start_value = end_value then
Put_Line (start_value'Image);
elsif start_value < end_value then
for i in start_value .. end_value loop
Put (i'Image);
end loop;
else
for i in reverse end_value .. start_value loop
Put (i'Image);
end loop;
end if;
end myCount;
end counting;
|
-- This package is intended to set up and tear down the test environment.
-- Once created by GNATtest, this package will never be overwritten
-- automatically. Contents of this package can be modified in any way
-- except for sections surrounded by a 'read only' marker.
with AUnit.Test_Fixtures;
package Messages.Test_Data is
-- begin read only
type Test is new AUnit.Test_Fixtures.Test_Fixture
-- end read only
with null record;
procedure Set_Up(Gnattest_T: in out Test);
procedure Tear_Down(Gnattest_T: in out Test);
end Messages.Test_Data;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUNTIME COMPONENTS --
-- --
-- A D A . T E X T _ I O . T E X T _ S T R E A M S --
-- --
-- S p e c --
-- --
-- $Revision$
-- --
-- This specification is adapted from the Ada Reference Manual for use with --
-- GNAT. In accordance with the copyright of that document, you can freely --
-- copy and modify this specification, provided that if you redistribute a --
-- modified version, any changes that you have made are clearly indicated. --
-- --
------------------------------------------------------------------------------
with Ada.Streams;
package Ada.Text_IO.Text_Streams is
type Stream_Access is access all Streams.Root_Stream_Type'Class;
function Stream (File : in File_Type) return Stream_Access;
end Ada.Text_IO.Text_Streams;
|
with
FLTK.Images.RGB,
FLTK.Images.Shared,
FLTK.Widgets.Groups.Windows;
package FLTK.Devices.Surfaces.Image is
type Image_Surface is new Surface_Device with private;
type Image_Surface_Reference (Data : not null access Image_Surface'Class) is
limited null record with Implicit_Dereference => Data;
package Forge is
function Create
(W, H : in Integer;
Highres : in Boolean := False)
return Image_Surface;
end Forge;
function Is_Highres
(This : in Image_Surface)
return Boolean;
procedure Draw_Widget
(This : in out Image_Surface;
Item : in FLTK.Widgets.Widget'Class;
Offset_X, Offset_Y : in Integer := 0);
procedure Draw_Decorated_Window
(This : in out Image_Surface;
Item : in FLTK.Widgets.Groups.Windows.Window'Class;
Offset_X, Offset_Y : in Integer := 0);
function Get_Image
(This : in Image_Surface)
return FLTK.Images.RGB.RGB_Image;
function Get_Highres_Image
(This : in Image_Surface)
return FLTK.Images.Shared.Shared_Image;
procedure Set_Current
(This : in out Image_Surface);
private
type Image_Surface is new Surface_Device with record
High : Boolean := False;
end record;
overriding procedure Finalize
(This : in out Image_Surface);
pragma Inline (Is_Highres);
pragma Inline (Draw_Widget);
pragma Inline (Draw_Decorated_Window);
pragma Inline (Get_Image);
pragma Inline (Get_Highres_Image);
pragma Inline (Set_Current);
end FLTK.Devices.Surfaces.Image;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . T E X T _ I O . G E N E R I C _ A U X --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2014, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Interfaces.C_Streams; use Interfaces.C_Streams;
with System.File_IO;
with System.File_Control_Block;
package body Ada.Text_IO.Generic_Aux is
package FIO renames System.File_IO;
package FCB renames System.File_Control_Block;
subtype AP is FCB.AFCB_Ptr;
------------------------
-- Check_End_Of_Field --
------------------------
procedure Check_End_Of_Field
(Buf : String;
Stop : Integer;
Ptr : Integer;
Width : Field)
is
begin
if Ptr > Stop then
return;
elsif Width = 0 then
raise Data_Error;
else
for J in Ptr .. Stop loop
if not Is_Blank (Buf (J)) then
raise Data_Error;
end if;
end loop;
end if;
end Check_End_Of_Field;
-----------------------
-- Check_On_One_Line --
-----------------------
procedure Check_On_One_Line
(File : File_Type;
Length : Integer)
is
begin
FIO.Check_Write_Status (AP (File));
if File.Line_Length /= 0 then
if Count (Length) > File.Line_Length then
raise Layout_Error;
elsif File.Col + Count (Length) > File.Line_Length + 1 then
New_Line (File);
end if;
end if;
end Check_On_One_Line;
----------
-- Getc --
----------
function Getc (File : File_Type) return int is
ch : int;
begin
ch := fgetc (File.Stream);
if ch = EOF and then ferror (File.Stream) /= 0 then
raise Device_Error;
else
return ch;
end if;
end Getc;
--------------
-- Is_Blank --
--------------
function Is_Blank (C : Character) return Boolean is
begin
return C = ' ' or else C = ASCII.HT;
end Is_Blank;
----------
-- Load --
----------
procedure Load
(File : File_Type;
Buf : out String;
Ptr : in out Integer;
Char : Character;
Loaded : out Boolean)
is
ch : int;
begin
ch := Getc (File);
if ch = Character'Pos (Char) then
Store_Char (File, ch, Buf, Ptr);
Loaded := True;
else
Ungetc (ch, File);
Loaded := False;
end if;
end Load;
procedure Load
(File : File_Type;
Buf : out String;
Ptr : in out Integer;
Char : Character)
is
ch : int;
begin
ch := Getc (File);
if ch = Character'Pos (Char) then
Store_Char (File, ch, Buf, Ptr);
else
Ungetc (ch, File);
end if;
end Load;
procedure Load
(File : File_Type;
Buf : out String;
Ptr : in out Integer;
Char1 : Character;
Char2 : Character;
Loaded : out Boolean)
is
ch : int;
begin
ch := Getc (File);
if ch = Character'Pos (Char1) or else ch = Character'Pos (Char2) then
Store_Char (File, ch, Buf, Ptr);
Loaded := True;
else
Ungetc (ch, File);
Loaded := False;
end if;
end Load;
procedure Load
(File : File_Type;
Buf : out String;
Ptr : in out Integer;
Char1 : Character;
Char2 : Character)
is
ch : int;
begin
ch := Getc (File);
if ch = Character'Pos (Char1) or else ch = Character'Pos (Char2) then
Store_Char (File, ch, Buf, Ptr);
else
Ungetc (ch, File);
end if;
end Load;
-----------------
-- Load_Digits --
-----------------
procedure Load_Digits
(File : File_Type;
Buf : out String;
Ptr : in out Integer;
Loaded : out Boolean)
is
ch : int;
After_Digit : Boolean;
begin
ch := Getc (File);
if ch not in Character'Pos ('0') .. Character'Pos ('9') then
Loaded := False;
else
Loaded := True;
After_Digit := True;
loop
Store_Char (File, ch, Buf, Ptr);
ch := Getc (File);
if ch in Character'Pos ('0') .. Character'Pos ('9') then
After_Digit := True;
elsif ch = Character'Pos ('_') and then After_Digit then
After_Digit := False;
else
exit;
end if;
end loop;
end if;
Ungetc (ch, File);
end Load_Digits;
procedure Load_Digits
(File : File_Type;
Buf : out String;
Ptr : in out Integer)
is
ch : int;
After_Digit : Boolean;
begin
ch := Getc (File);
if ch in Character'Pos ('0') .. Character'Pos ('9') then
After_Digit := True;
loop
Store_Char (File, ch, Buf, Ptr);
ch := Getc (File);
if ch in Character'Pos ('0') .. Character'Pos ('9') then
After_Digit := True;
elsif ch = Character'Pos ('_') and then After_Digit then
After_Digit := False;
else
exit;
end if;
end loop;
end if;
Ungetc (ch, File);
end Load_Digits;
--------------------------
-- Load_Extended_Digits --
--------------------------
procedure Load_Extended_Digits
(File : File_Type;
Buf : out String;
Ptr : in out Integer;
Loaded : out Boolean)
is
ch : int;
After_Digit : Boolean := False;
begin
Loaded := False;
loop
ch := Getc (File);
if ch in Character'Pos ('0') .. Character'Pos ('9')
or else
ch in Character'Pos ('a') .. Character'Pos ('f')
or else
ch in Character'Pos ('A') .. Character'Pos ('F')
then
After_Digit := True;
elsif ch = Character'Pos ('_') and then After_Digit then
After_Digit := False;
else
exit;
end if;
Store_Char (File, ch, Buf, Ptr);
Loaded := True;
end loop;
Ungetc (ch, File);
end Load_Extended_Digits;
procedure Load_Extended_Digits
(File : File_Type;
Buf : out String;
Ptr : in out Integer)
is
Junk : Boolean;
pragma Unreferenced (Junk);
begin
Load_Extended_Digits (File, Buf, Ptr, Junk);
end Load_Extended_Digits;
---------------
-- Load_Skip --
---------------
procedure Load_Skip (File : File_Type) is
C : Character;
begin
FIO.Check_Read_Status (AP (File));
-- Loop till we find a non-blank character (note that as usual in
-- Text_IO, blank includes horizontal tab). Note that Get deals with
-- the Before_LM and Before_LM_PM flags appropriately.
loop
Get (File, C);
exit when not Is_Blank (C);
end loop;
Ungetc (Character'Pos (C), File);
File.Col := File.Col - 1;
end Load_Skip;
----------------
-- Load_Width --
----------------
procedure Load_Width
(File : File_Type;
Width : Field;
Buf : out String;
Ptr : in out Integer)
is
ch : int;
begin
FIO.Check_Read_Status (AP (File));
-- If we are immediately before a line mark, then we have no characters.
-- This is always a data error, so we may as well raise it right away.
if File.Before_LM then
raise Data_Error;
else
for J in 1 .. Width loop
ch := Getc (File);
if ch = EOF then
return;
elsif ch = LM then
Ungetc (ch, File);
return;
else
Store_Char (File, ch, Buf, Ptr);
end if;
end loop;
end if;
end Load_Width;
-----------
-- Nextc --
-----------
function Nextc (File : File_Type) return int is
ch : int;
begin
ch := fgetc (File.Stream);
if ch = EOF then
if ferror (File.Stream) /= 0 then
raise Device_Error;
else
return EOF;
end if;
else
Ungetc (ch, File);
return ch;
end if;
end Nextc;
--------------
-- Put_Item --
--------------
procedure Put_Item (File : File_Type; Str : String) is
begin
Check_On_One_Line (File, Str'Length);
Put (File, Str);
end Put_Item;
----------------
-- Store_Char --
----------------
procedure Store_Char
(File : File_Type;
ch : int;
Buf : in out String;
Ptr : in out Integer)
is
begin
File.Col := File.Col + 1;
if Ptr < Buf'Last then
Ptr := Ptr + 1;
end if;
Buf (Ptr) := Character'Val (ch);
end Store_Char;
-----------------
-- String_Skip --
-----------------
procedure String_Skip (Str : String; Ptr : out Integer) is
begin
-- Routines calling String_Skip malfunction if Str'Last = Positive'Last.
-- It's too much trouble to make this silly case work, so we just raise
-- Program_Error with an appropriate message. We raise Program_Error
-- rather than Constraint_Error because we don't want this case to be
-- converted to Data_Error.
if Str'Last = Positive'Last then
raise Program_Error with
"string upper bound is Positive'Last, not supported";
end if;
-- Normal case where Str'Last < Positive'Last
Ptr := Str'First;
loop
if Ptr > Str'Last then
raise End_Error;
elsif not Is_Blank (Str (Ptr)) then
return;
else
Ptr := Ptr + 1;
end if;
end loop;
end String_Skip;
------------
-- Ungetc --
------------
procedure Ungetc (ch : int; File : File_Type) is
begin
if ch /= EOF then
if ungetc (ch, File.Stream) = EOF then
raise Device_Error;
end if;
end if;
end Ungetc;
end Ada.Text_IO.Generic_Aux;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . F A T _ G E N --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2009 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This generic package provides a target independent implementation of the
-- floating-point attributes that denote functions. The implementations here
-- are portable, but very slow. The runtime contains a set of instantiations
-- of this package for all predefined floating-point types, and these should
-- be replaced by efficient assembly language code where possible.
generic
type T is digits <>;
package System.Fat_Gen is
pragma Pure;
subtype UI is Integer;
-- The runtime representation of universal integer for the purposes of
-- this package is integer. The expander generates conversions for the
-- actual type used. For functions returning universal integer, there
-- is no problem, since the result always is in range of integer. For
-- input arguments, the expander has to do some special casing to deal
-- with the (very annoying!) cases of out of range values. If we used
-- Long_Long_Integer to represent universal, then there would be no
-- problem, but the resulting inefficiency would be annoying.
function Adjacent (X, Towards : T) return T;
function Ceiling (X : T) return T;
function Compose (Fraction : T; Exponent : UI) return T;
function Copy_Sign (Value, Sign : T) return T;
function Exponent (X : T) return UI;
function Floor (X : T) return T;
function Fraction (X : T) return T;
function Leading_Part (X : T; Radix_Digits : UI) return T;
function Machine (X : T) return T;
function Machine_Rounding (X : T) return T;
function Model (X : T) return T;
function Pred (X : T) return T;
function Remainder (X, Y : T) return T;
function Rounding (X : T) return T;
function Scaling (X : T; Adjustment : UI) return T;
function Succ (X : T) return T;
function Truncation (X : T) return T;
function Unbiased_Rounding (X : T) return T;
function Valid (X : not null access T) return Boolean;
-- This function checks if the object of type T referenced by X
-- is valid, and returns True/False accordingly. The parameter is
-- passed by reference (access) here, as the object of type T may
-- be an abnormal value that cannot be passed in a floating-point
-- register, and the whole point of 'Valid is to prevent exceptions.
-- Note that the object of type T must have the natural alignment
-- for type T. See Unaligned_Valid for further discussion.
--
-- Note: this routine does not work for Vax_Float ???
function Unaligned_Valid (A : System.Address) return Boolean;
-- This version of Valid is used if the floating-point value to
-- be checked is not known to be aligned (for example it appears
-- in a packed record). In this case, we cannot call Valid since
-- Valid assumes proper full alignment. Instead Unaligned_Valid
-- performs the same processing for a possibly unaligned float,
-- by first doing a copy and then calling Valid. One might think
-- that the front end could simply do a copy to an aligned temp,
-- but remember that we may have an abnormal value that cannot
-- be copied into a floating-point register, so things are a bit
-- trickier than one might expect.
--
-- Note: Unaligned_Valid is never called for a target which does
-- not require strict alignment (e.g. the ia32/x86), since on a
-- target not requiring strict alignment, it is fine to pass a
-- non-aligned value to the standard Valid routine.
--
-- Note: this routine does not work for Vax_Float ???
private
pragma Inline (Machine);
pragma Inline (Model);
-- Note: previously the validity checking subprograms (Unaligned_Valid and
-- Valid) were also inlined, but this was changed since there were some
-- problems with this inlining in optimized mode, and in any case it seems
-- better to avoid this inlining (space and robustness considerations).
end System.Fat_Gen;
|
-- { dg-do compile }
with Incomplete4_Pkg; use Incomplete4_Pkg;
with System;
procedure Incomplete4 is
L : System.Address := A'Address;
begin
null;
end;
|
------------------------------------------------------------------------------
-- --
-- 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.
------------------------------------------------------------------------------
-- A named element supports using a string expression to specify its name.
-- This allows names of model elements to involve template parameters. The
-- actual name is evaluated from the string expression only when it is
-- sensible to do so (e.g., when a template is bound).
--
-- A named element is an element in a model that may have a name.
------------------------------------------------------------------------------
limited with AMF.UML.Dependencies.Collections;
with AMF.UML.Elements;
limited with AMF.UML.Namespaces.Collections;
limited with AMF.UML.Packages.Collections;
limited with AMF.UML.String_Expressions;
with League.Strings;
package AMF.UML.Named_Elements is
pragma Preelaborate;
type UML_Named_Element is limited interface
and AMF.UML.Elements.UML_Element;
type UML_Named_Element_Access is
access all UML_Named_Element'Class;
for UML_Named_Element_Access'Storage_Size use 0;
not overriding function Get_Client_Dependency
(Self : not null access constant UML_Named_Element)
return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency is abstract;
-- Getter of NamedElement::clientDependency.
--
-- Indicates the dependencies that reference the client.
not overriding function Get_Name
(Self : not null access constant UML_Named_Element)
return AMF.Optional_String is abstract;
-- Getter of NamedElement::name.
--
-- The name of the NamedElement.
not overriding procedure Set_Name
(Self : not null access UML_Named_Element;
To : AMF.Optional_String) is abstract;
-- Setter of NamedElement::name.
--
-- The name of the NamedElement.
not overriding function Get_Name_Expression
(Self : not null access constant UML_Named_Element)
return AMF.UML.String_Expressions.UML_String_Expression_Access is abstract;
-- Getter of NamedElement::nameExpression.
--
-- The string expression used to define the name of this named element.
not overriding procedure Set_Name_Expression
(Self : not null access UML_Named_Element;
To : AMF.UML.String_Expressions.UML_String_Expression_Access) is abstract;
-- Setter of NamedElement::nameExpression.
--
-- The string expression used to define the name of this named element.
not overriding function Get_Namespace
(Self : not null access constant UML_Named_Element)
return AMF.UML.Namespaces.UML_Namespace_Access is abstract;
-- Getter of NamedElement::namespace.
--
-- Specifies the namespace that owns the NamedElement.
not overriding function Get_Qualified_Name
(Self : not null access constant UML_Named_Element)
return AMF.Optional_String is abstract;
-- 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.
not overriding function Get_Visibility
(Self : not null access constant UML_Named_Element)
return AMF.UML.Optional_UML_Visibility_Kind is abstract;
-- Getter of NamedElement::visibility.
--
-- Determines where the NamedElement appears within different Namespaces
-- within the overall model, and its accessibility.
not overriding procedure Set_Visibility
(Self : not null access UML_Named_Element;
To : AMF.UML.Optional_UML_Visibility_Kind) is abstract;
-- Setter of NamedElement::visibility.
--
-- Determines where the NamedElement appears within different Namespaces
-- within the overall model, and its accessibility.
not overriding function All_Namespaces
(Self : not null access constant UML_Named_Element)
return AMF.UML.Namespaces.Collections.Ordered_Set_Of_UML_Namespace is abstract;
-- Operation NamedElement::allNamespaces.
--
-- The query allNamespaces() gives the sequence of namespaces in which the
-- NamedElement is nested, working outwards.
not overriding function All_Owning_Packages
(Self : not null access constant UML_Named_Element)
return AMF.UML.Packages.Collections.Set_Of_UML_Package is abstract;
-- Operation NamedElement::allOwningPackages.
--
-- The query allOwningPackages() returns all the directly or indirectly
-- owning packages.
not overriding function Is_Distinguishable_From
(Self : not null access constant UML_Named_Element;
N : AMF.UML.Named_Elements.UML_Named_Element_Access;
Ns : AMF.UML.Namespaces.UML_Namespace_Access)
return Boolean is abstract;
-- 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.
not overriding function Namespace
(Self : not null access constant UML_Named_Element)
return AMF.UML.Namespaces.UML_Namespace_Access is abstract;
-- Operation NamedElement::namespace.
--
-- Missing derivation for NamedElement::/namespace : Namespace
not overriding function Qualified_Name
(Self : not null access constant UML_Named_Element)
return League.Strings.Universal_String is abstract;
-- Operation NamedElement::qualifiedName.
--
-- When there is a name, and all of the containing namespaces have a name,
-- the qualified name is constructed from the names of the containing
-- namespaces.
not overriding function Separator
(Self : not null access constant UML_Named_Element)
return League.Strings.Universal_String is abstract;
-- Operation NamedElement::separator.
--
-- The query separator() gives the string that is used to separate names
-- when constructing a qualified name.
end AMF.UML.Named_Elements;
|
-- Copyright 2008, 2009, 2010, 2011 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package Pck is
My_Global_Variable : Integer := 1;
Exported_Capitalized : Integer := 2;
pragma Export (C, Exported_Capitalized, "Exported_Capitalized");
Local_Identical_One : Integer := 4;
Local_Identical_Two : Integer := 8;
External_Identical_One : Integer := 19;
package Inner is
Inside_Variable : Integer := 3;
end Inner;
procedure Proc (I : Integer);
end Pck;
|
------------------------------------------------------------------------------
-- AGAR CORE LIBRARY --
-- A G A R . E V E N T --
-- B o d y --
-- --
-- Copyright (c) 2018-2019, Julien Nadeau Carriere (vedge@csoft.net) --
-- Copyright (c) 2010, coreland (mark@coreland.ath.cx) --
-- --
-- Permission to use, copy, modify, and/or distribute this software for any --
-- purpose with or without fee is hereby granted, provided that the above --
-- copyright notice and this permission notice appear in all copies. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES --
-- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF --
-- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR --
-- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES --
-- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN --
-- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF --
-- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. --
------------------------------------------------------------------------------
package body Agar.Event is
----------------------------------
-- Push a tagged Event Argument --
----------------------------------
procedure Push_Address
(Event : in Event_Not_Null_Access;
Name : in String;
Value : in System.Address)
is
Ch_Name : aliased C.char_array := C.To_C(Name);
begin
ag_event_push_pointer
(Event => Event,
Name => CS.To_Chars_Ptr(Ch_Name'Unchecked_Access),
Value => Value);
end Push_Address;
procedure Push_Access
(Event : in Event_Not_Null_Access;
Name : in String;
Value : in Element_Access_Type) is
begin
Push_Address
(Event => Event,
Name => Name,
Value => Value.all'Address);
end Push_Access;
procedure Push_String
(Event : in Event_Not_Null_Access;
Name : in String;
Value : in String)
is
Ch_Name : aliased C.char_array := C.To_C(Name);
Ch_Value : aliased C.char_array := C.To_C(Value);
begin
ag_event_push_string
(Event => Event,
Name => CS.To_Chars_Ptr(Ch_Name'Unchecked_Access),
Value => CS.To_Chars_Ptr(Ch_Value'Unchecked_Access));
end Push_String;
procedure Push_Integer
(Event : in Event_Not_Null_Access;
Name : in String;
Value : in Integer)
is
Ch_Name : aliased C.char_array := C.To_C(Name);
begin
ag_event_push_int
(Event => Event,
Name => CS.To_Chars_Ptr(Ch_Name'Unchecked_Access),
Value => C.int(Value));
end Push_Integer;
procedure Push_Natural
(Event : in Event_Not_Null_Access;
Name : in String;
Value : in Natural)
is
Ch_Name : aliased C.char_array := C.To_C(Name);
begin
ag_event_push_uint
(Event => Event,
Name => CS.To_Chars_Ptr(Ch_Name'Unchecked_Access),
Value => C.unsigned (Value));
end Push_Natural;
procedure Push_Long_Integer
(Event : in Event_Not_Null_Access;
Name : in String;
Value : in Long_Integer)
is
Ch_Name : aliased C.char_array := C.To_C(Name);
begin
ag_event_push_long
(Event => Event,
Name => CS.To_Chars_Ptr(Ch_Name'Unchecked_Access),
Value => C.long (Value));
end Push_Long_Integer;
#if HAVE_FLOAT
procedure Push_Float
(Event : in Event_Not_Null_Access;
Name : in String;
Value : in Float)
is
Ch_Name : aliased C.char_array := C.To_C(Name);
begin
ag_event_push_float
(Event => Event,
Name => CS.To_Chars_Ptr(Ch_Name'Unchecked_Access),
Value => C.C_float (Value));
end Push_Float;
procedure Push_Long_Float
(Event : in Event_Not_Null_Access;
Name : in String;
Value : in Long_Float)
is
Ch_Name : aliased C.char_array := C.To_C(Name);
begin
ag_event_push_double
(Event => Event,
Name => CS.To_Chars_Ptr(Ch_Name'Unchecked_Access),
Value => C.double(Value));
end Push_Long_Float;
# if HAVE_LONG_DOUBLE
procedure Push_Long_Long_Float
(Event : in Event_Not_Null_Access;
Name : in String;
Value : in Long_Long_Float)
is
Ch_Name : aliased C.char_array := C.To_C(Name);
begin
ag_event_push_long_double
(Event => Event,
Name => CS.To_Chars_Ptr(Ch_Name'Unchecked_Access),
Value => C.long_double(Value));
end Push_Long_Long_Float;
# end if;
#end if;
-------------------------------------
-- Push an untagged Event argument --
-------------------------------------
procedure Push_Address
(Event : in Event_Not_Null_Access;
Value : in System.Address)
is begin
ag_event_push_pointer
(Event => Event,
Name => CS.Null_Ptr,
Value => Value);
end Push_Address;
procedure Push_String
(Event : in Event_Not_Null_Access;
Value : in String)
is
Ch_Value : aliased C.char_array := C.To_C(Value);
begin
ag_event_push_string
(Event => Event,
Name => CS.Null_Ptr,
Value => CS.To_Chars_Ptr(Ch_Value'Unchecked_Access));
end Push_String;
procedure Push_Integer
(Event : in Event_Not_Null_Access;
Value : in Integer)
is begin
ag_event_push_int
(Event => Event,
Name => CS.Null_Ptr,
Value => C.int(Value));
end Push_Integer;
procedure Push_Natural
(Event : in Event_Not_Null_Access;
Value : in Natural)
is begin
ag_event_push_uint
(Event => Event,
Name => CS.Null_Ptr,
Value => C.unsigned(Value));
end Push_Natural;
procedure Push_Long_Integer
(Event : in Event_Not_Null_Access;
Value : in Long_Integer)
is begin
ag_event_push_long
(Event => Event,
Name => CS.Null_Ptr,
Value => C.long (Value));
end Push_Long_Integer;
#if HAVE_FLOAT
procedure Push_Float
(Event : in Event_Not_Null_Access;
Value : in Float)
is begin
ag_event_push_float
(Event => Event,
Name => CS.Null_Ptr,
Value => C.C_float (Value));
end Push_Float;
procedure Push_Long_Float
(Event : in Event_Not_Null_Access;
Value : in Long_Float)
is begin
ag_event_push_double
(Event => Event,
Name => CS.Null_Ptr,
Value => C.double(Value));
end Push_Long_Float;
# if HAVE_LONG_DOUBLE
procedure Push_Long_Long_Float
(Event : in Event_Not_Null_Access;
Value : in Long_Long_Float)
is begin
ag_event_push_long_double
(Event => Event,
Name => CS.Null_Ptr,
Value => C.long_double(Value));
end Push_Long_Long_Float;
# end if;
#end if;
------------------------------------
-- Pop an untagged Event Argument --
------------------------------------
function Pop_Address
(Event : in Event_Not_Null_Access) return System.Address
is begin
return ag_event_pop_pointer (Event => Event);
end Pop_Address;
----------------------------
-- Extract Event Argument --
----------------------------
function Get_Address
(Event : in Event_Not_Null_Access;
Index : in Natural) return System.Address
is begin
return ag_event_get_ptr
(Event => Event,
Index => C.unsigned(Index));
end Get_Address;
function Get_Address
(Event : in Event_Not_Null_Access;
Name : in String) return System.Address
is
Ch_Name : aliased C.char_array := C.To_C(Name);
begin
return ag_event_get_ptr_named
(Event => Event,
Name => CS.To_Chars_Ptr(Ch_Name'Unchecked_Access));
end Get_Address;
function Get_String
(Event : in Event_Not_Null_Access;
Index : in Natural) return String
is
Result : CS.chars_ptr;
begin
Result := ag_event_get_string
(Event => Event,
Index => C.unsigned(Index));
return C.To_Ada (CS.Value(Result));
end Get_String;
function Get_String
(Event : in Event_Not_Null_Access;
Name : in String) return String
is
Ch_Name : aliased C.char_array := C.To_C(Name);
Result : CS.chars_ptr;
begin
Result := ag_event_get_string_named
(Event => Event,
Name => CS.To_Chars_Ptr(Ch_Name'Unchecked_Access));
return C.To_Ada(CS.Value(Result));
end Get_String;
function Get_Integer
(Event : in Event_Not_Null_Access;
Index : in Natural) return Integer
is begin
return Integer
(ag_event_get_int
(Event => Event,
Index => C.unsigned(Index)));
end Get_Integer;
function Get_Integer
(Event : in Event_Not_Null_Access;
Name : in String) return Integer
is
Ch_Name : aliased C.char_array := C.To_C(Name);
begin
return Integer
(ag_event_get_int_named
(Event => Event,
Name => CS.To_Chars_Ptr(Ch_Name'Unchecked_Access)));
end Get_Integer;
function Get_Natural
(Event : in Event_Not_Null_Access;
Index : in Natural) return Natural
is begin
return Natural
(ag_event_get_uint
(Event => Event,
Index => C.unsigned(Index)));
end Get_Natural;
function Get_Natural
(Event : in Event_Not_Null_Access;
Name : in String) return Natural
is
Ch_Name : aliased C.char_array := C.To_C(Name);
begin
return Natural
(ag_event_get_uint_named
(Event => Event,
Name => CS.To_Chars_Ptr(Ch_Name'Unchecked_Access)));
end Get_Natural;
function Get_Long_Integer
(Event : in Event_Not_Null_Access;
Index : in Natural) return Long_Integer
is begin
return Long_Integer
(ag_event_get_long
(Event => Event,
Index => C.unsigned(Index)));
end Get_Long_Integer;
function Get_Long_Integer
(Event : in Event_Not_Null_Access;
Name : in String) return Long_Integer
is
Ch_Name : aliased C.char_array := C.To_C(Name);
begin
return Long_Integer
(ag_event_get_long_named
(Event => Event,
Name => CS.To_Chars_Ptr(Ch_Name'Unchecked_Access)));
end Get_Long_Integer;
#if HAVE_FLOAT
function Get_Float
(Event : in Event_Not_Null_Access;
Index : in Natural) return Float
is begin
return Float
(ag_event_get_float
(Event => Event,
Index => C.unsigned(Index)));
end Get_Float;
function Get_Float
(Event : in Event_Not_Null_Access;
Name : in String) return Float
is
Ch_Name : aliased C.char_array := C.To_C(Name);
begin
return Float
(ag_event_get_float_named
(Event => Event,
Name => CS.To_Chars_Ptr(Ch_Name'Unchecked_Access)));
end Get_Float;
function Get_Long_Float
(Event : in Event_Not_Null_Access;
Index : in Natural) return Long_Float
is begin
return Long_Float
(ag_event_get_double
(Event => Event,
Index => C.unsigned(Index)));
end Get_Long_Float;
function Get_Long_Float
(Event : in Event_Not_Null_Access;
Name : in String) return Long_Float
is
Ch_Name : aliased C.char_array := C.To_C(Name);
begin
return Long_Float
(ag_event_get_double_named
(Event => Event,
Name => CS.To_Chars_Ptr(Ch_Name'Unchecked_Access)));
end Get_Long_Float;
# if HAVE_LONG_DOUBLE
function Get_Long_Long_Float
(Event : in Event_Not_Null_Access;
Index : in Natural) return Long_Long_Float
is begin
return Long_Long_Float
(ag_event_get_long_double
(Event => Event,
Index => C.unsigned(Index)));
end Get_Long_Long_Float;
function Get_Long_Long_Float
(Event : in Event_Not_Null_Access;
Name : in String) return Long_Long_Float
is
Ch_Name : aliased C.char_array := C.To_C(Name);
begin
return Long_Long_Float
(ag_event_get_long_double_named
(Event => Event,
Name => CS.To_Chars_Ptr(Ch_Name'Unchecked_Access)));
end Get_Long_Long_Float;
# end if;
#end if;
end Agar.Event;
|
-- { dg-do link }
with Array23_Pkg1;
with Array23_Pkg2;
procedure Array23 is
A : Array23_Pkg1.Arr;
begin
A(Array23_Pkg2.One)(1) := 0;
end;
|
-- Minimum package providing support for Unit testing
package Test_Assertions is
Test_Assertion_Error : exception;
procedure Assert_True (Value : Boolean);
-- Raises Assertion_Error when Value is False
procedure Assert_False (Value : Boolean);
-- Raises Assertion_Error when Value is True
procedure Assert_True (Value : Boolean; Message : String);
-- Outputs Message and displays OK when Value is True.
procedure Assert_False (Value : Boolean; Message : String);
-- Outputs Message and displays OK when Value is False.
end Test_Assertions;
|
------------------------------------------------------------------------------
-- Copyright (c) 2015-2019, 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.Characters.Handling;
with Ada.Strings.Fixed;
package body Natools.S_Expressions.Enumeration_IO is
function To_Atom (Enumeration_Image : in String) return Atom is
Result : Atom := S_Expressions.To_Atom (Ada.Strings.Fixed.Translate
(Enumeration_Image,
Ada.Characters.Handling.To_Lower'Access));
begin
for I in Result'Range loop
if Result (I) = Character'Pos ('_') then
Result (I) := Character'Pos ('-');
end if;
end loop;
return Result;
end To_Atom;
function To_Image (Data : in Atom) return String is
Result : String := Ada.Strings.Fixed.Translate
(To_String (Data),
Ada.Characters.Handling.To_Upper'Access);
begin
for I in Result'Range loop
if Result (I) = '-' then
Result (I) := '_';
end if;
end loop;
return Result;
end To_Image;
package body Typed_IO is
function Image (T : Enum) return Atom is
begin
return To_Atom (Enum'Image (T));
end Image;
function Value (Data : Atom) return Enum is
begin
return Enum'Value (To_Image (Data));
end Value;
function Value (Data : Atom; Fallback : Enum) return Enum is
Img : constant String := To_Image (Data);
begin
return Enum'Value (Img);
exception
when Constraint_Error =>
return Fallback;
end Value;
end Typed_IO;
end Natools.S_Expressions.Enumeration_IO;
|
-- POK header
--
-- The following file is a part of the POK project. Any modification should
-- be made according to the POK licence. You CANNOT use this file or a part
-- of a file for your own project.
--
-- For more information on the POK licence, please see our LICENCE FILE
--
-- Please follow the coding guidelines described in doc/CODING_GUIDELINES
--
-- Copyright (c) 2007-2021 POK team
-- ---------------------------------------------------------------------------
-- --
-- ERROR constant and type definitions and management services --
-- --
-- ---------------------------------------------------------------------------
with APEX.Processes;
package APEX.Health_Monitoring is
Max_Error_Message_Size : constant := 64;
subtype Error_Message_Size_Type is APEX_Integer range
1 .. Max_Error_Message_Size;
type Error_Message_Type is
array (Error_Message_Size_Type) of APEX_Byte;
type Error_Code_Type is (
Deadline_Missed,
Application_Error,
Numeric_Error,
Illegal_Request,
Stack_Overflow,
Memory_Violation,
Hardware_Fault,
Power_Fail);
type Error_Status_Type is record
Error_Code : Error_Code_Type;
Length : Error_Message_Size_Type;
Failed_Process_Id : APEX.Processes.Process_Id_Type;
Failed_Address : System_Address_Type;
Message : Error_Message_Type;
end record;
procedure Report_Application_Message
(Message_Addr : in Message_Addr_Type;
Length : in Message_Size_Type;
Return_Code : out Return_Code_Type);
procedure Create_Error_Handler
(Entry_Point : in System_Address_Type;
Stack_Size : in APEX.Processes.Stack_Size_Type;
Return_Code : out Return_Code_Type);
procedure Get_Error_Status
(Error_Status : out Error_Status_Type;
Return_Code : out Return_Code_Type);
procedure Raise_Application_Error
(Error_Code : in Error_Code_Type;
Message_Addr : in Message_Addr_Type;
Length : in Error_Message_Size_Type;
Return_Code : out Return_Code_Type);
private
pragma Convention (C, Error_Code_Type);
pragma Convention (C, Error_Status_Type);
end APEX.Health_Monitoring;
|
with Pulse_Simple_H; use Pulse_Simple_H;
with Pulse_Sample_H; use Pulse_Sample_H;
with Pulse_Def_H; use Pulse_Def_H;
with Interfaces.C.Strings; use Interfaces.C.Strings, Interfaces.C;
with Ada.Text_IO; use Ada.Text_IO;
procedure Pulsada_Test.Main is
pragma Linker_Options ("-lpulse");
pragma Linker_Options ("-lpulse-simple");
type Buffer_Type is array (Positive range <>) of Interfaces.Integer_16;
pragma Convention (C, Buffer_Type);
X : aliased Pa_Sample_Spec := Pa_Sample_Spec'(Format => PA_SAMPLE_S16LE,
Rate => 44100,
Channels => 1);
S : Pa_Simple_Access := null;
Err : aliased Int;
Buf : aliased Buffer_Type (1 .. 44100);
begin
S := Pa_Simple_New (Server => Null_Ptr,
Name => New_String ("prova"),
Dir => PA_STREAM_RECORD,
Dev => Null_Ptr,
Stream_Name => New_String ("record"),
Ss => X'Access,
Map => null,
Attr => null,
Error => Err'Access);
if S = null then
Put_Line (Standard_Error, "Errore: " & Value (Pa_Strerror (Err)));
return;
else
Put_Line (Standard_Error, "OK");
end if;
for N in 1 .. 4 loop
if Pa_Simple_Read (S => S,
Data => Buf'Address,
Bytes => Buf'Size / 8,
Error => Err'Access) < 0
then
Put_Line (Standard_Error, "Errore in read: " & Value (Pa_Strerror (Err)));
else
Put_Line (Standard_Error, "OK");
for K in Buf'Range loop
Put_Line (Buf (K)'Img);
end loop;
end if;
end loop;
end Pulsada_Test.Main;
|
------------------------------------------------------------------------------
-- --
-- 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.
------------------------------------------------------------------------------
-- An opaque expression is an uninterpreted textual statement that denotes a
-- (possibly empty) set of values when evaluated in a context.
--
-- Provides a mechanism for precisely defining the behavior of an opaque
-- expression. An opaque expression is defined by a behavior restricted to
-- return one result.
------------------------------------------------------------------------------
with AMF.String_Collections;
limited with AMF.UML.Behaviors;
limited with AMF.UML.Parameters;
with AMF.UML.Value_Specifications;
package AMF.UML.Opaque_Expressions is
pragma Preelaborate;
type UML_Opaque_Expression is limited interface
and AMF.UML.Value_Specifications.UML_Value_Specification;
type UML_Opaque_Expression_Access is
access all UML_Opaque_Expression'Class;
for UML_Opaque_Expression_Access'Storage_Size use 0;
not overriding function Get_Behavior
(Self : not null access constant UML_Opaque_Expression)
return AMF.UML.Behaviors.UML_Behavior_Access is abstract;
-- Getter of OpaqueExpression::behavior.
--
-- Specifies the behavior of the opaque expression.
not overriding procedure Set_Behavior
(Self : not null access UML_Opaque_Expression;
To : AMF.UML.Behaviors.UML_Behavior_Access) is abstract;
-- Setter of OpaqueExpression::behavior.
--
-- Specifies the behavior of the opaque expression.
not overriding function Get_Body
(Self : not null access constant UML_Opaque_Expression)
return AMF.String_Collections.Sequence_Of_String is abstract;
-- Getter of OpaqueExpression::body.
--
-- The text of the expression, possibly in multiple languages.
not overriding function Get_Language
(Self : not null access constant UML_Opaque_Expression)
return AMF.String_Collections.Ordered_Set_Of_String is abstract;
-- Getter of OpaqueExpression::language.
--
-- Specifies the languages in which the expression is stated. The
-- interpretation of the expression body depends on the languages. If the
-- languages are unspecified, they might be implicit from the expression
-- body or the context. Languages are matched to body strings by order.
not overriding function Get_Result
(Self : not null access constant UML_Opaque_Expression)
return AMF.UML.Parameters.UML_Parameter_Access is abstract;
-- Getter of OpaqueExpression::result.
--
-- Restricts an opaque expression to return exactly one return result.
-- When the invocation of the opaque expression completes, a single set of
-- values is returned to its owner. This association is derived from the
-- single return result parameter of the associated behavior.
not overriding function Is_Integral
(Self : not null access constant UML_Opaque_Expression)
return Boolean is abstract;
-- Operation OpaqueExpression::isIntegral.
--
-- The query isIntegral() tells whether an expression is intended to
-- produce an integer.
not overriding function Is_Non_Negative
(Self : not null access constant UML_Opaque_Expression)
return Boolean is abstract;
-- Operation OpaqueExpression::isNonNegative.
--
-- The query isNonNegative() tells whether an integer expression has a
-- non-negative value.
not overriding function Is_Positive
(Self : not null access constant UML_Opaque_Expression)
return Boolean is abstract;
-- Operation OpaqueExpression::isPositive.
--
-- The query isPositive() tells whether an integer expression has a
-- positive value.
not overriding function Result
(Self : not null access constant UML_Opaque_Expression)
return AMF.UML.Parameters.UML_Parameter_Access is abstract;
-- Operation OpaqueExpression::result.
--
-- Missing derivation for OpaqueExpression::/result : Parameter
not overriding function Value
(Self : not null access constant UML_Opaque_Expression)
return Integer is abstract;
-- Operation OpaqueExpression::value.
--
-- The query value() gives an integer value for an expression intended to
-- produce one.
end AMF.UML.Opaque_Expressions;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . S T R I N G S . U N B O U N D E D --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2016, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Ada.Strings.Search;
with Ada.Unchecked_Deallocation;
package body Ada.Strings.Unbounded is
use Ada.Strings.Maps;
Growth_Factor : constant := 32;
-- The growth factor controls how much extra space is allocated when
-- we have to increase the size of an allocated unbounded string. By
-- allocating extra space, we avoid the need to reallocate on every
-- append, particularly important when a string is built up by repeated
-- append operations of small pieces. This is expressed as a factor so
-- 32 means add 1/32 of the length of the string as growth space.
Min_Mul_Alloc : constant := Standard'Maximum_Alignment;
-- Allocation will be done by a multiple of Min_Mul_Alloc. This causes
-- no memory loss as most (all?) malloc implementations are obliged to
-- align the returned memory on the maximum alignment as malloc does not
-- know the target alignment.
function Aligned_Max_Length (Max_Length : Natural) return Natural;
-- Returns recommended length of the shared string which is greater or
-- equal to specified length. Calculation take in sense alignment of the
-- allocated memory segments to use memory effectively by Append/Insert/etc
-- operations.
---------
-- "&" --
---------
function "&"
(Left : Unbounded_String;
Right : Unbounded_String) return Unbounded_String
is
LR : constant Shared_String_Access := Left.Reference;
RR : constant Shared_String_Access := Right.Reference;
DL : constant Natural := LR.Last + RR.Last;
DR : Shared_String_Access;
begin
-- Result is an empty string, reuse shared empty string
if DL = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Left string is empty, return Right string
elsif LR.Last = 0 then
Reference (RR);
DR := RR;
-- Right string is empty, return Left string
elsif RR.Last = 0 then
Reference (LR);
DR := LR;
-- Otherwise, allocate new shared string and fill data
else
DR := Allocate (DL);
DR.Data (1 .. LR.Last) := LR.Data (1 .. LR.Last);
DR.Data (LR.Last + 1 .. DL) := RR.Data (1 .. RR.Last);
DR.Last := DL;
end if;
return (AF.Controlled with Reference => DR);
end "&";
function "&"
(Left : Unbounded_String;
Right : String) return Unbounded_String
is
LR : constant Shared_String_Access := Left.Reference;
DL : constant Natural := LR.Last + Right'Length;
DR : Shared_String_Access;
begin
-- Result is an empty string, reuse shared empty string
if DL = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Right is an empty string, return Left string
elsif Right'Length = 0 then
Reference (LR);
DR := LR;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (DL);
DR.Data (1 .. LR.Last) := LR.Data (1 .. LR.Last);
DR.Data (LR.Last + 1 .. DL) := Right;
DR.Last := DL;
end if;
return (AF.Controlled with Reference => DR);
end "&";
function "&"
(Left : String;
Right : Unbounded_String) return Unbounded_String
is
RR : constant Shared_String_Access := Right.Reference;
DL : constant Natural := Left'Length + RR.Last;
DR : Shared_String_Access;
begin
-- Result is an empty string, reuse shared one
if DL = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Left is empty string, return Right string
elsif Left'Length = 0 then
Reference (RR);
DR := RR;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (DL);
DR.Data (1 .. Left'Length) := Left;
DR.Data (Left'Length + 1 .. DL) := RR.Data (1 .. RR.Last);
DR.Last := DL;
end if;
return (AF.Controlled with Reference => DR);
end "&";
function "&"
(Left : Unbounded_String;
Right : Character) return Unbounded_String
is
LR : constant Shared_String_Access := Left.Reference;
DL : constant Natural := LR.Last + 1;
DR : Shared_String_Access;
begin
DR := Allocate (DL);
DR.Data (1 .. LR.Last) := LR.Data (1 .. LR.Last);
DR.Data (DL) := Right;
DR.Last := DL;
return (AF.Controlled with Reference => DR);
end "&";
function "&"
(Left : Character;
Right : Unbounded_String) return Unbounded_String
is
RR : constant Shared_String_Access := Right.Reference;
DL : constant Natural := 1 + RR.Last;
DR : Shared_String_Access;
begin
DR := Allocate (DL);
DR.Data (1) := Left;
DR.Data (2 .. DL) := RR.Data (1 .. RR.Last);
DR.Last := DL;
return (AF.Controlled with Reference => DR);
end "&";
---------
-- "*" --
---------
function "*"
(Left : Natural;
Right : Character) return Unbounded_String
is
DR : Shared_String_Access;
begin
-- Result is an empty string, reuse shared empty string
if Left = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (Left);
for J in 1 .. Left loop
DR.Data (J) := Right;
end loop;
DR.Last := Left;
end if;
return (AF.Controlled with Reference => DR);
end "*";
function "*"
(Left : Natural;
Right : String) return Unbounded_String
is
DL : constant Natural := Left * Right'Length;
DR : Shared_String_Access;
K : Positive;
begin
-- Result is an empty string, reuse shared empty string
if DL = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (DL);
K := 1;
for J in 1 .. Left loop
DR.Data (K .. K + Right'Length - 1) := Right;
K := K + Right'Length;
end loop;
DR.Last := DL;
end if;
return (AF.Controlled with Reference => DR);
end "*";
function "*"
(Left : Natural;
Right : Unbounded_String) return Unbounded_String
is
RR : constant Shared_String_Access := Right.Reference;
DL : constant Natural := Left * RR.Last;
DR : Shared_String_Access;
K : Positive;
begin
-- Result is an empty string, reuse shared empty string
if DL = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Coefficient is one, just return string itself
elsif Left = 1 then
Reference (RR);
DR := RR;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (DL);
K := 1;
for J in 1 .. Left loop
DR.Data (K .. K + RR.Last - 1) := RR.Data (1 .. RR.Last);
K := K + RR.Last;
end loop;
DR.Last := DL;
end if;
return (AF.Controlled with Reference => DR);
end "*";
---------
-- "<" --
---------
function "<"
(Left : Unbounded_String;
Right : Unbounded_String) return Boolean
is
LR : constant Shared_String_Access := Left.Reference;
RR : constant Shared_String_Access := Right.Reference;
begin
return LR.Data (1 .. LR.Last) < RR.Data (1 .. RR.Last);
end "<";
function "<"
(Left : Unbounded_String;
Right : String) return Boolean
is
LR : constant Shared_String_Access := Left.Reference;
begin
return LR.Data (1 .. LR.Last) < Right;
end "<";
function "<"
(Left : String;
Right : Unbounded_String) return Boolean
is
RR : constant Shared_String_Access := Right.Reference;
begin
return Left < RR.Data (1 .. RR.Last);
end "<";
----------
-- "<=" --
----------
function "<="
(Left : Unbounded_String;
Right : Unbounded_String) return Boolean
is
LR : constant Shared_String_Access := Left.Reference;
RR : constant Shared_String_Access := Right.Reference;
begin
-- LR = RR means two strings shares shared string, thus they are equal
return LR = RR or else LR.Data (1 .. LR.Last) <= RR.Data (1 .. RR.Last);
end "<=";
function "<="
(Left : Unbounded_String;
Right : String) return Boolean
is
LR : constant Shared_String_Access := Left.Reference;
begin
return LR.Data (1 .. LR.Last) <= Right;
end "<=";
function "<="
(Left : String;
Right : Unbounded_String) return Boolean
is
RR : constant Shared_String_Access := Right.Reference;
begin
return Left <= RR.Data (1 .. RR.Last);
end "<=";
---------
-- "=" --
---------
function "="
(Left : Unbounded_String;
Right : Unbounded_String) return Boolean
is
LR : constant Shared_String_Access := Left.Reference;
RR : constant Shared_String_Access := Right.Reference;
begin
return LR = RR or else LR.Data (1 .. LR.Last) = RR.Data (1 .. RR.Last);
-- LR = RR means two strings shares shared string, thus they are equal
end "=";
function "="
(Left : Unbounded_String;
Right : String) return Boolean
is
LR : constant Shared_String_Access := Left.Reference;
begin
return LR.Data (1 .. LR.Last) = Right;
end "=";
function "="
(Left : String;
Right : Unbounded_String) return Boolean
is
RR : constant Shared_String_Access := Right.Reference;
begin
return Left = RR.Data (1 .. RR.Last);
end "=";
---------
-- ">" --
---------
function ">"
(Left : Unbounded_String;
Right : Unbounded_String) return Boolean
is
LR : constant Shared_String_Access := Left.Reference;
RR : constant Shared_String_Access := Right.Reference;
begin
return LR.Data (1 .. LR.Last) > RR.Data (1 .. RR.Last);
end ">";
function ">"
(Left : Unbounded_String;
Right : String) return Boolean
is
LR : constant Shared_String_Access := Left.Reference;
begin
return LR.Data (1 .. LR.Last) > Right;
end ">";
function ">"
(Left : String;
Right : Unbounded_String) return Boolean
is
RR : constant Shared_String_Access := Right.Reference;
begin
return Left > RR.Data (1 .. RR.Last);
end ">";
----------
-- ">=" --
----------
function ">="
(Left : Unbounded_String;
Right : Unbounded_String) return Boolean
is
LR : constant Shared_String_Access := Left.Reference;
RR : constant Shared_String_Access := Right.Reference;
begin
-- LR = RR means two strings shares shared string, thus they are equal
return LR = RR or else LR.Data (1 .. LR.Last) >= RR.Data (1 .. RR.Last);
end ">=";
function ">="
(Left : Unbounded_String;
Right : String) return Boolean
is
LR : constant Shared_String_Access := Left.Reference;
begin
return LR.Data (1 .. LR.Last) >= Right;
end ">=";
function ">="
(Left : String;
Right : Unbounded_String) return Boolean
is
RR : constant Shared_String_Access := Right.Reference;
begin
return Left >= RR.Data (1 .. RR.Last);
end ">=";
------------
-- Adjust --
------------
procedure Adjust (Object : in out Unbounded_String) is
begin
Reference (Object.Reference);
end Adjust;
------------------------
-- Aligned_Max_Length --
------------------------
function Aligned_Max_Length (Max_Length : Natural) return Natural is
Static_Size : constant Natural :=
Empty_Shared_String'Size / Standard'Storage_Unit;
-- Total size of all static components
begin
return
((Static_Size + Max_Length - 1) / Min_Mul_Alloc + 2) * Min_Mul_Alloc
- Static_Size;
end Aligned_Max_Length;
--------------
-- Allocate --
--------------
function Allocate
(Max_Length : Natural) return not null Shared_String_Access
is
begin
-- Empty string requested, return shared empty string
if Max_Length = 0 then
Reference (Empty_Shared_String'Access);
return Empty_Shared_String'Access;
-- Otherwise, allocate requested space (and probably some more room)
else
return new Shared_String (Aligned_Max_Length (Max_Length));
end if;
end Allocate;
------------
-- Append --
------------
procedure Append
(Source : in out Unbounded_String;
New_Item : Unbounded_String)
is
SR : constant Shared_String_Access := Source.Reference;
NR : constant Shared_String_Access := New_Item.Reference;
DL : constant Natural := SR.Last + NR.Last;
DR : Shared_String_Access;
begin
-- Source is an empty string, reuse New_Item data
if SR.Last = 0 then
Reference (NR);
Source.Reference := NR;
Unreference (SR);
-- New_Item is empty string, nothing to do
elsif NR.Last = 0 then
null;
-- Try to reuse existing shared string
elsif Can_Be_Reused (SR, DL) then
SR.Data (SR.Last + 1 .. DL) := NR.Data (1 .. NR.Last);
SR.Last := DL;
-- Otherwise, allocate new one and fill it
else
DR := Allocate (DL + DL / Growth_Factor);
DR.Data (1 .. SR.Last) := SR.Data (1 .. SR.Last);
DR.Data (SR.Last + 1 .. DL) := NR.Data (1 .. NR.Last);
DR.Last := DL;
Source.Reference := DR;
Unreference (SR);
end if;
end Append;
procedure Append
(Source : in out Unbounded_String;
New_Item : String)
is
SR : constant Shared_String_Access := Source.Reference;
DL : constant Natural := SR.Last + New_Item'Length;
DR : Shared_String_Access;
begin
-- New_Item is an empty string, nothing to do
if New_Item'Length = 0 then
null;
-- Try to reuse existing shared string
elsif Can_Be_Reused (SR, DL) then
SR.Data (SR.Last + 1 .. DL) := New_Item;
SR.Last := DL;
-- Otherwise, allocate new one and fill it
else
DR := Allocate (DL + DL / Growth_Factor);
DR.Data (1 .. SR.Last) := SR.Data (1 .. SR.Last);
DR.Data (SR.Last + 1 .. DL) := New_Item;
DR.Last := DL;
Source.Reference := DR;
Unreference (SR);
end if;
end Append;
procedure Append
(Source : in out Unbounded_String;
New_Item : Character)
is
SR : constant Shared_String_Access := Source.Reference;
DL : constant Natural := SR.Last + 1;
DR : Shared_String_Access;
begin
-- Try to reuse existing shared string
if Can_Be_Reused (SR, SR.Last + 1) then
SR.Data (SR.Last + 1) := New_Item;
SR.Last := SR.Last + 1;
-- Otherwise, allocate new one and fill it
else
DR := Allocate (DL + DL / Growth_Factor);
DR.Data (1 .. SR.Last) := SR.Data (1 .. SR.Last);
DR.Data (DL) := New_Item;
DR.Last := DL;
Source.Reference := DR;
Unreference (SR);
end if;
end Append;
-------------------
-- Can_Be_Reused --
-------------------
function Can_Be_Reused
(Item : not null Shared_String_Access;
Length : Natural) return Boolean
is
begin
return
System.Atomic_Counters.Is_One (Item.Counter)
and then Item.Max_Length >= Length
and then Item.Max_Length <=
Aligned_Max_Length (Length + Length / Growth_Factor);
end Can_Be_Reused;
-----------
-- Count --
-----------
function Count
(Source : Unbounded_String;
Pattern : String;
Mapping : Maps.Character_Mapping := Maps.Identity) return Natural
is
SR : constant Shared_String_Access := Source.Reference;
begin
return Search.Count (SR.Data (1 .. SR.Last), Pattern, Mapping);
end Count;
function Count
(Source : Unbounded_String;
Pattern : String;
Mapping : Maps.Character_Mapping_Function) return Natural
is
SR : constant Shared_String_Access := Source.Reference;
begin
return Search.Count (SR.Data (1 .. SR.Last), Pattern, Mapping);
end Count;
function Count
(Source : Unbounded_String;
Set : Maps.Character_Set) return Natural
is
SR : constant Shared_String_Access := Source.Reference;
begin
return Search.Count (SR.Data (1 .. SR.Last), Set);
end Count;
------------
-- Delete --
------------
function Delete
(Source : Unbounded_String;
From : Positive;
Through : Natural) return Unbounded_String
is
SR : constant Shared_String_Access := Source.Reference;
DL : Natural;
DR : Shared_String_Access;
begin
-- Empty slice is deleted, use the same shared string
if From > Through then
Reference (SR);
DR := SR;
-- Index is out of range
elsif Through > SR.Last then
raise Index_Error;
-- Compute size of the result
else
DL := SR.Last - (Through - From + 1);
-- Result is an empty string, reuse shared empty string
if DL = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (DL);
DR.Data (1 .. From - 1) := SR.Data (1 .. From - 1);
DR.Data (From .. DL) := SR.Data (Through + 1 .. SR.Last);
DR.Last := DL;
end if;
end if;
return (AF.Controlled with Reference => DR);
end Delete;
procedure Delete
(Source : in out Unbounded_String;
From : Positive;
Through : Natural)
is
SR : constant Shared_String_Access := Source.Reference;
DL : Natural;
DR : Shared_String_Access;
begin
-- Nothing changed, return
if From > Through then
null;
-- Through is outside of the range
elsif Through > SR.Last then
raise Index_Error;
else
DL := SR.Last - (Through - From + 1);
-- Result is empty, reuse shared empty string
if DL = 0 then
Reference (Empty_Shared_String'Access);
Source.Reference := Empty_Shared_String'Access;
Unreference (SR);
-- Try to reuse existing shared string
elsif Can_Be_Reused (SR, DL) then
SR.Data (From .. DL) := SR.Data (Through + 1 .. SR.Last);
SR.Last := DL;
-- Otherwise, allocate new shared string
else
DR := Allocate (DL);
DR.Data (1 .. From - 1) := SR.Data (1 .. From - 1);
DR.Data (From .. DL) := SR.Data (Through + 1 .. SR.Last);
DR.Last := DL;
Source.Reference := DR;
Unreference (SR);
end if;
end if;
end Delete;
-------------
-- Element --
-------------
function Element
(Source : Unbounded_String;
Index : Positive) return Character
is
SR : constant Shared_String_Access := Source.Reference;
begin
if Index <= SR.Last then
return SR.Data (Index);
else
raise Index_Error;
end if;
end Element;
--------------
-- Finalize --
--------------
procedure Finalize (Object : in out Unbounded_String) is
SR : constant not null Shared_String_Access := Object.Reference;
begin
if SR /= Null_Unbounded_String.Reference then
-- The same controlled object can be finalized several times for
-- some reason. As per 7.6.1(24) this should have no ill effect,
-- so we need to add a guard for the case of finalizing the same
-- object twice.
-- We set the Object to the empty string so there will be no ill
-- effects if a program references an already-finalized object.
Object.Reference := Null_Unbounded_String.Reference;
Reference (Object.Reference);
Unreference (SR);
end if;
end Finalize;
----------------
-- Find_Token --
----------------
procedure Find_Token
(Source : Unbounded_String;
Set : Maps.Character_Set;
From : Positive;
Test : Strings.Membership;
First : out Positive;
Last : out Natural)
is
SR : constant Shared_String_Access := Source.Reference;
begin
Search.Find_Token (SR.Data (From .. SR.Last), Set, Test, First, Last);
end Find_Token;
procedure Find_Token
(Source : Unbounded_String;
Set : Maps.Character_Set;
Test : Strings.Membership;
First : out Positive;
Last : out Natural)
is
SR : constant Shared_String_Access := Source.Reference;
begin
Search.Find_Token (SR.Data (1 .. SR.Last), Set, Test, First, Last);
end Find_Token;
----------
-- Free --
----------
procedure Free (X : in out String_Access) is
procedure Deallocate is
new Ada.Unchecked_Deallocation (String, String_Access);
begin
Deallocate (X);
end Free;
----------
-- Head --
----------
function Head
(Source : Unbounded_String;
Count : Natural;
Pad : Character := Space) return Unbounded_String
is
SR : constant Shared_String_Access := Source.Reference;
DR : Shared_String_Access;
begin
-- Result is empty, reuse shared empty string
if Count = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Length of the string is the same as requested, reuse source shared
-- string.
elsif Count = SR.Last then
Reference (SR);
DR := SR;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (Count);
-- Length of the source string is more than requested, copy
-- corresponding slice.
if Count < SR.Last then
DR.Data (1 .. Count) := SR.Data (1 .. Count);
-- Length of the source string is less than requested, copy all
-- contents and fill others by Pad character.
else
DR.Data (1 .. SR.Last) := SR.Data (1 .. SR.Last);
for J in SR.Last + 1 .. Count loop
DR.Data (J) := Pad;
end loop;
end if;
DR.Last := Count;
end if;
return (AF.Controlled with Reference => DR);
end Head;
procedure Head
(Source : in out Unbounded_String;
Count : Natural;
Pad : Character := Space)
is
SR : constant Shared_String_Access := Source.Reference;
DR : Shared_String_Access;
begin
-- Result is empty, reuse empty shared string
if Count = 0 then
Reference (Empty_Shared_String'Access);
Source.Reference := Empty_Shared_String'Access;
Unreference (SR);
-- Result is same as source string, reuse source shared string
elsif Count = SR.Last then
null;
-- Try to reuse existing shared string
elsif Can_Be_Reused (SR, Count) then
if Count > SR.Last then
for J in SR.Last + 1 .. Count loop
SR.Data (J) := Pad;
end loop;
end if;
SR.Last := Count;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (Count);
-- Length of the source string is greater than requested, copy
-- corresponding slice.
if Count < SR.Last then
DR.Data (1 .. Count) := SR.Data (1 .. Count);
-- Length of the source string is less than requested, copy all
-- existing data and fill remaining positions with Pad characters.
else
DR.Data (1 .. SR.Last) := SR.Data (1 .. SR.Last);
for J in SR.Last + 1 .. Count loop
DR.Data (J) := Pad;
end loop;
end if;
DR.Last := Count;
Source.Reference := DR;
Unreference (SR);
end if;
end Head;
-----------
-- Index --
-----------
function Index
(Source : Unbounded_String;
Pattern : String;
Going : Strings.Direction := Strings.Forward;
Mapping : Maps.Character_Mapping := Maps.Identity) return Natural
is
SR : constant Shared_String_Access := Source.Reference;
begin
return Search.Index (SR.Data (1 .. SR.Last), Pattern, Going, Mapping);
end Index;
function Index
(Source : Unbounded_String;
Pattern : String;
Going : Direction := Forward;
Mapping : Maps.Character_Mapping_Function) return Natural
is
SR : constant Shared_String_Access := Source.Reference;
begin
return Search.Index (SR.Data (1 .. SR.Last), Pattern, Going, Mapping);
end Index;
function Index
(Source : Unbounded_String;
Set : Maps.Character_Set;
Test : Strings.Membership := Strings.Inside;
Going : Strings.Direction := Strings.Forward) return Natural
is
SR : constant Shared_String_Access := Source.Reference;
begin
return Search.Index (SR.Data (1 .. SR.Last), Set, Test, Going);
end Index;
function Index
(Source : Unbounded_String;
Pattern : String;
From : Positive;
Going : Direction := Forward;
Mapping : Maps.Character_Mapping := Maps.Identity) return Natural
is
SR : constant Shared_String_Access := Source.Reference;
begin
return Search.Index
(SR.Data (1 .. SR.Last), Pattern, From, Going, Mapping);
end Index;
function Index
(Source : Unbounded_String;
Pattern : String;
From : Positive;
Going : Direction := Forward;
Mapping : Maps.Character_Mapping_Function) return Natural
is
SR : constant Shared_String_Access := Source.Reference;
begin
return Search.Index
(SR.Data (1 .. SR.Last), Pattern, From, Going, Mapping);
end Index;
function Index
(Source : Unbounded_String;
Set : Maps.Character_Set;
From : Positive;
Test : Membership := Inside;
Going : Direction := Forward) return Natural
is
SR : constant Shared_String_Access := Source.Reference;
begin
return Search.Index (SR.Data (1 .. SR.Last), Set, From, Test, Going);
end Index;
---------------------
-- Index_Non_Blank --
---------------------
function Index_Non_Blank
(Source : Unbounded_String;
Going : Strings.Direction := Strings.Forward) return Natural
is
SR : constant Shared_String_Access := Source.Reference;
begin
return Search.Index_Non_Blank (SR.Data (1 .. SR.Last), Going);
end Index_Non_Blank;
function Index_Non_Blank
(Source : Unbounded_String;
From : Positive;
Going : Direction := Forward) return Natural
is
SR : constant Shared_String_Access := Source.Reference;
begin
return Search.Index_Non_Blank (SR.Data (1 .. SR.Last), From, Going);
end Index_Non_Blank;
----------------
-- Initialize --
----------------
procedure Initialize (Object : in out Unbounded_String) is
begin
Reference (Object.Reference);
end Initialize;
------------
-- Insert --
------------
function Insert
(Source : Unbounded_String;
Before : Positive;
New_Item : String) return Unbounded_String
is
SR : constant Shared_String_Access := Source.Reference;
DL : constant Natural := SR.Last + New_Item'Length;
DR : Shared_String_Access;
begin
-- Check index first
if Before > SR.Last + 1 then
raise Index_Error;
end if;
-- Result is empty, reuse empty shared string
if DL = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Inserted string is empty, reuse source shared string
elsif New_Item'Length = 0 then
Reference (SR);
DR := SR;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (DL + DL / Growth_Factor);
DR.Data (1 .. Before - 1) := SR.Data (1 .. Before - 1);
DR.Data (Before .. Before + New_Item'Length - 1) := New_Item;
DR.Data (Before + New_Item'Length .. DL) :=
SR.Data (Before .. SR.Last);
DR.Last := DL;
end if;
return (AF.Controlled with Reference => DR);
end Insert;
procedure Insert
(Source : in out Unbounded_String;
Before : Positive;
New_Item : String)
is
SR : constant Shared_String_Access := Source.Reference;
DL : constant Natural := SR.Last + New_Item'Length;
DR : Shared_String_Access;
begin
-- Check bounds
if Before > SR.Last + 1 then
raise Index_Error;
end if;
-- Result is empty string, reuse empty shared string
if DL = 0 then
Reference (Empty_Shared_String'Access);
Source.Reference := Empty_Shared_String'Access;
Unreference (SR);
-- Inserted string is empty, nothing to do
elsif New_Item'Length = 0 then
null;
-- Try to reuse existing shared string first
elsif Can_Be_Reused (SR, DL) then
SR.Data (Before + New_Item'Length .. DL) :=
SR.Data (Before .. SR.Last);
SR.Data (Before .. Before + New_Item'Length - 1) := New_Item;
SR.Last := DL;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (DL + DL / Growth_Factor);
DR.Data (1 .. Before - 1) := SR.Data (1 .. Before - 1);
DR.Data (Before .. Before + New_Item'Length - 1) := New_Item;
DR.Data (Before + New_Item'Length .. DL) :=
SR.Data (Before .. SR.Last);
DR.Last := DL;
Source.Reference := DR;
Unreference (SR);
end if;
end Insert;
------------
-- Length --
------------
function Length (Source : Unbounded_String) return Natural is
begin
return Source.Reference.Last;
end Length;
---------------
-- Overwrite --
---------------
function Overwrite
(Source : Unbounded_String;
Position : Positive;
New_Item : String) return Unbounded_String
is
SR : constant Shared_String_Access := Source.Reference;
DL : Natural;
DR : Shared_String_Access;
begin
-- Check bounds
if Position > SR.Last + 1 then
raise Index_Error;
end if;
DL := Integer'Max (SR.Last, Position + New_Item'Length - 1);
-- Result is empty string, reuse empty shared string
if DL = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Result is same as source string, reuse source shared string
elsif New_Item'Length = 0 then
Reference (SR);
DR := SR;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (DL);
DR.Data (1 .. Position - 1) := SR.Data (1 .. Position - 1);
DR.Data (Position .. Position + New_Item'Length - 1) := New_Item;
DR.Data (Position + New_Item'Length .. DL) :=
SR.Data (Position + New_Item'Length .. SR.Last);
DR.Last := DL;
end if;
return (AF.Controlled with Reference => DR);
end Overwrite;
procedure Overwrite
(Source : in out Unbounded_String;
Position : Positive;
New_Item : String)
is
SR : constant Shared_String_Access := Source.Reference;
DL : Natural;
DR : Shared_String_Access;
begin
-- Bounds check
if Position > SR.Last + 1 then
raise Index_Error;
end if;
DL := Integer'Max (SR.Last, Position + New_Item'Length - 1);
-- Result is empty string, reuse empty shared string
if DL = 0 then
Reference (Empty_Shared_String'Access);
Source.Reference := Empty_Shared_String'Access;
Unreference (SR);
-- String unchanged, nothing to do
elsif New_Item'Length = 0 then
null;
-- Try to reuse existing shared string
elsif Can_Be_Reused (SR, DL) then
SR.Data (Position .. Position + New_Item'Length - 1) := New_Item;
SR.Last := DL;
-- Otherwise allocate new shared string and fill it
else
DR := Allocate (DL);
DR.Data (1 .. Position - 1) := SR.Data (1 .. Position - 1);
DR.Data (Position .. Position + New_Item'Length - 1) := New_Item;
DR.Data (Position + New_Item'Length .. DL) :=
SR.Data (Position + New_Item'Length .. SR.Last);
DR.Last := DL;
Source.Reference := DR;
Unreference (SR);
end if;
end Overwrite;
---------------
-- Reference --
---------------
procedure Reference (Item : not null Shared_String_Access) is
begin
System.Atomic_Counters.Increment (Item.Counter);
end Reference;
---------------------
-- Replace_Element --
---------------------
procedure Replace_Element
(Source : in out Unbounded_String;
Index : Positive;
By : Character)
is
SR : constant Shared_String_Access := Source.Reference;
DR : Shared_String_Access;
begin
-- Bounds check
if Index <= SR.Last then
-- Try to reuse existing shared string
if Can_Be_Reused (SR, SR.Last) then
SR.Data (Index) := By;
-- Otherwise allocate new shared string and fill it
else
DR := Allocate (SR.Last);
DR.Data (1 .. SR.Last) := SR.Data (1 .. SR.Last);
DR.Data (Index) := By;
DR.Last := SR.Last;
Source.Reference := DR;
Unreference (SR);
end if;
else
raise Index_Error;
end if;
end Replace_Element;
-------------------
-- Replace_Slice --
-------------------
function Replace_Slice
(Source : Unbounded_String;
Low : Positive;
High : Natural;
By : String) return Unbounded_String
is
SR : constant Shared_String_Access := Source.Reference;
DL : Natural;
DR : Shared_String_Access;
begin
-- Check bounds
if Low > SR.Last + 1 then
raise Index_Error;
end if;
-- Do replace operation when removed slice is not empty
if High >= Low then
DL := By'Length + SR.Last + Low - Integer'Min (High, SR.Last) - 1;
-- This is the number of characters remaining in the string after
-- replacing the slice.
-- Result is empty string, reuse empty shared string
if DL = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Otherwise allocate new shared string and fill it
else
DR := Allocate (DL);
DR.Data (1 .. Low - 1) := SR.Data (1 .. Low - 1);
DR.Data (Low .. Low + By'Length - 1) := By;
DR.Data (Low + By'Length .. DL) := SR.Data (High + 1 .. SR.Last);
DR.Last := DL;
end if;
return (AF.Controlled with Reference => DR);
-- Otherwise just insert string
else
return Insert (Source, Low, By);
end if;
end Replace_Slice;
procedure Replace_Slice
(Source : in out Unbounded_String;
Low : Positive;
High : Natural;
By : String)
is
SR : constant Shared_String_Access := Source.Reference;
DL : Natural;
DR : Shared_String_Access;
begin
-- Bounds check
if Low > SR.Last + 1 then
raise Index_Error;
end if;
-- Do replace operation only when replaced slice is not empty
if High >= Low then
DL := By'Length + SR.Last + Low - Integer'Min (High, SR.Last) - 1;
-- This is the number of characters remaining in the string after
-- replacing the slice.
-- Result is empty string, reuse empty shared string
if DL = 0 then
Reference (Empty_Shared_String'Access);
Source.Reference := Empty_Shared_String'Access;
Unreference (SR);
-- Try to reuse existing shared string
elsif Can_Be_Reused (SR, DL) then
SR.Data (Low + By'Length .. DL) := SR.Data (High + 1 .. SR.Last);
SR.Data (Low .. Low + By'Length - 1) := By;
SR.Last := DL;
-- Otherwise allocate new shared string and fill it
else
DR := Allocate (DL);
DR.Data (1 .. Low - 1) := SR.Data (1 .. Low - 1);
DR.Data (Low .. Low + By'Length - 1) := By;
DR.Data (Low + By'Length .. DL) := SR.Data (High + 1 .. SR.Last);
DR.Last := DL;
Source.Reference := DR;
Unreference (SR);
end if;
-- Otherwise just insert item
else
Insert (Source, Low, By);
end if;
end Replace_Slice;
--------------------------
-- Set_Unbounded_String --
--------------------------
procedure Set_Unbounded_String
(Target : out Unbounded_String;
Source : String)
is
TR : constant Shared_String_Access := Target.Reference;
DR : Shared_String_Access;
begin
-- In case of empty string, reuse empty shared string
if Source'Length = 0 then
Reference (Empty_Shared_String'Access);
Target.Reference := Empty_Shared_String'Access;
else
-- Try to reuse existing shared string
if Can_Be_Reused (TR, Source'Length) then
Reference (TR);
DR := TR;
-- Otherwise allocate new shared string
else
DR := Allocate (Source'Length);
Target.Reference := DR;
end if;
DR.Data (1 .. Source'Length) := Source;
DR.Last := Source'Length;
end if;
Unreference (TR);
end Set_Unbounded_String;
-----------
-- Slice --
-----------
function Slice
(Source : Unbounded_String;
Low : Positive;
High : Natural) return String
is
SR : constant Shared_String_Access := Source.Reference;
begin
-- Note: test of High > Length is in accordance with AI95-00128
if Low > SR.Last + 1 or else High > SR.Last then
raise Index_Error;
else
return SR.Data (Low .. High);
end if;
end Slice;
----------
-- Tail --
----------
function Tail
(Source : Unbounded_String;
Count : Natural;
Pad : Character := Space) return Unbounded_String
is
SR : constant Shared_String_Access := Source.Reference;
DR : Shared_String_Access;
begin
-- For empty result reuse empty shared string
if Count = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Result is whole source string, reuse source shared string
elsif Count = SR.Last then
Reference (SR);
DR := SR;
-- Otherwise allocate new shared string and fill it
else
DR := Allocate (Count);
if Count < SR.Last then
DR.Data (1 .. Count) := SR.Data (SR.Last - Count + 1 .. SR.Last);
else
for J in 1 .. Count - SR.Last loop
DR.Data (J) := Pad;
end loop;
DR.Data (Count - SR.Last + 1 .. Count) := SR.Data (1 .. SR.Last);
end if;
DR.Last := Count;
end if;
return (AF.Controlled with Reference => DR);
end Tail;
procedure Tail
(Source : in out Unbounded_String;
Count : Natural;
Pad : Character := Space)
is
SR : constant Shared_String_Access := Source.Reference;
DR : Shared_String_Access;
procedure Common
(SR : Shared_String_Access;
DR : Shared_String_Access;
Count : Natural);
-- Common code of tail computation. SR/DR can point to the same object
------------
-- Common --
------------
procedure Common
(SR : Shared_String_Access;
DR : Shared_String_Access;
Count : Natural) is
begin
if Count < SR.Last then
DR.Data (1 .. Count) := SR.Data (SR.Last - Count + 1 .. SR.Last);
else
DR.Data (Count - SR.Last + 1 .. Count) := SR.Data (1 .. SR.Last);
for J in 1 .. Count - SR.Last loop
DR.Data (J) := Pad;
end loop;
end if;
DR.Last := Count;
end Common;
begin
-- Result is empty string, reuse empty shared string
if Count = 0 then
Reference (Empty_Shared_String'Access);
Source.Reference := Empty_Shared_String'Access;
Unreference (SR);
-- Length of the result is the same as length of the source string,
-- reuse source shared string.
elsif Count = SR.Last then
null;
-- Try to reuse existing shared string
elsif Can_Be_Reused (SR, Count) then
Common (SR, SR, Count);
-- Otherwise allocate new shared string and fill it
else
DR := Allocate (Count);
Common (SR, DR, Count);
Source.Reference := DR;
Unreference (SR);
end if;
end Tail;
---------------
-- To_String --
---------------
function To_String (Source : Unbounded_String) return String is
begin
return Source.Reference.Data (1 .. Source.Reference.Last);
end To_String;
-------------------------
-- To_Unbounded_String --
-------------------------
function To_Unbounded_String (Source : String) return Unbounded_String is
DR : Shared_String_Access;
begin
if Source'Length = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
else
DR := Allocate (Source'Length);
DR.Data (1 .. Source'Length) := Source;
DR.Last := Source'Length;
end if;
return (AF.Controlled with Reference => DR);
end To_Unbounded_String;
function To_Unbounded_String (Length : Natural) return Unbounded_String is
DR : Shared_String_Access;
begin
if Length = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
else
DR := Allocate (Length);
DR.Last := Length;
end if;
return (AF.Controlled with Reference => DR);
end To_Unbounded_String;
---------------
-- Translate --
---------------
function Translate
(Source : Unbounded_String;
Mapping : Maps.Character_Mapping) return Unbounded_String
is
SR : constant Shared_String_Access := Source.Reference;
DR : Shared_String_Access;
begin
-- Nothing to translate, reuse empty shared string
if SR.Last = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (SR.Last);
for J in 1 .. SR.Last loop
DR.Data (J) := Value (Mapping, SR.Data (J));
end loop;
DR.Last := SR.Last;
end if;
return (AF.Controlled with Reference => DR);
end Translate;
procedure Translate
(Source : in out Unbounded_String;
Mapping : Maps.Character_Mapping)
is
SR : constant Shared_String_Access := Source.Reference;
DR : Shared_String_Access;
begin
-- Nothing to translate
if SR.Last = 0 then
null;
-- Try to reuse shared string
elsif Can_Be_Reused (SR, SR.Last) then
for J in 1 .. SR.Last loop
SR.Data (J) := Value (Mapping, SR.Data (J));
end loop;
-- Otherwise, allocate new shared string
else
DR := Allocate (SR.Last);
for J in 1 .. SR.Last loop
DR.Data (J) := Value (Mapping, SR.Data (J));
end loop;
DR.Last := SR.Last;
Source.Reference := DR;
Unreference (SR);
end if;
end Translate;
function Translate
(Source : Unbounded_String;
Mapping : Maps.Character_Mapping_Function) return Unbounded_String
is
SR : constant Shared_String_Access := Source.Reference;
DR : Shared_String_Access;
begin
-- Nothing to translate, reuse empty shared string
if SR.Last = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (SR.Last);
for J in 1 .. SR.Last loop
DR.Data (J) := Mapping.all (SR.Data (J));
end loop;
DR.Last := SR.Last;
end if;
return (AF.Controlled with Reference => DR);
exception
when others =>
Unreference (DR);
raise;
end Translate;
procedure Translate
(Source : in out Unbounded_String;
Mapping : Maps.Character_Mapping_Function)
is
SR : constant Shared_String_Access := Source.Reference;
DR : Shared_String_Access;
begin
-- Nothing to translate
if SR.Last = 0 then
null;
-- Try to reuse shared string
elsif Can_Be_Reused (SR, SR.Last) then
for J in 1 .. SR.Last loop
SR.Data (J) := Mapping.all (SR.Data (J));
end loop;
-- Otherwise allocate new shared string and fill it
else
DR := Allocate (SR.Last);
for J in 1 .. SR.Last loop
DR.Data (J) := Mapping.all (SR.Data (J));
end loop;
DR.Last := SR.Last;
Source.Reference := DR;
Unreference (SR);
end if;
exception
when others =>
if DR /= null then
Unreference (DR);
end if;
raise;
end Translate;
----------
-- Trim --
----------
function Trim
(Source : Unbounded_String;
Side : Trim_End) return Unbounded_String
is
SR : constant Shared_String_Access := Source.Reference;
DL : Natural;
DR : Shared_String_Access;
Low : Natural;
High : Natural;
begin
Low := Index_Non_Blank (Source, Forward);
-- All blanks, reuse empty shared string
if Low = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
else
case Side is
when Left =>
High := SR.Last;
DL := SR.Last - Low + 1;
when Right =>
Low := 1;
High := Index_Non_Blank (Source, Backward);
DL := High;
when Both =>
High := Index_Non_Blank (Source, Backward);
DL := High - Low + 1;
end case;
-- Length of the result is the same as length of the source string,
-- reuse source shared string.
if DL = SR.Last then
Reference (SR);
DR := SR;
-- Otherwise, allocate new shared string
else
DR := Allocate (DL);
DR.Data (1 .. DL) := SR.Data (Low .. High);
DR.Last := DL;
end if;
end if;
return (AF.Controlled with Reference => DR);
end Trim;
procedure Trim
(Source : in out Unbounded_String;
Side : Trim_End)
is
SR : constant Shared_String_Access := Source.Reference;
DL : Natural;
DR : Shared_String_Access;
Low : Natural;
High : Natural;
begin
Low := Index_Non_Blank (Source, Forward);
-- All blanks, reuse empty shared string
if Low = 0 then
Reference (Empty_Shared_String'Access);
Source.Reference := Empty_Shared_String'Access;
Unreference (SR);
else
case Side is
when Left =>
High := SR.Last;
DL := SR.Last - Low + 1;
when Right =>
Low := 1;
High := Index_Non_Blank (Source, Backward);
DL := High;
when Both =>
High := Index_Non_Blank (Source, Backward);
DL := High - Low + 1;
end case;
-- Length of the result is the same as length of the source string,
-- nothing to do.
if DL = SR.Last then
null;
-- Try to reuse existing shared string
elsif Can_Be_Reused (SR, DL) then
SR.Data (1 .. DL) := SR.Data (Low .. High);
SR.Last := DL;
-- Otherwise, allocate new shared string
else
DR := Allocate (DL);
DR.Data (1 .. DL) := SR.Data (Low .. High);
DR.Last := DL;
Source.Reference := DR;
Unreference (SR);
end if;
end if;
end Trim;
function Trim
(Source : Unbounded_String;
Left : Maps.Character_Set;
Right : Maps.Character_Set) return Unbounded_String
is
SR : constant Shared_String_Access := Source.Reference;
DL : Natural;
DR : Shared_String_Access;
Low : Natural;
High : Natural;
begin
Low := Index (Source, Left, Outside, Forward);
-- Source includes only characters from Left set, reuse empty shared
-- string.
if Low = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
else
High := Index (Source, Right, Outside, Backward);
DL := Integer'Max (0, High - Low + 1);
-- Source includes only characters from Right set or result string
-- is empty, reuse empty shared string.
if High = 0 or else DL = 0 then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (DL);
DR.Data (1 .. DL) := SR.Data (Low .. High);
DR.Last := DL;
end if;
end if;
return (AF.Controlled with Reference => DR);
end Trim;
procedure Trim
(Source : in out Unbounded_String;
Left : Maps.Character_Set;
Right : Maps.Character_Set)
is
SR : constant Shared_String_Access := Source.Reference;
DL : Natural;
DR : Shared_String_Access;
Low : Natural;
High : Natural;
begin
Low := Index (Source, Left, Outside, Forward);
-- Source includes only characters from Left set, reuse empty shared
-- string.
if Low = 0 then
Reference (Empty_Shared_String'Access);
Source.Reference := Empty_Shared_String'Access;
Unreference (SR);
else
High := Index (Source, Right, Outside, Backward);
DL := Integer'Max (0, High - Low + 1);
-- Source includes only characters from Right set or result string
-- is empty, reuse empty shared string.
if High = 0 or else DL = 0 then
Reference (Empty_Shared_String'Access);
Source.Reference := Empty_Shared_String'Access;
Unreference (SR);
-- Try to reuse existing shared string
elsif Can_Be_Reused (SR, DL) then
SR.Data (1 .. DL) := SR.Data (Low .. High);
SR.Last := DL;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (DL);
DR.Data (1 .. DL) := SR.Data (Low .. High);
DR.Last := DL;
Source.Reference := DR;
Unreference (SR);
end if;
end if;
end Trim;
---------------------
-- Unbounded_Slice --
---------------------
function Unbounded_Slice
(Source : Unbounded_String;
Low : Positive;
High : Natural) return Unbounded_String
is
SR : constant Shared_String_Access := Source.Reference;
DL : Natural;
DR : Shared_String_Access;
begin
-- Check bounds
if Low > SR.Last + 1 or else High > SR.Last then
raise Index_Error;
-- Result is empty slice, reuse empty shared string
elsif Low > High then
Reference (Empty_Shared_String'Access);
DR := Empty_Shared_String'Access;
-- Otherwise, allocate new shared string and fill it
else
DL := High - Low + 1;
DR := Allocate (DL);
DR.Data (1 .. DL) := SR.Data (Low .. High);
DR.Last := DL;
end if;
return (AF.Controlled with Reference => DR);
end Unbounded_Slice;
procedure Unbounded_Slice
(Source : Unbounded_String;
Target : out Unbounded_String;
Low : Positive;
High : Natural)
is
SR : constant Shared_String_Access := Source.Reference;
TR : constant Shared_String_Access := Target.Reference;
DL : Natural;
DR : Shared_String_Access;
begin
-- Check bounds
if Low > SR.Last + 1 or else High > SR.Last then
raise Index_Error;
-- Result is empty slice, reuse empty shared string
elsif Low > High then
Reference (Empty_Shared_String'Access);
Target.Reference := Empty_Shared_String'Access;
Unreference (TR);
else
DL := High - Low + 1;
-- Try to reuse existing shared string
if Can_Be_Reused (TR, DL) then
TR.Data (1 .. DL) := SR.Data (Low .. High);
TR.Last := DL;
-- Otherwise, allocate new shared string and fill it
else
DR := Allocate (DL);
DR.Data (1 .. DL) := SR.Data (Low .. High);
DR.Last := DL;
Target.Reference := DR;
Unreference (TR);
end if;
end if;
end Unbounded_Slice;
-----------------
-- Unreference --
-----------------
procedure Unreference (Item : not null Shared_String_Access) is
procedure Free is
new Ada.Unchecked_Deallocation (Shared_String, Shared_String_Access);
Aux : Shared_String_Access := Item;
begin
if System.Atomic_Counters.Decrement (Aux.Counter) then
-- Reference counter of Empty_Shared_String should never reach
-- zero. We check here in case it wraps around.
if Aux /= Empty_Shared_String'Access then
Free (Aux);
end if;
end if;
end Unreference;
end Ada.Strings.Unbounded;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Tools Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2015, 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 Asis.Definitions;
with Asis.Elements;
package body Properties.Definitions.Component_Definition is
---------------
-- Alignment --
---------------
function Alignment
(Engine : access Engines.Contexts.Context;
Element : Asis.Definition;
Name : Engines.Integer_Property) return Integer
is
Subtipe : constant Asis.Definition :=
Asis.Definitions.Component_Definition_View (Element);
begin
return Engine.Integer.Get_Property (Subtipe, Name);
end Alignment;
------------
-- Bounds --
------------
function Bounds
(Engine : access Engines.Contexts.Context;
Element : Asis.Definition;
Name : Engines.Text_Property) return League.Strings.Universal_String
is
Subtipe : constant Asis.Definition :=
Asis.Definitions.Component_Definition_View (Element);
begin
return Engine.Text.Get_Property (Subtipe, Name);
end Bounds;
----------------
-- Initialize --
----------------
function Initialize
(Engine : access Engines.Contexts.Context;
Element : Asis.Definition;
Name : Engines.Text_Property) return League.Strings.Universal_String
is
Text : League.Strings.Universal_String;
Down : League.Strings.Universal_String;
Subtipe : constant Asis.Definition :=
Asis.Definitions.Component_Definition_View (Element);
Is_Simple_Ref : constant Boolean :=
Engine.Boolean.Get_Property (Element, Engines.Is_Simple_Ref);
begin
if Is_Simple_Ref then
Text.Append ("new _ec._singleton(");
end if;
Down := Engine.Text.Get_Property (Subtipe, Name);
Text.Append (Down);
if Is_Simple_Ref then
Text.Append (")");
end if;
return Text;
end Initialize;
-------------------
-- Is_Simple_Ref --
-------------------
function Is_Simple_Ref
(Engine : access Engines.Contexts.Context;
Element : Asis.Declaration;
Name : Engines.Boolean_Property) return Boolean
is
pragma Unreferenced (Name);
Tipe : constant Asis.Definition :=
Asis.Definitions.Component_Definition_View (Element);
Is_Simple_Type : constant Boolean :=
Engine.Boolean.Get_Property (Tipe, Engines.Is_Simple_Type);
begin
return Is_Simple_Type and then Asis.Elements.Has_Aliased (Element);
end Is_Simple_Ref;
end Properties.Definitions.Component_Definition;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- ADA.STRINGS.WIDE_UNBOUNDED.WIDE_TEXT_IO --
-- --
-- S p e c --
-- --
-- Copyright (C) 1997-2005, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This child package of Ada.Strings.Wide_Unbounded provides specialized
-- Wide_Text_IO routines that work directly with unbounded wide strings,
-- avoiding the inefficiencies of access via the standard interface, and also
-- taking direct advantage of the variable length semantics of these strings.
with Ada.Wide_Text_IO;
package Ada.Strings.Wide_Unbounded.Wide_Text_IO is
function Get_Line
return Unbounded_Wide_String;
function Get_Line
(File : Ada.Wide_Text_IO.File_Type) return Unbounded_Wide_String;
-- Reads up to the end of the current line, returning the result
-- as an unbounded string of appropriate length. If no File parameter
-- is present, input is from Current_Input.
procedure Get_Line
(File : Ada.Wide_Text_IO.File_Type;
Item : out Unbounded_Wide_String);
procedure Get_Line (Item : out Unbounded_Wide_String);
-- Similar to the above, but in procedure form with an out parameter
procedure Put
(U : Unbounded_Wide_String);
procedure Put
(File : Ada.Wide_Text_IO.File_Type;
U : Unbounded_Wide_String);
procedure Put_Line
(U : Unbounded_Wide_String);
procedure Put_Line
(File : Ada.Wide_Text_IO.File_Type;
U : Unbounded_Wide_String);
-- These are equivalent to the standard Wide_Text_IO routines passed the
-- value To_Wide_String (U), but operate more efficiently, because the
-- extra copy of the argument is avoided.
end Ada.Strings.Wide_Unbounded.Wide_Text_IO;
|
------------------------------------------------------------------------------
-- --
-- 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.Utp.Time_Out_Actions.Hash is
new AMF.Elements.Generic_Hash (Utp_Time_Out_Action, Utp_Time_Out_Action_Access);
|
with Ada.Text_IO; use Ada.Text_IO;
package body AssignmentByIfExamples is
function Example1_Pattern1 (condition : Boolean) return Boolean;
function Example1_Pattern1 (condition : Boolean) return Boolean is
variable : Boolean;
begin
if condition then
variable := True;
else
variable := False;
end if;
return variable;
end Example1_Pattern1;
function Example2_Pattern1 (condition : Boolean) return Boolean;
function Example2_Pattern1 (condition : Boolean) return Boolean is
AB : array (1 .. 1) of Boolean;
begin
if not condition then
AB (1) := True;
else
AB (1) := False;
end if;
return AB (1);
end Example2_Pattern1;
function Example_Pattern2 (condition : Boolean) return Boolean;
function Example_Pattern2 (condition : Boolean) return Boolean is
variable : Boolean;
begin
variable := False;
if condition then
variable := True;
end if;
return variable;
end Example_Pattern2;
function Example_Pattern3 (condition : Boolean) return Boolean;
function Example_Pattern3 (condition : Boolean) return Boolean is
variable : Boolean := False;
begin
if condition then
variable := True;
end if;
return variable;
end Example_Pattern3;
procedure Dummy is
begin
if Example1_Pattern1 (True) and then
Example2_Pattern1 (True) and then
Example_Pattern2 (True) and then
Example_Pattern3 (True)
then
Put_Line ("True");
end if;
end Dummy;
end AssignmentByIfExamples;
|
with HK_Data; use HK_Data;
with TTC_Data; use TTC_Data;
package TTC is
procedure Receive (Data : out Sensor_Reading);
function Next_TM return TM_Message;
end TTC;
|
with Layered_Abstraction_P;
generic
with package P1 is new Layered_Abstraction_P(<>);
with package P2 is new Layered_Abstraction_P(T => P1.T, Obj => <>);
package Layered_Abstraction is
pragma Elaborate_Body;
X : P1.T := P2.Obj; -- Both P1.T and P2.Obj are visible because
-- they were not specified in the formal package. -- Note that P2.T is not visible since it
-- is required to match P1.T
use P1; -- to make equality immediately visible
Yes : Boolean := P1.Obj2 = P2.Obj2;
end Layered_Abstraction;
|
------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding Samples --
-- --
-- ncurses --
-- --
-- B O D Y --
-- --
------------------------------------------------------------------------------
-- Copyright (c) 2000 Free Software Foundation, Inc. --
-- --
-- Permission is hereby granted, free of charge, to any person obtaining a --
-- copy of this software and associated documentation files (the --
-- "Software"), to deal in the Software without restriction, including --
-- without limitation the rights to use, copy, modify, merge, publish, --
-- distribute, distribute with modifications, sublicense, and/or sell --
-- copies of the Software, and to permit persons to whom the Software is --
-- furnished to do so, subject to the following conditions: --
-- --
-- The above copyright notice and this permission notice shall be included --
-- in all copies or substantial portions of the Software. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS --
-- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF --
-- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. --
-- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, --
-- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR --
-- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR --
-- THE USE OR OTHER DEALINGS IN THE SOFTWARE. --
-- --
-- Except as contained in this notice, the name(s) of the above copyright --
-- holders shall not be used in advertising or otherwise to promote the --
-- sale, use or other dealings in this Software without prior written --
-- authorization. --
------------------------------------------------------------------------------
-- Author: Eugene V. Melaragno <aldomel@ix.netcom.com> 2000
-- Version Control
-- $Revision: 1.1 $
-- Binding Version 01.00
------------------------------------------------------------------------------
procedure getch_test;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 4 0 --
-- --
-- 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 = 40
package System.Pack_40 is
pragma Preelaborate;
Bits : constant := 40;
type Bits_40 is mod 2 ** Bits;
for Bits_40'Size use Bits;
function Get_40 (Arr : System.Address; N : Natural) return Bits_40;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned.
procedure Set_40 (Arr : System.Address; N : Natural; E : Bits_40);
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is set to the given value.
function GetU_40 (Arr : System.Address; N : Natural) return Bits_40;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned. This version
-- is used when Arr may represent an unaligned address.
procedure SetU_40 (Arr : System.Address; N : Natural; E : Bits_40);
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is set to the given value. This version
-- is used when Arr may represent an unaligned address
end System.Pack_40;
|
with kv.avm.Line_Parser;
generic
type Reader is new kv.avm.Line_Parser.Parse_Line_Interface with private;
package kv.avm.File_Reader is
procedure Parse_Input_File
(Self : in out Reader;
File_In : in String);
end kv.avm.File_Reader;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Testsuite Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2014, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with League.Strings;
procedure Test_368 is
Lit : constant Wide_Wide_String := "11" &
Wide_Wide_Character'Val (16#8FFFF#) & "22";
Text : League.Strings.Universal_String :=
League.Strings.To_Universal_String (Lit);
begin
Text.Replace (5, 5, "
");
Text.Replace (4, 4, "
");
end Test_368;
|
------------------------------------------------------------------------------
-- --
-- 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.Generic_Hash;
function AMF.UML.Create_Link_Actions.Hash is
new AMF.Elements.Generic_Hash (UML_Create_Link_Action, UML_Create_Link_Action_Access);
|
with Interfaces; use Interfaces;
package Bitmap_Graphics is
type Color is (Black, White);
for Color use (Black => 0, White => 255);
type Point is record
X : Natural;
Y : Natural;
end record;
type Size is record
Width : Natural;
Height : Natural;
end record;
type Byte_Array is array (Natural range <>) of Unsigned_8;
type Byte_Array_Access is access all Byte_Array;
type Bitmap_Icon is (Signal, Message, Battery, Bluetooth, GPRS, Alarm);
procedure Get_Icon
(Icon : Bitmap_Icon;
Width : out Natural;
Height: out Natural;
Data : out Byte_Array_Access);
type Font is record
Width, Height : Natural;
Data : Byte_Array_Access;
end record;
type Font_Access is access all Font;
function Get_Font(Size: Positive) return Font_Access;
end Bitmap_Graphics;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUNTIME COMPONENTS --
-- --
-- ADA.STRINGS.WIDE_UNBOUNDED.WIDE_TEXT_IO --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1997-1999 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Ada.Wide_Text_IO; use Ada.Wide_Text_IO;
package body Ada.Strings.Wide_Unbounded.Wide_Text_IO is
--------------
-- Get_Line --
--------------
function Get_Line return Unbounded_Wide_String is
Buffer : Wide_String (1 .. 1000);
Last : Natural;
Str1 : Wide_String_Access;
Str2 : Wide_String_Access;
begin
Get_Line (Buffer, Last);
Str1 := new Wide_String'(Buffer (1 .. Last));
while Last = Buffer'Last loop
Get_Line (Buffer, Last);
Str2 := new Wide_String'(Str1.all & Buffer (1 .. Last));
Free (Str1);
Str1 := Str2;
end loop;
return To_Unbounded_Wide_String (Str1.all);
end Get_Line;
function Get_Line
(File : Ada.Wide_Text_IO.File_Type)
return Unbounded_Wide_String
is
Buffer : Wide_String (1 .. 1000);
Last : Natural;
Str1 : Wide_String_Access;
Str2 : Wide_String_Access;
begin
Get_Line (File, Buffer, Last);
Str1 := new Wide_String'(Buffer (1 .. Last));
while Last = Buffer'Last loop
Get_Line (File, Buffer, Last);
Str2 := new Wide_String'(Str1.all & Buffer (1 .. Last));
Free (Str1);
Str1 := Str2;
end loop;
return To_Unbounded_Wide_String (Str1.all);
end Get_Line;
---------
-- Put --
---------
procedure Put (U : Unbounded_Wide_String) is
begin
Put (To_Wide_String (U));
end Put;
procedure Put (File : File_Type; U : Unbounded_Wide_String) is
begin
Put (File, To_Wide_String (U));
end Put;
--------------
-- Put_Line --
--------------
procedure Put_Line (U : Unbounded_Wide_String) is
begin
Put_Line (To_Wide_String (U));
end Put_Line;
procedure Put_Line (File : File_Type; U : Unbounded_Wide_String) is
begin
Put_Line (File, To_Wide_String (U));
end Put_Line;
end Ada.Strings.Wide_Unbounded.Wide_Text_IO;
|
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="14">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>DCT_8x8_2D</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>G</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>G</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</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>subimg</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>subimg</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>2</direction>
<if_type>1</if_type>
<array_size>64</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>shift</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>shift</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_4">
<Value>
<Obj>
<type>1</type>
<id>4</id>
<name>inv</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>inv</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_5">
<Value>
<Obj>
<type>1</type>
<id>5</id>
<name>cosMat</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>cosMat</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</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>47</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>inv_read</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>inv</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>79</item>
<item>80</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name>shift_read</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>shift</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>81</item>
<item>82</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name>tmp</name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>97</lineNumber>
<contextFuncName>DCT_8x8_2D</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>C:\Users\Venci\Videos\Project</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>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>97</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>83</item>
<item>85</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name></name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>97</lineNumber>
<contextFuncName>DCT_8x8_2D</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>97</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>86</item>
<item>87</item>
<item>88</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>17</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>89</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>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>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>91</item>
<item>92</item>
<item>94</item>
<item>95</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>tmp_s</name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>88</lineNumber>
<contextFuncName>shift128</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>98</second>
</item>
<item>
<first>
<first>definition.cpp</first>
<second>shift128</second>
</first>
<second>88</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>97</item>
<item>98</item>
<item>100</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>tmp_32_cast</name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>88</lineNumber>
<contextFuncName>shift128</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>98</second>
</item>
<item>
<first>
<first>definition.cpp</first>
<second>shift128</second>
</first>
<second>88</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>101</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>exitcond1_i</name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>88</lineNumber>
<contextFuncName>shift128</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>98</second>
</item>
<item>
<first>
<first>definition.cpp</first>
<second>shift128</second>
</first>
<second>88</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>102</item>
<item>104</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>i_1</name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>88</lineNumber>
<contextFuncName>shift128</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>98</second>
</item>
<item>
<first>
<first>definition.cpp</first>
<second>shift128</second>
</first>
<second>88</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>105</item>
<item>107</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name></name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>88</lineNumber>
<contextFuncName>shift128</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>98</second>
</item>
<item>
<first>
<first>definition.cpp</first>
<second>shift128</second>
</first>
<second>88</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>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name></name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>90</lineNumber>
<contextFuncName>shift128</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>98</second>
</item>
<item>
<first>
<first>definition.cpp</first>
<second>shift128</second>
</first>
<second>90</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>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>j_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>4</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>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>j_i_cast3_cast</name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>90</lineNumber>
<contextFuncName>shift128</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>98</second>
</item>
<item>
<first>
<first>definition.cpp</first>
<second>shift128</second>
</first>
<second>90</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>116</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>tmp_27</name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>90</lineNumber>
<contextFuncName>shift128</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>98</second>
</item>
<item>
<first>
<first>definition.cpp</first>
<second>shift128</second>
</first>
<second>90</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>117</item>
<item>118</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>tmp_33_cast</name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>90</lineNumber>
<contextFuncName>shift128</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>98</second>
</item>
<item>
<first>
<first>definition.cpp</first>
<second>shift128</second>
</first>
<second>90</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>119</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>subimg_addr</name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>90</lineNumber>
<contextFuncName>shift128</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>98</second>
</item>
<item>
<first>
<first>definition.cpp</first>
<second>shift128</second>
</first>
<second>90</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>120</item>
<item>122</item>
<item>123</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>exitcond_i</name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>89</lineNumber>
<contextFuncName>shift128</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>98</second>
</item>
<item>
<first>
<first>definition.cpp</first>
<second>shift128</second>
</first>
<second>89</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>124</item>
<item>125</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>j_1</name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>89</lineNumber>
<contextFuncName>shift128</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>98</second>
</item>
<item>
<first>
<first>definition.cpp</first>
<second>shift128</second>
</first>
<second>89</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>126</item>
<item>127</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name></name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>89</lineNumber>
<contextFuncName>shift128</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>98</second>
</item>
<item>
<first>
<first>definition.cpp</first>
<second>shift128</second>
</first>
<second>89</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>128</item>
<item>129</item>
<item>130</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>subimg_load</name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>90</lineNumber>
<contextFuncName>shift128</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>98</second>
</item>
<item>
<first>
<first>definition.cpp</first>
<second>shift128</second>
</first>
<second>90</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>131</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>tmp_i</name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>90</lineNumber>
<contextFuncName>shift128</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>98</second>
</item>
<item>
<first>
<first>definition.cpp</first>
<second>shift128</second>
</first>
<second>90</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>132</item>
<item>134</item>
</oprand_edges>
<opcode>fadd</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name></name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>90</lineNumber>
<contextFuncName>shift128</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>98</second>
</item>
<item>
<first>
<first>definition.cpp</first>
<second>shift128</second>
</first>
<second>90</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>135</item>
<item>136</item>
<item>237</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name></name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>89</lineNumber>
<contextFuncName>shift128</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>98</second>
</item>
<item>
<first>
<first>definition.cpp</first>
<second>shift128</second>
</first>
<second>89</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>137</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>44</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>90</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>46</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>138</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name></name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>101</lineNumber>
<contextFuncName>DCT_8x8_2D</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>101</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>139</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>141</item>
<item>142</item>
<item>143</item>
<item>144</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>51</id>
<name>tmp_28</name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>101</lineNumber>
<contextFuncName>DCT_8x8_2D</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>101</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>145</item>
<item>146</item>
<item>147</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name>tmp_35_cast</name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>101</lineNumber>
<contextFuncName>DCT_8x8_2D</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>101</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>148</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>exitcond1</name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>101</lineNumber>
<contextFuncName>DCT_8x8_2D</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>101</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>149</item>
<item>150</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>i_2</name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>101</lineNumber>
<contextFuncName>DCT_8x8_2D</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>101</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>151</item>
<item>152</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name></name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>101</lineNumber>
<contextFuncName>DCT_8x8_2D</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>101</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>153</item>
<item>154</item>
<item>155</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name></name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>103</lineNumber>
<contextFuncName>DCT_8x8_2D</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</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>156</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name>j</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>4</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>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>61</id>
<name>j_cast1_cast</name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>103</lineNumber>
<contextFuncName>DCT_8x8_2D</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>103</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>161</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>62</id>
<name>tmp_29</name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>103</lineNumber>
<contextFuncName>DCT_8x8_2D</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>103</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>162</item>
<item>163</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>63</id>
<name>tmp_36_cast</name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>103</lineNumber>
<contextFuncName>DCT_8x8_2D</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>103</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>164</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>64</id>
<name>G_addr</name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>103</lineNumber>
<contextFuncName>DCT_8x8_2D</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>103</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>165</item>
<item>166</item>
<item>167</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>65</id>
<name>exitcond</name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>102</lineNumber>
<contextFuncName>DCT_8x8_2D</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>102</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>168</item>
<item>169</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>67</id>
<name>j_2</name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>102</lineNumber>
<contextFuncName>DCT_8x8_2D</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>102</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>170</item>
<item>171</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>68</id>
<name></name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>102</lineNumber>
<contextFuncName>DCT_8x8_2D</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>102</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>172</item>
<item>173</item>
<item>174</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>70</id>
<name>tmp_11</name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>103</lineNumber>
<contextFuncName>DCT_8x8_2D</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>103</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>6</count>
<item_version>0</item_version>
<item>176</item>
<item>177</item>
<item>178</item>
<item>179</item>
<item>180</item>
<item>181</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>71</id>
<name></name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>103</lineNumber>
<contextFuncName>DCT_8x8_2D</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>103</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>182</item>
<item>183</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>72</id>
<name></name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>102</lineNumber>
<contextFuncName>DCT_8x8_2D</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>102</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>184</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>74</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<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>
</item>
<item class_id_reference="9" object_id="_52">
<Value>
<Obj>
<type>0</type>
<id>76</id>
<name></name>
<fileName>definition.cpp</fileName>
<fileDirectory>C:\Users\Venci\Videos\Project</fileDirectory>
<lineNumber>104</lineNumber>
<contextFuncName>DCT_8x8_2D</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>DCT_8x8_2D</second>
</first>
<second>104</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>8</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_53">
<Value>
<Obj>
<type>2</type>
<id>84</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="_54">
<Value>
<Obj>
<type>2</type>
<id>93</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_55">
<Value>
<Obj>
<type>2</type>
<id>99</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_56">
<Value>
<Obj>
<type>2</type>
<id>103</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_57">
<Value>
<Obj>
<type>2</type>
<id>106</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_58">
<Value>
<Obj>
<type>2</type>
<id>121</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="_59">
<Value>
<Obj>
<type>2</type>
<id>133</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>1</const_type>
<content>-128</content>
</item>
<item class_id_reference="16" object_id="_60">
<Value>
<Obj>
<type>2</type>
<id>175</id>
<name>singleGUV</name>
<fileName></fileName>
<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>6</const_type>
<content><constant:singleGUV></content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>15</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_61">
<Obj>
<type>3</type>
<id>16</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>12</item>
<item>13</item>
<item>14</item>
<item>15</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_62">
<Obj>
<type>3</type>
<id>18</id>
<name>.preheader4.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>17</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_63">
<Obj>
<type>3</type>
<id>26</id>
<name>.preheader4</name>
<fileName></fileName>
<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>19</item>
<item>20</item>
<item>21</item>
<item>22</item>
<item>24</item>
<item>25</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_64">
<Obj>
<type>3</type>
<id>28</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>27</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_65">
<Obj>
<type>3</type>
<id>38</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>8</count>
<item_version>0</item_version>
<item>29</item>
<item>30</item>
<item>31</item>
<item>32</item>
<item>33</item>
<item>34</item>
<item>36</item>
<item>37</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_66">
<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>4</count>
<item_version>0</item_version>
<item>39</item>
<item>40</item>
<item>41</item>
<item>42</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_67">
<Obj>
<type>3</type>
<id>45</id>
<name>.preheader4.loopexit</name>
<fileName></fileName>
<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>44</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_68">
<Obj>
<type>3</type>
<id>47</id>
<name>._crit_edge.loopexit</name>
<fileName></fileName>
<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>46</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_69">
<Obj>
<type>3</type>
<id>49</id>
<name>._crit_edge</name>
<fileName></fileName>
<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>48</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_70">
<Obj>
<type>3</type>
<id>57</id>
<name>.loopexit</name>
<fileName></fileName>
<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="_71">
<Obj>
<type>3</type>
<id>59</id>
<name>.preheader.preheader</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_72">
<Obj>
<type>3</type>
<id>69</id>
<name>.preheader</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>8</count>
<item_version>0</item_version>
<item>60</item>
<item>61</item>
<item>62</item>
<item>63</item>
<item>64</item>
<item>65</item>
<item>67</item>
<item>68</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_73">
<Obj>
<type>3</type>
<id>73</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>70</item>
<item>71</item>
<item>72</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_74">
<Obj>
<type>3</type>
<id>75</id>
<name>.loopexit.loopexit</name>
<fileName></fileName>
<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>74</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_75">
<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>1</count>
<item_version>0</item_version>
<item>76</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>113</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_76">
<id>80</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_77">
<id>82</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_78">
<id>83</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_79">
<id>85</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_80">
<id>86</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_81">
<id>87</id>
<edge_type>2</edge_type>
<source_obj>49</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_82">
<id>88</id>
<edge_type>2</edge_type>
<source_obj>18</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_83">
<id>89</id>
<edge_type>2</edge_type>
<source_obj>26</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_84">
<id>90</id>
<edge_type>2</edge_type>
<source_obj>26</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_85">
<id>91</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_86">
<id>92</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_87">
<id>94</id>
<edge_type>1</edge_type>
<source_obj>93</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_88">
<id>95</id>
<edge_type>2</edge_type>
<source_obj>18</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_89">
<id>98</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_90">
<id>100</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_91">
<id>101</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_92">
<id>102</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_93">
<id>104</id>
<edge_type>1</edge_type>
<source_obj>103</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_94">
<id>105</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_95">
<id>107</id>
<edge_type>1</edge_type>
<source_obj>106</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_96">
<id>108</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_97">
<id>109</id>
<edge_type>2</edge_type>
<source_obj>28</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_98">
<id>110</id>
<edge_type>2</edge_type>
<source_obj>47</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_99">
<id>111</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_100">
<id>112</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_101">
<id>113</id>
<edge_type>2</edge_type>
<source_obj>43</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_102">
<id>114</id>
<edge_type>1</edge_type>
<source_obj>93</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_103">
<id>115</id>
<edge_type>2</edge_type>
<source_obj>28</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_104">
<id>116</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_105">
<id>117</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_106">
<id>118</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_107">
<id>119</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_108">
<id>120</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_109">
<id>122</id>
<edge_type>1</edge_type>
<source_obj>121</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_110">
<id>123</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_111">
<id>124</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_112">
<id>125</id>
<edge_type>1</edge_type>
<source_obj>103</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_113">
<id>126</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_114">
<id>127</id>
<edge_type>1</edge_type>
<source_obj>106</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_115">
<id>128</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_116">
<id>129</id>
<edge_type>2</edge_type>
<source_obj>43</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_117">
<id>130</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_118">
<id>131</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_119">
<id>132</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_120">
<id>134</id>
<edge_type>1</edge_type>
<source_obj>133</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_121">
<id>135</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_122">
<id>136</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_123">
<id>137</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_124">
<id>138</id>
<edge_type>2</edge_type>
<source_obj>49</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_125">
<id>139</id>
<edge_type>2</edge_type>
<source_obj>57</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_126">
<id>140</id>
<edge_type>2</edge_type>
<source_obj>57</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_127">
<id>141</id>
<edge_type>1</edge_type>
<source_obj>93</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_128">
<id>142</id>
<edge_type>2</edge_type>
<source_obj>49</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_129">
<id>143</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_130">
<id>144</id>
<edge_type>2</edge_type>
<source_obj>75</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_131">
<id>146</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>51</sink_obj>
</item>
<item class_id_reference="20" object_id="_132">
<id>147</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>51</sink_obj>
</item>
<item class_id_reference="20" object_id="_133">
<id>148</id>
<edge_type>1</edge_type>
<source_obj>51</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_134">
<id>149</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_135">
<id>150</id>
<edge_type>1</edge_type>
<source_obj>103</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_136">
<id>151</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>55</sink_obj>
</item>
<item class_id_reference="20" object_id="_137">
<id>152</id>
<edge_type>1</edge_type>
<source_obj>106</source_obj>
<sink_obj>55</sink_obj>
</item>
<item class_id_reference="20" object_id="_138">
<id>153</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_139">
<id>154</id>
<edge_type>2</edge_type>
<source_obj>59</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_140">
<id>155</id>
<edge_type>2</edge_type>
<source_obj>77</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_141">
<id>156</id>
<edge_type>2</edge_type>
<source_obj>69</source_obj>
<sink_obj>58</sink_obj>
</item>
<item class_id_reference="20" object_id="_142">
<id>157</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_143">
<id>158</id>
<edge_type>2</edge_type>
<source_obj>73</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_144">
<id>159</id>
<edge_type>1</edge_type>
<source_obj>93</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_145">
<id>160</id>
<edge_type>2</edge_type>
<source_obj>59</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_146">
<id>161</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>61</sink_obj>
</item>
<item class_id_reference="20" object_id="_147">
<id>162</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>62</sink_obj>
</item>
<item class_id_reference="20" object_id="_148">
<id>163</id>
<edge_type>1</edge_type>
<source_obj>61</source_obj>
<sink_obj>62</sink_obj>
</item>
<item class_id_reference="20" object_id="_149">
<id>164</id>
<edge_type>1</edge_type>
<source_obj>62</source_obj>
<sink_obj>63</sink_obj>
</item>
<item class_id_reference="20" object_id="_150">
<id>165</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>64</sink_obj>
</item>
<item class_id_reference="20" object_id="_151">
<id>166</id>
<edge_type>1</edge_type>
<source_obj>121</source_obj>
<sink_obj>64</sink_obj>
</item>
<item class_id_reference="20" object_id="_152">
<id>167</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>64</sink_obj>
</item>
<item class_id_reference="20" object_id="_153">
<id>168</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_154">
<id>169</id>
<edge_type>1</edge_type>
<source_obj>103</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_155">
<id>170</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>67</sink_obj>
</item>
<item class_id_reference="20" object_id="_156">
<id>171</id>
<edge_type>1</edge_type>
<source_obj>106</source_obj>
<sink_obj>67</sink_obj>
</item>
<item class_id_reference="20" object_id="_157">
<id>172</id>
<edge_type>1</edge_type>
<source_obj>65</source_obj>
<sink_obj>68</sink_obj>
</item>
<item class_id_reference="20" object_id="_158">
<id>173</id>
<edge_type>2</edge_type>
<source_obj>73</source_obj>
<sink_obj>68</sink_obj>
</item>
<item class_id_reference="20" object_id="_159">
<id>174</id>
<edge_type>2</edge_type>
<source_obj>75</source_obj>
<sink_obj>68</sink_obj>
</item>
<item class_id_reference="20" object_id="_160">
<id>176</id>
<edge_type>1</edge_type>
<source_obj>175</source_obj>
<sink_obj>70</sink_obj>
</item>
<item class_id_reference="20" object_id="_161">
<id>177</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>70</sink_obj>
</item>
<item class_id_reference="20" object_id="_162">
<id>178</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>70</sink_obj>
</item>
<item class_id_reference="20" object_id="_163">
<id>179</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>70</sink_obj>
</item>
<item class_id_reference="20" object_id="_164">
<id>180</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>70</sink_obj>
</item>
<item class_id_reference="20" object_id="_165">
<id>181</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>70</sink_obj>
</item>
<item class_id_reference="20" object_id="_166">
<id>182</id>
<edge_type>1</edge_type>
<source_obj>70</source_obj>
<sink_obj>71</sink_obj>
</item>
<item class_id_reference="20" object_id="_167">
<id>183</id>
<edge_type>1</edge_type>
<source_obj>64</source_obj>
<sink_obj>71</sink_obj>
</item>
<item class_id_reference="20" object_id="_168">
<id>184</id>
<edge_type>2</edge_type>
<source_obj>69</source_obj>
<sink_obj>72</sink_obj>
</item>
<item class_id_reference="20" object_id="_169">
<id>218</id>
<edge_type>2</edge_type>
<source_obj>16</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_170">
<id>219</id>
<edge_type>2</edge_type>
<source_obj>16</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_171">
<id>220</id>
<edge_type>2</edge_type>
<source_obj>18</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_172">
<id>221</id>
<edge_type>2</edge_type>
<source_obj>26</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_173">
<id>222</id>
<edge_type>2</edge_type>
<source_obj>26</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_174">
<id>223</id>
<edge_type>2</edge_type>
<source_obj>28</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_175">
<id>224</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_176">
<id>225</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_177">
<id>226</id>
<edge_type>2</edge_type>
<source_obj>43</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_178">
<id>227</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_179">
<id>228</id>
<edge_type>2</edge_type>
<source_obj>47</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_180">
<id>229</id>
<edge_type>2</edge_type>
<source_obj>49</source_obj>
<sink_obj>57</sink_obj>
</item>
<item class_id_reference="20" object_id="_181">
<id>230</id>
<edge_type>2</edge_type>
<source_obj>57</source_obj>
<sink_obj>77</sink_obj>
</item>
<item class_id_reference="20" object_id="_182">
<id>231</id>
<edge_type>2</edge_type>
<source_obj>57</source_obj>
<sink_obj>59</sink_obj>
</item>
<item class_id_reference="20" object_id="_183">
<id>232</id>
<edge_type>2</edge_type>
<source_obj>59</source_obj>
<sink_obj>69</sink_obj>
</item>
<item class_id_reference="20" object_id="_184">
<id>233</id>
<edge_type>2</edge_type>
<source_obj>69</source_obj>
<sink_obj>75</sink_obj>
</item>
<item class_id_reference="20" object_id="_185">
<id>234</id>
<edge_type>2</edge_type>
<source_obj>69</source_obj>
<sink_obj>73</sink_obj>
</item>
<item class_id_reference="20" object_id="_186">
<id>235</id>
<edge_type>2</edge_type>
<source_obj>73</source_obj>
<sink_obj>69</sink_obj>
</item>
<item class_id_reference="20" object_id="_187">
<id>236</id>
<edge_type>2</edge_type>
<source_obj>75</source_obj>
<sink_obj>57</sink_obj>
</item>
<item class_id_reference="20" object_id="_188">
<id>237</id>
<edge_type>4</edge_type>
<source_obj>39</source_obj>
<sink_obj>41</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>13</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_189">
<mId>1</mId>
<mTag>DCT_8x8_2D</mTag>
<mType>0</mType>
<sub_regions>
<count>6</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>7</item>
<item>8</item>
<item>9</item>
<item>13</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>92450</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_190">
<mId>2</mId>
<mTag>Entry</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>16</item>
<item>18</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="_191">
<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>8</mMinTripCount>
<mMaxTripCount>8</mMaxTripCount>
<mMinLatency>336</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_192">
<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>26</item>
<item>28</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="_193">
<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>38</item>
<item>43</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>8</mMinTripCount>
<mMaxTripCount>8</mMaxTripCount>
<mMinLatency>40</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_194">
<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>45</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="_195">
<mId>7</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>47</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="_196">
<mId>8</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>49</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="_197">
<mId>9</mId>
<mTag>Loop 2</mTag>
<mType>1</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>10</item>
<item>11</item>
<item>12</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>92112</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_198">
<mId>10</mId>
<mTag>Region 5</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>59</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="_199">
<mId>11</mId>
<mTag>Loop 2.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>69</item>
<item>73</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>8</mMinTripCount>
<mMaxTripCount>8</mMaxTripCount>
<mMinLatency>11512</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_200">
<mId>12</mId>
<mTag>Region 6</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>75</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="_201">
<mId>13</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>77</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_202">
<states class_id="25" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_203">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>11</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_204">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_205">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_206">
<id>8</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_207">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_208">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_209">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_210">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_211">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_212">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_213">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_214">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_215">
<id>2</id>
<operations>
<count>10</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_216">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_217">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_218">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_219">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_220">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_221">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_222">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_223">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_224">
<id>46</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_225">
<id>48</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_226">
<id>3</id>
<operations>
<count>11</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_227">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_228">
<id>30</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_229">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_230">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_231">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_232">
<id>34</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_233">
<id>35</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_234">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_235">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_236">
<id>39</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_237">
<id>44</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_238">
<id>4</id>
<operations>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_239">
<id>39</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_240">
<id>40</id>
<stage>4</stage>
<latency>4</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_241">
<id>5</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_242">
<id>40</id>
<stage>3</stage>
<latency>4</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_243">
<id>6</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_244">
<id>40</id>
<stage>2</stage>
<latency>4</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_245">
<id>7</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_246">
<id>40</id>
<stage>1</stage>
<latency>4</latency>
</item>
<item class_id_reference="28" object_id="_247">
<id>41</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_248">
<id>42</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_249">
<id>8</id>
<operations>
<count>9</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_250">
<id>50</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_251">
<id>51</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_252">
<id>52</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_253">
<id>53</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_254">
<id>54</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_255">
<id>55</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_256">
<id>56</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_257">
<id>58</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_258">
<id>76</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_259">
<id>9</id>
<operations>
<count>11</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_260">
<id>60</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_261">
<id>61</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_262">
<id>62</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_263">
<id>63</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_264">
<id>64</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_265">
<id>65</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_266">
<id>66</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_267">
<id>67</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_268">
<id>68</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_269">
<id>70</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_270">
<id>74</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_271">
<id>10</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_272">
<id>70</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_273">
<id>71</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_274">
<id>72</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>13</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_275">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>31</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="_276">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>35</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>2</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>14</first>
<second>0</second>
</first>
<second>0</second>
</item>
<item>
<first>
<first>22</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_277">
<inState>3</inState>
<outState>4</outState>
<condition>
<id>36</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>34</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_278">
<inState>4</inState>
<outState>5</outState>
<condition>
<id>38</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="_279">
<inState>5</inState>
<outState>6</outState>
<condition>
<id>39</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="_280">
<inState>6</inState>
<outState>7</outState>
<condition>
<id>40</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="_281">
<inState>7</inState>
<outState>3</outState>
<condition>
<id>42</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="_282">
<inState>3</inState>
<outState>2</outState>
<condition>
<id>44</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>34</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_283">
<inState>2</inState>
<outState>8</outState>
<condition>
<id>46</id>
<sop>
<count>2</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>14</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
<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="_284">
<inState>8</inState>
<outState>9</outState>
<condition>
<id>48</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>53</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_285">
<inState>9</inState>
<outState>10</outState>
<condition>
<id>49</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>65</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_286">
<inState>10</inState>
<outState>9</outState>
<condition>
<id>52</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="_287">
<inState>9</inState>
<outState>8</outState>
<condition>
<id>54</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>65</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="-1"></res>
<node_label_latency class_id="37" tracking_level="0" version="0">
<count>47</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>12</first>
<second class_id="39" tracking_level="0" version="0">
<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>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>2</first>
<second>1</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>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>58</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>62</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>64</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>65</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>67</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>70</first>
<second>
<first>3</first>
<second>1</second>
</second>
</item>
<item>
<first>71</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>72</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>74</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>76</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="40" tracking_level="0" version="0">
<count>15</count>
<item_version>0</item_version>
<item class_id="41" tracking_level="0" version="0">
<first>16</first>
<second class_id="42" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>2</first>
<second>6</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>69</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>73</first>
<second>
<first>3</first>
<second>4</second>
</second>
</item>
<item>
<first>75</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>77</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="43" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</regions>
<dp_fu_nodes class_id="44" tracking_level="0" version="0">
<count>31</count>
<item_version>0</item_version>
<item class_id="45" tracking_level="0" version="0">
<first>40</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>46</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>52</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>59</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>39</item>
<item>39</item>
<item>41</item>
</second>
</item>
<item>
<first>64</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>71</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</second>
</item>
<item>
<first>79</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>90</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>101</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>113</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>121</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>70</item>
<item>70</item>
</second>
</item>
<item>
<first>135</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>40</item>
<item>40</item>
<item>40</item>
<item>40</item>
</second>
</item>
<item>
<first>142</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>148</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>156</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>160</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>166</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>172</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>176</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>181</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>186</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>192</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>198</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>206</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>210</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>216</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>222</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>226</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>231</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>236</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>242</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="47" tracking_level="0" version="0">
<count>25</count>
<item_version>0</item_version>
<item class_id="48" tracking_level="0" version="0">
<first>G_addr_gep_fu_64</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>exitcond1_fu_210</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>exitcond1_i_fu_160</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>exitcond_fu_236</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>exitcond_i_fu_186</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>i_1_fu_166</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>i_2_fu_216</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>i_i_phi_fu_79</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>i_phi_fu_101</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>j_1_fu_192</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>j_2_fu_242</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
<item>
<first>j_cast1_cast_fu_222</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>j_i_cast3_cast_fu_172</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>j_i_phi_fu_90</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>j_phi_fu_113</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>subimg_addr_gep_fu_52</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>tmp_27_fu_176</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>tmp_28_fu_198</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>tmp_29_fu_226</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>tmp_32_cast_fu_156</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>tmp_33_cast_fu_181</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>tmp_35_cast_fu_206</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>tmp_36_cast_fu_231</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>tmp_fu_142</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>tmp_s_fu_148</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>2</count>
<item_version>0</item_version>
<item>
<first>grp_fu_135</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>40</item>
<item>40</item>
<item>40</item>
<item>40</item>
</second>
</item>
<item>
<first>grp_singleGUV_fu_121</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>70</item>
<item>70</item>
</second>
</item>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>2</count>
<item_version>0</item_version>
<item>
<first>inv_read_read_fu_40</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>shift_read_read_fu_46</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</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="49" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="50" tracking_level="0" version="0">
<first class_id="51" tracking_level="0" version="0">
<first>G</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</second>
</item>
<item>
<first>
<first>subimg</first>
<second>0</second>
</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>39</item>
<item>39</item>
<item>41</item>
</second>
</item>
<item>
<first>
<first>subimg</first>
<second>100</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>70</item>
</second>
</item>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>15</count>
<item_version>0</item_version>
<item>
<first>75</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>86</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>97</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>109</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>248</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>253</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>257</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>265</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>270</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>278</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>283</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>288</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>296</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>301</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>309</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>15</count>
<item_version>0</item_version>
<item>
<first>G_addr_reg_301</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>i_1_reg_265</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>i_2_reg_296</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>i_i_reg_75</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>i_reg_97</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>inv_read_reg_248</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>j_1_reg_278</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>j_2_reg_309</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
<item>
<first>j_i_reg_86</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>j_reg_109</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>subimg_addr_reg_270</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>subimg_load_reg_283</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>tmp_32_cast_reg_257</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>tmp_35_cast_reg_288</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>tmp_reg_253</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>4</count>
<item_version>0</item_version>
<item>
<first>75</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>86</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>97</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>109</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>4</count>
<item_version>0</item_version>
<item>
<first>i_i_reg_75</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>i_reg_97</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>j_i_reg_86</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>j_reg_109</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="52" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="53" tracking_level="0" version="0">
<first>G(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>71</item>
</second>
</item>
</second>
</item>
<item>
<first>inv</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>shift</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
</second>
</item>
<item>
<first>subimg(p0)</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>load</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>39</item>
<item>39</item>
</second>
</item>
<item>
<first>store</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="54" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="55" tracking_level="0" version="0">
<first>1</first>
<second>RAM</second>
</item>
<item>
<first>2</first>
<second>RAM</second>
</item>
<item>
<first>5</first>
<second>RAM</second>
</item>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
|
with Ada.Calendar;
package Fmt.Time_Argument is
function To_Argument (X : Ada.Calendar.Time) return Argument_Type'Class
with Inline;
function "&" (Args : Arguments; X : Ada.Calendar.Time) return Arguments
with Inline;
private
type Time_Argument_Type is new Placeholder_Argument_Type with record
Value : Ada.Calendar.Time;
end record;
overriding
function Get_Placeholder_Width (
Self : in out Time_Argument_Type;
Name : Character)
return Natural;
overriding
function Is_Valid_Placeholder (
Self : Time_Argument_Type;
Name : Character)
return Boolean;
overriding
procedure Put_Placeholder (
Self : in out Time_Argument_Type;
Name : Character;
To : in out String);
end Fmt.Time_Argument;
|
package GLX.Pointers
is
-- VisualID_Pointer
--
type VisualID_Pointer is access all VisualID;
type VisualID_Pointers is array (C.size_t range <>) of aliased VisualID_Pointer;
-- XVisualInfo_Pointer
--
type XVisualInfo_Pointer is access all XVisualInfo;
type XVisualInfo_Pointers is array (C.size_t range <>) of aliased XVisualInfo_Pointer;
-- Pixmap_Pointer
--
type Pixmap_Pointer is access all Pixmap;
type Pixmap_Pointers is array (C.size_t range <>) of aliased Pixmap_Pointer;
-- Font_Pointer
--
type Font_Pointer is access all Font;
type Font_Pointers is array (C.size_t range <>) of aliased Font_Pointer;
-- Window_Pointer
--
type Window_Pointer is access all Window;
type Window_Pointers is array (C.size_t range <>) of aliased Window_Pointer;
-- Bool_Pointer
--
type Bool_Pointer is access all Bool;
type Bool_Pointers is array (C.size_t range <>) of aliased Bool_Pointer;
-- ContextRec_Pointer
--
type ContextRec_Pointer is access all ContextRec;
type ContextRec_Pointers is array (C.size_t range <>) of aliased ContextRec_Pointer;
-- XID_Pointer
--
type XID_Pointer is access all XID;
type XID_Pointers is array (C.size_t range <>) of aliased XID_Pointer;
-- GLXPixmap_Pointer
--
type GLXPixmap_Pointer is access all GLXPixmap;
type GLXPixmap_Pointers is array (C.size_t range <>) of aliased GLXPixmap_Pointer;
-- Drawable_Pointer
--
type Drawable_Pointer is access all Drawable;
type Drawable_Pointers is array (C.size_t range <>) of aliased Drawable_Pointer;
-- FBConfig_Pointer
--
type FBConfig_Pointer is access all FBConfig;
type FBConfig_Pointers is array (C.size_t range <>) of aliased FBConfig_Pointer;
-- GLXFBConfigID_Pointer
--
type FBConfigID_Pointer is access all FBConfigID;
type FBConfigID_Pointers is array (C.size_t range <>) of aliased FBConfigID_Pointer;
-- GLXContextID_Pointer
--
type ContextID_Pointer is access all ContextID;
type ContextID_Pointers is array (C.size_t range <>) of aliased ContextID_Pointer;
-- GLXWindow_Pointer
--
type GLXWindow_Pointer is access all GLXWindow;
type GLXWindow_Pointers is array (C.size_t range <>) of aliased GLXWindow_Pointer;
-- PBuffer_Pointer
--
type PBuffer_Pointer is access all PBuffer;
type PBuffer_Pointers is array (C.size_t range <>) of aliased PBuffer_Pointer;
end GLX.Pointers;
|
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Program.Elements.Formal_Type_Definitions;
with Program.Lexical_Elements;
package Program.Elements.Formal_Decimal_Fixed_Point_Definitions is
pragma Pure (Program.Elements.Formal_Decimal_Fixed_Point_Definitions);
type Formal_Decimal_Fixed_Point_Definition is
limited interface
and Program.Elements.Formal_Type_Definitions.Formal_Type_Definition;
type Formal_Decimal_Fixed_Point_Definition_Access is
access all Formal_Decimal_Fixed_Point_Definition'Class
with Storage_Size => 0;
type Formal_Decimal_Fixed_Point_Definition_Text is limited interface;
type Formal_Decimal_Fixed_Point_Definition_Text_Access is
access all Formal_Decimal_Fixed_Point_Definition_Text'Class
with Storage_Size => 0;
not overriding function To_Formal_Decimal_Fixed_Point_Definition_Text
(Self : aliased in out Formal_Decimal_Fixed_Point_Definition)
return Formal_Decimal_Fixed_Point_Definition_Text_Access is abstract;
not overriding function Delta_Token
(Self : Formal_Decimal_Fixed_Point_Definition_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function Box_Token
(Self : Formal_Decimal_Fixed_Point_Definition_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function Digits_Token
(Self : Formal_Decimal_Fixed_Point_Definition_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function Box_Token_2
(Self : Formal_Decimal_Fixed_Point_Definition_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
end Program.Elements.Formal_Decimal_Fixed_Point_Definitions;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T . A W K --
-- --
-- S p e c --
-- --
-- Copyright (C) 2000-2020, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This is an AWK-like unit. It provides an easy interface for parsing one
-- or more files containing formatted data. The file can be viewed seen as
-- a database where each record is a line and a field is a data element in
-- this line. In this implementation an AWK record is a line. This means
-- that a record cannot span multiple lines. The operating procedure is to
-- read files line by line, with each line being presented to the user of
-- the package. The interface provides services to access specific fields
-- in the line. Thus it is possible to control actions taken on a line based
-- on values of some fields. This can be achieved directly or by registering
-- callbacks triggered on programmed conditions.
--
-- The state of an AWK run is recorded in an object of type session.
-- The following is the procedure for using a session to control an
-- AWK run:
--
-- 1) Specify which session is to be used. It is possible to use the
-- default session or to create a new one by declaring an object of
-- type Session_Type. For example:
--
-- Computers : Session_Type;
--
-- 2) Specify how to cut a line into fields. There are two modes: using
-- character fields separators or column width. This is done by using
-- Set_Fields_Separators or Set_Fields_Width. For example by:
--
-- AWK.Set_Field_Separators (";,", Computers);
--
-- or by using iterators' Separators parameter.
--
-- 3) Specify which files to parse. This is done with Add_File/Add_Files
-- services, or by using the iterators' Filename parameter. For
-- example:
--
-- AWK.Add_File ("myfile.db", Computers);
--
-- 4) Run the AWK session using one of the provided iterators.
--
-- Parse
-- This is the most automated iterator. You can gain control on
-- the session only by registering one or more callbacks (see
-- Register).
--
-- Get_Line/End_Of_Data
-- This is a manual iterator to be used with a loop. You have
-- complete control on the session. You can use callbacks but
-- this is not required.
--
-- For_Every_Line
-- This provides a mixture of manual/automated iterator action.
--
-- Examples of these three approaches appear below
--
-- There are many ways to use this package. The following discussion shows
-- three approaches to using this package, using the three iterator forms.
-- All examples will use the following file (computer.db):
--
-- Pluton;Windows-NT;Pentium III
-- Mars;Linux;Pentium Pro
-- Venus;Solaris;Sparc
-- Saturn;OS/2;i486
-- Jupiter;MacOS;PPC
--
-- 1) Using Parse iterator
--
-- Here the first step is to register some action associated to a pattern
-- and then to call the Parse iterator (this is the simplest way to use
-- this unit). The default session is used here. For example to output the
-- second field (the OS) of computer "Saturn".
--
-- procedure Action is
-- begin
-- Put_Line (AWK.Field (2));
-- end Action;
--
-- begin
-- AWK.Register (1, "Saturn", Action'Access);
-- AWK.Parse (";", "computer.db");
--
--
-- 2) Using the Get_Line/End_Of_Data iterator
--
-- Here you have full control. For example to do the same as
-- above but using a specific session, you could write:
--
-- Computer_File : Session_Type;
--
-- begin
-- AWK.Set_Current (Computer_File);
-- AWK.Open (Separators => ";",
-- Filename => "computer.db");
--
-- -- Display Saturn OS
--
-- while not AWK.End_Of_File loop
-- AWK.Get_Line;
--
-- if AWK.Field (1) = "Saturn" then
-- Put_Line (AWK.Field (2));
-- end if;
-- end loop;
--
-- AWK.Close (Computer_File);
--
--
-- 3) Using For_Every_Line iterator
--
-- In this case you use a provided iterator and you pass the procedure
-- that must be called for each record. You could code the previous
-- example could be coded as follows (using the iterator quick interface
-- but without using the current session):
--
-- Computer_File : Session_Type;
--
-- procedure Action (Quit : in out Boolean) is
-- begin
-- if AWK.Field (1, Computer_File) = "Saturn" then
-- Put_Line (AWK.Field (2, Computer_File));
-- end if;
-- end Action;
--
-- procedure Look_For_Saturn is
-- new AWK.For_Every_Line (Action);
--
-- begin
-- Look_For_Saturn (Separators => ";",
-- Filename => "computer.db",
-- Session => Computer_File);
--
-- Integer_Text_IO.Put
-- (Integer (AWK.NR (Session => Computer_File)));
-- Put_Line (" line(s) have been processed.");
--
-- You can also use a regular expression for the pattern. Let us output
-- the computer name for all computer for which the OS has a character
-- O in its name.
--
-- Regexp : String := ".*O.*";
--
-- Matcher : Regpat.Pattern_Matcher := Regpat.Compile (Regexp);
--
-- procedure Action is
-- begin
-- Text_IO.Put_Line (AWK.Field (2));
-- end Action;
--
-- begin
-- AWK.Register (2, Matcher, Action'Unrestricted_Access);
-- AWK.Parse (";", "computer.db");
--
with Ada.Finalization;
with GNAT.Regpat;
package GNAT.AWK is
Session_Error : exception;
-- Raised when a Session is reused but is not closed
File_Error : exception;
-- Raised when there is a file problem (see below)
End_Error : exception;
-- Raised when an attempt is made to read beyond the end of the last
-- file of a session.
Field_Error : exception;
-- Raised when accessing a field value which does not exist
Data_Error : exception;
-- Raised when it is impossible to convert a field value to a specific type
type Count is new Natural;
type Widths_Set is array (Positive range <>) of Positive;
-- Used to store a set of columns widths
Default_Separators : constant String := " " & ASCII.HT;
Use_Current : constant String := "";
-- Value used when no separator or filename is specified in iterators
type Session_Type is limited private;
-- This is the main exported type. A session is used to keep the state of
-- a full AWK run. The state comprises a list of files, the current file,
-- the number of line processed, the current line, the number of fields in
-- the current line... A default session is provided (see Set_Current,
-- Current_Session and Default_Session below).
----------------------------
-- Package initialization --
----------------------------
-- To be thread safe it is not possible to use the default provided
-- session. Each task must used a specific session and specify it
-- explicitly for every services.
procedure Set_Current (Session : Session_Type);
-- Set the session to be used by default. This file will be used when the
-- Session parameter in following services is not specified.
function Current_Session return not null access Session_Type;
-- Returns the session used by default by all services. This is the
-- latest session specified by Set_Current service or the session
-- provided by default with this implementation.
function Default_Session return not null access Session_Type;
-- Returns the default session provided by this package. Note that this is
-- the session return by Current_Session if Set_Current has not been used.
procedure Set_Field_Separators
(Separators : String := Default_Separators;
Session : Session_Type);
procedure Set_Field_Separators
(Separators : String := Default_Separators);
-- Set the field separators. Each character in the string is a field
-- separator. When a line is read it will be split by field using the
-- separators set here. Separators can be changed at any point and in this
-- case the current line is split according to the new separators. In the
-- special case that Separators is a space and a tabulation
-- (Default_Separators), fields are separated by runs of spaces and/or
-- tabs.
procedure Set_FS
(Separators : String := Default_Separators;
Session : Session_Type)
renames Set_Field_Separators;
procedure Set_FS
(Separators : String := Default_Separators)
renames Set_Field_Separators;
-- FS is the AWK abbreviation for above service
procedure Set_Field_Widths
(Field_Widths : Widths_Set;
Session : Session_Type);
procedure Set_Field_Widths
(Field_Widths : Widths_Set);
-- This is another way to split a line by giving the length (in number of
-- characters) of each field in a line. Field widths can be changed at any
-- point and in this case the current line is split according to the new
-- field lengths. A line split with this method must have a length equal or
-- greater to the total of the field widths. All characters remaining on
-- the line after the latest field are added to a new automatically
-- created field.
procedure Add_File
(Filename : String;
Session : Session_Type);
procedure Add_File
(Filename : String);
-- Add Filename to the list of file to be processed. There is no limit on
-- the number of files that can be added. Files are processed in the order
-- they have been added (i.e. the filename list is FIFO). If Filename does
-- not exist or if it is not readable, File_Error is raised.
procedure Add_Files
(Directory : String;
Filenames : String;
Number_Of_Files_Added : out Natural;
Session : Session_Type);
procedure Add_Files
(Directory : String;
Filenames : String;
Number_Of_Files_Added : out Natural);
-- Add all files matching the regular expression Filenames in the specified
-- directory to the list of file to be processed. There is no limit on
-- the number of files that can be added. Each file is processed in
-- the same order they have been added (i.e. the filename list is FIFO).
-- The number of files (possibly 0) added is returned in
-- Number_Of_Files_Added.
-------------------------------------
-- Information about current state --
-------------------------------------
function Number_Of_Fields
(Session : Session_Type) return Count;
function Number_Of_Fields
return Count;
pragma Inline (Number_Of_Fields);
-- Returns the number of fields in the current record. It returns 0 when
-- no file is being processed.
function NF
(Session : Session_Type) return Count
renames Number_Of_Fields;
function NF
return Count
renames Number_Of_Fields;
-- AWK abbreviation for above service
function Number_Of_File_Lines
(Session : Session_Type) return Count;
function Number_Of_File_Lines
return Count;
pragma Inline (Number_Of_File_Lines);
-- Returns the current line number in the processed file. It returns 0 when
-- no file is being processed.
function FNR (Session : Session_Type) return Count
renames Number_Of_File_Lines;
function FNR return Count
renames Number_Of_File_Lines;
-- AWK abbreviation for above service
function Number_Of_Lines
(Session : Session_Type) return Count;
function Number_Of_Lines
return Count;
pragma Inline (Number_Of_Lines);
-- Returns the number of line processed until now. This is equal to number
-- of line in each already processed file plus FNR. It returns 0 when
-- no file is being processed.
function NR (Session : Session_Type) return Count
renames Number_Of_Lines;
function NR return Count
renames Number_Of_Lines;
-- AWK abbreviation for above service
function Number_Of_Files
(Session : Session_Type) return Natural;
function Number_Of_Files
return Natural;
pragma Inline (Number_Of_Files);
-- Returns the number of files associated with Session. This is the total
-- number of files added with Add_File and Add_Files services.
function File (Session : Session_Type) return String;
function File return String;
-- Returns the name of the file being processed. It returns the empty
-- string when no file is being processed.
---------------------
-- Field accessors --
---------------------
function Field
(Rank : Count;
Session : Session_Type) return String;
function Field
(Rank : Count) return String;
-- Returns field number Rank value of the current record. If Rank = 0 it
-- returns the current record (i.e. the line as read in the file). It
-- raises Field_Error if Rank > NF or if Session is not open.
function Field
(Rank : Count;
Session : Session_Type) return Integer;
function Field
(Rank : Count) return Integer;
-- Returns field number Rank value of the current record as an integer. It
-- raises Field_Error if Rank > NF or if Session is not open. It
-- raises Data_Error if the field value cannot be converted to an integer.
function Field
(Rank : Count;
Session : Session_Type) return Float;
function Field
(Rank : Count) return Float;
-- Returns field number Rank value of the current record as a float. It
-- raises Field_Error if Rank > NF or if Session is not open. It
-- raises Data_Error if the field value cannot be converted to a float.
generic
type Discrete is (<>);
function Discrete_Field
(Rank : Count;
Session : Session_Type) return Discrete;
generic
type Discrete is (<>);
function Discrete_Field_Current_Session
(Rank : Count) return Discrete;
-- Returns field number Rank value of the current record as a type
-- Discrete. It raises Field_Error if Rank > NF. It raises Data_Error if
-- the field value cannot be converted to type Discrete.
--------------------
-- Pattern/Action --
--------------------
-- AWK defines rules like "PATTERN { ACTION }". Which means that ACTION
-- will be executed if PATTERN match. A pattern in this implementation can
-- be a simple string (match function is equality), a regular expression,
-- a function returning a boolean. An action is associated to a pattern
-- using the Register services.
--
-- Each procedure Register will add a rule to the set of rules for the
-- session. Rules are examined in the order they have been added.
type Pattern_Callback is access function return Boolean;
-- This is a pattern function pointer. When it returns True the associated
-- action will be called.
type Action_Callback is access procedure;
-- A simple action pointer
type Match_Action_Callback is
access procedure (Matches : GNAT.Regpat.Match_Array);
-- An advanced action pointer used with a regular expression pattern. It
-- returns an array of all the matches. See GNAT.Regpat for further
-- information.
procedure Register
(Field : Count;
Pattern : String;
Action : Action_Callback;
Session : Session_Type);
procedure Register
(Field : Count;
Pattern : String;
Action : Action_Callback);
-- Register an Action associated with a Pattern. The pattern here is a
-- simple string that must match exactly the field number specified.
procedure Register
(Field : Count;
Pattern : GNAT.Regpat.Pattern_Matcher;
Action : Action_Callback;
Session : Session_Type);
procedure Register
(Field : Count;
Pattern : GNAT.Regpat.Pattern_Matcher;
Action : Action_Callback);
-- Register an Action associated with a Pattern. The pattern here is a
-- simple regular expression which must match the field number specified.
procedure Register
(Field : Count;
Pattern : GNAT.Regpat.Pattern_Matcher;
Action : Match_Action_Callback;
Session : Session_Type);
procedure Register
(Field : Count;
Pattern : GNAT.Regpat.Pattern_Matcher;
Action : Match_Action_Callback);
-- Same as above but it pass the set of matches to the action
-- procedure. This is useful to analyze further why and where a regular
-- expression did match.
procedure Register
(Pattern : Pattern_Callback;
Action : Action_Callback;
Session : Session_Type);
procedure Register
(Pattern : Pattern_Callback;
Action : Action_Callback);
-- Register an Action associated with a Pattern. The pattern here is a
-- function that must return a boolean. Action callback will be called if
-- the pattern callback returns True and nothing will happen if it is
-- False. This version is more general, the two other register services
-- trigger an action based on the value of a single field only.
procedure Register
(Action : Action_Callback;
Session : Session_Type);
procedure Register
(Action : Action_Callback);
-- Register an Action that will be called for every line. This is
-- equivalent to a Pattern_Callback function always returning True.
--------------------
-- Parse iterator --
--------------------
procedure Parse
(Separators : String := Use_Current;
Filename : String := Use_Current;
Session : Session_Type);
procedure Parse
(Separators : String := Use_Current;
Filename : String := Use_Current);
-- Launch the iterator, it will read every line in all specified
-- session's files. Registered callbacks are then called if the associated
-- pattern match. It is possible to specify a filename and a set of
-- separators directly. This offer a quick way to parse a single
-- file. These parameters will override those specified by Set_FS and
-- Add_File. The Session will be opened and closed automatically.
-- File_Error is raised if there is no file associated with Session, or if
-- a file associated with Session is not longer readable. It raises
-- Session_Error is Session is already open.
-----------------------------------
-- Get_Line/End_Of_Data Iterator --
-----------------------------------
type Callback_Mode is (None, Only, Pass_Through);
-- These mode are used for Get_Line/End_Of_Data and For_Every_Line
-- iterators. The associated semantic is:
--
-- None
-- callbacks are not active. This is the default mode for
-- Get_Line/End_Of_Data and For_Every_Line iterators.
--
-- Only
-- callbacks are active, if at least one pattern match, the associated
-- action is called and this line will not be passed to the user. In
-- the Get_Line case the next line will be read (if there is some
-- line remaining), in the For_Every_Line case Action will
-- not be called for this line.
--
-- Pass_Through
-- callbacks are active, for patterns which match the associated
-- action is called. Then the line is passed to the user. It means
-- that Action procedure is called in the For_Every_Line case and
-- that Get_Line returns with the current line active.
--
procedure Open
(Separators : String := Use_Current;
Filename : String := Use_Current;
Session : Session_Type);
procedure Open
(Separators : String := Use_Current;
Filename : String := Use_Current);
-- Open the first file and initialize the unit. This must be called once
-- before using Get_Line. It is possible to specify a filename and a set of
-- separators directly. This offer a quick way to parse a single file.
-- These parameters will override those specified by Set_FS and Add_File.
-- File_Error is raised if there is no file associated with Session, or if
-- the first file associated with Session is no longer readable. It raises
-- Session_Error is Session is already open.
procedure Get_Line
(Callbacks : Callback_Mode := None;
Session : Session_Type);
procedure Get_Line
(Callbacks : Callback_Mode := None);
-- Read a line from the current input file. If the file index is at the
-- end of the current input file (i.e. End_Of_File is True) then the
-- following file is opened. If there is no more file to be processed,
-- exception End_Error will be raised. File_Error will be raised if Open
-- has not been called. Next call to Get_Line will return the following
-- line in the file. By default the registered callbacks are not called by
-- Get_Line, this can activated by setting Callbacks (see Callback_Mode
-- description above). File_Error may be raised if a file associated with
-- Session is not readable.
--
-- When Callbacks is not None, it is possible to exhaust all the lines
-- of all the files associated with Session. In this case, File_Error
-- is not raised.
--
-- This procedure can be used from a subprogram called by procedure Parse
-- or by an instantiation of For_Every_Line (see below).
function End_Of_Data
(Session : Session_Type) return Boolean;
function End_Of_Data
return Boolean;
pragma Inline (End_Of_Data);
-- Returns True if there is no more data to be processed in Session. It
-- means that the latest session's file is being processed and that
-- there is no more data to be read in this file (End_Of_File is True).
function End_Of_File
(Session : Session_Type) return Boolean;
function End_Of_File
return Boolean;
pragma Inline (End_Of_File);
-- Returns True when there is no more data to be processed on the current
-- session's file.
procedure Close (Session : Session_Type);
-- Release all associated data with Session. All memory allocated will
-- be freed, the current file will be closed if needed, the callbacks
-- will be unregistered. Close is convenient in reestablishing a session
-- for new use. Get_Line is no longer usable (will raise File_Error)
-- except after a successful call to Open, Parse or an instantiation
-- of For_Every_Line.
-----------------------------
-- For_Every_Line iterator --
-----------------------------
generic
with procedure Action (Quit : in out Boolean);
procedure For_Every_Line
(Separators : String := Use_Current;
Filename : String := Use_Current;
Callbacks : Callback_Mode := None;
Session : Session_Type);
generic
with procedure Action (Quit : in out Boolean);
procedure For_Every_Line_Current_Session
(Separators : String := Use_Current;
Filename : String := Use_Current;
Callbacks : Callback_Mode := None);
-- This is another iterator. Action will be called for each new
-- record. The iterator's termination can be controlled by setting Quit
-- to True. It is by default set to False. It is possible to specify a
-- filename and a set of separators directly. This offer a quick way to
-- parse a single file. These parameters will override those specified by
-- Set_FS and Add_File. By default the registered callbacks are not called
-- by For_Every_Line, this can activated by setting Callbacks (see
-- Callback_Mode description above). The Session will be opened and
-- closed automatically. File_Error is raised if there is no file
-- associated with Session. It raises Session_Error is Session is already
-- open.
private
type Session_Data;
type Session_Data_Access is access Session_Data;
type Session_Type is new Ada.Finalization.Limited_Controlled with record
Data : Session_Data_Access;
Self : not null access Session_Type := Session_Type'Unchecked_Access;
end record;
procedure Initialize (Session : in out Session_Type);
procedure Finalize (Session : in out Session_Type);
end GNAT.AWK;
|
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Characters.Handling; use Ada.Characters.Handling;
procedure pangram is
function ispangram(txt : in String) return Boolean is
(for all Letter in Character range 'a'..'z' =>
(for some Char of txt => To_Lower(Char) = Letter));
begin
put_line(Boolean'Image(ispangram("This is a test")));
put_line(Boolean'Image(ispangram("The quick brown fox jumps over the lazy dog")));
put_line(Boolean'Image(ispangram("NOPQRSTUVWXYZ abcdefghijklm")));
put_line(Boolean'Image(ispangram("abcdefghijklopqrstuvwxyz"))); --Missing m, n
end pangram;
|
-----------------------------------------------------------------------
-- mapping -- Example of serialization mappings
-- Copyright (C) 2010, 2011, 2012, 2014 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.Strings.Unbounded;
with Util.Beans.Objects;
with Util.Serialize.Mappers.Record_Mapper;
with Util.Serialize.Mappers;
with Ada.Containers.Vectors;
package Mapping is
use Ada.Strings.Unbounded;
type Property is record
Name : Unbounded_String;
Value : Unbounded_String;
end record;
type Address is record
City : Unbounded_String;
Street : Unbounded_String;
Country : Unbounded_String;
Zip : Natural := 0;
Info : Property;
end record;
type Person is record
Name : Unbounded_String;
First_Name : Unbounded_String;
Last_Name : Unbounded_String;
Username : Unbounded_String;
Gender : Unbounded_String;
Link : Unbounded_String;
Age : Natural := 0;
Addr : Address;
Id : Long_Long_Integer := 0;
end record;
type Person_Access is access all Person;
type Person_Fields is (FIELD_FIRST_NAME, FIELD_LAST_NAME, FIELD_AGE,
FIELD_NAME, FIELD_USER_NAME, FIELD_GENDER,
FIELD_LINK, FIELD_ID);
-- Set the name/value pair on the current object.
procedure Set_Member (P : in out Person;
Field : in Person_Fields;
Value : in Util.Beans.Objects.Object);
function Get_Person_Member (From : in Person;
Field : in Person_Fields) return Util.Beans.Objects.Object;
package Person_Mapper is
new Util.Serialize.Mappers.Record_Mapper (Element_Type => Person,
Element_Type_Access => Person_Access,
Fields => Person_Fields,
Set_Member => Set_Member);
subtype Person_Context is Person_Mapper.Element_Data;
package Person_Vector is
new Ada.Containers.Vectors (Element_Type => Person,
Index_Type => Natural);
-- Get the address mapper which describes how to load an Address.
function Get_Address_Mapper return Util.Serialize.Mappers.Mapper_Access;
-- Get the person mapper which describes how to load a Person.
function Get_Person_Mapper return Person_Mapper.Mapper_Access;
end Mapping;
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- A D A . C O N T A I N E R S . H A S H E D _ M A P S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2004-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/>. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
with Ada.Iterator_Interfaces;
private with Ada.Containers.Hash_Tables;
private with Ada.Finalization;
private with Ada.Streams;
private with Ada.Strings.Text_Output;
-- The language-defined generic package Containers.Hashed_Maps provides
-- private types Map and Cursor, and a set of operations for each type. A map
-- container allows an arbitrary type to be used as a key to find the element
-- associated with that key. A hashed map uses a hash function to organize the
-- keys.
--
-- A map contains pairs of keys and elements, called nodes. Map cursors
-- designate nodes, but also can be thought of as designating an element (the
-- element contained in the node) for consistency with the other containers.
-- There exists an equivalence relation on keys, whose definition is different
-- for hashed maps and ordered maps. A map never contains two or more nodes
-- with equivalent keys. The length of a map is the number of nodes it
-- contains.
--
-- Each nonempty map has two particular nodes called the first node and the
-- last node (which may be the same). Each node except for the last node has a
-- successor node. If there are no other intervening operations, starting with
-- the first node and repeatedly going to the successor node will visit each
-- node in the map exactly once until the last node is reached.
generic
type Key_Type is private;
type Element_Type is private;
with function Hash (Key : Key_Type) return Hash_Type;
-- The actual function for the generic formal function Hash is expected to
-- return the same value each time it is called with a particular key
-- value. For any two equivalent key values, the actual for Hash is
-- expected to return the same value. If the actual for Hash behaves in
-- some other manner, the behavior of this package is unspecified. Which
-- subprograms of this package call Hash, and how many times they call it,
-- is unspecified.
with function Equivalent_Keys (Left, Right : Key_Type) return Boolean;
-- The actual function for the generic formal function Equivalent_Keys on
-- Key_Type values is expected to return the same value each time it is
-- called with a particular pair of key values. It should define an
-- equivalence relationship, that is, be reflexive, symmetric, and
-- transitive. If the actual for Equivalent_Keys behaves in some other
-- manner, the behavior of this package is unspecified. Which subprograms
-- of this package call Equivalent_Keys, and how many times they call it,
-- is unspecified.
with function "=" (Left, Right : Element_Type) return Boolean is <>;
-- The actual function for the generic formal function "=" on Element_Type
-- values is expected to define a reflexive and symmetric relationship and
-- return the same result value each time it is called with a particular
-- pair of values. If it behaves in some other manner, the function "=" on
-- map values returns an unspecified value. The exact arguments and number
-- of calls of this generic formal function by the function "=" on map
-- values are unspecified.
package Ada.Containers.Hashed_Maps with
SPARK_Mode => Off
is
pragma Annotate (CodePeer, Skip_Analysis);
pragma Preelaborate;
pragma Remote_Types;
type Map is tagged private
with
Constant_Indexing => Constant_Reference,
Variable_Indexing => Reference,
Default_Iterator => Iterate,
Iterator_Element => Element_Type,
Aggregate => (Empty => Empty,
Add_Named => Insert);
pragma Preelaborable_Initialization (Map);
type Cursor is private;
pragma Preelaborable_Initialization (Cursor);
Empty_Map : constant Map;
-- Map objects declared without an initialization expression are
-- initialized to the value Empty_Map.
No_Element : constant Cursor;
-- Cursor objects declared without an initialization expression are
-- initialized to the value No_Element.
function Empty (Capacity : Count_Type := 1000) return Map;
function Has_Element (Position : Cursor) return Boolean;
-- Returns True if Position designates an element, and returns False
-- otherwise.
package Map_Iterator_Interfaces is new
Ada.Iterator_Interfaces (Cursor, Has_Element);
function "=" (Left, Right : Map) return Boolean;
-- If Left and Right denote the same map object, then the function returns
-- True. If Left and Right have different lengths, then the function
-- returns False. Otherwise, for each key K in Left, the function returns
-- False if:
--
-- * a key equivalent to K is not present in Right; or
--
-- * the element associated with K in Left is not equal to the
-- element associated with K in Right (using the generic formal
-- equality operator for elements).
--
-- If the function has not returned a result after checking all of the
-- keys, it returns True. Any exception raised during evaluation of key
-- equivalence or element equality is propagated.
function Capacity (Container : Map) return Count_Type;
-- Returns the current capacity of the map. Capacity is the maximum length
-- before which rehashing in guaranteed not to occur.
procedure Reserve_Capacity (Container : in out Map; Capacity : Count_Type);
-- Adjusts the current capacity, by allocating a new buckets array. If the
-- requested capacity is less than the current capacity, then the capacity
-- is contracted (to a value not less than the current length). If the
-- requested capacity is greater than the current capacity, then the
-- capacity is expanded (to a value not less than what is requested). In
-- either case, the nodes are rehashed from the old buckets array onto the
-- new buckets array (Hash is called once for each existing key in order to
-- compute the new index), and then the old buckets array is deallocated.
function Length (Container : Map) return Count_Type;
-- Returns the number of items in the map
function Is_Empty (Container : Map) return Boolean;
-- Equivalent to Length (Container) = 0
procedure Clear (Container : in out Map);
-- Removes all of the items from the map
function Key (Position : Cursor) return Key_Type;
-- Key returns the key component of the node designated by Position.
--
-- If Position equals No_Element, then Constraint_Error is propagated.
function Element (Position : Cursor) return Element_Type;
-- Element returns the element component of the node designated
-- by Position.
--
-- If Position equals No_Element, then Constraint_Error is propagated.
procedure Replace_Element
(Container : in out Map;
Position : Cursor;
New_Item : Element_Type);
-- Replace_Element assigns New_Item to the element of the node designated
-- by Position.
--
-- If Position equals No_Element, then Constraint_Error is propagated; if
-- Position does not designate an element in Container, then Program_Error
-- is propagated.
procedure Query_Element
(Position : Cursor;
Process : not null access
procedure (Key : Key_Type; Element : Element_Type));
-- Query_Element calls Process.all with the key and element from the node
-- designated by Position as the arguments.
--
-- If Position equals No_Element, then Constraint_Error is propagated.
--
-- Tampering with the elements of the map that contains the element
-- designated by Position is prohibited during the execution of the call on
-- Process.all. Any exception raised by Process.all is propagated.
procedure Update_Element
(Container : in out Map;
Position : Cursor;
Process : not null access
procedure (Key : Key_Type; Element : in out Element_Type));
-- Update_Element calls Process.all with the key and element from the node
-- designated by Position as the arguments.
--
-- If Position equals No_Element, then Constraint_Error is propagated; if
-- Position does not designate an element in Container, then Program_Error
-- is propagated.
--
-- Tampering with the elements of Container is prohibited during the
-- execution of the call on Process.all. Any exception raised by
-- Process.all is propagated.
type Constant_Reference_Type
(Element : not null access constant Element_Type) is private
with
Implicit_Dereference => Element;
type Reference_Type (Element : not null access Element_Type) is private
with
Implicit_Dereference => Element;
function Constant_Reference
(Container : aliased Map;
Position : Cursor) return Constant_Reference_Type;
pragma Inline (Constant_Reference);
-- This function (combined with the Constant_Indexing and
-- Implicit_Dereference aspects) provides a convenient way to gain read
-- access to an individual element of a map given a cursor.
-- Constant_Reference returns an object whose discriminant is an access
-- value that designates the element designated by Position.
--
-- If Position equals No_Element, then Constraint_Error is propagated; if
-- Position does not designate an element in Container, then Program_Error
-- is propagated.
--
-- Tampering with the elements of Container is prohibited
-- while the object returned by Constant_Reference exists and has not been
-- finalized.
function Reference
(Container : aliased in out Map;
Position : Cursor) return Reference_Type;
pragma Inline (Reference);
-- This function (combined with the Variable_Indexing and
-- Implicit_Dereference aspects) provides a convenient way to gain read and
-- write access to an individual element of a map given a cursor.
-- Reference returns an object whose discriminant is an access value that
-- designates the element designated by Position.
--
-- If Position equals No_Element, then Constraint_Error is propagated; if
-- Position does not designate an element in Container, then Program_Error
-- is propagated.
--
-- Tampering with the elements of Container is prohibited while the object
-- returned by Reference exists and has not been finalized.
function Constant_Reference
(Container : aliased Map;
Key : Key_Type) return Constant_Reference_Type;
pragma Inline (Constant_Reference);
-- Equivalent to Constant_Reference (Container, Find (Container, Key)).
function Reference
(Container : aliased in out Map;
Key : Key_Type) return Reference_Type;
pragma Inline (Reference);
-- Equivalent to Reference (Container, Find (Container, Key)).
procedure Assign (Target : in out Map; Source : Map);
-- If Target denotes the same object as Source, the operation has no
-- effect. Otherwise, the key/element pairs of Source are copied to Target
-- as for an assignment_statement assigning Source to Target.
function Copy (Source : Map; Capacity : Count_Type := 0) return Map;
procedure Move (Target : in out Map; Source : in out Map);
-- If Target denotes the same object as Source, then the operation has no
-- effect. Otherwise, the operation is equivalent to Assign (Target,
-- Source) followed by Clear (Source).
procedure Insert
(Container : in out Map;
Key : Key_Type;
New_Item : Element_Type;
Position : out Cursor;
Inserted : out Boolean);
-- Insert checks if a node with a key equivalent to Key is already present
-- in Container. If a match is found, Inserted is set to False and Position
-- designates the element with the matching key. Otherwise, Insert
-- allocates a new node, initializes it to Key and New_Item, and adds it to
-- Container; Inserted is set to True and Position designates the
-- newly-inserted node. Any exception raised during allocation is
-- propagated and Container is not modified.
procedure Insert
(Container : in out Map;
Key : Key_Type;
Position : out Cursor;
Inserted : out Boolean);
-- Insert inserts Key into Container as per the five-parameter Insert, with
-- the difference that an element initialized by default (see 3.3.1) is
-- inserted.
procedure Insert
(Container : in out Map;
Key : Key_Type;
New_Item : Element_Type);
-- Insert inserts Key and New_Item into Container as per the five-parameter
-- Insert, with the difference that if a node with a key equivalent to Key
-- is already in the map, then Constraint_Error is propagated.
procedure Include
(Container : in out Map;
Key : Key_Type;
New_Item : Element_Type);
-- Include inserts Key and New_Item into Container as per the
-- five-parameter Insert, with the difference that if a node with a key
-- equivalent to Key is already in the map, then this operation assigns Key
-- and New_Item to the matching node. Any exception raised during
-- assignment is propagated.
procedure Replace
(Container : in out Map;
Key : Key_Type;
New_Item : Element_Type);
-- Replace checks if a node with a key equivalent to Key is present in
-- Container. If a match is found, Replace assigns Key and New_Item to the
-- matching node; otherwise, Constraint_Error is propagated.
procedure Exclude (Container : in out Map; Key : Key_Type);
-- Exclude checks if a node with a key equivalent to Key is present in
-- Container. If a match is found, Exclude removes the node from the map.
procedure Delete (Container : in out Map; Key : Key_Type);
-- Delete checks if a node with a key equivalent to Key is present in
-- Container. If a match is found, Delete removes the node from the map;
-- otherwise, Constraint_Error is propagated.
procedure Delete (Container : in out Map; Position : in out Cursor);
-- Delete removes the node designated by Position from the map. Position is
-- set to No_Element on return.
--
-- If Position equals No_Element, then Constraint_Error is propagated. If
-- Position does not designate an element in Container, then Program_Error
-- is propagated.
function First (Container : Map) return Cursor;
-- If Length (Container) = 0, then First returns No_Element. Otherwise,
-- First returns a cursor that designates the first node in Container.
function Next (Position : Cursor) return Cursor;
-- Returns a cursor that designates the successor of the node designated by
-- Position. If Position designates the last node, then No_Element is
-- returned. If Position equals No_Element, then No_Element is returned.
procedure Next (Position : in out Cursor);
-- Equivalent to Position := Next (Position)
function Find (Container : Map; Key : Key_Type) return Cursor;
-- If Length (Container) equals 0, then Find returns No_Element.
-- Otherwise, Find checks if a node with a key equivalent to Key is present
-- in Container. If a match is found, a cursor designating the matching
-- node is returned; otherwise, No_Element is returned.
function Contains (Container : Map; Key : Key_Type) return Boolean;
-- Equivalent to Find (Container, Key) /= No_Element.
function Element (Container : Map; Key : Key_Type) return Element_Type;
-- Equivalent to Element (Find (Container, Key))
function Equivalent_Keys (Left, Right : Cursor) return Boolean;
-- Returns the result of calling Equivalent_Keys with the keys of the nodes
-- designated by cursors Left and Right.
function Equivalent_Keys (Left : Cursor; Right : Key_Type) return Boolean;
-- Returns the result of calling Equivalent_Keys with key of the node
-- designated by Left and key Right.
function Equivalent_Keys (Left : Key_Type; Right : Cursor) return Boolean;
-- Returns the result of calling Equivalent_Keys with key Left and the node
-- designated by Right.
procedure Iterate
(Container : Map;
Process : not null access procedure (Position : Cursor));
-- Iterate calls Process.all with a cursor that designates each node in
-- Container, starting with the first node and moving the cursor according
-- to the successor relation. Tampering with the cursors of Container is
-- prohibited during the execution of a call on Process.all. Any exception
-- raised by Process.all is propagated.
function Iterate
(Container : Map) return Map_Iterator_Interfaces.Forward_Iterator'Class;
private
pragma Inline ("=");
pragma Inline (Length);
pragma Inline (Is_Empty);
pragma Inline (Clear);
pragma Inline (Key);
pragma Inline (Element);
pragma Inline (Move);
pragma Inline (Contains);
pragma Inline (Capacity);
pragma Inline (Reserve_Capacity);
pragma Inline (Has_Element);
pragma Inline (Equivalent_Keys);
pragma Inline (Next);
type Node_Type;
type Node_Access is access Node_Type;
type Node_Type is limited record
Key : Key_Type;
Element : aliased Element_Type;
Next : Node_Access;
end record;
package HT_Types is
new Hash_Tables.Generic_Hash_Table_Types (Node_Type, Node_Access);
type Map is new Ada.Finalization.Controlled with record
HT : HT_Types.Hash_Table_Type;
end record with Put_Image => Put_Image;
procedure Put_Image
(S : in out Ada.Strings.Text_Output.Sink'Class; V : Map);
overriding procedure Adjust (Container : in out Map);
overriding procedure Finalize (Container : in out Map);
use HT_Types, HT_Types.Implementation;
use Ada.Finalization;
use Ada.Streams;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Container : Map);
for Map'Write use Write;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Container : out Map);
for Map'Read use Read;
type Map_Access is access all Map;
for Map_Access'Storage_Size use 0;
type Cursor is record
Container : Map_Access;
-- Access to this cursor's container
Node : Node_Access;
-- Access to the node pointed to by this cursor
Position : Hash_Type := Hash_Type'Last;
-- Position of the node in the buckets of the container. If this is
-- equal to Hash_Type'Last, then it will not be used.
end record;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Cursor);
for Cursor'Read use Read;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Cursor);
for Cursor'Write use Write;
subtype Reference_Control_Type is Implementation.Reference_Control_Type;
-- It is necessary to rename this here, so that the compiler can find it
type Constant_Reference_Type
(Element : not null access constant Element_Type) is
record
Control : Reference_Control_Type :=
raise Program_Error with "uninitialized reference";
-- The RM says, "The default initialization of an object of
-- type Constant_Reference_Type or Reference_Type propagates
-- Program_Error."
end record;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Constant_Reference_Type);
for Constant_Reference_Type'Write use Write;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Constant_Reference_Type);
for Constant_Reference_Type'Read use Read;
type Reference_Type
(Element : not null access Element_Type) is
record
Control : Reference_Control_Type :=
raise Program_Error with "uninitialized reference";
-- The RM says, "The default initialization of an object of
-- type Constant_Reference_Type or Reference_Type propagates
-- Program_Error."
end record;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Reference_Type);
for Reference_Type'Write use Write;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Reference_Type);
for Reference_Type'Read use Read;
-- Three operations are used to optimize in the expansion of "for ... of"
-- loops: the Next(Cursor) procedure in the visible part, and the following
-- Pseudo_Reference and Get_Element_Access functions. See Sem_Ch5 for
-- details.
function Pseudo_Reference
(Container : aliased Map'Class) return Reference_Control_Type;
pragma Inline (Pseudo_Reference);
-- Creates an object of type Reference_Control_Type pointing to the
-- container, and increments the Lock. Finalization of this object will
-- decrement the Lock.
type Element_Access is access all Element_Type with
Storage_Size => 0;
function Get_Element_Access
(Position : Cursor) return not null Element_Access;
-- Returns a pointer to the element designated by Position.
Empty_Map : constant Map := (Controlled with others => <>);
No_Element : constant Cursor := (Container => null, Node => null,
Position => Hash_Type'Last);
type Iterator is new Limited_Controlled and
Map_Iterator_Interfaces.Forward_Iterator with
record
Container : Map_Access;
end record
with Disable_Controlled => not T_Check;
overriding procedure Finalize (Object : in out Iterator);
overriding function First (Object : Iterator) return Cursor;
overriding function Next
(Object : Iterator;
Position : Cursor) return Cursor;
end Ada.Containers.Hashed_Maps;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with AMF.Elements;
with AMF.Internals.Element_Collections;
with AMF.Internals.Helpers;
with AMF.Internals.Tables.UML_Attributes;
with AMF.Visitors.UML_Iterators;
with AMF.Visitors.UML_Visitors;
with League.Strings.Internals;
with Matreshka.Internals.Strings;
package body AMF.Internals.UML_Literal_Booleans is
-------------------
-- Enter_Element --
-------------------
overriding procedure Enter_Element
(Self : not null access constant UML_Literal_Boolean_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.UML_Visitors.UML_Visitor'Class then
AMF.Visitors.UML_Visitors.UML_Visitor'Class
(Visitor).Enter_Literal_Boolean
(AMF.UML.Literal_Booleans.UML_Literal_Boolean_Access (Self),
Control);
end if;
end Enter_Element;
-------------------
-- Leave_Element --
-------------------
overriding procedure Leave_Element
(Self : not null access constant UML_Literal_Boolean_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.UML_Visitors.UML_Visitor'Class then
AMF.Visitors.UML_Visitors.UML_Visitor'Class
(Visitor).Leave_Literal_Boolean
(AMF.UML.Literal_Booleans.UML_Literal_Boolean_Access (Self),
Control);
end if;
end Leave_Element;
-------------------
-- Visit_Element --
-------------------
overriding procedure Visit_Element
(Self : not null access constant UML_Literal_Boolean_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Iterator in AMF.Visitors.UML_Iterators.UML_Iterator'Class then
AMF.Visitors.UML_Iterators.UML_Iterator'Class
(Iterator).Visit_Literal_Boolean
(Visitor,
AMF.UML.Literal_Booleans.UML_Literal_Boolean_Access (Self),
Control);
end if;
end Visit_Element;
---------------
-- Get_Value --
---------------
overriding function Get_Value
(Self : not null access constant UML_Literal_Boolean_Proxy)
return Boolean is
begin
return
AMF.Internals.Tables.UML_Attributes.Internal_Get_Value
(Self.Element);
end Get_Value;
---------------
-- Set_Value --
---------------
overriding procedure Set_Value
(Self : not null access UML_Literal_Boolean_Proxy;
To : Boolean) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Value
(Self.Element, To);
end Set_Value;
--------------
-- Get_Type --
--------------
overriding function Get_Type
(Self : not null access constant UML_Literal_Boolean_Proxy)
return AMF.UML.Types.UML_Type_Access is
begin
return
AMF.UML.Types.UML_Type_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Type
(Self.Element)));
end Get_Type;
--------------
-- Set_Type --
--------------
overriding procedure Set_Type
(Self : not null access UML_Literal_Boolean_Proxy;
To : AMF.UML.Types.UML_Type_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Type
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Type;
---------------------------
-- Get_Client_Dependency --
---------------------------
overriding function Get_Client_Dependency
(Self : not null access constant UML_Literal_Boolean_Proxy)
return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency is
begin
return
AMF.UML.Dependencies.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Client_Dependency
(Self.Element)));
end Get_Client_Dependency;
-------------------------
-- Get_Name_Expression --
-------------------------
overriding function Get_Name_Expression
(Self : not null access constant UML_Literal_Boolean_Proxy)
return AMF.UML.String_Expressions.UML_String_Expression_Access is
begin
return
AMF.UML.String_Expressions.UML_String_Expression_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Name_Expression
(Self.Element)));
end Get_Name_Expression;
-------------------------
-- Set_Name_Expression --
-------------------------
overriding procedure Set_Name_Expression
(Self : not null access UML_Literal_Boolean_Proxy;
To : AMF.UML.String_Expressions.UML_String_Expression_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Name_Expression
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Name_Expression;
-------------------
-- Get_Namespace --
-------------------
overriding function Get_Namespace
(Self : not null access constant UML_Literal_Boolean_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access is
begin
return
AMF.UML.Namespaces.UML_Namespace_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Namespace
(Self.Element)));
end Get_Namespace;
------------------------
-- Get_Qualified_Name --
------------------------
overriding function Get_Qualified_Name
(Self : not null access constant UML_Literal_Boolean_Proxy)
return AMF.Optional_String is
begin
declare
use type Matreshka.Internals.Strings.Shared_String_Access;
Aux : constant Matreshka.Internals.Strings.Shared_String_Access
:= AMF.Internals.Tables.UML_Attributes.Internal_Get_Qualified_Name (Self.Element);
begin
if Aux = null then
return (Is_Empty => True);
else
return (False, League.Strings.Internals.Create (Aux));
end if;
end;
end Get_Qualified_Name;
-----------------------------------
-- Get_Owning_Template_Parameter --
-----------------------------------
overriding function Get_Owning_Template_Parameter
(Self : not null access constant UML_Literal_Boolean_Proxy)
return AMF.UML.Template_Parameters.UML_Template_Parameter_Access is
begin
return
AMF.UML.Template_Parameters.UML_Template_Parameter_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Owning_Template_Parameter
(Self.Element)));
end Get_Owning_Template_Parameter;
-----------------------------------
-- Set_Owning_Template_Parameter --
-----------------------------------
overriding procedure Set_Owning_Template_Parameter
(Self : not null access UML_Literal_Boolean_Proxy;
To : AMF.UML.Template_Parameters.UML_Template_Parameter_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Owning_Template_Parameter
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Owning_Template_Parameter;
----------------------------
-- Get_Template_Parameter --
----------------------------
overriding function Get_Template_Parameter
(Self : not null access constant UML_Literal_Boolean_Proxy)
return AMF.UML.Template_Parameters.UML_Template_Parameter_Access is
begin
return
AMF.UML.Template_Parameters.UML_Template_Parameter_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Template_Parameter
(Self.Element)));
end Get_Template_Parameter;
----------------------------
-- Set_Template_Parameter --
----------------------------
overriding procedure Set_Template_Parameter
(Self : not null access UML_Literal_Boolean_Proxy;
To : AMF.UML.Template_Parameters.UML_Template_Parameter_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Template_Parameter
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Template_Parameter;
-------------------
-- Boolean_Value --
-------------------
overriding function Boolean_Value
(Self : not null access constant UML_Literal_Boolean_Proxy)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Boolean_Value unimplemented");
raise Program_Error with "Unimplemented procedure UML_Literal_Boolean_Proxy.Boolean_Value";
return Boolean_Value (Self);
end Boolean_Value;
-------------------
-- Is_Computable --
-------------------
overriding function Is_Computable
(Self : not null access constant UML_Literal_Boolean_Proxy)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Computable unimplemented");
raise Program_Error with "Unimplemented procedure UML_Literal_Boolean_Proxy.Is_Computable";
return Is_Computable (Self);
end Is_Computable;
-------------------
-- Boolean_Value --
-------------------
overriding function Boolean_Value
(Self : not null access constant UML_Literal_Boolean_Proxy)
return AMF.Optional_Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Boolean_Value unimplemented");
raise Program_Error with "Unimplemented procedure UML_Literal_Boolean_Proxy.Boolean_Value";
return Boolean_Value (Self);
end Boolean_Value;
------------------------
-- Is_Compatible_With --
------------------------
overriding function Is_Compatible_With
(Self : not null access constant UML_Literal_Boolean_Proxy;
P : AMF.UML.Parameterable_Elements.UML_Parameterable_Element_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Compatible_With unimplemented");
raise Program_Error with "Unimplemented procedure UML_Literal_Boolean_Proxy.Is_Compatible_With";
return Is_Compatible_With (Self, P);
end Is_Compatible_With;
-------------------------
-- All_Owning_Packages --
-------------------------
overriding function All_Owning_Packages
(Self : not null access constant UML_Literal_Boolean_Proxy)
return AMF.UML.Packages.Collections.Set_Of_UML_Package is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "All_Owning_Packages unimplemented");
raise Program_Error with "Unimplemented procedure UML_Literal_Boolean_Proxy.All_Owning_Packages";
return All_Owning_Packages (Self);
end All_Owning_Packages;
-----------------------------
-- Is_Distinguishable_From --
-----------------------------
overriding function Is_Distinguishable_From
(Self : not null access constant UML_Literal_Boolean_Proxy;
N : AMF.UML.Named_Elements.UML_Named_Element_Access;
Ns : AMF.UML.Namespaces.UML_Namespace_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Distinguishable_From unimplemented");
raise Program_Error with "Unimplemented procedure UML_Literal_Boolean_Proxy.Is_Distinguishable_From";
return Is_Distinguishable_From (Self, N, Ns);
end Is_Distinguishable_From;
---------------
-- Namespace --
---------------
overriding function Namespace
(Self : not null access constant UML_Literal_Boolean_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Namespace unimplemented");
raise Program_Error with "Unimplemented procedure UML_Literal_Boolean_Proxy.Namespace";
return Namespace (Self);
end Namespace;
---------------------------
-- Is_Template_Parameter --
---------------------------
overriding function Is_Template_Parameter
(Self : not null access constant UML_Literal_Boolean_Proxy)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Template_Parameter unimplemented");
raise Program_Error with "Unimplemented procedure UML_Literal_Boolean_Proxy.Is_Template_Parameter";
return Is_Template_Parameter (Self);
end Is_Template_Parameter;
end AMF.Internals.UML_Literal_Booleans;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . W I D E _ W I D E _ T E X T _ I O . G E N E R I C _ A U X --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2005, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Interfaces.C_Streams; use Interfaces.C_Streams;
with System.File_IO;
with System.File_Control_Block;
package body Ada.Wide_Wide_Text_IO.Generic_Aux is
package FIO renames System.File_IO;
package FCB renames System.File_Control_Block;
subtype AP is FCB.AFCB_Ptr;
------------------------
-- Check_End_Of_Field --
------------------------
procedure Check_End_Of_Field
(Buf : String;
Stop : Integer;
Ptr : Integer;
Width : Field)
is
begin
if Ptr > Stop then
return;
elsif Width = 0 then
raise Data_Error;
else
for J in Ptr .. Stop loop
if not Is_Blank (Buf (J)) then
raise Data_Error;
end if;
end loop;
end if;
end Check_End_Of_Field;
-----------------------
-- Check_On_One_Line --
-----------------------
procedure Check_On_One_Line
(File : File_Type;
Length : Integer)
is
begin
FIO.Check_Write_Status (AP (File));
if File.Line_Length /= 0 then
if Count (Length) > File.Line_Length then
raise Layout_Error;
elsif File.Col + Count (Length) > File.Line_Length + 1 then
New_Line (File);
end if;
end if;
end Check_On_One_Line;
--------------
-- Is_Blank --
--------------
function Is_Blank (C : Character) return Boolean is
begin
return C = ' ' or else C = ASCII.HT;
end Is_Blank;
----------
-- Load --
----------
procedure Load
(File : File_Type;
Buf : out String;
Ptr : in out Integer;
Char : Character;
Loaded : out Boolean)
is
ch : int;
begin
if File.Before_Wide_Wide_Character then
Loaded := False;
return;
else
ch := Getc (File);
if ch = Character'Pos (Char) then
Store_Char (File, ch, Buf, Ptr);
Loaded := True;
else
Ungetc (ch, File);
Loaded := False;
end if;
end if;
end Load;
procedure Load
(File : File_Type;
Buf : out String;
Ptr : in out Integer;
Char : Character)
is
ch : int;
begin
if File.Before_Wide_Wide_Character then
null;
else
ch := Getc (File);
if ch = Character'Pos (Char) then
Store_Char (File, ch, Buf, Ptr);
else
Ungetc (ch, File);
end if;
end if;
end Load;
procedure Load
(File : File_Type;
Buf : out String;
Ptr : in out Integer;
Char1 : Character;
Char2 : Character;
Loaded : out Boolean)
is
ch : int;
begin
if File.Before_Wide_Wide_Character then
Loaded := False;
return;
else
ch := Getc (File);
if ch = Character'Pos (Char1)
or else ch = Character'Pos (Char2)
then
Store_Char (File, ch, Buf, Ptr);
Loaded := True;
else
Ungetc (ch, File);
Loaded := False;
end if;
end if;
end Load;
procedure Load
(File : File_Type;
Buf : out String;
Ptr : in out Integer;
Char1 : Character;
Char2 : Character)
is
ch : int;
begin
if File.Before_Wide_Wide_Character then
null;
else
ch := Getc (File);
if ch = Character'Pos (Char1)
or else ch = Character'Pos (Char2)
then
Store_Char (File, ch, Buf, Ptr);
else
Ungetc (ch, File);
end if;
end if;
end Load;
-----------------
-- Load_Digits --
-----------------
procedure Load_Digits
(File : File_Type;
Buf : out String;
Ptr : in out Integer;
Loaded : out Boolean)
is
ch : int;
After_Digit : Boolean;
begin
if File.Before_Wide_Wide_Character then
Loaded := False;
return;
else
ch := Getc (File);
if ch not in Character'Pos ('0') .. Character'Pos ('9') then
Loaded := False;
else
Loaded := True;
After_Digit := True;
loop
Store_Char (File, ch, Buf, Ptr);
ch := Getc (File);
if ch in Character'Pos ('0') .. Character'Pos ('9') then
After_Digit := True;
elsif ch = Character'Pos ('_') and then After_Digit then
After_Digit := False;
else
exit;
end if;
end loop;
end if;
Ungetc (ch, File);
end if;
end Load_Digits;
procedure Load_Digits
(File : File_Type;
Buf : out String;
Ptr : in out Integer)
is
ch : int;
After_Digit : Boolean;
begin
if File.Before_Wide_Wide_Character then
return;
else
ch := Getc (File);
if ch in Character'Pos ('0') .. Character'Pos ('9') then
After_Digit := True;
loop
Store_Char (File, ch, Buf, Ptr);
ch := Getc (File);
if ch in Character'Pos ('0') .. Character'Pos ('9') then
After_Digit := True;
elsif ch = Character'Pos ('_') and then After_Digit then
After_Digit := False;
else
exit;
end if;
end loop;
end if;
Ungetc (ch, File);
end if;
end Load_Digits;
--------------------------
-- Load_Extended_Digits --
--------------------------
procedure Load_Extended_Digits
(File : File_Type;
Buf : out String;
Ptr : in out Integer;
Loaded : out Boolean)
is
ch : int;
After_Digit : Boolean := False;
begin
if File.Before_Wide_Wide_Character then
Loaded := False;
return;
else
Loaded := False;
loop
ch := Getc (File);
if ch in Character'Pos ('0') .. Character'Pos ('9')
or else
ch in Character'Pos ('a') .. Character'Pos ('f')
or else
ch in Character'Pos ('A') .. Character'Pos ('F')
then
After_Digit := True;
elsif ch = Character'Pos ('_') and then After_Digit then
After_Digit := False;
else
exit;
end if;
Store_Char (File, ch, Buf, Ptr);
Loaded := True;
end loop;
Ungetc (ch, File);
end if;
end Load_Extended_Digits;
procedure Load_Extended_Digits
(File : File_Type;
Buf : out String;
Ptr : in out Integer)
is
Junk : Boolean;
begin
Load_Extended_Digits (File, Buf, Ptr, Junk);
end Load_Extended_Digits;
---------------
-- Load_Skip --
---------------
procedure Load_Skip (File : File_Type) is
C : Character;
begin
FIO.Check_Read_Status (AP (File));
-- We need to explicitly test for the case of being before a wide
-- character (greater than 16#7F#). Since no such character can
-- ever legitimately be a valid numeric character, we can
-- immediately signal Data_Error.
if File.Before_Wide_Wide_Character then
raise Data_Error;
end if;
-- Otherwise loop till we find a non-blank character (note that as
-- usual in Wide_Wide_Text_IO, blank includes horizontal tab). Note that
-- Get_Character deals with Before_LM/Before_LM_PM flags appropriately.
loop
Get_Character (File, C);
exit when not Is_Blank (C);
end loop;
Ungetc (Character'Pos (C), File);
File.Col := File.Col - 1;
end Load_Skip;
----------------
-- Load_Width --
----------------
procedure Load_Width
(File : File_Type;
Width : Field;
Buf : out String;
Ptr : in out Integer)
is
ch : int;
WC : Wide_Wide_Character;
Bad_Wide_Wide_C : Boolean := False;
-- Set True if one of the characters read is not in range of type
-- Character. This is always a Data_Error, but we do not signal it
-- right away, since we have to read the full number of characters.
begin
FIO.Check_Read_Status (AP (File));
-- If we are immediately before a line mark, then we have no characters.
-- This is always a data error, so we may as well raise it right away.
if File.Before_LM then
raise Data_Error;
else
for J in 1 .. Width loop
if File.Before_Wide_Wide_Character then
Bad_Wide_Wide_C := True;
Store_Char (File, 0, Buf, Ptr);
File.Before_Wide_Wide_Character := False;
else
ch := Getc (File);
if ch = EOF then
exit;
elsif ch = LM then
Ungetc (ch, File);
exit;
else
WC := Get_Wide_Wide_Char (Character'Val (ch), File);
ch := Wide_Wide_Character'Pos (WC);
if ch > 255 then
Bad_Wide_Wide_C := True;
ch := 0;
end if;
Store_Char (File, ch, Buf, Ptr);
end if;
end if;
end loop;
if Bad_Wide_Wide_C then
raise Data_Error;
end if;
end if;
end Load_Width;
--------------
-- Put_Item --
--------------
procedure Put_Item (File : File_Type; Str : String) is
begin
Check_On_One_Line (File, Str'Length);
for J in Str'Range loop
Put (File, Wide_Wide_Character'Val (Character'Pos (Str (J))));
end loop;
end Put_Item;
----------------
-- Store_Char --
----------------
procedure Store_Char
(File : File_Type;
ch : Integer;
Buf : out String;
Ptr : in out Integer)
is
begin
File.Col := File.Col + 1;
if Ptr = Buf'Last then
raise Data_Error;
else
Ptr := Ptr + 1;
Buf (Ptr) := Character'Val (ch);
end if;
end Store_Char;
-----------------
-- String_Skip --
-----------------
procedure String_Skip (Str : String; Ptr : out Integer) is
begin
Ptr := Str'First;
loop
if Ptr > Str'Last then
raise End_Error;
elsif not Is_Blank (Str (Ptr)) then
return;
else
Ptr := Ptr + 1;
end if;
end loop;
end String_Skip;
------------
-- Ungetc --
------------
procedure Ungetc (ch : int; File : File_Type) is
begin
if ch /= EOF then
if ungetc (ch, File.Stream) = EOF then
raise Device_Error;
end if;
end if;
end Ungetc;
end Ada.Wide_Wide_Text_IO.Generic_Aux;
|
-- This file is generated by SWIG. Please do not modify by hand.
--
with Interfaces.C;
with Interfaces.C.Pointers;
package xcb.xcb_render_transform_t is
-- Item
--
type Item is record
matrix11 : aliased xcb.xcb_render_fixed_t;
matrix12 : aliased xcb.xcb_render_fixed_t;
matrix13 : aliased xcb.xcb_render_fixed_t;
matrix21 : aliased xcb.xcb_render_fixed_t;
matrix22 : aliased xcb.xcb_render_fixed_t;
matrix23 : aliased xcb.xcb_render_fixed_t;
matrix31 : aliased xcb.xcb_render_fixed_t;
matrix32 : aliased xcb.xcb_render_fixed_t;
matrix33 : aliased xcb.xcb_render_fixed_t;
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C.size_t range <>) of aliased xcb.xcb_render_transform_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_render_transform_t.Item,
Element_Array => xcb.xcb_render_transform_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_render_transform_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_render_transform_t.Pointer,
Element_Array => xcb.xcb_render_transform_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_render_transform_t;
|
-----------------------------------------------------------------------
-- util-beans -- Interface Definition with Getter and Setters
-- Copyright (C) 2009, 2010, 2018, 2019 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.
-----------------------------------------------------------------------
-- = Ada Beans =
-- A [Java Bean](http://en.wikipedia.org/wiki/JavaBean) is an object that
-- allows to access its properties through getters and setters. Java Beans
-- rely on the use of Java introspection to discover the Java Bean object properties.
--
-- An Ada Bean has some similarities with the Java Bean as it tries to expose
-- an object through a set of common interfaces. Since Ada does not have introspection,
-- some developer work is necessary. The Ada Bean framework consists of:
--
-- * An `Object` concrete type that allows to hold any data type such
-- as boolean, integer, floats, strings, dates and Ada bean objects.
-- * A `Bean` interface that exposes a `Get_Value` and `Set_Value`
-- operation through which the object properties can be obtained and modified.
-- * A `Method_Bean` interface that exposes a set of method bindings
-- that gives access to the methods provided by the Ada Bean object.
--
-- The benefit of Ada beans comes when you need to get a value or invoke
-- a method on an object but you don't know at compile time the object or method.
-- That step being done later through some external configuration or presentation file.
--
-- The Ada Bean framework is the basis for the implementation of
-- Ada Server Faces and Ada EL. It allows the presentation layer to
-- access information provided by Ada beans.
--
-- To use the packages described here, use the following GNAT project:
--
-- with "utilada_base";
--
-- @include util-beans-objects.ads
-- @include util-beans-objects-datasets.ads
-- @include util-beans-basic.ads
package Util.Beans is
pragma Preelaborate;
end Util.Beans;
|
-----------------------------------------------------------------------
-- css-core-sets -- Sets of CSSRule references
-- Copyright (C) 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 CSS.Core.Refs;
with CSS.Core.Compare;
with Ada.Containers.Ordered_Sets;
package CSS.Core.Sets is
new Ada.Containers.Ordered_Sets (Element_Type => CSS.Core.Refs.Ref,
"<" => CSS.Core.Compare."<",
"=" => CSS.Core.Compare."=");
|
-- Copyright 2006-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
function Create_Small return Data_Small is
begin
return (others => 1);
end Create_Small;
function Create_Large return Data_Large is
begin
return (others => 2);
end Create_Large;
function Create_Small_Float_Vector return Small_Float_Vector is
begin
return (others => 4.25);
end Create_Small_Float_Vector;
end Pck;
|
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with League.Application;
with League.String_Vectors;
with Meta.Classes;
with Meta.Read;
with Meta.Writes;
procedure Meta.Run is
Class_List : Meta.Read.Class_Vectors.Vector;
Lists : League.String_Vectors.Universal_String_Vector;
begin
Meta.Read.Read_AST
(File_Name => League.Application.Arguments.Element (1),
Result => Class_List);
for J of Class_List loop
for P of J.Properties loop
if P.Capacity in
Meta.Classes.Zero_Or_More .. Meta.Classes.One_Or_More
and then Lists.Index (P.Type_Name) = 0
then
Lists.Append (P.Type_Name);
end if;
end loop;
end loop;
Meta.Writes.Write_Elements (Class_List);
Meta.Writes.Write_Elements_Body (Class_List);
Meta.Writes.Write_Visitors (Class_List);
Meta.Writes.Write_Iterators (Class_List);
Meta.Writes.Write_Factories (Class_List);
Meta.Writes.Write_Factories (Class_List, Implicit => True);
Meta.Writes.Write_Factories_Body (Class_List);
Meta.Writes.Write_Factories_Body (Class_List, Implicit => True);
for J in 2 .. Class_List.Last_Index loop
Meta.Writes.Write_One_Element
(Class_List (J),
With_List => Lists.Index (Class_List (J).Name) > 0);
if not Class_List (J).Is_Abstract then
Meta.Writes.Write_One_Node (Class_List, Class_List (J));
Meta.Writes.Write_One_Node_Body (Class_List, Class_List (J));
end if;
end loop;
end Meta.Run;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- P R J . A T T R . P M --
-- --
-- B o d y --
-- --
-- Copyright (C) 2004 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
package body Prj.Attr.PM is
-------------------
-- Add_Attribute --
-------------------
procedure Add_Attribute
(To_Package : Package_Node_Id;
Attribute_Name : Name_Id;
Attribute_Node : out Attribute_Node_Id)
is
begin
-- Only add the attribute if the package is already defined
if To_Package /= Empty_Package then
Attrs.Increment_Last;
Attrs.Table (Attrs.Last) :=
(Name => Attribute_Name,
Var_Kind => Undefined,
Optional_Index => False,
Attr_Kind => Unknown,
Next =>
Package_Attributes.Table (To_Package.Value).First_Attribute);
Package_Attributes.Table (To_Package.Value).First_Attribute :=
Attrs.Last;
Attribute_Node := (Value => Attrs.Last);
end if;
end Add_Attribute;
-------------------------
-- Add_Unknown_Package --
-------------------------
procedure Add_Unknown_Package (Name : Name_Id; Id : out Package_Node_Id) is
begin
Package_Attributes.Increment_Last;
Id := (Value => Package_Attributes.Last);
Package_Attributes.Table (Id.Value) :=
(Name => Name, Known => False, First_Attribute => Empty_Attr);
end Add_Unknown_Package;
end Prj.Attr.PM;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- G N A T . S P E L L I N G _ C H E C K E R --
-- --
-- B o d y --
-- --
-- Copyright (C) 1998-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. --
-- --
------------------------------------------------------------------------------
pragma Compiler_Unit_Warning;
with GNAT.Spelling_Checker_Generic;
package body GNAT.Spelling_Checker is
function IBS is new
GNAT.Spelling_Checker_Generic.Is_Bad_Spelling_Of
(Character, String);
------------------------
-- Is_Bad_Spelling_Of --
------------------------
function Is_Bad_Spelling_Of
(Found : String;
Expect : String) return Boolean
renames IBS;
end GNAT.Spelling_Checker;
|
-----------------------------------------------------------------------
-- mail -- Mail utility library
-- Copyright (C) 2020 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
package Mail is
pragma Pure;
end Mail;
|
-- 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 = "SecurityTrails"
type = "api"
function start()
setratelimit(1)
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 = verturl(domain)
-- Check if the response data is in the graph database
if (cfg.ttl ~= nil and cfg.ttl > 0) then
resp = obtain_response(vurl, cfg.ttl)
end
if (resp == nil or resp == "") then
local err
resp, err = request({
url=vurl,
headers={
APIKEY=c.key,
['Content-Type']="application/json",
},
})
if (err ~= nil and err ~= "") then
return
end
if (cfg.ttl ~= nil and cfg.ttl > 0) then
cache_response(vurl, resp)
end
end
local j = json.decode(resp)
if (j == nil or #(j.subdomains) == 0) then
return
end
for i, sub in pairs(j.subdomains) do
sendnames(ctx, sub .. "." .. domain)
end
end
function verturl(domain)
return "https://api.securitytrails.com/v1/domain/" .. domain .. "/subdomains"
end
function sendnames(ctx, content)
local names = find(content, subdomainre)
if names == nil then
return
end
for i, v in pairs(names) do
newname(ctx, v)
end
end
function horizontal(ctx, domain)
local c
local cfg = datasrc_config()
if cfg ~= nil then
c = cfg.credentials
end
if (c == nil or c.key == "") then
return
end
local resp
local hurl = horizonurl(domain)
-- Check if the response data is in the graph database
if (cfg.ttl ~= nil and cfg.ttl > 0) then
resp = obtain_response(hurl, cfg.ttl)
end
if (resp == nil or resp == "") then
local err
resp, err = request({
url=hurl,
headers={
APIKEY=c.key,
['Content-Type']="application/json",
},
})
if (err ~= nil and err ~= "") then
return
end
if (cfg.ttl ~= nil and cfg.ttl > 0) then
cache_response(hurl, resp)
end
end
local j = json.decode(resp)
if (j == nil or #(j.records) == 0) then
return
end
assoc = {}
for i, r in pairs(j.records) do
if r.hostname ~= "" then
table.insert(assoc, r.hostname)
end
end
for i, a in pairs(assoc) do
associated(ctx, domain, a)
end
end
function horizonurl(domain)
return "https://api.securitytrails.com/v1/domain/" .. domain .. "/associated"
end
|
with System.Formatting.Literals;
with System.Long_Long_Integer_Types;
with System.Value_Errors;
package body System.Val_LLU is
subtype Word_Unsigned is Long_Long_Integer_Types.Word_Unsigned;
subtype Long_Long_Unsigned is Long_Long_Integer_Types.Long_Long_Unsigned;
-- implementation
function Value_Long_Long_Unsigned (Str : String)
return Unsigned_Types.Long_Long_Unsigned
is
Last : Natural;
Result : Unsigned_Types.Long_Long_Unsigned;
Error : Boolean;
begin
if Unsigned_Types.Long_Long_Unsigned'Size <= Standard'Word_Size then
Formatting.Literals.Get_Literal (
Str,
Last,
Word_Unsigned (Result),
Error => Error);
else
Formatting.Literals.Get_Literal (
Str,
Last,
Long_Long_Unsigned (Result),
Error => Error);
end if;
if not Error then
Formatting.Literals.Check_Last (Str, Last, Error);
if not Error then
return Result;
end if;
end if;
Value_Errors.Raise_Discrete_Value_Failure ("Long_Long_Unsigned", Str);
declare
Uninitialized : Unsigned_Types.Long_Long_Unsigned;
pragma Unmodified (Uninitialized);
begin
return Uninitialized;
end;
end Value_Long_Long_Unsigned;
end System.Val_LLU;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUNTIME COMPONENTS --
-- --
-- A D A . S Y N C H R O N O U S _ T A S K _ C O N T R O L --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-2001 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
package body Ada.Synchronous_Task_Control is
-------------------
-- Suspension_PO --
-------------------
protected body Suspension_Object is
--------------
-- Get_Open --
--------------
function Get_Open return Boolean is
begin
return Open;
end Get_Open;
---------------
-- Set_False --
---------------
procedure Set_False is
begin
Open := False;
end Set_False;
--------------
-- Set_True --
--------------
procedure Set_True is
begin
Open := True;
end Set_True;
----------
-- Wait --
----------
entry Wait when Open is
begin
Open := False;
end Wait;
--------------------
-- Wait_Exception --
--------------------
entry Wait_Exception when True is
begin
if Wait'Count /= 0 then
raise Program_Error;
end if;
requeue Wait;
end Wait_Exception;
end Suspension_Object;
-------------------
-- Current_State --
-------------------
function Current_State (S : Suspension_Object) return Boolean is
begin
return S.Get_Open;
end Current_State;
---------------
-- Set_False --
---------------
procedure Set_False (S : in out Suspension_Object) is
begin
S.Set_False;
end Set_False;
--------------
-- Set_True --
--------------
procedure Set_True (S : in out Suspension_Object) is
begin
S.Set_True;
end Set_True;
------------------------
-- Suspend_Until_True --
------------------------
procedure Suspend_Until_True (S : in out Suspension_Object) is
begin
S.Wait_Exception;
end Suspend_Until_True;
end Ada.Synchronous_Task_Control;
|
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
package body Program.Nodes.Case_Expressions is
function Create
(Case_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Selecting_Expression : not null Program.Elements.Expressions
.Expression_Access;
Is_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Paths : not null Program.Elements.Case_Expression_Paths
.Case_Expression_Path_Vector_Access)
return Case_Expression is
begin
return Result : Case_Expression :=
(Case_Token => Case_Token,
Selecting_Expression => Selecting_Expression, Is_Token => Is_Token,
Paths => Paths, Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
function Create
(Selecting_Expression : not null Program.Elements.Expressions
.Expression_Access;
Paths : not null Program.Elements.Case_Expression_Paths
.Case_Expression_Path_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_Case_Expression is
begin
return Result : Implicit_Case_Expression :=
(Selecting_Expression => Selecting_Expression, Paths => Paths,
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 Selecting_Expression
(Self : Base_Case_Expression)
return not null Program.Elements.Expressions.Expression_Access is
begin
return Self.Selecting_Expression;
end Selecting_Expression;
overriding function Paths
(Self : Base_Case_Expression)
return not null Program.Elements.Case_Expression_Paths
.Case_Expression_Path_Vector_Access is
begin
return Self.Paths;
end Paths;
overriding function Case_Token
(Self : Case_Expression)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Case_Token;
end Case_Token;
overriding function Is_Token
(Self : Case_Expression)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Is_Token;
end Is_Token;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Case_Expression)
return Boolean is
begin
return Self.Is_Part_Of_Implicit;
end Is_Part_Of_Implicit;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Case_Expression)
return Boolean is
begin
return Self.Is_Part_Of_Inherited;
end Is_Part_Of_Inherited;
overriding function Is_Part_Of_Instance
(Self : Implicit_Case_Expression)
return Boolean is
begin
return Self.Is_Part_Of_Instance;
end Is_Part_Of_Instance;
procedure Initialize (Self : aliased in out Base_Case_Expression'Class) is
begin
Set_Enclosing_Element (Self.Selecting_Expression, Self'Unchecked_Access);
for Item in Self.Paths.Each_Element loop
Set_Enclosing_Element (Item.Element, Self'Unchecked_Access);
end loop;
null;
end Initialize;
overriding function Is_Case_Expression_Element
(Self : Base_Case_Expression)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Case_Expression_Element;
overriding function Is_Expression_Element
(Self : Base_Case_Expression)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Expression_Element;
overriding procedure Visit
(Self : not null access Base_Case_Expression;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class) is
begin
Visitor.Case_Expression (Self);
end Visit;
overriding function To_Case_Expression_Text
(Self : aliased in out Case_Expression)
return Program.Elements.Case_Expressions.Case_Expression_Text_Access is
begin
return Self'Unchecked_Access;
end To_Case_Expression_Text;
overriding function To_Case_Expression_Text
(Self : aliased in out Implicit_Case_Expression)
return Program.Elements.Case_Expressions.Case_Expression_Text_Access is
pragma Unreferenced (Self);
begin
return null;
end To_Case_Expression_Text;
end Program.Nodes.Case_Expressions;
|
-- SPDX-FileCopyrightText: 2019 Max Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
with Program.Nodes.Generic_Vectors;
with Program.Elements.Array_Component_Associations;
package Program.Nodes.Array_Component_Association_Vectors is new
Program.Nodes.Generic_Vectors
(Program.Elements.Array_Component_Associations
.Array_Component_Association_Vector);
pragma Preelaborate (Program.Nodes.Array_Component_Association_Vectors);
|
with TEXT_IO;
with STRINGS_PACKAGE; use STRINGS_PACKAGE;
with LATIN_FILE_NAMES; use LATIN_FILE_NAMES; -- Omit when put name here
with WORD_PARAMETERS; use WORD_PARAMETERS;
with DICTIONARY_PACKAGE; use DICTIONARY_PACKAGE;
with PREFACE;
with LINE_STUFF; use LINE_STUFF;
pragma Elaborate(PREFACE);
package body DEVELOPER_PARAMETERS is
use TEXT_IO;
type HELP_TYPE is array (NATURAL range <>) of STRING(1..70);
BLANK_HELP_LINE : constant STRING(1..70) := (others => ' ');
NO_HELP : constant HELP_TYPE := (2..1 => BLANK_HELP_LINE);
type REPLY_TYPE is (N, Y);
package REPLY_TYPE_IO is new TEXT_IO.ENUMERATION_IO(REPLY_TYPE);
REPLY : array (BOOLEAN) of REPLY_TYPE := (N, Y);
MDEV_OF_REPLY : array (REPLY_TYPE) of BOOLEAN := (FALSE, TRUE);
BLANK_INPUT : exception;
-- The default MDEVs are set in the body so that they can be changed
-- with only this being recompiled, not the rest of the with'ing system
DEFAULT_MDEV_ARRAY : constant MDEV_ARRAY := (
-- HAVE_DEBUG_FILE => FALSE,
-- WRITE_DEBUG_FILE => FALSE,
HAVE_STATISTICS_FILE => FALSE,
WRITE_STATISTICS_FILE => FALSE,
SHOW_DICTIONARY => FALSE,
SHOW_DICTIONARY_LINE => FALSE,
SHOW_DICTIONARY_CODES => TRUE,
DO_PEARSE_CODES => FALSE,
DO_ONLY_INITIAL_WORD => FALSE,
FOR_WORD_LIST_CHECK => FALSE,
DO_ONLY_FIXES => FALSE,
DO_FIXES_ANYWAY => FALSE,
USE_PREFIXES => TRUE,
USE_SUFFIXES => TRUE,
USE_TACKONS => TRUE,
DO_MEDIEVAL_TRICKS => TRUE,
DO_SYNCOPE => TRUE,
DO_TWO_WORDS => TRUE,
INCLUDE_UNKNOWN_CONTEXT => TRUE,
NO_MEANINGS => FALSE,
OMIT_ARCHAIC => TRUE,
OMIT_MEDIEVAL => FALSE,
OMIT_UNCOMMON => TRUE,
DO_I_FOR_J => FALSE,
DO_U_FOR_V => FALSE,
PAUSE_IN_SCREEN_OUTPUT => TRUE,
NO_SCREEN_ACTIVITY => FALSE,
UPDATE_LOCAL_DICTIONARY => FALSE,
UPDATE_MEANINGS => FALSE,
MINIMIZE_OUTPUT => TRUE );
BAD_MDEV_FILE : exception;
--HAVE_DEBUG_FILE_HELP : constant HELP_TYPE := (
-- "This option instructs the program to create a file which can hold ",
-- "certain internal information about the current search. The file is ",
-- "overwritten for every word in order to prevent it from growing out of ",
-- "hand, so information about the last word searched is saved in case of ",
-- "failure. The debug output file is named " & DEBUG_FULL_NAME
-- & (42+DEBUG_FULL_NAME'LENGTH..70 => ' '),
-- "Use of this option, along with the WRITE_DEBUG_FILE option may slow ",
-- "the program significantly. This information is usually only useful ",
-- "to the developer, so the default is N(o). " );
--
--WRITE_DEBUG_FILE_HELP : constant HELP_TYPE := (
-- "This option instructs the program, when HAVE_DEBUG_FILE is on, to put ",
-- "some debug data to a file named " & DEBUG_FULL_NAME
-- & (33+DEBUG_FULL_NAME'LENGTH..70 => ' '),
-- "This option may be turned on and off while running of the program, ",
-- "thereby capturing only certain desired results. The file is reset and",
-- "restarted after each word parsed, so that it does not get too big. ",
-- "If the option HAVE_DEBUG_FILE is off, the user will not be given a ",
-- "chance to turn this one on. Default is N(o). " );
--
HAVE_STATISTICS_FILE_HELP : constant HELP_TYPE := (
"This option instructs the program to create a file which can hold ",
"certain statistical information about the process. The file is ",
"overwritten for new invocation of the program, so old data must be ",
"explicitly saved if it is to be retained. The statistics are in TEXT ",
"format. The statistics file is named " & STATS_FULL_NAME
& (42+STATS_FULL_NAME'LENGTH..70 => ' '),
"This information is only of development use, so the default is N(o). " );
WRITE_STATISTICS_FILE_HELP : constant HELP_TYPE := (
"This option instructs the program, with HAVE_STATISTICS_FILE, to put ",
"derived statistics in a file named " & STATS_FULL_NAME
& (36+STATS_FULL_NAME'LENGTH..70 => ' '),
"This option may be turned on and off while running of the program, ",
"thereby capturing only certain desired results. The file is reset at ",
"each invocation of the program, if the HAVE_STATISTICS_FILE is set. ",
"If the option HAVE_STATISTICS_FILE is off, the user will not be given ",
"a chance to turn this one on. Default is N(o). " );
SHOW_DICTIONARY_HELP : constant HELP_TYPE := (
"This option causes a flag, like 'GEN>' to be put before the meaning ",
"in the output. While this is useful for certain development purposes,",
"it forces off a few characters from the meaning, and is really of no ",
"interest to most users. ",
"The default choice is N(o), but it can be turned on with a Y(es). " );
SHOW_DICTIONARY_LINE_HELP : constant HELP_TYPE := (
"This option causes the number of the dictionary line for the current ",
"meaning to be output. This is of use to no one but the dictionary ",
"maintainer. The default choice is N(o). It is activated by Y(es). ");
SHOW_DICTIONARY_CODES_HELP : constant HELP_TYPE := (
"This option causes the codes for the dictionary entry for the current ",
"meaning to be output. This may not be useful to any but the most ",
"involved user. The default choice is N(o). It is activated by Y(es).");
DO_PEARSE_CODES_HELP : constant HELP_TYPE := (
"This option causes special codes to be output flagging the different ",
"kinds of output lines. 01 for forms, 02 for dictionary forms, and ",
"03 for meaning. The default choice is N(o). It is activated by Y(es).",
"There are no Pearse codes in English mode. ");
DO_ONLY_INITIAL_WORD_HELP : constant HELP_TYPE := (
"This option instructs the program to only analyze the initial word on ",
"each line submitted. This is a tool for checking and integrating new ",
"dictionary input, and will be of no interest to the general user. ",
"The default choice is N(o), but it can be turned on with a Y(es). " );
FOR_WORD_LIST_CHECK_HELP : constant HELP_TYPE := (
"This option works in conjunction with DO_ONLY_INITIAL_WORD to allow ",
"the processing of scanned dictionarys or text word lists. It accepts ",
"only the forms common in dictionary entries, like NOM S for N or ADJ, ",
"or PRES ACTIVE IND 1 S for V. It is be used only with DO_INITIAL_WORD",
"The default choice is N(o), but it can be turned on with a Y(es). " );
DO_ONLY_FIXES_HELP : constant HELP_TYPE := (
"This option instructs the program to ignore the normal dictionary ",
"search and to go direct to attach various prefixes and suffixes before",
"processing. This is a pure research tool. It allows one to examine ",
"the coverage of pure stems and dictionary primary compositions. ",
"This option is only available if DO_FIXES is turned on. ",
"This is entirely a development and research tool, not to be used in ",
"conventional translation situations, so the default choice is N(o). ",
"This processing can be turned on with the choice of Y(es). " );
DO_FIXES_ANYWAY_HELP : constant HELP_TYPE := (
"This option instructs the program to do both the normal dictionary ",
"search and then process for the various prefixes and suffixes too. ",
"This is a pure research tool allowing one to consider the possibility ",
"of strange constructions, even in the presence of conventional ",
"results, e.g., alte => deeply (ADV), but al+t+e => wing+ed (ADJ VOC) ",
"(If multiple suffixes were supported this could also be wing+ed+ly.) ",
"This option is only available if DO_FIXES is turned on. ",
"This is entirely a development and research tool, not to be used in ",
"conventional translation situations, so the default choice is N(o). ",
"This processing can be turned on with the choice of Y(es). ",
" ------ PRESENTLY NOT IMPLEMENTED ------ " );
USE_PREFIXES_HELP : constant HELP_TYPE := (
"This option instructs the program to implement prefixes from ADDONS ",
"whenever and wherever FIXES are called for. The purpose of this ",
"option is to allow some flexibility while the program in running to ",
"select various combinations of fixes, to turn them on and off, ",
"individually as well as collectively. This is an option usually ",
"employed by the developer while experimenting with the ADDONS file. ",
"This option is only effective in connection with DO_FIXES. ",
"This is primarily a development tool, so the conventional user should ",
"probably maintain the default choice of Y(es). " );
USE_SUFFIXES_HELP : constant HELP_TYPE := (
"This option instructs the program to implement suffixes from ADDONS ",
"whenever and wherever FIXES are called for. The purpose of this ",
"option is to allow some flexibility while the program in running to ",
"select various combinations of fixes, to turn them on and off, ",
"individually as well as collectively. This is an option usually ",
"employed by the developer while experimenting with the ADDONS file. ",
"This option is only effective in connection with DO_FIXES. ",
"This is primarily a development tool, so the conventional user should ",
"probably maintain the default choice of Y(es). " );
USE_TACKONS_HELP : constant HELP_TYPE := (
"This option instructs the program to implement TACKONS from ADDONS ",
"whenever and wherever FIXES are called for. The purpose of this ",
"option is to allow some flexibility while the program in running to ",
"select various combinations of fixes, to turn them on and off, ",
"individually as well as collectively. This is an option usually ",
"employed by the developer while experimenting with the ADDONS file. ",
"This option is only effective in connection with DO_FIXES. ",
"This is primarily a development tool, so the conventional user should ",
"probably maintain the default choice of Y(es). " );
DO_MEDIEVAL_TRICKS_HELP : constant HELP_TYPE := (
"This option instructs the program, when it is unable to find a proper ",
"match in the dictionary, and after various prefixes and suffixes, and ",
"tring every Classical Latin trick it can think of, to go to a few that",
"are usually only found in medieval Latin, replacements of caul -> col,",
"st -> est, z -> di, ix -> is, nct -> nt. It also tries some things ",
"like replacing doubled consonants in classical with a single one. ",
"Together these tricks are useful, but may give false positives (>20%).",
"This option is only available if the general DO_TRICKS is chosen. ",
"If the text is late or medieval, this option is much more useful than ",
"tricks for classical. The dictionary can never contain all spelling ",
"variations found in medieval Latin, but some constructs are common. ",
"The default choice is N(o), since the results are iffy, medieval only,",
"and expensive. This processing is turned on with the choice of Y(es)." );
DO_SYNCOPE_HELP : constant HELP_TYPE := (
"This option instructs the program to postulate that syncope of ",
"perfect stem verbs may have occured (e.g, aver -> ar in the perfect), ",
"and to try various possibilities for the insertion of a removed 'v'. ",
"To do this it has to fully process the modified candidates, which can ",
"have a consderable impact on the speed of processind a large file. ",
"However, this trick seldom producesa false positive, and syncope is ",
"very common in Latin (first year texts excepted). Default is Y(es). ",
"This processing is turned off with the choice of N(o). " );
DO_TWO_WORDS_HELP : constant HELP_TYPE := (
"There are some few common Lain expressions that combine two inflected ",
"words (e.g. respublica, paterfamilias). There are numerous examples ",
"of numbers composed of two words combined together. ",
"Sometimes a text or inscription will have words run together. ",
"When WORDS is unable to reach a satisfactory solution with all other ",
"tricks, as a last stab it will try to break the input into two words. ",
"This most often fails. Even if mechnically successful, the result is ",
"usually false and must be examined by the user. If the result is ",
"correct, it is probably clear to the user. Otherwise, beware. . ",
"Since this is a last chanceand infrequent, the default is Y(es); ",
"This processing is turned off with the choice of N(o). " );
INCLUDE_UNKNOWN_CONTEXT_HELP : constant HELP_TYPE := (
"This option instructs the program, when writing to an UNKNOWNS file, ",
"to put out the whole context of the UNKNOWN (the whole input line on ",
"which the UNKNOWN was found). This is appropriate for processing ",
"large text files in which it is expected that there will be relatively",
"few UNKNOWNS. The main use at the moment is to provide display ",
"of the input line on the output file in the case of UNKNOWNS_ONLY. ");
NO_MEANINGS_HELP : constant HELP_TYPE := (
"This option instructs the program to omit putting out meanings. ",
"This is only useful for certain dictionary maintenance procedures. ",
"The combination not DO_DICTIONARY_FORMS, MEANINGS_ONLY, NO_MEANINGS ",
"results in no visible output, except spacing lines. Default is N)o.");
OMIT_ARCHAIC_HELP : constant HELP_TYPE := (
"THIS OPTION IS CAN ONLY BE ACTIVE IF WORDS_MODE(TRIM_OUTPUT) IS SET! ",
"This option instructs the program to omit inflections and dictionary ",
"entries with an AGE code of A (Archaic). Archaic results are rarely ",
"of interest in general use. If there is no other possible form, then ",
"the Archaic (roughly defined) will be reported. The default is Y(es)." );
OMIT_MEDIEVAL_HELP : constant HELP_TYPE := (
"THIS OPTION IS CAN ONLY BE ACTIVE IF WORDS_MODE(TRIM_OUTPUT) IS SET! ",
"This option instructs the program to omit inflections and dictionary ",
"entries with AGE codes of E or later, those not in use in Roman times.",
"While later forms and words are a significant application, most users ",
"will not want them. If there is no other possible form, then the ",
"Medieval (roughly defined) will be reported. The default is Y(es). " );
OMIT_UNCOMMON_HELP : constant HELP_TYPE := (
"THIS OPTION IS CAN ONLY BE ACTIVE IF WORDS_MODE(TRIM_OUTPUT) IS SET! ",
"This option instructs the program to omit inflections and dictionary ",
"entries with FREQ codes indicating that the selection is uncommon. ",
"While these forms area significant feature of the program, many users ",
"will not want them. If there is no other possible form, then the ",
"uncommon (roughly defined) will be reported. The default is Y(es). " );
DO_I_FOR_J_HELP : constant HELP_TYPE := (
"This option instructs the program to modify the output so that the j/J",
"is represented as i/I. The consonant i was writen as j in cursive in ",
"Imperial times and called i longa, and often rendered as j in medieval",
"times. The capital is usually rendered as I, as in inscriptions. ",
"If this is NO/FALSE, the output will have the same character as input.",
"The program default, and the dictionary convention is to retain the j.",
"Reset if this ia unsuitable for your application. The default is N(o)." );
DO_U_FOR_V_HELP : constant HELP_TYPE := (
"This option instructs the program to modify the output so that the u ",
"is represented as v. The consonant u was writen sometimes as uu. ",
"The pronounciation was as current w, and important for poetic meter. ",
"With the printing press came the practice of distinguishing consonant ",
"u with the character v, and was common for centuries. The practice of",
"using only u has been adopted in some 20th century publications (OLD),",
" but it is confusing to many modern readers. The capital is commonly ",
"V in any case, as it was and is in inscriptions (easier to chisel). ",
"If this is NO/FALSE, the output will have the same character as input.",
"The program default, and the dictionary convention is to retain the v.",
"Reset If this ia unsuitable for your application. The default is N(o)." );
PAUSE_IN_SCREEN_OUTPUT_HELP : constant HELP_TYPE := (
"This option instructs the program to pause in output on the screen ",
"after about 16 lines so that the user can read the output, otherwise ",
"it would just scroll off the top. A RETURN/ENTER gives another page. ",
"If the program is waiting for a return, it cannot take other input. ",
"This option is active only for keyboard entry or command line input, ",
"and only when there is no output file. It is moot if only single word",
"input or brief output. The default is Y(es). " );
NO_SCREEN_ACTIVITY_HELP : constant HELP_TYPE := (
"This option instructs the program not to keep a running screen of the ",
"input. This is probably only to be used by the developer to calibrate",
"run times for large text file input, removing the time necessary to ",
"write to screen. The default is N(o). ");
UPDATE_LOCAL_DICTIONARY_HELP : constant HELP_TYPE := (
"This option instructs the program to invite the user to input a new ",
"word to the local dictionary on the fly. This is only active if the ",
"program is not using an (@) input file! If an UNKNOWN is discovered, ",
"the program asks for STEM, PART, and MEAN, the basic elements of a ",
"dictionary entry. These are put into the local dictionary right then,",
"and are available for the rest of the session, and all later sessions.",
"The use of this option requires a detailed knowledge of the structure ",
"of dictionary entries, and is not for the average user. If the entry ",
"is not valid, reloading the dictionary will raise and exception, and ",
"the invalid entry will be rejected, but the program will continue ",
"without that word. Any invalid entries can be corrected or deleted ",
"off-line with a text editor on the local dictionary file. If one does",
"not want to enter a word when this option is on, a simple RETURN at ",
"the STEM=> prompt will ignore and continue the program. This option ",
"is only for very experienced users and should normally be off. ",
" The default is N(o). ",
" ------ NOT AVAILABLE IN THIS VERSION ------- " );
UPDATE_MEANINGS_HELP : constant HELP_TYPE := (
"This option instructs the program to invite the user to modify the ",
"meaning displayed on a word translation. This is only active if the ",
"program is not using an (@) input file! These changes are put into ",
"the dictionary right then and permenently, and are available from ",
"then on, in this session, and all later sessions. Unfortunately, ",
"these changes will not survive the replacement of the dictionary by a ",
"new version from the developer. Changes can only be recovered by ",
"considerable prcessing by the deneloper, and should be left there. ",
"This option is only for experienced users and should remain off. ",
" The default is N(o). ",
" ------ NOT AVAILABLE IN THIS VERSION ------- " );
MINIMIZE_OUTPUT_HELP : constant HELP_TYPE := (
"This option instructs the program to minimize the output. This is a ",
"somewhat flexible term, but the use of this option will probably lead ",
"to less output. The default is Y(es). " );
SAVE_PARAMETERS_HELP : constant HELP_TYPE := (
"This option instructs the program, to save the current parameters, as ",
"just established by the user, in a file WORD.MDV. If such a file ",
"exists, the program will load those parameters at the start. If no ",
"such file can be found in the current subdirectory, the program will ",
"start with a default set of parameters. Since this parameter file is ",
"human-readable ASCII, it may also be created with a text editor. If ",
"the file found has been improperly created, is in the wrong format, or",
"otherwise uninterpretable by the program, it will be ignored and the ",
"default parameters used, until a proper parameter file in written by ",
"the program. Since one may want to make temporary changes during a ",
"run, but revert to the usual set, the default is N(o). " );
procedure PUT(HELP : HELP_TYPE) is
begin
NEW_LINE;
for I in HELP'FIRST..HELP'LAST loop
PUT_LINE(HELP(I));
end loop;
NEW_LINE;
end PUT;
procedure UPDATE_LOCAL_DICTIONARY_FILE is
use TEXT_IO;
BLANK_LINE : STRING(1..80) := (others => ' ');
LINE, STEM_LINE, PART_LINE, MEAN_LINE : STRING(1..80) := BLANK_LINE;
L, SL, PL, ML : INTEGER := 0; -- SL BAD NAME !!!!!!!!!!!
--DICT_LOC : DICTIONARY; -- Def in LINE_STUFF
DICT_LOC_FILE : FILE_TYPE;
DUMMY : FILE_TYPE;
-- Omit when put name here
DICT_LOC_NAME : constant STRING :=
ADD_FILE_NAME_EXTENSION(DICTIONARY_FILE_NAME, "LOCAL");
procedure READY_DICT_LOC_FILE is
-- Effectively goes to the end of DICT_LOC to ready for appending
-- Does this by making a new file and writing the old DICT_LOC into it
-- If there is not already a DICT_LOC, it creates one
begin
OPEN(DICT_LOC_FILE, IN_FILE, DICT_LOC_NAME);
CREATE(DUMMY, OUT_FILE);
while not END_OF_FILE(DICT_LOC_FILE) loop
GET_LINE(DICT_LOC_FILE, LINE, L);
PUT_LINE(DUMMY, LINE(1..L));
end loop;
RESET(DUMMY, IN_FILE);
DELETE(DICT_LOC_FILE); -- Might RESET, but environment might not support
CREATE(DICT_LOC_FILE, OUT_FILE, DICT_LOC_NAME);
while not END_OF_FILE(DUMMY) loop
GET_LINE(DUMMY, LINE, L);
PUT_LINE(DICT_LOC_FILE, LINE(1..L));
end loop;
DELETE(DUMMY);
exception
when NAME_ERROR =>
CREATE(DICT_LOC_FILE, OUT_FILE, DICT_LOC_NAME);
end READY_DICT_LOC_FILE;
procedure APPEND_TO_DICT_LOC_FILE is
-- This just appends the 3 lines of a dictionary entry to DICT_LOC
-- It prepares the file to write at the end, writes, then closes it
begin
READY_DICT_LOC_FILE;
PUT_LINE(DICT_LOC_FILE, STEM_LINE(1..SL)); -- SL bad name
PUT(DICT_LOC_FILE, PART_LINE(1..PL));
PUT_LINE(DICT_LOC_FILE, " X X X X X ");
PUT_LINE(DICT_LOC_FILE, MEAN_LINE(1..ML));
CLOSE(DICT_LOC_FILE);
end APPEND_TO_DICT_LOC_FILE;
begin
loop
TEXT_IO.PUT("STEMS =>");
GET_LINE(STEM_LINE, SL);
if SL > 0 then -- if no input for stems, then just skip the entry
TEXT_IO.PUT("PART =>");
GET_LINE(PART_LINE, PL);
TEXT_IO.PUT("MEAN =>");
GET_LINE(MEAN_LINE, ML);
else
exit; -- on no entry, just CR
end if;
begin
APPEND_TO_DICT_LOC_FILE;
DICT_LOC := NULL_DICTIONARY;
LOAD_DICTIONARY(DICT_LOC,
ADD_FILE_NAME_EXTENSION(DICTIONARY_FILE_NAME, "LOCAL"));
-- Need to carry LOC through consistently on LOAD_D and LOAD_D_FILE
LOAD_STEM_FILE(LOCAL);
DICTIONARY_AVAILABLE(LOCAL) := TRUE;
exit; -- If everything OK, otherwise loop back and try again
end;
end loop;
end UPDATE_LOCAL_DICTIONARY_FILE;
procedure PUT_MDEVS is
use MDEV_TYPE_IO;
use REPLY_TYPE_IO;
begin
if IS_OPEN(MDEV_FILE) then
CLOSE(MDEV_FILE);
end if;
CREATE(MDEV_FILE, OUT_FILE, MDEV_FULL_NAME);
for I in WORDS_MDEV'RANGE loop
PUT(MDEV_FILE, I);
SET_COL(MDEV_FILE, 35);
PUT(MDEV_FILE, REPLY(WORDS_MDEV(I)));
NEW_LINE(MDEV_FILE);
end loop;
PUT(MDEV_FILE, "START_FILE_CHARACTER '" &
START_FILE_CHARACTER &"'"); NEW_LINE(MDEV_FILE);
PUT(MDEV_FILE, "CHANGE_PARAMETERS_CHARACTER '" &
CHANGE_PARAMETERS_CHARACTER &"'"); NEW_LINE(MDEV_FILE);
PUT(MDEV_FILE, "CHANGE_DEVELOPER_MODES_CHARACTER '" &
CHANGE_DEVELOPER_MODES_CHARACTER &"'"); NEW_LINE(MDEV_FILE);
CLOSE(MDEV_FILE);
end PUT_MDEVS;
procedure GET_MDEVS is
use MDEV_TYPE_IO;
use REPLY_TYPE_IO;
MO : MDEV_TYPE;
REP : REPLY_TYPE;
LINE : STRING(1..100) := (others => ' ');
LAST : INTEGER := 0;
begin
OPEN(MDEV_FILE, IN_FILE, MDEV_FULL_NAME);
for I in WORDS_MDEV'RANGE loop
GET(MDEV_FILE, MO);
GET(MDEV_FILE, REP);
WORDS_MDEV(MO) := MDEV_OF_REPLY(REP);
end loop;
SKIP_LINE(MDEV_FILE);
GET_LINE(MDEV_FILE, LINE, LAST);
if LINE(1..20) = "START_FILE_CHARACTER" then
if ((LINE(35) in '!'..'/') or
(LINE(35) in ':'..'@') or
(LINE(35) in '['..'`') or
(LINE(35) in '{'..'~')) and
(LINE(35) /= CHANGE_PARAMETERS_CHARACTER) and
(LINE(35) /= CHANGE_DEVELOPER_MODES_CHARACTER) then
START_FILE_CHARACTER := LINE(35);
else
PUT_LINE("Not an acceptable START_FILE_CHARACTER, may conflict");
PUT_LINE("NO CHANGE !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!");
end if;
else
raise BAD_MDEV_FILE;
end if;
GET_LINE(MDEV_FILE, LINE, LAST);
if LINE(1..27) = "CHANGE_PARAMETERS_CHARACTER" then
if ((LINE(35) in '!'..'/') or
(LINE(35) in ':'..'@') or
(LINE(35) in '['..'`') or
(LINE(35) in '{'..'~')) and
(LINE(35) /= START_FILE_CHARACTER) and
(LINE(35) /= CHANGE_DEVELOPER_MODES_CHARACTER) then
CHANGE_PARAMETERS_CHARACTER := LINE(35);
else
PUT_LINE("Not an acceptable CHANGE_PARAMETERS_CHARACTER, may conflict");
PUT_LINE("NO CHANGE !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!");
end if;
else
raise BAD_MDEV_FILE;
end if;
GET_LINE(MDEV_FILE, LINE, LAST);
if LINE(1..32) = "CHANGE_DEVELOPER_MODES_CHARACTER" then
if ((LINE(35) in '!'..'/') or
(LINE(35) in ':'..'@') or
(LINE(35) in '['..'`') or
(LINE(35) in '{'..'~')) and
(LINE(35) /= START_FILE_CHARACTER) and
(LINE(35) /= CHANGE_PARAMETERS_CHARACTER) then
CHANGE_DEVELOPER_MODES_CHARACTER := LINE(35);
else
PUT_LINE("Not an acceptable CHANGE_DEVELOPER_MODES_CHARACTER, may conflict");
PUT_LINE("NO CHANGE !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!");
end if;
else
raise BAD_MDEV_FILE;
end if;
CLOSE(MDEV_FILE);
exception
when NAME_ERROR =>
raise;
when others =>
raise BAD_MDEV_FILE;
end GET_MDEVS;
procedure INQUIRE(MO : MDEV_TYPE; HELP : in HELP_TYPE := NO_HELP) is
use MDEV_TYPE_IO;
use REPLY_TYPE_IO;
L1 : STRING(1..100);
LL : NATURAL;
R : REPLY_TYPE;
begin
PUT(MO);
PUT(" ? "); SET_COL(45); PUT("(Currently ");
PUT(REPLY(WORDS_MDEV(MO))); PUT(" =>");
GET_LINE(L1, LL);
if LL /= 0 then
if TRIM(L1(1..LL)) = "" then
PUT_LINE("Blank input, skipping the rest of CHANGE_DEVELOPER_MODES");
raise BLANK_INPUT;
elsif L1(1) = '?' then
PUT(HELP);
INQUIRE(MO, HELP);
else
GET(L1(1..LL), R, LL);
WORDS_MDEV(MO) := MDEV_OF_REPLY(R);
end if;
end if;
NEW_LINE;
end INQUIRE;
procedure CHANGE_DEVELOPER_MODES is
L1 : STRING(1..100);
LL : NATURAL;
R : REPLY_TYPE;
begin
PUT_LINE("To set developer modes reply Y/y or N/n. Return accepts current value.");
PUT_LINE("A '?' reply gives infomation/help on that parameter. A space skips the rest.");
PUT_LINE("Developer modes are only for special requirements and may not all be operable.");
NEW_LINE;
-- Interactive MDEV - lets you do things on unknown words
-- You can say it is a noun and then look at the endings
-- Or look all the endings and guess what part of speech
-- You can look at the dictionary items that are close to the word
-- There may be cases in which the stem is found but is not of right part
-- So maybe the word list is deficient and that root goes also to a ADJ
-- even if it is listed only for a N.
-- One can also look for ADV here with ending 'e', etc.
-- You can look up the word in a paper dictionary (with the help of ending)
-- And then enter the word into DICT.LOC, so it will hit next time
-- All unknowns could be recorded in a file for later reference
-- A '?' gives information (help) about the item in question
-- One can change the symbol that the main program uses for change and file
-- One can save the new parameters or let them revert to previous
-- There should be a basic set of parameters that one can always go to
-- There should be moods of translation, maybe to switch dictionaries
-- Maybe to turn on or off pre/suffix
-- Maybe to allow the user to look at just all the prefixes that match
-- INQUIRE(HAVE_DEBUG_FILE, HAVE_DEBUG_FILE_HELP);
-- if IS_OPEN(DBG) and then not WORDS_MDEV(HAVE_DEBUG_FILE) then
-- DELETE(DBG);
-- WORDS_MDEV(WRITE_DEBUG_FILE) := FALSE;
-- end if;
-- if not IS_OPEN(DBG) and then WORDS_MDEV(HAVE_DEBUG_FILE) then
-- begin
-- CREATE(DBG, OUT_FILE, DEBUG_FULL_NAME);
-- exception
-- when others =>
-- PUT_LINE("Cannot CREATE WORD.DBG - Check if it is in use elsewhere");
-- end;
-- end if;
--
-- if WORDS_MDEV(HAVE_DEBUG_FILE) then
-- INQUIRE(WRITE_DEBUG_FILE, WRITE_DEBUG_FILE_HELP);
-- end if;
INQUIRE(HAVE_STATISTICS_FILE, HAVE_STATISTICS_FILE_HELP);
if IS_OPEN(STATS) and then not WORDS_MDEV(HAVE_STATISTICS_FILE) then
DELETE(STATS);
WORDS_MDEV(WRITE_STATISTICS_FILE) := FALSE;
end if;
if not IS_OPEN(STATS) and then WORDS_MDEV(HAVE_STATISTICS_FILE) then
begin
CREATE(STATS, OUT_FILE, STATS_FULL_NAME);
exception
when others =>
PUT_LINE("Cannot CREATE WORD.STA - Check if it is in use elsewhere");
end;
end if;
if WORDS_MDEV(HAVE_STATISTICS_FILE) then
INQUIRE(WRITE_STATISTICS_FILE, WRITE_STATISTICS_FILE_HELP);
end if;
INQUIRE(DO_ONLY_INITIAL_WORD, DO_ONLY_INITIAL_WORD_HELP);
if WORDS_MDEV(DO_ONLY_INITIAL_WORD) then
INQUIRE(FOR_WORD_LIST_CHECK, FOR_WORD_LIST_CHECK_HELP);
else
WORDS_MDEV(FOR_WORD_LIST_CHECK) := FALSE;
end if;
INQUIRE(SHOW_DICTIONARY, SHOW_DICTIONARY_HELP);
INQUIRE(SHOW_DICTIONARY_LINE, SHOW_DICTIONARY_LINE_HELP);
INQUIRE(SHOW_DICTIONARY_CODES, SHOW_DICTIONARY_CODES_HELP);
INQUIRE(DO_PEARSE_CODES, DO_PEARSE_CODES_HELP);
if WORDS_MODE(DO_FIXES) then
INQUIRE(DO_ONLY_FIXES, DO_ONLY_FIXES_HELP);
INQUIRE(DO_FIXES_ANYWAY, DO_FIXES_ANYWAY_HELP);
end if;
INQUIRE(USE_PREFIXES, USE_PREFIXES_HELP);
INQUIRE(USE_SUFFIXES, USE_SUFFIXES_HELP);
INQUIRE(USE_TACKONS, USE_TACKONS_HELP);
if WORDS_MODE(DO_TRICKS) then
INQUIRE(DO_MEDIEVAL_TRICKS, DO_MEDIEVAL_TRICKS_HELP);
end if;
INQUIRE(DO_SYNCOPE, DO_SYNCOPE_HELP);
INQUIRE(DO_TWO_WORDS, DO_TWO_WORDS_HELP);
INQUIRE(INCLUDE_UNKNOWN_CONTEXT, INCLUDE_UNKNOWN_CONTEXT_HELP);
INQUIRE(NO_MEANINGS, NO_MEANINGS_HELP);
INQUIRE(OMIT_ARCHAIC, OMIT_ARCHAIC_HELP);
INQUIRE(OMIT_MEDIEVAL, OMIT_MEDIEVAL_HELP);
INQUIRE(OMIT_UNCOMMON, OMIT_UNCOMMON_HELP);
INQUIRE(DO_I_FOR_J, DO_I_FOR_J_HELP);
INQUIRE(DO_U_FOR_V, DO_U_FOR_V_HELP);
INQUIRE(PAUSE_IN_SCREEN_OUTPUT, PAUSE_IN_SCREEN_OUTPUT_HELP);
INQUIRE(NO_SCREEN_ACTIVITY, NO_SCREEN_ACTIVITY_HELP);
INQUIRE(UPDATE_LOCAL_DICTIONARY, UPDATE_LOCAL_DICTIONARY_HELP);
INQUIRE(UPDATE_MEANINGS, UPDATE_MEANINGS_HELP);
INQUIRE(MINIMIZE_OUTPUT, MINIMIZE_OUTPUT_HELP);
PUT("START_FILE_CHARACTER ? "); SET_COL(45); PUT("(Currently '");
PUT(START_FILE_CHARACTER); PUT("'");
PUT(" =>");
GET_LINE(L1, LL);
if LL /= 0 then
if ((L1(1) in '!'..'/') or
(L1(1) in ':'..'@') or
(L1(1) in '['..'`') or
(L1(1) in '{'..'~')) and
(L1(1) /= CHANGE_PARAMETERS_CHARACTER) and
(L1(1) /= CHANGE_DEVELOPER_MODES_CHARACTER) then
START_FILE_CHARACTER := L1(1);
else
PUT_LINE("Not an acceptable character, may conflict with other input");
PUT_LINE("NO CHANGE !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!");
end if;
end if;
NEW_LINE;
PUT("CHANGE_PARAMETERS_CHARACTER ? "); SET_COL(45); PUT("(Currently '");
PUT(CHANGE_PARAMETERS_CHARACTER); PUT("'");
PUT(" =>");
GET_LINE(L1, LL);
if LL /= 0 then
if ((L1(1) in '!'..'/') or
(L1(1) in ':'..'@') or
(L1(1) in '['..'`') or
(L1(1) in '{'..'~')) and
(L1(1) /= START_FILE_CHARACTER) and
(L1(1) /= CHANGE_DEVELOPER_MODES_CHARACTER) then
CHANGE_PARAMETERS_CHARACTER := L1(1);
else
PUT_LINE("Not an acceptable character, may conflict with other input");
PUT_LINE("NO CHANGE !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!");
end if;
end if;
NEW_LINE;
PUT("CHANGE_DEVELOPER_MODES_CHARACTER ? ");
SET_COL(45); PUT("(Currently '");
PUT(CHANGE_DEVELOPER_MODES_CHARACTER); PUT("'");
PUT(" =>");
GET_LINE(L1, LL);
if LL /= 0 then
if ((L1(1) in '!'..'/') or
(L1(1) in ':'..'@') or
(L1(1) in '['..'`') or
(L1(1) in '{'..'~')) and
(L1(1) /= START_FILE_CHARACTER) and
(L1(1) /= CHANGE_LANGUAGE_CHARACTER) and
(L1(1) /= CHANGE_PARAMETERS_CHARACTER) then
CHANGE_DEVELOPER_MODES_CHARACTER := L1(1);
else
PUT_LINE("Not an acceptable character, may conflict with other input");
PUT_LINE("NO CHANGE !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!");
end if;
end if;
NEW_LINE;
PUT("Do you wish to save this set of parameters? Y or N (Default) ");
PUT(" =>");
GET_LINE(L1, LL);
if LL /= 0 then
if L1(1) = '?' then
PUT(SAVE_PARAMETERS_HELP);
PUT("Do you wish to save this set of parameters? Y or N (Default) ");
PUT(" =>");
GET_LINE(L1, LL);
end if;
REPLY_TYPE_IO.GET(L1(1..LL), R, LL);
if MDEV_OF_REPLY(R) then
PUT_MDEVS;
PUT_LINE("MDEV_ARRAY saved in file " & MDEV_FULL_NAME);
end if;
end if;
NEW_LINE;
exception
when BLANK_INPUT =>
null;
when others =>
PUT_LINE("Bad input - terminating CHANGE_DEVELOPER_PARAMETERS");
end CHANGE_DEVELOPER_MODES;
procedure INITIALIZE_DEVELOPER_PARAMETERS is
begin
DO_MDEV_FILE:
begin
-- Read the MDEV file
GET_MDEVS;
PREFACE.PUT_LINE("MDEV_FILE found - Using those MDEVs and parameters");
exception
-- If there is any problem
-- Put that the MDEV file is corrupted and the options are:
-- to proceed with default parameters
-- to set parameters with a CHANGE (SET) PARAMETERS and save
-- to examine the MDEV file with a text editor and try to repair it
when NAME_ERROR =>
WORDS_MDEV := DEFAULT_MDEV_ARRAY;
when BAD_MDEV_FILE =>
PREFACE.PUT_LINE("MDEV_FILE exists, but empty or corupted - Default MDEVs used");
PREFACE.PUT_LINE("You can set new parameters with CHANGE PARAMETERS and save.");
WORDS_MDEV := DEFAULT_MDEV_ARRAY;
end DO_MDEV_FILE;
-- if not IS_OPEN(DBG) and then WORDS_MDEV(HAVE_DEBUG_FILE) then
-- CREATE(DBG, OUT_FILE, DEBUG_FULL_NAME);
-- PREFACE.PUT_LINE("WORD.DBG Created at Initialization");
-- end if;
if not IS_OPEN(STATS) and then WORDS_MDEV(HAVE_STATISTICS_FILE) then
CREATE(STATS, OUT_FILE, STATS_FULL_NAME);
PREFACE.PUT_LINE("WORD.STA Created at Initialization");
end if;
end INITIALIZE_DEVELOPER_PARAMETERS;
end DEVELOPER_PARAMETERS;
|
-- begin read only
pragma Ada_2012;
pragma Style_Checks (Off);
pragma Warnings (Off); -- Since this is automaticly generated
with Interfaces.C; use Interfaces.C;
package PCAP.Low_Level.pcap_bpf_h is
BPF_RELEASE : constant := 199606; -- /usr/include/pcap/bpf.h:79
-- unsupported macro: BPF_ALIGNMENT sizeof(bpf_int32)
-- arg-macro: function BPF_WORDALIGN (x)
-- return ((x)+(BPF_ALIGNMENT-1))and~(BPF_ALIGNMENT-1);
DLT_NULL : constant := 0; -- /usr/include/pcap/bpf.h:132
DLT_EN10MB : constant := 1; -- /usr/include/pcap/bpf.h:133
DLT_EN3MB : constant := 2; -- /usr/include/pcap/bpf.h:134
DLT_AX25 : constant := 3; -- /usr/include/pcap/bpf.h:135
DLT_PRONET : constant := 4; -- /usr/include/pcap/bpf.h:136
DLT_CHAOS : constant := 5; -- /usr/include/pcap/bpf.h:137
DLT_IEEE802 : constant := 6; -- /usr/include/pcap/bpf.h:138
DLT_ARCNET : constant := 7; -- /usr/include/pcap/bpf.h:139
DLT_SLIP : constant := 8; -- /usr/include/pcap/bpf.h:140
DLT_PPP : constant := 9; -- /usr/include/pcap/bpf.h:141
DLT_FDDI : constant := 10; -- /usr/include/pcap/bpf.h:142
DLT_ATM_RFC1483 : constant := 11; -- /usr/include/pcap/bpf.h:153
DLT_RAW : constant := 12; -- /usr/include/pcap/bpf.h:158
DLT_SLIP_BSDOS : constant := 15; -- /usr/include/pcap/bpf.h:173
DLT_PPP_BSDOS : constant := 16; -- /usr/include/pcap/bpf.h:174
DLT_ATM_CLIP : constant := 19; -- /usr/include/pcap/bpf.h:209
DLT_REDBACK_SMARTEDGE : constant := 32; -- /usr/include/pcap/bpf.h:215
DLT_PPP_SERIAL : constant := 50; -- /usr/include/pcap/bpf.h:222
DLT_PPP_ETHER : constant := 51; -- /usr/include/pcap/bpf.h:223
DLT_SYMANTEC_FIREWALL : constant := 99; -- /usr/include/pcap/bpf.h:232
DLT_MATCHING_MIN : constant := 104; -- /usr/include/pcap/bpf.h:251
DLT_C_HDLC : constant := 104; -- /usr/include/pcap/bpf.h:267
-- unsupported macro: DLT_CHDLC DLT_C_HDLC
DLT_IEEE802_11 : constant := 105; -- /usr/include/pcap/bpf.h:270
DLT_FRELAY : constant := 107; -- /usr/include/pcap/bpf.h:285
DLT_LOOP : constant := 108; -- /usr/include/pcap/bpf.h:297
DLT_ENC : constant := 109; -- /usr/include/pcap/bpf.h:308
DLT_LINUX_SLL : constant := 113; -- /usr/include/pcap/bpf.h:321
DLT_LTALK : constant := 114; -- /usr/include/pcap/bpf.h:326
DLT_ECONET : constant := 115; -- /usr/include/pcap/bpf.h:331
DLT_IPFILTER : constant := 116; -- /usr/include/pcap/bpf.h:336
DLT_PFLOG : constant := 117; -- /usr/include/pcap/bpf.h:341
DLT_CISCO_IOS : constant := 118; -- /usr/include/pcap/bpf.h:346
DLT_PRISM_HEADER : constant := 119; -- /usr/include/pcap/bpf.h:353
DLT_AIRONET_HEADER : constant := 120; -- /usr/include/pcap/bpf.h:359
DLT_HHDLC : constant := 121; -- /usr/include/pcap/bpf.h:402
DLT_IP_OVER_FC : constant := 122; -- /usr/include/pcap/bpf.h:413
DLT_SUNATM : constant := 123; -- /usr/include/pcap/bpf.h:429
DLT_RIO : constant := 124; -- /usr/include/pcap/bpf.h:435
DLT_PCI_EXP : constant := 125; -- /usr/include/pcap/bpf.h:436
DLT_AURORA : constant := 126; -- /usr/include/pcap/bpf.h:437
DLT_IEEE802_11_RADIO : constant := 127; -- /usr/include/pcap/bpf.h:444
DLT_TZSP : constant := 128; -- /usr/include/pcap/bpf.h:454
DLT_ARCNET_LINUX : constant := 129; -- /usr/include/pcap/bpf.h:467
DLT_JUNIPER_MLPPP : constant := 130; -- /usr/include/pcap/bpf.h:475
DLT_JUNIPER_MLFR : constant := 131; -- /usr/include/pcap/bpf.h:476
DLT_JUNIPER_ES : constant := 132; -- /usr/include/pcap/bpf.h:477
DLT_JUNIPER_GGSN : constant := 133; -- /usr/include/pcap/bpf.h:478
DLT_JUNIPER_MFR : constant := 134; -- /usr/include/pcap/bpf.h:479
DLT_JUNIPER_ATM2 : constant := 135; -- /usr/include/pcap/bpf.h:480
DLT_JUNIPER_SERVICES : constant := 136; -- /usr/include/pcap/bpf.h:481
DLT_JUNIPER_ATM1 : constant := 137; -- /usr/include/pcap/bpf.h:482
DLT_APPLE_IP_OVER_IEEE1394 : constant := 138; -- /usr/include/pcap/bpf.h:499
DLT_MTP2_WITH_PHDR : constant := 139; -- /usr/include/pcap/bpf.h:505
DLT_MTP2 : constant := 140; -- /usr/include/pcap/bpf.h:506
DLT_MTP3 : constant := 141; -- /usr/include/pcap/bpf.h:507
DLT_SCCP : constant := 142; -- /usr/include/pcap/bpf.h:508
DLT_DOCSIS : constant := 143; -- /usr/include/pcap/bpf.h:513
DLT_LINUX_IRDA : constant := 144; -- /usr/include/pcap/bpf.h:530
DLT_IBM_SP : constant := 145; -- /usr/include/pcap/bpf.h:535
DLT_IBM_SN : constant := 146; -- /usr/include/pcap/bpf.h:536
DLT_USER0 : constant := 147; -- /usr/include/pcap/bpf.h:563
DLT_USER1 : constant := 148; -- /usr/include/pcap/bpf.h:564
DLT_USER2 : constant := 149; -- /usr/include/pcap/bpf.h:565
DLT_USER3 : constant := 150; -- /usr/include/pcap/bpf.h:566
DLT_USER4 : constant := 151; -- /usr/include/pcap/bpf.h:567
DLT_USER5 : constant := 152; -- /usr/include/pcap/bpf.h:568
DLT_USER6 : constant := 153; -- /usr/include/pcap/bpf.h:569
DLT_USER7 : constant := 154; -- /usr/include/pcap/bpf.h:570
DLT_USER8 : constant := 155; -- /usr/include/pcap/bpf.h:571
DLT_USER9 : constant := 156; -- /usr/include/pcap/bpf.h:572
DLT_USER10 : constant := 157; -- /usr/include/pcap/bpf.h:573
DLT_USER11 : constant := 158; -- /usr/include/pcap/bpf.h:574
DLT_USER12 : constant := 159; -- /usr/include/pcap/bpf.h:575
DLT_USER13 : constant := 160; -- /usr/include/pcap/bpf.h:576
DLT_USER14 : constant := 161; -- /usr/include/pcap/bpf.h:577
DLT_USER15 : constant := 162; -- /usr/include/pcap/bpf.h:578
DLT_IEEE802_11_RADIO_AVS : constant := 163; -- /usr/include/pcap/bpf.h:590
DLT_JUNIPER_MONITOR : constant := 164; -- /usr/include/pcap/bpf.h:598
DLT_BACNET_MS_TP : constant := 165; -- /usr/include/pcap/bpf.h:603
DLT_PPP_PPPD : constant := 166; -- /usr/include/pcap/bpf.h:619
-- unsupported macro: DLT_PPP_WITH_DIRECTION DLT_PPP_PPPD
-- unsupported macro: DLT_LINUX_PPP_WITHDIRECTION DLT_PPP_PPPD
DLT_JUNIPER_PPPOE : constant := 167; -- /usr/include/pcap/bpf.h:634
DLT_JUNIPER_PPPOE_ATM : constant := 168; -- /usr/include/pcap/bpf.h:635
DLT_GPRS_LLC : constant := 169; -- /usr/include/pcap/bpf.h:637
DLT_GPF_T : constant := 170; -- /usr/include/pcap/bpf.h:638
DLT_GPF_F : constant := 171; -- /usr/include/pcap/bpf.h:639
DLT_GCOM_T1E1 : constant := 172; -- /usr/include/pcap/bpf.h:645
DLT_GCOM_SERIAL : constant := 173; -- /usr/include/pcap/bpf.h:646
DLT_JUNIPER_PIC_PEER : constant := 174; -- /usr/include/pcap/bpf.h:653
DLT_ERF_ETH : constant := 175; -- /usr/include/pcap/bpf.h:661
DLT_ERF_POS : constant := 176; -- /usr/include/pcap/bpf.h:662
DLT_LINUX_LAPD : constant := 177; -- /usr/include/pcap/bpf.h:670
DLT_JUNIPER_ETHER : constant := 178; -- /usr/include/pcap/bpf.h:679
DLT_JUNIPER_PPP : constant := 179; -- /usr/include/pcap/bpf.h:680
DLT_JUNIPER_FRELAY : constant := 180; -- /usr/include/pcap/bpf.h:681
DLT_JUNIPER_CHDLC : constant := 181; -- /usr/include/pcap/bpf.h:682
DLT_MFR : constant := 182; -- /usr/include/pcap/bpf.h:687
DLT_JUNIPER_VP : constant := 183; -- /usr/include/pcap/bpf.h:695
DLT_A429 : constant := 184; -- /usr/include/pcap/bpf.h:704
DLT_A653_ICM : constant := 185; -- /usr/include/pcap/bpf.h:711
DLT_USB : constant := 186; -- /usr/include/pcap/bpf.h:717
DLT_BLUETOOTH_HCI_H4 : constant := 187; -- /usr/include/pcap/bpf.h:723
DLT_IEEE802_16_MAC_CPS : constant := 188; -- /usr/include/pcap/bpf.h:729
DLT_USB_LINUX : constant := 189; -- /usr/include/pcap/bpf.h:735
DLT_CAN20B : constant := 190; -- /usr/include/pcap/bpf.h:744
DLT_IEEE802_15_4_LINUX : constant := 191; -- /usr/include/pcap/bpf.h:750
DLT_PPI : constant := 192; -- /usr/include/pcap/bpf.h:756
DLT_IEEE802_16_MAC_CPS_RADIO : constant := 193; -- /usr/include/pcap/bpf.h:762
DLT_JUNIPER_ISM : constant := 194; -- /usr/include/pcap/bpf.h:770
DLT_IEEE802_15_4 : constant := 195; -- /usr/include/pcap/bpf.h:778
DLT_SITA : constant := 196; -- /usr/include/pcap/bpf.h:784
DLT_ERF : constant := 197; -- /usr/include/pcap/bpf.h:791
DLT_RAIF1 : constant := 198; -- /usr/include/pcap/bpf.h:798
DLT_IPMB : constant := 199; -- /usr/include/pcap/bpf.h:805
DLT_JUNIPER_ST : constant := 200; -- /usr/include/pcap/bpf.h:812
DLT_BLUETOOTH_HCI_H4_WITH_PHDR : constant := 201; -- /usr/include/pcap/bpf.h:818
DLT_AX25_KISS : constant := 202; -- /usr/include/pcap/bpf.h:827
DLT_LAPD : constant := 203; -- /usr/include/pcap/bpf.h:834
DLT_PPP_WITH_DIR : constant := 204; -- /usr/include/pcap/bpf.h:842
DLT_C_HDLC_WITH_DIR : constant := 205; -- /usr/include/pcap/bpf.h:843
DLT_FRELAY_WITH_DIR : constant := 206; -- /usr/include/pcap/bpf.h:844
DLT_LAPB_WITH_DIR : constant := 207; -- /usr/include/pcap/bpf.h:845
DLT_IPMB_LINUX : constant := 209; -- /usr/include/pcap/bpf.h:856
DLT_FLEXRAY : constant := 210; -- /usr/include/pcap/bpf.h:862
DLT_MOST : constant := 211; -- /usr/include/pcap/bpf.h:869
DLT_LIN : constant := 212; -- /usr/include/pcap/bpf.h:876
DLT_X2E_SERIAL : constant := 213; -- /usr/include/pcap/bpf.h:882
DLT_X2E_XORAYA : constant := 214; -- /usr/include/pcap/bpf.h:888
DLT_IEEE802_15_4_NONASK_PHY : constant := 215; -- /usr/include/pcap/bpf.h:899
DLT_LINUX_EVDEV : constant := 216; -- /usr/include/pcap/bpf.h:907
DLT_GSMTAP_UM : constant := 217; -- /usr/include/pcap/bpf.h:914
DLT_GSMTAP_ABIS : constant := 218; -- /usr/include/pcap/bpf.h:915
DLT_MPLS : constant := 219; -- /usr/include/pcap/bpf.h:922
DLT_USB_LINUX_MMAPPED : constant := 220; -- /usr/include/pcap/bpf.h:928
DLT_DECT : constant := 221; -- /usr/include/pcap/bpf.h:934
DLT_AOS : constant := 222; -- /usr/include/pcap/bpf.h:945
DLT_WIHART : constant := 223; -- /usr/include/pcap/bpf.h:954
DLT_FC_2 : constant := 224; -- /usr/include/pcap/bpf.h:960
DLT_FC_2_WITH_FRAME_DELIMS : constant := 225; -- /usr/include/pcap/bpf.h:974
DLT_IPNET : constant := 226; -- /usr/include/pcap/bpf.h:1022
DLT_CAN_SOCKETCAN : constant := 227; -- /usr/include/pcap/bpf.h:1031
DLT_IPV4 : constant := 228; -- /usr/include/pcap/bpf.h:1037
DLT_IPV6 : constant := 229; -- /usr/include/pcap/bpf.h:1038
DLT_IEEE802_15_4_NOFCS : constant := 230; -- /usr/include/pcap/bpf.h:1045
DLT_DBUS : constant := 231; -- /usr/include/pcap/bpf.h:1063
DLT_JUNIPER_VS : constant := 232; -- /usr/include/pcap/bpf.h:1069
DLT_JUNIPER_SRX_E2E : constant := 233; -- /usr/include/pcap/bpf.h:1070
DLT_JUNIPER_FIBRECHANNEL : constant := 234; -- /usr/include/pcap/bpf.h:1071
DLT_DVB_CI : constant := 235; -- /usr/include/pcap/bpf.h:1083
DLT_MUX27010 : constant := 236; -- /usr/include/pcap/bpf.h:1090
DLT_STANAG_5066_D_PDU : constant := 237; -- /usr/include/pcap/bpf.h:1096
DLT_JUNIPER_ATM_CEMIC : constant := 238; -- /usr/include/pcap/bpf.h:1102
DLT_NFLOG : constant := 239; -- /usr/include/pcap/bpf.h:1110
DLT_NETANALYZER : constant := 240; -- /usr/include/pcap/bpf.h:1120
DLT_NETANALYZER_TRANSPARENT : constant := 241; -- /usr/include/pcap/bpf.h:1131
DLT_IPOIB : constant := 242; -- /usr/include/pcap/bpf.h:1138
DLT_MPEG_2_TS : constant := 243; -- /usr/include/pcap/bpf.h:1145
DLT_NG40 : constant := 244; -- /usr/include/pcap/bpf.h:1153
DLT_NFC_LLCP : constant := 245; -- /usr/include/pcap/bpf.h:1163
DLT_PFSYNC : constant := 246; -- /usr/include/pcap/bpf.h:1173
DLT_INFINIBAND : constant := 247; -- /usr/include/pcap/bpf.h:1181
DLT_SCTP : constant := 248; -- /usr/include/pcap/bpf.h:1188
DLT_USBPCAP : constant := 249; -- /usr/include/pcap/bpf.h:1195
DLT_RTAC_SERIAL : constant := 250; -- /usr/include/pcap/bpf.h:1203
DLT_BLUETOOTH_LE_LL : constant := 251; -- /usr/include/pcap/bpf.h:1210
DLT_WIRESHARK_UPPER_PDU : constant := 252; -- /usr/include/pcap/bpf.h:1223
DLT_NETLINK : constant := 253; -- /usr/include/pcap/bpf.h:1228
DLT_BLUETOOTH_LINUX_MONITOR : constant := 254; -- /usr/include/pcap/bpf.h:1233
DLT_BLUETOOTH_BREDR_BB : constant := 255; -- /usr/include/pcap/bpf.h:1239
DLT_BLUETOOTH_LE_LL_WITH_PHDR : constant := 256; -- /usr/include/pcap/bpf.h:1244
DLT_PROFIBUS_DL : constant := 257; -- /usr/include/pcap/bpf.h:1249
DLT_PKTAP : constant := 258; -- /usr/include/pcap/bpf.h:1298
DLT_EPON : constant := 259; -- /usr/include/pcap/bpf.h:1306
DLT_IPMI_HPM_2 : constant := 260; -- /usr/include/pcap/bpf.h:1312
DLT_MATCHING_MAX : constant := 260; -- /usr/include/pcap/bpf.h:1314
-- arg-macro: function DLT_CLASS (x)
-- return (x) and 16#03ff0000#;
DLT_CLASS_NETBSD_RAWAF : constant := 16#02240000#; -- /usr/include/pcap/bpf.h:1330
-- arg-macro: function DLT_NETBSD_RAWAF (af)
-- return DLT_CLASS_NETBSD_RAWAF or (af);
-- arg-macro: function DLT_NETBSD_RAWAF_AF (x)
-- return (x) and 16#0000ffff#;
-- arg-macro: function DLT_IS_NETBSD_RAWAF (x)
-- return DLT_CLASS(x) = DLT_CLASS_NETBSD_RAWAF;
-- arg-macro: function BPF_CLASS (code)
-- return (code) and 16#07#;
BPF_LD : constant := 16#00#; -- /usr/include/pcap/bpf.h:1351
BPF_LDX : constant := 16#01#; -- /usr/include/pcap/bpf.h:1352
BPF_ST : constant := 16#02#; -- /usr/include/pcap/bpf.h:1353
BPF_STX : constant := 16#03#; -- /usr/include/pcap/bpf.h:1354
BPF_ALU : constant := 16#04#; -- /usr/include/pcap/bpf.h:1355
BPF_JMP : constant := 16#05#; -- /usr/include/pcap/bpf.h:1356
BPF_RET : constant := 16#06#; -- /usr/include/pcap/bpf.h:1357
BPF_MISC : constant := 16#07#; -- /usr/include/pcap/bpf.h:1358
-- arg-macro: function BPF_SIZE (code)
-- return (code) and 16#18#;
BPF_W : constant := 16#00#; -- /usr/include/pcap/bpf.h:1362
BPF_H : constant := 16#08#; -- /usr/include/pcap/bpf.h:1363
BPF_B : constant := 16#10#; -- /usr/include/pcap/bpf.h:1364
-- arg-macro: function BPF_MODE (code)
-- return (code) and 16#e0#;
BPF_IMM : constant := 16#00#; -- /usr/include/pcap/bpf.h:1367
BPF_ABS : constant := 16#20#; -- /usr/include/pcap/bpf.h:1368
BPF_IND : constant := 16#40#; -- /usr/include/pcap/bpf.h:1369
BPF_MEM : constant := 16#60#; -- /usr/include/pcap/bpf.h:1370
BPF_LEN : constant := 16#80#; -- /usr/include/pcap/bpf.h:1371
BPF_MSH : constant := 16#a0#; -- /usr/include/pcap/bpf.h:1372
-- arg-macro: function BPF_OP (code)
-- return (code) and 16#f0#;
BPF_ADD : constant := 16#00#; -- /usr/include/pcap/bpf.h:1378
BPF_SUB : constant := 16#10#; -- /usr/include/pcap/bpf.h:1379
BPF_MUL : constant := 16#20#; -- /usr/include/pcap/bpf.h:1380
BPF_DIV : constant := 16#30#; -- /usr/include/pcap/bpf.h:1381
BPF_OR : constant := 16#40#; -- /usr/include/pcap/bpf.h:1382
BPF_AND : constant := 16#50#; -- /usr/include/pcap/bpf.h:1383
BPF_LSH : constant := 16#60#; -- /usr/include/pcap/bpf.h:1384
BPF_RSH : constant := 16#70#; -- /usr/include/pcap/bpf.h:1385
BPF_NEG : constant := 16#80#; -- /usr/include/pcap/bpf.h:1386
BPF_MOD : constant := 16#90#; -- /usr/include/pcap/bpf.h:1387
BPF_XOR : constant := 16#a0#; -- /usr/include/pcap/bpf.h:1388
BPF_JA : constant := 16#00#; -- /usr/include/pcap/bpf.h:1395
BPF_JEQ : constant := 16#10#; -- /usr/include/pcap/bpf.h:1396
BPF_JGT : constant := 16#20#; -- /usr/include/pcap/bpf.h:1397
BPF_JGE : constant := 16#30#; -- /usr/include/pcap/bpf.h:1398
BPF_JSET : constant := 16#40#; -- /usr/include/pcap/bpf.h:1399
-- arg-macro: function BPF_SRC (code)
-- return (code) and 16#08#;
BPF_K : constant := 16#00#; -- /usr/include/pcap/bpf.h:1412
BPF_X : constant := 16#08#; -- /usr/include/pcap/bpf.h:1413
-- arg-macro: function BPF_RVAL (code)
-- return (code) and 16#18#;
BPF_A : constant := 16#10#; -- /usr/include/pcap/bpf.h:1417
-- arg-macro: function BPF_MISCOP (code)
-- return (code) and 16#f8#;
BPF_TAX : constant := 16#00#; -- /usr/include/pcap/bpf.h:1422
BPF_TXA : constant := 16#80#; -- /usr/include/pcap/bpf.h:1439
-- arg-macro: procedure BPF_STMT (code, k)
-- { (u_short)(code), 0, 0, k }
-- arg-macro: procedure BPF_JUMP (code, k, jt, jf)
-- { (u_short)(code), jt, jf, k }
BPF_MEMWORDS : constant := 16; -- /usr/include/pcap/bpf.h:1483
---
-- * Copyright (c) 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997
-- * The Regents of the University of California. All rights reserved.
-- *
-- * This code is derived from the Stanford/CMU enet packet filter,
-- * (net/enet.c) distributed as part of 4.3BSD, and code contributed
-- * to Berkeley by Steven McCanne and Van Jacobson both of Lawrence
-- * Berkeley Laboratory.
-- *
-- * 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. All advertising materials mentioning features or use of this software
-- * must display the following acknowledgement:
-- * This product includes software developed by the University of
-- * California, Berkeley and its contributors.
-- * 4. Neither the name of the University 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 REGENTS 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 REGENTS 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.
-- *
-- * @(#)bpf.h 7.1 (Berkeley) 5/7/91
--
-- * This is libpcap's cut-down version of bpf.h; it includes only
-- * the stuff needed for the code generator and the userland BPF
-- * interpreter, and the libpcap APIs for setting filters, etc..
-- *
-- * "pcap-bpf.c" will include the native OS version, as it deals with
-- * the OS's BPF implementation.
-- *
-- * At least two programs found by Google Code Search explicitly includes
-- * <pcap/bpf.h> (even though <pcap.h>/<pcap/pcap.h> includes it for you),
-- * so moving that stuff to <pcap/pcap.h> would break the build for some
-- * programs.
--
-- * If we've already included <net/bpf.h>, don't re-define this stuff.
-- * We assume BSD-style multiple-include protection in <net/bpf.h>,
-- * which is true of all but the oldest versions of FreeBSD and NetBSD,
-- * or Tru64 UNIX-style multiple-include protection (or, at least,
-- * Tru64 UNIX 5.x-style; I don't have earlier versions available to check),
-- * or AIX-style multiple-include protection (or, at least, AIX 5.x-style;
-- * I don't have earlier versions available to check).
-- *
-- * We do not check for BPF_MAJOR_VERSION, as that's defined by
-- * <linux/filter.h>, which is directly or indirectly included in some
-- * programs that also include pcap.h, and <linux/filter.h> doesn't
-- * define stuff we need.
-- *
-- * This also provides our own multiple-include protection.
--
-- BSD style release date
subtype bpf_int32 is int; -- /usr/include/pcap/bpf.h:85
subtype bpf_u_int32 is unsigned; -- /usr/include/pcap/bpf.h:86
-- * Alignment macros. BPF_WORDALIGN rounds up to the next
-- * even multiple of BPF_ALIGNMENT.
-- *
-- * Tcpdump's print-pflog.c uses this, so we define it here.
--
-- * Structure for "pcap_compile()", "pcap_setfilter()", etc..
--
type bpf_insn;
type bpf_program is record
bf_len : aliased unsigned; -- /usr/include/pcap/bpf.h:106
bf_insns : access bpf_insn; -- /usr/include/pcap/bpf.h:107
end record
with Convention => C_Pass_By_Copy; -- /usr/include/pcap/bpf.h:105
-- * Link-layer header type codes.
-- *
-- * Do *NOT* add new values to this list without asking
-- * "tcpdump-workers@lists.tcpdump.org" for a value. Otherwise, you run
-- * the risk of using a value that's already being used for some other
-- * purpose, and of having tools that read libpcap-format captures not
-- * being able to handle captures with your new DLT_ value, with no hope
-- * that they will ever be changed to do so (as that would destroy their
-- * ability to read captures using that value for that other purpose).
-- *
-- * See
-- *
-- * http://www.tcpdump.org/linktypes.html
-- *
-- * for detailed descriptions of some of these link-layer header types.
--
-- * These are the types that are the same on all platforms, and that
-- * have been defined by <net/bpf.h> for ages.
--
-- * These are types that are different on some platforms, and that
-- * have been defined by <net/bpf.h> for ages. We use #ifdefs to
-- * detect the BSDs that define them differently from the traditional
-- * libpcap <net/bpf.h>
-- *
-- * XXX - DLT_ATM_RFC1483 is 13 in BSD/OS, and DLT_RAW is 14 in BSD/OS,
-- * but I don't know what the right #define is for BSD/OS.
--
-- * Given that the only OS that currently generates BSD/OS SLIP or PPP
-- * is, well, BSD/OS, arguably everybody should have chosen its values
-- * for DLT_SLIP_BSDOS and DLT_PPP_BSDOS, which are 15 and 16, but they
-- * didn't. So it goes.
--
-- * 17 was used for DLT_PFLOG in OpenBSD; it no longer is.
-- *
-- * It was DLT_LANE8023 in SuSE 6.3, so we defined LINKTYPE_PFLOG
-- * as 117 so that pflog captures would use a link-layer header type
-- * value that didn't collide with any other values. On all
-- * platforms other than OpenBSD, we defined DLT_PFLOG as 117,
-- * and we mapped between LINKTYPE_PFLOG and DLT_PFLOG.
-- *
-- * OpenBSD eventually switched to using 117 for DLT_PFLOG as well.
-- *
-- * Don't use 17 for anything else.
--
-- * 18 is used for DLT_PFSYNC in OpenBSD, NetBSD, DragonFly BSD and
-- * Mac OS X; don't use it for anything else. (FreeBSD uses 121,
-- * which collides with DLT_HHDLC, even though it doesn't use 18
-- * for anything and doesn't appear to have ever used it for anything.)
-- *
-- * We define it as 18 on those platforms; it is, unfortunately, used
-- * for DLT_CIP in Suse 6.3, so we don't define it as DLT_PFSYNC
-- * in general. As the packet format for it, like that for
-- * DLT_PFLOG, is not only OS-dependent but OS-version-dependent,
-- * we don't support printing it in tcpdump except on OSes that
-- * have the relevant header files, so it's not that useful on
-- * other platforms.
--
-- * Apparently Redback uses this for its SmartEdge 400/800. I hope
-- * nobody else decided to use it, too.
--
-- * These values are defined by NetBSD; other platforms should refrain from
-- * using them for other purposes, so that NetBSD savefiles with link
-- * types of 50 or 51 can be read as this type on all platforms.
--
-- * The Axent Raptor firewall - now the Symantec Enterprise Firewall - uses
-- * a link-layer type of 99 for the tcpdump it supplies. The link-layer
-- * header has 6 bytes of unknown data, something that appears to be an
-- * Ethernet type, and 36 bytes that appear to be 0 in at least one capture
-- * I've seen.
--
-- * Values between 100 and 103 are used in capture file headers as
-- * link-layer header type LINKTYPE_ values corresponding to DLT_ types
-- * that differ between platforms; don't use those values for new DLT_
-- * new types.
--
-- * Values starting with 104 are used for newly-assigned link-layer
-- * header type values; for those link-layer header types, the DLT_
-- * value returned by pcap_datalink() and passed to pcap_open_dead(),
-- * and the LINKTYPE_ value that appears in capture files, are the
-- * same.
-- *
-- * DLT_MATCHING_MIN is the lowest such value; DLT_MATCHING_MAX is
-- * the highest such value.
--
-- * This value was defined by libpcap 0.5; platforms that have defined
-- * it with a different value should define it here with that value -
-- * a link type of 104 in a save file will be mapped to DLT_C_HDLC,
-- * whatever value that happens to be, so programs will correctly
-- * handle files with that link type regardless of the value of
-- * DLT_C_HDLC.
-- *
-- * The name DLT_C_HDLC was used by BSD/OS; we use that name for source
-- * compatibility with programs written for BSD/OS.
-- *
-- * libpcap 0.5 defined it as DLT_CHDLC; we define DLT_CHDLC as well,
-- * for source compatibility with programs written for libpcap 0.5.
--
-- * 106 is reserved for Linux Classical IP over ATM; it's like DLT_RAW,
-- * except when it isn't. (I.e., sometimes it's just raw IP, and
-- * sometimes it isn't.) We currently handle it as DLT_LINUX_SLL,
-- * so that we don't have to worry about the link-layer header.)
--
-- * Frame Relay; BSD/OS has a DLT_FR with a value of 11, but that collides
-- * with other values.
-- * DLT_FR and DLT_FRELAY packets start with the Q.922 Frame Relay header
-- * (DLCI, etc.).
--
-- * OpenBSD DLT_LOOP, for loopback devices; it's like DLT_NULL, except
-- * that the AF_ type in the link-layer header is in network byte order.
-- *
-- * DLT_LOOP is 12 in OpenBSD, but that's DLT_RAW in other OSes, so
-- * we don't use 12 for it in OSes other than OpenBSD.
--
-- * Encapsulated packets for IPsec; DLT_ENC is 13 in OpenBSD, but that's
-- * DLT_SLIP_BSDOS in NetBSD, so we don't use 13 for it in OSes other
-- * than OpenBSD.
--
-- * Values between 110 and 112 are reserved for use in capture file headers
-- * as link-layer types corresponding to DLT_ types that might differ
-- * between platforms; don't use those values for new DLT_ types
-- * other than the corresponding DLT_ types.
--
-- * This is for Linux cooked sockets.
--
-- * Apple LocalTalk hardware.
--
-- * Acorn Econet.
--
-- * Reserved for use with OpenBSD ipfilter.
--
-- * OpenBSD DLT_PFLOG.
--
-- * Registered for Cisco-internal use.
--
-- * For 802.11 cards using the Prism II chips, with a link-layer
-- * header including Prism monitor mode information plus an 802.11
-- * header.
--
-- * Reserved for Aironet 802.11 cards, with an Aironet link-layer header
-- * (see Doug Ambrisko's FreeBSD patches).
--
-- * Sigh.
-- *
-- * This was reserved for Siemens HiPath HDLC on 2002-01-25, as
-- * requested by Tomas Kukosa.
-- *
-- * On 2004-02-25, a FreeBSD checkin to sys/net/bpf.h was made that
-- * assigned 121 as DLT_PFSYNC. Its libpcap does DLT_ <-> LINKTYPE_
-- * mapping, so it probably supports capturing on the pfsync device
-- * but not saving the captured data to a pcap file.
-- *
-- * OpenBSD, from which pf came, however, uses 18 for DLT_PFSYNC;
-- * their libpcap does no DLT_ <-> LINKTYPE_ mapping, so it would
-- * use 18 in pcap files as well.
-- *
-- * NetBSD and DragonFly BSD also use 18 for DLT_PFSYNC; their
-- * libpcaps do DLT_ <-> LINKTYPE_ mapping, and neither has an entry
-- * for DLT_PFSYNC, so it might not be able to write out dump files
-- * with 18 as the link-layer header type. (Earlier versions might
-- * not have done mapping, in which case they'd work the same way
-- * OpenBSD does.)
-- *
-- * Mac OS X defines it as 18, but doesn't appear to use it as of
-- * Mac OS X 10.7.3. Its libpcap does DLT_ <-> LINKTYPE_ mapping.
-- *
-- * We'll define DLT_PFSYNC as 121 on FreeBSD and define it as 18 on
-- * all other platforms. We'll define DLT_HHDLC as 121 on everything
-- * except for FreeBSD; anybody who wants to compile, on FreeBSD, code
-- * that uses DLT_HHDLC is out of luck.
-- *
-- * We'll define LINKTYPE_PFSYNC as 18, *even on FreeBSD*, and map
-- * it, so that savefiles won't use 121 for PFSYNC - they'll all
-- * use 18. Code that uses pcap_datalink() to determine the link-layer
-- * header type of a savefile won't, when built and run on FreeBSD,
-- * be able to distinguish between LINKTYPE_PFSYNC and LINKTYPE_HHDLC
-- * capture files; code that doesn't, such as the code in Wireshark,
-- * will be able to distinguish between them.
--
-- * This is for RFC 2625 IP-over-Fibre Channel.
-- *
-- * This is not for use with raw Fibre Channel, where the link-layer
-- * header starts with a Fibre Channel frame header; it's for IP-over-FC,
-- * where the link-layer header starts with an RFC 2625 Network_Header
-- * field.
--
-- * This is for Full Frontal ATM on Solaris with SunATM, with a
-- * pseudo-header followed by an AALn PDU.
-- *
-- * There may be other forms of Full Frontal ATM on other OSes,
-- * with different pseudo-headers.
-- *
-- * If ATM software returns a pseudo-header with VPI/VCI information
-- * (and, ideally, packet type information, e.g. signalling, ILMI,
-- * LANE, LLC-multiplexed traffic, etc.), it should not use
-- * DLT_ATM_RFC1483, but should get a new DLT_ value, so tcpdump
-- * and the like don't have to infer the presence or absence of a
-- * pseudo-header and the form of the pseudo-header.
--
--
-- * Reserved as per request from Kent Dahlgren <kent@praesum.com>
-- * for private use.
--
-- * Header for 802.11 plus a number of bits of link-layer information
-- * including radio information, used by some recent BSD drivers as
-- * well as the madwifi Atheros driver for Linux.
--
-- * Reserved for the TZSP encapsulation, as per request from
-- * Chris Waters <chris.waters@networkchemistry.com>
-- * TZSP is a generic encapsulation for any other link type,
-- * which includes a means to include meta-information
-- * with the packet, e.g. signal strength and channel
-- * for 802.11 packets.
--
-- * BSD's ARCNET headers have the source host, destination host,
-- * and type at the beginning of the packet; that's what's handed
-- * up to userland via BPF.
-- *
-- * Linux's ARCNET headers, however, have a 2-byte offset field
-- * between the host IDs and the type; that's what's handed up
-- * to userland via PF_PACKET sockets.
-- *
-- * We therefore have to have separate DLT_ values for them.
--
-- * Juniper-private data link types, as per request from
-- * Hannes Gredler <hannes@juniper.net>. The DLT_s are used
-- * for passing on chassis-internal metainformation such as
-- * QOS profiles, etc..
--
-- * Apple IP-over-IEEE 1394, as per a request from Dieter Siegmund
-- * <dieter@apple.com>. The header that's presented is an Ethernet-like
-- * header:
-- *
-- * #define FIREWIRE_EUI64_LEN 8
-- * struct firewire_header {
-- * u_char firewire_dhost[FIREWIRE_EUI64_LEN];
-- * u_char firewire_shost[FIREWIRE_EUI64_LEN];
-- * u_short firewire_type;
-- * };
-- *
-- * with "firewire_type" being an Ethernet type value, rather than,
-- * for example, raw GASP frames being handed up.
--
-- * Various SS7 encapsulations, as per a request from Jeff Morriss
-- * <jeff.morriss[AT]ulticom.com> and subsequent discussions.
--
-- * DOCSIS MAC frames.
--
-- * Linux-IrDA packets. Protocol defined at http://www.irda.org.
-- * Those packets include IrLAP headers and above (IrLMP...), but
-- * don't include Phy framing (SOF/EOF/CRC & byte stuffing), because Phy
-- * framing can be handled by the hardware and depend on the bitrate.
-- * This is exactly the format you would get capturing on a Linux-IrDA
-- * interface (irdaX), but not on a raw serial port.
-- * Note the capture is done in "Linux-cooked" mode, so each packet include
-- * a fake packet header (struct sll_header). This is because IrDA packet
-- * decoding is dependant on the direction of the packet (incomming or
-- * outgoing).
-- * When/if other platform implement IrDA capture, we may revisit the
-- * issue and define a real DLT_IRDA...
-- * Jean II
--
-- * Reserved for IBM SP switch and IBM Next Federation switch.
--
-- * Reserved for private use. If you have some link-layer header type
-- * that you want to use within your organization, with the capture files
-- * using that link-layer header type not ever be sent outside your
-- * organization, you can use these values.
-- *
-- * No libpcap release will use these for any purpose, nor will any
-- * tcpdump release use them, either.
-- *
-- * Do *NOT* use these in capture files that you expect anybody not using
-- * your private versions of capture-file-reading tools to read; in
-- * particular, do *NOT* use them in products, otherwise you may find that
-- * people won't be able to use tcpdump, or snort, or Ethereal, or... to
-- * read capture files from your firewall/intrusion detection/traffic
-- * monitoring/etc. appliance, or whatever product uses that DLT_ value,
-- * and you may also find that the developers of those applications will
-- * not accept patches to let them read those files.
-- *
-- * Also, do not use them if somebody might send you a capture using them
-- * for *their* private type and tools using them for *your* private type
-- * would have to read them.
-- *
-- * Instead, ask "tcpdump-workers@lists.tcpdump.org" for a new DLT_ value,
-- * as per the comment above, and use the type you're given.
--
-- * For future use with 802.11 captures - defined by AbsoluteValue
-- * Systems to store a number of bits of link-layer information
-- * including radio information:
-- *
-- * http://www.shaftnet.org/~pizza/software/capturefrm.txt
-- *
-- * but it might be used by some non-AVS drivers now or in the
-- * future.
--
-- * Juniper-private data link type, as per request from
-- * Hannes Gredler <hannes@juniper.net>. The DLT_s are used
-- * for passing on chassis-internal metainformation such as
-- * QOS profiles, etc..
--
-- * BACnet MS/TP frames.
--
-- * Another PPP variant as per request from Karsten Keil <kkeil@suse.de>.
-- *
-- * This is used in some OSes to allow a kernel socket filter to distinguish
-- * between incoming and outgoing packets, on a socket intended to
-- * supply pppd with outgoing packets so it can do dial-on-demand and
-- * hangup-on-lack-of-demand; incoming packets are filtered out so they
-- * don't cause pppd to hold the connection up (you don't want random
-- * input packets such as port scans, packets from old lost connections,
-- * etc. to force the connection to stay up).
-- *
-- * The first byte of the PPP header (0xff03) is modified to accomodate
-- * the direction - 0x00 = IN, 0x01 = OUT.
--
-- * Names for backwards compatibility with older versions of some PPP
-- * software; new software should use DLT_PPP_PPPD.
--
-- * Juniper-private data link type, as per request from
-- * Hannes Gredler <hannes@juniper.net>. The DLT_s are used
-- * for passing on chassis-internal metainformation such as
-- * QOS profiles, cookies, etc..
--
-- * Requested by Oolan Zimmer <oz@gcom.com> for use in Gcom's T1/E1 line
-- * monitoring equipment.
--
-- * Juniper-private data link type, as per request from
-- * Hannes Gredler <hannes@juniper.net>. The DLT_ is used
-- * for internal communication to Physical Interface Cards (PIC)
--
-- * Link types requested by Gregor Maier <gregor@endace.com> of Endace
-- * Measurement Systems. They add an ERF header (see
-- * http://www.endace.com/support/EndaceRecordFormat.pdf) in front of
-- * the link-layer header.
--
-- * Requested by Daniele Orlandi <daniele@orlandi.com> for raw LAPD
-- * for vISDN (http://www.orlandi.com/visdn/). Its link-layer header
-- * includes additional information before the LAPD header, so it's
-- * not necessarily a generic LAPD header.
--
-- * Juniper-private data link type, as per request from
-- * Hannes Gredler <hannes@juniper.net>.
-- * The DLT_ are used for prepending meta-information
-- * like interface index, interface name
-- * before standard Ethernet, PPP, Frelay & C-HDLC Frames
--
-- * Multi Link Frame Relay (FRF.16)
--
-- * Juniper-private data link type, as per request from
-- * Hannes Gredler <hannes@juniper.net>.
-- * The DLT_ is used for internal communication with a
-- * voice Adapter Card (PIC)
--
-- * Arinc 429 frames.
-- * DLT_ requested by Gianluca Varenni <gianluca.varenni@cacetech.com>.
-- * Every frame contains a 32bit A429 label.
-- * More documentation on Arinc 429 can be found at
-- * http://www.condoreng.com/support/downloads/tutorials/ARINCTutorial.pdf
--
-- * Arinc 653 Interpartition Communication messages.
-- * DLT_ requested by Gianluca Varenni <gianluca.varenni@cacetech.com>.
-- * Please refer to the A653-1 standard for more information.
--
-- * USB packets, beginning with a USB setup header; requested by
-- * Paolo Abeni <paolo.abeni@email.it>.
--
-- * Bluetooth HCI UART transport layer (part H:4); requested by
-- * Paolo Abeni.
--
-- * IEEE 802.16 MAC Common Part Sublayer; requested by Maria Cruz
-- * <cruz_petagay@bah.com>.
--
-- * USB packets, beginning with a Linux USB header; requested by
-- * Paolo Abeni <paolo.abeni@email.it>.
--
-- * Controller Area Network (CAN) v. 2.0B packets.
-- * DLT_ requested by Gianluca Varenni <gianluca.varenni@cacetech.com>.
-- * Used to dump CAN packets coming from a CAN Vector board.
-- * More documentation on the CAN v2.0B frames can be found at
-- * http://www.can-cia.org/downloads/?269
--
-- * IEEE 802.15.4, with address fields padded, as is done by Linux
-- * drivers; requested by Juergen Schimmer.
--
-- * Per Packet Information encapsulated packets.
-- * DLT_ requested by Gianluca Varenni <gianluca.varenni@cacetech.com>.
--
-- * Header for 802.16 MAC Common Part Sublayer plus a radiotap radio header;
-- * requested by Charles Clancy.
--
-- * Juniper-private data link type, as per request from
-- * Hannes Gredler <hannes@juniper.net>.
-- * The DLT_ is used for internal communication with a
-- * integrated service module (ISM).
--
-- * IEEE 802.15.4, exactly as it appears in the spec (no padding, no
-- * nothing); requested by Mikko Saarnivala <mikko.saarnivala@sensinode.com>.
-- * For this one, we expect the FCS to be present at the end of the frame;
-- * if the frame has no FCS, DLT_IEEE802_15_4_NOFCS should be used.
--
-- * Various link-layer types, with a pseudo-header, for SITA
-- * (http://www.sita.aero/); requested by Fulko Hew (fulko.hew@gmail.com).
--
-- * Various link-layer types, with a pseudo-header, for Endace DAG cards;
-- * encapsulates Endace ERF records. Requested by Stephen Donnelly
-- * <stephen@endace.com>.
--
-- * Special header prepended to Ethernet packets when capturing from a
-- * u10 Networks board. Requested by Phil Mulholland
-- * <phil@u10networks.com>.
--
-- * IPMB packet for IPMI, beginning with the I2C slave address, followed
-- * by the netFn and LUN, etc.. Requested by Chanthy Toeung
-- * <chanthy.toeung@ca.kontron.com>.
--
-- * Juniper-private data link type, as per request from
-- * Hannes Gredler <hannes@juniper.net>.
-- * The DLT_ is used for capturing data on a secure tunnel interface.
--
-- * Bluetooth HCI UART transport layer (part H:4), with pseudo-header
-- * that includes direction information; requested by Paolo Abeni.
--
-- * AX.25 packet with a 1-byte KISS header; see
-- *
-- * http://www.ax25.net/kiss.htm
-- *
-- * as per Richard Stearn <richard@rns-stearn.demon.co.uk>.
--
-- * LAPD packets from an ISDN channel, starting with the address field,
-- * with no pseudo-header.
-- * Requested by Varuna De Silva <varunax@gmail.com>.
--
-- * Variants of various link-layer headers, with a one-byte direction
-- * pseudo-header prepended - zero means "received by this host",
-- * non-zero (any non-zero value) means "sent by this host" - as per
-- * Will Barker <w.barker@zen.co.uk>.
--
-- * 208 is reserved for an as-yet-unspecified proprietary link-layer
-- * type, as requested by Will Barker.
--
-- * IPMB with a Linux-specific pseudo-header; as requested by Alexey Neyman
-- * <avn@pigeonpoint.com>.
--
-- * FlexRay automotive bus - http://www.flexray.com/ - as requested
-- * by Hannes Kaelber <hannes.kaelber@x2e.de>.
--
-- * Media Oriented Systems Transport (MOST) bus for multimedia
-- * transport - http://www.mostcooperation.com/ - as requested
-- * by Hannes Kaelber <hannes.kaelber@x2e.de>.
--
-- * Local Interconnect Network (LIN) bus for vehicle networks -
-- * http://www.lin-subbus.org/ - as requested by Hannes Kaelber
-- * <hannes.kaelber@x2e.de>.
--
-- * X2E-private data link type used for serial line capture,
-- * as requested by Hannes Kaelber <hannes.kaelber@x2e.de>.
--
-- * X2E-private data link type used for the Xoraya data logger
-- * family, as requested by Hannes Kaelber <hannes.kaelber@x2e.de>.
--
-- * IEEE 802.15.4, exactly as it appears in the spec (no padding, no
-- * nothing), but with the PHY-level data for non-ASK PHYs (4 octets
-- * of 0 as preamble, one octet of SFD, one octet of frame length+
-- * reserved bit, and then the MAC-layer data, starting with the
-- * frame control field).
-- *
-- * Requested by Max Filippov <jcmvbkbc@gmail.com>.
--
--
-- * David Gibson <david@gibson.dropbear.id.au> requested this for
-- * captures from the Linux kernel /dev/input/eventN devices. This
-- * is used to communicate keystrokes and mouse movements from the
-- * Linux kernel to display systems, such as Xorg.
--
-- * GSM Um and Abis interfaces, preceded by a "gsmtap" header.
-- *
-- * Requested by Harald Welte <laforge@gnumonks.org>.
--
-- * MPLS, with an MPLS label as the link-layer header.
-- * Requested by Michele Marchetto <michele@openbsd.org> on behalf
-- * of OpenBSD.
--
-- * USB packets, beginning with a Linux USB header, with the USB header
-- * padded to 64 bytes; required for memory-mapped access.
--
-- * DECT packets, with a pseudo-header; requested by
-- * Matthias Wenzel <tcpdump@mazzoo.de>.
--
-- * From: "Lidwa, Eric (GSFC-582.0)[SGT INC]" <eric.lidwa-1@nasa.gov>
-- * Date: Mon, 11 May 2009 11:18:30 -0500
-- *
-- * DLT_AOS. We need it for AOS Space Data Link Protocol.
-- * I have already written dissectors for but need an OK from
-- * legal before I can submit a patch.
-- *
--
-- * Wireless HART (Highway Addressable Remote Transducer)
-- * From the HART Communication Foundation
-- * IES/PAS 62591
-- *
-- * Requested by Sam Roberts <vieuxtech@gmail.com>.
--
-- * Fibre Channel FC-2 frames, beginning with a Frame_Header.
-- * Requested by Kahou Lei <kahou82@gmail.com>.
--
-- * Fibre Channel FC-2 frames, beginning with an encoding of the
-- * SOF, and ending with an encoding of the EOF.
-- *
-- * The encodings represent the frame delimiters as 4-byte sequences
-- * representing the corresponding ordered sets, with K28.5
-- * represented as 0xBC, and the D symbols as the corresponding
-- * byte values; for example, SOFi2, which is K28.5 - D21.5 - D1.2 - D21.2,
-- * is represented as 0xBC 0xB5 0x55 0x55.
-- *
-- * Requested by Kahou Lei <kahou82@gmail.com>.
--
-- * Solaris ipnet pseudo-header; requested by Darren Reed <Darren.Reed@Sun.COM>.
-- *
-- * The pseudo-header starts with a one-byte version number; for version 2,
-- * the pseudo-header is:
-- *
-- * struct dl_ipnetinfo {
-- * u_int8_t dli_version;
-- * u_int8_t dli_family;
-- * u_int16_t dli_htype;
-- * u_int32_t dli_pktlen;
-- * u_int32_t dli_ifindex;
-- * u_int32_t dli_grifindex;
-- * u_int32_t dli_zsrc;
-- * u_int32_t dli_zdst;
-- * };
-- *
-- * dli_version is 2 for the current version of the pseudo-header.
-- *
-- * dli_family is a Solaris address family value, so it's 2 for IPv4
-- * and 26 for IPv6.
-- *
-- * dli_htype is a "hook type" - 0 for incoming packets, 1 for outgoing
-- * packets, and 2 for packets arriving from another zone on the same
-- * machine.
-- *
-- * dli_pktlen is the length of the packet data following the pseudo-header
-- * (so the captured length minus dli_pktlen is the length of the
-- * pseudo-header, assuming the entire pseudo-header was captured).
-- *
-- * dli_ifindex is the interface index of the interface on which the
-- * packet arrived.
-- *
-- * dli_grifindex is the group interface index number (for IPMP interfaces).
-- *
-- * dli_zsrc is the zone identifier for the source of the packet.
-- *
-- * dli_zdst is the zone identifier for the destination of the packet.
-- *
-- * A zone number of 0 is the global zone; a zone number of 0xffffffff
-- * means that the packet arrived from another host on the network, not
-- * from another zone on the same machine.
-- *
-- * An IPv4 or IPv6 datagram follows the pseudo-header; dli_family indicates
-- * which of those it is.
--
-- * CAN (Controller Area Network) frames, with a pseudo-header as supplied
-- * by Linux SocketCAN. See Documentation/networking/can.txt in the Linux
-- * source.
-- *
-- * Requested by Felix Obenhuber <felix@obenhuber.de>.
--
-- * Raw IPv4/IPv6; different from DLT_RAW in that the DLT_ value specifies
-- * whether it's v4 or v6. Requested by Darren Reed <Darren.Reed@Sun.COM>.
--
-- * IEEE 802.15.4, exactly as it appears in the spec (no padding, no
-- * nothing), and with no FCS at the end of the frame; requested by
-- * Jon Smirl <jonsmirl@gmail.com>.
--
-- * Raw D-Bus:
-- *
-- * http://www.freedesktop.org/wiki/Software/dbus
-- *
-- * messages:
-- *
-- * http://dbus.freedesktop.org/doc/dbus-specification.html#message-protocol-messages
-- *
-- * starting with the endianness flag, followed by the message type, etc.,
-- * but without the authentication handshake before the message sequence:
-- *
-- * http://dbus.freedesktop.org/doc/dbus-specification.html#auth-protocol
-- *
-- * Requested by Martin Vidner <martin@vidner.net>.
--
-- * Juniper-private data link type, as per request from
-- * Hannes Gredler <hannes@juniper.net>.
--
-- * DVB-CI (DVB Common Interface for communication between a PC Card
-- * module and a DVB receiver). See
-- *
-- * http://www.kaiser.cx/pcap-dvbci.html
-- *
-- * for the specification.
-- *
-- * Requested by Martin Kaiser <martin@kaiser.cx>.
--
-- * Variant of 3GPP TS 27.010 multiplexing protocol (similar to, but
-- * *not* the same as, 27.010). Requested by Hans-Christoph Schemmel
-- * <hans-christoph.schemmel@cinterion.com>.
--
-- * STANAG 5066 D_PDUs. Requested by M. Baris Demiray
-- * <barisdemiray@gmail.com>.
--
-- * Juniper-private data link type, as per request from
-- * Hannes Gredler <hannes@juniper.net>.
--
-- * NetFilter LOG messages
-- * (payload of netlink NFNL_SUBSYS_ULOG/NFULNL_MSG_PACKET packets)
-- *
-- * Requested by Jakub Zawadzki <darkjames-ws@darkjames.pl>
--
-- * Hilscher Gesellschaft fuer Systemautomation mbH link-layer type
-- * for Ethernet packets with a 4-byte pseudo-header and always
-- * with the payload including the FCS, as supplied by their
-- * netANALYZER hardware and software.
-- *
-- * Requested by Holger P. Frommer <HPfrommer@hilscher.com>
--
-- * Hilscher Gesellschaft fuer Systemautomation mbH link-layer type
-- * for Ethernet packets with a 4-byte pseudo-header and FCS and
-- * with the Ethernet header preceded by 7 bytes of preamble and
-- * 1 byte of SFD, as supplied by their netANALYZER hardware and
-- * software.
-- *
-- * Requested by Holger P. Frommer <HPfrommer@hilscher.com>
--
-- * IP-over-InfiniBand, as specified by RFC 4391.
-- *
-- * Requested by Petr Sumbera <petr.sumbera@oracle.com>.
--
-- * MPEG-2 transport stream (ISO 13818-1/ITU-T H.222.0).
-- *
-- * Requested by Guy Martin <gmsoft@tuxicoman.be>.
--
-- * ng4T GmbH's UMTS Iub/Iur-over-ATM and Iub/Iur-over-IP format as
-- * used by their ng40 protocol tester.
-- *
-- * Requested by Jens Grimmer <jens.grimmer@ng4t.com>.
--
-- * Pseudo-header giving adapter number and flags, followed by an NFC
-- * (Near-Field Communications) Logical Link Control Protocol (LLCP) PDU,
-- * as specified by NFC Forum Logical Link Control Protocol Technical
-- * Specification LLCP 1.1.
-- *
-- * Requested by Mike Wakerly <mikey@google.com>.
--
-- * 245 is used as LINKTYPE_PFSYNC; do not use it for any other purpose.
-- *
-- * DLT_PFSYNC has different values on different platforms, and all of
-- * them collide with something used elsewhere. On platforms that
-- * don't already define it, define it as 245.
--
-- * Raw InfiniBand packets, starting with the Local Routing Header.
-- *
-- * Requested by Oren Kladnitsky <orenk@mellanox.com>.
--
-- * SCTP, with no lower-level protocols (i.e., no IPv4 or IPv6).
-- *
-- * Requested by Michael Tuexen <Michael.Tuexen@lurchi.franken.de>.
--
-- * USB packets, beginning with a USBPcap header.
-- *
-- * Requested by Tomasz Mon <desowin@gmail.com>
--
-- * Schweitzer Engineering Laboratories "RTAC" product serial-line
-- * packets.
-- *
-- * Requested by Chris Bontje <chris_bontje@selinc.com>.
--
-- * Bluetooth Low Energy air interface link-layer packets.
-- *
-- * Requested by Mike Kershaw <dragorn@kismetwireless.net>.
--
-- * DLT type for upper-protocol layer PDU saves from wireshark.
-- *
-- * the actual contents are determined by two TAGs stored with each
-- * packet:
-- * EXP_PDU_TAG_LINKTYPE the link type (LINKTYPE_ value) of the
-- * original packet.
-- *
-- * EXP_PDU_TAG_PROTO_NAME the name of the wireshark dissector
-- * that can make sense of the data stored.
--
-- * DLT type for the netlink protocol (nlmon devices).
--
-- * Bluetooth Linux Monitor headers for the BlueZ stack.
--
-- * Bluetooth Basic Rate/Enhanced Data Rate baseband packets, as
-- * captured by Ubertooth.
--
-- * Bluetooth Low Energy link layer packets, as captured by Ubertooth.
--
-- * PROFIBUS data link layer.
--
-- * Apple's DLT_PKTAP headers.
-- *
-- * Sadly, the folks at Apple either had no clue that the DLT_USERn values
-- * are for internal use within an organization and partners only, and
-- * didn't know that the right way to get a link-layer header type is to
-- * ask tcpdump.org for one, or knew and didn't care, so they just
-- * used DLT_USER2, which causes problems for everything except for
-- * their version of tcpdump.
-- *
-- * So I'll just give them one; hopefully this will show up in a
-- * libpcap release in time for them to get this into 10.10 Big Sur
-- * or whatever Mavericks' successor is called. LINKTYPE_PKTAP
-- * will be 258 *even on OS X*; that is *intentional*, so that
-- * PKTAP files look the same on *all* OSes (different OSes can have
-- * different numerical values for a given DLT_, but *MUST NOT* have
-- * different values for what goes in a file, as files can be moved
-- * between OSes!).
-- *
-- * When capturing, on a system with a Darwin-based OS, on a device
-- * that returns 149 (DLT_USER2 and Apple's DLT_PKTAP) with this
-- * version of libpcap, the DLT_ value for the pcap_t will be DLT_PKTAP,
-- * and that will continue to be DLT_USER2 on Darwin-based OSes. That way,
-- * binary compatibility with Mavericks is preserved for programs using
-- * this version of libpcap. This does mean that if you were using
-- * DLT_USER2 for some capture device on OS X, you can't do so with
-- * this version of libpcap, just as you can't with Apple's libpcap -
-- * on OS X, they define DLT_PKTAP to be DLT_USER2, so programs won't
-- * be able to distinguish between PKTAP and whatever you were using
-- * DLT_USER2 for.
-- *
-- * If the program saves the capture to a file using this version of
-- * libpcap's pcap_dump code, the LINKTYPE_ value in the file will be
-- * LINKTYPE_PKTAP, which will be 258, even on Darwin-based OSes.
-- * That way, the file will *not* be a DLT_USER2 file. That means
-- * that the latest version of tcpdump, when built with this version
-- * of libpcap, and sufficiently recent versions of Wireshark will
-- * be able to read those files and interpret them correctly; however,
-- * Apple's version of tcpdump in OS X 10.9 won't be able to handle
-- * them. (Hopefully, Apple will pick up this version of libpcap,
-- * and the corresponding version of tcpdump, so that tcpdump will
-- * be able to handle the old LINKTYPE_USER2 captures *and* the new
-- * LINKTYPE_PKTAP captures.)
--
-- * Ethernet packets preceded by a header giving the last 6 octets
-- * of the preamble specified by 802.3-2012 Clause 65, section
-- * 65.1.3.2 "Transmit".
--
-- * IPMI trace packets, as specified by Table 3-20 "Trace Data Block Format"
-- * in the PICMG HPM.2 specification.
--
-- * DLT and savefile link type values are split into a class and
-- * a member of that class. A class value of 0 indicates a regular
-- * DLT_/LINKTYPE_ value.
--
-- * NetBSD-specific generic "raw" link type. The class value indicates
-- * that this is the generic raw type, and the lower 16 bits are the
-- * address family we're dealing with. Those values are NetBSD-specific;
-- * do not assume that they correspond to AF_ values for your operating
-- * system.
--
-- * The instruction encodings.
-- *
-- * Please inform tcpdump-workers@lists.tcpdump.org if you use any
-- * of the reserved values, so that we can note that they're used
-- * (and perhaps implement it in the reference BPF implementation
-- * and encourage its implementation elsewhere).
--
-- * The upper 8 bits of the opcode aren't used. BSD/OS used 0x8000.
--
-- instruction classes
-- ld/ldx fields
-- 0x18 reserved; used by BSD/OS
-- 0xc0 reserved; used by BSD/OS
-- 0xe0 reserved; used by BSD/OS
-- alu/jmp fields
-- 0xb0 reserved
-- 0xc0 reserved
-- 0xd0 reserved
-- 0xe0 reserved
-- 0xf0 reserved
-- 0x50 reserved; used on BSD/OS
-- 0x60 reserved
-- 0x70 reserved
-- 0x80 reserved
-- 0x90 reserved
-- 0xa0 reserved
-- 0xb0 reserved
-- 0xc0 reserved
-- 0xd0 reserved
-- 0xe0 reserved
-- 0xf0 reserved
-- ret - BPF_K and BPF_X also apply
-- 0x18 reserved
-- misc
-- 0x08 reserved
-- 0x10 reserved
-- 0x18 reserved
-- #define BPF_COP 0x20 NetBSD "coprocessor" extensions
-- 0x28 reserved
-- 0x30 reserved
-- 0x38 reserved
-- #define BPF_COPX 0x40 NetBSD "coprocessor" extensions
-- also used on BSD/OS
-- 0x48 reserved
-- 0x50 reserved
-- 0x58 reserved
-- 0x60 reserved
-- 0x68 reserved
-- 0x70 reserved
-- 0x78 reserved
-- 0x88 reserved
-- 0x90 reserved
-- 0x98 reserved
-- 0xa0 reserved
-- 0xa8 reserved
-- 0xb0 reserved
-- 0xb8 reserved
-- 0xc0 reserved; used on BSD/OS
-- 0xc8 reserved
-- 0xd0 reserved
-- 0xd8 reserved
-- 0xe0 reserved
-- 0xe8 reserved
-- 0xf0 reserved
-- 0xf8 reserved
-- * The instruction data structure.
--
type bpf_insn is record
code : aliased unsigned_short; -- /usr/include/pcap/bpf.h:1460
jt : aliased unsigned_char; -- /usr/include/pcap/bpf.h:1461
jf : aliased unsigned_char; -- /usr/include/pcap/bpf.h:1462
k : aliased bpf_u_int32; -- /usr/include/pcap/bpf.h:1463
end record
with Convention => C_Pass_By_Copy; -- /usr/include/pcap/bpf.h:1459
-- * Macros for insn array initializers.
--
-- * Number of scratch memory words (for BPF_LD|BPF_MEM and BPF_ST).
--
end PCAP.Low_Level.pcap_bpf_h;
-- end read only
|
-- This file is generated by SWIG. Please do *not* modify by hand.
--
with gmp_c.a_a_mpq_struct;
with Interfaces.C;
package gmp_c.mpq_srcptr is
-- Item
--
subtype Item is gmp_c.a_a_mpq_struct.Pointer;
-- Items
--
type Items is
array (Interfaces.C.size_t range <>) of aliased gmp_c.mpq_srcptr.Item;
-- Pointer
--
type Pointer is access all gmp_c.mpq_srcptr.Item;
-- Pointers
--
type Pointers is
array (Interfaces.C.size_t range <>) of aliased gmp_c.mpq_srcptr.Pointer;
-- Pointer_Pointer
--
type Pointer_Pointer is access all gmp_c.mpq_srcptr.Pointer;
end gmp_c.mpq_srcptr;
|
-- CD1C04E.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 RECORD REPRESENTATION CLAUSE CAN BE GIVEN FOR
-- A DERIVED RECORD TYPE EVEN IF THE REPRESENTATION IS INHERITED
-- FROM THE PARENT, AND THAT THE REPRESENTATION CLAUSE FOR THE
-- DERIVED TYPE OVERRIDES THAT OF THE PARENT TYPE.
-- HISTORY:
-- PWB 03/25/89 DELETED CHECKS OF COMPONENT'SIZE; CHANGED
-- EXTENSION FROM '.ADA' TO '.DEP'.
-- JET 09/21/87 CREATED ORIGINAL TEST.
WITH REPORT; USE REPORT;
WITH SYSTEM; USE SYSTEM;
PROCEDURE CD1C04E IS
UNITS_PER_INTEGER : CONSTANT :=
(INTEGER'SIZE + SYSTEM.STORAGE_UNIT - 1) /
SYSTEM.STORAGE_UNIT;
TYPE E_TYPE IS (RED, BLUE, GREEN);
TYPE PARENT_TYPE IS
RECORD
I : INTEGER RANGE 0 .. 127 := 127;
C : CHARACTER := 'S';
B : BOOLEAN := FALSE;
E : E_TYPE := BLUE;
END RECORD;
FOR PARENT_TYPE USE
RECORD
C AT 0 * UNITS_PER_INTEGER RANGE 0 .. CHARACTER'SIZE - 1;
B AT 1 * UNITS_PER_INTEGER RANGE 0 .. BOOLEAN'SIZE - 1;
I AT 2 * UNITS_PER_INTEGER RANGE 0 .. INTEGER'SIZE/2 - 1;
E AT 3 * UNITS_PER_INTEGER RANGE 0 .. CHARACTER'SIZE - 1;
END RECORD;
TYPE DERIVED_TYPE IS NEW PARENT_TYPE;
FOR DERIVED_TYPE USE
RECORD
C AT 1 * UNITS_PER_INTEGER RANGE 1 .. CHARACTER'SIZE + 1;
B AT 3 * UNITS_PER_INTEGER RANGE 1 .. BOOLEAN'SIZE + 1;
I AT 5 * UNITS_PER_INTEGER RANGE 1 .. INTEGER'SIZE/2 + 1;
E AT 7 * UNITS_PER_INTEGER RANGE 1 .. CHARACTER'SIZE + 1;
END RECORD;
P_REC : PARENT_TYPE;
REC : DERIVED_TYPE;
BEGIN
TEST("CD1C04E", "CHECK THAT A RECORD REPRESENTATION CLAUSE " &
"CAN BE GIVEN FOR A DERIVED RECORD TYPE EVEN " &
"IF THE REPRESENTATION IS INHERITED FROM " &
"THE PARENT, AND THAT THE REPRESENTATION " &
"CLAUSE FOR THE DERIVED TYPE OVERRIDES THAT " &
"OF THE PARENT TYPE");
IF DERIVED_TYPE'SIZE = IDENT_INT (PARENT_TYPE'SIZE) THEN
FAILED ("DERIVED_TYPE'SIZE WAS INHERITED FROM " &
"PARENT_TYPE");
END IF;
REC := (12, 'T', TRUE, RED);
IF (REC.I /= 12) OR (REC.C /= 'T') OR
(NOT REC.B) OR (REC.E /= RED) THEN
FAILED ("THE VALUES OF DERIVED_TYPE COMPONENTS WERE " &
"INCORRECT");
END IF;
IF REC.I'POSITION = P_REC.I'POSITION OR
REC.C'POSITION = P_REC.C'POSITION OR
REC.B'POSITION = P_REC.B'POSITION OR
REC.E'POSITION = P_REC.E'POSITION THEN
FAILED ("THE POSITIONS OF DERIVED_TYPE COMPONENTS WERE " &
"INHERITED FROM PARENT_TYPE");
END IF;
IF REC.I'FIRST_BIT = P_REC.I'FIRST_BIT OR
REC.C'FIRST_BIT = P_REC.C'FIRST_BIT OR
REC.B'FIRST_BIT = P_REC.B'FIRST_BIT OR
REC.E'FIRST_BIT = P_REC.E'FIRST_BIT THEN
FAILED ("THE FIRST_BITS OF DERIVED_TYPE COMPONENTS WERE " &
"INHERITED FROM PARENT_TYPE");
END IF;
IF REC.I'LAST_BIT = P_REC.I'LAST_BIT OR
REC.C'LAST_BIT = P_REC.C'LAST_BIT OR
REC.B'LAST_BIT = P_REC.B'LAST_BIT OR
REC.E'LAST_BIT = P_REC.E'LAST_BIT THEN
FAILED ("THE LAST_BITS OF DERIVED_TYPE COMPONENTS WERE " &
"INHERITED FROM PARENT_TYPE");
END IF;
RESULT;
END CD1C04E;
|
private package GID.Decoding_BMP is
--------------------
-- Image decoding --
--------------------
generic
type Primary_color_range is mod <>;
with procedure Set_X_Y (x, y: Natural);
with procedure Put_Pixel (
red, green, blue : Primary_color_range;
alpha : Primary_color_range
);
with procedure Feedback (percents: Natural);
--
procedure Load (image: in out Image_descriptor);
end GID.Decoding_BMP;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 3 5 --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Handling of packed arrays with Component_Size = 35
package System.Pack_35 is
pragma Preelaborate;
Bits : constant := 35;
type Bits_35 is mod 2 ** Bits;
for Bits_35'Size use Bits;
-- In all subprograms below, Rev_SSO is set True if the array has the
-- non-default scalar storage order.
function Get_35
(Arr : System.Address;
N : Natural;
Rev_SSO : Boolean) return Bits_35 with Inline;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned.
procedure Set_35
(Arr : System.Address;
N : Natural;
E : Bits_35;
Rev_SSO : Boolean) with Inline;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is set to the given value.
end System.Pack_35;
|
with Ada.Containers;
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with Ada.Text_IO; use Ada.Text_IO;
with Parsing; use Parsing.Operators;
procedure Simple is
use type Ada.Containers.Count_Type;
use type Parsing.Holder;
-- Input : constant String := "ABZ";
-- Input : constant String := "ACZ";
-- Input : constant String := "QBZ";
-- Input : constant String := "AQZ";
-- Input : constant String := "aCZ";
-- Input : constant String := "1ABZ";
-- Input : constant String := "9ABZ";
Input : constant String := "|ABZ";
-- Parse_A : aliased Parsing.Parse_Character (Match => 'A');
-- Parse_B : aliased Parsing.Parse_Character (Match => 'B');
-- Parse_C : aliased Parsing.Parse_Character (Match => 'C');
Parse_A : Parsing.Holder := Parsing.Character_Parser (Match => 'A');
Parse_B : Parsing.Holder := Parsing.Character_Parser (Match => 'B');
Parse_C : Parsing.Holder := Parsing.Character_Parser (Match => 'C');
Parse_B_Or_Else_C : Parsing.Holder := Parsing.To_Holder (Parse_B or Parse_C);
Parse_A_And_Then_B_Or_C : Parsing.Parse_And_Then := (Parse_A and Parse_B_Or_Else_C);
Parse_Lowercase : Parsing.Parse_Character_Range := Parsing.Parse_Character_Range'(Match_From => 'a', Match_To => 'z');
Parse_Digits : Parsing.Parse_Character_Range := Parsing.Parse_Character_Range'(Match_From => '0', Match_To => '9');
-- Result : Parsing.Result'Class := Parse_A_And_Then_B_Or_C.Parse (Input);
-- Result : Parsing.Result'Class := Parse_Lowercase.Parse (Input);
Result : Parsing.Result'Class := Parse_Digits.Parse (Input);
procedure Print_Result (R : Parsing.Result'Class) is
First : Boolean := True;
begin
if R in Parsing.Success'Class then
Put ("Success (");
for I of Parsing.Success (R).Matched loop
if I.Length = 1 then
Put ("'" & I.First_Element & "'");
else
Put ("(");
for C of I loop
if First then
Put ("'" & C & "'");
First := not First;
else
Put (", '" & C & "'");
end if;
end loop;
Put (")");
end if;
-- Parsing.Single (Parsing.Success (R).Matched.First_Element).A
end loop;
Put_Line (", """ & To_String (Parsing.Success (R).Remaining) & """)");
elsif R in Parsing.Failure'Class then
Put_Line ("Failure " & To_String (Parsing.Failure (R).Message));
end if;
end Print_Result;
begin
Print_Result (Result);
end Simple;
|
with Asis.Implementation;
procedure Main is
begin
Asis.Implementation.Initialize ("");
end; |
with Ada.Integer_Text_IO, Ada.Text_IO;
procedure Introspection is
use Ada.Integer_Text_IO, Ada.Text_IO;
begin
Put ("Integer range: ");
Put (Integer'First);
Put (" .. ");
Put (Integer'Last);
New_Line;
Put ("Float digits: ");
Put (Float'Digits);
New_Line;
end Introspection;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . S T R I N G S . W I D E _ B O U N D E D --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2021, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
package body Ada.Strings.Wide_Bounded is
package body Generic_Bounded_Length is
---------
-- "*" --
---------
function "*"
(Left : Natural;
Right : Wide_Character) return Bounded_Wide_String
is
begin
return Times (Left, Right, Max_Length);
end "*";
function "*"
(Left : Natural;
Right : Wide_String) return Bounded_Wide_String
is
begin
return Times (Left, Right, Max_Length);
end "*";
---------------
-- Replicate --
---------------
function Replicate
(Count : Natural;
Item : Wide_Character;
Drop : Strings.Truncation := Strings.Error)
return Bounded_Wide_String
is
begin
return Super_Replicate (Count, Item, Drop, Max_Length);
end Replicate;
function Replicate
(Count : Natural;
Item : Wide_String;
Drop : Strings.Truncation := Strings.Error)
return Bounded_Wide_String
is
begin
return Super_Replicate (Count, Item, Drop, Max_Length);
end Replicate;
----------------------------
-- To_Bounded_Wide_String --
----------------------------
function To_Bounded_Wide_String
(Source : Wide_String;
Drop : Strings.Truncation := Strings.Error)
return Bounded_Wide_String
is
begin
return To_Super_String (Source, Max_Length, Drop);
end To_Bounded_Wide_String;
end Generic_Bounded_Length;
end Ada.Strings.Wide_Bounded;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . I N T E R R U P T _ M A N A G E M E N T --
-- --
-- B o d y --
-- --
-- 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 is the VxWorks version of this package
-- It is simpler than other versions because the Ada interrupt handling
-- mechanisms are used for hardware interrupts rather than signals.
package body System.Interrupt_Management is
use System.OS_Interface;
-----------------------
-- Local Subprograms --
-----------------------
function State (Int : Interrupt_ID) return Character;
pragma Import (C, State, "__gnat_get_interrupt_state");
-- Get interrupt state. Defined in init.c The input argument is the
-- hardware interrupt number, and the result is one of the following:
Runtime : constant Character := 'r';
Default : constant Character := 's';
-- 'n' this interrupt not set by any Interrupt_State pragma
-- 'u' Interrupt_State pragma set state to User
-- 'r' Interrupt_State pragma set state to Runtime
-- 's' Interrupt_State pragma set state to System (use "default"
-- system handler)
----------------
-- Initialize --
----------------
Initialized : Boolean := False;
-- Set to True once Initialize is called, further calls have no effect
procedure Initialize is
begin
if Initialized then
return;
end if;
Initialized := True;
-- Change this if you want to use another signal for task abort.
-- SIGTERM might be a good one.
Abort_Task_Interrupt := SIGABRT;
-- Initialize hardware interrupt handling
pragma Assert (Reserve = (Interrupt_ID'Range => False));
-- Check all interrupts for state that requires keeping them reserved
for J in Interrupt_ID'Range loop
if State (J) = Default or else State (J) = Runtime then
Reserve (J) := True;
end if;
end loop;
end Initialize;
end System.Interrupt_Management;
|
-- 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 = "Shodan"
type = "api"
function start()
setratelimit(2)
end
function check()
local c
local cfg = datasrc_config()
if cfg ~= nil then
c = cfg.credentials
end
if (c ~= nil and c.key ~= nil and c.key ~= "") then
return true
end
return false
end
function vertical(ctx, domain)
local c
local cfg = datasrc_config()
if cfg ~= nil then
c = cfg.credentials
end
if (c == nil or c.key == nil or c.key == "") then
return
end
local resp
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.subdomains) == 0) then
return
end
for i, sub in pairs(d.subdomains) do
sendnames(ctx, sub .. "." .. domain)
end
end
function buildurl(domain, key)
return "https://api.shodan.io/dns/domain/" .. domain .. "?key=" .. 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
|
-----------------------------------------------------------------------
-- asf-factory -- Component and tag factory
-- Copyright (C) 2009, 2010, 2011, 2012, 2013 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Log.Loggers;
with Ada.Strings.Hash;
package body ASF.Factory is
-- The logger
Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("ASF.Factory");
-- ------------------------------
-- Compute a hash for the tag name.
-- ------------------------------
function Hash (Key : in Tag_Name) return Ada.Containers.Hash_Type is
use type Ada.Containers.Hash_Type;
H1 : constant Ada.Containers.Hash_Type := Ada.Strings.Hash (Key.URI.all);
H2 : constant Ada.Containers.Hash_Type := Ada.Strings.Hash (Key.Name.all);
begin
return H1 xor H2;
end Hash;
-- ------------------------------
-- Returns true if both tag names are identical.
-- ------------------------------
function "=" (Left, Right : in Tag_Name) return Boolean is
begin
return Left.URI.all = Right.URI.all and Left.Name.all = Right.Name.all;
end "=";
-- ------------------------------
-- Find the create function in bound to the name in the given URI namespace.
-- Returns null if no such binding exist.
-- ------------------------------
function Find (Factory : in Component_Factory;
URI : in String;
Name : in String) return Binding_Type is
Key : constant Tag_Name := Tag_Name '(URI => URI'Unrestricted_Access,
Name => Name'Unrestricted_Access);
Pos : constant Factory_Maps.Cursor := Factory.Map.Find (Key);
begin
if Factory_Maps.Has_Element (Pos) then
return Factory_Maps.Element (Pos);
else
return Null_Binding;
end if;
end Find;
-- ------------------------------
-- Register a binding library in the factory
-- ------------------------------
procedure Register (Factory : in out Component_Factory;
Bindings : in Factory_Bindings_Access) is
begin
Log.Info ("Register bindings: {0}", Bindings.URI.all);
for I in Bindings.Bindings'Range loop
declare
Key : constant Tag_Name := Tag_Name '(URI => Bindings.URI,
Name => Bindings.Bindings (I).Name);
begin
Factory.Map.Include (Key, Bindings.Bindings (I));
end;
end loop;
end Register;
procedure Register (Factory : in out Component_Factory;
URI : in ASF.Views.Nodes.Name_Access;
Name : in ASF.Views.Nodes.Name_Access;
Tag : in ASF.Views.Nodes.Tag_Node_Create_Access;
Create : in ASF.Views.Nodes.Create_Access) is
Key : constant Tag_Name := Tag_Name '(URI => URI, Name => Name);
Bind : constant Binding_Type := Binding_Type '(Name => Name,
Tag => Tag,
Component => Create);
begin
Factory.Map.Include (Key, Bind);
end Register;
-- ------------------------------
-- Register the converter instance under the given name.
-- ------------------------------
procedure Register (Factory : in out Component_Factory;
Name : in String;
Converter : in ASF.Converters.Converter_Access) is
begin
Log.Info ("Register converter: {0}", Name);
Factory.Converters.Include (EL.Objects.To_Object (Name), Converter);
end Register;
-- ------------------------------
-- Find the converter instance that was registered under the given name.
-- Returns null if no such converter exist.
-- ------------------------------
function Find (Factory : in Component_Factory;
Name : in EL.Objects.Object) return ASF.Converters.Converter_Access is
Pos : constant Converter_Maps.Cursor := Factory.Converters.Find (Name);
begin
if Converter_Maps.Has_Element (Pos) then
return Converter_Maps.Element (Pos);
else
return null;
end if;
end Find;
-- ------------------------------
-- Register the validator instance under the given name.
-- ------------------------------
procedure Register (Factory : in out Component_Factory;
Name : in String;
Validator : in ASF.Validators.Validator_Access) is
begin
Log.Info ("Register validator: {0}", Name);
Factory.Validators.Include (EL.Objects.To_Object (Name), Validator);
end Register;
-- ------------------------------
-- Find the validator instance that was registered under the given name.
-- Returns null if no such validator exist.
-- ------------------------------
function Find (Factory : in Component_Factory;
Name : in EL.Objects.Object) return ASF.Validators.Validator_Access is
Pos : constant Validator_Maps.Cursor := Factory.Validators.Find (Name);
begin
if Validator_Maps.Has_Element (Pos) then
return Validator_Maps.Element (Pos);
else
return null;
end if;
end Find;
end ASF.Factory;
|
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Program.Elements.Expressions;
with Program.Lexical_Elements;
package Program.Elements.Indexed_Components is
pragma Pure (Program.Elements.Indexed_Components);
type Indexed_Component is
limited interface and Program.Elements.Expressions.Expression;
type Indexed_Component_Access is access all Indexed_Component'Class
with Storage_Size => 0;
not overriding function Prefix
(Self : Indexed_Component)
return not null Program.Elements.Expressions.Expression_Access
is abstract;
not overriding function Expressions
(Self : Indexed_Component)
return Program.Elements.Expressions.Expression_Vector_Access is abstract;
type Indexed_Component_Text is limited interface;
type Indexed_Component_Text_Access is
access all Indexed_Component_Text'Class with Storage_Size => 0;
not overriding function To_Indexed_Component_Text
(Self : aliased in out Indexed_Component)
return Indexed_Component_Text_Access is abstract;
not overriding function Left_Bracket_Token
(Self : Indexed_Component_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function Right_Bracket_Token
(Self : Indexed_Component_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
end Program.Elements.Indexed_Components;
|
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Strings.Fixed;
package body Aids.Env is
Function Find(Env : in Typ;
Key : in String;
Found : in out Boolean
) return String is
Begin
Found := Env.Contains( Key );
Return (if not Found then "" else Env(Key));
End Find;
function Index_Of(Line: in String; X: in Character; Result: out Integer) return Boolean is
Index : Natural renames Ada.strings.Fixed.Index(
Source => Line, -- The String we're searching,
Pattern => (1 => X), -- the *Substring* to search for;
From => Line'First -- the point we start from.
);
begin
Return Found : constant Boolean := Index in Positive do
Result:= Index;
End return;
end;
function Slurp(File_Path: String) return Env_Hashed_Map.Map is
File: File_Type;
Line_Number: Integer := 1;
begin
Return Result: Env_Hashed_Map.Map do
Open(File => File,
Mode => In_File,
Name => File_Path);
while not End_Of_File(File) loop
declare
Line: String := Get_Line(File);
Index : Integer;
begin
if Index_Of(Line, '=', Index) then
declare
Use Ada.Strings;
Prev : Natural renames Positive'Pred( Index );
Next : Positive renames Positive'Succ( index );
-- Rename the Trim-function, and give it default for
-- "both sides"; this handles a line like:
-- " This_key = Some_Value "
Function Trim(Object : String;
Sides : Trim_End:= Both
) return String
renames Fixed.Trim;
Key : String renames Trim(Line(Line'First..Prev));
Value : String renames Trim(Line(Next..Line'Last) );
begin
Env_Hashed_Map.Insert(Result, Key, Value);
end;
else
raise Syntax_Error with (File_Path
& ":"
& Integer'Image(Line_Number)
& ": Expected separator `=`");
end if;
Line_Number := Line_Number + 1;
end;
end loop;
Close(File);
End return;
end;
function Find(Env: in Typ; Key: in Unbounded_String; Value: out Unbounded_String) return Boolean is
Use Env_Hashed_Map;
-- Renaming a function's return.
C : Cursor renames Find(Env, To_String(Key));
begin
-- Extended return example.
Return Occupied : Constant Boolean := Has_Element(C) do
if Occupied then
Value := To_Unbounded_String( Env_Hashed_Map.Element(C) );
end if;
End return;
end;
end Aids.Env;
|
with Ada.Unchecked_Conversion;
package Tkmrpc.Response.Ees.Esa_Expire.Convert is
function To_Response is new Ada.Unchecked_Conversion (
Source => Esa_Expire.Response_Type,
Target => Response.Data_Type);
function From_Response is new Ada.Unchecked_Conversion (
Source => Response.Data_Type,
Target => Esa_Expire.Response_Type);
end Tkmrpc.Response.Ees.Esa_Expire.Convert;
|
-- Display_Ascon_Traces
-- A utility to display traces of the encryption process for the test vectors
-- in the demo of the reference implementations
-- Copyright (c) 2016, James Humphry - see LICENSE file for details
with Ascon;
generic
with package Ascon_Package is new Ascon(<>);
procedure Display_Ascon_Traces;
|
------------------------------------------------------------------------------
-- --
-- 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.Generic_Hash;
function AMF.Standard_Profile_L2.Metaclasses.Hash is
new AMF.Elements.Generic_Hash (Standard_Profile_L2_Metaclass, Standard_Profile_L2_Metaclass_Access);
|
------------------------------------------------------------------------------
-- --
-- Hardware Abstraction Layer for STM32 Targets --
-- --
-- Copyright (C) 2014, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with STM32F4.RCC; use STM32F4.RCC;
package body STM32F4.SPI is
Baud_Rate_Value : constant array (SPI_Baud_Rate_Prescaler) of Bits_3 :=
(BRP_2 => 2#000#,
BRP_4 => 2#001#,
BRP_8 => 2#010#,
BRP_16 => 2#011#,
BRP_32 => 2#100#,
BRP_64 => 2#101#,
BRP_128 => 2#110#,
BRP_256 => 2#111#);
---------------
-- Configure --
---------------
procedure Configure (Port : in out SPI_Port; Conf : SPI_Configuration) is
CTRL1 : SPI_Control_Register := Port.CTRL1;
I2S_Conf : SPI_I2S_Config_Register := Port.I2S_Conf;
begin
case Conf.Mode is
when Master =>
CTRL1.Master_Select := 1;
CTRL1.Slave_Select := 1;
when Slave =>
CTRL1.Master_Select := 0;
CTRL1.Slave_Select := 0;
end case;
case Conf.Direction is
when D2Lines_FullDuplex =>
CTRL1.BiDir_Mode := 0;
CTRL1.Output_BiDir := 0;
CTRL1.RXOnly := 0;
when D2Lines_RxOnly =>
CTRL1.BiDir_Mode := 0;
CTRL1.Output_BiDir := 0;
CTRL1.RXOnly := 1;
when D1Line_Rx =>
CTRL1.BiDir_Mode := 1;
CTRL1.Output_BiDir := 0;
CTRL1.RXOnly := 0;
when D1Line_Tx =>
CTRL1.BiDir_Mode := 1;
CTRL1.Output_BiDir := 1;
CTRL1.RXOnly := 0;
end case;
CTRL1.Data_Frame_Fmt := (if Conf.Data_Size = Data_16 then 1 else 0);
CTRL1.Clock_Polarity := (if Conf.Clock_Polarity = High then 1 else 0);
CTRL1.Clock_Phase := (if Conf.Clock_Phase = P2Edge then 1 else 0);
CTRL1.Soft_Slave_Mgt := (if Conf.Slave_Management = Soft then 1 else 0);
CTRL1.Baud_Rate_Ctrl := Baud_Rate_Value (Conf.Baud_Rate_Prescaler);
CTRL1.LSB_First := (if Conf.First_Bit = LSB then 1 else 0);
Port.CTRL1 := CTRL1;
-- Activate the SPI mode (Reset I2SMOD bit in I2SCFGR register)
I2S_Conf := Port.I2S_Conf;
I2S_Conf.Mode_Select := 0;
Port.I2S_Conf := I2S_Conf;
Port.CRC_Poly := Conf.CRC_Poly;
end Configure;
------------
-- Enable --
------------
procedure Enable (Port : in out SPI_Port) is
CTRL1 : SPI_Control_Register := Port.CTRL1;
begin
CTRL1.SPI_Enable := 1;
Port.CTRL1 := CTRL1;
end Enable;
-------------
-- Disable --
-------------
procedure Disable (Port : in out SPI_Port) is
CTRL1 : SPI_Control_Register := Port.CTRL1;
begin
CTRL1.SPI_Enable := 0;
Port.CTRL1 := CTRL1;
end Disable;
-------------
-- Enabled --
-------------
function Enabled (Port : SPI_Port) return Boolean is
begin
return Port.CTRL1.SPI_Enable = 1;
end Enabled;
----------
-- Send --
----------
procedure Send (Port : in out SPI_Port; Data : Half_Word) is
begin
Port.Data := Data;
end Send;
----------
-- Data --
----------
function Data (Port : SPI_Port) return Half_Word is
begin
return Port.Data;
end Data;
----------
-- Send --
----------
procedure Send (Port : in out SPI_Port; Data : Byte) is
begin
Send (Port, Half_Word (Data));
end Send;
----------
-- Data --
----------
function Data (Port : SPI_Port) return Byte is
begin
return Byte (Half_Word'(Data (Port)));
end Data;
-----------------
-- Tx_Is_Empty --
-----------------
function Tx_Is_Empty (Port : SPI_Port) return Boolean is
begin
return Port.Status.TX_Buffer_Empty;
end Tx_Is_Empty;
-----------------
-- Rx_Is_Empty --
-----------------
function Rx_Is_Empty (Port : SPI_Port) return Boolean is
begin
return not Port.Status.RX_Buffer_Not_Empty;
end Rx_Is_Empty;
----------
-- Busy --
----------
function Busy (Port : SPI_Port) return Boolean is
begin
return Port.Status.Busy_Flag;
end Busy;
----------------------------
-- Channel_Side_Indicated --
----------------------------
function Channel_Side_Indicated (Port : SPI_Port) return Boolean is
begin
return Port.Status.Channel_Side;
end Channel_Side_Indicated;
------------------------
-- Underrun_Indicated --
------------------------
function Underrun_Indicated (Port : SPI_Port) return Boolean is
begin
return Port.Status.Underrun_Flag;
end Underrun_Indicated;
-------------------------
-- CRC_Error_Indicated --
-------------------------
function CRC_Error_Indicated (Port : SPI_Port) return Boolean is
begin
return Port.Status.CRC_Error_Flag;
end CRC_Error_Indicated;
--------------------------
-- Mode_Fault_Indicated --
--------------------------
function Mode_Fault_Indicated (Port : SPI_Port) return Boolean is
begin
return Port.Status.Mode_Fault;
end Mode_Fault_Indicated;
-----------------------
-- Overrun_Indicated --
-----------------------
function Overrun_Indicated (Port : SPI_Port) return Boolean is
begin
return Port.Status.Overrun_Flag;
end Overrun_Indicated;
-------------------------------
-- Frame_Fmt_Error_Indicated --
-------------------------------
function Frame_Fmt_Error_Indicated (Port : SPI_Port) return Boolean is
begin
return Port.Status.Frame_Fmt_Error;
end Frame_Fmt_Error_Indicated;
end STM32F4.SPI;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with AMF.Elements;
with AMF.Internals.Element_Collections;
with AMF.Internals.Helpers;
with AMF.Internals.Tables.UML_Attributes;
with AMF.Visitors.UML_Iterators;
with AMF.Visitors.UML_Visitors;
with League.Strings.Internals;
with Matreshka.Internals.Strings;
package body AMF.Internals.UML_Manifestations is
-------------------
-- Enter_Element --
-------------------
overriding procedure Enter_Element
(Self : not null access constant UML_Manifestation_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.UML_Visitors.UML_Visitor'Class then
AMF.Visitors.UML_Visitors.UML_Visitor'Class
(Visitor).Enter_Manifestation
(AMF.UML.Manifestations.UML_Manifestation_Access (Self),
Control);
end if;
end Enter_Element;
-------------------
-- Leave_Element --
-------------------
overriding procedure Leave_Element
(Self : not null access constant UML_Manifestation_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.UML_Visitors.UML_Visitor'Class then
AMF.Visitors.UML_Visitors.UML_Visitor'Class
(Visitor).Leave_Manifestation
(AMF.UML.Manifestations.UML_Manifestation_Access (Self),
Control);
end if;
end Leave_Element;
-------------------
-- Visit_Element --
-------------------
overriding procedure Visit_Element
(Self : not null access constant UML_Manifestation_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Iterator in AMF.Visitors.UML_Iterators.UML_Iterator'Class then
AMF.Visitors.UML_Iterators.UML_Iterator'Class
(Iterator).Visit_Manifestation
(Visitor,
AMF.UML.Manifestations.UML_Manifestation_Access (Self),
Control);
end if;
end Visit_Element;
--------------------------
-- Get_Utilized_Element --
--------------------------
overriding function Get_Utilized_Element
(Self : not null access constant UML_Manifestation_Proxy)
return AMF.UML.Packageable_Elements.UML_Packageable_Element_Access is
begin
return
AMF.UML.Packageable_Elements.UML_Packageable_Element_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Utilized_Element
(Self.Element)));
end Get_Utilized_Element;
--------------------------
-- Set_Utilized_Element --
--------------------------
overriding procedure Set_Utilized_Element
(Self : not null access UML_Manifestation_Proxy;
To : AMF.UML.Packageable_Elements.UML_Packageable_Element_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Utilized_Element
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Utilized_Element;
-----------------
-- Get_Mapping --
-----------------
overriding function Get_Mapping
(Self : not null access constant UML_Manifestation_Proxy)
return AMF.UML.Opaque_Expressions.UML_Opaque_Expression_Access is
begin
return
AMF.UML.Opaque_Expressions.UML_Opaque_Expression_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Mapping
(Self.Element)));
end Get_Mapping;
-----------------
-- Set_Mapping --
-----------------
overriding procedure Set_Mapping
(Self : not null access UML_Manifestation_Proxy;
To : AMF.UML.Opaque_Expressions.UML_Opaque_Expression_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Mapping
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Mapping;
----------------
-- Get_Client --
----------------
overriding function Get_Client
(Self : not null access constant UML_Manifestation_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
return
AMF.UML.Named_Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Client
(Self.Element)));
end Get_Client;
------------------
-- Get_Supplier --
------------------
overriding function Get_Supplier
(Self : not null access constant UML_Manifestation_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
return
AMF.UML.Named_Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Supplier
(Self.Element)));
end Get_Supplier;
----------------
-- Get_Source --
----------------
overriding function Get_Source
(Self : not null access constant UML_Manifestation_Proxy)
return AMF.UML.Elements.Collections.Set_Of_UML_Element is
begin
return
AMF.UML.Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Source
(Self.Element)));
end Get_Source;
----------------
-- Get_Target --
----------------
overriding function Get_Target
(Self : not null access constant UML_Manifestation_Proxy)
return AMF.UML.Elements.Collections.Set_Of_UML_Element is
begin
return
AMF.UML.Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Target
(Self.Element)));
end Get_Target;
-------------------------
-- Get_Related_Element --
-------------------------
overriding function Get_Related_Element
(Self : not null access constant UML_Manifestation_Proxy)
return AMF.UML.Elements.Collections.Set_Of_UML_Element is
begin
return
AMF.UML.Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Related_Element
(Self.Element)));
end Get_Related_Element;
---------------------------
-- Get_Client_Dependency --
---------------------------
overriding function Get_Client_Dependency
(Self : not null access constant UML_Manifestation_Proxy)
return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency is
begin
return
AMF.UML.Dependencies.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Client_Dependency
(Self.Element)));
end Get_Client_Dependency;
-------------------------
-- Get_Name_Expression --
-------------------------
overriding function Get_Name_Expression
(Self : not null access constant UML_Manifestation_Proxy)
return AMF.UML.String_Expressions.UML_String_Expression_Access is
begin
return
AMF.UML.String_Expressions.UML_String_Expression_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Name_Expression
(Self.Element)));
end Get_Name_Expression;
-------------------------
-- Set_Name_Expression --
-------------------------
overriding procedure Set_Name_Expression
(Self : not null access UML_Manifestation_Proxy;
To : AMF.UML.String_Expressions.UML_String_Expression_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Name_Expression
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Name_Expression;
-------------------
-- Get_Namespace --
-------------------
overriding function Get_Namespace
(Self : not null access constant UML_Manifestation_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access is
begin
return
AMF.UML.Namespaces.UML_Namespace_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Namespace
(Self.Element)));
end Get_Namespace;
------------------------
-- Get_Qualified_Name --
------------------------
overriding function Get_Qualified_Name
(Self : not null access constant UML_Manifestation_Proxy)
return AMF.Optional_String is
begin
declare
use type Matreshka.Internals.Strings.Shared_String_Access;
Aux : constant Matreshka.Internals.Strings.Shared_String_Access
:= AMF.Internals.Tables.UML_Attributes.Internal_Get_Qualified_Name (Self.Element);
begin
if Aux = null then
return (Is_Empty => True);
else
return (False, League.Strings.Internals.Create (Aux));
end if;
end;
end Get_Qualified_Name;
-----------------------------------
-- Get_Owning_Template_Parameter --
-----------------------------------
overriding function Get_Owning_Template_Parameter
(Self : not null access constant UML_Manifestation_Proxy)
return AMF.UML.Template_Parameters.UML_Template_Parameter_Access is
begin
return
AMF.UML.Template_Parameters.UML_Template_Parameter_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Owning_Template_Parameter
(Self.Element)));
end Get_Owning_Template_Parameter;
-----------------------------------
-- Set_Owning_Template_Parameter --
-----------------------------------
overriding procedure Set_Owning_Template_Parameter
(Self : not null access UML_Manifestation_Proxy;
To : AMF.UML.Template_Parameters.UML_Template_Parameter_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Owning_Template_Parameter
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Owning_Template_Parameter;
----------------------------
-- Get_Template_Parameter --
----------------------------
overriding function Get_Template_Parameter
(Self : not null access constant UML_Manifestation_Proxy)
return AMF.UML.Template_Parameters.UML_Template_Parameter_Access is
begin
return
AMF.UML.Template_Parameters.UML_Template_Parameter_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Template_Parameter
(Self.Element)));
end Get_Template_Parameter;
----------------------------
-- Set_Template_Parameter --
----------------------------
overriding procedure Set_Template_Parameter
(Self : not null access UML_Manifestation_Proxy;
To : AMF.UML.Template_Parameters.UML_Template_Parameter_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Template_Parameter
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Template_Parameter;
-------------------------
-- All_Owning_Packages --
-------------------------
overriding function All_Owning_Packages
(Self : not null access constant UML_Manifestation_Proxy)
return AMF.UML.Packages.Collections.Set_Of_UML_Package is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "All_Owning_Packages unimplemented");
raise Program_Error with "Unimplemented procedure UML_Manifestation_Proxy.All_Owning_Packages";
return All_Owning_Packages (Self);
end All_Owning_Packages;
-----------------------------
-- Is_Distinguishable_From --
-----------------------------
overriding function Is_Distinguishable_From
(Self : not null access constant UML_Manifestation_Proxy;
N : AMF.UML.Named_Elements.UML_Named_Element_Access;
Ns : AMF.UML.Namespaces.UML_Namespace_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Distinguishable_From unimplemented");
raise Program_Error with "Unimplemented procedure UML_Manifestation_Proxy.Is_Distinguishable_From";
return Is_Distinguishable_From (Self, N, Ns);
end Is_Distinguishable_From;
---------------
-- Namespace --
---------------
overriding function Namespace
(Self : not null access constant UML_Manifestation_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Namespace unimplemented");
raise Program_Error with "Unimplemented procedure UML_Manifestation_Proxy.Namespace";
return Namespace (Self);
end Namespace;
------------------------
-- Is_Compatible_With --
------------------------
overriding function Is_Compatible_With
(Self : not null access constant UML_Manifestation_Proxy;
P : AMF.UML.Parameterable_Elements.UML_Parameterable_Element_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Compatible_With unimplemented");
raise Program_Error with "Unimplemented procedure UML_Manifestation_Proxy.Is_Compatible_With";
return Is_Compatible_With (Self, P);
end Is_Compatible_With;
---------------------------
-- Is_Template_Parameter --
---------------------------
overriding function Is_Template_Parameter
(Self : not null access constant UML_Manifestation_Proxy)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Template_Parameter unimplemented");
raise Program_Error with "Unimplemented procedure UML_Manifestation_Proxy.Is_Template_Parameter";
return Is_Template_Parameter (Self);
end Is_Template_Parameter;
end AMF.Internals.UML_Manifestations;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . S T R I N G S . W I D E _ M A P S --
-- --
-- S p e c --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-1998 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 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Ada.Finalization;
package Ada.Strings.Wide_Maps is
pragma Preelaborate (Wide_Maps);
-------------------------------------
-- Wide Character Set Declarations --
-------------------------------------
type Wide_Character_Set is private;
-- Representation for a set of Wide_Character values:
Null_Set : constant Wide_Character_Set;
------------------------------------------
-- Constructors for Wide Character Sets --
------------------------------------------
type Wide_Character_Range is record
Low : Wide_Character;
High : Wide_Character;
end record;
-- Represents Wide_Character range Low .. High
type Wide_Character_Ranges is
array (Positive range <>) of Wide_Character_Range;
function To_Set
(Ranges : in Wide_Character_Ranges)
return Wide_Character_Set;
function To_Set
(Span : in Wide_Character_Range)
return Wide_Character_Set;
function To_Ranges
(Set : in Wide_Character_Set)
return Wide_Character_Ranges;
---------------------------------------
-- Operations on Wide Character Sets --
---------------------------------------
function "=" (Left, Right : in Wide_Character_Set) return Boolean;
function "not"
(Right : in Wide_Character_Set)
return Wide_Character_Set;
function "and"
(Left, Right : in Wide_Character_Set)
return Wide_Character_Set;
function "or"
(Left, Right : in Wide_Character_Set)
return Wide_Character_Set;
function "xor"
(Left, Right : in Wide_Character_Set)
return Wide_Character_Set;
function "-"
(Left, Right : in Wide_Character_Set)
return Wide_Character_Set;
function Is_In
(Element : in Wide_Character;
Set : in Wide_Character_Set)
return Boolean;
function Is_Subset
(Elements : in Wide_Character_Set;
Set : in Wide_Character_Set)
return Boolean;
function "<="
(Left : in Wide_Character_Set;
Right : in Wide_Character_Set)
return Boolean
renames Is_Subset;
subtype Wide_Character_Sequence is Wide_String;
-- Alternative representation for a set of character values
function To_Set
(Sequence : in Wide_Character_Sequence)
return Wide_Character_Set;
function To_Set
(Singleton : in Wide_Character)
return Wide_Character_Set;
function To_Sequence
(Set : in Wide_Character_Set)
return Wide_Character_Sequence;
-----------------------------------------
-- Wide Character Mapping Declarations --
-----------------------------------------
type Wide_Character_Mapping is private;
-- Representation for a wide character to wide character mapping:
function Value
(Map : in Wide_Character_Mapping;
Element : in Wide_Character)
return Wide_Character;
Identity : constant Wide_Character_Mapping;
---------------------------------
-- Operations on Wide Mappings --
---------------------------------
function To_Mapping
(From, To : in Wide_Character_Sequence)
return Wide_Character_Mapping;
function To_Domain
(Map : in Wide_Character_Mapping)
return Wide_Character_Sequence;
function To_Range
(Map : in Wide_Character_Mapping)
return Wide_Character_Sequence;
type Wide_Character_Mapping_Function is
access function (From : in Wide_Character) return Wide_Character;
private
package AF renames Ada.Finalization;
------------------------------------------
-- Representation of Wide_Character_Set --
------------------------------------------
-- A wide character set is represented as a sequence of wide character
-- ranges (i.e. an object of type Wide_Character_Ranges) in which the
-- following hold:
-- The lower bound is 1
-- The ranges are in order by increasing Low values
-- The ranges are non-overlapping and discontigous
-- A character value is in the set if it is contained in one of the
-- ranges. The actual Wide_Character_Set value is a controlled pointer
-- to this Wide_Character_Ranges value. The use of a controlled type
-- is necessary to prevent storage leaks.
type Wide_Character_Ranges_Access is access all Wide_Character_Ranges;
type Wide_Character_Set is new AF.Controlled with record
Set : Wide_Character_Ranges_Access;
end record;
pragma Finalize_Storage_Only (Wide_Character_Set);
-- This avoids useless finalizations, and, more importantly avoids
-- incorrect attempts to finalize constants that are statically
-- declared here and in Ada.Strings.Wide_Maps, which is incorrect.
procedure Initialize (Object : in out Wide_Character_Set);
procedure Adjust (Object : in out Wide_Character_Set);
procedure Finalize (Object : in out Wide_Character_Set);
Null_Range : aliased constant Wide_Character_Ranges :=
(1 .. 0 => (Low => ' ', High => ' '));
Null_Set : constant Wide_Character_Set :=
(AF.Controlled with
Set => Null_Range'Unrestricted_Access);
----------------------------------------------
-- Representation of Wide_Character_Mapping --
----------------------------------------------
-- A wide character mapping is represented as two strings of equal
-- length, where any character appearing in Domain is mapped to the
-- corresponding character in Rangev. A character not appearing in
-- Domain is mapped to itself. The characters in Domain are sorted
-- in ascending order.
-- The actual Wide_Character_Mapping value is a controlled record
-- that contains a pointer to a discriminated record containing the
-- range and domain values.
-- Note: this representation is canonical, and the values stored in
-- Domain and Rangev are exactly the values that are returned by the
-- functions To_Domain and To_Range. The use of a controlled type is
-- necessary to prevent storage leaks.
type Wide_Character_Mapping_Values (Length : Natural) is record
Domain : Wide_Character_Sequence (1 .. Length);
Rangev : Wide_Character_Sequence (1 .. Length);
end record;
type Wide_Character_Mapping_Values_Access is
access all Wide_Character_Mapping_Values;
type Wide_Character_Mapping is new AF.Controlled with record
Map : Wide_Character_Mapping_Values_Access;
end record;
pragma Finalize_Storage_Only (Wide_Character_Mapping);
-- This avoids useless finalizations, and, more importantly avoids
-- incorrect attempts to finalize constants that are statically
-- declared here and in Ada.Strings.Wide_Maps, which is incorrect.
procedure Initialize (Object : in out Wide_Character_Mapping);
procedure Adjust (Object : in out Wide_Character_Mapping);
procedure Finalize (Object : in out Wide_Character_Mapping);
Null_Map : aliased constant Wide_Character_Mapping_Values :=
(Length => 0,
Domain => "",
Rangev => "");
Identity : constant Wide_Character_Mapping :=
(AF.Controlled with
Map => Null_Map'Unrestricted_Access);
end Ada.Strings.Wide_Maps;
|
-------------------------------------------------------------------------------
-- Copyright (c) 2016, Daniel King
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
-- * Redistributions of source code must retain the above copyright
-- notice, this list of conditions and the following disclaimer.
-- * Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
-- * The name of the copyright holder may not be used to endorse or promote
-- Products derived from this software without specific prior written
-- permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE FOR ANY
-- DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
-- (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
-- LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
-- ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
-- THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-------------------------------------------------------------------------------
with KeccakF_Suite;
with Sponge_Suite;
with Parallel_Sponge_Suite;
with Util_Suite;
with Ketje_Suite;
with AUnit.Test_Caller;
package body Keccak_Suites
is
function Suite return Access_Test_Suite
is
Ret : constant Access_Test_Suite := new Test_Suite;
begin
Ret.Add_Test(KeccakF_Suite.Suite);
Ret.Add_Test(Sponge_Suite.Suite);
Ret.Add_Test(Parallel_Sponge_Suite.Suite);
Ret.Add_Test(Util_Suite.Suite);
Ret.Add_Test(Ketje_Suite.Suite);
return Ret;
end Suite;
end Keccak_Suites;
|
-----------------------------------------------------------------------
-- components-holders -- Value holder interfaces
-- Copyright (C) 2009, 2010, 2011, 2013 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
-- The <bASF.Components.Holders</b> defines the value holder interfaces
-- which allow to plug a converter and one or several validators.
-- These interfaces must be implemented by UIOutput component and UIInput
-- component to participate in the JSF/ASF lifecycle (validation phase).
with EL.Objects;
with ASF.Converters;
with ASF.Validators;
package ASF.Components.Holders is
-- ------------------------------
-- Value Holder
-- ------------------------------
type Value_Holder is limited interface;
-- Get the local value of the component without evaluating
-- the associated Value_Expression.
function Get_Local_Value (Holder : in Value_Holder) return EL.Objects.Object is abstract;
-- Get the value of the component. If the component has a local
-- value which is not null, returns it. Otherwise, if we have a Value_Expression
-- evaluate and returns the value.
function Get_Value (Holder : in Value_Holder) return EL.Objects.Object is abstract;
-- Set the value of the component.
procedure Set_Value (Holder : in out Value_Holder;
Value : in EL.Objects.Object) is abstract;
-- Get the converter that is registered on the component.
function Get_Converter (Holder : in Value_Holder)
return ASF.Converters.Converter_Access is abstract;
-- Set the converter to be used on the component.
procedure Set_Converter (Holder : in out Value_Holder;
Converter : in ASF.Converters.Converter_Access) is abstract;
-- ------------------------------
-- Editable Value Holder
-- ------------------------------
-- The <b>Editable_Value_Holder</b> extends the <b>Value_Holder</b> to provide
-- operations used when a value can be modified.
type Editable_Value_Holder is limited interface and Value_Holder;
-- Add the validator to be used on the component. The ASF implementation limits
-- to 5 the number of validators that can be set on a component (See UIInput).
-- The validator instance will be freed when the editable value holder is deleted
-- unless <b>Shared</b> is true.
procedure Add_Validator (Holder : in out Editable_Value_Holder;
Validator : in ASF.Validators.Validator_Access;
Shared : in Boolean := False) is abstract;
-- ------------------------------
-- List Holder
-- ------------------------------
-- The <b>List_Holder</b> is an interface used by the data scroller to get some information
-- about how a list is displayed.
type List_Holder is limited interface;
type List_Holder_Access is access all List_Holder'Class;
-- Get the number of rows in the list.
function Get_Row_Count (List : in List_Holder) return Natural is abstract;
-- Get the number of rows per page.
function Get_Row_Per_Page (List : in List_Holder) return Positive is abstract;
-- Get the current page.
function Get_Current_Page (List : in List_Holder) return Positive is abstract;
-- Set the current page number.
procedure Set_Current_Page (List : in out List_Holder;
Page : in Positive) is abstract;
end ASF.Components.Holders;
|
-- SPDX-FileCopyrightText: 2019 Max Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
with Program.Lexical_Elements;
with Program.Elements.String_Literals;
with Program.Element_Visitors;
package Program.Nodes.String_Literals is
pragma Preelaborate;
type String_Literal is
new Program.Nodes.Node and Program.Elements.String_Literals.String_Literal
and Program.Elements.String_Literals.String_Literal_Text
with private;
function Create
(String_Literal_Token : not null Program.Lexical_Elements
.Lexical_Element_Access)
return String_Literal;
type Implicit_String_Literal is
new Program.Nodes.Node and Program.Elements.String_Literals.String_Literal
with private;
function Create
(Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_String_Literal
with Pre =>
Is_Part_Of_Implicit or Is_Part_Of_Inherited or Is_Part_Of_Instance;
private
type Base_String_Literal is
abstract new Program.Nodes.Node
and Program.Elements.String_Literals.String_Literal
with null record;
procedure Initialize (Self : in out Base_String_Literal'Class);
overriding procedure Visit
(Self : not null access Base_String_Literal;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class);
overriding function Is_String_Literal
(Self : Base_String_Literal)
return Boolean;
overriding function Is_Expression
(Self : Base_String_Literal)
return Boolean;
type String_Literal is
new Base_String_Literal
and Program.Elements.String_Literals.String_Literal_Text
with record
String_Literal_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
end record;
overriding function To_String_Literal_Text
(Self : in out String_Literal)
return Program.Elements.String_Literals.String_Literal_Text_Access;
overriding function String_Literal_Token
(Self : String_Literal)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function Image (Self : String_Literal) return Text;
type Implicit_String_Literal is
new Base_String_Literal
with record
Is_Part_Of_Implicit : Boolean;
Is_Part_Of_Inherited : Boolean;
Is_Part_Of_Instance : Boolean;
end record;
overriding function To_String_Literal_Text
(Self : in out Implicit_String_Literal)
return Program.Elements.String_Literals.String_Literal_Text_Access;
overriding function Is_Part_Of_Implicit
(Self : Implicit_String_Literal)
return Boolean;
overriding function Is_Part_Of_Inherited
(Self : Implicit_String_Literal)
return Boolean;
overriding function Is_Part_Of_Instance
(Self : Implicit_String_Literal)
return Boolean;
overriding function Image (Self : Implicit_String_Literal) return Text;
end Program.Nodes.String_Literals;
|
pragma License (Unrestricted);
-- runtime unit
package System.Unwind is
pragma Pure;
-- exception data type (s-stalib.ads)
type Raise_Action is access procedure;
type Exception_Data;
type Exception_Data_Access is access constant Exception_Data;
for Exception_Data_Access'Storage_Size use 0;
type Exception_Data is record
Not_Handled_By_Others : Boolean;
Lang : Character;
Name_Length : Natural;
Full_Name : Address;
HTable_Ptr : Exception_Data_Access;
Foreign_Data : Address;
Raise_Hook : Raise_Action;
end record;
pragma Suppress_Initialization (Exception_Data);
-- RM 11.4.1(18) (s-parame.ads)
Default_Exception_Msg_Max_Length : constant := 200;
-- (s-traent.ads)
subtype Traceback_Entry is Address;
-- (a-except-2005.ads)
Exception_Msg_Max_Length : constant := Default_Exception_Msg_Max_Length;
Max_Tracebacks : constant := 50;
type Tracebacks_Array is array (1 .. Max_Tracebacks) of Traceback_Entry;
pragma Suppress_Initialization (Tracebacks_Array);
-- (a-except-2005.ads)
type Exception_Occurrence is record
Id : Exception_Data_Access;
Machine_Occurrence : Address := Null_Address;
Msg_Length : Natural := 0;
Msg : String (1 .. Exception_Msg_Max_Length);
Exception_Raised : Boolean := False;
Pid : Natural := 0;
Num_Tracebacks : Natural range 0 .. Max_Tracebacks := 0;
Tracebacks : aliased Tracebacks_Array;
end record;
type Exception_Occurrence_Access is access all Exception_Occurrence;
for Exception_Occurrence_Access'Storage_Size use 0;
end System.Unwind;
|
package Loop_Optimization11_Pkg is
function Img (X : Integer) return String;
procedure Put_Line (Data : String);
type Prot is (Execute, Execute_Read, Execute_Read_Write);
type Mem is (Mem_Image, Mem_Mapped, Mem_Private, Unknown);
end Loop_Optimization11_Pkg;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2009, 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$
------------------------------------------------------------------------------
-- Root package for pregenerated collation data from the Unicode Common Locale
-- Data Repository.
package Matreshka.Internals.Unicode.Cldr.Collation is
pragma Pure;
end Matreshka.Internals.Unicode.Cldr.Collation;
|
package GESTE_Fonts.FreeSerifItalic24pt7b is
Font : constant Bitmap_Font_Ref;
private
FreeSerifItalic24pt7bBitmaps : aliased constant Font_Bitmap := (
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#,
16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#,
16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#,
16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#,
16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#,
16#00#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#,
16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#06#, 16#00#,
16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#,
16#40#, 16#00#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#,
16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#02#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#20#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#,
16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#,
16#80#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#01#, 16#81#, 16#80#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#78#, 16#38#, 16#00#, 16#00#, 16#00#, 16#1E#,
16#1E#, 16#00#, 16#00#, 16#00#, 16#07#, 16#07#, 16#80#, 16#00#, 16#00#,
16#01#, 16#C1#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#70#, 16#70#, 16#00#,
16#00#, 16#00#, 16#18#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#06#,
16#00#, 16#00#, 16#00#, 16#03#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#,
16#C0#, 16#40#, 16#00#, 16#00#, 16#00#, 16#20#, 16#10#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#06#, 16#03#, 16#00#, 16#00#, 16#00#,
16#03#, 16#81#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#70#, 16#00#,
16#00#, 16#00#, 16#70#, 16#38#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#0E#,
16#00#, 16#00#, 16#00#, 16#07#, 16#03#, 16#80#, 16#00#, 16#00#, 16#03#,
16#81#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#70#, 16#00#, 16#00#,
16#00#, 16#30#, 16#18#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#0E#, 16#00#,
16#00#, 16#00#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#3F#, 16#FF#,
16#FE#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#70#, 16#00#, 16#00#, 16#00#,
16#30#, 16#18#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#0E#, 16#00#, 16#00#,
16#00#, 16#07#, 16#03#, 16#80#, 16#00#, 16#00#, 16#03#, 16#81#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#E0#, 16#70#, 16#00#, 16#00#, 16#00#, 16#38#,
16#1C#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#00#,
16#FF#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#81#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#E0#, 16#70#, 16#00#, 16#00#, 16#00#, 16#38#, 16#18#,
16#00#, 16#00#, 16#00#, 16#1C#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#07#,
16#03#, 16#80#, 16#00#, 16#00#, 16#03#, 16#81#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#E0#, 16#70#, 16#00#, 16#00#, 16#00#, 16#38#, 16#1C#, 16#00#,
16#00#, 16#00#, 16#1C#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#07#, 16#03#,
16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#10#, 16#00#, 16#00#, 16#00#, 16#00#,
16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#,
16#00#, 16#1F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#2F#, 16#00#,
16#00#, 16#00#, 16#0E#, 16#19#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#06#,
16#38#, 16#00#, 16#00#, 16#03#, 16#C1#, 16#86#, 16#00#, 16#00#, 16#00#,
16#E0#, 16#41#, 16#80#, 16#00#, 16#00#, 16#38#, 16#30#, 16#40#, 16#00#,
16#00#, 16#0F#, 16#0C#, 16#10#, 16#00#, 16#00#, 16#03#, 16#C3#, 16#00#,
16#00#, 16#00#, 16#00#, 16#F8#, 16#80#, 16#00#, 16#00#, 16#00#, 16#1F#,
16#60#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#00#,
16#00#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#,
16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#02#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#01#, 16#8F#, 16#80#, 16#00#,
16#00#, 16#00#, 16#61#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#18#, 16#78#,
16#00#, 16#00#, 16#00#, 16#04#, 16#0E#, 16#00#, 16#00#, 16#01#, 16#03#,
16#03#, 16#80#, 16#00#, 16#00#, 16#C0#, 16#C0#, 16#E0#, 16#00#, 16#00#,
16#30#, 16#30#, 16#38#, 16#00#, 16#00#, 16#0C#, 16#08#, 16#1E#, 16#00#,
16#00#, 16#03#, 16#86#, 16#07#, 16#00#, 16#00#, 16#00#, 16#F1#, 16#83#,
16#C0#, 16#00#, 16#00#, 16#1E#, 16#61#, 16#E0#, 16#00#, 16#00#, 16#03#,
16#F9#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#00#, 16#08#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#,
16#0C#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#07#, 16#00#, 16#00#, 16#0F#,
16#1C#, 16#07#, 16#80#, 16#00#, 16#07#, 16#81#, 16#FE#, 16#E0#, 16#00#,
16#03#, 16#C0#, 16#20#, 16#30#, 16#00#, 16#01#, 16#F0#, 16#08#, 16#18#,
16#00#, 16#00#, 16#78#, 16#02#, 16#06#, 16#00#, 16#00#, 16#3C#, 16#00#,
16#83#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#60#, 16#C0#, 16#00#, 16#03#,
16#C0#, 16#10#, 16#60#, 16#00#, 16#00#, 16#E0#, 16#04#, 16#38#, 16#00#,
16#00#, 16#38#, 16#03#, 16#0C#, 16#00#, 16#00#, 16#0E#, 16#01#, 16#87#,
16#00#, 16#00#, 16#03#, 16#80#, 16#41#, 16#81#, 16#F0#, 16#00#, 16#F0#,
16#30#, 16#C1#, 16#FF#, 16#00#, 16#1E#, 16#38#, 16#30#, 16#F8#, 16#C0#,
16#03#, 16#FC#, 16#18#, 16#7C#, 16#18#, 16#00#, 16#7C#, 16#0E#, 16#3E#,
16#02#, 16#00#, 16#00#, 16#03#, 16#0F#, 16#00#, 16#80#, 16#00#, 16#01#,
16#C7#, 16#80#, 16#20#, 16#00#, 16#00#, 16#61#, 16#E0#, 16#08#, 16#00#,
16#00#, 16#30#, 16#F8#, 16#02#, 16#00#, 16#00#, 16#0C#, 16#3C#, 16#01#,
16#80#, 16#00#, 16#06#, 16#0F#, 16#00#, 16#40#, 16#00#, 16#01#, 16#83#,
16#C0#, 16#30#, 16#00#, 16#00#, 16#C0#, 16#F0#, 16#08#, 16#00#, 16#00#,
16#70#, 16#3C#, 16#06#, 16#00#, 16#00#, 16#18#, 16#0F#, 16#03#, 16#00#,
16#00#, 16#0E#, 16#01#, 16#E1#, 16#80#, 16#00#, 16#03#, 16#00#, 16#3F#,
16#C0#, 16#00#, 16#01#, 16#80#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#60#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#0E#, 16#38#, 16#00#, 16#00#, 16#00#, 16#07#, 16#0E#, 16#00#,
16#00#, 16#00#, 16#03#, 16#83#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#E0#,
16#E0#, 16#00#, 16#00#, 16#00#, 16#38#, 16#38#, 16#00#, 16#00#, 16#00#,
16#1E#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#07#, 16#87#, 16#00#, 16#00#,
16#00#, 16#01#, 16#E3#, 16#80#, 16#00#, 16#00#, 16#00#, 16#79#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#07#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#EF#, 16#07#, 16#FC#,
16#00#, 16#00#, 16#E3#, 16#C0#, 16#78#, 16#00#, 16#00#, 16#F0#, 16#F8#,
16#1E#, 16#00#, 16#00#, 16#78#, 16#1E#, 16#07#, 16#00#, 16#00#, 16#3C#,
16#07#, 16#81#, 16#80#, 16#00#, 16#1E#, 16#01#, 16#F0#, 16#E0#, 16#00#,
16#07#, 16#80#, 16#3C#, 16#30#, 16#00#, 16#03#, 16#C0#, 16#0F#, 16#18#,
16#00#, 16#00#, 16#F0#, 16#03#, 16#EE#, 16#00#, 16#00#, 16#3C#, 16#00#,
16#7F#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#03#,
16#C0#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#F8#, 16#00#,
16#00#, 16#3E#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#1F#,
16#E0#, 16#00#, 16#01#, 16#FC#, 16#3C#, 16#FC#, 16#30#, 16#00#, 16#1F#,
16#FC#, 16#0F#, 16#F0#, 16#00#, 16#01#, 16#F8#, 16#01#, 16#F8#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#,
16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#,
16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#,
16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#,
16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#20#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#06#, 16#00#,
16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#,
16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#60#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#,
16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#,
16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#,
16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#,
16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#,
16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#,
16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#,
16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#,
16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#,
16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#,
16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#,
16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#,
16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#,
16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#10#, 16#00#, 16#00#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#20#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#,
16#10#, 16#00#, 16#00#, 16#00#, 16#00#, 16#04#, 16#00#, 16#00#, 16#00#,
16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#,
16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#,
16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#,
16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#,
16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#,
16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#,
16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#,
16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#,
16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#,
16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#,
16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0C#,
16#00#, 16#00#, 16#00#, 16#00#, 16#04#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#,
16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#,
16#00#, 16#00#, 16#00#, 16#03#, 16#82#, 16#0E#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#87#, 16#80#, 16#00#, 16#00#, 16#3E#, 16#23#, 16#E0#, 16#00#,
16#00#, 16#01#, 16#C9#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#,
16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#01#,
16#AC#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C9#, 16#E0#, 16#00#, 16#00#,
16#03#, 16#E2#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#87#, 16#80#,
16#00#, 16#00#, 16#18#, 16#30#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#1C#,
16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#,
16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#,
16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#,
16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#,
16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#,
16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#3F#, 16#FF#,
16#FF#, 16#C0#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#,
16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#,
16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#,
16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#,
16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#,
16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#,
16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#,
16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#,
16#00#, 16#00#, 16#00#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#7F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#F8#, 16#00#,
16#00#, 16#00#, 16#0F#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#,
16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#,
16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#,
16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#,
16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#,
16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#,
16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#,
16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#,
16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#,
16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#,
16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#,
16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#,
16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#,
16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#,
16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#,
16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#0C#, 16#00#,
16#00#, 16#00#, 16#03#, 16#01#, 16#80#, 16#00#, 16#00#, 16#03#, 16#80#,
16#70#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#1C#, 16#00#, 16#00#, 16#00#,
16#70#, 16#03#, 16#80#, 16#00#, 16#00#, 16#38#, 16#00#, 16#E0#, 16#00#,
16#00#, 16#1E#, 16#00#, 16#38#, 16#00#, 16#00#, 16#07#, 16#80#, 16#0E#,
16#00#, 16#00#, 16#03#, 16#C0#, 16#03#, 16#80#, 16#00#, 16#00#, 16#F0#,
16#01#, 16#E0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#78#, 16#00#, 16#00#,
16#1E#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#07#, 16#80#, 16#07#, 16#80#,
16#00#, 16#03#, 16#E0#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#F0#, 16#00#,
16#78#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#0F#,
16#00#, 16#0F#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#F0#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#78#,
16#00#, 16#00#, 16#0E#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#03#, 16#80#,
16#0F#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#03#, 16#C0#, 16#00#, 16#00#,
16#38#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#70#, 16#00#,
16#00#, 16#01#, 16#80#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#70#, 16#0E#,
16#00#, 16#00#, 16#00#, 16#0C#, 16#07#, 16#00#, 16#00#, 16#00#, 16#01#,
16#87#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#80#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#,
16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#,
16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#,
16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#,
16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#,
16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#,
16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#,
16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#,
16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#,
16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#,
16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#,
16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#,
16#00#, 16#03#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#00#,
16#3F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FE#, 16#00#, 16#00#,
16#00#, 16#0E#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#06#, 16#01#, 16#F8#,
16#00#, 16#00#, 16#01#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#80#,
16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#,
16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#,
16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#,
16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#,
16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#,
16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#06#, 16#00#,
16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#,
16#80#, 16#04#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#02#, 16#00#, 16#00#,
16#00#, 16#70#, 16#01#, 16#80#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#C0#,
16#00#, 16#00#, 16#1F#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#FF#,
16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#,
16#00#, 16#1F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#18#, 16#3E#, 16#00#,
16#00#, 16#00#, 16#0C#, 16#07#, 16#80#, 16#00#, 16#00#, 16#02#, 16#00#,
16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#,
16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#,
16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#,
16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#,
16#00#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#,
16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#,
16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#,
16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#,
16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#18#,
16#00#, 16#00#, 16#00#, 16#7E#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#1F#,
16#FE#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#,
16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#,
16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#5E#, 16#00#,
16#00#, 16#00#, 16#00#, 16#37#, 16#80#, 16#00#, 16#00#, 16#00#, 16#19#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#F0#, 16#00#, 16#00#, 16#00#,
16#06#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#03#, 16#0E#, 16#00#, 16#00#,
16#00#, 16#01#, 16#87#, 16#80#, 16#00#, 16#00#, 16#00#, 16#C1#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#60#, 16#78#, 16#00#, 16#00#, 16#00#, 16#30#,
16#1C#, 16#00#, 16#00#, 16#00#, 16#18#, 16#0F#, 16#00#, 16#00#, 16#00#,
16#0C#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#06#, 16#00#, 16#F0#, 16#00#,
16#00#, 16#03#, 16#00#, 16#78#, 16#00#, 16#00#, 16#01#, 16#80#, 16#1E#,
16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#3F#,
16#FF#, 16#FE#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 16#80#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#,
16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#,
16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#,
16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#,
16#F8#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FE#, 16#00#, 16#00#, 16#00#,
16#0F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#,
16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#,
16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#03#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#,
16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#,
16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#,
16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#,
16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#,
16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#,
16#01#, 16#C0#, 16#18#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#1C#, 16#00#,
16#00#, 16#00#, 16#1F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FC#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#,
16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#,
16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#,
16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#,
16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#,
16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7D#,
16#F8#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#00#, 16#00#, 16#00#,
16#0F#, 16#C1#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#3C#, 16#00#,
16#00#, 16#01#, 16#F0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#F8#, 16#01#,
16#E0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#0F#,
16#00#, 16#0F#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#07#, 16#C0#, 16#00#,
16#01#, 16#F0#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#78#, 16#00#, 16#7C#,
16#00#, 16#00#, 16#1E#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#07#, 16#80#,
16#07#, 16#80#, 16#00#, 16#00#, 16#E0#, 16#03#, 16#E0#, 16#00#, 16#00#,
16#38#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#3C#, 16#00#,
16#00#, 16#03#, 16#80#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#70#, 16#0F#,
16#00#, 16#00#, 16#00#, 16#0C#, 16#07#, 16#80#, 16#00#, 16#00#, 16#01#,
16#83#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#07#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FF#,
16#80#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#70#,
16#00#, 16#60#, 16#00#, 16#00#, 16#30#, 16#00#, 16#38#, 16#00#, 16#00#,
16#08#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#,
16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#,
16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#,
16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#,
16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#,
16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#,
16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#,
16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#,
16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#,
16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#,
16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#,
16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#70#, 16#00#, 16#00#, 16#00#,
16#38#, 16#07#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#01#, 16#C0#, 16#00#,
16#00#, 16#07#, 16#00#, 16#38#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#0E#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#03#, 16#80#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#80#, 16#38#, 16#00#, 16#00#,
16#01#, 16#E0#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#0F#, 16#87#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F3#,
16#80#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#00#, 16#00#,
16#0F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#00#,
16#00#, 16#07#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#07#, 16#07#, 16#E0#,
16#00#, 16#00#, 16#03#, 16#80#, 16#F8#, 16#00#, 16#00#, 16#01#, 16#C0#,
16#1F#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#03#, 16#C0#, 16#00#, 16#00#,
16#38#, 16#00#, 16#78#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#1E#, 16#00#,
16#00#, 16#07#, 16#80#, 16#07#, 16#80#, 16#00#, 16#01#, 16#E0#, 16#01#,
16#E0#, 16#00#, 16#00#, 16#38#, 16#00#, 16#78#, 16#00#, 16#00#, 16#0E#,
16#00#, 16#1C#, 16#00#, 16#00#, 16#03#, 16#80#, 16#07#, 16#00#, 16#00#,
16#00#, 16#70#, 16#03#, 16#80#, 16#00#, 16#00#, 16#0E#, 16#01#, 16#C0#,
16#00#, 16#00#, 16#01#, 16#C0#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#1F#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#,
16#00#, 16#78#, 16#60#, 16#00#, 16#00#, 16#00#, 16#38#, 16#0C#, 16#00#,
16#00#, 16#00#, 16#1C#, 16#01#, 16#80#, 16#00#, 16#00#, 16#0E#, 16#00#,
16#70#, 16#00#, 16#00#, 16#07#, 16#80#, 16#1C#, 16#00#, 16#00#, 16#01#,
16#E0#, 16#03#, 16#80#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#E0#, 16#00#,
16#00#, 16#3C#, 16#00#, 16#38#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#1E#,
16#00#, 16#00#, 16#07#, 16#C0#, 16#07#, 16#80#, 16#00#, 16#01#, 16#E0#,
16#01#, 16#E0#, 16#00#, 16#00#, 16#78#, 16#00#, 16#78#, 16#00#, 16#00#,
16#1E#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#0F#, 16#80#,
16#00#, 16#00#, 16#F0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#3C#, 16#01#,
16#F0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#FC#, 16#00#, 16#00#, 16#01#,
16#F0#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#80#, 16#00#,
16#00#, 16#03#, 16#E3#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#,
16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#,
16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#01#,
16#F0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#,
16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#,
16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#,
16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#,
16#06#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#,
16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#00#,
16#07#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#07#,
16#E0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#,
16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#00#,
16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#00#,
16#00#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#7F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#04#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#FF#,
16#FF#, 16#FF#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#00#,
16#00#, 16#3F#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#0F#, 16#FF#, 16#FF#,
16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#,
16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F8#,
16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#00#, 16#00#,
16#07#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#00#,
16#00#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#00#,
16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#,
16#00#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#3F#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#00#,
16#3F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#00#,
16#00#, 16#7F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#,
16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#,
16#00#, 16#38#, 16#70#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#0E#, 16#00#,
16#00#, 16#00#, 16#07#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#C0#,
16#70#, 16#00#, 16#00#, 16#00#, 16#70#, 16#1C#, 16#00#, 16#00#, 16#00#,
16#1C#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#,
16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#,
16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#,
16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#, 16#00#, 16#30#,
16#00#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#,
16#06#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#20#, 16#00#,
16#00#, 16#00#, 16#00#, 16#08#, 16#00#, 16#00#, 16#00#, 16#00#, 16#04#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#,
16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#,
16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#,
16#E0#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#3E#, 16#00#, 16#00#, 16#03#,
16#C0#, 16#01#, 16#C0#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#3C#, 16#00#,
16#00#, 16#F0#, 16#00#, 16#07#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#,
16#E0#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#1E#, 16#00#,
16#7C#, 16#03#, 16#00#, 16#07#, 16#80#, 16#3F#, 16#F8#, 16#60#, 16#03#,
16#C0#, 16#1E#, 16#3E#, 16#18#, 16#00#, 16#F0#, 16#0E#, 16#0F#, 16#06#,
16#00#, 16#3C#, 16#07#, 16#83#, 16#C1#, 16#80#, 16#1E#, 16#03#, 16#C0#,
16#F0#, 16#30#, 16#07#, 16#80#, 16#E0#, 16#3C#, 16#0C#, 16#01#, 16#E0#,
16#38#, 16#0E#, 16#02#, 16#00#, 16#78#, 16#1C#, 16#03#, 16#81#, 16#80#,
16#1E#, 16#07#, 16#00#, 16#E0#, 16#60#, 16#07#, 16#81#, 16#C0#, 16#78#,
16#18#, 16#01#, 16#E0#, 16#70#, 16#1C#, 16#06#, 16#00#, 16#38#, 16#1C#,
16#07#, 16#03#, 16#00#, 16#0F#, 16#07#, 16#03#, 16#C0#, 16#C0#, 16#03#,
16#C1#, 16#E1#, 16#F0#, 16#60#, 16#00#, 16#70#, 16#78#, 16#DC#, 16#30#,
16#00#, 16#1E#, 16#0F#, 16#E3#, 16#F8#, 16#00#, 16#03#, 16#C1#, 16#E0#,
16#78#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#,
16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#7C#, 16#00#, 16#04#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#1F#,
16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#03#,
16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#,
16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#,
16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#00#,
16#0F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#06#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#01#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#CF#, 16#80#,
16#00#, 16#00#, 16#00#, 16#63#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#18#,
16#78#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#1E#, 16#00#, 16#00#, 16#00#,
16#02#, 16#07#, 16#80#, 16#00#, 16#00#, 16#01#, 16#81#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#C0#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#30#, 16#1F#,
16#00#, 16#00#, 16#00#, 16#18#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#07#,
16#FF#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FC#, 16#00#, 16#00#,
16#00#, 16#80#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#60#, 16#03#, 16#E0#,
16#00#, 16#00#, 16#30#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#0C#, 16#00#,
16#3E#, 16#00#, 16#00#, 16#06#, 16#00#, 16#07#, 16#80#, 16#00#, 16#01#,
16#80#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#78#, 16#00#,
16#00#, 16#70#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#07#,
16#C0#, 16#00#, 16#1F#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#0F#, 16#F8#,
16#07#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#03#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#E0#,
16#00#, 16#00#, 16#03#, 16#E0#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#F8#,
16#0F#, 16#80#, 16#00#, 16#00#, 16#3E#, 16#01#, 16#F0#, 16#00#, 16#00#,
16#0F#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#1F#, 16#00#,
16#00#, 16#01#, 16#F0#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#78#, 16#01#,
16#F0#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#78#, 16#00#, 16#00#, 16#0F#,
16#80#, 16#3E#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#1F#, 16#00#, 16#00#,
16#00#, 16#F0#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FE#, 16#00#,
16#00#, 16#00#, 16#1F#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#07#, 16#81#,
16#F8#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#1F#, 16#00#, 16#00#, 16#00#,
16#F8#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#F8#, 16#00#,
16#00#, 16#0F#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#07#,
16#C0#, 16#00#, 16#01#, 16#F0#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#7C#,
16#00#, 16#FC#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#3E#, 16#00#, 16#00#,
16#0F#, 16#80#, 16#0F#, 16#80#, 16#00#, 16#03#, 16#E0#, 16#07#, 16#E0#,
16#00#, 16#00#, 16#F0#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#3C#, 16#01#,
16#F8#, 16#00#, 16#00#, 16#1F#, 16#81#, 16#FC#, 16#00#, 16#00#, 16#0F#,
16#FF#, 16#FC#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#FC#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#01#, 16#FE#, 16#08#, 16#00#, 16#00#, 16#03#, 16#FF#,
16#FE#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#3F#, 16#80#, 16#00#, 16#01#,
16#F0#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#78#, 16#00#,
16#00#, 16#F8#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#03#,
16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#0F#, 16#80#,
16#00#, 16#10#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#04#, 16#00#, 16#01#,
16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#,
16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#,
16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#,
16#3F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#,
16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#,
16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#,
16#80#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#,
16#20#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#18#, 16#00#, 16#00#, 16#F8#,
16#00#, 16#0C#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#06#, 16#00#, 16#00#,
16#07#, 16#E0#, 16#07#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#07#, 16#00#,
16#00#, 16#00#, 16#0F#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#FF#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#,
16#1F#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#3F#, 16#00#,
16#00#, 16#00#, 16#F8#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#3E#, 16#00#,
16#7C#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#07#,
16#C0#, 16#01#, 16#F0#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#7C#, 16#00#,
16#00#, 16#7C#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#1E#, 16#00#, 16#03#,
16#E0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#F8#, 16#00#, 16#03#, 16#E0#,
16#00#, 16#3E#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#0F#, 16#80#, 16#00#,
16#7C#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#F8#,
16#00#, 16#07#, 16#C0#, 16#00#, 16#3E#, 16#00#, 16#01#, 16#E0#, 16#00#,
16#0F#, 16#80#, 16#00#, 16#F8#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#3E#,
16#00#, 16#01#, 16#F0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#7C#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#3F#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#0F#,
16#80#, 16#00#, 16#7C#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#1E#, 16#00#,
16#03#, 16#F0#, 16#00#, 16#0F#, 16#80#, 16#01#, 16#F8#, 16#00#, 16#03#,
16#E0#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#7E#, 16#00#,
16#00#, 16#3C#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#FE#,
16#00#, 16#00#, 16#0F#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#0F#, 16#FF#,
16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#03#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#FF#,
16#00#, 16#00#, 16#03#, 16#E0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#F8#,
16#00#, 16#60#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#18#, 16#00#, 16#00#,
16#0F#, 16#00#, 16#06#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#01#, 16#80#,
16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#,
16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#80#, 16#00#, 16#00#, 16#0F#,
16#80#, 16#60#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#10#, 16#00#, 16#00#,
16#00#, 16#F0#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#00#,
16#00#, 16#00#, 16#1F#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#07#, 16#80#,
16#E0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#18#, 16#00#, 16#00#, 16#00#,
16#F8#, 16#06#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#01#, 16#00#, 16#00#,
16#00#, 16#0F#, 16#00#, 16#40#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#,
16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#01#, 16#80#, 16#00#,
16#0F#, 16#80#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#30#,
16#00#, 16#00#, 16#F0#, 16#00#, 16#38#, 16#00#, 16#00#, 16#3C#, 16#00#,
16#1E#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#3F#, 16#80#, 16#00#, 16#0F#,
16#FF#, 16#FF#, 16#C0#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FF#,
16#FC#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#03#,
16#F0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#60#, 16#00#,
16#00#, 16#3E#, 16#00#, 16#18#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#02#,
16#00#, 16#00#, 16#07#, 16#C0#, 16#01#, 16#80#, 16#00#, 16#01#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#,
16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#20#, 16#00#,
16#00#, 16#03#, 16#E0#, 16#18#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#0C#,
16#00#, 16#00#, 16#00#, 16#7C#, 16#07#, 16#00#, 16#00#, 16#00#, 16#1F#,
16#FF#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#E0#, 16#00#, 16#00#,
16#01#, 16#E0#, 16#38#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#06#, 16#00#,
16#00#, 16#00#, 16#3E#, 16#01#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#,
16#40#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#10#, 16#00#, 16#00#, 16#01#,
16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#,
16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#,
16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#,
16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#,
16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#0F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#,
16#FE#, 16#02#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#F1#, 16#80#, 16#00#,
16#03#, 16#F0#, 16#1F#, 16#C0#, 16#00#, 16#01#, 16#F0#, 16#01#, 16#F0#,
16#00#, 16#00#, 16#F0#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#78#, 16#00#,
16#0F#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#01#, 16#80#, 16#00#, 16#1F#,
16#00#, 16#00#, 16#60#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#08#, 16#00#,
16#07#, 16#C0#, 16#00#, 16#02#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#,
16#00#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#07#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#07#,
16#FF#, 16#C0#, 16#0F#, 16#C0#, 16#00#, 16#3F#, 16#80#, 16#03#, 16#E0#,
16#00#, 16#07#, 16#C0#, 16#00#, 16#F8#, 16#00#, 16#01#, 16#E0#, 16#00#,
16#3E#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#3E#,
16#00#, 16#03#, 16#E0#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#7C#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#1F#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#07#,
16#C0#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#1E#, 16#00#,
16#00#, 16#1F#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#03#, 16#E0#, 16#07#,
16#E0#, 16#00#, 16#00#, 16#7E#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#07#,
16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#03#, 16#FF#, 16#E0#, 16#7F#, 16#F0#, 16#00#, 16#1F#, 16#E0#, 16#07#,
16#F8#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#F8#,
16#00#, 16#3E#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#0F#, 16#80#, 16#00#,
16#0F#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#07#, 16#C0#, 16#01#, 16#F0#,
16#00#, 16#01#, 16#F0#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#7C#, 16#00#,
16#1F#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#07#, 16#80#, 16#00#, 16#0F#,
16#80#, 16#03#, 16#E0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#F8#, 16#00#,
16#00#, 16#F0#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#0F#,
16#00#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#07#, 16#FF#,
16#FF#, 16#F0#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#78#, 16#00#, 16#00#,
16#F8#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#0F#, 16#80#,
16#00#, 16#0F#, 16#80#, 16#03#, 16#C0#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#F0#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#7C#,
16#00#, 16#1F#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#07#, 16#80#, 16#00#,
16#0F#, 16#80#, 16#03#, 16#E0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#F8#,
16#00#, 16#00#, 16#F8#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#3C#, 16#00#,
16#0F#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#0F#,
16#E0#, 16#03#, 16#F8#, 16#00#, 16#0F#, 16#FF#, 16#07#, 16#FF#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#03#,
16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#,
16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#,
16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#,
16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#,
16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#,
16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#,
16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#,
16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#01#,
16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#,
16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#,
16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#,
16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#0F#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FE#, 16#00#, 16#00#, 16#00#,
16#00#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#,
16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#,
16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#,
16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#,
16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#,
16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#,
16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#01#,
16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#,
16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#,
16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#,
16#1F#, 16#00#, 16#00#, 16#00#, 16#07#, 16#07#, 16#80#, 16#00#, 16#00#,
16#03#, 16#C3#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#3E#, 16#78#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FC#,
16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#01#, 16#FF#, 16#E1#, 16#FF#, 16#C0#, 16#00#, 16#1F#, 16#E0#, 16#0F#,
16#C0#, 16#00#, 16#03#, 16#F0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#F8#,
16#01#, 16#E0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#0F#, 16#00#, 16#70#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#38#, 16#00#,
16#00#, 16#01#, 16#F0#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#1C#,
16#00#, 16#00#, 16#00#, 16#1E#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#0F#,
16#87#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E7#, 16#00#, 16#00#, 16#00#,
16#00#, 16#F3#, 16#80#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#1F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FE#,
16#00#, 16#00#, 16#00#, 16#01#, 16#E7#, 16#C0#, 16#00#, 16#00#, 16#00#,
16#F8#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#3E#, 16#00#, 16#00#,
16#00#, 16#0F#, 16#87#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#C1#, 16#F0#,
16#00#, 16#00#, 16#01#, 16#F0#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#7C#,
16#0F#, 16#80#, 16#00#, 16#00#, 16#1E#, 16#01#, 16#F0#, 16#00#, 16#00#,
16#0F#, 16#80#, 16#3C#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#0F#, 16#80#,
16#00#, 16#00#, 16#F8#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#3C#, 16#00#,
16#7C#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#0F#,
16#E0#, 16#07#, 16#F0#, 16#00#, 16#0F#, 16#FF#, 16#0F#, 16#FF#, 16#80#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#03#,
16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#,
16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#,
16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#,
16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#,
16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#,
16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#,
16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#,
16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#01#,
16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#06#, 16#00#,
16#00#, 16#1E#, 16#00#, 16#01#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#,
16#C0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#30#, 16#00#, 16#00#, 16#F0#,
16#00#, 16#18#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#0E#, 16#00#, 16#00#,
16#1F#, 16#80#, 16#1F#, 16#80#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 16#C0#,
16#00#, 16#0F#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#3F#, 16#C0#,
16#0F#, 16#C0#, 16#00#, 16#1F#, 16#C0#, 16#01#, 16#F0#, 16#00#, 16#0F#,
16#E0#, 16#00#, 16#FC#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#3F#, 16#00#,
16#01#, 16#FC#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#FF#, 16#00#, 16#03#,
16#F0#, 16#00#, 16#37#, 16#80#, 16#01#, 16#BC#, 16#00#, 16#19#, 16#E0#,
16#00#, 16#6F#, 16#80#, 16#0E#, 16#F8#, 16#00#, 16#1B#, 16#E0#, 16#03#,
16#3E#, 16#00#, 16#0E#, 16#78#, 16#01#, 16#8F#, 16#00#, 16#03#, 16#1E#,
16#00#, 16#E7#, 16#C0#, 16#00#, 16#C7#, 16#80#, 16#31#, 16#F0#, 16#00#,
16#31#, 16#E0#, 16#18#, 16#7C#, 16#00#, 16#18#, 16#78#, 16#0E#, 16#1E#,
16#00#, 16#06#, 16#1E#, 16#03#, 16#0F#, 16#80#, 16#01#, 16#87#, 16#81#,
16#83#, 16#E0#, 16#00#, 16#E1#, 16#F0#, 16#E0#, 16#F0#, 16#00#, 16#30#,
16#7C#, 16#30#, 16#3C#, 16#00#, 16#0C#, 16#0F#, 16#18#, 16#1F#, 16#00#,
16#03#, 16#03#, 16#CE#, 16#07#, 16#C0#, 16#01#, 16#C0#, 16#F3#, 16#01#,
16#E0#, 16#00#, 16#60#, 16#3D#, 16#80#, 16#F8#, 16#00#, 16#18#, 16#0F#,
16#E0#, 16#3E#, 16#00#, 16#0E#, 16#03#, 16#F0#, 16#0F#, 16#00#, 16#03#,
16#00#, 16#F8#, 16#03#, 16#C0#, 16#00#, 16#C0#, 16#3E#, 16#01#, 16#F0#,
16#00#, 16#70#, 16#0F#, 16#00#, 16#7C#, 16#00#, 16#1C#, 16#01#, 16#80#,
16#3F#, 16#00#, 16#0F#, 16#80#, 16#60#, 16#1F#, 16#C0#, 16#0F#, 16#F8#,
16#10#, 16#1F#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#03#, 16#FC#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#3F#, 16#80#, 16#03#,
16#F0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#70#, 16#00#, 16#00#, 16#F8#,
16#00#, 16#1C#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#06#, 16#00#, 16#00#,
16#0F#, 16#C0#, 16#01#, 16#80#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#E0#,
16#00#, 16#01#, 16#BE#, 16#00#, 16#30#, 16#00#, 16#00#, 16#67#, 16#80#,
16#0C#, 16#00#, 16#00#, 16#19#, 16#F0#, 16#03#, 16#00#, 16#00#, 16#0E#,
16#3C#, 16#01#, 16#C0#, 16#00#, 16#03#, 16#0F#, 16#80#, 16#60#, 16#00#,
16#00#, 16#C1#, 16#E0#, 16#18#, 16#00#, 16#00#, 16#30#, 16#7C#, 16#0E#,
16#00#, 16#00#, 16#18#, 16#1F#, 16#03#, 16#00#, 16#00#, 16#06#, 16#03#,
16#C0#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#F8#, 16#30#, 16#00#, 16#00#,
16#E0#, 16#1E#, 16#1C#, 16#00#, 16#00#, 16#30#, 16#07#, 16#C6#, 16#00#,
16#00#, 16#0C#, 16#01#, 16#F1#, 16#80#, 16#00#, 16#03#, 16#00#, 16#3C#,
16#60#, 16#00#, 16#01#, 16#C0#, 16#0F#, 16#B0#, 16#00#, 16#00#, 16#60#,
16#01#, 16#EC#, 16#00#, 16#00#, 16#18#, 16#00#, 16#7F#, 16#00#, 16#00#,
16#0E#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#03#, 16#E0#,
16#00#, 16#00#, 16#C0#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#70#, 16#00#,
16#1E#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#07#, 16#00#, 16#00#, 16#0F#,
16#80#, 16#00#, 16#C0#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#30#, 16#00#,
16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#,
16#E0#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#7C#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#F0#, 16#00#,
16#00#, 16#7C#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#0F#,
16#80#, 16#00#, 16#1F#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#0F#, 16#80#,
16#00#, 16#78#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#1F#, 16#00#, 16#01#,
16#F0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#FC#, 16#00#, 16#01#, 16#F0#,
16#00#, 16#3E#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#1F#, 16#80#, 16#00#,
16#3F#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#0F#, 16#80#, 16#01#, 16#F0#,
16#00#, 16#03#, 16#E0#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#F8#, 16#00#,
16#3F#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#1F#,
16#00#, 16#03#, 16#E0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#F8#, 16#00#,
16#03#, 16#E0#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#0F#,
16#80#, 16#00#, 16#7C#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#1F#, 16#00#,
16#00#, 16#F8#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#3E#, 16#00#, 16#03#,
16#C0#, 16#00#, 16#07#, 16#80#, 16#01#, 16#E0#, 16#00#, 16#01#, 16#E0#,
16#00#, 16#F8#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#78#, 16#00#, 16#00#,
16#0F#, 16#80#, 16#7C#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#7E#, 16#00#,
16#00#, 16#00#, 16#1F#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FC#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#00#,
16#1F#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#7E#, 16#00#,
16#00#, 16#00#, 16#F8#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#3E#, 16#01#,
16#F0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#07#,
16#C0#, 16#0F#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#7C#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#7C#,
16#00#, 16#00#, 16#0F#, 16#80#, 16#1F#, 16#00#, 16#00#, 16#03#, 16#E0#,
16#07#, 16#80#, 16#00#, 16#00#, 16#F0#, 16#03#, 16#E0#, 16#00#, 16#00#,
16#7C#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#1F#, 16#01#, 16#F8#, 16#00#,
16#00#, 16#07#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#01#, 16#EF#, 16#F8#,
16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#,
16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#,
16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#03#,
16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#,
16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#,
16#00#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#,
16#00#, 16#01#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#7C#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#78#,
16#00#, 16#F0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#3C#, 16#00#, 16#00#,
16#3E#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#1F#, 16#00#, 16#01#, 16#E0#,
16#00#, 16#07#, 16#80#, 16#00#, 16#78#, 16#00#, 16#03#, 16#E0#, 16#00#,
16#1F#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#7C#,
16#00#, 16#01#, 16#F0#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#7C#, 16#00#,
16#0F#, 16#80#, 16#00#, 16#3F#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#0F#,
16#C0#, 16#01#, 16#F0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#FC#, 16#00#,
16#00#, 16#F8#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#0F#,
16#80#, 16#00#, 16#1F#, 16#80#, 16#03#, 16#E0#, 16#00#, 16#07#, 16#C0#,
16#00#, 16#F8#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#3E#, 16#00#, 16#00#,
16#F8#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#3E#, 16#00#, 16#03#, 16#E0#,
16#00#, 16#1F#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#07#, 16#80#, 16#00#,
16#3E#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#0F#, 16#80#, 16#01#, 16#F0#,
16#00#, 16#01#, 16#E0#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#7C#, 16#00#,
16#7C#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#01#,
16#E0#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#3E#, 16#00#, 16#00#,
16#00#, 16#03#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#,
16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#01#, 16#00#, 16#00#, 16#1C#,
16#00#, 16#00#, 16#C0#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#60#, 16#00#,
16#07#, 16#FF#, 16#C0#, 16#70#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#F8#,
16#00#, 16#03#, 16#03#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#07#,
16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FE#,
16#00#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#03#,
16#E0#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#0F#, 16#80#, 16#00#,
16#00#, 16#3E#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#7C#,
16#00#, 16#00#, 16#07#, 16#C0#, 16#1F#, 16#00#, 16#00#, 16#01#, 16#F0#,
16#07#, 16#C0#, 16#00#, 16#00#, 16#78#, 16#01#, 16#F0#, 16#00#, 16#00#,
16#1E#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#3E#, 16#00#,
16#00#, 16#03#, 16#C0#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#1F#,
16#80#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#1F#,
16#FF#, 16#00#, 16#00#, 16#00#, 16#07#, 16#87#, 16#80#, 16#00#, 16#00#,
16#01#, 16#E1#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#7C#, 16#00#,
16#00#, 16#00#, 16#3E#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#03#,
16#E0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#F8#, 16#00#, 16#00#, 16#01#,
16#F0#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#07#, 16#C0#, 16#00#,
16#00#, 16#1E#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#3E#,
16#00#, 16#00#, 16#03#, 16#E0#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#F8#,
16#01#, 16#E0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#7C#, 16#00#, 16#00#,
16#1F#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#03#, 16#E0#,
16#00#, 16#0F#, 16#FE#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7E#,
16#08#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FE#, 16#00#, 16#00#, 16#00#,
16#3C#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#1E#, 16#01#, 16#C0#, 16#00#,
16#00#, 16#0F#, 16#00#, 16#70#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#0C#,
16#00#, 16#00#, 16#01#, 16#F0#, 16#03#, 16#00#, 16#00#, 16#00#, 16#7C#,
16#00#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#20#, 16#00#, 16#00#,
16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#,
16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#,
16#3F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#80#,
16#00#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#7E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#,
16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#,
16#00#, 16#04#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#01#, 16#00#, 16#07#,
16#80#, 16#00#, 16#00#, 16#60#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#18#,
16#00#, 16#78#, 16#00#, 16#00#, 16#06#, 16#00#, 16#1E#, 16#00#, 16#00#,
16#01#, 16#C0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#07#, 16#80#,
16#00#, 16#00#, 16#3F#, 16#83#, 16#C0#, 16#00#, 16#00#, 16#08#, 16#FF#,
16#E0#, 16#00#, 16#00#, 16#02#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#03#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#FF#,
16#80#, 16#00#, 16#3C#, 16#0F#, 16#81#, 16#E0#, 16#00#, 16#1C#, 16#03#,
16#E0#, 16#38#, 16#00#, 16#06#, 16#00#, 16#F8#, 16#0C#, 16#00#, 16#01#,
16#80#, 16#7C#, 16#01#, 16#00#, 16#00#, 16#40#, 16#1F#, 16#00#, 16#40#,
16#00#, 16#20#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#,
16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#,
16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#,
16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#,
16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#,
16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#01#,
16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#,
16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#,
16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#,
16#7F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FC#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#E0#,
16#1F#, 16#F0#, 16#00#, 16#1F#, 16#E0#, 16#01#, 16#F8#, 16#00#, 16#03#,
16#F0#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#0E#, 16#00#,
16#00#, 16#3E#, 16#00#, 16#03#, 16#80#, 16#00#, 16#0F#, 16#00#, 16#00#,
16#C0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#30#, 16#00#, 16#01#, 16#F0#,
16#00#, 16#1C#, 16#00#, 16#00#, 16#78#, 16#00#, 16#06#, 16#00#, 16#00#,
16#1E#, 16#00#, 16#01#, 16#80#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#60#,
16#00#, 16#03#, 16#E0#, 16#00#, 16#38#, 16#00#, 16#00#, 16#F0#, 16#00#,
16#0C#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#03#, 16#00#, 16#00#, 16#1F#,
16#00#, 16#00#, 16#C0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#60#, 16#00#,
16#01#, 16#E0#, 16#00#, 16#18#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#06#,
16#00#, 16#00#, 16#3E#, 16#00#, 16#01#, 16#80#, 16#00#, 16#0F#, 16#80#,
16#00#, 16#C0#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#30#, 16#00#, 16#00#,
16#F0#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#06#, 16#00#,
16#00#, 16#1F#, 16#00#, 16#01#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#,
16#E0#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#30#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#1C#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#0E#, 16#00#, 16#00#,
16#01#, 16#E0#, 16#07#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#07#, 16#80#,
16#00#, 16#00#, 16#07#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#3F#,
16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#80#, 16#3F#, 16#E0#, 16#00#,
16#3F#, 16#80#, 16#03#, 16#E0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#70#,
16#00#, 16#01#, 16#F0#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#7C#, 16#00#,
16#0E#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#03#, 16#00#, 16#00#, 16#07#,
16#C0#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#60#, 16#00#,
16#00#, 16#3C#, 16#00#, 16#38#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#0C#,
16#00#, 16#00#, 16#03#, 16#E0#, 16#06#, 16#00#, 16#00#, 16#00#, 16#F8#,
16#01#, 16#80#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#C0#, 16#00#, 16#00#,
16#07#, 16#80#, 16#70#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#18#, 16#00#,
16#00#, 16#00#, 16#78#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#03#,
16#00#, 16#00#, 16#00#, 16#07#, 16#C1#, 16#80#, 16#00#, 16#00#, 16#01#,
16#F0#, 16#60#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#30#, 16#00#, 16#00#,
16#00#, 16#0F#, 16#18#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C6#, 16#00#,
16#00#, 16#00#, 16#00#, 16#F3#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#,
16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#,
16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#60#, 16#00#, 16#00#, 16#00#, 16#00#, 16#08#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#03#, 16#FF#, 16#8F#, 16#FE#, 16#07#, 16#C0#, 16#3F#, 16#80#, 16#FE#,
16#00#, 16#70#, 16#07#, 16#C0#, 16#1F#, 16#00#, 16#0C#, 16#01#, 16#F0#,
16#07#, 16#C0#, 16#03#, 16#00#, 16#7C#, 16#00#, 16#F0#, 16#01#, 16#C0#,
16#1F#, 16#00#, 16#3C#, 16#00#, 16#60#, 16#03#, 16#C0#, 16#0F#, 16#00#,
16#38#, 16#00#, 16#F0#, 16#03#, 16#C0#, 16#0C#, 16#00#, 16#3C#, 16#01#,
16#F0#, 16#07#, 16#00#, 16#0F#, 16#00#, 16#7C#, 16#01#, 16#80#, 16#03#,
16#C0#, 16#3F#, 16#80#, 16#E0#, 16#00#, 16#F0#, 16#0F#, 16#E0#, 16#30#,
16#00#, 16#3E#, 16#06#, 16#F8#, 16#1C#, 16#00#, 16#0F#, 16#81#, 16#9E#,
16#06#, 16#00#, 16#01#, 16#E0#, 16#C7#, 16#83#, 16#80#, 16#00#, 16#78#,
16#31#, 16#E0#, 16#C0#, 16#00#, 16#1E#, 16#18#, 16#78#, 16#70#, 16#00#,
16#07#, 16#86#, 16#1E#, 16#18#, 16#00#, 16#01#, 16#E3#, 16#07#, 16#8C#,
16#00#, 16#00#, 16#78#, 16#C1#, 16#E3#, 16#00#, 16#00#, 16#1E#, 16#60#,
16#7D#, 16#80#, 16#00#, 16#07#, 16#D8#, 16#1F#, 16#60#, 16#00#, 16#00#,
16#FC#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#FC#, 16#00#,
16#00#, 16#0F#, 16#80#, 16#3E#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#0F#,
16#80#, 16#00#, 16#00#, 16#F0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#F0#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#38#, 16#00#, 16#00#,
16#03#, 16#80#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#03#, 16#00#,
16#00#, 16#00#, 16#10#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#83#,
16#FF#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#3F#, 16#80#, 16#00#, 16#07#,
16#C0#, 16#07#, 16#80#, 16#00#, 16#01#, 16#F0#, 16#01#, 16#C0#, 16#00#,
16#00#, 16#3C#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#70#,
16#00#, 16#00#, 16#03#, 16#E0#, 16#18#, 16#00#, 16#00#, 16#00#, 16#7C#,
16#0C#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#07#, 16#00#, 16#00#, 16#00#,
16#03#, 16#C3#, 16#80#, 16#00#, 16#00#, 16#00#, 16#F9#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#3E#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#,
16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#,
16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FC#, 16#00#,
16#00#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#73#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#38#, 16#F8#, 16#00#, 16#00#, 16#00#,
16#0C#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#06#, 16#07#, 16#C0#, 16#00#,
16#00#, 16#03#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#3C#,
16#00#, 16#00#, 16#00#, 16#E0#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#70#,
16#03#, 16#E0#, 16#00#, 16#00#, 16#38#, 16#00#, 16#7C#, 16#00#, 16#00#,
16#1E#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#0F#, 16#F0#,
16#00#, 16#0F#, 16#FC#, 16#1F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#81#, 16#FE#, 16#00#, 16#00#,
16#3F#, 16#80#, 16#1F#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#03#, 16#80#,
16#00#, 16#01#, 16#F0#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#3C#, 16#00#,
16#70#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#38#, 16#00#, 16#00#, 16#03#,
16#E0#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#06#, 16#00#, 16#00#,
16#00#, 16#1E#, 16#03#, 16#00#, 16#00#, 16#00#, 16#07#, 16#81#, 16#C0#,
16#00#, 16#00#, 16#01#, 16#F0#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#30#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#18#, 16#00#, 16#00#, 16#00#,
16#03#, 16#EC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#,
16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#,
16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#,
16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#,
16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#00#,
16#00#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#7F#,
16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#03#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#FC#,
16#00#, 16#00#, 16#7C#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#1C#, 16#00#,
16#1F#, 16#80#, 16#00#, 16#04#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#03#,
16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#80#, 16#01#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7E#,
16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#,
16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#,
16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#,
16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#,
16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#,
16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#,
16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#01#, 16#00#, 16#00#,
16#07#, 16#C0#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#20#,
16#00#, 16#01#, 16#F0#, 16#00#, 16#18#, 16#00#, 16#00#, 16#F8#, 16#00#,
16#0E#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#1F#,
16#FF#, 16#FF#, 16#C0#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#,
16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#,
16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#,
16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#,
16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#,
16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#,
16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#,
16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#,
16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#,
16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#,
16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#,
16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#,
16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#,
16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#,
16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#,
16#00#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#,
16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#,
16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#,
16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#,
16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#,
16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#,
16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#,
16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#,
16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#,
16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#,
16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#00#,
16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#,
16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#,
16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#,
16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#,
16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#,
16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#,
16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#,
16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#,
16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#,
16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#,
16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#,
16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#,
16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#,
16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#,
16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#,
16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#,
16#80#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#F0#, 16#00#, 16#00#, 16#00#,
16#03#, 16#9C#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C7#, 16#80#, 16#00#,
16#00#, 16#00#, 16#70#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#38#, 16#3C#,
16#00#, 16#00#, 16#00#, 16#0E#, 16#07#, 16#00#, 16#00#, 16#00#, 16#07#,
16#81#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#38#, 16#00#, 16#00#,
16#00#, 16#F0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#38#, 16#01#, 16#C0#,
16#00#, 16#00#, 16#1E#, 16#00#, 16#78#, 16#00#, 16#00#, 16#07#, 16#00#,
16#0E#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FF#,
16#FC#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#,
16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#,
16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F3#, 16#C0#, 16#00#,
16#00#, 16#01#, 16#C2#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#78#,
16#00#, 16#00#, 16#00#, 16#70#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#38#,
16#07#, 16#80#, 16#00#, 16#00#, 16#1C#, 16#01#, 16#C0#, 16#00#, 16#00#,
16#0F#, 16#00#, 16#70#, 16#00#, 16#00#, 16#03#, 16#80#, 16#1C#, 16#00#,
16#00#, 16#01#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#03#,
16#80#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#0F#,
16#00#, 16#78#, 16#00#, 16#00#, 16#07#, 16#80#, 16#1E#, 16#00#, 16#00#,
16#01#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#78#, 16#03#, 16#C0#,
16#00#, 16#00#, 16#1E#, 16#01#, 16#70#, 16#00#, 16#00#, 16#07#, 16#80#,
16#BC#, 16#40#, 16#00#, 16#01#, 16#E0#, 16#4F#, 16#20#, 16#00#, 16#00#,
16#7C#, 16#23#, 16#90#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#F8#, 16#00#,
16#00#, 16#01#, 16#F0#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#,
16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#,
16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#,
16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#1F#,
16#E0#, 16#00#, 16#00#, 16#03#, 16#98#, 16#78#, 16#00#, 16#00#, 16#01#,
16#E4#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#7A#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#1D#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#80#, 16#3C#,
16#00#, 16#00#, 16#03#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#F0#,
16#03#, 16#C0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#1E#, 16#00#, 16#78#, 16#00#, 16#00#, 16#07#, 16#80#, 16#1E#, 16#00#,
16#00#, 16#01#, 16#E0#, 16#07#, 16#00#, 16#00#, 16#00#, 16#70#, 16#03#,
16#C0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#0F#,
16#00#, 16#78#, 16#00#, 16#00#, 16#03#, 16#80#, 16#3C#, 16#00#, 16#00#,
16#00#, 16#E0#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#78#, 16#07#, 16#00#,
16#00#, 16#00#, 16#1E#, 16#03#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C3#,
16#80#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#,
16#F8#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C3#, 16#80#, 16#00#, 16#00#,
16#01#, 16#C0#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#3C#, 16#00#,
16#00#, 16#00#, 16#70#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#,
16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#,
16#80#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#,
16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#,
16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#,
16#00#, 16#07#, 16#80#, 16#08#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#04#,
16#00#, 16#00#, 16#00#, 16#3C#, 16#02#, 16#00#, 16#00#, 16#00#, 16#0F#,
16#83#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#00#, 16#00#,
16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#,
16#80#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#,
16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#,
16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#,
16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F3#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#E2#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#78#,
16#00#, 16#00#, 16#00#, 16#70#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#38#,
16#07#, 16#80#, 16#00#, 16#00#, 16#1E#, 16#01#, 16#E0#, 16#00#, 16#00#,
16#07#, 16#00#, 16#70#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#1C#, 16#00#,
16#00#, 16#01#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#78#, 16#03#,
16#80#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#0F#,
16#00#, 16#78#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#1E#, 16#00#, 16#00#,
16#01#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#78#, 16#03#, 16#C0#,
16#00#, 16#00#, 16#1E#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#80#,
16#7C#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#2E#, 16#10#, 16#00#, 16#00#,
16#78#, 16#13#, 16#88#, 16#00#, 16#00#, 16#1F#, 16#18#, 16#E4#, 16#00#,
16#00#, 16#03#, 16#FC#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#0F#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E7#,
16#80#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#70#, 16#38#, 16#00#, 16#00#, 16#00#, 16#38#, 16#0E#, 16#00#, 16#00#,
16#00#, 16#1E#, 16#07#, 16#80#, 16#00#, 16#00#, 16#0F#, 16#01#, 16#C0#,
16#00#, 16#00#, 16#03#, 16#C0#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#E0#,
16#70#, 16#00#, 16#00#, 16#00#, 16#78#, 16#78#, 16#00#, 16#00#, 16#00#,
16#3C#, 16#78#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#,
16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#,
16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#08#, 16#00#, 16#00#,
16#01#, 16#F0#, 16#06#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#03#, 16#00#,
16#00#, 16#00#, 16#0F#, 16#83#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#,
16#80#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#01#, 16#8E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C7#, 16#80#,
16#00#, 16#00#, 16#00#, 16#70#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#18#,
16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#,
16#03#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#,
16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#,
16#80#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#00#, 16#00#, 16#00#,
16#07#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#,
16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#,
16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#,
16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#,
16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#,
16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#,
16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#,
16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#,
16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#,
16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#,
16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#07#, 16#8E#, 16#00#, 16#00#, 16#00#, 16#03#, 16#81#, 16#F8#,
16#00#, 16#00#, 16#01#, 16#C0#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#F0#,
16#1C#, 16#00#, 16#00#, 16#00#, 16#38#, 16#07#, 16#80#, 16#00#, 16#00#,
16#1E#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#80#, 16#78#, 16#00#,
16#00#, 16#01#, 16#E0#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#78#, 16#0F#,
16#00#, 16#00#, 16#00#, 16#1E#, 16#07#, 16#80#, 16#00#, 16#00#, 16#03#,
16#81#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#71#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#,
16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#00#,
16#1F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#00#, 16#00#,
16#00#, 16#01#, 16#1F#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#80#, 16#FC#,
16#00#, 16#00#, 16#00#, 16#C0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#30#,
16#01#, 16#E0#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#38#, 16#00#, 16#00#,
16#02#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#03#, 16#00#,
16#00#, 16#00#, 16#30#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#0E#, 16#00#,
16#E0#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#1F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#,
16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#,
16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#,
16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#0F#,
16#E0#, 16#00#, 16#00#, 16#03#, 16#86#, 16#78#, 16#00#, 16#00#, 16#01#,
16#E2#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#79#, 16#07#, 16#80#, 16#00#,
16#00#, 16#1C#, 16#81#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#40#, 16#70#,
16#00#, 16#00#, 16#03#, 16#D0#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F8#,
16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#03#, 16#C0#, 16#00#, 16#00#,
16#0F#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#80#, 16#78#, 16#00#,
16#00#, 16#01#, 16#E0#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#78#, 16#07#,
16#00#, 16#00#, 16#00#, 16#1C#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#0F#,
16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#3C#, 16#40#, 16#00#,
16#00#, 16#E0#, 16#0E#, 16#20#, 16#00#, 16#00#, 16#38#, 16#03#, 16#90#,
16#00#, 16#00#, 16#1E#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#80#,
16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#,
16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#,
16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#00#, 16#00#,
16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#,
16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#,
16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#,
16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#,
16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F1#, 16#00#,
16#00#, 16#00#, 16#00#, 16#38#, 16#80#, 16#00#, 16#00#, 16#00#, 16#0E#,
16#40#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#,
16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#,
16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#,
16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#,
16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#,
16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#,
16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#,
16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#,
16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#,
16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#,
16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#,
16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#,
16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#,
16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#,
16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#1F#,
16#F0#, 16#00#, 16#00#, 16#03#, 16#80#, 16#F0#, 16#00#, 16#00#, 16#01#,
16#E0#, 16#30#, 16#00#, 16#00#, 16#00#, 16#78#, 16#18#, 16#00#, 16#00#,
16#00#, 16#1C#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#07#, 16#0E#, 16#00#,
16#00#, 16#00#, 16#03#, 16#C6#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F3#,
16#00#, 16#00#, 16#00#, 16#00#, 16#39#, 16#80#, 16#00#, 16#00#, 16#00#,
16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#,
16#00#, 16#01#, 16#E7#, 16#80#, 16#00#, 16#00#, 16#00#, 16#71#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#1C#, 16#38#, 16#00#, 16#00#, 16#00#, 16#0F#,
16#0F#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C1#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#E0#, 16#78#, 16#40#, 16#00#, 16#00#, 16#78#, 16#0E#, 16#10#,
16#00#, 16#00#, 16#1E#, 16#03#, 16#C8#, 16#00#, 16#00#, 16#07#, 16#80#,
16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#07#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#,
16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#,
16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#,
16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#,
16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#,
16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#,
16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#,
16#00#, 16#03#, 16#C2#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E1#, 16#00#,
16#00#, 16#00#, 16#00#, 16#38#, 16#80#, 16#00#, 16#00#, 16#00#, 16#0E#,
16#40#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#0E#, 16#01#, 16#C0#,
16#00#, 16#FE#, 16#0F#, 16#C1#, 16#F8#, 16#00#, 16#07#, 16#84#, 16#F0#,
16#CF#, 16#00#, 16#01#, 16#E2#, 16#1C#, 16#43#, 16#C0#, 16#00#, 16#79#,
16#0F#, 16#20#, 16#E0#, 16#00#, 16#1C#, 16#83#, 16#D0#, 16#78#, 16#00#,
16#0F#, 16#40#, 16#E4#, 16#1E#, 16#00#, 16#03#, 16#D0#, 16#3A#, 16#07#,
16#80#, 16#00#, 16#F8#, 16#1F#, 16#01#, 16#C0#, 16#00#, 16#3C#, 16#07#,
16#40#, 16#F0#, 16#00#, 16#1F#, 16#01#, 16#E0#, 16#3C#, 16#00#, 16#07#,
16#80#, 16#78#, 16#0F#, 16#00#, 16#01#, 16#E0#, 16#3C#, 16#03#, 16#80#,
16#00#, 16#70#, 16#0F#, 16#01#, 16#E0#, 16#00#, 16#3C#, 16#03#, 16#80#,
16#78#, 16#00#, 16#0F#, 16#00#, 16#E0#, 16#1E#, 16#20#, 16#03#, 16#80#,
16#78#, 16#07#, 16#18#, 16#01#, 16#E0#, 16#1E#, 16#03#, 16#CC#, 16#00#,
16#78#, 16#07#, 16#00#, 16#F6#, 16#00#, 16#1E#, 16#01#, 16#C0#, 16#3F#,
16#00#, 16#07#, 16#00#, 16#F0#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#0F#,
16#C0#, 16#00#, 16#00#, 16#07#, 16#84#, 16#78#, 16#00#, 16#00#, 16#01#,
16#E2#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#79#, 16#07#, 16#80#, 16#00#,
16#00#, 16#1C#, 16#81#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#40#, 16#F0#,
16#00#, 16#00#, 16#03#, 16#D0#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#E8#,
16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#03#, 16#80#, 16#00#, 16#00#,
16#1F#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#80#, 16#78#, 16#00#,
16#00#, 16#01#, 16#E0#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#70#, 16#07#,
16#00#, 16#00#, 16#00#, 16#3C#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#,
16#00#, 16#F1#, 16#00#, 16#00#, 16#03#, 16#80#, 16#38#, 16#C0#, 16#00#,
16#00#, 16#E0#, 16#0E#, 16#20#, 16#00#, 16#00#, 16#78#, 16#07#, 16#90#,
16#00#, 16#00#, 16#1E#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#00#,
16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E3#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#E0#, 16#78#, 16#00#, 16#00#, 16#00#, 16#70#, 16#0E#, 16#00#,
16#00#, 16#00#, 16#38#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#1E#, 16#00#,
16#F0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#07#,
16#80#, 16#0F#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#F8#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#78#,
16#00#, 16#00#, 16#0F#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#07#, 16#C0#,
16#07#, 16#80#, 16#00#, 16#01#, 16#E0#, 16#03#, 16#C0#, 16#00#, 16#00#,
16#78#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#78#, 16#00#,
16#00#, 16#07#, 16#80#, 16#1C#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#0E#,
16#00#, 16#00#, 16#00#, 16#38#, 16#07#, 16#00#, 16#00#, 16#00#, 16#0F#,
16#03#, 16#80#, 16#00#, 16#00#, 16#01#, 16#E1#, 16#80#, 16#00#, 16#00#,
16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#3E#, 16#00#, 16#00#,
16#00#, 16#FF#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#9C#, 16#F8#,
16#00#, 16#00#, 16#00#, 16#EC#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#7C#,
16#07#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#07#, 16#80#, 16#3C#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#F0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#3C#, 16#01#,
16#F0#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#78#, 16#00#, 16#00#, 16#03#,
16#80#, 16#1E#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#07#, 16#80#, 16#00#,
16#00#, 16#78#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#E0#,
16#00#, 16#00#, 16#07#, 16#00#, 16#78#, 16#00#, 16#00#, 16#03#, 16#C0#,
16#3C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#0E#, 16#00#, 16#00#, 16#00#,
16#38#, 16#07#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#03#, 16#80#, 16#00#,
16#00#, 16#07#, 16#C3#, 16#80#, 16#00#, 16#00#, 16#01#, 16#EF#, 16#80#,
16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#,
16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#,
16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E3#,
16#70#, 16#00#, 16#00#, 16#00#, 16#60#, 16#7C#, 16#00#, 16#00#, 16#00#,
16#70#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#03#, 16#80#, 16#00#,
16#00#, 16#1E#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#00#, 16#78#,
16#00#, 16#00#, 16#03#, 16#C0#, 16#1E#, 16#00#, 16#00#, 16#01#, 16#E0#,
16#07#, 16#00#, 16#00#, 16#00#, 16#78#, 16#03#, 16#C0#, 16#00#, 16#00#,
16#3C#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#38#, 16#00#,
16#00#, 16#03#, 16#80#, 16#1E#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#07#,
16#80#, 16#00#, 16#00#, 16#78#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#1E#,
16#01#, 16#70#, 16#00#, 16#00#, 16#07#, 16#80#, 16#5C#, 16#00#, 16#00#,
16#01#, 16#E0#, 16#2F#, 16#00#, 16#00#, 16#00#, 16#78#, 16#13#, 16#80#,
16#00#, 16#00#, 16#1F#, 16#18#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#FC#,
16#78#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#1E#, 16#00#, 16#00#, 16#00#,
16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#,
16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#,
16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#38#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#1F#, 16#00#, 16#00#, 16#00#,
16#07#, 16#8F#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#E6#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#7B#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#80#,
16#00#, 16#00#, 16#00#, 16#07#, 16#40#, 16#00#, 16#00#, 16#00#, 16#01#,
16#D0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#,
16#00#, 16#3A#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#,
16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#,
16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#,
16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#,
16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#90#, 16#00#, 16#00#,
16#00#, 16#0E#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#07#, 16#07#, 16#00#,
16#00#, 16#00#, 16#01#, 16#C0#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#F0#,
16#30#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#04#, 16#00#, 16#00#, 16#00#,
16#0F#, 16#81#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#,
16#00#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#,
16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#40#, 16#78#, 16#00#,
16#00#, 16#00#, 16#10#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#04#, 16#03#,
16#80#, 16#00#, 16#00#, 16#01#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#E0#, 16#38#, 16#00#, 16#00#, 16#00#, 16#38#, 16#1C#, 16#00#, 16#00#,
16#00#, 16#0F#, 16#8E#, 16#00#, 16#00#, 16#00#, 16#02#, 16#3F#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#02#,
16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#,
16#00#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#3F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#,
16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#,
16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#,
16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#,
16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#,
16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#,
16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#,
16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C4#, 16#00#, 16#00#, 16#00#,
16#00#, 16#E1#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#80#, 16#00#,
16#00#, 16#00#, 16#1E#, 16#40#, 16#00#, 16#00#, 16#00#, 16#07#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#E0#, 16#00#, 16#00#,
16#3F#, 16#80#, 16#78#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#1E#, 16#00#,
16#00#, 16#00#, 16#70#, 16#07#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#03#,
16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#,
16#C0#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#1E#, 16#00#, 16#00#,
16#00#, 16#38#, 16#07#, 16#80#, 16#00#, 16#00#, 16#1E#, 16#03#, 16#E0#,
16#00#, 16#00#, 16#07#, 16#81#, 16#F8#, 16#00#, 16#00#, 16#01#, 16#C0#,
16#5C#, 16#00#, 16#00#, 16#00#, 16#70#, 16#2F#, 16#00#, 16#00#, 16#00#,
16#3C#, 16#0B#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#04#, 16#F0#, 16#00#,
16#00#, 16#03#, 16#82#, 16#38#, 16#00#, 16#00#, 16#00#, 16#E1#, 16#9E#,
16#20#, 16#00#, 16#00#, 16#38#, 16#47#, 16#98#, 16#00#, 16#00#, 16#1E#,
16#61#, 16#E4#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#7E#, 16#00#, 16#00#,
16#00#, 16#F0#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#03#, 16#00#, 16#00#,
16#00#, 16#FE#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#78#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#01#, 16#80#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#60#, 16#00#, 16#00#,
16#01#, 16#C0#, 16#18#, 16#00#, 16#00#, 16#00#, 16#70#, 16#0C#, 16#00#,
16#00#, 16#00#, 16#1C#, 16#03#, 16#00#, 16#00#, 16#00#, 16#07#, 16#01#,
16#80#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#40#, 16#00#, 16#00#, 16#00#,
16#78#, 16#30#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#08#, 16#00#, 16#00#,
16#00#, 16#07#, 16#84#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E2#, 16#00#,
16#00#, 16#00#, 16#00#, 16#39#, 16#80#, 16#00#, 16#00#, 16#00#, 16#0E#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#,
16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#02#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#38#, 16#00#, 16#80#, 16#E0#, 16#00#, 16#FE#, 16#00#,
16#60#, 16#3C#, 16#00#, 16#07#, 16#80#, 16#38#, 16#0F#, 16#00#, 16#00#,
16#E0#, 16#0E#, 16#01#, 16#C0#, 16#00#, 16#3C#, 16#07#, 16#80#, 16#30#,
16#00#, 16#0F#, 16#01#, 16#E0#, 16#08#, 16#00#, 16#03#, 16#C0#, 16#B8#,
16#02#, 16#00#, 16#00#, 16#F0#, 16#6E#, 16#01#, 16#00#, 16#00#, 16#1C#,
16#13#, 16#80#, 16#40#, 16#00#, 16#07#, 16#08#, 16#E0#, 16#20#, 16#00#,
16#01#, 16#C6#, 16#38#, 16#18#, 16#00#, 16#00#, 16#71#, 16#0F#, 16#04#,
16#00#, 16#00#, 16#1C#, 16#C3#, 16#C2#, 16#00#, 16#00#, 16#07#, 16#20#,
16#F1#, 16#80#, 16#00#, 16#01#, 16#F8#, 16#1C#, 16#C0#, 16#00#, 16#00#,
16#7C#, 16#07#, 16#20#, 16#00#, 16#00#, 16#1F#, 16#01#, 16#D8#, 16#00#,
16#00#, 16#07#, 16#80#, 16#7C#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#1E#,
16#00#, 16#00#, 16#00#, 16#70#, 16#07#, 16#00#, 16#00#, 16#00#, 16#18#,
16#01#, 16#80#, 16#00#, 16#00#, 16#06#, 16#00#, 16#40#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#,
16#07#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#83#, 16#E0#, 16#00#, 16#00#,
16#11#, 16#E1#, 16#38#, 16#00#, 16#00#, 16#00#, 16#78#, 16#80#, 16#00#,
16#00#, 16#00#, 16#0E#, 16#40#, 16#00#, 16#00#, 16#00#, 16#03#, 16#D0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#,
16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#,
16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#,
16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#,
16#80#, 16#00#, 16#00#, 16#00#, 16#02#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#01#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#CF#, 16#00#, 16#00#,
16#00#, 16#00#, 16#23#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#10#, 16#70#,
16#80#, 16#00#, 16#00#, 16#08#, 16#1C#, 16#40#, 16#00#, 16#00#, 16#32#,
16#07#, 16#B0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#F8#, 16#00#, 16#00#,
16#03#, 16#80#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#03#, 16#80#, 16#00#,
16#00#, 16#FF#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#7C#,
16#00#, 16#00#, 16#00#, 16#78#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1E#,
16#01#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#80#, 16#20#, 16#00#, 16#00#,
16#00#, 16#F0#, 16#08#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#06#, 16#00#,
16#00#, 16#00#, 16#07#, 16#01#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#,
16#40#, 16#00#, 16#00#, 16#00#, 16#78#, 16#20#, 16#00#, 16#00#, 16#00#,
16#1E#, 16#08#, 16#00#, 16#00#, 16#00#, 16#03#, 16#84#, 16#00#, 16#00#,
16#00#, 16#00#, 16#E3#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#80#,
16#00#, 16#00#, 16#00#, 16#0F#, 16#60#, 16#00#, 16#00#, 16#00#, 16#01#,
16#D0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#,
16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#,
16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#60#,
16#00#, 16#00#, 16#00#, 16#00#, 16#10#, 16#00#, 16#00#, 16#00#, 16#00#,
16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#02#, 16#00#, 16#00#, 16#00#,
16#00#, 16#01#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#80#, 16#00#,
16#00#, 16#00#, 16#00#, 16#40#, 16#00#, 16#00#, 16#00#, 16#07#, 16#20#,
16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#,
16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#02#,
16#00#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#80#, 16#60#, 16#00#, 16#00#,
16#00#, 16#40#, 16#30#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#,
16#00#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#,
16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#,
16#00#, 16#40#, 16#00#, 16#00#, 16#00#, 16#00#, 16#20#, 16#00#, 16#00#,
16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#,
16#00#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#80#, 16#00#, 16#00#, 16#00#,
16#00#, 16#40#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#,
16#00#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F8#,
16#38#, 16#00#, 16#00#, 16#02#, 16#3F#, 16#0E#, 16#00#, 16#00#, 16#00#,
16#03#, 16#C3#, 16#80#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#,
16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#,
16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#,
16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#,
16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#,
16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#,
16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#,
16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#,
16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#,
16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#,
16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#,
16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#,
16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#,
16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#,
16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#,
16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#,
16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#,
16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#,
16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#,
16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#,
16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#,
16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#,
16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#,
16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#,
16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#,
16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#,
16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#,
16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#,
16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#,
16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#,
16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#,
16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#,
16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#,
16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#,
16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#,
16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#,
16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#,
16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#,
16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#,
16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#,
16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#,
16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#,
16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#,
16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#,
16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#,
16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#03#,
16#FE#, 16#03#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#E1#, 16#E0#, 16#00#,
16#00#, 16#F0#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#18#, 16#0F#, 16#FC#,
16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#);
Font_D : aliased constant Bitmap_Font :=
(
Bytes_Per_Glyph => 294,
Glyph_Width => 42,
Glyph_Height => 56,
Data => FreeSerifItalic24pt7bBitmaps'Access);
Font : constant Bitmap_Font_Ref := Font_D'Access;
end GESTE_Fonts.FreeSerifItalic24pt7b;
|
package Garden_Pkg is
subtype Position is Positive range 1..10;
function GetRandPos return Position;
function GetField(pos : Position) return Boolean;
procedure SprayField(pos : Position);
procedure SprayAbsorbed;
private
type Fields is array(Integer range <>) of Boolean;
Garden : Fields(1..10) := (1..10 => false);
end Garden_Pkg;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . E X C E P T I O N S _ D E B U G --
-- --
-- S p e c --
-- --
-- Copyright (C) 2006-2015, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains internal routines used as debugger helpers.
-- It should be compiled without optimization to let debuggers inspect
-- parameter values reliably from breakpoints on the routines.
pragma Compiler_Unit_Warning;
with System.Standard_Library;
package System.Exceptions_Debug is
pragma Preelaborate;
-- To let Ada.Exceptions "with" us and let us "with" Standard_Library
package SSL renames System.Standard_Library;
-- To let some of the hooks below have formal parameters typed in
-- accordance with what GDB expects.
procedure Debug_Raise_Exception
(E : SSL.Exception_Data_Ptr; Message : String);
pragma Export
(Ada, Debug_Raise_Exception, "__gnat_debug_raise_exception");
-- Hook called at a "raise" point for an exception E, when it is
-- just about to be propagated.
procedure Debug_Unhandled_Exception (E : SSL.Exception_Data_Ptr);
pragma Export
(Ada, Debug_Unhandled_Exception, "__gnat_unhandled_exception");
-- Hook called during the propagation process of an exception E, as soon
-- as it is known to be unhandled.
procedure Debug_Raise_Assert_Failure;
pragma Export
(Ada, Debug_Raise_Assert_Failure, "__gnat_debug_raise_assert_failure");
-- Hook called when an assertion failed. This is used by the debugger to
-- intercept assertion failures, and treat them specially.
procedure Local_Raise (Excep : System.Address);
pragma Export (Ada, Local_Raise);
-- This is a dummy routine, used only by the debugger for the purpose of
-- logging local raise statements that were transformed into a direct goto
-- to the handler code. The compiler in this case generates:
--
-- Local_Raise (exception_data'address);
-- goto Handler
--
-- The argument is the address of the exception data
end System.Exceptions_Debug;
|
-- MIT License
-- Copyright (c) 2021 Stephen Merrony
-- Permission is hereby granted, free of charge, to any person obtaining a copy
-- of this software and associated documentation files (the "Software"), to deal
-- in the Software without restriction, including without limitation the rights
-- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-- copies of the Software, and to permit persons to whom the Software is
-- furnished to do so, subject to the following conditions:
-- The above copyright notice and this permission notice shall be included in all
-- copies or substantial portions of the Software.
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-- SOFTWARE.
with Ada.Text_IO; use Ada.Text_IO;
with Resolver; use Resolver;
package body Processor.Nova_PC_P is
procedure Do_Nova_PC (I : in Decoded_Instr_T; CPU : in out CPU_T) is
Ring_Mask : Phys_Addr_T := CPU.PC and 16#7000_0000#;
begin
case I.Instruction is
when I_JMP =>
CPU.PC := (Resolve_8bit_Disp (CPU, I.Ind, I.Mode, I.Disp_15) and 16#7fff#) or Ring_Mask;
when I_JSR =>
declare
Tmp_PC : Dword_T := Dword_T(CPU.PC) + 1;
begin
CPU.PC := (Resolve_8bit_Disp (CPU, I.Ind, I.Mode, I.Disp_15) and 16#7fff#) or Ring_Mask;
CPU.AC(3) := Tmp_PC;
end;
when others =>
Put_Line ("ERROR: Nova_PC instruction " & To_String(I.Mnemonic) &
" not yet implemented");
raise Execution_Failure with "ERROR: Nova_PC instruction " & To_String(I.Mnemonic) &
" not yet implemented";
end case;
end Do_Nova_PC;
end Processor.Nova_PC_P; |
with GNAT.String_Split;
with UxAS.Comms.Data.Addressed; use UxAS.Comms.Data.Addressed;
package body UxAS.Comms.Data is
--------------------
-- Set_Attributes --
--------------------
procedure Set_Attributes
(This : in out Message_Attributes;
Content_Type : String;
Descriptor : String;
Source_Group : String;
Source_Entity_Id : String;
Source_Service_Id : String;
Result : out Boolean)
is
begin
Result := False;
This.Is_Valid := False;
if Content_Type'Length = 0 then
return;
end if;
if Descriptor'Length = 0 then
return;
end if;
if Source_Entity_Id'Length = 0 then
return;
end if;
if Source_Service_Id'Length = 0 then
return;
end if;
Copy (Content_Type, To => This.Content_Type);
Copy (Descriptor, To => This.Descriptor);
Copy (Source_Group, To => This.Source_Group);
Copy (Source_Entity_Id, To => This.Source_Entity_Id);
Copy (Source_Service_Id, To => This.Source_Service_Id);
Copy (This.Content_Type & Addressed.Field_Delimiter &
This.Descriptor & Addressed.Field_Delimiter &
This.Source_Group & Addressed.Field_Delimiter &
This.Source_Entity_Id & Addressed.Field_Delimiter &
This.Source_Service_Id,
To => This.Content_String);
This.Is_Valid := True; -- already determined by preconditions...
Result := True;
end Set_Attributes;
------------------------------
-- Update_Source_Attributes --
------------------------------
procedure Update_Source_Attributes
(This : in out Message_Attributes;
Source_Group : String;
Source_Entity_Id : String;
Source_Service_Id : String;
Result : out Boolean)
is
begin
Copy (Source_Group, To => This.Source_Group);
Copy (Source_Entity_Id, To => This.Source_Entity_Id);
Copy (Source_Service_Id, To => This.Source_Service_Id);
Copy (This.Content_Type & Addressed.Field_Delimiter &
This.Descriptor & Addressed.Field_Delimiter &
This.Source_Group & Addressed.Field_Delimiter &
This.Source_Entity_Id & Addressed.Field_Delimiter &
This.Source_Service_Id & Addressed.Field_Delimiter,
To => This.Content_String);
This.Is_Valid := True; -- already determined by preconditions...
Result := True;
end Update_Source_Attributes;
------------------------------------------
-- Set_Attributes_From_Delimited_String --
------------------------------------------
procedure Set_Attributes_From_Delimited_String
(This : in out Message_Attributes;
Delimited_String : String;
Result : out Boolean)
is
begin
Parse_Message_Attributes_String_And_Set_Fields (This, Delimited_String, Result);
end Set_Attributes_From_Delimited_String;
--------------
-- Is_Valid --
--------------
function Is_Valid (This : Message_Attributes) return Boolean is
(This.Is_Valid);
--------------------------
-- Payload_Content_Type --
--------------------------
function Payload_Content_Type (This : Message_Attributes) return String is
(Value (This.Content_Type));
------------------------
-- Payload_Descriptor --
------------------------
function Payload_Descriptor (This : Message_Attributes) return String is
(Value (This.Descriptor));
------------------
-- Source_Group --
------------------
function Source_Group (This : Message_Attributes) return String is
(Value (This.Source_Group));
----------------------
-- Source_Entity_Id --
----------------------
function Source_Entity_Id (This : Message_Attributes) return String is
(Value (This.Source_Entity_Id));
-----------------------
-- Source_Service_Id --
-----------------------
function Source_Service_Id (This : Message_Attributes) return String is
(Value (This.Source_Service_Id));
--------------------
-- Content_String --
--------------------
function Content_String (This : Message_Attributes) return String is
(Value (This.Content_String));
----------------------------------------------------
-- Parse_Message_Attributes_String_And_Set_Fields --
----------------------------------------------------
procedure Parse_Message_Attributes_String_And_Set_Fields
(This : in out Message_Attributes;
Delimited_String : String;
Result : out Boolean)
is
use GNAT.String_Split;
Tokens : Slice_Set;
begin
Create (Tokens,
From => Delimited_String,
Separators => Field_Delimiter,
Mode => Single); -- contiguous delimiters are NOT treated as a single delimiter
if Slice_Count (Tokens) = Attribute_Count then
This.Set_Attributes
(Content_Type => Slice (Tokens, 1),
Descriptor => Slice (Tokens, 2),
Source_Group => Slice (Tokens, 3),
Source_Entity_Id => Slice (Tokens, 4),
Source_Service_Id => Slice (Tokens, 5),
Result => Result);
else
Result := False;
This.Is_Valid := False;
end if;
end Parse_Message_Attributes_String_And_Set_Fields;
end UxAS.Comms.Data;
|
<?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>zeropad2d_cl_array_array_ap_fixed_4u_config21_s</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>8</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>data_V_data_0_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>data.V.data[0].V</originalName>
<rtlName></rtlName>
<coreName>FIFO_SRL</coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>data_V_data_1_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>data.V.data[1].V</originalName>
<rtlName></rtlName>
<coreName>FIFO_SRL</coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>data_V_data_2_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>data.V.data[2].V</originalName>
<rtlName></rtlName>
<coreName>FIFO_SRL</coreName>
</Obj>
<bitwidth>8</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>data_V_data_3_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>data.V.data[3].V</originalName>
<rtlName></rtlName>
<coreName>FIFO_SRL</coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_5">
<Value>
<Obj>
<type>1</type>
<id>5</id>
<name>res_V_data_0_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>res.V.data[0].V</originalName>
<rtlName></rtlName>
<coreName>FIFO_SRL</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="_6">
<Value>
<Obj>
<type>1</type>
<id>6</id>
<name>res_V_data_1_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>res.V.data[1].V</originalName>
<rtlName></rtlName>
<coreName>FIFO_SRL</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="_7">
<Value>
<Obj>
<type>1</type>
<id>7</id>
<name>res_V_data_2_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>res.V.data[2].V</originalName>
<rtlName></rtlName>
<coreName>FIFO_SRL</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="_8">
<Value>
<Obj>
<type>1</type>
<id>8</id>
<name>res_V_data_3_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>res.V.data[3].V</originalName>
<rtlName></rtlName>
<coreName>FIFO_SRL</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>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>47</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>_ln56</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>56</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second class_id="11" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="12" tracking_level="0" version="0">
<first class_id="13" tracking_level="0" version="0">
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>56</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>103</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.76</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>j_0</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>6</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>105</item>
<item>106</item>
<item>107</item>
<item>108</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>icmp_ln56</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>56</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>56</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>109</item>
<item>111</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.42</m_delay>
<m_topoIndex>3</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>j</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>56</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>56</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>112</item>
<item>114</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.82</m_delay>
<m_topoIndex>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>_ln56</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>56</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>56</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>115</item>
<item>116</item>
<item>117</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>res_V_data_0_V_write_ln16</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>16</lineNumber>
<contextFuncName>fill_zero&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>fill_zero&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>16</second>
</item>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>57</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>9</count>
<item_version>0</item_version>
<item>119</item>
<item>120</item>
<item>121</item>
<item>122</item>
<item>123</item>
<item>125</item>
<item>126</item>
<item>127</item>
<item>128</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>3.63</m_delay>
<m_topoIndex>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>_ln56</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>56</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>56</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>129</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>7</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>_ln61</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>61</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>61</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>130</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>8</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>i1_0</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>6</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>131</item>
<item>132</item>
<item>133</item>
<item>134</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>9</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>icmp_ln61</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>61</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>61</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>135</item>
<item>137</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.42</m_delay>
<m_topoIndex>10</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>i_1</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>61</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>61</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>138</item>
<item>139</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.82</m_delay>
<m_topoIndex>11</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name>_ln61</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>61</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>61</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>140</item>
<item>141</item>
<item>142</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>12</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>res_V_data_0_V_write_ln16</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>16</lineNumber>
<contextFuncName>fill_zero&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>fill_zero&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>16</second>
</item>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>63</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>9</count>
<item_version>0</item_version>
<item>144</item>
<item>145</item>
<item>146</item>
<item>147</item>
<item>148</item>
<item>149</item>
<item>150</item>
<item>151</item>
<item>152</item>
</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>3.63</m_delay>
<m_topoIndex>13</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>_ln65</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>65</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>65</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>153</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="_23">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>j3_0</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>6</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>154</item>
<item>155</item>
<item>156</item>
<item>157</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="_24">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name>icmp_ln65</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>65</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>65</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>158</item>
<item>159</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.42</m_delay>
<m_topoIndex>17</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name>j_1</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>65</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>65</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>160</item>
<item>161</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.82</m_delay>
<m_topoIndex>18</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>_ln65</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>65</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&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>162</item>
<item>163</item>
<item>164</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>19</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>empty_32</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>22</lineNumber>
<contextFuncName>fill_data&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>fill_data&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>22</second>
</item>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>66</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>167</item>
<item>168</item>
<item>169</item>
<item>170</item>
<item>171</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.63</m_delay>
<m_topoIndex>20</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>54</id>
<name>tmp_data_0_V</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>22</lineNumber>
<contextFuncName>fill_data&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>fill_data&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>22</second>
</item>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>66</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.data[0].V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>172</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>21</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>tmp_data_1_V</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>22</lineNumber>
<contextFuncName>fill_data&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>fill_data&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>22</second>
</item>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>66</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.data[1].V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>173</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>22</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name>tmp_data_2_V</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>22</lineNumber>
<contextFuncName>fill_data&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>fill_data&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>22</second>
</item>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>66</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.data[2].V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>174</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>23</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name>tmp_data_3_V</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>22</lineNumber>
<contextFuncName>fill_data&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>fill_data&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>22</second>
</item>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>66</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.data[3].V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>175</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>24</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name>res_V_data_0_V_write_ln28</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>28</lineNumber>
<contextFuncName>fill_data&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>fill_data&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>28</second>
</item>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>66</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>10</count>
<item_version>0</item_version>
<item>176</item>
<item>177</item>
<item>178</item>
<item>179</item>
<item>180</item>
<item>181</item>
<item>182</item>
<item>183</item>
<item>184</item>
<item>491</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>3.63</m_delay>
<m_topoIndex>25</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>59</id>
<name>_ln65</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>65</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>65</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>185</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>26</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>61</id>
<name>_ln68</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>68</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>68</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>165</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>27</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>63</id>
<name>j4_0</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>2</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>186</item>
<item>187</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>28</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>64</id>
<name>icmp_ln68</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>68</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>68</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>193</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.95</m_delay>
<m_topoIndex>29</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>66</id>
<name>j_3</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>68</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>68</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>194</item>
<item>196</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.56</m_delay>
<m_topoIndex>30</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>67</id>
<name>_ln68</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>68</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>68</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>197</item>
<item>198</item>
<item>199</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>31</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>70</id>
<name>res_V_data_0_V_write_ln16</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>16</lineNumber>
<contextFuncName>fill_zero&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>fill_zero&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>16</second>
</item>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>10</count>
<item_version>0</item_version>
<item>200</item>
<item>201</item>
<item>202</item>
<item>203</item>
<item>204</item>
<item>205</item>
<item>206</item>
<item>207</item>
<item>208</item>
<item>492</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>3.63</m_delay>
<m_topoIndex>32</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>71</id>
<name>_ln68</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>68</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>68</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>209</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="_41">
<Value>
<Obj>
<type>0</type>
<id>74</id>
<name>_ln61</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>61</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>61</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>210</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>34</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>76</id>
<name>_ln73</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>73</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&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>143</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>15</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>78</id>
<name>i5_0</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>2</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>211</item>
<item>212</item>
<item>213</item>
<item>214</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>35</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>79</id>
<name>icmp_ln73</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>73</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&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>215</item>
<item>216</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.95</m_delay>
<m_topoIndex>36</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>81</id>
<name>i</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>73</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>73</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>217</item>
<item>218</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.56</m_delay>
<m_topoIndex>37</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>82</id>
<name>_ln73</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>73</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&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>219</item>
<item>220</item>
<item>221</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>38</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>86</id>
<name>_ln74</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>74</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>222</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>39</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>88</id>
<name>j6_0</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>6</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>223</item>
<item>224</item>
<item>225</item>
<item>226</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>41</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>89</id>
<name>icmp_ln74</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>74</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>227</item>
<item>228</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.42</m_delay>
<m_topoIndex>42</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>91</id>
<name>j_2</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>74</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>229</item>
<item>230</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.82</m_delay>
<m_topoIndex>43</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>92</id>
<name>_ln74</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>74</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>231</item>
<item>232</item>
<item>233</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="_52">
<Value>
<Obj>
<type>0</type>
<id>95</id>
<name>res_V_data_0_V_write_ln16</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>16</lineNumber>
<contextFuncName>fill_zero&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>fill_zero&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>16</second>
</item>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>9</count>
<item_version>0</item_version>
<item>234</item>
<item>235</item>
<item>236</item>
<item>237</item>
<item>238</item>
<item>239</item>
<item>240</item>
<item>241</item>
<item>242</item>
</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>3.63</m_delay>
<m_topoIndex>45</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_53">
<Value>
<Obj>
<type>0</type>
<id>96</id>
<name>_ln74</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>74</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>243</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="_54">
<Value>
<Obj>
<type>0</type>
<id>99</id>
<name>_ln73</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>73</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&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>244</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>47</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_55">
<Value>
<Obj>
<type>0</type>
<id>101</id>
<name>_ln78</name>
<fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>78</lineNumber>
<contextFuncName>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_padding_stream.h</first>
<second>zeropad2d_cl&lt;nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, config21&gt;</second>
</first>
<second>78</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>40</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="_56">
<Value>
<Obj>
<type>2</type>
<id>104</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>6</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_57">
<Value>
<Obj>
<type>2</type>
<id>110</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>6</bitwidth>
</Value>
<const_type>0</const_type>
<content>35</content>
</item>
<item class_id_reference="16" object_id="_58">
<Value>
<Obj>
<type>2</type>
<id>113</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>6</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_59">
<Value>
<Obj>
<type>2</type>
<id>124</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_60">
<Value>
<Obj>
<type>2</type>
<id>136</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>6</bitwidth>
</Value>
<const_type>0</const_type>
<content>32</content>
</item>
<item class_id_reference="16" object_id="_61">
<Value>
<Obj>
<type>2</type>
<id>188</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_62">
<Value>
<Obj>
<type>2</type>
<id>192</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<const_type>0</const_type>
<content>2</content>
</item>
<item class_id_reference="16" object_id="_63">
<Value>
<Obj>
<type>2</type>
<id>195</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</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="_64">
<Obj>
<type>3</type>
<id>20</id>
<name>PadTop_begin</name>
<fileName></fileName>
<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>19</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_65">
<Obj>
<type>3</type>
<id>26</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>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="_66">
<Obj>
<type>3</type>
<id>30</id>
<name>_ZrsILi32ELb0EEN11ap_int_baseIXT_EXT0_EE5RTypeIXT_EXT0_EE4arg1ERKS1_i.exit2.i.i.i.i.i47.0</name>
<fileName></fileName>
<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>28</item>
<item>29</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_67">
<Obj>
<type>3</type>
<id>33</id>
<name>PadTop_end</name>
<fileName></fileName>
<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>32</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_68">
<Obj>
<type>3</type>
<id>39</id>
<name>.preheader3</name>
<fileName></fileName>
<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>34</item>
<item>35</item>
<item>37</item>
<item>38</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_69">
<Obj>
<type>3</type>
<id>45</id>
<name>PadMain_begin</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>43</item>
<item>44</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_70">
<Obj>
<type>3</type>
<id>51</id>
<name>.preheader2</name>
<fileName></fileName>
<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>46</item>
<item>47</item>
<item>49</item>
<item>50</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_71">
<Obj>
<type>3</type>
<id>60</id>
<name>fill_data<array<ap_fixed<8, 3, 0, 0, 0>, 4u>, array<ap_fixed<8, 3, 0, 0, 0>, 4u>, config21>.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>7</count>
<item_version>0</item_version>
<item>53</item>
<item>54</item>
<item>55</item>
<item>56</item>
<item>57</item>
<item>58</item>
<item>59</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_72">
<Obj>
<type>3</type>
<id>62</id>
<name>.preheader1.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>61</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_73">
<Obj>
<type>3</type>
<id>68</id>
<name>.preheader1</name>
<fileName></fileName>
<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>63</item>
<item>64</item>
<item>66</item>
<item>67</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_74">
<Obj>
<type>3</type>
<id>72</id>
<name>_ZrsILi32ELb0EEN11ap_int_baseIXT_EXT0_EE5RTypeIXT_EXT0_EE4arg1ERKS1_i.exit2.i.i.i.i.i27.0</name>
<fileName></fileName>
<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>70</item>
<item>71</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_75">
<Obj>
<type>3</type>
<id>75</id>
<name>PadMain_end</name>
<fileName></fileName>
<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>74</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_76">
<Obj>
<type>3</type>
<id>77</id>
<name>.preheader.preheader</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>76</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_77">
<Obj>
<type>3</type>
<id>83</id>
<name>.preheader</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>78</item>
<item>79</item>
<item>81</item>
<item>82</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_78">
<Obj>
<type>3</type>
<id>87</id>
<name>PadBottom_begin</name>
<fileName></fileName>
<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>86</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_79">
<Obj>
<type>3</type>
<id>93</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>88</item>
<item>89</item>
<item>91</item>
<item>92</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_80">
<Obj>
<type>3</type>
<id>97</id>
<name>_ZrsILi32ELb0EEN11ap_int_baseIXT_EXT0_EE5RTypeIXT_EXT0_EE4arg1ERKS1_i.exit2.i.i.i.i.i.0</name>
<fileName></fileName>
<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>95</item>
<item>96</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_81">
<Obj>
<type>3</type>
<id>100</id>
<name>PadBottom_end</name>
<fileName></fileName>
<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>99</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_82">
<Obj>
<type>3</type>
<id>102</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>101</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>152</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_83">
<id>103</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="_84">
<id>105</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_85">
<id>106</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="_86">
<id>107</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="_87">
<id>108</id>
<edge_type>2</edge_type>
<source_obj>30</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_88">
<id>109</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="_89">
<id>111</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_90">
<id>112</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="_91">
<id>114</id>
<edge_type>1</edge_type>
<source_obj>113</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_92">
<id>115</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="_93">
<id>116</id>
<edge_type>2</edge_type>
<source_obj>30</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_94">
<id>117</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="_95">
<id>120</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_96">
<id>121</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_97">
<id>122</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_98">
<id>123</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_99">
<id>125</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_100">
<id>126</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_101">
<id>127</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_102">
<id>128</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_103">
<id>129</id>
<edge_type>2</edge_type>
<source_obj>26</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_104">
<id>130</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="_105">
<id>131</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="_106">
<id>132</id>
<edge_type>2</edge_type>
<source_obj>75</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_107">
<id>133</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_108">
<id>134</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="_109">
<id>135</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="_110">
<id>137</id>
<edge_type>1</edge_type>
<source_obj>136</source_obj>
<sink_obj>35</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>34</source_obj>
<sink_obj>37</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>113</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_113">
<id>140</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="_114">
<id>141</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_115">
<id>142</id>
<edge_type>2</edge_type>
<source_obj>77</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_116">
<id>143</id>
<edge_type>2</edge_type>
<source_obj>83</source_obj>
<sink_obj>76</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_117">
<id>145</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_118">
<id>146</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_119">
<id>147</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_120">
<id>148</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_121">
<id>149</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_122">
<id>150</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_123">
<id>151</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_124">
<id>152</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_125">
<id>153</id>
<edge_type>2</edge_type>
<source_obj>51</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_126">
<id>154</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_127">
<id>155</id>
<edge_type>2</edge_type>
<source_obj>60</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_128">
<id>156</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_129">
<id>157</id>
<edge_type>2</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="_130">
<id>158</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="_131">
<id>159</id>
<edge_type>1</edge_type>
<source_obj>136</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_132">
<id>160</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_133">
<id>161</id>
<edge_type>1</edge_type>
<source_obj>113</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_134">
<id>162</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_135">
<id>163</id>
<edge_type>2</edge_type>
<source_obj>60</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_136">
<id>164</id>
<edge_type>2</edge_type>
<source_obj>62</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_137">
<id>165</id>
<edge_type>2</edge_type>
<source_obj>68</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_138">
<id>168</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_139">
<id>169</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_140">
<id>170</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_141">
<id>171</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_142">
<id>172</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_143">
<id>173</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_144">
<id>174</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="_145">
<id>175</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_146">
<id>177</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_147">
<id>178</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_148">
<id>179</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_149">
<id>180</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_150">
<id>181</id>
<edge_type>1</edge_type>
<source_obj>54</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_151">
<id>182</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_152">
<id>183</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_153">
<id>184</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="_154">
<id>185</id>
<edge_type>2</edge_type>
<source_obj>51</source_obj>
<sink_obj>59</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_155">
<id>186</id>
<edge_type>1</edge_type>
<source_obj>66</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_156">
<id>187</id>
<edge_type>2</edge_type>
<source_obj>72</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_157">
<id>189</id>
<edge_type>1</edge_type>
<source_obj>188</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_158">
<id>190</id>
<edge_type>2</edge_type>
<source_obj>62</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_159">
<id>191</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_160">
<id>193</id>
<edge_type>1</edge_type>
<source_obj>192</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_161">
<id>194</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_162">
<id>196</id>
<edge_type>1</edge_type>
<source_obj>195</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_163">
<id>197</id>
<edge_type>1</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="_164">
<id>198</id>
<edge_type>2</edge_type>
<source_obj>72</source_obj>
<sink_obj>67</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_165">
<id>199</id>
<edge_type>2</edge_type>
<source_obj>75</source_obj>
<sink_obj>67</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_166">
<id>201</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_167">
<id>202</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_168">
<id>203</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_169">
<id>204</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_170">
<id>205</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_171">
<id>206</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_172">
<id>207</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_173">
<id>208</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_174">
<id>209</id>
<edge_type>2</edge_type>
<source_obj>68</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_175">
<id>210</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>74</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_176">
<id>211</id>
<edge_type>1</edge_type>
<source_obj>81</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_177">
<id>212</id>
<edge_type>2</edge_type>
<source_obj>100</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_178">
<id>213</id>
<edge_type>1</edge_type>
<source_obj>188</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_179">
<id>214</id>
<edge_type>2</edge_type>
<source_obj>77</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_180">
<id>215</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="_181">
<id>216</id>
<edge_type>1</edge_type>
<source_obj>192</source_obj>
<sink_obj>79</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_182">
<id>217</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>81</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_183">
<id>218</id>
<edge_type>1</edge_type>
<source_obj>195</source_obj>
<sink_obj>81</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_184">
<id>219</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_185">
<id>220</id>
<edge_type>2</edge_type>
<source_obj>87</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_186">
<id>221</id>
<edge_type>2</edge_type>
<source_obj>102</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_187">
<id>222</id>
<edge_type>2</edge_type>
<source_obj>93</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_188">
<id>223</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>88</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_189">
<id>224</id>
<edge_type>2</edge_type>
<source_obj>87</source_obj>
<sink_obj>88</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_190">
<id>225</id>
<edge_type>1</edge_type>
<source_obj>91</source_obj>
<sink_obj>88</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_191">
<id>226</id>
<edge_type>2</edge_type>
<source_obj>97</source_obj>
<sink_obj>88</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_192">
<id>227</id>
<edge_type>1</edge_type>
<source_obj>88</source_obj>
<sink_obj>89</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_193">
<id>228</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>89</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_194">
<id>229</id>
<edge_type>1</edge_type>
<source_obj>88</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_195">
<id>230</id>
<edge_type>1</edge_type>
<source_obj>113</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_196">
<id>231</id>
<edge_type>1</edge_type>
<source_obj>89</source_obj>
<sink_obj>92</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_197">
<id>232</id>
<edge_type>2</edge_type>
<source_obj>97</source_obj>
<sink_obj>92</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_198">
<id>233</id>
<edge_type>2</edge_type>
<source_obj>100</source_obj>
<sink_obj>92</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_199">
<id>235</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_200">
<id>236</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_201">
<id>237</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_202">
<id>238</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_203">
<id>239</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_204">
<id>240</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_205">
<id>241</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_206">
<id>242</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_207">
<id>243</id>
<edge_type>2</edge_type>
<source_obj>93</source_obj>
<sink_obj>96</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_208">
<id>244</id>
<edge_type>2</edge_type>
<source_obj>83</source_obj>
<sink_obj>99</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_209">
<id>467</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="_210">
<id>468</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="_211">
<id>469</id>
<edge_type>2</edge_type>
<source_obj>26</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_212">
<id>470</id>
<edge_type>2</edge_type>
<source_obj>30</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_213">
<id>471</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="_214">
<id>472</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>77</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_215">
<id>473</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_216">
<id>474</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_217">
<id>475</id>
<edge_type>2</edge_type>
<source_obj>51</source_obj>
<sink_obj>62</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_218">
<id>476</id>
<edge_type>2</edge_type>
<source_obj>51</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_219">
<id>477</id>
<edge_type>2</edge_type>
<source_obj>60</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_220">
<id>478</id>
<edge_type>2</edge_type>
<source_obj>62</source_obj>
<sink_obj>68</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_221">
<id>479</id>
<edge_type>2</edge_type>
<source_obj>68</source_obj>
<sink_obj>75</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_222">
<id>480</id>
<edge_type>2</edge_type>
<source_obj>68</source_obj>
<sink_obj>72</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_223">
<id>481</id>
<edge_type>2</edge_type>
<source_obj>72</source_obj>
<sink_obj>68</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_224">
<id>482</id>
<edge_type>2</edge_type>
<source_obj>75</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_225">
<id>483</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="_226">
<id>484</id>
<edge_type>2</edge_type>
<source_obj>83</source_obj>
<sink_obj>102</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_227">
<id>485</id>
<edge_type>2</edge_type>
<source_obj>83</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_228">
<id>486</id>
<edge_type>2</edge_type>
<source_obj>87</source_obj>
<sink_obj>93</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_229">
<id>487</id>
<edge_type>2</edge_type>
<source_obj>93</source_obj>
<sink_obj>100</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_230">
<id>488</id>
<edge_type>2</edge_type>
<source_obj>93</source_obj>
<sink_obj>97</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_231">
<id>489</id>
<edge_type>2</edge_type>
<source_obj>97</source_obj>
<sink_obj>93</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_232">
<id>490</id>
<edge_type>2</edge_type>
<source_obj>100</source_obj>
<sink_obj>83</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_233">
<id>491</id>
<edge_type>4</edge_type>
<source_obj>43</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_234">
<id>492</id>
<edge_type>4</edge_type>
<source_obj>43</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</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="_235">
<mId>1</mId>
<mTag>zeropad2d_cl<array,array<ap_fixed,4u>,config21></mTag>
<mType>0</mType>
<sub_regions>
<count>7</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</item>
<item>5</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>1296</mMinLatency>
<mMaxLatency>1296</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_236">
<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>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"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_237">
<mId>3</mId>
<mTag>PadTopWidth</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>26</item>
<item>30</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>35</mMinTripCount>
<mMaxTripCount>35</mMaxTripCount>
<mMinLatency>35</mMinLatency>
<mMaxLatency>35</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_238">
<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>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"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_239">
<mId>5</mId>
<mTag>PadMain</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>32</mMinTripCount>
<mMaxTripCount>32</mMaxTripCount>
<mMinLatency>1184</mMinLatency>
<mMaxLatency>1184</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_240">
<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>39</item>
<item>45</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="_241">
<mId>7</mId>
<mTag>CopyMain</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>51</item>
<item>60</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>32</mMinTripCount>
<mMaxTripCount>32</mMaxTripCount>
<mMinLatency>32</mMinLatency>
<mMaxLatency>32</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_242">
<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>62</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="_243">
<mId>9</mId>
<mTag>PadRight</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>68</item>
<item>72</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>2</mMinTripCount>
<mMaxTripCount>2</mMaxTripCount>
<mMinLatency>2</mMinLatency>
<mMaxLatency>2</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_244">
<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>75</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="_245">
<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>77</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="_246">
<mId>12</mId>
<mTag>PadBottom</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>2</mMinTripCount>
<mMaxTripCount>2</mMaxTripCount>
<mMinLatency>74</mMinLatency>
<mMaxLatency>74</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_247">
<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>83</item>
<item>87</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="_248">
<mId>14</mId>
<mTag>PadBottomWidth</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>93</item>
<item>97</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>35</mMinTripCount>
<mMaxTripCount>35</mMaxTripCount>
<mMinLatency>35</mMinLatency>
<mMaxLatency>35</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_249">
<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>100</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="_250">
<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>102</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="24" tracking_level="1" version="0" object_id="_251">
<states class_id="25" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_252">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>11</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_253">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_254">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_255">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_256">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_257">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_258">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_259">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_260">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_261">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_262">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_263">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_264">
<id>2</id>
<operations>
<count>10</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_265">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_266">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_267">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_268">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_269">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_270">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_271">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_272">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_273">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_274">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_275">
<id>3</id>
<operations>
<count>11</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_276">
<id>34</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_277">
<id>35</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_278">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_279">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_280">
<id>38</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_281">
<id>40</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_282">
<id>41</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_283">
<id>42</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_284">
<id>43</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_285">
<id>44</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_286">
<id>76</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_287">
<id>4</id>
<operations>
<count>14</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_288">
<id>46</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_289">
<id>47</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_290">
<id>48</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_291">
<id>49</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_292">
<id>50</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_293">
<id>52</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_294">
<id>53</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_295">
<id>54</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_296">
<id>55</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_297">
<id>56</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_298">
<id>57</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_299">
<id>58</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_300">
<id>59</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_301">
<id>61</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_302">
<id>5</id>
<operations>
<count>10</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_303">
<id>63</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_304">
<id>64</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_305">
<id>65</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_306">
<id>66</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_307">
<id>67</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_308">
<id>69</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_309">
<id>70</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_310">
<id>71</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_311">
<id>73</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_312">
<id>74</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_313">
<id>6</id>
<operations>
<count>9</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_314">
<id>78</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_315">
<id>79</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_316">
<id>80</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_317">
<id>81</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_318">
<id>82</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_319">
<id>84</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_320">
<id>85</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_321">
<id>86</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_322">
<id>101</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_323">
<id>7</id>
<operations>
<count>10</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_324">
<id>88</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_325">
<id>89</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_326">
<id>90</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_327">
<id>91</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_328">
<id>92</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_329">
<id>94</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_330">
<id>95</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_331">
<id>96</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_332">
<id>98</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_333">
<id>99</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>12</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_334">
<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="_335">
<inState>2</inState>
<outState>2</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>22</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_336">
<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>
<first>
<first>22</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_337">
<inState>3</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>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_338">
<inState>4</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>47</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_339">
<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>47</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_340">
<inState>5</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>64</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_341">
<inState>5</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>
<first>
<first>64</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_342">
<inState>3</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>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_343">
<inState>6</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>79</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_344">
<inState>7</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>89</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_345">
<inState>7</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>89</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="-1"></res>
<node_label_latency class_id="37" tracking_level="0" version="0">
<count>47</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>19</first>
<second class_id="39" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>50</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>54</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>57</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>3</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>66</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>67</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>70</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>74</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>76</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>78</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>79</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>81</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>82</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>86</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>88</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>89</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>91</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>92</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>95</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>96</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>99</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>101</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="40" tracking_level="0" version="0">
<count>19</count>
<item_version>0</item_version>
<item class_id="41" tracking_level="0" version="0">
<first>20</first>
<second class_id="42" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>62</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>4</first>
<second>4</second>
</second>
</item>
<item>
<first>72</first>
<second>
<first>4</first>
<second>4</second>
</second>
</item>
<item>
<first>75</first>
<second>
<first>4</first>
<second>4</second>
</second>
</item>
<item>
<first>77</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>83</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>87</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>93</first>
<second>
<first>4</first>
<second>4</second>
</second>
</item>
<item>
<first>97</first>
<second>
<first>4</first>
<second>4</second>
</second>
</item>
<item>
<first>100</first>
<second>
<first>4</first>
<second>4</second>
</second>
</item>
<item>
<first>102</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="43" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</regions>
<dp_fu_nodes class_id="44" tracking_level="0" version="0">
<count>24</count>
<item_version>0</item_version>
<item class_id="45" tracking_level="0" version="0">
<first>78</first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>28</item>
<item>43</item>
<item>58</item>
<item>70</item>
<item>95</item>
</second>
</item>
<item>
<first>98</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>114</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>125</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>136</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>147</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>158</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>78</item>
</second>
</item>
<item>
<first>169</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>176</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>182</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>188</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>194</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>200</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>206</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>212</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>217</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>222</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>227</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>232</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>238</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>244</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>250</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>256</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</second>
</item>
<item>
<first>262</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>91</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="47" tracking_level="0" version="0">
<count>22</count>
<item_version>0</item_version>
<item class_id="48" tracking_level="0" version="0">
<first>i1_0_phi_fu_125</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>i5_0_phi_fu_158</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>78</item>
</second>
</item>
<item>
<first>i_1_fu_194</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>i_fu_250</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>icmp_ln56_fu_176</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>icmp_ln61_fu_188</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>icmp_ln65_fu_200</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>icmp_ln68_fu_232</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>icmp_ln73_fu_244</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>icmp_ln74_fu_256</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</second>
</item>
<item>
<first>j3_0_phi_fu_136</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>j4_0_phi_fu_147</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>j6_0_phi_fu_169</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>j_0_phi_fu_114</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>j_1_fu_206</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>j_2_fu_262</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>91</item>
</second>
</item>
<item>
<first>j_3_fu_238</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>j_fu_182</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>tmp_data_0_V_fu_212</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>tmp_data_1_V_fu_217</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>tmp_data_2_V_fu_222</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>tmp_data_3_V_fu_227</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>2</count>
<item_version>0</item_version>
<item>
<first>empty_32_read_fu_98</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>grp_write_fu_78</first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>28</item>
<item>43</item>
<item>58</item>
<item>70</item>
<item>95</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="49" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>12</count>
<item_version>0</item_version>
<item>
<first>110</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>121</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>132</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>143</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>154</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>78</item>
</second>
</item>
<item>
<first>165</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>271</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>279</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>287</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>295</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>303</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>311</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>91</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>12</count>
<item_version>0</item_version>
<item>
<first>i1_0_reg_121</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>i5_0_reg_154</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>78</item>
</second>
</item>
<item>
<first>i_1_reg_279</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>i_reg_303</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>j3_0_reg_132</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>j4_0_reg_143</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>j6_0_reg_165</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>j_0_reg_110</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>j_1_reg_287</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>j_2_reg_311</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>91</item>
</second>
</item>
<item>
<first>j_3_reg_295</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>j_reg_271</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>6</count>
<item_version>0</item_version>
<item>
<first>110</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>121</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>132</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>143</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>154</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>78</item>
</second>
</item>
<item>
<first>165</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>6</count>
<item_version>0</item_version>
<item>
<first>i1_0_reg_121</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>i5_0_reg_154</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>78</item>
</second>
</item>
<item>
<first>j3_0_reg_132</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>j4_0_reg_143</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>j6_0_reg_165</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>j_0_reg_110</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="50" tracking_level="0" version="0">
<count>8</count>
<item_version>0</item_version>
<item class_id="51" tracking_level="0" version="0">
<first>data_V_data_0_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
</second>
</item>
<item>
<first>data_V_data_1_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
</second>
</item>
<item>
<first>data_V_data_2_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
</second>
</item>
<item>
<first>data_V_data_3_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
</second>
</item>
<item>
<first>res_V_data_0_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>28</item>
<item>43</item>
<item>58</item>
<item>70</item>
<item>95</item>
</second>
</item>
</second>
</item>
<item>
<first>res_V_data_1_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>28</item>
<item>43</item>
<item>58</item>
<item>70</item>
<item>95</item>
</second>
</item>
</second>
</item>
<item>
<first>res_V_data_2_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>28</item>
<item>43</item>
<item>58</item>
<item>70</item>
<item>95</item>
</second>
</item>
</second>
</item>
<item>
<first>res_V_data_3_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>28</item>
<item>43</item>
<item>58</item>
<item>70</item>
<item>95</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="52" tracking_level="0" version="0">
<count>8</count>
<item_version>0</item_version>
<item class_id="53" tracking_level="0" version="0">
<first>1</first>
<second>FIFO_SRL</second>
</item>
<item>
<first>2</first>
<second>FIFO_SRL</second>
</item>
<item>
<first>3</first>
<second>FIFO_SRL</second>
</item>
<item>
<first>4</first>
<second>FIFO_SRL</second>
</item>
<item>
<first>5</first>
<second>FIFO_SRL</second>
</item>
<item>
<first>6</first>
<second>FIFO_SRL</second>
</item>
<item>
<first>7</first>
<second>FIFO_SRL</second>
</item>
<item>
<first>8</first>
<second>FIFO_SRL</second>
</item>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- A D A . C O N T A I N E R S . --
-- I N D E F I N I T E _ O R D E R E D _ S E T S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2004-2006, 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 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. --
-- --
--
--
--
--
--
--
--
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
with Ada.Containers.Red_Black_Trees;
with Ada.Finalization;
with Ada.Streams;
generic
type Element_Type (<>) is private;
with function "<" (Left, Right : Element_Type) return Boolean is <>;
with function "=" (Left, Right : Element_Type) return Boolean is <>;
package Ada.Containers.Indefinite_Ordered_Sets is
pragma Preelaborate;
function Equivalent_Elements (Left, Right : Element_Type) return Boolean;
type Set is tagged private;
pragma Preelaborable_Initialization (Set);
type Cursor is private;
pragma Preelaborable_Initialization (Cursor);
Empty_Set : constant Set;
No_Element : constant Cursor;
function "=" (Left, Right : Set) return Boolean;
function Equivalent_Sets (Left, Right : Set) return Boolean;
function To_Set (New_Item : Element_Type) return Set;
function Length (Container : Set) return Count_Type;
function Is_Empty (Container : Set) return Boolean;
procedure Clear (Container : in out Set);
function Element (Position : Cursor) return Element_Type;
procedure Replace_Element
(Container : in out Set;
Position : Cursor;
New_Item : Element_Type);
procedure Query_Element
(Position : Cursor;
Process : not null access procedure (Element : Element_Type));
procedure Move (Target : in out Set; Source : in out Set);
procedure Insert
(Container : in out Set;
New_Item : Element_Type;
Position : out Cursor;
Inserted : out Boolean);
procedure Insert
(Container : in out Set;
New_Item : Element_Type);
procedure Include
(Container : in out Set;
New_Item : Element_Type);
procedure Replace
(Container : in out Set;
New_Item : Element_Type);
procedure Exclude
(Container : in out Set;
Item : Element_Type);
procedure Delete
(Container : in out Set;
Item : Element_Type);
procedure Delete
(Container : in out Set;
Position : in out Cursor);
procedure Delete_First (Container : in out Set);
procedure Delete_Last (Container : in out Set);
procedure Union (Target : in out Set; Source : Set);
function Union (Left, Right : Set) return Set;
function "or" (Left, Right : Set) return Set renames Union;
procedure Intersection (Target : in out Set; Source : Set);
function Intersection (Left, Right : Set) return Set;
function "and" (Left, Right : Set) return Set renames Intersection;
procedure Difference (Target : in out Set; Source : Set);
function Difference (Left, Right : Set) return Set;
function "-" (Left, Right : Set) return Set renames Difference;
procedure Symmetric_Difference (Target : in out Set; Source : Set);
function Symmetric_Difference (Left, Right : Set) return Set;
function "xor" (Left, Right : Set) return Set renames Symmetric_Difference;
function Overlap (Left, Right : Set) return Boolean;
function Is_Subset (Subset : Set; Of_Set : Set) return Boolean;
function First (Container : Set) return Cursor;
function First_Element (Container : Set) return Element_Type;
function Last (Container : Set) return Cursor;
function Last_Element (Container : Set) return Element_Type;
function Next (Position : Cursor) return Cursor;
procedure Next (Position : in out Cursor);
function Previous (Position : Cursor) return Cursor;
procedure Previous (Position : in out Cursor);
function Find (Container : Set; Item : Element_Type) return Cursor;
function Floor (Container : Set; Item : Element_Type) return Cursor;
function Ceiling (Container : Set; Item : Element_Type) return Cursor;
function Contains (Container : Set; Item : Element_Type) return Boolean;
function Has_Element (Position : Cursor) return Boolean;
function "<" (Left, Right : Cursor) return Boolean;
function ">" (Left, Right : Cursor) return Boolean;
function "<" (Left : Cursor; Right : Element_Type) return Boolean;
function ">" (Left : Cursor; Right : Element_Type) return Boolean;
function "<" (Left : Element_Type; Right : Cursor) return Boolean;
function ">" (Left : Element_Type; Right : Cursor) return Boolean;
procedure Iterate
(Container : Set;
Process : not null access procedure (Position : Cursor));
procedure Reverse_Iterate
(Container : Set;
Process : not null access procedure (Position : Cursor));
generic
type Key_Type (<>) is private;
with function Key (Element : Element_Type) return Key_Type;
with function "<" (Left, Right : Key_Type) return Boolean is <>;
package Generic_Keys is
function Equivalent_Keys (Left, Right : Key_Type) return Boolean;
function Key (Position : Cursor) return Key_Type;
function Element (Container : Set; Key : Key_Type) return Element_Type;
procedure Replace
(Container : in out Set;
Key : Key_Type;
New_Item : Element_Type);
procedure Exclude (Container : in out Set; Key : Key_Type);
procedure Delete (Container : in out Set; Key : Key_Type);
function Find
(Container : Set;
Key : Key_Type) return Cursor;
function Floor
(Container : Set;
Key : Key_Type) return Cursor;
function Ceiling
(Container : Set;
Key : Key_Type) return Cursor;
function Contains
(Container : Set;
Key : Key_Type) return Boolean;
procedure Update_Element_Preserving_Key
(Container : in out Set;
Position : Cursor;
Process : not null access
procedure (Element : in out Element_Type));
end Generic_Keys;
private
type Node_Type;
type Node_Access is access Node_Type;
type Element_Access is access Element_Type;
type Node_Type is limited record
Parent : Node_Access;
Left : Node_Access;
Right : Node_Access;
Color : Red_Black_Trees.Color_Type := Red_Black_Trees.Red;
Element : Element_Access;
end record;
package Tree_Types is new Red_Black_Trees.Generic_Tree_Types
(Node_Type,
Node_Access);
type Set is new Ada.Finalization.Controlled with record
Tree : Tree_Types.Tree_Type;
end record;
procedure Adjust (Container : in out Set);
procedure Finalize (Container : in out Set) renames Clear;
use Red_Black_Trees;
use Tree_Types;
use Ada.Finalization;
use Ada.Streams;
type Set_Access is access all Set;
for Set_Access'Storage_Size use 0;
type Cursor is record
Container : Set_Access;
Node : Node_Access;
end record;
procedure Write
(Stream : access Root_Stream_Type'Class;
Item : Cursor);
for Cursor'Write use Write;
procedure Read
(Stream : access Root_Stream_Type'Class;
Item : out Cursor);
for Cursor'Read use Read;
No_Element : constant Cursor := Cursor'(null, null);
procedure Write
(Stream : access Root_Stream_Type'Class;
Container : Set);
for Set'Write use Write;
procedure Read
(Stream : access Root_Stream_Type'Class;
Container : out Set);
for Set'Read use Read;
Empty_Set : constant Set :=
(Controlled with Tree => (First => null,
Last => null,
Root => null,
Length => 0,
Busy => 0,
Lock => 0));
end Ada.Containers.Indefinite_Ordered_Sets;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . L I B M _ S I N G L E --
-- --
-- S p e c --
-- --
-- Copyright (C) 2014, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This is the Ada Cert Math specific version of s-libsin.ads
-- @llrset Libm
-- LLR Libm
-- ========
package Libm_Single is
pragma Pure;
-- This package provides an implementation of the various C99 functions
-- used in the Ada run time. It is intended to be used for targets that
-- do not have a C math library, or where the C math library isn't of
-- sufficient quality and accuracy to meet Ada requirements.
-- In case of error conditions, NaNs or infinities are returned as
-- recommended in clause F.9 of the C99 standard. When called from C code,
-- the implementation behaves as if the FENV_ACCESS state is off, assuming
-- default rounding behavior and exception behavior.
-- The following C99 elementary functions are provided for single
-- precision (with the "f" suffix):
-- Acos, Acosh, Asin, Asinh, Atan, Atan2, Atanh, Cosh, Exp, Exp2, Log,
-- Log1p, Log2, Pow, Sin, Sinh, Tan, Tanh
-- All functions with a NaN argument return a NaN result, except where
-- stated otherwise. Unless otherwise specified, where the symbol +- occurs
-- in both an argument and the result, the result has the same sign as
-- the argument.
-- Each function lists C special values, Ada expected values as well as
-- Ada accuracy requirements the function meets. For accuracy requirements
-- the maximum relative error (abbreviated as MRE) is given, as well as
-- the domain for which the accuracy is guaranteed, where applicable.
-- The maximum relative error is expressed as multiple of Eps,
-- where Eps is Float'Model_Epsilon.
-- What about principal branch ???
----------
-- Acos --
----------
function Acos (X : Float) return Float
with Export, Convention => C, External_Name => "acosf";
-- @llr acos (Float) Special Values
-- The Acos function shall return the following special values:
--
-- C99 special values:
-- Acos (1) = +0
-- Acos (x) = NaN if abs (x) > 1
--
-- Ada expected values:
-- Acos (0) = Pi/2.0 (tightly approximated)
-- Acos (-1) = Pi (tightly approximated)
-- Acos (x) return a result in [0, Pi] radians
--
-- @llr acos (Float) Accuracy
-- The Acos function shall return the inverse cosine of <X> with the
-- following accuracy:
--
-- Ada accuracy requirements:
-- MRE <= 4.0 * Eps
-----------
-- Acosh --
-----------
function Acosh (X : Float) return Float
with Export, Convention => C, External_Name => "acoshf";
-- @llr acosh (Float) Special Values
-- The Acosh function shall return the following special values:
--
-- C99 special values:
-- Acosh (1) = +0
-- Acosh (x) = NaN if abs X > 1
-- Acosh (+INF) = +INF
--
-- @llr acosh (Float) Accuracy
-- The Acosh function shall return the inverse hyperbolic tangent of <X>
-- with the following accuracy:
--
-- Ada accuracy requirements:
-- MRE <= 8.0 * Eps
----------
-- Asin --
----------
function Asin (X : Float) return Float
with Export, Convention => C, External_Name => "asinf";
-- @llr asin (Float) Special Values
-- The Asin function shall return the following special values:
--
-- C99 special values:
-- Asin (+-0) = +-0
-- Asin (x) = NaN if abs (x) > 1
--
-- Ada expected values:
-- Asin (1) = Pi/2.0 (tightly approximated)
-- Asin (-1) = -Pi/2 (tightly approximated)
-- Asin (x) return a result in [-Pi/2, Pi/2] radians
--
-- @llr asin (Float) Accuracy
-- The Asin function shall return the inverse sine of <X> with the
-- following accuracy:
--
-- Ada accuracy requirements:
-- MRE <= 4.0 * Eps
-----------
-- Asinh --
-----------
function Asinh (X : Float) return Float
with Export, Convention => C, External_Name => "asinhf";
-- @llr asinh (Float) Special Values
-- The Asinh function shall return the following special values:
--
-- C99 special values:
-- Asinh (0) = 0
-- Asinh (+INF) = +INF
--
-- @llr asinh (Float) Accuracy
-- The Asinh function shall return the inverse hyperbolic sine of <X>
-- with the following accuracy:
--
-- Ada accuracy requirements:
-- MRE <= 8.0 * Eps
----------
-- Atan --
----------
function Atan (X : Float) return Float
with Export, Convention => C, External_Name => "atanf";
-- @llr atan (Float) Special Values
-- The Atan function shall return the following special values:
--
-- C99 special values:
-- Atan (+-0) = +-Pi
-- Atan2 (+-INF) = +-0.5 * Pi
--
-- C expected values:
-- Atan (x) return a result in [-Pi/2, Pi/2]
-----------
-- Atan2 --
-----------
function Atan2 (Y : Float; X : Float) return Float
with Export, Convention => C, External_Name => "atan2f";
-- @llr atan2 (Float; Float) Special Values
-- The Atan2 function shall return the following special values:
--
-- C99 special values:
-- Atan2 (+-0, -0) = +-Pi
-- Atan2 (+-0, +0) = +-0
-- Atan2 (+-0, x) = +-Pi, if x < 0
-- Atan2 (+-0, x) = +-0, if x > 0
-- Atan2 (y, +-0) = -0.5 * Pi, if y < 0
-- Atan2 (y, +-0) = 0.5 * Pi, if y > 0
-- Atan2 (+-y, -INF) = +-Pi, if y > 0 and y is finite
-- (tightly approximated)
-- Atan2 (+-y, -INF) = +-0, if y < 0 and y is finite
-- Atan2 (+-INF, x) = +-0.5 * Pi, if x is finite
-- (tightly approximated)
-- Atan2 (+-INF, -INF) = +-0.75 * Pi (tightly approximated)
-- Atan2 (+-INF, +INF) = +-0.25 * Pi (tightly approximated)
--
-- Ada expected values:
-- Atan2 (y, x) return a result in [-Pi, Pi]
--
-- @llr atan2 (Float; Float) Accuracy
-- The Atan2 function shall return the inverse tangent of <Y> / <X>
-- with the following accuracy:
--
-- Ada accuracy requirements:
-- MRE <= 4.0 * Eps
-----------
-- Atanh --
-----------
function Atanh (X : Float) return Float
with Export, Convention => C, External_Name => "atanhf";
-- @llr atanh (Float) Special Values
-- The Atanh function shall return the following special values:
--
-- C99 special values:
-- Atanh (0) = 0
-- Atanh (+-1) = +- INF
-- Atanh (X) = NaN for abs X > 1
--
-- @llr atanh (Float) Accuracy
-- The Atanh function shall return the inverse hyperbolic tangent of <X>
-- with the following accuracy:
--
-- Ada accuracy requirements:
-- MRE <= 8.0 * Eps
---------
-- Cos --
---------
function Cos (X : Float) return Float
with Export, Convention => C, External_Name => "cosf";
-- @llr cos (Float) Special Values
-- The Cos function shall return the following special values:
--
-- C99 special values:
-- Cos (+-0) = 1
-- Cos (+-INF) = NaN
--
-- Ada expected values:
-- abs (Cos (x)) <= 1
--
-- @llr cos (Float) Accuracy
-- The Cos function shall return the cosine of <X>
-- with the following accuracy:
--
-- Ada accuracy requirements:
-- MRE <= 2.0 * Eps
----------
-- Cosh --
----------
function Cosh (X : Float) return Float
with Export, Convention => C, External_Name => "coshf";
-- @llr cosh (Float) Special Values
-- The Cosh function shall return the following special values:
--
-- C99 special values:
-- Cosh (+-0) = 1
-- Cosh (+-INF) = +INF
--
-- Ada expected values:
-- abs (Cosh (x)) > 1
--
-- @llr cosh (Float) Accuracy
-- The Cosh function shall return the inverse cosine of <X>
-- with the following accuracy:
--
-- Ada accuracy requirements:
-- MRE <= 8.0 * Eps
---------
-- Exp --
---------
function Exp (X : Float) return Float
with Export, Convention => C, External_Name => "expf";
-- @llr exp (Float) Special Values
-- The Exp function shall return the following special values:
--
-- C99 special values:
-- Exp (+-0) = 1
-- Exp (-INF) = +0
-- Exp (+INF) = +INF
--
-- @llr exp (Float) Accuracy
-- The Exp function shall return the exponential of <X>
-- with the following accuracy:
--
-- Ada accuracy requirements:
-- MRE <= 4.0 * Eps
----------
-- Exp2 --
----------
function Exp2 (X : Float) return Float
with Export, Convention => C, External_Name => "exp2f";
-- @llr exp2 (Float) Special Values
-- The Exp2 function shall return the following special values:
--
-- C99 special values:
-- Exp2 (+-0) = 1
-- Exp2 (-INF) = +0
-- Exp2 (+INF) = +INF
--
-- @llr exp2 (Float) Accuracy
-- The Exp2 function shall return the exponential of <X> in base 2
-- with the following accuracy:
--
-- Accuracy requirements:
-- MRE <= 4.0 * Eps
---------
-- Log --
---------
function Log (X : Float) return Float
with Export, Convention => C, External_Name => "logf";
-- @llr log (Float) Special Values
-- The Log function shall return the following special values:
--
-- C99 special values:
-- Log (+-0) = -INF
-- Log (1) = +0
-- Log (x) = NaN if x<0
-- Log (+INF) = +INF
--
-- @llr log (Float) Accuracy
-- The Log function shall return the logarithm of <X>
-- with the following accuracy:
--
-- Ada accuracy requirements:
-- MRE <= 4.0 * Eps
-----------
-- Log1p --
-----------
function Log1p (X : Float) return Float
with Export, Convention => C, External_Name => "log1pf";
-- @llr log1p (Float) Special Values:
-- The Log1p function shall return the following special values:
--
-- C99 special values:
-- Log1p (+-0) = -INF
-- Log1p (1) = +0
-- Log1p (x) = NaN if x<0
-- Log1p (+INF) = +INF
--
-- @llr log1p (Float) Accuracy
-- The Log1p function shall return the logarithm of <X> + 1
-- with the following accuracy:
--
-- Accuracy requirements:
-- MRE <= 4.0 * Eps
----------
-- Log2 --
----------
function Log2 (X : Float) return Float
with Export, Convention => C, External_Name => "log2f";
-- @llr log2 (Float) Special Values
-- The Log2 function shall return the following special values:
--
-- C99 Special values:
-- Log2 (+-0) = -INF
-- Log2 (1) = +0
-- Log2 (x) = NaN if x<0
-- Log2 (+INF) = +INF
--
-- @llr log2 (Float) Accuracy
-- The Log function shall return the logarithm of <X> in base 2
-- with the following accuracy:
--
-- Accuracy requirements:
-- MRE <= 4.0 * Eps
---------
-- Pow --
---------
function Pow (Left, Right : Float) return Float
with Export, Convention => C, External_Name => "powf";
-- @llr pow (Float; Float) Special Values
-- The Pow function shall return the following special values
--
-- C99 Special values:
-- Pow (+-0, y) = +-INF, if y < 0 and y an odd integer
-- Pow (+-0, y) = +INF, if y < 0 and y not an odd integer
-- Pow (+-0, y) = +-0 if y > 0 and y an odd integer
-- Pow (+-0, y) = +0 if y > 0 and y not an odd integer
-- Pow (-1, +-INF) = 1
-- Pow (1, y) = 1 for any y, even a NaN
-- Pow (x, +-0) = 1 for any x, even a NaN
-- Pow (x, y) = NaN, if x < 0 and both x and y finite and not integer
-- Pow (x, -INF) = +INF if abs (x) < 1
-- Pow (x, -INF) = +0 if abs (x) > 1
-- Pow (x, +INF) = +0 if abs (x) < 1
-- Pow (x, +INF) = +INF if abs (x) > 1
-- Pow (-INF, y) = -0 if y < 0 and y an odd integer
-- Pow (-INF, y) = +0 if y < 0 and y not an odd integer
-- Pow (-INF, y) = -INF if y > 0 and y an odd integer
-- Pow (-INF, y) = +INF if y > 0 and y not an odd integer
-- Pow (+INF, y) = +0 if y < 0
-- Pow (+INF, y) = +INF if y > 0
--
-- @llr pow (Float; Float) Accuracy
-- The Pow function shall return <Left> to the power of <Right>
-- with the following accuracy:
--
-- Ada Accuracy requirements:
-- MRE <= (4.0 + abs (x * Log (y)) / 32) * Eps
---------
-- Sin --
---------
function Sin (X : Float) return Float
with Export, Convention => C, External_Name => "sinf";
-- @llr sin (Float) Special Values
-- The Sin function shall return the following special values:
--
-- C99 special values:
-- Sin (+-0) = +-0
-- Sin (+-INF) = NaN
--
-- @llr sin (Float) Accuracy
-- The Sin function shall return the sine of <X>
-- with the following accuracy:
--
-- Ada accuracy requirements:
-- MRE <= 2.0 * Eps
----------
-- Sinh --
----------
function Sinh (X : Float) return Float
with Export, Convention => C, External_Name => "sinhf";
-- @llr sinh (Float) Special Values
-- The Sinh function shall return the following special values:
--
-- C99 Special values:
-- Sinh (+-0) = +-0
-- Sinh (+-INF) = +-INF
--
-- @llr sinh (Float) Accuracy
-- The Sinh function shall return the hyperbolic sine of <X>
-- with the following accuracy:
--
-- Ada accuracy requirements:
-- MRE <= 8.0 * Eps
----------
-- Sqrt --
----------
function Sqrt (X : Float) return Float
with Import, Convention => Intrinsic, External_Name => "__builtin_sqrtf";
-- @ignore
-- The Sqrt function shall return the following special values:
--
-- C99 special values:
-- Sqrt (+-0) = +-0
-- Sqrt (INF) = INF
-- Sqrt (X) = NaN, for X < 0.0
---------
-- Tan --
---------
function Tan (X : Float) return Float
with Export, Convention => C, External_Name => "tanf";
-- @llr tan (Float) Special Values
-- The Tan function shall return the following special values:
--
-- C99 special values:
-- Tan (+-0) = +0
-- Tan (+-INF) = NaN
--
-- @llr tan (Float) Accuracy
-- The Tan function shall return the tangent of <X>
-- with the following accuracy:
--
-- Ada accuracy requirements:
-- MRE <= 4.0 * Eps
----------
-- Tanh --
----------
function Tanh (X : Float) return Float
with Export, Convention => C, External_Name => "tanhf";
-- @llr tanh (Float) Special Values
-- The Tanh function shall return the following special values:
--
-- C99 special values:
-- Tanh (+-0) = +-0
-- Tanh (+-INF) = +-1
--
-- @llr tanh (Float) Accuracy
-- The Tanh function shall return the hyperbolic tangent of <X>
-- with the following accuracy:
--
-- Ada accuracy requirements:
-- MRE <= 8.0 * Eps
private
function Identity (X : Float) return Float is (X);
function Infinity return Float is (1.0 / Identity (0.0));
function NaN return Float is (Infinity - Infinity);
function Exact (X : Long_Float) return Float is (Float (X));
function Epsilon return Float is (Float'Model_Epsilon);
function Maximum_Relative_Error (X : Float) return Float is (0.0 * X);
end Libm_Single;
|
-----------------------------------------------------------------------
-- Util.Concurrent.Fifos -- Concurrent Fifo Queues
-- Copyright (C) 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 Ada.Finalization;
-- The <b>Util.Concurrent.Fifos</b> generic defines a queue of objects which
-- can be shared by multiple threads. First, the queue size is configured
-- by using the <b>Set_Size</b> procedure. Then, a thread can insert elements
-- in the queue by using the <b>Enqueue</b> procedure. The thread will block
-- if the queue is full. Another thread can use the <b>Dequeue</b> procedure
-- to fetch the oldest element from the queue. The thread will block
-- until an element is inserted if the queue is empty.
generic
type Element_Type is private;
-- The default queue size.
Default_Size : in Positive;
-- After a dequeue, clear the element stored in the queue.
Clear_On_Dequeue : in Boolean := False;
package Util.Concurrent.Fifos is
FOREVER : constant Duration := -1.0;
-- Exception raised if the enqueue or dequeue timeout exceeded.
Timeout : exception;
-- Fifo of objects
type Fifo is new Ada.Finalization.Limited_Controlled with private;
-- Put the element in the queue.
procedure Enqueue (Into : in out Fifo;
Item : in Element_Type;
Wait : in Duration := FOREVER);
-- Get an element from the queue.
-- Wait until one element gets available.
procedure Dequeue (From : in out Fifo;
Item : out Element_Type;
Wait : in Duration := FOREVER);
-- Get the number of elements in the queue.
function Get_Count (From : in Fifo) return Natural;
-- Set the queue size.
procedure Set_Size (Into : in out Fifo;
Capacity : in Positive);
-- Initializes the queue.
overriding
procedure Initialize (Object : in out Fifo);
-- Release the queue elements.
overriding
procedure Finalize (Object : in out Fifo);
private
-- To store the queue elements, we use an array which is allocated dynamically
-- by the <b>Set_Size</b> protected operation. The generated code is smaller
-- compared to the use of Ada vectors container.
type Element_Array is array (Natural range <>) of Element_Type;
type Element_Array_Access is access all Element_Array;
Null_Element_Array : constant Element_Array_Access := null;
-- Queue of objects.
protected type Protected_Fifo is
-- Put the element in the queue.
-- If the queue is full, wait until some room is available.
entry Enqueue (Item : in Element_Type);
-- Get an element from the queue.
-- Wait until one element gets available.
entry Dequeue (Item : out Element_Type);
-- Get the number of elements in the queue.
function Get_Count return Natural;
-- Set the queue size.
procedure Set_Size (Capacity : in Natural);
private
First : Positive := 1;
Last : Positive := 1;
Count : Natural := 0;
Elements : Element_Array_Access := Null_Element_Array;
end Protected_Fifo;
type Fifo is new Ada.Finalization.Limited_Controlled with record
Buffer : Protected_Fifo;
end record;
end Util.Concurrent.Fifos;
|
-- Copyright 2008-2019 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package body Pck is
function Ident (I : Integer) return Integer is
begin
return I;
end Ident;
procedure Do_Nothing (A : System.Address) is
begin
null;
end Do_Nothing;
end Pck;
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.