CombinedText
stringlengths 4
3.42M
|
|---|
pragma Ada_95;
with System;
package ada_modulemain is
pragma Warnings (Off);
procedure ada_moduleinit;
pragma Export (C, ada_moduleinit, "ada_moduleinit");
procedure ada_modulefinal;
pragma Export (C, ada_modulefinal, "ada_modulefinal");
type Version_32 is mod 2 ** 32;
u00001 : constant Version_32 := 16#0a12e1a3#;
pragma Export (C, u00001, "ada_moduleB");
u00002 : constant Version_32 := 16#dc6c5ee8#;
pragma Export (C, u00002, "ada_moduleS");
-- BEGIN ELABORATION ORDER
-- ada%s
-- interfaces%s
-- system%s
-- system.case_util%s
-- system.case_util%b
-- system.htable%s
-- system.img_int%s
-- system.img_int%b
-- system.parameters%s
-- system.parameters%b
-- system.crtl%s
-- interfaces.c_streams%s
-- interfaces.c_streams%b
-- system.standard_library%s
-- system.exceptions_debug%s
-- system.exceptions_debug%b
-- system.storage_elements%s
-- system.storage_elements%b
-- system.stack_checking%s
-- system.stack_checking%b
-- system.string_hash%s
-- system.string_hash%b
-- system.htable%b
-- system.strings%s
-- system.strings%b
-- system.os_lib%s
-- system.traceback_entries%s
-- system.traceback_entries%b
-- ada.exceptions%s
-- system.soft_links%s
-- system.unsigned_types%s
-- system.val_llu%s
-- system.val_util%s
-- system.val_util%b
-- system.val_llu%b
-- system.wch_con%s
-- system.wch_con%b
-- system.wch_cnv%s
-- system.wch_jis%s
-- system.wch_jis%b
-- system.wch_cnv%b
-- system.wch_stw%s
-- system.wch_stw%b
-- ada.exceptions.last_chance_handler%s
-- ada.exceptions.last_chance_handler%b
-- system.exception_table%s
-- system.exception_table%b
-- ada.io_exceptions%s
-- ada.tags%s
-- ada.streams%s
-- ada.streams%b
-- interfaces.c%s
-- system.exceptions%s
-- system.exceptions%b
-- system.exceptions.machine%s
-- system.file_control_block%s
-- system.file_io%s
-- system.finalization_root%s
-- system.finalization_root%b
-- ada.finalization%s
-- ada.finalization%b
-- system.memory%s
-- system.memory%b
-- system.standard_library%b
-- system.secondary_stack%s
-- system.file_io%b
-- interfaces.c%b
-- ada.tags%b
-- system.soft_links%b
-- system.os_lib%b
-- system.secondary_stack%b
-- system.traceback%s
-- ada.exceptions%b
-- system.traceback%b
-- ada.text_io%s
-- ada.text_io%b
-- ada_module%s
-- ada_module%b
-- END ELABORATION ORDER
end ada_modulemain;
|
--
-- Copyright (C) 2015-2016 secunet Security Networks AG
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 2 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
with HW.GFX.GMA.Registers;
with HW.Debug;
with GNAT.Source_Info;
package body HW.GFX.GMA.PCH.HDMI
is
PCH_HDMI_ENABLE : constant := 1 * 2 ** 31;
PCH_HDMI_COLOR_FORMAT_8BPC : constant := 0 * 2 ** 26;
PCH_HDMI_COLOR_FORMAT_12BPC : constant := 3 * 2 ** 26;
PCH_HDMI_COLOR_FORMAT_MASK : constant := 7 * 2 ** 26;
PCH_HDMI_SDVO_ENCODING_SDVO : constant := 0 * 2 ** 10;
PCH_HDMI_SDVO_ENCODING_HDMI : constant := 2 * 2 ** 10;
PCH_HDMI_SDVO_ENCODING_MASK : constant := 3 * 2 ** 10;
PCH_HDMI_VSYNC_ACTIVE_HIGH : constant := 1 * 2 ** 4;
PCH_HDMI_HSYNC_ACTIVE_HIGH : constant := 1 * 2 ** 3;
PCH_HDMI_PORT_DETECT : constant := 1 * 2 ** 2;
PCH_HDMI_MASK : constant Word32 :=
PCH_TRANSCODER_SELECT_MASK or
PCH_HDMI_ENABLE or
PCH_HDMI_COLOR_FORMAT_MASK or
PCH_HDMI_SDVO_ENCODING_MASK or
PCH_HDMI_HSYNC_ACTIVE_HIGH or
PCH_HDMI_VSYNC_ACTIVE_HIGH;
type PCH_HDMI_Array is array (PCH_HDMI_Port) of Registers.Registers_Index;
PCH_HDMI : constant PCH_HDMI_Array := PCH_HDMI_Array'
(PCH_HDMI_B => Registers.PCH_HDMIB,
PCH_HDMI_C => Registers.PCH_HDMIC,
PCH_HDMI_D => Registers.PCH_HDMID);
----------------------------------------------------------------------------
procedure On (Port_Cfg : Port_Config; FDI_Port : FDI_Port_Type)
is
Polarity : constant Word32 :=
(if Port_Cfg.Mode.H_Sync_Active_High then
PCH_HDMI_HSYNC_ACTIVE_HIGH else 0) or
(if Port_Cfg.Mode.V_Sync_Active_High then
PCH_HDMI_VSYNC_ACTIVE_HIGH else 0);
begin
pragma Debug (Debug.Put_Line (GNAT.Source_Info.Enclosing_Entity));
-- registers are just sufficient for setup with DVI adaptor
Registers.Unset_And_Set_Mask
(Register => PCH_HDMI (Port_Cfg.PCH_Port),
Mask_Unset => PCH_HDMI_MASK,
Mask_Set => PCH_HDMI_ENABLE or
PCH_TRANSCODER_SELECT (FDI_Port) or
PCH_HDMI_SDVO_ENCODING_HDMI or
Polarity);
end On;
----------------------------------------------------------------------------
procedure Off (Port : PCH_HDMI_Port)
is
begin
pragma Debug (Debug.Put_Line (GNAT.Source_Info.Enclosing_Entity));
Registers.Unset_And_Set_Mask
(Register => PCH_HDMI (Port),
Mask_Unset => PCH_HDMI_MASK,
Mask_Set => PCH_HDMI_HSYNC_ACTIVE_HIGH or
PCH_HDMI_VSYNC_ACTIVE_HIGH);
end Off;
procedure All_Off
is
begin
pragma Debug (Debug.Put_Line (GNAT.Source_Info.Enclosing_Entity));
for Port in PCH_HDMI_Port loop
Off (Port);
end loop;
end All_Off;
end HW.GFX.GMA.PCH.HDMI;
|
-----------------------------------------------------------------------
-- AWA.Events.Models -- AWA.Events.Models
-----------------------------------------------------------------------
-- File generated by ada-gen DO NOT MODIFY
-- Template used: templates/model/package-body.xhtml
-- Ada Generator: https://ada-gen.googlecode.com/svn/trunk Revision 1095
-----------------------------------------------------------------------
-- Copyright (C) 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 Ada.Unchecked_Deallocation;
with Util.Beans.Objects.Time;
package body AWA.Events.Models is
use type ADO.Objects.Object_Record_Access;
use type ADO.Objects.Object_Ref;
use type ADO.Objects.Object_Record;
function Message_Type_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key is
Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER,
Of_Class => MESSAGE_TYPE_DEF'Access);
begin
ADO.Objects.Set_Value (Result, Id);
return Result;
end Message_Type_Key;
function Message_Type_Key (Id : in String) return ADO.Objects.Object_Key is
Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER,
Of_Class => MESSAGE_TYPE_DEF'Access);
begin
ADO.Objects.Set_Value (Result, Id);
return Result;
end Message_Type_Key;
function "=" (Left, Right : Message_Type_Ref'Class) return Boolean is
begin
return ADO.Objects.Object_Ref'Class (Left) = ADO.Objects.Object_Ref'Class (Right);
end "=";
procedure Set_Field (Object : in out Message_Type_Ref'Class;
Impl : out Message_Type_Access) is
Result : ADO.Objects.Object_Record_Access;
begin
Object.Prepare_Modify (Result);
Impl := Message_Type_Impl (Result.all)'Access;
end Set_Field;
-- Internal method to allocate the Object_Record instance
procedure Allocate (Object : in out Message_Type_Ref) is
Impl : Message_Type_Access;
begin
Impl := new Message_Type_Impl;
ADO.Objects.Set_Object (Object, Impl.all'Access);
end Allocate;
-- ----------------------------------------
-- Data object: Message_Type
-- ----------------------------------------
procedure Set_Id (Object : in out Message_Type_Ref;
Value : in ADO.Identifier) is
Impl : Message_Type_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Key_Value (Impl.all, 1, Value);
end Set_Id;
function Get_Id (Object : in Message_Type_Ref)
return ADO.Identifier is
Impl : constant Message_Type_Access
:= Message_Type_Impl (Object.Get_Object.all)'Access;
begin
return Impl.Get_Key_Value;
end Get_Id;
procedure Set_Name (Object : in out Message_Type_Ref;
Value : in String) is
Impl : Message_Type_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_String (Impl.all, 2, Impl.Name, Value);
end Set_Name;
procedure Set_Name (Object : in out Message_Type_Ref;
Value : in Ada.Strings.Unbounded.Unbounded_String) is
Impl : Message_Type_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Unbounded_String (Impl.all, 2, Impl.Name, Value);
end Set_Name;
function Get_Name (Object : in Message_Type_Ref)
return String is
begin
return Ada.Strings.Unbounded.To_String (Object.Get_Name);
end Get_Name;
function Get_Name (Object : in Message_Type_Ref)
return Ada.Strings.Unbounded.Unbounded_String is
Impl : constant Message_Type_Access
:= Message_Type_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Name;
end Get_Name;
-- Copy of the object.
procedure Copy (Object : in Message_Type_Ref;
Into : in out Message_Type_Ref) is
Result : Message_Type_Ref;
begin
if not Object.Is_Null then
declare
Impl : constant Message_Type_Access
:= Message_Type_Impl (Object.Get_Load_Object.all)'Access;
Copy : constant Message_Type_Access
:= new Message_Type_Impl;
begin
ADO.Objects.Set_Object (Result, Copy.all'Access);
Copy.Copy (Impl.all);
Copy.Name := Impl.Name;
end;
end if;
Into := Result;
end Copy;
procedure Find (Object : in out Message_Type_Ref;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean) is
Impl : constant Message_Type_Access := new Message_Type_Impl;
begin
Impl.Find (Session, Query, Found);
if Found then
ADO.Objects.Set_Object (Object, Impl.all'Access);
else
ADO.Objects.Set_Object (Object, null);
Destroy (Impl);
end if;
end Find;
procedure Load (Object : in out Message_Type_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier) is
Impl : constant Message_Type_Access := new Message_Type_Impl;
Found : Boolean;
Query : ADO.SQL.Query;
begin
Query.Bind_Param (Position => 1, Value => Id);
Query.Set_Filter ("id = ?");
Impl.Find (Session, Query, Found);
if not Found then
Destroy (Impl);
raise ADO.Objects.NOT_FOUND;
end if;
ADO.Objects.Set_Object (Object, Impl.all'Access);
end Load;
procedure Load (Object : in out Message_Type_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier;
Found : out Boolean) is
Impl : constant Message_Type_Access := new Message_Type_Impl;
Query : ADO.SQL.Query;
begin
Query.Bind_Param (Position => 1, Value => Id);
Query.Set_Filter ("id = ?");
Impl.Find (Session, Query, Found);
if not Found then
Destroy (Impl);
else
ADO.Objects.Set_Object (Object, Impl.all'Access);
end if;
end Load;
procedure Save (Object : in out Message_Type_Ref;
Session : in out ADO.Sessions.Master_Session'Class) is
Impl : ADO.Objects.Object_Record_Access := Object.Get_Object;
begin
if Impl = null then
Impl := new Message_Type_Impl;
ADO.Objects.Set_Object (Object, Impl);
end if;
if not ADO.Objects.Is_Created (Impl.all) then
Impl.Create (Session);
else
Impl.Save (Session);
end if;
end Save;
procedure Delete (Object : in out Message_Type_Ref;
Session : in out ADO.Sessions.Master_Session'Class) is
Impl : constant ADO.Objects.Object_Record_Access := Object.Get_Object;
begin
if Impl /= null then
Impl.Delete (Session);
end if;
end Delete;
-- --------------------
-- Free the object
-- --------------------
procedure Destroy (Object : access Message_Type_Impl) is
type Message_Type_Impl_Ptr is access all Message_Type_Impl;
procedure Unchecked_Free is new Ada.Unchecked_Deallocation
(Message_Type_Impl, Message_Type_Impl_Ptr);
pragma Warnings (Off, "*redundant conversion*");
Ptr : Message_Type_Impl_Ptr := Message_Type_Impl (Object.all)'Access;
pragma Warnings (On, "*redundant conversion*");
begin
Unchecked_Free (Ptr);
end Destroy;
procedure Find (Object : in out Message_Type_Impl;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean) is
Stmt : ADO.Statements.Query_Statement
:= Session.Create_Statement (Query, MESSAGE_TYPE_DEF'Access);
begin
Stmt.Execute;
if Stmt.Has_Elements then
Object.Load (Stmt, Session);
Stmt.Next;
Found := not Stmt.Has_Elements;
else
Found := False;
end if;
end Find;
overriding
procedure Load (Object : in out Message_Type_Impl;
Session : in out ADO.Sessions.Session'Class) is
Found : Boolean;
Query : ADO.SQL.Query;
Id : constant ADO.Identifier := Object.Get_Key_Value;
begin
Query.Bind_Param (Position => 1, Value => Id);
Query.Set_Filter ("id = ?");
Object.Find (Session, Query, Found);
if not Found then
raise ADO.Objects.NOT_FOUND;
end if;
end Load;
procedure Save (Object : in out Message_Type_Impl;
Session : in out ADO.Sessions.Master_Session'Class) is
Stmt : ADO.Statements.Update_Statement
:= Session.Create_Statement (MESSAGE_TYPE_DEF'Access);
begin
if Object.Is_Modified (1) then
Stmt.Save_Field (Name => COL_0_1_NAME, -- id
Value => Object.Get_Key);
Object.Clear_Modified (1);
end if;
if Object.Is_Modified (2) then
Stmt.Save_Field (Name => COL_1_1_NAME, -- name
Value => Object.Name);
Object.Clear_Modified (2);
end if;
if Stmt.Has_Save_Fields then
Stmt.Set_Filter (Filter => "id = ?");
Stmt.Add_Param (Value => Object.Get_Key);
declare
Result : Integer;
begin
Stmt.Execute (Result);
if Result /= 1 then
if Result /= 0 then
raise ADO.Objects.UPDATE_ERROR;
end if;
end if;
end;
end if;
end Save;
procedure Create (Object : in out Message_Type_Impl;
Session : in out ADO.Sessions.Master_Session'Class) is
Query : ADO.Statements.Insert_Statement
:= Session.Create_Statement (MESSAGE_TYPE_DEF'Access);
Result : Integer;
begin
Session.Allocate (Id => Object);
Query.Save_Field (Name => COL_0_1_NAME, -- id
Value => Object.Get_Key);
Query.Save_Field (Name => COL_1_1_NAME, -- name
Value => Object.Name);
Query.Execute (Result);
if Result /= 1 then
raise ADO.Objects.INSERT_ERROR;
end if;
ADO.Objects.Set_Created (Object);
end Create;
procedure Delete (Object : in out Message_Type_Impl;
Session : in out ADO.Sessions.Master_Session'Class) is
Stmt : ADO.Statements.Delete_Statement
:= Session.Create_Statement (MESSAGE_TYPE_DEF'Access);
begin
Stmt.Set_Filter (Filter => "id = ?");
Stmt.Add_Param (Value => Object.Get_Key);
Stmt.Execute;
end Delete;
function Get_Value (From : in Message_Type_Ref;
Name : in String) return Util.Beans.Objects.Object is
Obj : constant ADO.Objects.Object_Record_Access := From.Get_Load_Object;
Impl : access Message_Type_Impl;
begin
if Obj = null then
return Util.Beans.Objects.Null_Object;
end if;
Impl := Message_Type_Impl (Obj.all)'Access;
if Name = "id" then
return ADO.Objects.To_Object (Impl.Get_Key);
elsif Name = "name" then
return Util.Beans.Objects.To_Object (Impl.Name);
end if;
return Util.Beans.Objects.Null_Object;
end Get_Value;
procedure List (Object : in out Message_Type_Vector;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class) is
Stmt : ADO.Statements.Query_Statement
:= Session.Create_Statement (Query, MESSAGE_TYPE_DEF'Access);
begin
Stmt.Execute;
Message_Type_Vectors.Clear (Object);
while Stmt.Has_Elements loop
declare
Item : Message_Type_Ref;
Impl : constant Message_Type_Access := new Message_Type_Impl;
begin
Impl.Load (Stmt, Session);
ADO.Objects.Set_Object (Item, Impl.all'Access);
Object.Append (Item);
end;
Stmt.Next;
end loop;
end List;
-- ------------------------------
-- Load the object from current iterator position
-- ------------------------------
procedure Load (Object : in out Message_Type_Impl;
Stmt : in out ADO.Statements.Query_Statement'Class;
Session : in out ADO.Sessions.Session'Class) is
pragma Unreferenced (Session);
begin
Object.Set_Key_Value (Stmt.Get_Identifier (0));
Object.Name := Stmt.Get_Unbounded_String (1);
ADO.Objects.Set_Created (Object);
end Load;
function Queue_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key is
Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER,
Of_Class => QUEUE_DEF'Access);
begin
ADO.Objects.Set_Value (Result, Id);
return Result;
end Queue_Key;
function Queue_Key (Id : in String) return ADO.Objects.Object_Key is
Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER,
Of_Class => QUEUE_DEF'Access);
begin
ADO.Objects.Set_Value (Result, Id);
return Result;
end Queue_Key;
function "=" (Left, Right : Queue_Ref'Class) return Boolean is
begin
return ADO.Objects.Object_Ref'Class (Left) = ADO.Objects.Object_Ref'Class (Right);
end "=";
procedure Set_Field (Object : in out Queue_Ref'Class;
Impl : out Queue_Access) is
Result : ADO.Objects.Object_Record_Access;
begin
Object.Prepare_Modify (Result);
Impl := Queue_Impl (Result.all)'Access;
end Set_Field;
-- Internal method to allocate the Object_Record instance
procedure Allocate (Object : in out Queue_Ref) is
Impl : Queue_Access;
begin
Impl := new Queue_Impl;
Impl.Server_Id := 0;
ADO.Objects.Set_Object (Object, Impl.all'Access);
end Allocate;
-- ----------------------------------------
-- Data object: Queue
-- ----------------------------------------
procedure Set_Id (Object : in out Queue_Ref;
Value : in ADO.Identifier) is
Impl : Queue_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Key_Value (Impl.all, 1, Value);
end Set_Id;
function Get_Id (Object : in Queue_Ref)
return ADO.Identifier is
Impl : constant Queue_Access
:= Queue_Impl (Object.Get_Object.all)'Access;
begin
return Impl.Get_Key_Value;
end Get_Id;
procedure Set_Server_Id (Object : in out Queue_Ref;
Value : in Integer) is
Impl : Queue_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Integer (Impl.all, 2, Impl.Server_Id, Value);
end Set_Server_Id;
function Get_Server_Id (Object : in Queue_Ref)
return Integer is
Impl : constant Queue_Access
:= Queue_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Server_Id;
end Get_Server_Id;
procedure Set_Name (Object : in out Queue_Ref;
Value : in String) is
Impl : Queue_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_String (Impl.all, 3, Impl.Name, Value);
end Set_Name;
procedure Set_Name (Object : in out Queue_Ref;
Value : in Ada.Strings.Unbounded.Unbounded_String) is
Impl : Queue_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Unbounded_String (Impl.all, 3, Impl.Name, Value);
end Set_Name;
function Get_Name (Object : in Queue_Ref)
return String is
begin
return Ada.Strings.Unbounded.To_String (Object.Get_Name);
end Get_Name;
function Get_Name (Object : in Queue_Ref)
return Ada.Strings.Unbounded.Unbounded_String is
Impl : constant Queue_Access
:= Queue_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Name;
end Get_Name;
-- Copy of the object.
procedure Copy (Object : in Queue_Ref;
Into : in out Queue_Ref) is
Result : Queue_Ref;
begin
if not Object.Is_Null then
declare
Impl : constant Queue_Access
:= Queue_Impl (Object.Get_Load_Object.all)'Access;
Copy : constant Queue_Access
:= new Queue_Impl;
begin
ADO.Objects.Set_Object (Result, Copy.all'Access);
Copy.Copy (Impl.all);
Copy.Server_Id := Impl.Server_Id;
Copy.Name := Impl.Name;
end;
end if;
Into := Result;
end Copy;
procedure Find (Object : in out Queue_Ref;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean) is
Impl : constant Queue_Access := new Queue_Impl;
begin
Impl.Find (Session, Query, Found);
if Found then
ADO.Objects.Set_Object (Object, Impl.all'Access);
else
ADO.Objects.Set_Object (Object, null);
Destroy (Impl);
end if;
end Find;
procedure Load (Object : in out Queue_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier) is
Impl : constant Queue_Access := new Queue_Impl;
Found : Boolean;
Query : ADO.SQL.Query;
begin
Query.Bind_Param (Position => 1, Value => Id);
Query.Set_Filter ("id = ?");
Impl.Find (Session, Query, Found);
if not Found then
Destroy (Impl);
raise ADO.Objects.NOT_FOUND;
end if;
ADO.Objects.Set_Object (Object, Impl.all'Access);
end Load;
procedure Load (Object : in out Queue_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier;
Found : out Boolean) is
Impl : constant Queue_Access := new Queue_Impl;
Query : ADO.SQL.Query;
begin
Query.Bind_Param (Position => 1, Value => Id);
Query.Set_Filter ("id = ?");
Impl.Find (Session, Query, Found);
if not Found then
Destroy (Impl);
else
ADO.Objects.Set_Object (Object, Impl.all'Access);
end if;
end Load;
procedure Save (Object : in out Queue_Ref;
Session : in out ADO.Sessions.Master_Session'Class) is
Impl : ADO.Objects.Object_Record_Access := Object.Get_Object;
begin
if Impl = null then
Impl := new Queue_Impl;
ADO.Objects.Set_Object (Object, Impl);
end if;
if not ADO.Objects.Is_Created (Impl.all) then
Impl.Create (Session);
else
Impl.Save (Session);
end if;
end Save;
procedure Delete (Object : in out Queue_Ref;
Session : in out ADO.Sessions.Master_Session'Class) is
Impl : constant ADO.Objects.Object_Record_Access := Object.Get_Object;
begin
if Impl /= null then
Impl.Delete (Session);
end if;
end Delete;
-- --------------------
-- Free the object
-- --------------------
procedure Destroy (Object : access Queue_Impl) is
type Queue_Impl_Ptr is access all Queue_Impl;
procedure Unchecked_Free is new Ada.Unchecked_Deallocation
(Queue_Impl, Queue_Impl_Ptr);
pragma Warnings (Off, "*redundant conversion*");
Ptr : Queue_Impl_Ptr := Queue_Impl (Object.all)'Access;
pragma Warnings (On, "*redundant conversion*");
begin
Unchecked_Free (Ptr);
end Destroy;
procedure Find (Object : in out Queue_Impl;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean) is
Stmt : ADO.Statements.Query_Statement
:= Session.Create_Statement (Query, QUEUE_DEF'Access);
begin
Stmt.Execute;
if Stmt.Has_Elements then
Object.Load (Stmt, Session);
Stmt.Next;
Found := not Stmt.Has_Elements;
else
Found := False;
end if;
end Find;
overriding
procedure Load (Object : in out Queue_Impl;
Session : in out ADO.Sessions.Session'Class) is
Found : Boolean;
Query : ADO.SQL.Query;
Id : constant ADO.Identifier := Object.Get_Key_Value;
begin
Query.Bind_Param (Position => 1, Value => Id);
Query.Set_Filter ("id = ?");
Object.Find (Session, Query, Found);
if not Found then
raise ADO.Objects.NOT_FOUND;
end if;
end Load;
procedure Save (Object : in out Queue_Impl;
Session : in out ADO.Sessions.Master_Session'Class) is
Stmt : ADO.Statements.Update_Statement
:= Session.Create_Statement (QUEUE_DEF'Access);
begin
if Object.Is_Modified (1) then
Stmt.Save_Field (Name => COL_0_2_NAME, -- id
Value => Object.Get_Key);
Object.Clear_Modified (1);
end if;
if Object.Is_Modified (2) then
Stmt.Save_Field (Name => COL_1_2_NAME, -- server_id
Value => Object.Server_Id);
Object.Clear_Modified (2);
end if;
if Object.Is_Modified (3) then
Stmt.Save_Field (Name => COL_2_2_NAME, -- name
Value => Object.Name);
Object.Clear_Modified (3);
end if;
if Stmt.Has_Save_Fields then
Stmt.Set_Filter (Filter => "id = ?");
Stmt.Add_Param (Value => Object.Get_Key);
declare
Result : Integer;
begin
Stmt.Execute (Result);
if Result /= 1 then
if Result /= 0 then
raise ADO.Objects.UPDATE_ERROR;
end if;
end if;
end;
end if;
end Save;
procedure Create (Object : in out Queue_Impl;
Session : in out ADO.Sessions.Master_Session'Class) is
Query : ADO.Statements.Insert_Statement
:= Session.Create_Statement (QUEUE_DEF'Access);
Result : Integer;
begin
Session.Allocate (Id => Object);
Query.Save_Field (Name => COL_0_2_NAME, -- id
Value => Object.Get_Key);
Query.Save_Field (Name => COL_1_2_NAME, -- server_id
Value => Object.Server_Id);
Query.Save_Field (Name => COL_2_2_NAME, -- name
Value => Object.Name);
Query.Execute (Result);
if Result /= 1 then
raise ADO.Objects.INSERT_ERROR;
end if;
ADO.Objects.Set_Created (Object);
end Create;
procedure Delete (Object : in out Queue_Impl;
Session : in out ADO.Sessions.Master_Session'Class) is
Stmt : ADO.Statements.Delete_Statement
:= Session.Create_Statement (QUEUE_DEF'Access);
begin
Stmt.Set_Filter (Filter => "id = ?");
Stmt.Add_Param (Value => Object.Get_Key);
Stmt.Execute;
end Delete;
function Get_Value (From : in Queue_Ref;
Name : in String) return Util.Beans.Objects.Object is
Obj : constant ADO.Objects.Object_Record_Access := From.Get_Load_Object;
Impl : access Queue_Impl;
begin
if Obj = null then
return Util.Beans.Objects.Null_Object;
end if;
Impl := Queue_Impl (Obj.all)'Access;
if Name = "id" then
return ADO.Objects.To_Object (Impl.Get_Key);
elsif Name = "server_id" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (Impl.Server_Id));
elsif Name = "name" then
return Util.Beans.Objects.To_Object (Impl.Name);
end if;
return Util.Beans.Objects.Null_Object;
end Get_Value;
-- ------------------------------
-- Load the object from current iterator position
-- ------------------------------
procedure Load (Object : in out Queue_Impl;
Stmt : in out ADO.Statements.Query_Statement'Class;
Session : in out ADO.Sessions.Session'Class) is
pragma Unreferenced (Session);
begin
Object.Set_Key_Value (Stmt.Get_Identifier (0));
Object.Server_Id := Stmt.Get_Integer (1);
Object.Name := Stmt.Get_Unbounded_String (2);
ADO.Objects.Set_Created (Object);
end Load;
function Message_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key is
Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER,
Of_Class => MESSAGE_DEF'Access);
begin
ADO.Objects.Set_Value (Result, Id);
return Result;
end Message_Key;
function Message_Key (Id : in String) return ADO.Objects.Object_Key is
Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER,
Of_Class => MESSAGE_DEF'Access);
begin
ADO.Objects.Set_Value (Result, Id);
return Result;
end Message_Key;
function "=" (Left, Right : Message_Ref'Class) return Boolean is
begin
return ADO.Objects.Object_Ref'Class (Left) = ADO.Objects.Object_Ref'Class (Right);
end "=";
procedure Set_Field (Object : in out Message_Ref'Class;
Impl : out Message_Access) is
Result : ADO.Objects.Object_Record_Access;
begin
Object.Prepare_Modify (Result);
Impl := Message_Impl (Result.all)'Access;
end Set_Field;
-- Internal method to allocate the Object_Record instance
procedure Allocate (Object : in out Message_Ref) is
Impl : Message_Access;
begin
Impl := new Message_Impl;
Impl.Create_Date := ADO.DEFAULT_TIME;
Impl.Priority := 0;
Impl.Count := 0;
Impl.Server_Id := 0;
Impl.Task_Id := 0;
Impl.Status := AWA.Events.Models.Message_Status_Type'First;
Impl.Processing_Date.Is_Null := True;
Impl.Version := 0;
Impl.Entity_Id := ADO.NO_IDENTIFIER;
Impl.Entity_Type := 0;
Impl.Finish_Date.Is_Null := True;
ADO.Objects.Set_Object (Object, Impl.all'Access);
end Allocate;
-- ----------------------------------------
-- Data object: Message
-- ----------------------------------------
procedure Set_Id (Object : in out Message_Ref;
Value : in ADO.Identifier) is
Impl : Message_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Key_Value (Impl.all, 1, Value);
end Set_Id;
function Get_Id (Object : in Message_Ref)
return ADO.Identifier is
Impl : constant Message_Access
:= Message_Impl (Object.Get_Object.all)'Access;
begin
return Impl.Get_Key_Value;
end Get_Id;
procedure Set_Create_Date (Object : in out Message_Ref;
Value : in Ada.Calendar.Time) is
Impl : Message_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Time (Impl.all, 2, Impl.Create_Date, Value);
end Set_Create_Date;
function Get_Create_Date (Object : in Message_Ref)
return Ada.Calendar.Time is
Impl : constant Message_Access
:= Message_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Create_Date;
end Get_Create_Date;
procedure Set_Priority (Object : in out Message_Ref;
Value : in Integer) is
Impl : Message_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Integer (Impl.all, 3, Impl.Priority, Value);
end Set_Priority;
function Get_Priority (Object : in Message_Ref)
return Integer is
Impl : constant Message_Access
:= Message_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Priority;
end Get_Priority;
procedure Set_Count (Object : in out Message_Ref;
Value : in Integer) is
Impl : Message_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Integer (Impl.all, 4, Impl.Count, Value);
end Set_Count;
function Get_Count (Object : in Message_Ref)
return Integer is
Impl : constant Message_Access
:= Message_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Count;
end Get_Count;
procedure Set_Parameters (Object : in out Message_Ref;
Value : in String) is
Impl : Message_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_String (Impl.all, 5, Impl.Parameters, Value);
end Set_Parameters;
procedure Set_Parameters (Object : in out Message_Ref;
Value : in Ada.Strings.Unbounded.Unbounded_String) is
Impl : Message_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Unbounded_String (Impl.all, 5, Impl.Parameters, Value);
end Set_Parameters;
function Get_Parameters (Object : in Message_Ref)
return String is
begin
return Ada.Strings.Unbounded.To_String (Object.Get_Parameters);
end Get_Parameters;
function Get_Parameters (Object : in Message_Ref)
return Ada.Strings.Unbounded.Unbounded_String is
Impl : constant Message_Access
:= Message_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Parameters;
end Get_Parameters;
procedure Set_Server_Id (Object : in out Message_Ref;
Value : in Integer) is
Impl : Message_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Integer (Impl.all, 6, Impl.Server_Id, Value);
end Set_Server_Id;
function Get_Server_Id (Object : in Message_Ref)
return Integer is
Impl : constant Message_Access
:= Message_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Server_Id;
end Get_Server_Id;
procedure Set_Task_Id (Object : in out Message_Ref;
Value : in Integer) is
Impl : Message_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Integer (Impl.all, 7, Impl.Task_Id, Value);
end Set_Task_Id;
function Get_Task_Id (Object : in Message_Ref)
return Integer is
Impl : constant Message_Access
:= Message_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Task_Id;
end Get_Task_Id;
procedure Set_Status (Object : in out Message_Ref;
Value : in AWA.Events.Models.Message_Status_Type) is
procedure Set_Field_Enum is
new ADO.Objects.Set_Field_Operation (Message_Status_Type);
Impl : Message_Access;
begin
Set_Field (Object, Impl);
Set_Field_Enum (Impl.all, 8, Impl.Status, Value);
end Set_Status;
function Get_Status (Object : in Message_Ref)
return AWA.Events.Models.Message_Status_Type is
Impl : constant Message_Access
:= Message_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Status;
end Get_Status;
procedure Set_Processing_Date (Object : in out Message_Ref;
Value : in ADO.Nullable_Time) is
Impl : Message_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Time (Impl.all, 9, Impl.Processing_Date, Value);
end Set_Processing_Date;
function Get_Processing_Date (Object : in Message_Ref)
return ADO.Nullable_Time is
Impl : constant Message_Access
:= Message_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Processing_Date;
end Get_Processing_Date;
function Get_Version (Object : in Message_Ref)
return Integer is
Impl : constant Message_Access
:= Message_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Version;
end Get_Version;
procedure Set_Entity_Id (Object : in out Message_Ref;
Value : in ADO.Identifier) is
Impl : Message_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Identifier (Impl.all, 11, Impl.Entity_Id, Value);
end Set_Entity_Id;
function Get_Entity_Id (Object : in Message_Ref)
return ADO.Identifier is
Impl : constant Message_Access
:= Message_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Entity_Id;
end Get_Entity_Id;
procedure Set_Entity_Type (Object : in out Message_Ref;
Value : in ADO.Entity_Type) is
Impl : Message_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Entity_Type (Impl.all, 12, Impl.Entity_Type, Value);
end Set_Entity_Type;
function Get_Entity_Type (Object : in Message_Ref)
return ADO.Entity_Type is
Impl : constant Message_Access
:= Message_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Entity_Type;
end Get_Entity_Type;
procedure Set_Finish_Date (Object : in out Message_Ref;
Value : in ADO.Nullable_Time) is
Impl : Message_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Time (Impl.all, 13, Impl.Finish_Date, Value);
end Set_Finish_Date;
function Get_Finish_Date (Object : in Message_Ref)
return ADO.Nullable_Time is
Impl : constant Message_Access
:= Message_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Finish_Date;
end Get_Finish_Date;
procedure Set_Queue (Object : in out Message_Ref;
Value : in AWA.Events.Models.Queue_Ref'Class) is
Impl : Message_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Object (Impl.all, 14, Impl.Queue, Value);
end Set_Queue;
function Get_Queue (Object : in Message_Ref)
return AWA.Events.Models.Queue_Ref'Class is
Impl : constant Message_Access
:= Message_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Queue;
end Get_Queue;
procedure Set_Message_Type (Object : in out Message_Ref;
Value : in AWA.Events.Models.Message_Type_Ref'Class) is
Impl : Message_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Object (Impl.all, 15, Impl.Message_Type, Value);
end Set_Message_Type;
function Get_Message_Type (Object : in Message_Ref)
return AWA.Events.Models.Message_Type_Ref'Class is
Impl : constant Message_Access
:= Message_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Message_Type;
end Get_Message_Type;
procedure Set_User (Object : in out Message_Ref;
Value : in AWA.Users.Models.User_Ref'Class) is
Impl : Message_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Object (Impl.all, 16, Impl.User, Value);
end Set_User;
function Get_User (Object : in Message_Ref)
return AWA.Users.Models.User_Ref'Class is
Impl : constant Message_Access
:= Message_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.User;
end Get_User;
procedure Set_Session (Object : in out Message_Ref;
Value : in AWA.Users.Models.Session_Ref'Class) is
Impl : Message_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Object (Impl.all, 17, Impl.Session, Value);
end Set_Session;
function Get_Session (Object : in Message_Ref)
return AWA.Users.Models.Session_Ref'Class is
Impl : constant Message_Access
:= Message_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Session;
end Get_Session;
-- Copy of the object.
procedure Copy (Object : in Message_Ref;
Into : in out Message_Ref) is
Result : Message_Ref;
begin
if not Object.Is_Null then
declare
Impl : constant Message_Access
:= Message_Impl (Object.Get_Load_Object.all)'Access;
Copy : constant Message_Access
:= new Message_Impl;
begin
ADO.Objects.Set_Object (Result, Copy.all'Access);
Copy.Copy (Impl.all);
Copy.Create_Date := Impl.Create_Date;
Copy.Priority := Impl.Priority;
Copy.Count := Impl.Count;
Copy.Parameters := Impl.Parameters;
Copy.Server_Id := Impl.Server_Id;
Copy.Task_Id := Impl.Task_Id;
Copy.Status := Impl.Status;
Copy.Processing_Date := Impl.Processing_Date;
Copy.Version := Impl.Version;
Copy.Entity_Id := Impl.Entity_Id;
Copy.Entity_Type := Impl.Entity_Type;
Copy.Finish_Date := Impl.Finish_Date;
Copy.Queue := Impl.Queue;
Copy.Message_Type := Impl.Message_Type;
Copy.User := Impl.User;
Copy.Session := Impl.Session;
end;
end if;
Into := Result;
end Copy;
procedure Find (Object : in out Message_Ref;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean) is
Impl : constant Message_Access := new Message_Impl;
begin
Impl.Find (Session, Query, Found);
if Found then
ADO.Objects.Set_Object (Object, Impl.all'Access);
else
ADO.Objects.Set_Object (Object, null);
Destroy (Impl);
end if;
end Find;
procedure Load (Object : in out Message_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier) is
Impl : constant Message_Access := new Message_Impl;
Found : Boolean;
Query : ADO.SQL.Query;
begin
Query.Bind_Param (Position => 1, Value => Id);
Query.Set_Filter ("id = ?");
Impl.Find (Session, Query, Found);
if not Found then
Destroy (Impl);
raise ADO.Objects.NOT_FOUND;
end if;
ADO.Objects.Set_Object (Object, Impl.all'Access);
end Load;
procedure Load (Object : in out Message_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier;
Found : out Boolean) is
Impl : constant Message_Access := new Message_Impl;
Query : ADO.SQL.Query;
begin
Query.Bind_Param (Position => 1, Value => Id);
Query.Set_Filter ("id = ?");
Impl.Find (Session, Query, Found);
if not Found then
Destroy (Impl);
else
ADO.Objects.Set_Object (Object, Impl.all'Access);
end if;
end Load;
procedure Save (Object : in out Message_Ref;
Session : in out ADO.Sessions.Master_Session'Class) is
Impl : ADO.Objects.Object_Record_Access := Object.Get_Object;
begin
if Impl = null then
Impl := new Message_Impl;
ADO.Objects.Set_Object (Object, Impl);
end if;
if not ADO.Objects.Is_Created (Impl.all) then
Impl.Create (Session);
else
Impl.Save (Session);
end if;
end Save;
procedure Delete (Object : in out Message_Ref;
Session : in out ADO.Sessions.Master_Session'Class) is
Impl : constant ADO.Objects.Object_Record_Access := Object.Get_Object;
begin
if Impl /= null then
Impl.Delete (Session);
end if;
end Delete;
-- --------------------
-- Free the object
-- --------------------
procedure Destroy (Object : access Message_Impl) is
type Message_Impl_Ptr is access all Message_Impl;
procedure Unchecked_Free is new Ada.Unchecked_Deallocation
(Message_Impl, Message_Impl_Ptr);
pragma Warnings (Off, "*redundant conversion*");
Ptr : Message_Impl_Ptr := Message_Impl (Object.all)'Access;
pragma Warnings (On, "*redundant conversion*");
begin
Unchecked_Free (Ptr);
end Destroy;
procedure Find (Object : in out Message_Impl;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean) is
Stmt : ADO.Statements.Query_Statement
:= Session.Create_Statement (Query, MESSAGE_DEF'Access);
begin
Stmt.Execute;
if Stmt.Has_Elements then
Object.Load (Stmt, Session);
Stmt.Next;
Found := not Stmt.Has_Elements;
else
Found := False;
end if;
end Find;
overriding
procedure Load (Object : in out Message_Impl;
Session : in out ADO.Sessions.Session'Class) is
Found : Boolean;
Query : ADO.SQL.Query;
Id : constant ADO.Identifier := Object.Get_Key_Value;
begin
Query.Bind_Param (Position => 1, Value => Id);
Query.Set_Filter ("id = ?");
Object.Find (Session, Query, Found);
if not Found then
raise ADO.Objects.NOT_FOUND;
end if;
end Load;
procedure Save (Object : in out Message_Impl;
Session : in out ADO.Sessions.Master_Session'Class) is
Stmt : ADO.Statements.Update_Statement
:= Session.Create_Statement (MESSAGE_DEF'Access);
begin
if Object.Is_Modified (1) then
Stmt.Save_Field (Name => COL_0_3_NAME, -- id
Value => Object.Get_Key);
Object.Clear_Modified (1);
end if;
if Object.Is_Modified (2) then
Stmt.Save_Field (Name => COL_1_3_NAME, -- create_date
Value => Object.Create_Date);
Object.Clear_Modified (2);
end if;
if Object.Is_Modified (3) then
Stmt.Save_Field (Name => COL_2_3_NAME, -- priority
Value => Object.Priority);
Object.Clear_Modified (3);
end if;
if Object.Is_Modified (4) then
Stmt.Save_Field (Name => COL_3_3_NAME, -- count
Value => Object.Count);
Object.Clear_Modified (4);
end if;
if Object.Is_Modified (5) then
Stmt.Save_Field (Name => COL_4_3_NAME, -- parameters
Value => Object.Parameters);
Object.Clear_Modified (5);
end if;
if Object.Is_Modified (6) then
Stmt.Save_Field (Name => COL_5_3_NAME, -- server_id
Value => Object.Server_Id);
Object.Clear_Modified (6);
end if;
if Object.Is_Modified (7) then
Stmt.Save_Field (Name => COL_6_3_NAME, -- task_id
Value => Object.Task_Id);
Object.Clear_Modified (7);
end if;
if Object.Is_Modified (8) then
Stmt.Save_Field (Name => COL_7_3_NAME, -- status
Value => Integer (Message_Status_Type'Pos (Object.Status)));
Object.Clear_Modified (8);
end if;
if Object.Is_Modified (9) then
Stmt.Save_Field (Name => COL_8_3_NAME, -- processing_date
Value => Object.Processing_Date);
Object.Clear_Modified (9);
end if;
if Object.Is_Modified (11) then
Stmt.Save_Field (Name => COL_10_3_NAME, -- entity_id
Value => Object.Entity_Id);
Object.Clear_Modified (11);
end if;
if Object.Is_Modified (12) then
Stmt.Save_Field (Name => COL_11_3_NAME, -- entity_type
Value => Object.Entity_Type);
Object.Clear_Modified (12);
end if;
if Object.Is_Modified (13) then
Stmt.Save_Field (Name => COL_12_3_NAME, -- finish_date
Value => Object.Finish_Date);
Object.Clear_Modified (13);
end if;
if Object.Is_Modified (14) then
Stmt.Save_Field (Name => COL_13_3_NAME, -- queue_id
Value => Object.Queue);
Object.Clear_Modified (14);
end if;
if Object.Is_Modified (15) then
Stmt.Save_Field (Name => COL_14_3_NAME, -- message_type_id
Value => Object.Message_Type);
Object.Clear_Modified (15);
end if;
if Object.Is_Modified (16) then
Stmt.Save_Field (Name => COL_15_3_NAME, -- user_id
Value => Object.User);
Object.Clear_Modified (16);
end if;
if Object.Is_Modified (17) then
Stmt.Save_Field (Name => COL_16_3_NAME, -- session_id
Value => Object.Session);
Object.Clear_Modified (17);
end if;
if Stmt.Has_Save_Fields then
Object.Version := Object.Version + 1;
Stmt.Save_Field (Name => "version",
Value => Object.Version);
Stmt.Set_Filter (Filter => "id = ? and version = ?");
Stmt.Add_Param (Value => Object.Get_Key);
Stmt.Add_Param (Value => Object.Version - 1);
declare
Result : Integer;
begin
Stmt.Execute (Result);
if Result /= 1 then
if Result /= 0 then
raise ADO.Objects.UPDATE_ERROR;
else
raise ADO.Objects.LAZY_LOCK;
end if;
end if;
end;
end if;
end Save;
procedure Create (Object : in out Message_Impl;
Session : in out ADO.Sessions.Master_Session'Class) is
Query : ADO.Statements.Insert_Statement
:= Session.Create_Statement (MESSAGE_DEF'Access);
Result : Integer;
begin
Object.Version := 1;
Session.Allocate (Id => Object);
Query.Save_Field (Name => COL_0_3_NAME, -- id
Value => Object.Get_Key);
Query.Save_Field (Name => COL_1_3_NAME, -- create_date
Value => Object.Create_Date);
Query.Save_Field (Name => COL_2_3_NAME, -- priority
Value => Object.Priority);
Query.Save_Field (Name => COL_3_3_NAME, -- count
Value => Object.Count);
Query.Save_Field (Name => COL_4_3_NAME, -- parameters
Value => Object.Parameters);
Query.Save_Field (Name => COL_5_3_NAME, -- server_id
Value => Object.Server_Id);
Query.Save_Field (Name => COL_6_3_NAME, -- task_id
Value => Object.Task_Id);
Query.Save_Field (Name => COL_7_3_NAME, -- status
Value => Integer (Message_Status_Type'Pos (Object.Status)));
Query.Save_Field (Name => COL_8_3_NAME, -- processing_date
Value => Object.Processing_Date);
Query.Save_Field (Name => COL_9_3_NAME, -- version
Value => Object.Version);
Query.Save_Field (Name => COL_10_3_NAME, -- entity_id
Value => Object.Entity_Id);
Query.Save_Field (Name => COL_11_3_NAME, -- entity_type
Value => Object.Entity_Type);
Query.Save_Field (Name => COL_12_3_NAME, -- finish_date
Value => Object.Finish_Date);
Query.Save_Field (Name => COL_13_3_NAME, -- queue_id
Value => Object.Queue);
Query.Save_Field (Name => COL_14_3_NAME, -- message_type_id
Value => Object.Message_Type);
Query.Save_Field (Name => COL_15_3_NAME, -- user_id
Value => Object.User);
Query.Save_Field (Name => COL_16_3_NAME, -- session_id
Value => Object.Session);
Query.Execute (Result);
if Result /= 1 then
raise ADO.Objects.INSERT_ERROR;
end if;
ADO.Objects.Set_Created (Object);
end Create;
procedure Delete (Object : in out Message_Impl;
Session : in out ADO.Sessions.Master_Session'Class) is
Stmt : ADO.Statements.Delete_Statement
:= Session.Create_Statement (MESSAGE_DEF'Access);
begin
Stmt.Set_Filter (Filter => "id = ?");
Stmt.Add_Param (Value => Object.Get_Key);
Stmt.Execute;
end Delete;
function Get_Value (From : in Message_Ref;
Name : in String) return Util.Beans.Objects.Object is
Obj : constant ADO.Objects.Object_Record_Access := From.Get_Load_Object;
Impl : access Message_Impl;
begin
if Obj = null then
return Util.Beans.Objects.Null_Object;
end if;
Impl := Message_Impl (Obj.all)'Access;
if Name = "id" then
return ADO.Objects.To_Object (Impl.Get_Key);
elsif Name = "create_date" then
return Util.Beans.Objects.Time.To_Object (Impl.Create_Date);
elsif Name = "priority" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (Impl.Priority));
elsif Name = "count" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (Impl.Count));
elsif Name = "parameters" then
return Util.Beans.Objects.To_Object (Impl.Parameters);
elsif Name = "server_id" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (Impl.Server_Id));
elsif Name = "task_id" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (Impl.Task_Id));
elsif Name = "status" then
return Message_Status_Type_Objects.To_Object (Impl.Status);
elsif Name = "processing_date" then
if Impl.Processing_Date.Is_Null then
return Util.Beans.Objects.Null_Object;
else
return Util.Beans.Objects.Time.To_Object (Impl.Processing_Date.Value);
end if;
elsif Name = "entity_id" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (Impl.Entity_Id));
elsif Name = "entity_type" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (Impl.Entity_Type));
elsif Name = "finish_date" then
if Impl.Finish_Date.Is_Null then
return Util.Beans.Objects.Null_Object;
else
return Util.Beans.Objects.Time.To_Object (Impl.Finish_Date.Value);
end if;
end if;
return Util.Beans.Objects.Null_Object;
end Get_Value;
procedure List (Object : in out Message_Vector;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class) is
Stmt : ADO.Statements.Query_Statement
:= Session.Create_Statement (Query, MESSAGE_DEF'Access);
begin
Stmt.Execute;
Message_Vectors.Clear (Object);
while Stmt.Has_Elements loop
declare
Item : Message_Ref;
Impl : constant Message_Access := new Message_Impl;
begin
Impl.Load (Stmt, Session);
ADO.Objects.Set_Object (Item, Impl.all'Access);
Object.Append (Item);
end;
Stmt.Next;
end loop;
end List;
-- ------------------------------
-- Load the object from current iterator position
-- ------------------------------
procedure Load (Object : in out Message_Impl;
Stmt : in out ADO.Statements.Query_Statement'Class;
Session : in out ADO.Sessions.Session'Class) is
begin
Object.Set_Key_Value (Stmt.Get_Identifier (0));
Object.Create_Date := Stmt.Get_Time (1);
Object.Priority := Stmt.Get_Integer (2);
Object.Count := Stmt.Get_Integer (3);
Object.Parameters := Stmt.Get_Unbounded_String (4);
Object.Server_Id := Stmt.Get_Integer (5);
Object.Task_Id := Stmt.Get_Integer (6);
Object.Status := Message_Status_Type'Val (Stmt.Get_Integer (7));
Object.Processing_Date := Stmt.Get_Time (8);
Object.Entity_Id := Stmt.Get_Identifier (10);
Object.Entity_Type := ADO.Entity_Type (Stmt.Get_Integer (11));
Object.Finish_Date := Stmt.Get_Time (12);
if not Stmt.Is_Null (13) then
Object.Queue.Set_Key_Value (Stmt.Get_Identifier (13), Session);
end if;
if not Stmt.Is_Null (14) then
Object.Message_Type.Set_Key_Value (Stmt.Get_Identifier (14), Session);
end if;
if not Stmt.Is_Null (15) then
Object.User.Set_Key_Value (Stmt.Get_Identifier (15), Session);
end if;
if not Stmt.Is_Null (16) then
Object.Session.Set_Key_Value (Stmt.Get_Identifier (16), Session);
end if;
Object.Version := Stmt.Get_Integer (9);
ADO.Objects.Set_Created (Object);
end Load;
end AWA.Events.Models;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . D I R E C T _ I O --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2016, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Ada.IO_Exceptions;
with System.Direct_IO;
with Interfaces.C_Streams;
generic
type Element_Type is private;
package Ada.Direct_IO is
pragma Compile_Time_Warning
(Element_Type'Has_Access_Values,
"Element_Type for Direct_IO instance has access values");
pragma Compile_Time_Warning
(Element_Type'Has_Tagged_Values,
"Element_Type for Direct_IO instance has tagged values");
type File_Type is limited private;
type File_Mode is (In_File, Inout_File, Out_File);
-- The following representation clause allows the use of unchecked
-- conversion for rapid translation between the File_Mode type
-- used in this package and System.File_IO.
for File_Mode use
(In_File => 0, -- System.File_IO.File_Mode'Pos (In_File)
Inout_File => 1, -- System.File_IO.File_Mode'Pos (Inout_File);
Out_File => 2); -- System.File_IO.File_Mode'Pos (Out_File)
type Count is range 0 .. System.Direct_IO.Count'Last;
subtype Positive_Count is Count range 1 .. Count'Last;
---------------------
-- File Management --
---------------------
procedure Create
(File : in out File_Type;
Mode : File_Mode := Inout_File;
Name : String := "";
Form : String := "");
procedure Open
(File : in out File_Type;
Mode : File_Mode;
Name : String;
Form : String := "");
procedure Close (File : in out File_Type);
procedure Delete (File : in out File_Type);
procedure Reset (File : in out File_Type; Mode : File_Mode);
procedure Reset (File : in out File_Type);
function Mode (File : File_Type) return File_Mode;
function Name (File : File_Type) return String;
function Form (File : File_Type) return String;
function Is_Open (File : File_Type) return Boolean;
procedure Flush (File : File_Type);
---------------------------------
-- Input and Output Operations --
---------------------------------
procedure Read
(File : File_Type;
Item : out Element_Type;
From : Positive_Count);
procedure Read
(File : File_Type;
Item : out Element_Type);
procedure Write
(File : File_Type;
Item : Element_Type;
To : Positive_Count);
procedure Write
(File : File_Type;
Item : Element_Type);
procedure Set_Index (File : File_Type; To : Positive_Count);
function Index (File : File_Type) return Positive_Count;
function Size (File : File_Type) return Count;
function End_Of_File (File : File_Type) return Boolean;
----------------
-- Exceptions --
----------------
Status_Error : exception renames IO_Exceptions.Status_Error;
Mode_Error : exception renames IO_Exceptions.Mode_Error;
Name_Error : exception renames IO_Exceptions.Name_Error;
Use_Error : exception renames IO_Exceptions.Use_Error;
Device_Error : exception renames IO_Exceptions.Device_Error;
End_Error : exception renames IO_Exceptions.End_Error;
Data_Error : exception renames IO_Exceptions.Data_Error;
private
-- The following procedures have a File_Type formal of mode IN OUT because
-- they may close the original file. The Close operation may raise an
-- exception, but in that case we want any assignment to the formal to
-- be effective anyway, so it must be passed by reference (or the caller
-- will be left with a dangling pointer).
pragma Export_Procedure
(Internal => Close,
External => "",
Mechanism => Reference);
pragma Export_Procedure
(Internal => Delete,
External => "",
Mechanism => Reference);
pragma Export_Procedure
(Internal => Reset,
External => "",
Parameter_Types => (File_Type),
Mechanism => Reference);
pragma Export_Procedure
(Internal => Reset,
External => "",
Parameter_Types => (File_Type, File_Mode),
Mechanism => (File => Reference));
type File_Type is new System.Direct_IO.File_Type;
Bytes : constant Interfaces.C_Streams.size_t :=
Interfaces.C_Streams.size_t'Max
(1, Element_Type'Max_Size_In_Storage_Elements);
-- Size of an element in storage units. The Max operation here is to ensure
-- that we allocate a single byte for zero-sized elements. It's a bit weird
-- to instantiate Direct_IO with zero sized elements, but it is legal and
-- this adjustment ensures that we don't get anomalous behavior.
pragma Inline (Close);
pragma Inline (Create);
pragma Inline (Delete);
pragma Inline (End_Of_File);
pragma Inline (Form);
pragma Inline (Index);
pragma Inline (Is_Open);
pragma Inline (Mode);
pragma Inline (Name);
pragma Inline (Open);
pragma Inline (Read);
pragma Inline (Reset);
pragma Inline (Set_Index);
pragma Inline (Size);
pragma Inline (Write);
end Ada.Direct_IO;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S E M _ A U X --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2010, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING3. If not, go to --
-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- 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 containing utility procedures used throughout the compiler,
-- and also by ASIS so dependencies are limited to ASIS included packages.
-- Historical note. Many of the routines here were originally in Einfo, but
-- Einfo is supposed to be a relatively low level package dealing with the
-- content of entities in the tree, so this package is used for routines that
-- require more than minimal semantic knowledge.
with Alloc; use Alloc;
with Table;
with Types; use Types;
package Sem_Aux is
--------------------------------
-- Obsolescent Warnings Table --
--------------------------------
-- This table records entities for which a pragma Obsolescent with a
-- message argument has been processed.
type OWT_Record is record
Ent : Entity_Id;
-- The entity to which the pragma applies
Msg : String_Id;
-- The string containing the message
end record;
package Obsolescent_Warnings is new Table.Table (
Table_Component_Type => OWT_Record,
Table_Index_Type => Int,
Table_Low_Bound => 0,
Table_Initial => Alloc.Obsolescent_Warnings_Initial,
Table_Increment => Alloc.Obsolescent_Warnings_Increment,
Table_Name => "Obsolescent_Warnings");
procedure Initialize;
-- Called at the start of compilation of each new main source file to
-- initialize the allocation of the Obsolescent_Warnings table. Note that
-- Initialize must not be called if Tree_Read is used.
procedure Tree_Read;
-- Initializes Obsolescent_Warnings table from current tree file using the
-- relevant Table.Tree_Read routine.
procedure Tree_Write;
-- Writes out Obsolescent_Warnings table to current tree file using the
-- relevant Table.Tree_Write routine.
-----------------
-- Subprograms --
-----------------
function Ancestor_Subtype (Typ : Entity_Id) return Entity_Id;
-- The argument Id is a type or subtype entity. If the argument is a
-- subtype then it returns the subtype or type from which the subtype was
-- obtained, otherwise it returns Empty.
function Available_View (Typ : Entity_Id) return Entity_Id;
-- Typ is typically a type that has the With_Type flag set. Returns the
-- non-limited view of the type, if available, otherwise the type itself.
-- For class-wide types, there is no direct link in the tree, so we have
-- to retrieve the class-wide type of the non-limited view of the Etype.
-- Returns the argument unchanged if it is not one of these cases.
function Constant_Value (Ent : Entity_Id) return Node_Id;
-- Id is a variable, constant, named integer, or named real entity. This
-- call obtains the initialization expression for the entity. Will return
-- Empty for for a deferred constant whose full view is not available or
-- in some other cases of internal entities, which cannot be treated as
-- constants from the point of view of constant folding. Empty is also
-- returned for variables with no initialization expression.
function Enclosing_Dynamic_Scope (Ent : Entity_Id) return Entity_Id;
-- For any entity, Ent, returns the closest dynamic scope in which the
-- entity is declared or Standard_Standard for library-level entities
function First_Discriminant (Typ : Entity_Id) return Entity_Id;
-- Typ is a type with discriminants. The discriminants are the first
-- entities declared in the type, so normally this is equivalent to
-- First_Entity. The exception arises for tagged types, where the tag
-- itself is prepended to the front of the entity chain, so the
-- First_Discriminant function steps past the tag if it is present.
function First_Stored_Discriminant (Typ : Entity_Id) return Entity_Id;
-- Typ is a type with discriminants. Gives the first discriminant stored
-- in an object of this type. In many cases, these are the same as the
-- normal visible discriminants for the type, but in the case of renamed
-- discriminants, this is not always the case.
--
-- For tagged types, and untagged types which are root types or derived
-- types but which do not rename discriminants in their root type, the
-- stored discriminants are the same as the actual discriminants of the
-- type, and hence this function is the same as First_Discriminant.
--
-- For derived non-tagged types that rename discriminants in the root type
-- this is the first of the discriminants that occur in the root type. To
-- be precise, in this case stored discriminants are entities attached to
-- the entity chain of the derived type which are a copy of the
-- discriminants of the root type. Furthermore their Is_Completely_Hidden
-- flag is set since although they are actually stored in the object, they
-- are not in the set of discriminants that is visible in the type.
--
-- For derived untagged types, the set of stored discriminants are the real
-- discriminants from Gigi's standpoint, i.e. those that will be stored in
-- actual objects of the type.
function First_Subtype (Typ : Entity_Id) return Entity_Id;
-- Applies to all types and subtypes. For types, yields the first subtype
-- of the type. For subtypes, yields the first subtype of the base type of
-- the subtype.
function First_Tag_Component (Typ : Entity_Id) return Entity_Id;
-- Typ must be a tagged record type. This function returns the Entity for
-- the first _Tag field in the record type.
function Is_By_Copy_Type (Ent : Entity_Id) return Boolean;
-- Ent is any entity. Returns True if Ent is a type entity where the type
-- is required to be passed by copy, as defined in (RM 6.2(3)).
function Is_By_Reference_Type (Ent : Entity_Id) return Boolean;
-- Ent is any entity. Returns True if Ent is a type entity where the type
-- is required to be passed by reference, as defined in (RM 6.2(4-9)).
function Is_Derived_Type (Ent : Entity_Id) return Boolean;
-- Determines if the given entity Ent is a derived type. Result is always
-- false if argument is not a type.
function Is_Generic_Formal (E : Entity_Id) return Boolean;
-- Determine whether E is a generic formal parameter. In particular this is
-- used to set the visibility of generic formals of a generic package
-- declared with a box or with partial parametrization.
function Is_Indefinite_Subtype (Ent : Entity_Id) return Boolean;
-- Ent is any entity. Determines if given entity is an unconstrained array
-- type or subtype, a discriminated record type or subtype with no initial
-- discriminant values or a class wide type or subtype and returns True if
-- so. False for other type entities, or any entities that are not types.
function Is_Immutably_Limited_Type (Ent : Entity_Id) return Boolean;
-- Ent is any entity. True for a type that is "inherently" limited (i.e.
-- cannot become nonlimited). From the Ada 2005 RM-7.5(8.1/2), "a type with
-- a part that is of a task, protected, or explicitly limited record type".
-- These are the types that are defined as return-by-reference types in Ada
-- 95 (see RM95-6.5(11-16)). In Ada 2005, these are the types that require
-- build-in-place for function calls. Note that build-in-place is allowed
-- for other types, too. This is also used for identifying pure procedures
-- whose calls should not be eliminated (RM 10.2.1(18/2)).
function Is_Limited_Type (Ent : Entity_Id) return Boolean;
-- Ent is any entity. Returns true if Ent is a limited type (limited
-- private type, limited interface type, task type, protected type,
-- composite containing a limited component, or a subtype of any of
-- these types).
function Nearest_Ancestor (Typ : Entity_Id) return Entity_Id;
-- Given a subtype Typ, this function finds out the nearest ancestor from
-- which constraints and predicates are inherited. There is no simple link
-- for doing this, consider:
--
-- subtype R is Integer range 1 .. 10;
-- type T is new R;
--
-- In this case the nearest ancestor is R, but the Etype of T'Base will
-- point to R'Base, so we have to go rummaging in the declarations to get
-- this information. It is used for making sure we freeze this before we
-- freeze Typ, and also for retrieving inherited predicate information.
-- For the case of base types or first subtypes, there is no useful entity
-- to return, so Empty is returned.
--
-- Note: this is similar to Ancestor_Subtype except that it also deals
-- with the case of derived types.
function Nearest_Dynamic_Scope (Ent : Entity_Id) return Entity_Id;
-- This is similar to Enclosing_Dynamic_Scope except that if Ent is itself
-- a dynamic scope, then it is returned. Otherwise the result is the same
-- as that returned by Enclosing_Dynamic_Scope.
function Next_Tag_Component (Tag : Entity_Id) return Entity_Id;
-- Tag must be an entity representing a _Tag field of a tagged record.
-- The result returned is the next _Tag field in this record, or Empty
-- if this is the last such field.
function Number_Discriminants (Typ : Entity_Id) return Pos;
-- Typ is a type with discriminants, yields number of discriminants in type
function Ultimate_Alias (Prim : Entity_Id) return Entity_Id;
pragma Inline (Ultimate_Alias);
-- Return the last entity in the chain of aliased entities of Prim. If Prim
-- has no alias return Prim.
end Sem_Aux;
|
with Ada.Text_IO;
procedure Goodbye_World is
begin
Ada.Text_IO.Put("Goodbye, World!");
end Goodbye_World;
|
with Ada.Text_IO;
with Ada.Command_Line; use Ada.Command_Line;
procedure SleepSort is
task type PrintTask (num : Integer);
task body PrintTask is begin
delay Duration (num) / 100.0;
Ada.Text_IO.Put(num'Img);
end PrintTask;
type TaskAcc is access PrintTask;
TaskList : array (1 .. Argument_Count) of TaskAcc;
begin
for i in TaskList'Range loop
TaskList(i) := new PrintTask(Integer'Value(Argument(i)));
end loop;
end SleepSort;
|
--PRÁCTICA 3: CÉSAR BORAO MORATINOS (Handlers.ads)
with Ada.Calendar;
with Lower_Layer_UDP;
package Handlers is
package LLU renames Lower_Layer_UDP;
procedure Client_Handler (From: in LLU.End_Point_Type;
To: in LLU.End_Point_Type;
P_Buffer: access LLU.Buffer_Type);
procedure Server_Handler (From: in LLU.End_Point_Type;
To: in LLU.End_Point_Type;
P_Buffer: access LLU.Buffer_Type);
end Handlers;
|
-- Abstract :
--
-- See spec.
--
-- Copyright (C) 2002 - 2005, 2008 - 2015, 2017 - 2020 Free Software Foundation, Inc.
--
-- This file is part of the WisiToken package.
--
-- The WisiToken package is free software; you can redistribute it
-- and/or modify it under terms of the GNU General Public License as
-- published by the Free Software Foundation; either version 3, or
-- (at your option) any later version. This library is distributed in
-- the hope that it will be useful, but WITHOUT ANY WARRANTY; without
-- even the implied warranty of MERCHAN- TABILITY or FITNESS FOR A
-- PARTICULAR PURPOSE.
--
-- As a special exception under Section 7 of GPL version 3, you are granted
-- additional permissions described in the GCC Runtime Library Exception,
-- version 3.1, as published by the Free Software Foundation.
pragma License (Modified_GPL);
with Ada.Containers;
with Ada.Text_IO;
with SAL.Gen_Definite_Doubly_Linked_Lists_Sorted;
package body WisiToken.Generate.LR.LALR_Generate is
type Item_ID is record
State : Unknown_State_Index := Unknown_State;
LHS : Token_ID := Invalid_Token_ID;
RHS : Productions.RHS_Arrays.Extended_Index := Productions.RHS_Arrays.No_Index;
Dot : Token_ID_Arrays.Extended_Index := Token_ID_Arrays.No_Index;
end record;
function Image (Item : in Item_ID) return String
is ("(" & Item.State'Image & ", " & Trimmed_Image ((Item.LHS, Item.RHS)) & ")");
function Compare (Left, Right : in Item_ID) return SAL.Compare_Result
is (if Left.State < Right.State then SAL.Less
elsif Left.State > Right.State then SAL.Greater
elsif Left.LHS < Right.LHS then SAL.Less
elsif Left.LHS > Right.LHS then SAL.Greater
elsif Left.RHS < Right.RHS then SAL.Less
elsif Left.RHS > Right.RHS then SAL.Greater
elsif Left.Dot < Right.Dot then SAL.Less
elsif Left.Dot > Right.Dot then SAL.Greater
else SAL.Equal);
package Item_ID_Lists is new SAL.Gen_Definite_Doubly_Linked_Lists_Sorted (Item_ID, Compare);
type Item_Map is record
From : Item_ID;
To : Item_ID_Lists.List;
end record;
function Compare (Left, Right : in Item_Map) return SAL.Compare_Result
is (Compare (Left.From, Right.From));
package Propagation_Lists is new SAL.Gen_Definite_Doubly_Linked_Lists_Sorted (Item_Map, Compare);
function Item_Ref
(Kernels : in out LR1_Items.Item_Set_List;
ID : in Item_ID)
return LR1_Items.Item_Lists.Variable_Reference_Type
is (LR1_Items.Item_Lists.Variable_Ref
(LR1_Items.Find (Prod => (ID.LHS, ID.RHS), Dot => ID.Dot, Set => Kernels (ID.State))));
function Propagate_Lookahead (Descriptor : in WisiToken.Descriptor) return Token_ID_Set_Access
is begin
return new Token_ID_Set'(LR1_Items.To_Lookahead (Descriptor.Last_Lookahead, Descriptor));
end Propagate_Lookahead;
function Null_Lookahead (Descriptor : in WisiToken.Descriptor) return Token_ID_Set_Access
is begin
return new Token_ID_Set'(Descriptor.First_Terminal .. Descriptor.Last_Lookahead => False);
end Null_Lookahead;
----------
-- Debug output
procedure Put (Propagations : in Propagation_Lists.List)
is
use Item_ID_Lists;
begin
for Map of Propagations loop
Ada.Text_IO.Put_Line ("From " & Image (Map.From));
for ID of Map.To loop
Ada.Text_IO.Put_Line ("To " & Image (ID));
end loop;
end loop;
end Put;
----------
-- Generate utils
function LALR_Goto_Transitions
(Kernel : in LR1_Items.Item_Set;
Symbol : in Token_ID;
First_Nonterm_Set : in Token_Array_Token_Set;
Grammar : in WisiToken.Productions.Prod_Arrays.Vector;
Descriptor : in WisiToken.Descriptor)
return LR1_Items.Item_Set
is
use Token_ID_Arrays;
use LR1_Items;
use LR1_Items.Item_Lists;
Goto_Set : Item_Set;
begin
for Item of Kernel.Set loop
if Item.Dot /= No_Index then
declare
Dot : constant Token_ID_Arrays.Cursor := Productions.Constant_Ref_RHS
(Grammar, Item.Prod).Tokens.To_Cursor (Item.Dot);
Dot_ID : constant Token_ID := Element (Dot);
Next_Dot : constant Token_ID_Arrays.Cursor := Next (Dot);
begin
-- If Symbol = EOF_Token, this is the start symbol accept
-- production; don't need a kernel with dot after EOF.
if (Dot_ID = Symbol and Symbol /= Descriptor.EOI_ID) and then
not Has_Element (Find (Item, Goto_Set))
then
Goto_Set.Set.Insert
((Prod => Item.Prod,
Dot => To_Index (Next_Dot),
Lookaheads => new Token_ID_Set'(Item.Lookaheads.all)));
if Trace_Generate_Table > Detail then
Ada.Text_IO.Put_Line ("LALR_Goto_Transitions 1 " & Image (Symbol, Descriptor));
Put (Grammar, Descriptor, Goto_Set);
end if;
end if;
if Dot_ID in Descriptor.First_Nonterminal .. Descriptor.Last_Nonterminal and then
First_Nonterm_Set (Dot_ID, Symbol)
then
-- Find the production(s) that create Dot_ID with first token Symbol
-- and put them in.
for Prod of Grammar loop
for RHS_2_I in Prod.RHSs.First_Index .. Prod.RHSs.Last_Index loop
declare
P_ID : constant Production_ID := (Prod.LHS, RHS_2_I);
Tokens : Token_ID_Arrays.Vector renames Prod.RHSs (RHS_2_I).Tokens;
Dot_2 : constant Token_ID_Arrays.Cursor := Tokens.First;
Next_Dot_2 : constant Token_ID_Arrays.Cursor := Next (Dot_2);
begin
if (Dot_ID = Prod.LHS or First_Nonterm_Set (Dot_ID, Prod.LHS)) and
(Has_Element (Dot_2) and then Element (Dot_2) = Symbol)
then
if not Has_Element (Find (P_ID, To_Index (Next_Dot_2), Goto_Set)) then
Goto_Set.Set.Insert
((Prod => P_ID,
Dot => To_Index (Next_Dot_2),
Lookaheads => Null_Lookahead (Descriptor)));
-- else already in goto set
end if;
end if;
end;
end loop;
end loop;
if Trace_Generate_Table > Detail then
Ada.Text_IO.Put_Line ("LALR_Goto_Transitions 2 " & Image (Symbol, Descriptor));
Put (Grammar, Descriptor, Goto_Set);
end if;
end if;
end;
end if; -- item.dot /= null
end loop;
return Goto_Set;
end LALR_Goto_Transitions;
function LALR_Kernels
(Grammar : in WisiToken.Productions.Prod_Arrays.Vector;
First_Nonterm_Set : in Token_Array_Token_Set;
Descriptor : in WisiToken.Descriptor)
return LR1_Items.Item_Set_List
is
use all type Ada.Containers.Count_Type;
use LR1_Items;
First_State_Index : constant State_Index := 0;
Kernels : LR1_Items.Item_Set_List;
Kernel_Tree : LR1_Items.Item_Set_Trees.Tree; -- for fast find
States_To_Check : State_Index_Queues.Queue;
Checking_State : State_Index;
begin
Kernels.Set_First_Last (First_State_Index, First_State_Index - 1);
Add (Grammar,
(Set => Item_Lists.To_List
((Prod => (Grammar.First_Index, 0),
Dot => Grammar (Grammar.First_Index).RHSs (0).Tokens.First_Index,
Lookaheads => Null_Lookahead (Descriptor))),
Goto_List => <>,
Dot_IDs => <>,
State => First_State_Index),
Kernels,
Kernel_Tree,
Descriptor,
Include_Lookaheads => False);
States_To_Check.Put (First_State_Index);
loop
exit when States_To_Check.Is_Empty;
Checking_State := States_To_Check.Get;
if Trace_Generate_Table > Detail then
Ada.Text_IO.Put ("Checking ");
Put (Grammar, Descriptor, Kernels (Checking_State));
end if;
for Symbol in Descriptor.First_Terminal .. Descriptor.Last_Nonterminal loop
-- LALR_Goto_Transitions does _not_ ignore Symbol if it is not in
-- Item_Set.Dot_IDs, so we can't iterate on that here as we do in
-- LR1_Generate.
declare
New_Item_Set : Item_Set := LALR_Goto_Transitions
(Kernels (Checking_State), Symbol, First_Nonterm_Set, Grammar, Descriptor);
Found_State : Unknown_State_Index;
begin
if New_Item_Set.Set.Length > 0 then
Found_State := Find (New_Item_Set, Kernel_Tree, Match_Lookaheads => False);
if Found_State = Unknown_State then
New_Item_Set.State := Kernels.Last_Index + 1;
States_To_Check.Put (New_Item_Set.State);
Add (Grammar, New_Item_Set, Kernels, Kernel_Tree, Descriptor, Include_Lookaheads => False);
if Trace_Generate_Table > Detail then
Ada.Text_IO.Put_Line (" adding state" & Unknown_State_Index'Image (Kernels.Last_Index));
Ada.Text_IO.Put_Line
(" state" & Unknown_State_Index'Image (Checking_State) &
" adding goto on " & Image (Symbol, Descriptor) & " to state" &
Unknown_State_Index'Image (Kernels.Last_Index));
end if;
Kernels (Checking_State).Goto_List.Insert ((Symbol, Kernels.Last_Index));
else
-- If there's not already a goto entry between these two sets, create one.
if not Is_In ((Symbol, Found_State), Kernels (Checking_State).Goto_List) then
if Trace_Generate_Table > Detail then
Ada.Text_IO.Put_Line
(" state" & Unknown_State_Index'Image (Checking_State) &
" adding goto on " & Image (Symbol, Descriptor) & " to state" &
Unknown_State_Index'Image (Found_State));
end if;
Kernels (Checking_State).Goto_List.Insert ((Symbol, Found_State));
end if;
end if;
end if;
end;
end loop;
end loop;
if Trace_Generate_Table > Detail then
Ada.Text_IO.New_Line;
end if;
return Kernels;
end LALR_Kernels;
-- Add a propagation entry (if it doesn't already exist) from From in
-- From_Set to To_Item.
procedure Add_Propagation
(From_Item : in LR1_Items.Item;
From_State : in State_Index;
To_Item : in LR1_Items.Item_Lists.Cursor;
To_State : in State_Index;
Propagations : in out Propagation_Lists.List)
is
use Propagation_Lists;
use LR1_Items;
use LR1_Items.Item_Lists;
use Item_ID_Lists;
To_Item_Ref : constant LR1_Items.Item_Lists.Constant_Reference_Type := Constant_Ref (To_Item);
From_ID : constant Item_ID := (From_State, From_Item.Prod.LHS, From_Item.Prod.RHS, From_Item.Dot);
To_ID : constant Item_ID := (To_State, To_Item_Ref.Prod.LHS, To_Item_Ref.Prod.RHS, To_Item_Ref.Dot);
From_Match : constant Propagation_Lists.Cursor := Propagations.Find ((From_ID, Item_ID_Lists.Empty_List));
begin
if not Has_Element (From_Match) then
Propagations.Insert ((From_ID, To_List (To_ID)));
else
declare
To_Match : constant Item_ID_Lists.Cursor := Constant_Ref (From_Match).To.Find (To_ID);
begin
if not Has_Element (To_Match) then
Variable_Ref (From_Match).To.Insert (To_ID);
end if;
end;
end if;
end Add_Propagation;
-- Calculate the lookaheads from Closure_Item for Source_Item.
-- Source_Item must be one of the kernel items in Source_Set.
-- Closure_Item must be an item in the lookahead closure of Source_Item for #.
--
-- Spontaneous lookaheads are put in Source_Item.Lookahead,
-- propagated lookaheads in Propagations.
--
-- Set Used_Tokens = True for all tokens in lookaheads.
procedure Generate_Lookahead_Info
(Source_Item : in LR1_Items.Item;
Source_Set : in LR1_Items.Item_Set;
Closure_Item : in LR1_Items.Item;
Propagations : in out Propagation_Lists.List;
Descriptor : in WisiToken.Descriptor;
Grammar : in WisiToken.Productions.Prod_Arrays.Vector;
Kernels : in out LR1_Items.Item_Set_List)
is
use LR1_Items;
use LR1_Items.Item_Lists;
use Token_ID_Arrays;
Spontaneous_Count : Integer := 0;
begin
if Trace_Generate_Table > Outline then
Ada.Text_IO.Put_Line (" closure_item: ");
LR1_Items.Put (Grammar, Descriptor, Closure_Item);
Ada.Text_IO.New_Line;
end if;
if Closure_Item.Dot = No_Index then
return;
end if;
declare
Dot : constant Token_ID_Arrays.Cursor := Productions.Constant_Ref_RHS
(Grammar, Closure_Item.Prod).Tokens.To_Cursor (Closure_Item.Dot);
ID : constant Token_ID := Element (Dot);
Next_Dot : constant Token_ID_Arrays.Cursor := Next (Dot);
Goto_State : constant Unknown_State_Index := LR1_Items.Goto_State (Source_Set, ID);
begin
if Goto_State /= Unknown_State then
declare
To_Item : constant Item_Lists.Cursor :=
LR1_Items.Find (Closure_Item.Prod, To_Index (Next_Dot), Kernels (Goto_State));
begin
if Closure_Item.Lookaheads (Descriptor.Last_Lookahead) then
Add_Propagation
(From_Item => Source_Item,
From_State => Source_Set.State,
To_Item => To_Item,
To_State => Goto_State,
Propagations => Propagations);
end if;
if Trace_Generate_Table > Outline then
Spontaneous_Count := Spontaneous_Count + 1;
Ada.Text_IO.Put_Line (" spontaneous: " & Lookahead_Image (Closure_Item.Lookaheads.all, Descriptor));
end if;
LR1_Items.Include (Variable_Ref (To_Item), Closure_Item.Lookaheads.all, Descriptor);
end;
end if;
end;
end Generate_Lookahead_Info;
procedure Propagate_Lookaheads
(Propagations : in Propagation_Lists.List;
Kernels : in out LR1_Items.Item_Set_List;
Descriptor : in WisiToken.Descriptor)
is
-- In Propagations, update all To lookaheads from From lookaheads,
-- recursively.
More_To_Check : Boolean := True;
Added_One : Boolean;
begin
while More_To_Check loop
More_To_Check := False;
for Map of Propagations loop
for ID of Map.To loop
LR1_Items.Include
(Item_Ref (Kernels, ID), Item_Ref (Kernels, Map.From).Lookaheads.all, Added_One, Descriptor);
More_To_Check := More_To_Check or Added_One;
end loop;
end loop;
end loop;
end Propagate_Lookaheads;
-- Calculate the LALR(1) lookaheads for Grammar.
-- Kernels should be the sets of LR(0) kernels on input, and will
-- become the set of LALR(1) kernels on output.
procedure Fill_In_Lookaheads
(Grammar : in WisiToken.Productions.Prod_Arrays.Vector;
Has_Empty_Production : in Token_ID_Set;
First_Terminal_Sequence : in Token_Sequence_Arrays.Vector;
Kernels : in out LR1_Items.Item_Set_List;
Descriptor : in WisiToken.Descriptor)
is
Closure : LR1_Items.Item_Set;
Propagations : Propagation_Lists.List;
begin
for Kernel of Kernels loop
if Trace_Generate_Table > Outline then
Ada.Text_IO.Put ("Adding lookaheads for ");
LR1_Items.Put (Grammar, Descriptor, Kernel);
end if;
for Kernel_Item of Kernel.Set loop
Closure := LR1_Items.Closure
((Set => LR1_Items.Item_Lists.To_List
((Prod => Kernel_Item.Prod,
Dot => Kernel_Item.Dot,
Lookaheads => Propagate_Lookahead (Descriptor))),
Goto_List => <>,
Dot_IDs => <>,
State => <>),
Has_Empty_Production, First_Terminal_Sequence, Grammar, Descriptor);
for Closure_Item of Closure.Set loop
Generate_Lookahead_Info
(Kernel_Item, Kernel, Closure_Item, Propagations, Descriptor, Grammar, Kernels);
end loop;
end loop;
end loop;
if Trace_Generate_Table > Outline then
Ada.Text_IO.New_Line;
Ada.Text_IO.Put_Line ("Propagations:");
Put (Propagations);
Ada.Text_IO.New_Line;
end if;
Propagate_Lookaheads (Propagations, Kernels, Descriptor);
end Fill_In_Lookaheads;
-- Add actions for all Kernels to Table.
procedure Add_Actions
(Kernels : in LR1_Items.Item_Set_List;
Grammar : in WisiToken.Productions.Prod_Arrays.Vector;
Has_Empty_Production : in Token_ID_Set;
First_Nonterm_Set : in Token_Array_Token_Set;
First_Terminal_Sequence : in Token_Sequence_Arrays.Vector;
Conflict_Counts : out Conflict_Count_Lists.List;
Conflicts : out Conflict_Lists.List;
Table : in out Parse_Table;
Descriptor : in WisiToken.Descriptor)
is
Closure : LR1_Items.Item_Set;
begin
for Kernel of Kernels loop
-- IMPROVEME: there are three "closure" computations that could
-- probably be refactored to save computation; in
-- LALR_Goto_Transitions, Fill_In_Lookaheads, and here.
Closure := LR1_Items.Closure (Kernel, Has_Empty_Production, First_Terminal_Sequence, Grammar, Descriptor);
Add_Actions
(Closure, Table, Grammar, Has_Empty_Production, First_Nonterm_Set,
Conflict_Counts, Conflicts, Descriptor);
end loop;
if Trace_Generate_Table > Detail then
Ada.Text_IO.New_Line;
end if;
end Add_Actions;
function Generate
(Grammar : in out WisiToken.Productions.Prod_Arrays.Vector;
Descriptor : in WisiToken.Descriptor;
Known_Conflicts : in Conflict_Lists.List := Conflict_Lists.Empty_List;
McKenzie_Param : in McKenzie_Param_Type := Default_McKenzie_Param;
Parse_Table_File_Name : in String := "";
Include_Extra : in Boolean := False;
Ignore_Conflicts : in Boolean := False;
Partial_Recursion : in Boolean := True)
return Parse_Table_Ptr
is
use all type Ada.Containers.Count_Type;
Ignore_Unused_Tokens : constant Boolean := WisiToken.Trace_Generate_Table > Detail;
Ignore_Unknown_Conflicts : constant Boolean := Ignore_Conflicts or WisiToken.Trace_Generate_Table > Detail;
Unused_Tokens : constant Boolean := WisiToken.Generate.Check_Unused_Tokens (Descriptor, Grammar);
Table : Parse_Table_Ptr;
Nullable : constant Token_Array_Production_ID := WisiToken.Generate.Nullable (Grammar);
Has_Empty_Production : constant Token_ID_Set := WisiToken.Generate.Has_Empty_Production (Nullable);
Recursions : constant WisiToken.Generate.Recursions :=
(if Partial_Recursion
then WisiToken.Generate.Compute_Partial_Recursion (Grammar, Descriptor)
else WisiToken.Generate.Compute_Full_Recursion (Grammar, Descriptor));
Minimal_Terminal_Sequences : constant Minimal_Sequence_Array :=
Compute_Minimal_Terminal_Sequences (Descriptor, Grammar);
Minimal_Terminal_First : constant Token_Array_Token_ID :=
Compute_Minimal_Terminal_First (Descriptor, Minimal_Terminal_Sequences);
First_Nonterm_Set : constant Token_Array_Token_Set := WisiToken.Generate.First
(Grammar, Has_Empty_Production, Descriptor.First_Terminal);
First_Terminal_Sequence : constant Token_Sequence_Arrays.Vector :=
WisiToken.Generate.To_Terminal_Sequence_Array (First_Nonterm_Set, Descriptor);
Kernels : LR1_Items.Item_Set_List := LALR_Kernels (Grammar, First_Nonterm_Set, Descriptor);
Conflict_Counts : Conflict_Count_Lists.List;
Unknown_Conflicts : Conflict_Lists.List;
Known_Conflicts_Edit : Conflict_Lists.List := Known_Conflicts;
begin
WisiToken.Generate.Error := False; -- necessary in unit tests; some previous test might have encountered an error.
if Trace_Generate_Table + Trace_Generate_Minimal_Complete > Outline then
Ada.Text_IO.New_Line;
Ada.Text_IO.Put_Line ("LALR_Generate");
end if;
Fill_In_Lookaheads (Grammar, Has_Empty_Production, First_Terminal_Sequence, Kernels, Descriptor);
if Unused_Tokens then
WisiToken.Generate.Error := not Ignore_Unused_Tokens;
Ada.Text_IO.New_Line;
end if;
if Trace_Generate_Table > Detail then
Ada.Text_IO.New_Line;
Ada.Text_IO.Put_Line ("LR(1) Kernels:");
LR1_Items.Put (Grammar, Descriptor, Kernels, Show_Lookaheads => True);
end if;
Table := new Parse_Table
(State_First => Kernels.First_Index,
State_Last => Kernels.Last_Index,
First_Terminal => Descriptor.First_Terminal,
Last_Terminal => Descriptor.Last_Terminal,
First_Nonterminal => Descriptor.First_Nonterminal,
Last_Nonterminal => Descriptor.Last_Nonterminal);
if McKenzie_Param = Default_McKenzie_Param then
-- Descriminants in Default are wrong
Table.McKenzie_Param :=
(First_Terminal => Descriptor.First_Terminal,
Last_Terminal => Descriptor.Last_Terminal,
First_Nonterminal => Descriptor.First_Nonterminal,
Last_Nonterminal => Descriptor.Last_Nonterminal,
Insert => (others => 0),
Delete => (others => 0),
Push_Back => (others => 0),
Undo_Reduce => (others => 0),
Minimal_Complete_Cost_Delta => Default_McKenzie_Param.Minimal_Complete_Cost_Delta,
Fast_Forward => Default_McKenzie_Param.Fast_Forward,
Matching_Begin => Default_McKenzie_Param.Matching_Begin,
Ignore_Check_Fail => Default_McKenzie_Param.Ignore_Check_Fail,
Task_Count => Default_McKenzie_Param.Task_Count,
Check_Limit => Default_McKenzie_Param.Check_Limit,
Check_Delta_Limit => Default_McKenzie_Param.Check_Delta_Limit,
Enqueue_Limit => Default_McKenzie_Param.Enqueue_Limit);
else
Table.McKenzie_Param := McKenzie_Param;
end if;
Add_Actions
(Kernels, Grammar, Has_Empty_Production, First_Nonterm_Set, First_Terminal_Sequence, Conflict_Counts,
Unknown_Conflicts, Table.all, Descriptor);
for State in Table.States'Range loop
if Trace_Generate_Minimal_Complete > Extra then
Ada.Text_IO.Put_Line ("Set_Minimal_Complete_Actions:" & State_Index'Image (State));
end if;
WisiToken.Generate.LR.Set_Minimal_Complete_Actions
(Table.States (State), Kernels (State), Descriptor, Grammar, Nullable, Minimal_Terminal_Sequences,
Minimal_Terminal_First);
end loop;
if Parse_Table_File_Name /= "" then
WisiToken.Generate.LR.Put_Parse_Table
(Table, Parse_Table_File_Name, "LALR", Grammar, Recursions, Kernels, Conflict_Counts, Descriptor,
Include_Extra);
end if;
Delete_Known (Unknown_Conflicts, Known_Conflicts_Edit);
if Unknown_Conflicts.Length > 0 then
Ada.Text_IO.Put_Line (Ada.Text_IO.Current_Error, "unknown conflicts:");
Put (Unknown_Conflicts, Ada.Text_IO.Current_Error, Descriptor);
Ada.Text_IO.New_Line (Ada.Text_IO.Current_Error);
WisiToken.Generate.Error := WisiToken.Generate.Error or not Ignore_Unknown_Conflicts;
end if;
if Known_Conflicts_Edit.Length > 0 then
Ada.Text_IO.Put_Line (Ada.Text_IO.Current_Error, "excess known conflicts:");
Put (Known_Conflicts_Edit, Ada.Text_IO.Current_Error, Descriptor);
Ada.Text_IO.New_Line (Ada.Text_IO.Current_Error);
WisiToken.Generate.Error := WisiToken.Generate.Error or not Ignore_Unknown_Conflicts;
end if;
return Table;
end Generate;
end WisiToken.Generate.LR.LALR_Generate;
|
-- { dg-do compile }
with System.Pool_Global;
package Storage is
x1: System.Pool_Global.Unbounded_No_Reclaim_Pool;
type T1 is access integer;
for T1'Storage_Pool use (x1); -- { dg-error "must be a variable" }
type T2 is access Integer;
for T2'Storage_Pool use x1;
end Storage;
|
-- see OpenUxAS\src\Communications\AddressedAttributedMessage.h
package UxAS.Comms.Data.Addressed.Attributed is
Type_Name : constant String := "AddressedAttributedMessage";
Minimum_Delimited_Address_Attribute_Message_String_Length : constant := 11;
Address_Attributes_Delimiter : constant String := Addressed.Address_Attributes_Delimiter; -- re-export
Field_Delimiter : constant String := UxAS.Comms.Data.Addressed.Field_Delimiter; -- re-export
type Addressed_Attributed_Message is new Addressed_Message with private;
type Addressed_Attributed_Message_Ref is access all Addressed_Attributed_Message;
type Any_Addressed_Attributed_Message is access all Addressed_Attributed_Message'Class;
-- bool
-- setAddressAttributesAndPayload
-- (const std::string address,
-- const std::string contentType,
-- const std::string descriptor,
-- const std::string sourceGroup,
-- const std::string sourceEntityId,
-- const std::string sourceServiceId,
-- const std::string payload)
procedure Set_Address_Attributes_And_Payload
(This : in out Addressed_Attributed_Message;
Address : String;
Content_Type : String;
Descriptor : String;
Source_Group : String; -- TODO: can be empty???
Source_Entity_Id : String;
Source_Service_Id : String;
Payload : String;
Result : out Boolean)
with Pre'Class =>
Address'Length in 1 .. Address_Max_Length and then
Is_Valid_Address (Address) and then
Content_Type'Length in 1 .. Content_Type_Max_Length and then
Descriptor'Length in 1 .. Descriptor_Max_Length and then
Source_Group'Length <= Source_Group_Max_Length and then
Source_Entity_Id'Length in 1 .. Source_Entity_Id_Max_Length and then
Source_Service_Id'Length in 1 .. Source_Service_Id_Max_Length;
-- bool
-- updateSourceAttributes(const std::string sourceGroup, const std::string sourceEntityId, const std::string sourceServiceId)
procedure Update_Source_Attributes
(This : in out Addressed_Attributed_Message;
Source_Group : String;
Source_Entity_Id : String;
Source_Service_Id : String;
Result : out Boolean)
with Pre'Class =>
Source_Group'Length <= Source_Group_Max_Length and then
Source_Entity_Id'Length in 1 .. Source_Entity_Id_Max_Length and then
Source_Service_Id'Length in 1 .. Source_Service_Id_Max_Length;
procedure Update_Address
(This : in out Addressed_Attributed_Message;
Address : String;
Result : out Boolean)
with Pre'Class =>
Address'Length in 1 .. Address_Max_Length;
procedure Set_Address_Attributes_And_Payload_From_Delimited_String
(This : in out Addressed_Attributed_Message;
Delimited_String : String;
Result : out Boolean)
with Pre'Class =>
Delimited_String'Length >= Minimum_Delimited_Address_Attribute_Message_String_Length;
-- Message address, attributes and payload combined into a single, delimited string.
-- virtual
-- const std::string&
-- getString() const
overriding
function Content_String (This : Addressed_Attributed_Message) return String;
-- Ownership transfer accessor for message attributes.
-- std::unique_ptr<MessageAttributes>
-- getMessageAttributesOwnership()
function Message_Attributes_Ownership (This : Addressed_Attributed_Message) return Message_Attributes_Ref;
-- Note: In Ada, this routine makes no change, it just return the current pointer
-- Read-only accessor for message attributes.
-- const std::unique_ptr<MessageAttributes>&
-- getMessageAttributesReference()
function Message_Attributes_Reference (This : Addressed_Attributed_Message) return Message_Attributes_View;
private
type Addressed_Attributed_Message is new Addressed_Message with record
-- std::unique_ptr<MessageAttributes> m_messageAttributes;
Attributes : Message_Attributes_Ref; -- TODO: indirection for sake of ownership and read-only view?
end record;
-- bool
-- parseAddressedAttributedMessageStringAndSetFields(const std::string delimitedString)
procedure Parse_Addressed_Attributed_Message_String_And_Set_Fields
(This : in out Addressed_Attributed_Message;
Delimited_String : String;
Result : out Boolean)
with Pre'Class => Delimited_String'Length >= Minimum_Delimited_Address_Attribute_Message_String_Length;
end UxAS.Comms.Data.Addressed.Attributed;
|
procedure Puzzle_18 is
begin
null;
end Puzzle_18;
|
------------------------------------------------------------------------------
-- --
-- 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.Generic_Collections;
package AMF.UMLDI.UML_Object_Diagrams.Collections is
pragma Preelaborate;
package UMLDI_UML_Object_Diagram_Collections is
new AMF.Generic_Collections
(UMLDI_UML_Object_Diagram,
UMLDI_UML_Object_Diagram_Access);
type Set_Of_UMLDI_UML_Object_Diagram is
new UMLDI_UML_Object_Diagram_Collections.Set with null record;
Empty_Set_Of_UMLDI_UML_Object_Diagram : constant Set_Of_UMLDI_UML_Object_Diagram;
type Ordered_Set_Of_UMLDI_UML_Object_Diagram is
new UMLDI_UML_Object_Diagram_Collections.Ordered_Set with null record;
Empty_Ordered_Set_Of_UMLDI_UML_Object_Diagram : constant Ordered_Set_Of_UMLDI_UML_Object_Diagram;
type Bag_Of_UMLDI_UML_Object_Diagram is
new UMLDI_UML_Object_Diagram_Collections.Bag with null record;
Empty_Bag_Of_UMLDI_UML_Object_Diagram : constant Bag_Of_UMLDI_UML_Object_Diagram;
type Sequence_Of_UMLDI_UML_Object_Diagram is
new UMLDI_UML_Object_Diagram_Collections.Sequence with null record;
Empty_Sequence_Of_UMLDI_UML_Object_Diagram : constant Sequence_Of_UMLDI_UML_Object_Diagram;
private
Empty_Set_Of_UMLDI_UML_Object_Diagram : constant Set_Of_UMLDI_UML_Object_Diagram
:= (UMLDI_UML_Object_Diagram_Collections.Set with null record);
Empty_Ordered_Set_Of_UMLDI_UML_Object_Diagram : constant Ordered_Set_Of_UMLDI_UML_Object_Diagram
:= (UMLDI_UML_Object_Diagram_Collections.Ordered_Set with null record);
Empty_Bag_Of_UMLDI_UML_Object_Diagram : constant Bag_Of_UMLDI_UML_Object_Diagram
:= (UMLDI_UML_Object_Diagram_Collections.Bag with null record);
Empty_Sequence_Of_UMLDI_UML_Object_Diagram : constant Sequence_Of_UMLDI_UML_Object_Diagram
:= (UMLDI_UML_Object_Diagram_Collections.Sequence with null record);
end AMF.UMLDI.UML_Object_Diagrams.Collections;
|
-----------------------------------------------------------------------
-- asf-routes-servlets-faces -- faces request routing
-- Copyright (C) 2015 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;
package ASF.Routes.Servlets.Faces is
type Faces_Route_Type is new Servlet_Route_Type with record
View : Ada.Strings.Unbounded.Unbounded_String;
end record;
type Faces_Route_Type_Access is access all Faces_Route_Type'Class;
end ASF.Routes.Servlets.Faces;
|
package body iconv.Generic_Strings is
use type Ada.Streams.Stream_Element_Offset;
pragma Compile_Time_Error (
String_Type'Component_Size /= Character_Type'Size,
"String_Type is not packed");
pragma Compile_Time_Error (
Character_Type'Size rem Ada.Streams.Stream_Element'Size /= 0,
"String_Type could not be treated as Stream_Element_Array");
-- decoder
function From (
From_Encoding : String;
To_Encoding : String := Default_Encoding)
return Decoder is
begin
return Result : Decoder do
Do_Open (Converter (Result), To => To_Encoding, From => From_Encoding);
end return;
end From;
procedure Decode (
Object : in Decoder;
In_Item : in Ada.Streams.Stream_Element_Array;
In_Last : out Ada.Streams.Stream_Element_Offset;
Out_Item : out String_Type;
Out_Last : out Natural;
Finish : in Boolean;
Status : out Subsequence_Status_Type)
is
CS_In_SE : constant Ada.Streams.Stream_Element_Count :=
Character_Type'Size / Ada.Streams.Stream_Element'Size;
Out_Item_2 :
Ada.Streams.Stream_Element_Array (1 .. Out_Item'Length * CS_In_SE);
for Out_Item_2'Address use Out_Item'Address;
Out_Last_2 : Ada.Streams.Stream_Element_Offset;
begin
Convert (
Object,
In_Item,
In_Last,
Out_Item_2,
Out_Last_2,
Finish => Finish,
Status => Status);
pragma Assert (Out_Last_2 rem CS_In_SE = 0);
Out_Last := Out_Item'First + Natural (Out_Last_2 / CS_In_SE) - 1;
end Decode;
procedure Decode (
Object : in Decoder;
In_Item : in Ada.Streams.Stream_Element_Array;
In_Last : out Ada.Streams.Stream_Element_Offset;
Out_Item : out String_Type;
Out_Last : out Natural;
Status : out Continuing_Status_Type)
is
CS_In_SE : constant Ada.Streams.Stream_Element_Count :=
Character_Type'Size / Ada.Streams.Stream_Element'Size;
Out_Item_2 :
Ada.Streams.Stream_Element_Array (1 .. Out_Item'Length * CS_In_SE);
for Out_Item_2'Address use Out_Item'Address;
Out_Last_2 : Ada.Streams.Stream_Element_Offset;
begin
Convert (
Object,
In_Item,
In_Last,
Out_Item_2,
Out_Last_2,
Status => Status);
pragma Assert (Out_Last_2 rem CS_In_SE = 0);
Out_Last := Out_Item'First + Natural (Out_Last_2 / CS_In_SE) - 1;
end Decode;
procedure Decode (
Object : in Decoder;
Out_Item : out String_Type;
Out_Last : out Natural;
Finish : in True_Only;
Status : out Finishing_Status_Type)
is
CS_In_SE : constant Ada.Streams.Stream_Element_Count :=
Character_Type'Size / Ada.Streams.Stream_Element'Size;
Out_Item_2 :
Ada.Streams.Stream_Element_Array (1 .. Out_Item'Length * CS_In_SE);
for Out_Item_2'Address use Out_Item'Address;
Out_Last_2 : Ada.Streams.Stream_Element_Offset;
begin
Convert (
Object,
Out_Item_2,
Out_Last_2,
Finish => Finish,
Status => Status);
pragma Assert (Out_Last_2 rem CS_In_SE = 0);
Out_Last := Out_Item'First + Natural (Out_Last_2 / CS_In_SE) - 1;
end Decode;
procedure Decode (
Object : in Decoder;
In_Item : in Ada.Streams.Stream_Element_Array;
In_Last : out Ada.Streams.Stream_Element_Offset;
Out_Item : out String_Type;
Out_Last : out Natural;
Finish : in True_Only;
Status : out Status_Type)
is
CS_In_SE : constant Ada.Streams.Stream_Element_Count :=
Character_Type'Size / Ada.Streams.Stream_Element'Size;
Out_Item_2 :
Ada.Streams.Stream_Element_Array (1 .. Out_Item'Length * CS_In_SE);
for Out_Item_2'Address use Out_Item'Address;
Out_Last_2 : Ada.Streams.Stream_Element_Offset;
begin
Convert (
Object,
In_Item,
In_Last,
Out_Item_2,
Out_Last_2,
Finish => Finish,
Status => Status);
pragma Assert (Out_Last_2 rem CS_In_SE = 0);
Out_Last := Out_Item'First + Natural (Out_Last_2 / CS_In_SE) - 1;
end Decode;
procedure Decode (
Object : in Decoder;
In_Item : in Ada.Streams.Stream_Element_Array;
In_Last : out Ada.Streams.Stream_Element_Offset;
Out_Item : out String_Type;
Out_Last : out Natural;
Finish : in True_Only;
Status : out Substituting_Status_Type)
is
CS_In_SE : constant Ada.Streams.Stream_Element_Count :=
Character_Type'Size / Ada.Streams.Stream_Element'Size;
Out_Item_2 :
Ada.Streams.Stream_Element_Array (1 .. Out_Item'Length * CS_In_SE);
for Out_Item_2'Address use Out_Item'Address;
Out_Last_2 : Ada.Streams.Stream_Element_Offset;
begin
Convert (
Object,
In_Item,
In_Last,
Out_Item_2,
Out_Last_2,
Finish => Finish,
Status => Status);
pragma Assert (Out_Last_2 rem CS_In_SE = 0);
Out_Last := Out_Item'First + Natural (Out_Last_2 / CS_In_SE) - 1;
end Decode;
function Decode (Object : Decoder; S : Ada.Streams.Stream_Element_Array)
return String_Type
is
In_Last : Ada.Streams.Stream_Element_Offset := S'First - 1;
Result : String_Type (1 .. Max_Length_Of_Single_Character * S'Length);
Out_Last : Natural := 0;
Status : Substituting_Status_Type;
begin
loop
Decode (
Object,
S (In_Last + 1 .. S'Last),
In_Last,
Result (Out_Last + 1 .. Result'Last),
Out_Last,
Finish => True,
Status => Status);
case Status is
when Finished =>
exit;
when Success =>
null;
when Overflow =>
raise Constraint_Error;
end case;
end loop;
return Result (Result'First .. Out_Last);
end Decode;
-- encoder
function To (
To_Encoding : String;
From_Encoding : String := Default_Encoding)
return Encoder is
begin
return Result : Encoder do
Do_Open (Converter (Result), To => To_Encoding, From => From_Encoding);
end return;
end To;
procedure Encode (
Object : in Encoder;
In_Item : in String_Type;
In_Last : out Natural;
Out_Item : out Ada.Streams.Stream_Element_Array;
Out_Last : out Ada.Streams.Stream_Element_Offset;
Finish : in Boolean;
Status : out Subsequence_Status_Type)
is
CS_In_SE : constant Ada.Streams.Stream_Element_Count :=
Character_Type'Size / Ada.Streams.Stream_Element'Size;
In_Item_2 : Ada.Streams.Stream_Element_Array (1 .. In_Item'Length * CS_In_SE);
for In_Item_2'Address use In_Item'Address;
In_Last_2 : Ada.Streams.Stream_Element_Offset;
begin
Convert (
Object,
In_Item_2,
In_Last_2,
Out_Item,
Out_Last,
Finish => Finish,
Status => Status);
pragma Assert (In_Last_2 rem CS_In_SE = 0);
In_Last := In_Item'First + Natural (In_Last_2 / CS_In_SE) - 1;
end Encode;
procedure Encode (
Object : in Encoder;
In_Item : in String_Type;
In_Last : out Natural;
Out_Item : out Ada.Streams.Stream_Element_Array;
Out_Last : out Ada.Streams.Stream_Element_Offset;
Status : out Continuing_Status_Type)
is
CS_In_SE : constant Ada.Streams.Stream_Element_Count :=
Character_Type'Size / Ada.Streams.Stream_Element'Size;
In_Item_2 : Ada.Streams.Stream_Element_Array (1 .. In_Item'Length * CS_In_SE);
for In_Item_2'Address use In_Item'Address;
In_Last_2 : Ada.Streams.Stream_Element_Offset;
begin
Convert (
Object,
In_Item_2,
In_Last_2,
Out_Item,
Out_Last,
Status => Status);
pragma Assert (In_Last_2 rem CS_In_SE = 0);
In_Last := In_Item'First + Natural (In_Last_2 / CS_In_SE) - 1;
end Encode;
procedure Encode (
Object : in Encoder;
In_Item : in String_Type;
In_Last : out Natural;
Out_Item : out Ada.Streams.Stream_Element_Array;
Out_Last : out Ada.Streams.Stream_Element_Offset;
Finish : in True_Only;
Status : out Status_Type)
is
CS_In_SE : constant Ada.Streams.Stream_Element_Count :=
Character_Type'Size / Ada.Streams.Stream_Element'Size;
In_Item_2 : Ada.Streams.Stream_Element_Array (1 .. In_Item'Length * CS_In_SE);
for In_Item_2'Address use In_Item'Address;
In_Last_2 : Ada.Streams.Stream_Element_Offset;
begin
Convert (
Object,
In_Item_2,
In_Last_2,
Out_Item,
Out_Last,
Finish => Finish,
Status => Status);
pragma Assert (In_Last_2 rem CS_In_SE = 0);
In_Last := In_Item'First + Natural (In_Last_2 / CS_In_SE) - 1;
end Encode;
procedure Encode (
Object : in Encoder;
In_Item : in String_Type;
In_Last : out Natural;
Out_Item : out Ada.Streams.Stream_Element_Array;
Out_Last : out Ada.Streams.Stream_Element_Offset;
Finish : in True_Only;
Status : out Substituting_Status_Type)
is
CS_In_SE : constant Ada.Streams.Stream_Element_Count :=
Character_Type'Size / Ada.Streams.Stream_Element'Size;
In_Item_2 : Ada.Streams.Stream_Element_Array (1 .. In_Item'Length * CS_In_SE);
for In_Item_2'Address use In_Item'Address;
In_Last_2 : Ada.Streams.Stream_Element_Offset;
begin
Convert (
Object,
In_Item_2,
In_Last_2,
Out_Item,
Out_Last,
Finish => Finish,
Status => Status);
pragma Assert (In_Last_2 rem CS_In_SE = 0);
In_Last := In_Item'First + Natural (In_Last_2 / CS_In_SE) - 1;
end Encode;
function Encode (Object : Encoder; S : String_Type)
return Ada.Streams.Stream_Element_Array
is
CS_In_SE : constant Ada.Streams.Stream_Element_Count :=
Character_Type'Size / Ada.Streams.Stream_Element'Size;
In_Last : Natural := S'First - 1;
Result :
Ada.Streams.Stream_Element_Array (
0 .. CS_In_SE * Max_Length_Of_Single_Character * S'Length - 1);
Out_Last : Ada.Streams.Stream_Element_Offset := -1;
Status : Substituting_Status_Type;
begin
loop
Encode (
Object,
S (In_Last + 1 .. S'Last),
In_Last,
Result (Out_Last + 1 .. Result'Last),
Out_Last,
Finish => True,
Status => Status);
case Status is
when Finished =>
exit;
when Success =>
null;
when Overflow =>
raise Constraint_Error;
end case;
end loop;
return Result (Result'First .. Out_Last);
end Encode;
end iconv.Generic_Strings;
|
-- Copyright 2008-2014 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with System;
package Pck is
procedure Do_Nothing (A : System.Address);
end Pck;
|
-- 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
procedure Call_Me (Str : String) is
begin
Length := Str'Length;
if Length > 0 then
First := Str (Str'First);
Last := Str (Str'Last);
end if;
end Call_Me;
end Pck;
|
-- ___ _ ___ _ _ --
-- / __| |/ (_) | | Common SKilL implementation --
-- \__ \ ' <| | | |__ top level package --
-- |___/_|\_\_|_|____| by: Timm Felden, Dennis Przytarski --
-- --
pragma Ada_2012;
package Skill is
pragma Pure;
end Skill;
|
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="15">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName/>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>conv_read</name>
<ret_bitwidth>32</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>cofm</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>cofm</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>512</bitwidth>
</Value>
<direction>2</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>ofm_buff0_0</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>ofm_buff0[0]</originalName>
<rtlName/>
<coreName>RAM</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>56</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>ofm_buff0_1</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>ofm_buff0[1]</originalName>
<rtlName/>
<coreName>RAM</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>56</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>ofm_buff0_2</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>ofm_buff0[2]</originalName>
<rtlName/>
<coreName>RAM</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>56</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>ofm_buff0_3</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>ofm_buff0[3]</originalName>
<rtlName/>
<coreName>RAM</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>56</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>ofm_buff0_4</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>ofm_buff0[4]</originalName>
<rtlName/>
<coreName>RAM</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>56</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>ofm_buff0_5</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>ofm_buff0[5]</originalName>
<rtlName/>
<coreName>RAM</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>56</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>cofm_counter_read</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>cofm_counter</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_9">
<Value>
<Obj>
<type>1</type>
<id>9</id>
<name>enable</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>enable</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>36</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>enable_read</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>217</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>D:\Course\mSOC\final</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>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>217</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>enable</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>58</item>
<item>59</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>cofm_counter_read_1</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>217</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>217</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>cofm_counter</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>61</item>
<item>62</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name>_ln219</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>219</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>219</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>63</item>
<item>64</item>
<item>65</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>3</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>add_ln221</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>221</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>221</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>add_ln221_fu_191_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>66</item>
<item>68</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.55</m_delay>
<m_topoIndex>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>_ln221</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>221</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>221</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>69</item>
</oprand_edges>
<opcode>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>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>j_0</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>70</item>
<item>71</item>
<item>73</item>
<item>74</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>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>icmp_ln221</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>221</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>221</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>icmp_ln221_fu_197_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>75</item>
<item>77</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>7</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>j</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>221</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>221</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName>j_fu_203_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>78</item>
<item>80</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>8</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>_ln221</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>221</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>221</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>81</item>
<item>82</item>
<item>83</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>9</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>zext_ln224</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>224</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>224</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>zext_ln224_fu_209_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>10</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>ofm_buff0_0_addr</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>224</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>224</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>85</item>
<item>87</item>
<item>88</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>11</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>ofm_buff0_0_load</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>224</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>224</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.25</m_delay>
<m_topoIndex>12</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>bitcast_ln224</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>224</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>224</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>bitcast_ln224_fu_219_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>90</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>23</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>cofm_read</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>224</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>224</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>512</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>92</item>
<item>93</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>1</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>1</m_isLCDNode>
<m_isStartOfPath>1</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="_24">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>ofm_buff0_1_addr</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>225</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>225</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>94</item>
<item>95</item>
<item>96</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>13</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>ofm_buff0_1_load</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>225</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>225</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>97</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.25</m_delay>
<m_topoIndex>14</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>bitcast_ln225</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>225</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>225</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>bitcast_ln225_fu_223_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>98</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>25</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>ofm_buff0_2_addr</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>226</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>226</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>99</item>
<item>100</item>
<item>101</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>15</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>ofm_buff0_2_load</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>226</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>226</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>102</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.25</m_delay>
<m_topoIndex>16</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>bitcast_ln226</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>226</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>226</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>bitcast_ln226_fu_227_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>103</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>26</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>ofm_buff0_3_addr</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>227</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>227</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>104</item>
<item>105</item>
<item>106</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>17</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name>ofm_buff0_3_load</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>227</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>227</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>107</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.25</m_delay>
<m_topoIndex>18</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>bitcast_ln227</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>227</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>227</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>bitcast_ln227_fu_231_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>108</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>27</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>ofm_buff0_4_addr</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>228</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>228</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>109</item>
<item>110</item>
<item>111</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>19</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>ofm_buff0_4_load</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>228</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>228</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>112</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.25</m_delay>
<m_topoIndex>20</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>bitcast_ln228</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>228</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>228</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>bitcast_ln228_fu_235_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>113</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>28</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>ofm_buff0_5_addr</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>229</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>229</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>114</item>
<item>115</item>
<item>116</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>21</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>ofm_buff0_5_load</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>229</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>229</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>117</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.25</m_delay>
<m_topoIndex>22</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>bitcast_ln229</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>229</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>229</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>bitcast_ln229_fu_239_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>118</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>29</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>tmp_3</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>229</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>229</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_3_fu_243_p7</rtlName>
<coreName/>
</Obj>
<bitwidth>192</bitwidth>
</Value>
<oprand_edges>
<count>7</count>
<item_version>0</item_version>
<item>120</item>
<item>121</item>
<item>122</item>
<item>123</item>
<item>124</item>
<item>125</item>
<item>126</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>30</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name>cofm_b5_addr1516_par</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>229</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>229</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>cofm_b5_addr1516_par_fu_259_p5</rtlName>
<coreName/>
</Obj>
<bitwidth>512</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>128</item>
<item>129</item>
<item>130</item>
<item>132</item>
<item>134</item>
</oprand_edges>
<opcode>partset</opcode>
<m_Display>0</m_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="_41">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name>cofm_write_ln229</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>229</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>229</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>136</item>
<item>137</item>
<item>138</item>
<item>201</item>
<item>2147483647</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>1</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>1</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>32</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>_ln221</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>221</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>221</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<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>
<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="_43">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name>_ln0</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>140</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.76</m_delay>
<m_topoIndex>34</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>54</id>
<name>cofm_counter_1</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>217</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>217</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</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>
<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="_45">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>_ln244</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>244</lineNumber>
<contextFuncName>conv_read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>conv_read</second>
</first>
<second>244</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>145</item>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>36</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_46">
<Value>
<Obj>
<type>2</type>
<id>67</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>56</content>
</item>
<item class_id_reference="16" object_id="_47">
<Value>
<Obj>
<type>2</type>
<id>72</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_48">
<Value>
<Obj>
<type>2</type>
<id>76</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<const_type>0</const_type>
<content>56</content>
</item>
<item class_id_reference="16" object_id="_49">
<Value>
<Obj>
<type>2</type>
<id>79</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_50">
<Value>
<Obj>
<type>2</type>
<id>86</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_51">
<Value>
<Obj>
<type>2</type>
<id>131</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_52">
<Value>
<Obj>
<type>2</type>
<id>133</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>191</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_53">
<Obj>
<type>3</type>
<id>14</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>11</item>
<item>12</item>
<item>13</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_54">
<Obj>
<type>3</type>
<id>17</id>
<name>.preheader.preheader</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>15</item>
<item>16</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_55">
<Obj>
<type>3</type>
<id>23</id>
<name>.preheader</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>18</item>
<item>19</item>
<item>21</item>
<item>22</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_56">
<Obj>
<type>3</type>
<id>51</id>
<name>hls_label_6</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>24</count>
<item_version>0</item_version>
<item>26</item>
<item>27</item>
<item>28</item>
<item>29</item>
<item>30</item>
<item>31</item>
<item>32</item>
<item>33</item>
<item>34</item>
<item>35</item>
<item>36</item>
<item>37</item>
<item>38</item>
<item>39</item>
<item>40</item>
<item>41</item>
<item>42</item>
<item>43</item>
<item>44</item>
<item>45</item>
<item>46</item>
<item>47</item>
<item>48</item>
<item>50</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_57">
<Obj>
<type>3</type>
<id>53</id>
<name>.loopexit.loopexit</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_58">
<Obj>
<type>3</type>
<id>56</id>
<name>.loopexit</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>54</item>
<item>55</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>79</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_59">
<id>59</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>11</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_60">
<id>62</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>12</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_61">
<id>63</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>13</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_62">
<id>64</id>
<edge_type>2</edge_type>
<source_obj>56</source_obj>
<sink_obj>13</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_63">
<id>65</id>
<edge_type>2</edge_type>
<source_obj>17</source_obj>
<sink_obj>13</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_64">
<id>66</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_65">
<id>68</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_66">
<id>69</id>
<edge_type>2</edge_type>
<source_obj>23</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_67">
<id>70</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_68">
<id>71</id>
<edge_type>2</edge_type>
<source_obj>51</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_69">
<id>73</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_70">
<id>74</id>
<edge_type>2</edge_type>
<source_obj>17</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_71">
<id>75</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_72">
<id>77</id>
<edge_type>1</edge_type>
<source_obj>76</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_73">
<id>78</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_74">
<id>80</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_75">
<id>81</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_76">
<id>82</id>
<edge_type>2</edge_type>
<source_obj>51</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_77">
<id>83</id>
<edge_type>2</edge_type>
<source_obj>53</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_78">
<id>84</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_79">
<id>85</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_80">
<id>87</id>
<edge_type>1</edge_type>
<source_obj>86</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_81">
<id>88</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_82">
<id>89</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_83">
<id>90</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_84">
<id>93</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_85">
<id>94</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_86">
<id>95</id>
<edge_type>1</edge_type>
<source_obj>86</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_87">
<id>96</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_88">
<id>97</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_89">
<id>98</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_90">
<id>99</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_91">
<id>100</id>
<edge_type>1</edge_type>
<source_obj>86</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_92">
<id>101</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_93">
<id>102</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="_94">
<id>103</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_95">
<id>104</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_96">
<id>105</id>
<edge_type>1</edge_type>
<source_obj>86</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_97">
<id>106</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_98">
<id>107</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_99">
<id>108</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_100">
<id>109</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_101">
<id>110</id>
<edge_type>1</edge_type>
<source_obj>86</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_102">
<id>111</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_103">
<id>112</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_104">
<id>113</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_105">
<id>114</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="_106">
<id>115</id>
<edge_type>1</edge_type>
<source_obj>86</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_107">
<id>116</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_108">
<id>117</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_109">
<id>118</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_110">
<id>121</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_111">
<id>122</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_112">
<id>123</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_113">
<id>124</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_114">
<id>125</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_115">
<id>126</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_116">
<id>129</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_117">
<id>130</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="_118">
<id>132</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_119">
<id>134</id>
<edge_type>1</edge_type>
<source_obj>133</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_120">
<id>137</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_121">
<id>138</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_122">
<id>139</id>
<edge_type>2</edge_type>
<source_obj>23</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_123">
<id>140</id>
<edge_type>2</edge_type>
<source_obj>56</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_124">
<id>141</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_125">
<id>142</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_126">
<id>143</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_127">
<id>144</id>
<edge_type>2</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="_128">
<id>145</id>
<edge_type>1</edge_type>
<source_obj>54</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_129">
<id>194</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>17</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_130">
<id>195</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_131">
<id>196</id>
<edge_type>2</edge_type>
<source_obj>17</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_132">
<id>197</id>
<edge_type>2</edge_type>
<source_obj>23</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_133">
<id>198</id>
<edge_type>2</edge_type>
<source_obj>23</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_134">
<id>199</id>
<edge_type>2</edge_type>
<source_obj>51</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_135">
<id>200</id>
<edge_type>2</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="_136">
<id>201</id>
<edge_type>4</edge_type>
<source_obj>30</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_137">
<id>2147483647</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_138">
<mId>1</mId>
<mTag>conv_read</mTag>
<mType>0</mType>
<sub_regions>
<count>4</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</item>
<item>5</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>1</mMinLatency>
<mMaxLatency>115</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_139">
<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>14</item>
<item>17</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_140">
<mId>3</mId>
<mTag>Loop 1</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>23</item>
<item>51</item>
</basic_blocks>
<mII>2</mII>
<mDepth>3</mDepth>
<mMinTripCount>56</mMinTripCount>
<mMaxTripCount>56</mMaxTripCount>
<mMinLatency>112</mMinLatency>
<mMaxLatency>112</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_141">
<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>53</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_142">
<mId>5</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>56</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_143">
<states class_id="25" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_144">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_145">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_146">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_147">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_148">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_149">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_150">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_151">
<id>2</id>
<operations>
<count>18</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_152">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_153">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_154">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_155">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_156">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_157">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_158">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_159">
<id>28</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_160">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_161">
<id>32</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_162">
<id>34</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_163">
<id>35</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_164">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_165">
<id>38</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_166">
<id>40</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_167">
<id>41</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_168">
<id>43</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_169">
<id>44</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_170">
<id>3</id>
<operations>
<count>15</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_171">
<id>28</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_172">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_173">
<id>30</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_174">
<id>32</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_175">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_176">
<id>35</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_177">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_178">
<id>38</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_179">
<id>39</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_180">
<id>41</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_181">
<id>42</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_182">
<id>44</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_183">
<id>45</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_184">
<id>46</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_185">
<id>47</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_186">
<id>4</id>
<operations>
<count>5</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_187">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_188">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_189">
<id>48</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_190">
<id>49</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_191">
<id>50</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_192">
<id>5</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_193">
<id>52</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_194">
<id>6</id>
<operations>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_195">
<id>54</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_196">
<id>55</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_197">
<inState>1</inState>
<outState>6</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>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>11</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_198">
<inState>1</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>
<first>
<first>11</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_199">
<inState>5</inState>
<outState>6</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_200">
<inState>3</inState>
<outState>4</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_201">
<inState>4</inState>
<outState>2</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_202">
<inState>2</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>19</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_203">
<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>19</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="36" tracking_level="1" version="0" object_id="_204">
<dp_component_resource class_id="37" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_resource>
<dp_expression_resource>
<count>8</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>add_ln221_fu_191_p2 ( + ) </first>
<second class_id="39" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="40" tracking_level="0" version="0">
<first>(0P0)</first>
<second>32</second>
</item>
<item>
<first>(1P1)</first>
<second>6</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>39</second>
</item>
</second>
</item>
<item>
<first>ap_block_pp0_stage0_11001 ( and ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_block_pp0_stage1_11001 ( and ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_block_state3_pp0_stage1_iter0 ( and ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_block_state4_io ( and ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_enable_pp0 ( xor ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>2</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>icmp_ln221_fu_197_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>6</second>
</item>
<item>
<first>(1P1)</first>
<second>5</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>11</second>
</item>
</second>
</item>
<item>
<first>j_fu_203_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>6</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>15</second>
</item>
</second>
</item>
</dp_expression_resource>
<dp_fifo_resource>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_resource>
<dp_memory_resource>
<count>0</count>
<item_version>0</item_version>
</dp_memory_resource>
<dp_multiplexer_resource>
<count>8</count>
<item_version>0</item_version>
<item>
<first>ap_NS_fsm</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>6</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>6</second>
</item>
<item>
<first>LUT</first>
<second>33</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter1</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>ap_phi_mux_j_0_phi_fu_175_p4</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>6</second>
</item>
<item>
<first>(2Count)</first>
<second>12</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>ap_return</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>32</second>
</item>
<item>
<first>(2Count)</first>
<second>64</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>cofm_TDATA_i_blk_n</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>cofm_TDATA_o_blk_n</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>cofm_counter_1_reg_182</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>32</second>
</item>
<item>
<first>(2Count)</first>
<second>64</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>j_0_reg_171</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>6</second>
</item>
<item>
<first>(2Count)</first>
<second>12</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
</dp_multiplexer_resource>
<dp_register_resource>
<count>10</count>
<item_version>0</item_version>
<item>
<first>add_ln221_reg_280</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>32</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>32</second>
</item>
</second>
</item>
<item>
<first>ap_CS_fsm</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>5</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>5</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter0</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter1</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_return_preg</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>32</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>32</second>
</item>
</second>
</item>
<item>
<first>cofm_b5_addr1516_par_reg_324</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>512</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>512</second>
</item>
</second>
</item>
<item>
<first>cofm_counter_1_reg_182</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>32</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>32</second>
</item>
</second>
</item>
<item>
<first>icmp_ln221_reg_285</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>j_0_reg_171</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>6</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>6</second>
</item>
</second>
</item>
<item>
<first>j_reg_289</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>6</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>6</second>
</item>
</second>
</item>
</dp_register_resource>
<dp_dsp_resource>
<count>0</count>
<item_version>0</item_version>
</dp_dsp_resource>
<dp_component_map class_id="41" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_map>
<dp_expression_map>
<count>3</count>
<item_version>0</item_version>
<item class_id="42" tracking_level="0" version="0">
<first>add_ln221_fu_191_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>icmp_ln221_fu_197_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>j_fu_203_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
</dp_expression_map>
<dp_fifo_map>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_map>
<dp_memory_map>
<count>0</count>
<item_version>0</item_version>
</dp_memory_map>
</res>
<node_label_latency class_id="43" tracking_level="0" version="0">
<count>36</count>
<item_version>0</item_version>
<item class_id="44" tracking_level="0" version="0">
<first>11</first>
<second class_id="45" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>26</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>28</first>
<second>
<first>1</first>
<second>1</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>1</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="46" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="47" tracking_level="0" version="0">
<first>14</first>
<second class_id="48" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>1</first>
<second>3</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="49" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="50" tracking_level="1" version="0" object_id="_205">
<region_name>Loop 1</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>23</item>
<item>51</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>2</interval>
<pipe_depth>3</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="51" tracking_level="0" version="0">
<count>30</count>
<item_version>0</item_version>
<item class_id="52" tracking_level="0" version="0">
<first>68</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>74</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>80</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>86</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>93</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>100</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>28</item>
<item>28</item>
</second>
</item>
<item>
<first>106</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>113</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>32</item>
<item>32</item>
</second>
</item>
<item>
<first>119</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>126</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>35</item>
<item>35</item>
</second>
</item>
<item>
<first>132</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>139</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>38</item>
<item>38</item>
</second>
</item>
<item>
<first>145</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>152</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>41</item>
<item>41</item>
</second>
</item>
<item>
<first>158</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>165</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>44</item>
<item>44</item>
</second>
</item>
<item>
<first>175</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>185</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>191</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>197</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>203</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>209</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>219</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>223</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>227</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>231</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>235</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>239</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>243</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>259</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="54" tracking_level="0" version="0">
<count>20</count>
<item_version>0</item_version>
<item class_id="55" tracking_level="0" version="0">
<first>add_ln221_fu_191</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>bitcast_ln224_fu_219</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>bitcast_ln225_fu_223</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>bitcast_ln226_fu_227</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>bitcast_ln227_fu_231</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>bitcast_ln228_fu_235</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>bitcast_ln229_fu_239</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>cofm_b5_addr1516_par_fu_259</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>cofm_counter_1_phi_fu_185</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>icmp_ln221_fu_197</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>j_0_phi_fu_175</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>j_fu_203</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>ofm_buff0_0_addr_gep_fu_93</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>ofm_buff0_1_addr_gep_fu_106</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>ofm_buff0_2_addr_gep_fu_119</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>ofm_buff0_3_addr_gep_fu_132</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>ofm_buff0_4_addr_gep_fu_145</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>ofm_buff0_5_addr_gep_fu_158</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>tmp_3_fu_243</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>zext_ln224_fu_209</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</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>4</count>
<item_version>0</item_version>
<item>
<first>cofm_counter_read_1_read_fu_74</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>cofm_read_read_fu_80</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>enable_read_read_fu_68</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>write_ln229_write_fu_86</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
</dp_fu_nodes_io>
<return_ports>
<count>1</count>
<item_version>0</item_version>
<item>
<first>ap_return</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
</return_ports>
<dp_mem_port_nodes class_id="56" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="57" tracking_level="0" version="0">
<first class_id="58" tracking_level="0" version="0">
<first>ofm_buff0_0</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>28</item>
<item>28</item>
</second>
</item>
<item>
<first>
<first>ofm_buff0_1</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>32</item>
<item>32</item>
</second>
</item>
<item>
<first>
<first>ofm_buff0_2</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>35</item>
<item>35</item>
</second>
</item>
<item>
<first>
<first>ofm_buff0_3</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>38</item>
<item>38</item>
</second>
</item>
<item>
<first>
<first>ofm_buff0_4</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>41</item>
<item>41</item>
</second>
</item>
<item>
<first>
<first>ofm_buff0_5</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>44</item>
<item>44</item>
</second>
</item>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>14</count>
<item_version>0</item_version>
<item>
<first>171</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>182</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>271</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>275</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>280</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>285</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>289</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>294</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>299</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>304</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>309</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>314</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>319</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>324</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>14</count>
<item_version>0</item_version>
<item>
<first>add_ln221_reg_280</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>cofm_b5_addr1516_par_reg_324</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>cofm_counter_1_reg_182</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>cofm_counter_read_1_reg_275</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>enable_read_reg_271</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>icmp_ln221_reg_285</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>j_0_reg_171</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>j_reg_289</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>ofm_buff0_0_addr_reg_294</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>ofm_buff0_1_addr_reg_299</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>ofm_buff0_2_addr_reg_304</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>ofm_buff0_3_addr_reg_309</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>ofm_buff0_4_addr_reg_314</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>ofm_buff0_5_addr_reg_319</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>2</count>
<item_version>0</item_version>
<item>
<first>171</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>182</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>2</count>
<item_version>0</item_version>
<item>
<first>cofm_counter_1_reg_182</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>j_0_reg_171</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="59" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="60" tracking_level="0" version="0">
<first>cofm</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
</second>
</item>
<item>
<first>cofm_counter_read</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>enable</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
</second>
</item>
<item>
<first>ofm_buff0_0(p0)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>load</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>28</item>
<item>28</item>
</second>
</item>
</second>
</item>
<item>
<first>ofm_buff0_1(p0)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>load</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>32</item>
<item>32</item>
</second>
</item>
</second>
</item>
<item>
<first>ofm_buff0_2(p0)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>load</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>35</item>
<item>35</item>
</second>
</item>
</second>
</item>
<item>
<first>ofm_buff0_3(p0)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>load</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>38</item>
<item>38</item>
</second>
</item>
</second>
</item>
<item>
<first>ofm_buff0_4(p0)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>load</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>41</item>
<item>41</item>
</second>
</item>
</second>
</item>
<item>
<first>ofm_buff0_5(p0)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>load</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>44</item>
<item>44</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="61" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="62" tracking_level="0" version="0">
<first>2</first>
<second>RAM</second>
</item>
<item>
<first>3</first>
<second>RAM</second>
</item>
<item>
<first>4</first>
<second>RAM</second>
</item>
<item>
<first>5</first>
<second>RAM</second>
</item>
<item>
<first>6</first>
<second>RAM</second>
</item>
<item>
<first>7</first>
<second>RAM</second>
</item>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
|
-- This package was generated by the Ada_Drivers_Library project wizard script
package ADL_Config is
Vendor : constant String := "STMicro"; -- From board definition
Max_Mount_Points : constant := 2; -- From default value
Max_Mount_Name_Length : constant := 128; -- From default value
Runtime_Profile : constant String := "ravenscar-sfp"; -- From command line
Device_Name : constant String := "STM32F746NGHx"; -- From board definition
Device_Family : constant String := "STM32F7"; -- From board definition
Runtime_Name : constant String := "ravenscar-sfp-stm32f746disco"; -- From default value
Has_Ravenscar_Full_Runtime : constant String := "True"; -- From board definition
CPU_Core : constant String := "ARM Cortex-M7F"; -- From mcu definition
Board : constant String := "STM32F746_Discovery"; -- From command line
Has_ZFP_Runtime : constant String := "False"; -- From board definition
Has_Ravenscar_SFP_Runtime : constant String := "True"; -- From board definition
High_Speed_External_Clock : constant := 25000000; -- From board definition
Max_Path_Length : constant := 1024; -- From default value
Runtime_Name_Suffix : constant String := "stm32f746disco"; -- From board definition
Architecture : constant String := "ARM"; -- From board definition
end ADL_Config;
|
package Test_Container is
end Test_Container;
|
-- { dg-do compile }
package Universal_Fixed is
Nm2Metres : constant := 1852.0;
type Metres is delta 1.0 range 0.0 .. 1_000_000.0;
type Nautical_Miles is
delta 0.001 range 0.0 .. (Metres'Last + (Nm2Metres / 2)) / Nm2Metres;
end Universal_Fixed;
|
with GL;
with GLOBE_3D.Math;
package body Actors is
use GLOBE_3D, GLOBE_3D.Math, GLOBE_3D.REF, Game_Control, GL;
procedure Limited_Translation (actor : in out GLOBE_3D.Camera;
gc : Game_Control.Command_set;
gx, gy : GLOBE_3D.Real;
unitary_change : GLOBE_3D.Real;
deceleration : GLOBE_3D.Real;
time_step : GLOBE_3D.Real) is
pragma Unreferenced (gx);
unitary_movement, eye_movement : Real;
step : Vector_3D;
begin
unitary_movement := (case gc (run_mode) is
when True => 300.0,
when False => 100.0);
unitary_movement := unitary_movement * unitary_change;
eye_movement := unitary_movement * 2.0;
actor.Speed (2) := actor.Speed (2) + (case gc (go_forward) is
when True => -eye_movement,
when False => +eye_movement);
actor.Speed (1) := actor.Speed (1) + (if gc (slide_vertical_graduated) then +gy * 2.0 * unitary_movement
elsif gc (slide_down) then -eye_movement
elsif gc (slide_up) then +eye_movement
else 0.0);
actor.Speed (0) := actor.Speed (0) + (if gc (slide_vertical_graduated) then +gy * 2.0 * unitary_movement
elsif gc (slide_down) then -eye_movement
elsif gc (slide_up) then +eye_movement
else 0.0);
step := time_step * (Transpose (actor.World_Rotation) * actor.Speed);
-- (speed (0), -- lateral sliding
-- speed (1), -- vertical sliding
-- speed (2)); -- forward/backwards
-- -- ^ vector in the local referential
Limiting (step);
actor.Clipper.Eye_Position := actor.Clipper.Eye_Position + step;
actor.Speed := deceleration * actor.Speed;
end Limited_Translation;
procedure No_Limitation (step : in out GLOBE_3D.Vector_3D) is
null;
procedure Translation_inst is new Limited_Translation (No_Limitation);
procedure Translation (actor : in out GLOBE_3D.Camera;
gc : Game_Control.Command_set;
gx, gy : GLOBE_3D.Real;
unitary_change : GLOBE_3D.Real;
deceleration : GLOBE_3D.Real;
time_step : GLOBE_3D.Real) renames Translation_inst;
procedure Rotation (actor : in out GLOBE_3D.Camera;
gc : Game_Control.Command_set;
gx, gy : GLOBE_3D.Real;
unitary_change : GLOBE_3D.Real;
deceleration : GLOBE_3D.Real;
time_step : GLOBE_3D.Real) is
incremental_rotation : Vector_3D := (0.0, 0.0, 0.0);
begin
Abstract_rotation (gc, gx, gy,
unitary_change, deceleration, incremental_rotation, time_step,
actor.rotation_Speed);
actor.rotation := actor.rotation + incremental_rotation;
if actor.compose_rotations then
actor.World_Rotation :=
XYZ_rotation (incremental_rotation) * actor.World_Rotation;
Re_Orthonormalize (actor.World_Rotation);
else
declare
r : Vector_3D renames actor.rotation;
-- We need to turn around the axes in this order : Y, X, Z
begin
actor.World_Rotation :=
XYZ_rotation (0.0, 0.0, r (2)) * -- 3) turn around the nose
XYZ_rotation (r (0), 0.0, 0.0) * -- 2) lift or lower the head
XYZ_rotation (0.0, r (1), 0.0); -- 1) pivotate around the feet
end;
end if;
end Rotation;
procedure Abstract_rotation (gc : Game_Control.Command_set;
gx, gy : GLOBE_3D.Real;
unitary_change : GLOBE_3D.Real;
deceleration : GLOBE_3D.Real;
vector : in out GLOBE_3D.Vector_3D;
time_step : GLOBE_3D.Real;
rotation_speed : in out GLOBE_3D.Vector_3D) is
unitary_movement, mouse_rotation, key_rotation : Real;
begin
if gc (run_mode) then
unitary_movement := 40.0;
else
unitary_movement := 20.0;
end if;
unitary_movement := unitary_movement * unitary_change;
mouse_rotation := 2.0 * unitary_movement;
key_rotation := 0.17 * unitary_movement;
if gc (swing_plus) then
rotation_speed (2) := rotation_speed (2) + key_rotation;
end if;
if gc (swing_minus) then
rotation_speed (2) := rotation_speed (2) - key_rotation;
end if;
if gc (turn_left) then
rotation_speed (1) := rotation_speed (1) + key_rotation;
end if;
if gc (turn_right) then
rotation_speed (1) := rotation_speed (1) - key_rotation;
end if;
if gc (turn_up) then
rotation_speed (0) := rotation_speed (0) - key_rotation;
end if;
if gc (turn_down) then
rotation_speed (0) := rotation_speed (0) + key_rotation;
end if;
if gc (turn_lateral_graduated) then
rotation_speed (1) := rotation_speed (1) - gx * mouse_rotation;
end if;
if gc (turn_vertical_graduated) then
rotation_speed (0) := rotation_speed (0) - gy * mouse_rotation;
end if;
vector := vector + time_step * rotation_speed;
rotation_speed := deceleration * rotation_speed;
end Abstract_rotation;
procedure Abstract_rotation (gc : Game_Control.Command_set;
gx, gy : GLOBE_3D.Real;
unitary_change : GLOBE_3D.Real;
deceleration : GLOBE_3D.Real;
rot_matrix : in out GLOBE_3D.Matrix_33;
time_step : GLOBE_3D.Real;
rotation_speed : in out GLOBE_3D.Vector_3D) is
incremental_rotation : Vector_3D := (0.0, 0.0, 0.0);
begin
Abstract_rotation (gc, gx, gy,
unitary_change, deceleration, incremental_rotation, time_step,
rotation_speed);
rot_matrix := rot_matrix * XYZ_rotation (incremental_rotation);
end Abstract_rotation;
end Actors;
|
------------------------------------------------------------------------------
-- G E L A A S I S --
-- ASIS implementation for Gela project, a portable Ada compiler --
-- http://gela.ada-ru.org --
-- - - - - - - - - - - - - - - - --
-- Read copyright and license at the end of this file --
------------------------------------------------------------------------------
-- $Revision: 209 $ $Date: 2013-11-30 21:03:24 +0200 (Сб., 30 нояб. 2013) $
-- Purpose:
-- Decoder for UTF-8 encoding.
package Gela.Decoders.UTF_8 is
type Decoder is new Decoders.Decoder with null record;
procedure Decode
(Object : in Decoder;
From : in Source_Buffers.Cursor;
To : in Source_Buffers.Cursor;
Result : out Wide_String;
Last : out Natural);
end Gela.Decoders.UTF_8;
------------------------------------------------------------------------------
-- Copyright (c) 2008, Maxim Reznik
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
--
-- * Redistributions of source code must retain the above copyright notice,
-- this list of conditions and the following disclaimer.
-- * Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
-- * Neither the name of the Maxim Reznik, IE nor the names of its
-- contributors may be used to endorse or promote products derived from
-- this software without specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
-- LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
-- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-- POSSIBILITY OF SUCH DAMAGE.
--
------------------------------------------------------------------------------
|
-----------------------------------------------------------------------
-- asf-converters-dates -- Date Converters
-- Copyright (C) 2011, 2012, 2013, 2014, 2018 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.Calendar;
with Ada.Exceptions;
with Util.Properties.Bundles;
with Util.Beans.Objects.Time;
with Util.Dates.Formats;
with Util.Log.Loggers;
with ASF.Applications.Main;
package body ASF.Converters.Dates is
-- The logger
Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("ASF.Converters.Dates");
function Get_Date_Format (Mode : in Style_Type;
Bundle : in ASF.Locales.Bundle) return String;
function Get_Time_Format (Mode : in Style_Type;
Bundle : in ASF.Locales.Bundle) return String;
-- ------------------------------
-- Get the format to print the date.
-- ------------------------------
function Get_Date_Format (Mode : in Style_Type;
Bundle : in ASF.Locales.Bundle) return String is
begin
case Mode is
when DEFAULT =>
return Bundle.Get ("faces.dates.default_date_format", "%x");
when SHORT =>
return Bundle.Get ("faces.dates.short_date_format", "%d/%m/%Y");
when MEDIUM =>
return Bundle.Get ("faces.dates.medium_date_format", "%b %d, %Y");
when LONG =>
return Bundle.Get ("faces.dates.long_date_format", "%B %d, %Y");
when FULL =>
return Bundle.Get ("faces.dates.full_date_format", "%A, %B %d, %Y");
end case;
end Get_Date_Format;
-- ------------------------------
-- Get the format to print the time.
-- ------------------------------
function Get_Time_Format (Mode : in Style_Type;
Bundle : in ASF.Locales.Bundle) return String is
begin
case Mode is
when DEFAULT =>
return Bundle.Get ("faces.dates.default_time_format", "%X");
when SHORT =>
return Bundle.Get ("faces.dates.short_time_format", "%H:%M");
when MEDIUM =>
return Bundle.Get ("faces.dates.medium_time_format", "%H:%M");
when LONG =>
return Bundle.Get ("faces.dates.long_time_format", "%H:%M:%S");
when FULL =>
return Bundle.Get ("faces.dates.full_time_format", "%H:%M:%S %Z");
end case;
end Get_Time_Format;
-- ------------------------------
-- Get the date format pattern that must be used for formatting a date on the given component.
-- ------------------------------
function Get_Pattern (Convert : in Date_Converter;
Context : in ASF.Contexts.Faces.Faces_Context'Class;
Bundle : in ASF.Locales.Bundle;
Component : in ASF.Components.Base.UIComponent'Class) return String is
begin
case Convert.Format is
when BOTH =>
return Get_Date_Format (Convert.Time_Style, Bundle);
when TIME =>
return Get_Time_Format (Convert.Time_Style, Bundle);
when DATE =>
return Get_Date_Format (Convert.Date_Style, Bundle);
when CONVERTER_PATTERN =>
return Ada.Strings.Unbounded.To_String (Convert.Pattern);
when COMPONENT_FORMAT =>
return Component.Get_Attribute (Context => Context,
Name => "format",
Default => "%x");
end case;
end Get_Pattern;
-- ------------------------------
-- Get the locale that must be used to format the date.
-- ------------------------------
function Get_Locale (Convert : in Date_Converter;
Context : in ASF.Contexts.Faces.Faces_Context'Class)
return Util.Locales.Locale is
use type Util.Locales.Locale;
begin
if Convert.Locale /= Util.Locales.NULL_LOCALE then
return Convert.Locale;
else
return Context.Get_Locale;
end if;
end Get_Locale;
-- ------------------------------
-- Convert the object value into a string. The object value is associated
-- with the specified component.
-- If the string cannot be converted, the Invalid_Conversion exception should be raised.
-- ------------------------------
function To_String (Convert : in Date_Converter;
Context : in ASF.Contexts.Faces.Faces_Context'Class;
Component : in ASF.Components.Base.UIComponent'Class;
Value : in Util.Beans.Objects.Object) return String is
Locale : constant Util.Locales.Locale
:= Date_Converter'Class (Convert).Get_Locale (Context);
Bundle : ASF.Locales.Bundle;
begin
begin
ASF.Applications.Main.Load_Bundle (Context.Get_Application.all,
Name => "asf",
Locale => Util.Locales.To_String (Locale),
Bundle => Bundle);
exception
when E : Util.Properties.Bundles.NO_BUNDLE =>
Log.Error ("Cannot localize dates: {0}", Ada.Exceptions.Exception_Message (E));
end;
-- Convert the value as a date here so that we can raise an Invalid_Conversion exception.
declare
Pattern : constant String
:= Date_Converter'Class (Convert).Get_Pattern (Context, Bundle, Component);
Date : constant Ada.Calendar.Time := Util.Beans.Objects.Time.To_Time (Value);
Result : constant String := Util.Dates.Formats.Format (Pattern, Date, Bundle);
begin
return Result;
end;
exception
when E : others =>
raise Invalid_Conversion with Ada.Exceptions.Exception_Message (E);
end To_String;
-- ------------------------------
-- Convert the date string into an object for the specified component.
-- If the string cannot be converted, the Invalid_Conversion exception should be raised.
-- ------------------------------
function To_Object (Convert : in Date_Converter;
Context : in ASF.Contexts.Faces.Faces_Context'Class;
Component : in ASF.Components.Base.UIComponent'Class;
Value : in String) return Util.Beans.Objects.Object is
Locale : constant Util.Locales.Locale
:= Date_Converter'Class (Convert).Get_Locale (Context);
Bundle : ASF.Locales.Bundle;
begin
begin
ASF.Applications.Main.Load_Bundle (Context.Get_Application.all,
Name => "asf",
Locale => Util.Locales.To_String (Locale),
Bundle => Bundle);
exception
when E : Util.Properties.Bundles.NO_BUNDLE =>
Log.Error ("Cannot localize dates: {0}", Ada.Exceptions.Exception_Message (E));
end;
-- Convert the string to a date here so that we can raise an Invalid_Conversion exception.
declare
Pattern : constant String
:= Date_Converter'Class (Convert).Get_Pattern (Context, Bundle, Component);
Date : Util.Dates.Date_Record;
begin
Log.Debug ("Date conversion '{0}' with pattern '{1}'", Value, Pattern);
Date := Util.Dates.Formats.Parse (Pattern => Pattern, Date => Value, Bundle => Bundle);
return Util.Beans.Objects.Time.To_Object (Date.Date);
exception
when E : others =>
Log.Error ("Date '{0}' does not match pattern '{1}'", Value, Pattern);
raise Invalid_Conversion with Ada.Exceptions.Exception_Message (E);
end;
end To_Object;
-- ------------------------------
-- Create a date converter.
-- ------------------------------
function Create_Date_Converter (Date : in Style_Type;
Time : in Style_Type;
Format : in Format_Type;
Locale : in String;
Pattern : in String) return Date_Converter_Access is
use Ada.Strings.Unbounded;
L : constant Util.Locales.Locale := Util.Locales.Get_Locale (Locale);
begin
if Pattern'Length > 0 then
return new Date_Converter '(Date_Style => Date,
Time_Style => Time,
Locale => L,
Format => CONVERTER_PATTERN,
Pattern => To_Unbounded_String (Pattern));
else
return new Date_Converter '(Date_Style => Date,
Time_Style => Time,
Format => Format,
Locale => L,
Pattern => Null_Unbounded_String);
end if;
end Create_Date_Converter;
end ASF.Converters.Dates;
|
------------------------------------------------------------------------------
-- --
-- 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$
------------------------------------------------------------------------------
with League.Holders;
package AMF.DG.Gradient_Stop_Collections.Internals is
pragma Preelaborate;
function To_Holder
(Item : AMF.DG.Set_Of_DG_Gradient_Stop) return League.Holders.Holder;
end AMF.DG.Gradient_Stop_Collections.Internals;
|
with Asynchronous_Fifo;
with Ada.Text_Io; use Ada.Text_Io;
procedure Asynchronous_Fifo_Test is
package Int_Fifo is new Asynchronous_Fifo(Integer);
use Int_Fifo;
Buffer : Fifo;
task Writer is
entry Stop;
end Writer;
task body Writer is
Val : Positive := 1;
begin
loop
select
accept Stop;
exit;
else
Buffer.Push(Val);
Val := Val + 1;
end select;
end loop;
end Writer;
task Reader is
entry Stop;
end Reader;
task body Reader is
Val : Positive;
begin
loop
select
accept Stop;
exit;
else
Buffer.Pop(Val);
Put_Line(Integer'Image(Val));
end select;
end loop;
end Reader;
begin
delay 0.1;
Writer.Stop;
Reader.Stop;
end Asynchronous_Fifo_Test;
|
-- C64201B.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- CHECK THAT INITALIZATION OF IN PARAMETERS OF A TASK
-- TYPE IS PERMITTED.
-- (SEE ALSO 7.4.4/T2 FOR TESTS OF LIMITED PRIVATE TYPES.)
-- CVP 5/14/81
-- ABW 7/1/82
-- BHS 7/9/84
WITH REPORT;
PROCEDURE C64201B IS
USE REPORT;
BEGIN
TEST( "C64201B" , "CHECK THAT INITIALIZATION OF IN PARAMETERS " &
"OF A TASK TYPE IS PERMITTED" );
DECLARE
GLOBAL : INTEGER := 10;
TASK TYPE T_TYPE IS
ENTRY E (X : IN OUT INTEGER);
END;
TSK1, TSK2 : T_TYPE;
TASK BODY T_TYPE IS
BEGIN
ACCEPT E (X : IN OUT INTEGER) DO
X := X - 1;
END E;
ACCEPT E (X : IN OUT INTEGER) DO
X := X + 1;
END E;
END T_TYPE;
PROCEDURE PROC1 (T : T_TYPE := TSK1) IS
BEGIN
T.E (X => GLOBAL);
END PROC1;
PROCEDURE PROC2 (T : T_TYPE := TSK1) IS
BEGIN
T.E (X => GLOBAL);
IF (GLOBAL /= IDENT_INT(8)) THEN
FAILED( "TASK NOT PASSED IN PROC1, " &
"DEFAULT TSK1 EMPLOYED" );
END IF;
END PROC2;
PROCEDURE TERM (T : T_TYPE; NUM : CHARACTER) IS
BEGIN
IF NOT T'TERMINATED THEN
ABORT T;
COMMENT ("ABORTING TASK " & NUM);
END IF;
END TERM;
BEGIN
PROC1(TSK2);
IF GLOBAL /= 9 THEN
FAILED ("INCORRECT GLOBAL VALUE AFTER PROC1");
ELSE
PROC2;
END IF;
TERM(TSK1, '1');
TERM(TSK2, '2');
END;
RESULT;
END C64201B;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with AMF.Internals.UML_Properties;
with AMF.UML.Associations;
with AMF.UML.Classes;
with AMF.UML.Classifiers.Collections;
with AMF.UML.Connectable_Element_Template_Parameters;
with AMF.UML.Connector_Ends.Collections;
with AMF.UML.Data_Types;
with AMF.UML.Dependencies.Collections;
with AMF.UML.Deployments.Collections;
with AMF.UML.Extension_Ends;
with AMF.UML.Interfaces;
with AMF.UML.Multiplicity_Elements;
with AMF.UML.Named_Elements;
with AMF.UML.Namespaces;
with AMF.UML.Packageable_Elements.Collections;
with AMF.UML.Packages.Collections;
with AMF.UML.Parameterable_Elements;
with AMF.UML.Properties.Collections;
with AMF.UML.Redefinable_Elements.Collections;
with AMF.UML.Stereotypes;
with AMF.UML.String_Expressions;
with AMF.UML.Template_Parameters;
with AMF.UML.Types.Collections;
with AMF.UML.Value_Specifications;
with AMF.Visitors;
package AMF.Internals.UML_Extension_Ends is
type UML_Extension_End_Proxy is
limited new AMF.Internals.UML_Properties.UML_Property_Proxy
and AMF.UML.Extension_Ends.UML_Extension_End with null record;
overriding procedure Set_Lower
(Self : not null access UML_Extension_End_Proxy;
To : AMF.Optional_Integer);
-- Setter of ExtensionEnd::lower.
--
-- This redefinition changes the default multiplicity of association ends,
-- since model elements are usually extended by 0 or 1 instance of the
-- extension stereotype.
overriding function Get_Type
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Stereotypes.UML_Stereotype_Access;
-- Getter of ExtensionEnd::type.
--
-- References the type of the ExtensionEnd. Note that this association
-- restricts the possible types of an ExtensionEnd to only be Stereotypes.
overriding procedure Set_Type
(Self : not null access UML_Extension_End_Proxy;
To : AMF.UML.Stereotypes.UML_Stereotype_Access);
-- Setter of ExtensionEnd::type.
--
-- References the type of the ExtensionEnd. Note that this association
-- restricts the possible types of an ExtensionEnd to only be Stereotypes.
overriding function Get_Aggregation
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.UML_Aggregation_Kind;
-- Getter of Property::aggregation.
--
-- Specifies the kind of aggregation that applies to the Property.
overriding procedure Set_Aggregation
(Self : not null access UML_Extension_End_Proxy;
To : AMF.UML.UML_Aggregation_Kind);
-- Setter of Property::aggregation.
--
-- Specifies the kind of aggregation that applies to the Property.
overriding function Get_Association
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Associations.UML_Association_Access;
-- Getter of Property::association.
--
-- References the association of which this property is a member, if any.
overriding procedure Set_Association
(Self : not null access UML_Extension_End_Proxy;
To : AMF.UML.Associations.UML_Association_Access);
-- Setter of Property::association.
--
-- References the association of which this property is a member, if any.
overriding function Get_Association_End
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Properties.UML_Property_Access;
-- Getter of Property::associationEnd.
--
-- Designates the optional association end that owns a qualifier attribute.
overriding procedure Set_Association_End
(Self : not null access UML_Extension_End_Proxy;
To : AMF.UML.Properties.UML_Property_Access);
-- Setter of Property::associationEnd.
--
-- Designates the optional association end that owns a qualifier attribute.
overriding function Get_Class
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Classes.UML_Class_Access;
-- Getter of Property::class.
--
-- References the Class that owns the Property.
-- References the Class that owns the Property.
overriding procedure Set_Class
(Self : not null access UML_Extension_End_Proxy;
To : AMF.UML.Classes.UML_Class_Access);
-- Setter of Property::class.
--
-- References the Class that owns the Property.
-- References the Class that owns the Property.
overriding function Get_Datatype
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Data_Types.UML_Data_Type_Access;
-- Getter of Property::datatype.
--
-- The DataType that owns this Property.
overriding procedure Set_Datatype
(Self : not null access UML_Extension_End_Proxy;
To : AMF.UML.Data_Types.UML_Data_Type_Access);
-- Setter of Property::datatype.
--
-- The DataType that owns this Property.
overriding function Get_Default
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.Optional_String;
-- Getter of Property::default.
--
-- A String that is evaluated to give a default value for the Property
-- when an object of the owning Classifier is instantiated.
-- Specifies a String that represents a value to be used when no argument
-- is supplied for the Property.
overriding procedure Set_Default
(Self : not null access UML_Extension_End_Proxy;
To : AMF.Optional_String);
-- Setter of Property::default.
--
-- A String that is evaluated to give a default value for the Property
-- when an object of the owning Classifier is instantiated.
-- Specifies a String that represents a value to be used when no argument
-- is supplied for the Property.
overriding function Get_Default_Value
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Value_Specifications.UML_Value_Specification_Access;
-- Getter of Property::defaultValue.
--
-- A ValueSpecification that is evaluated to give a default value for the
-- Property when an object of the owning Classifier is instantiated.
overriding procedure Set_Default_Value
(Self : not null access UML_Extension_End_Proxy;
To : AMF.UML.Value_Specifications.UML_Value_Specification_Access);
-- Setter of Property::defaultValue.
--
-- A ValueSpecification that is evaluated to give a default value for the
-- Property when an object of the owning Classifier is instantiated.
overriding function Get_Interface
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Interfaces.UML_Interface_Access;
-- Getter of Property::interface.
--
-- References the Interface that owns the Property
overriding procedure Set_Interface
(Self : not null access UML_Extension_End_Proxy;
To : AMF.UML.Interfaces.UML_Interface_Access);
-- Setter of Property::interface.
--
-- References the Interface that owns the Property
overriding function Get_Is_Derived
(Self : not null access constant UML_Extension_End_Proxy)
return Boolean;
-- Getter of Property::isDerived.
--
-- Specifies whether the Property is derived, i.e., whether its value or
-- values can be computed from other information.
-- If isDerived is true, the value of the attribute is derived from
-- information elsewhere.
overriding procedure Set_Is_Derived
(Self : not null access UML_Extension_End_Proxy;
To : Boolean);
-- Setter of Property::isDerived.
--
-- Specifies whether the Property is derived, i.e., whether its value or
-- values can be computed from other information.
-- If isDerived is true, the value of the attribute is derived from
-- information elsewhere.
overriding function Get_Is_Derived_Union
(Self : not null access constant UML_Extension_End_Proxy)
return Boolean;
-- Getter of Property::isDerivedUnion.
--
-- Specifies whether the property is derived as the union of all of the
-- properties that are constrained to subset it.
overriding procedure Set_Is_Derived_Union
(Self : not null access UML_Extension_End_Proxy;
To : Boolean);
-- Setter of Property::isDerivedUnion.
--
-- Specifies whether the property is derived as the union of all of the
-- properties that are constrained to subset it.
overriding function Get_Is_ID
(Self : not null access constant UML_Extension_End_Proxy)
return Boolean;
-- Getter of Property::isID.
--
-- True indicates this property can be used to uniquely identify an
-- instance of the containing Class.
overriding procedure Set_Is_ID
(Self : not null access UML_Extension_End_Proxy;
To : Boolean);
-- Setter of Property::isID.
--
-- True indicates this property can be used to uniquely identify an
-- instance of the containing Class.
overriding function Get_Is_Read_Only
(Self : not null access constant UML_Extension_End_Proxy)
return Boolean;
-- Getter of Property::isReadOnly.
--
-- If isReadOnly is true, the attribute may not be written to after
-- initialization.
-- If true, the attribute may only be read, and not written.
overriding procedure Set_Is_Read_Only
(Self : not null access UML_Extension_End_Proxy;
To : Boolean);
-- Setter of Property::isReadOnly.
--
-- If isReadOnly is true, the attribute may not be written to after
-- initialization.
-- If true, the attribute may only be read, and not written.
overriding function Get_Opposite
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Properties.UML_Property_Access;
-- Getter of Property::opposite.
--
-- In the case where the property is one navigable end of a binary
-- association with both ends navigable, this gives the other end.
overriding procedure Set_Opposite
(Self : not null access UML_Extension_End_Proxy;
To : AMF.UML.Properties.UML_Property_Access);
-- Setter of Property::opposite.
--
-- In the case where the property is one navigable end of a binary
-- association with both ends navigable, this gives the other end.
overriding function Get_Owning_Association
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Associations.UML_Association_Access;
-- Getter of Property::owningAssociation.
--
-- References the owning association of this property, if any.
overriding procedure Set_Owning_Association
(Self : not null access UML_Extension_End_Proxy;
To : AMF.UML.Associations.UML_Association_Access);
-- Setter of Property::owningAssociation.
--
-- References the owning association of this property, if any.
overriding function Get_Qualifier
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Properties.Collections.Ordered_Set_Of_UML_Property;
-- Getter of Property::qualifier.
--
-- An optional list of ordered qualifier attributes for the end. If the
-- list is empty, then the Association is not qualified.
overriding function Get_Redefined_Property
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Properties.Collections.Set_Of_UML_Property;
-- Getter of Property::redefinedProperty.
--
-- References the properties that are redefined by this property.
overriding function Get_Subsetted_Property
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Properties.Collections.Set_Of_UML_Property;
-- Getter of Property::subsettedProperty.
--
-- References the properties of which this property is constrained to be a
-- subset.
overriding function Get_End
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Connector_Ends.Collections.Ordered_Set_Of_UML_Connector_End;
-- Getter of ConnectableElement::end.
--
-- Denotes a set of connector ends that attaches to this connectable
-- element.
overriding function Get_Template_Parameter
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Connectable_Element_Template_Parameters.UML_Connectable_Element_Template_Parameter_Access;
-- Getter of ConnectableElement::templateParameter.
--
-- The ConnectableElementTemplateParameter for this ConnectableElement
-- parameter.
overriding procedure Set_Template_Parameter
(Self : not null access UML_Extension_End_Proxy;
To : AMF.UML.Connectable_Element_Template_Parameters.UML_Connectable_Element_Template_Parameter_Access);
-- Setter of ConnectableElement::templateParameter.
--
-- The ConnectableElementTemplateParameter for this ConnectableElement
-- parameter.
overriding function Get_Type
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Types.UML_Type_Access;
-- Getter of TypedElement::type.
--
-- The type of the TypedElement.
-- This information is derived from the return result for this Operation.
overriding procedure Set_Type
(Self : not null access UML_Extension_End_Proxy;
To : AMF.UML.Types.UML_Type_Access);
-- Setter of TypedElement::type.
--
-- The type of the TypedElement.
-- This information is derived from the return result for this Operation.
overriding function Get_Client_Dependency
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency;
-- Getter of NamedElement::clientDependency.
--
-- Indicates the dependencies that reference the client.
overriding function Get_Name_Expression
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.String_Expressions.UML_String_Expression_Access;
-- Getter of NamedElement::nameExpression.
--
-- The string expression used to define the name of this named element.
overriding procedure Set_Name_Expression
(Self : not null access UML_Extension_End_Proxy;
To : AMF.UML.String_Expressions.UML_String_Expression_Access);
-- Setter of NamedElement::nameExpression.
--
-- The string expression used to define the name of this named element.
overriding function Get_Namespace
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access;
-- Getter of NamedElement::namespace.
--
-- Specifies the namespace that owns the NamedElement.
overriding function Get_Qualified_Name
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.Optional_String;
-- Getter of NamedElement::qualifiedName.
--
-- A name which allows the NamedElement to be identified within a
-- hierarchy of nested Namespaces. It is constructed from the names of the
-- containing namespaces starting at the root of the hierarchy and ending
-- with the name of the NamedElement itself.
overriding function Get_Owning_Template_Parameter
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Template_Parameters.UML_Template_Parameter_Access;
-- Getter of ParameterableElement::owningTemplateParameter.
--
-- The formal template parameter that owns this element.
overriding procedure Set_Owning_Template_Parameter
(Self : not null access UML_Extension_End_Proxy;
To : AMF.UML.Template_Parameters.UML_Template_Parameter_Access);
-- Setter of ParameterableElement::owningTemplateParameter.
--
-- The formal template parameter that owns this element.
overriding function Get_Template_Parameter
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Template_Parameters.UML_Template_Parameter_Access;
-- Getter of ParameterableElement::templateParameter.
--
-- The template parameter that exposes this element as a formal parameter.
overriding procedure Set_Template_Parameter
(Self : not null access UML_Extension_End_Proxy;
To : AMF.UML.Template_Parameters.UML_Template_Parameter_Access);
-- Setter of ParameterableElement::templateParameter.
--
-- The template parameter that exposes this element as a formal parameter.
overriding function Get_Deployed_Element
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element;
-- Getter of DeploymentTarget::deployedElement.
--
-- The set of elements that are manifested in an Artifact that is involved
-- in Deployment to a DeploymentTarget.
overriding function Get_Deployment
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Deployments.Collections.Set_Of_UML_Deployment;
-- Getter of DeploymentTarget::deployment.
--
-- The set of Deployments for a DeploymentTarget.
overriding function Get_Featuring_Classifier
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier;
-- Getter of Feature::featuringClassifier.
--
-- The Classifiers that have this Feature as a feature.
overriding function Get_Is_Static
(Self : not null access constant UML_Extension_End_Proxy)
return Boolean;
-- Getter of Feature::isStatic.
--
-- Specifies whether this feature characterizes individual instances
-- classified by the classifier (false) or the classifier itself (true).
overriding procedure Set_Is_Static
(Self : not null access UML_Extension_End_Proxy;
To : Boolean);
-- Setter of Feature::isStatic.
--
-- Specifies whether this feature characterizes individual instances
-- classified by the classifier (false) or the classifier itself (true).
overriding function Get_Is_Leaf
(Self : not null access constant UML_Extension_End_Proxy)
return Boolean;
-- Getter of RedefinableElement::isLeaf.
--
-- Indicates whether it is possible to further redefine a
-- RedefinableElement. If the value is true, then it is not possible to
-- further redefine the RedefinableElement. Note that this property is
-- preserved through package merge operations; that is, the capability to
-- redefine a RedefinableElement (i.e., isLeaf=false) must be preserved in
-- the resulting RedefinableElement of a package merge operation where a
-- RedefinableElement with isLeaf=false is merged with a matching
-- RedefinableElement with isLeaf=true: the resulting RedefinableElement
-- will have isLeaf=false. Default value is false.
overriding procedure Set_Is_Leaf
(Self : not null access UML_Extension_End_Proxy;
To : Boolean);
-- Setter of RedefinableElement::isLeaf.
--
-- Indicates whether it is possible to further redefine a
-- RedefinableElement. If the value is true, then it is not possible to
-- further redefine the RedefinableElement. Note that this property is
-- preserved through package merge operations; that is, the capability to
-- redefine a RedefinableElement (i.e., isLeaf=false) must be preserved in
-- the resulting RedefinableElement of a package merge operation where a
-- RedefinableElement with isLeaf=false is merged with a matching
-- RedefinableElement with isLeaf=true: the resulting RedefinableElement
-- will have isLeaf=false. Default value is false.
overriding function Get_Redefined_Element
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Redefinable_Elements.Collections.Set_Of_UML_Redefinable_Element;
-- Getter of RedefinableElement::redefinedElement.
--
-- The redefinable element that is being redefined by this element.
overriding function Get_Redefinition_Context
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier;
-- Getter of RedefinableElement::redefinitionContext.
--
-- References the contexts that this element may be redefined from.
overriding function Lower_Bound
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.Optional_Integer;
-- Operation ExtensionEnd::lowerBound.
--
-- The query lowerBound() returns the lower bound of the multiplicity as
-- an Integer. This is a redefinition of the default lower bound, which
-- normally, for MultiplicityElements, evaluates to 1 if empty.
overriding function Default
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.Optional_String;
-- Operation Property::default.
--
-- Missing derivation for Property::/default : String
overriding function Is_Attribute
(Self : not null access constant UML_Extension_End_Proxy;
P : AMF.UML.Properties.UML_Property_Access)
return Boolean;
-- Operation Property::isAttribute.
--
-- The query isAttribute() is true if the Property is defined as an
-- attribute of some classifier.
overriding function Is_Compatible_With
(Self : not null access constant UML_Extension_End_Proxy;
P : AMF.UML.Parameterable_Elements.UML_Parameterable_Element_Access)
return Boolean;
-- Operation Property::isCompatibleWith.
--
-- The query isCompatibleWith() determines if this parameterable element
-- is compatible with the specified parameterable element. By default
-- parameterable element P is compatible with parameterable element Q if
-- the kind of P is the same or a subtype as the kind of Q. In addition,
-- for properties, the type must be conformant with the type of the
-- specified parameterable element.
overriding function Is_Composite
(Self : not null access constant UML_Extension_End_Proxy)
return Boolean;
-- Operation Property::isComposite.
--
-- The value of isComposite is true only if aggregation is composite.
overriding function Is_Consistent_With
(Self : not null access constant UML_Extension_End_Proxy;
Redefinee : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean;
-- Operation Property::isConsistentWith.
--
-- The query isConsistentWith() specifies, for any two Properties in a
-- context in which redefinition is possible, whether redefinition would
-- be logically consistent. A redefining property is consistent with a
-- redefined property if the type of the redefining property conforms to
-- the type of the redefined property, the multiplicity of the redefining
-- property (if specified) is contained in the multiplicity of the
-- redefined property.
-- The query isConsistentWith() specifies, for any two Properties in a
-- context in which redefinition is possible, whether redefinition would
-- be logically consistent. A redefining property is consistent with a
-- redefined property if the type of the redefining property conforms to
-- the type of the redefined property, and the multiplicity of the
-- redefining property (if specified) is contained in the multiplicity of
-- the redefined property.
overriding function Is_Navigable
(Self : not null access constant UML_Extension_End_Proxy)
return Boolean;
-- Operation Property::isNavigable.
--
-- The query isNavigable() indicates whether it is possible to navigate
-- across the property.
overriding function Opposite
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Properties.UML_Property_Access;
-- Operation Property::opposite.
--
-- If this property is owned by a class, associated with a binary
-- association, and the other end of the association is also owned by a
-- class, then opposite gives the other end.
overriding function Subsetting_Context
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Types.Collections.Set_Of_UML_Type;
-- Operation Property::subsettingContext.
--
-- The query subsettingContext() gives the context for subsetting a
-- property. It consists, in the case of an attribute, of the
-- corresponding classifier, and in the case of an association end, all of
-- the classifiers at the other ends.
overriding function Ends
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Connector_Ends.Collections.Set_Of_UML_Connector_End;
-- Operation ConnectableElement::end.
--
-- Missing derivation for ConnectableElement::/end : ConnectorEnd
overriding function All_Owning_Packages
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Packages.Collections.Set_Of_UML_Package;
-- Operation NamedElement::allOwningPackages.
--
-- The query allOwningPackages() returns all the directly or indirectly
-- owning packages.
overriding function Is_Distinguishable_From
(Self : not null access constant UML_Extension_End_Proxy;
N : AMF.UML.Named_Elements.UML_Named_Element_Access;
Ns : AMF.UML.Namespaces.UML_Namespace_Access)
return Boolean;
-- Operation NamedElement::isDistinguishableFrom.
--
-- The query isDistinguishableFrom() determines whether two NamedElements
-- may logically co-exist within a Namespace. By default, two named
-- elements are distinguishable if (a) they have unrelated types or (b)
-- they have related types but different names.
overriding function Namespace
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access;
-- Operation NamedElement::namespace.
--
-- Missing derivation for NamedElement::/namespace : Namespace
overriding function Is_Template_Parameter
(Self : not null access constant UML_Extension_End_Proxy)
return Boolean;
-- Operation ParameterableElement::isTemplateParameter.
--
-- The query isTemplateParameter() determines if this parameterable
-- element is exposed as a formal template parameter.
overriding function Deployed_Element
(Self : not null access constant UML_Extension_End_Proxy)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element;
-- Operation DeploymentTarget::deployedElement.
--
-- Missing derivation for DeploymentTarget::/deployedElement :
-- PackageableElement
overriding function Compatible_With
(Self : not null access constant UML_Extension_End_Proxy;
Other : AMF.UML.Multiplicity_Elements.UML_Multiplicity_Element_Access)
return Boolean;
-- Operation MultiplicityElement::compatibleWith.
--
-- The operation compatibleWith takes another multiplicity as input. It
-- checks if one multiplicity is compatible with another.
overriding function Includes_Cardinality
(Self : not null access constant UML_Extension_End_Proxy;
C : Integer)
return Boolean;
-- Operation MultiplicityElement::includesCardinality.
--
-- The query includesCardinality() checks whether the specified
-- cardinality is valid for this multiplicity.
overriding function Includes_Multiplicity
(Self : not null access constant UML_Extension_End_Proxy;
M : AMF.UML.Multiplicity_Elements.UML_Multiplicity_Element_Access)
return Boolean;
-- Operation MultiplicityElement::includesMultiplicity.
--
-- The query includesMultiplicity() checks whether this multiplicity
-- includes all the cardinalities allowed by the specified multiplicity.
overriding function Iss
(Self : not null access constant UML_Extension_End_Proxy;
Lowerbound : Integer;
Upperbound : Integer)
return Boolean;
-- Operation MultiplicityElement::is.
--
-- The operation is determines if the upper and lower bound of the ranges
-- are the ones given.
overriding function Is_Redefinition_Context_Valid
(Self : not null access constant UML_Extension_End_Proxy;
Redefined : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean;
-- Operation RedefinableElement::isRedefinitionContextValid.
--
-- The query isRedefinitionContextValid() specifies whether the
-- redefinition contexts of this RedefinableElement are properly related
-- to the redefinition contexts of the specified RedefinableElement to
-- allow this element to redefine the other. By default at least one of
-- the redefinition contexts of this element must be a specialization of
-- at least one of the redefinition contexts of the specified element.
overriding procedure Enter_Element
(Self : not null access constant UML_Extension_End_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of visitor interface.
overriding procedure Leave_Element
(Self : not null access constant UML_Extension_End_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of visitor interface.
overriding procedure Visit_Element
(Self : not null access constant UML_Extension_End_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of iterator interface.
end AMF.Internals.UML_Extension_Ends;
|
procedure Hello is
begin
Put_Line ("Hello, world!");
end Hello;
|
pragma Ada_2012;
with Ada.Strings.Unbounded;
with Ada.Strings.Equal_Case_Insensitive;
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Unchecked_Deallocation;
with Ada.Containers.Vectors;
with Ada.Containers.Ordered_Sets;
with EU_Projects.Nodes.Partners;
with EU_Projects.Nodes.Action_Nodes.WPs;
with EU_Projects.Nodes.Action_Nodes.Tasks;
with Project_Processor.Processors.Processor_Tables;
with EU_Projects.Times;
with Latex_Writer.Picture;
with EU_Projects.Nodes.Timed_Nodes.Deliverables;
with EU_Projects.Nodes.Timed_Nodes.Milestones;
with EU_Projects.Efforts;
package body Project_Processor.Processors.LaTeX is
use EU_Projects.Projects;
use EU_Projects.Nodes;
use EU_Projects.Nodes.Action_Nodes;
use EU_Projects.Nodes.Timed_Nodes;
use Latex_Writer.Picture;
use EU_Projects.Times;
use Ada.Strings.Unbounded;
Formatter : constant Time_Formatter :=
Create.Set_Option (To_Be_Decided_Image, "\TBD");
type Table_Style is (Light, Full);
subtype Deliverable_Type_Image_Value is String (1 .. 5);
Deliverable_Type_Image : constant
array (Deliverables.Deliverable_Type) of Deliverable_Type_Image_Value :=
(Deliverables.Report => "R ",
Deliverables.Demo => "DEM ",
Deliverables.Dissemination => "DEC ",
Deliverables.Other => "OTHER");
subtype Dissemination_Level_Image_Value is String (1 .. 2);
Dissemination_Level_Image : constant array (Deliverables.Dissemination_Level)
of Dissemination_Level_Image_Value :=
(Deliverables.Public => "PU",
Deliverables.Confidential => "CO",
Deliverables.Classified => "Cl");
-- The result of function 'Image associated to discrete types has
-- a space at the beginning. That space is quite annoying and needs
-- to be trimmed. This function is here so that everyone can use it
function Chop (X : String) return String
is (Ada.Strings.Fixed.Trim (X, Ada.Strings.Both));
function Image (X : Integer) return String
is (Chop (Integer'Image (X)));
type Tone is (Light, Medium, Dark);
function Gray (T : Natural) return String
is ("\cellcolor[gray]{0." & Image (T) & "}");
function Gray (T : Tone := Medium) return String
is (Gray ((case T is
when Light => 95,
when Medium => 90,
when Dark => 80)));
------------
-- Create --
------------
overriding function Create
(Params : not null access Processor_Parameter) return Processor_Type
is
function Get_Target (Key : String) return Target_Spec
is
begin
if not Params.Contains (Key) then
return Target_Spec'(Class => File,
Filename => Bless (Key & "s.tex"));
elsif Params.all (Key) = "%" then
return Target_Spec'(Class => None);
elsif Params.all (Key) = "-" then
return Target_Spec'(Class => Standard_Output);
else
return Target_Spec'(Class => File,
Filename => Bless (Params.all (Key)));
end if;
end Get_Target;
-------------------------
-- Extract_Gantt_Style --
-------------------------
function Extract_Gantt_Style return GANTT_Parameters
is
Result : GANTT_Parameters :=
GANTT_Parameters'(Font_Size => 11.0 * Pt,
Textwidth => 160.0 * Mm,
Pre_Label_Skip => 0.125,
Post_Label_Skip => 0.125,
Header_Skip => 0.2,
Tick_Length => 0.5,
Task_Indent => 1,
Show_Deliverables => False);
function Eq (X, Y : String) return Boolean
renames Ada.Strings.Equal_Case_Insensitive;
function To_Boolean (X : String) return Boolean
is (if Eq (X, "") or Eq (X, "y") or Eq (X, "t") or Eq (X, "yes") then
True
elsif Eq (X, "n") or Eq (X, "f") or Eq (X, "no") then
False
else
raise Constraint_Error);
begin
if Params.Contains ("show-deliverables") then
Result.Show_Deliverables := To_Boolean (Params.all ("show-deliverables"));
end if;
return Result;
end Extract_Gantt_Style;
begin
return Processor_Type'(Wp_Target => Get_Target ("wp"),
Partner_Target => Get_Target ("partner"),
Deliverable_Target => Get_Target ("deliverable"),
Wp_Summary_Target => Get_Target ("summary-wp"),
Milestone_Target => Get_Target ("milestone"),
Deliv_Summary_Target => Get_Target ("summary-deliv"),
Deliv_Compact_Summary_Target => Get_Target ("compact-summary-deliv"),
Gantt_Target => Get_Target ("gantt"),
Effort_Summary_Target => Get_Target ("summary-effort"),
Gantt_Style => Extract_Gantt_Style);
end Create;
type File_Pt is access File_Type;
type Extended_File (Class : Target_Class := File) is
record
case Class is
when None | Standard_Output =>
null;
when File =>
F : File_Pt;
end case;
end record;
function Open (What : Target_Spec) return Extended_File
is
begin
case What.Class is
when None =>
return Extended_File'(Class => None);
when Standard_Output =>
return Extended_File'(Class => Standard_Output);
when File =>
declare
Result : constant File_Pt := new File_Type;
begin
Create (File => Result.all,
Mode => Out_File,
Name => To_S (What.Filename));
return Extended_File'(Class => File,
F => Result);
end;
end case;
end Open;
procedure Close (What : in out Extended_File)
is
procedure Free is
new Ada.Unchecked_Deallocation (Object => File_Type,
Name => File_Pt);
begin
case What.Class is
when None | Standard_Output =>
null;
when File =>
Close (What.F.all);
Free (What.F);
end case;
end Close;
function To_File_Access (What : Extended_File) return File_Access
is (case What.Class is
when None =>
null,
when Standard_Output =>
Standard_Output,
when File =>
File_Access (What.F));
--------------------------
-- Print_Warning_Header --
--------------------------
procedure Print_Warning_Header (To : File_Access)
is
begin
Put_Line (To.all, "%");
Put_Line (To.all, "%---");
Put_Line (To.all, "% WARNING: Automatically generated file");
Put_Line (To.all, "% WARNING: If you edit this your changes will be lost");
Put_Line (To.all, "%---");
Put_Line (To.all, "%");
New_Page (To.all);
end Print_Warning_Header;
--------------------
-- Print_Partners --
--------------------
procedure Print_Partners (Input : EU_Projects.Projects.Project_Descriptor;
Target : Target_Spec)
is
use EU_Projects.Nodes.Partners;
procedure Print_Partners (To : File_Access) is
procedure Print_Single_Partner (To : File_Type; Partner : Partner_Access) is
begin
Put_Line (To, "\newpartner"
& "{" & Partner.Short_Name & "}"
& "{" & To_String (Partner.Label) & "}"
& "{" & Partner.Name & "}"
& "{" & Partner.Country & "}");
end Print_Single_Partner;
begin
for Idx in Input.All_Partners loop
Print_Single_Partner (To.all, Element (Idx));
end loop;
end Print_Partners;
Output : Extended_File := Open (Target);
begin
if Output.Class = None then
return;
end if;
Within (Output => To_File_Access (Output),
Env_Name => "partnerlist",
Callback => Print_Partners'Access);
Close (Output);
end Print_Partners;
------------------
-- Define_Label --
------------------
procedure Define_Label (Output : File_Type;
Item : Node_Type'Class;
Prefix : String;
Add_New_Line : Boolean := True)
is
begin
Put (Output,
"\failabel{" & Image (Item.Label) & "}"
& "{" & Prefix & "}"
& "{" & Item.Short_Name & "}"
& "{" & Item.Full_Index (False) & "}");
if Add_New_Line then
New_Line (Output);
end if;
end Define_Label;
------------------
-- Join_Indexes --
------------------
function Join_Indexes (Input : EU_Projects.Projects.Project_Descriptor;
Labels : Node_Label_Lists.Vector;
Separator : String)
return String
is
Result : Unbounded_String;
begin
for Idx in Labels.Iterate loop
Result := Result & Input.Find (Labels (Idx)).Full_Index (Prefixed => True);
if Node_Label_Lists.To_Index (Idx) < Labels.Last_Index then
Result := Result & Separator;
end if;
end loop;
return To_String (Result);
end Join_Indexes;
procedure Print_WP (Input : Project_Descriptor;
Output : Extended_File;
WP : WPs.Project_WP_Access) is
Efforts : constant Action_Nodes.Effort_List :=
WP.Efforts_Of (Input.Partner_Names);
function Short_Name (X : Partners.Partner_Label) return String
is
N : constant Node_Access := Input.Find (Node_Label (X));
begin
if N = null then
raise Processor_Error
with "Unknown partner '" & Image (Node_Label (X)) & "'";
else
return N.Short_Name;
end if;
end Short_Name;
procedure Write_WP_Header (Output : File_Access;
Table : in out Table_Handler)
is
pragma Unreferenced (Output);
Headstyle : constant String := "\stilehead";
procedure Put_Pair (Title, Content : String) is
begin
Table.Put (Title, Headstyle);
Table.Put (Content);
end Put_Pair;
procedure First_Row_Standard_Style is
begin
Table.Cline (1, 4);
Put_Pair ("WP Number", WP.Index_Image);
Put_Pair ("Leader", Short_Name (WP.Leader));
Table.Hline;
Table.Put ("WP Name", Headstyle);
Table.Multicolumn (Span => Efforts'Length + 1,
Spec => "|l|",
Content => WP.Name);
end First_Row_Standard_Style;
procedure First_Row_Compact_Style is
begin
Table.Hline;
Put_Pair ("WP N.", WP.Index_Image);
Table.Put ("WP Name", Headstyle);
Table.Multicolumn (Span => Efforts'Length - 4,
Spec => "|l|",
Content => WP.Name);
Table.Put ("\WPleadertitle");
Table.Multicolumn (Span => 2,
Spec => "c|",
Content =>
"\WPleadername{" & Short_Name (WP.Leader) & "}");
end First_Row_Compact_Style;
begin
if True then
First_Row_Compact_Style;
else
First_Row_Standard_Style;
end if;
Table.Hline;
Table.Put ("N. Partner", Headstyle);
for Idx in Efforts'Range loop
Table.Put (Image (Idx));
end loop;
Table.Put ("");
Table.Hline;
Table.Put ("Name", Headstyle);
for Idx in Efforts'Range loop
Table.Put (Short_Name (Efforts (Idx).Partner));
end loop;
Table.Put ("all");
Table.Hline;
Table.Put ("PM", Headstyle);
declare
use EU_Projects.Efforts;
Total_Effort : Person_Months := 0;
begin
for Idx in Efforts'Range loop
Table.Put (Chop (Efforts (Idx).Effort'Image));
Total_Effort := Total_Effort + Efforts (Idx).Effort;
end loop;
Table.Put (Chop (Total_Effort'Image));
end;
Table.Hline;
Put_Pair ("Start", "M" & EU_Projects.Times.Image (Formatter, WP.Starting_Time));
Put_Pair ("End", "M" & EU_Projects.Times.Image (Formatter, WP.Ending_Time));
Table.Cline (1, 4);
end Write_WP_Header;
-------------------------
-- Write_WP_objectives --
-------------------------
procedure Write_WP_Objectives (Output : File_Access)
is
begin
if WP.Description /= "" then
Put_Line (Output.all, Wp.Description);
else
Put_Line (Output.all, "Placeholder, to be written");
end if;
end Write_WP_Objectives;
--------------------------
-- Write_WP_Description --
--------------------------
procedure Write_WP_Description (Output : File_Access)
is
procedure Write_WP_Tasks (Output : File_Access)
is
procedure Print_Task (Output : File_Access;
Tsk : Tasks.Project_Task_Access) is
begin
Put_Line (Output.all,
"\HXXitem{" & Tsk.Full_Index (Prefixed => True) & "}"
& "{" & Tsk.Name & "}"
& "{("
& Tsk.Timing & "; Leader: " & Short_Name (Tsk.Leader)
& ")}");
Define_Label (Output => Output.all,
Item => Tsk.all,
Prefix => "T");
Put_Line (Output.all, Tsk.Description);
end Print_Task;
begin
if Wp.Max_Task_Index > 0 then
for Idx in WP.All_Tasks loop
Print_Task (Output, WPs.Element (Idx));
end loop;
else
Put_Line (Output.all, "\HXXitem{T0.0}{Placeholder}{(please ignore)}");
end if;
end Write_WP_Tasks;
begin
Within (Output => Output,
Env_Name => "HXXitemize",
Callback => Write_WP_Tasks'Access);
end Write_WP_Description;
---------------------------
-- Write_WP_Deliverables --
---------------------------
procedure Write_WP_Deliverables (Output : File_Access)
is
procedure Loop_Over_Deliv (Output : File_Access)
is
procedure Print_Deliv (Output : File_Access;
Deliv : Deliverables.Deliverable_Access)
is
use type Deliverables.Deliverable_Status;
N_Deliverers : constant Natural := Natural (Deliv.Delivered_By.Length);
function Add_Colon_If_Not_Empty (X : String) return String
is (if X = "" then "" else ": " & X);
begin
if Deliv.Status = Deliverables.Clone then
return;
end if;
Put (Output.all,
"\wpdeliv{" & Deliv.Full_Index (Prefixed => True) & "}"
& "{" & Deliv.Name & "}"
& "{" & Add_Colon_If_Not_Empty (Deliv.Description) & "}"
& "{("
& "Due: M" & Deliverables.Image (Deliv.Due_On)
-- & "; Nature: " & "WRITE ME"
& (case N_Deliverers is
when 0 => "",
when 1 => " Task:",
when others => " Tasks:")
& Join_Indexes (Input, Deliv.Delivered_By, ", ")
& ")}");
Define_Label (Output => Output.all,
Item => Deliv.all,
Prefix => "D",
Add_New_Line => False);
-- Put_Line (Output.all, Deliv.Description);
end Print_Deliv;
At_Least_One_Deliverable : Boolean := False;
begin
for Idx in WP.All_Deliverables loop
Print_Deliv (Output, WPs.Element (Idx));
At_Least_One_Deliverable := True;
end loop;
if not At_Least_One_Deliverable then
Put_Line (Output.all, "\wpdeliv{D0.0}{Placeholder}{(please ignore)}");
end if;
end Loop_Over_Deliv;
begin
Within (Output => Output,
Env_Name => "wpdeliverables",
Callback => Loop_Over_Deliv'Access);
end Write_WP_Deliverables;
begin
if Output.Class = None then
return;
end if;
Define_Label (To_File_Access (Output).all, WP.all, "WP");
if WP.Index > 1 then
Put_Line (To_File_Access (Output).all, "\beforeheaderskip");
end if;
Put_Line (To_File_Access (Output).all, "\noindent{\headersize");
Within_Table (Output => To_File_Access (Output),
Table_Spec => "|l*{" & Project_Processor.Image (Efforts'Length + 1) & "}{|c}|",
Callback => Write_WP_Header'Access,
Default_Style => "\stilecontent");
Put_Line (To_File_Access (Output).all, "}\\[\wpheadersep]");
Within (Output => To_File_Access (Output),
Env_Name => "titledbox",
Callback => Write_Wp_Objectives'Access,
Parameter => "Objectives");
Within (Output => To_File_Access (Output),
Env_Name => "titledbox",
Callback => Write_WP_Description'Access,
Parameter => "Description");
Within (Output => To_File_Access (Output),
Env_Name => "titledbox",
Callback => Write_WP_Deliverables'Access,
Parameter => "Deliverables");
end Print_WP;
procedure Print_WPs (Input : EU_Projects.Projects.Project_Descriptor;
Output : Target_Spec)
is
Target : Extended_File := Open (Output);
begin
if Target.Class = None then
return;
end if;
Print_Warning_Header (To_File_Access (Target));
Print_Default_Macro (To_File_Access (Target), "\stilecontent", "#1", 1);
Print_Default_Macro (To_File_Access (Target), "\stilehead", "\textbf{#1}", 1);
Print_Default_Macro (To_File_Access (Target), "\headersize", "\footnotesize", 0);
for Idx in Input.All_WPs loop
Print_WP (Input, Target, Element (Idx));
end loop;
Close (Target);
end Print_WPs;
procedure Print_Milestones (Input : EU_Projects.Projects.Project_Descriptor;
Output : Target_Spec;
Style : Table_Style)
is
pragma Unreferenced (Style);
use EU_Projects.Nodes.Timed_Nodes.Milestones;
procedure Loop_Over_Milestones (Output : File_Access)
is
procedure Print_Milestone (Mstone : Milestone_Access)
is
function Image (X : Node_Label_Lists.Vector;
Separator : String) return String
is
Result : Unbounded_String;
Deliv : Deliverables.Deliverable_Access;
N : Node_Access;
begin
for Lb of X loop
if Result /= Null_Unbounded_String then
Result := Result & Separator;
end if;
N := Input.Find (Lb);
if N = null then
Put_Line (Standard_Error, "Deliverable '" & To_String (Lb) & "' unknown");
else
Deliv := Deliverables.Deliverable_Access (N);
Result := Result & "\ref{" & To_String (Deliv.Parent_Wp.Label) & "}";
end if;
end loop;
return To_String (Result);
end Image;
begin
Put_Line (Output.all, "\milestoneitem" &
"[" & Mstone.Description & "]" &
"{" & Mstone.Full_Index (Prefixed => False) & "}" &
"{" & Mstone.Name & "}" &
"{M" & EU_Projects.Times.Image (Formatter, Mstone.Due_On) & "}" &
"{" & Image (Mstone.Deliverable_List, ", ") & "}" &
"{" & Mstone.Verification_Mean & "}" &
"{" & Image (Mstone.Label) & "}" &
"{" & Mstone.Short_Name & "}");
-- Table.Put (Mstone.Full_Index (Prefixed => True));
-- Table.Put (Mstone.Name);
-- Table.Put (Join_Indexes (Input, Mstone.Deliverable_List, ", "));
-- Table.Put ("M" & EU_Projects.Times.Image (Mstone.Due_On));
-- Table.Put (Mstone.Verification_Mean);
--
-- if Style = Full then
-- Table.Hline;
--
-- Table.Multicolumn (Span => 5,
-- Spec => (case Style is
-- when Full => "|l|",
-- when Light => "l"),
-- Content => Mstone.Description);
-- else
-- Table.Put (Mstone.Description);
-- end if;
--
--
--
-- Define_Label (Output => Output.all,
-- Item => Mstone.all,
-- Prefix => "M");
--
-- Table.Hline (Style = Full);
end Print_Milestone;
begin
-- Table.Hline (Style = Full);
-- Table.Multicolumn (1, "c|", "");
-- Table.Multicolumn (1, "c|", "");
-- Table.Multicolumn (1, "c|", "Deliverable");
-- Table.Multicolumn (1, "c|", "");
-- Table.Multicolumn (1, "c|", "Means of");
--
-- Table.New_Row;
--
-- Table.Multicolumn (1, "c|", "N.");
-- Table.Multicolumn (1, "c|", "Name");
-- Table.Multicolumn (1, "c|", "involved");
-- Table.Multicolumn (1, "c|", "Date");
-- Table.Multicolumn (1, "c|", "verification");
--
-- if Style = Light then
-- Table.Multicolumn (1, "c", "Description");
-- end if;
-- Table.Hline;
for Idx in Input.All_Milestones loop
Print_Milestone (Element (Idx));
end loop;
end Loop_Over_Milestones;
Target : Extended_File := Open (Output);
begin
if Target.Class = None then
return;
end if;
Print_Warning_Header (To_File_Access (Target));
Within (Output => To_File_Access (Target),
Env_Name => "milestonetable",
Callback => Loop_Over_Milestones'Access);
-- Within_Table (Output => To_File_Access (Target),
-- Table_Spec => (case Style is
-- when Full => "|*5{l|}",
-- when Light => "*5{l|}X"),
-- Callback => Loop_Over_Milestones'Access,
-- Default_Style => "",
-- Caption => "Milestones \label{tbl:milestones}");
Close (Target);
end Print_Milestones;
----------------------
-- Print_WP_Summary --
----------------------
procedure Print_WP_Summary (Input : EU_Projects.Projects.Project_Descriptor;
Output : Target_Spec;
Style : Table_Style)
is
pragma Unreferenced (Style);
procedure Make_Summary (Output : File_Access;
Table : in out Table_Handler)
is
pragma Unreferenced (Table);
use EU_Projects.Efforts;
use EU_Projects.Nodes.Action_Nodes.WPs;
------------------
-- Total_Effort --
------------------
function Total_Effort (WP : Project_WP_Access) return Person_Months
is
Result : Person_Months := 0;
Partner_Efforts : constant Effort_List := Wp.Efforts_Of (Input.Partner_Names);
begin
for Val of Partner_Efforts loop
Result := Result + Val.Effort;
end loop;
return Result;
end Total_Effort;
-- procedure Full_Header is
--
-- begin
-- Table.Hline;
-- Table.Head ("WP");
-- Table.Head ("WP Name");
-- Table.Multicolumn (2, "|c|", "\stilehead{Leader}");
-- -- Table.Put ("Leader N.", "\stilehead");
-- -- Table.Put ("Leader"");
-- Table.Head ("PM");
-- Table.Head ("Start");
-- Table.Head ("End");
-- Table.Cline (3, 4);
--
-- Table.Put ("");
-- Table.Put ("");
-- Table.Head ("Name");
-- Table.Head ("N.");
-- Table.Put ("");
-- Table.Put ("");
-- Table.Put ("");
-- end Full_Header;
--
-- procedure Light_Header is
--
-- begin
-- Table.Put ("");
-- Table.Put ("");
-- Table.Multicolumn (2, "c", "\stilehead{Leader}");
-- -- Table.Put ("Leader N.", "\stilehead");
-- -- Table.Put ("Leader"");
-- Table.Put ("");
-- Table.Put ("");
-- Table.Put ("");
-- Table.Put ("");
-- Table.Cline (3, 4);
--
-- Table.Multicolumn (1, "c", "WP");
-- Table.Multicolumn (1, "c", "WP Name");
-- Table.Multicolumn (1, "c", "Name");
-- Table.Multicolumn (1, "c", "N.");
-- Table.Multicolumn (1, "c", "~");
-- Table.Multicolumn (1, "c", "PM");
-- Table.Multicolumn (1, "c", "Start");
-- Table.Multicolumn (1, "c", "End");
-- end Light_Header;
Project_Effort : Person_Months := 0;
begin
-- case Style is
-- when Full => Full_Header;
-- when Light => Light_Header;
-- end case;
Put_Line (Output.all, "\summarywptableheader");
-- Table.Hline;
for Pos in Input.All_WPs loop
declare
use EU_Projects.Nodes.Partners;
procedure Put_Arg (X : String) is
begin
Put (Output.all, "{" & X & "}");
end Put_Arg;
WP : constant Project_WP_Access := Element (Pos);
Wp_Effort : constant Person_Months := Total_Effort (Wp);
Leader : constant Partner_Access :=
Partner_Access (Input.Find (Node_Label (WP.Leader)));
begin
Put (Output.all, "\summarywpitem");
Put_Arg (WP.Full_Index (Prefixed => False));
Put_Arg (WP.Short_Name);
Put_Arg (Leader.Short_Name);
Put_Arg (Leader.Full_Index (Prefixed => False));
Put_Arg (Chop (Wp_Effort'Image));
Put_Arg (EU_Projects.Times.Image (Formatter, Wp.Starting_Time));
Put_Arg (EU_Projects.Times.Image (Formatter, Wp.Ending_Time));
New_Line (Output.all);
Project_Effort := Project_Effort + Wp_Effort;
-- Table.Hline (Style = Full);
end;
end loop;
Put_Line (Output.all, "\summarywptotalrow{" & Chop (Project_Effort'Image) & "}");
-- case Style is
-- when Full =>
-- Table.Put ("\cellavuota");
-- Table.Put ("\cellavuota");
-- Table.Put ("\cellavuota");
-- Table.Put ("\cellavuota");
-- Table.Put (Chop (Project_Effort'Image));
-- Table.Put ("\cellavuota");
-- Table.Put ("\cellavuota");
-- Table.Hline;
--
-- when Light =>
-- Table.Hline;
-- Put (Output.all, "\rigatotali");
-- Table.Put ("");
-- Table.Put ("Total");
-- Table.Put ("");
-- Table.Put ("");
-- Table.Put ("");
-- Table.Put (Chop (Project_Effort'Image));
-- Table.Put ("");
-- Table.Put ("");
-- end case;
end Make_Summary;
Target : Extended_File := Open (Output);
begin
if Target.Class = None then
return;
end if;
Within_Table_Like (Output => To_File_Access (Target),
Env_Name => "summarywptable",
Callback => Make_Summary'Access,
Parameter => "List of work packages \label{tbl:wps}");
-- Within_Table (Output => To_File_Access (Target),
-- Table_Spec => (case Style is
-- when Full => "|c|X|c|c|r|r|r|",
-- when Light => "cXlccrrr"),
-- Callback => Make_Summary'Access,
-- Default_Style => "",
-- Default_Head => "\textbf",
-- caption => "List of work packages \label{tbl:wps}");
Close (Target);
end Print_WP_Summary;
-------------------------
-- Print_Deliv_Summary --
-------------------------
procedure Print_Deliv_Summary_Low_Level (Input : EU_Projects.Projects.Project_Descriptor;
Output : Target_Spec;
Style : Table_Style)
is
------------------
-- Make_Summary --
------------------
procedure Make_Summary (Output : File_Access;
Table : in out Table_Handler)
is
pragma Unreferenced (Output);
use EU_Projects.Nodes.Timed_Nodes.Deliverables;
-- use type EU_Projects.Times.Instant;
function "<" (X, Y : Deliverable_Access) return Boolean
is (EU_Projects.Times.Instant'(X.Due_On) < Y.Due_On
or else
(EU_Projects.Times.Instant'(X.Due_On) = Y.Due_On
and X.Full_Index (False) < Y.Full_Index (False)));
package Deliverable_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => Deliverable_Access);
package Deliv_Sorting is
new Deliverable_Vectors.Generic_Sorting;
Project_Deliverables : Deliverable_Vectors.Vector;
begin
Table.Hline (Style = Full);
Table.Put ("N.", "\stilehead");
Table.Put ("Name", "\stilehead");
Table.Put ("WP", "\stilehead");
Table.Put ("Leader", "\stilehead");
Table.Put ("Type", "\stilehead");
Table.Put ("Policy", "\stilehead");
Table.Put ("Due", "\stilehead");
Table.Hline;
for Pos in Input.All_Deliverables loop
Project_Deliverables.Append (Element (Pos));
end loop;
Deliv_Sorting.Sort (Project_Deliverables);
for Deliv of Project_Deliverables loop
declare
use Wps;
use Partners;
Parent : constant Project_WP_Access := Project_WP_Access (Deliv.Parent_Wp);
Leader : constant Partner_Access :=
Partner_Access (Input.Find (Node_Label (Parent.Leader)));
begin
Table.Put (Deliv.Full_Index (Prefixed => True));
Table.Put (Deliv.Name);
Table.Put (Parent.Full_Index (True));
Table.Put (Leader.Short_Name);
Table.Put (Chop (Deliverable_Type_Image (Deliv.Nature)));
Table.Put (Chop (Dissemination_Level_Image (Deliv.Dissemination)));
Table.Put ("M" & EU_Projects.Times.Image (Deliv.Due_On));
Table.Hline (Style = Full);
end;
end loop;
end Make_Summary;
Target : Extended_File := Open (Output);
begin
if Target.Class = None then
return;
end if;
Within_Table (Output => To_File_Access (Target),
Table_Spec => (case Style is
when Full => "|c|X|c|l|c|c|r|",
when Light => "cXclccr"),
Callback => Make_Summary'Access,
Default_Style => "",
Caption => "List of deliverables \label{tbl:delivs}");
Close (Target);
end Print_Deliv_Summary_Low_Level;
procedure Print_Deliv_Summary (Input : EU_Projects.Projects.Project_Descriptor;
Output : Target_Spec)
is
------------------
-- Make_Summary --
------------------
procedure Make_Summary (Output : File_Access)
is
use EU_Projects.Nodes.Timed_Nodes.Deliverables;
-- use type EU_Projects.Times.Instant;
function "<" (X, Y : Deliverable_Access) return Boolean
is (EU_Projects.Times.Instant'(X.Due_On) < Y.Due_On
or else
(EU_Projects.Times.Instant'(X.Due_On) = Y.Due_On
and X.Full_Index (False) < Y.Full_Index (False)));
package Deliverable_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => Deliverable_Access);
package Deliv_Sorting is
new Deliverable_Vectors.Generic_Sorting;
Project_Deliverables : Deliverable_Vectors.Vector;
begin
for Pos in Input.All_Deliverables loop
if Element (Pos).Status /= Parent then
Project_Deliverables.Append (Element (Pos));
end if;
end loop;
Deliv_Sorting.Sort (Project_Deliverables);
for Deliv of Project_Deliverables loop
declare
use Wps;
use Partners;
Parent : constant Project_WP_Access := Project_WP_Access (Deliv.Parent_Wp);
Leader : constant Partner_Access :=
Partner_Access (Input.Find (Node_Label (Parent.Leader)));
begin
Put (Output.all, "\delivitem");
Put (Output.all, "{" & Deliv.Full_Index (Prefixed => True) & "}");
Put (Output.all, "{" & Deliv.Short_Name & "}");
Put (Output.all, "{" & Parent.Full_Index (True) & "}");
Put (Output.all, "{" & Leader.Short_Name & "}");
Put (Output.all, "{" & Chop (Deliverable_Type_Image (Deliv.Nature)) & "}");
Put (Output.all, "{" & Chop (Dissemination_Level_Image (Deliv.Dissemination)) & "}");
Put (Output.all, "{" & "M" & EU_Projects.Times.Image (Formatter, Deliv.Due_On) & "}");
New_Line (Output.all);
end;
end loop;
end Make_Summary;
Target : Extended_File := Open (Output);
begin
if Target.Class = None then
return;
end if;
Within (Output => To_File_Access (Target),
Env_Name => "deliverablelist",
Callback => Make_Summary'Access);
Close (Target);
end Print_Deliv_Summary;
procedure Print_Compact_Deliv_Summary (Project : EU_Projects.Projects.Project_Descriptor;
Output : Target_Spec)
is
--------------------------
-- Make_compact_Summary --
--------------------------
procedure Make_compact_Summary (Output : File_Access)
is
use EU_Projects.Nodes.Timed_Nodes.Deliverables;
function Expected_Date (Deliverable : Deliverable_Access) return Instant
with Pre => Deliverable.Status /= Clone;
function Expected_Date (Deliverable : Deliverable_Access) return Instant
is (case Deliverable.Status is
when Parent =>
Deliverable.Clone (1).Due_On,
when
Stand_Alone => Deliverable.Due_On,
when Clone =>
-- we should never arrive here
raise Program_Error);
function "<" (X, Y : Deliverable_Access) return Boolean
is (EU_Projects.Times.Instant'(Expected_Date (X)) < Expected_Date (Y)
or else
(EU_Projects.Times.Instant'(Expected_Date (X)) = Expected_Date (Y)
and X.Full_Index (False) < Y.Full_Index (False)));
package Deliverable_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => Deliverable_Access);
package Deliv_Sorting is
new Deliverable_Vectors.Generic_Sorting;
Project_Deliverables : Deliverable_Vectors.Vector;
function Expected_Date_Image (Deliv : Deliverable_Access) return String
with Pre => Deliv.Status /= Clone;
function Expected_Date_Image (Deliv : Deliverable_Access) return String
is
begin
case Deliv.Status is
when Clone =>
raise Program_Error;
when Stand_Alone =>
return EU_Projects.Times.Image (Formatter, Deliv.Due_On);
when Parent =>
declare
Result : Unbounded_String;
begin
for Idx in 1 .. Deliv.Max_Clone loop
if Idx > 1 then
Result := Result & ".";
end if;
Result := Result & EU_Projects.Times.Image (Formatter, Deliv.Clone (Idx).Due_On);
end loop;
return To_String (Result);
end;
end case;
end Expected_Date_Image;
begin
for Pos in Project.All_Deliverables loop
if Element (Pos).Status /= Clone then
Project_Deliverables.Append (Element (Pos));
end if;
end loop;
Deliv_Sorting.Sort (Project_Deliverables);
for Deliv of Project_Deliverables loop
declare
use Wps;
use Partners;
Parent_WP : constant Project_WP_Access := Project_WP_Access (Deliv.Parent_Wp);
Leader : constant Partner_Access :=
Partner_Access (Project.Find (Node_Label (Parent_WP.Leader)));
begin
Put (Output.all, "\delivitem");
Put (Output.all, "{" & Deliv.Full_Index (Prefixed => True) & "}");
Put (Output.all, "{" & Deliv.Short_Name & "}");
Put (Output.all, "{" & Parent_WP.Full_Index (True) & "}");
Put (Output.all, "{" & Leader.Short_Name & "}");
Put (Output.all, "{" & Chop (Deliverable_Type_Image (Deliv.Nature)) & "}");
Put (Output.all, "{" & Chop (Dissemination_Level_Image (Deliv.Dissemination)) & "}");
Put (Output.all, "{" & "M" & Expected_Date_Image (Deliv) & "}");
New_Line (Output.all);
end;
end loop;
end Make_compact_Summary;
Target : Extended_File := Open (Output);
begin
if Target.Class = None then
return;
end if;
Within (Output => To_File_Access (Target),
Env_Name => "deliverablelist",
Callback => Make_Compact_Summary'Access);
Close (Target);
end Print_Compact_Deliv_Summary;
procedure Print_Effort_Summary (Input : EU_Projects.Projects.Project_Descriptor;
Output : Target_Spec)
is
------------------
-- Make_Summary --
------------------
procedure Make_Summary (Output : File_Access;
Table : in out Table_Handler)
is
pragma Unreferenced (Output);
use EU_Projects;
use EU_Projects.Efforts;
use EU_Projects.Nodes.Action_Nodes.WPs;
use EU_Projects.Nodes.Partners;
Total_Per_WP : array (1 .. Node_Index (Input.N_WPs)) of Person_Months := (others => 0);
Project_Effort : Person_Months := 0;
begin
Table.Cline (2, Input.N_WPs + 2);
Table.Multicolumn (Span => 1,
Spec => "c|",
Content => "");
for Pos in Input.All_WPs loop
Table.Put (Element (Pos).Full_Index (True), "\effortheader");
end loop;
Table.Put ("Total", "\effortheader");
Table.Hline;
for Partner_Pos in Input.All_Partners loop
declare
Partner : constant Partner_Access := Element (Partner_Pos);
Label : constant Partner_Label := Partner_Label (Partner.Label);
Effort : Person_Months;
Total : Person_Months := 0;
begin
Table.Put (Partner.Short_Name, "\effortpartner");
for WP in Input.All_WPs loop
Effort := Element (Wp).Effort_Of (Label);
Total := Total + Effort;
Total_Per_WP (Element (WP).Index) := Total_Per_WP (Element (WP).Index) + Effort;
if Element (Wp).Leader = Label then
Table.Put (Efforts.Person_Months'Image (Effort), "\textbf");
else
Table.Put (Efforts.Person_Months'Image (Effort));
end if;
end loop;
Table.Put (Gray & Person_Months'Image (Total));
Table.Hline;
Project_Effort := Project_Effort + Total;
end;
end loop;
Table.Put ("Total");
for WP in Input.All_WPs loop
Table.Put (Gray & Person_Months'Image (Total_Per_WP (Element (WP).Index)));
end loop;
Table.Put (Gray & Person_Months'Image (Project_Effort));
Table.Hline;
end Make_Summary;
Target : Extended_File := Open (Output);
begin
if Target.Class = None then
return;
end if;
Within_Table_Like (Output => To_File_Access (Target),
Env_Name => "efforts",
Callback => Make_Summary'Access,
Parameters =>
"Summary of staff effort"
and Image (Input.N_WPs + 2));
-- (Output => ,
-- Table_Spec => "|l|*{" & Image (Input.N_WPs + 2) & "}{r|}",
-- Callback => Make_Summary'Access,
-- Default_Style => "",
-- Caption => "Summary of staff effort \label{tbl:staff}");
Close (Target);
end Print_Effort_Summary;
-----------------
-- Print_Gantt --
-----------------
procedure Print_Gantt_Old (Input : EU_Projects.Projects.Project_Descriptor;
Output : Target_Spec)
is
-- use EU_Projects.Times;
Last_Month : constant Positive :=
(if Input.Duration = To_Be_Decided
then
36
else
Months (Input.Duration));
procedure Make_GANTT (Output : File_Access;
Table : in out Table_Handler)
is
pragma Unreferenced (Output);
Step : constant Positive := 6;
procedure Compact_Header_Line is
begin
Table.Multicolumn (2, "c", "");
for M in 1 .. Last_Month loop
if M mod Step = 0 then
Table.Multicolumn
(Span => 1,
Spec => "c",
Content => "\stilemese{" & Image (M) & "}");
else
Table.Put ("");
end if;
Table.Put ("");
end loop;
Table.New_Row;
end Compact_Header_Line;
procedure First_Header_Line is
begin
Table.Put ("");
Table.Put ("");
for M in 1 .. Last_Month loop
if M mod Step = 0 and M > 9 then
Table.Put (Image (M / 10));
else
Table.Put ("");
end if;
Table.Put ("");
end loop;
Table.New_Row;
end First_Header_Line;
procedure Second_Header_Line is
begin
Table.Put ("");
Table.Put ("");
for M in 1 .. Last_Month loop
if M mod Step = 0 then
Table.Put (Image (M mod 10));
else
Table.Put ("");
end if;
Table.Put ("");
end loop;
Table.New_Row;
end Second_Header_Line;
procedure Show_Busy_Time (Item : EU_Projects.Nodes.Action_Nodes.Action_Node'Class)
is
From : constant Instant := Item.Starting_Time;
To : constant Instant := Item.Ending_Time;
begin
if From = To_Be_Decided or To = To_Be_Decided then
for M in 1 .. Last_Month loop
Table.Put ("\TBDcell");
Table.Put ("");
end loop;
else
declare
T : Instant;
begin
for M in 1 .. Last_Month loop
T := To_Instant (M);
Table.Put ((if T >= From and then T <= To
then
"\busytimecell"
else
"\freetimecell"));
Table.Put ("");
end loop;
end;
end if;
Table.New_Row;
end Show_Busy_Time;
Compact : constant Boolean := True;
begin
if Compact then
Compact_Header_Line;
else
First_Header_Line;
Second_Header_Line;
end if;
Table.Hline;
for WP in Input.All_WPs loop
Table.Multicolumn
(Span => 2,
Spec => "l|",
Content => "\GANTTwpname{"
& Element (Wp).Full_Index (True)
& "~"
& Element (WP).Short_Name
& "}");
Show_Busy_Time (Element (WP).all);
for T in Element (WP).All_Tasks loop
Table.Put ("");
Table.Put ("\GANTTtaskname{"
& WPs.Element (T).Full_Index (True)
& "~"
& WPs.Element (T).Short_Name
& "}");
Show_Busy_Time (WPs.Element (T).all);
end loop;
Table.Hline;
end loop;
Table.Hline;
declare
use EU_Projects.Nodes.Timed_Nodes.Milestones;
Mstone_Table : constant Milestone_Table_Type := Input.Milestone_Table;
Milestone_Month : array (Mstone_Table'Range (1)) of Boolean := (others => False);
begin
for Row in Mstone_Table'Range (2) loop
for M in Mstone_Table'Range (1) loop
if Mstone_Table (M, Row) /= null then
Milestone_Month (M) := True;
end if;
end loop;
end loop;
Table.Multicolumn (2, "l|", "Milestones");
for Has_Milestone of Milestone_Month loop
Table.Multicolumn (1, "c", (if Has_Milestone then "\GANTTmshere" else ""));
Table.Put ("");
end loop;
Table.New_Row;
for Row in Mstone_Table'Range (2) loop
Table.Put ("");
Table.Put ("");
for M in Mstone_Table'Range (1) loop
if Mstone_Table (M, Row) = null then
Table.Put ("");
else
Table.Multicolumn (1, "c", "\GANTTmsstyle"
& "{" & Mstone_Table (M, Row).Full_Index (True) & "}");
end if;
Table.Put ("");
end loop;
Table.New_Row;
end loop;
end;
end Make_GANTT;
Target : Extended_File := Open (Output);
begin
if Target.Class = None then
return;
end if;
Within_Table (Output => To_File_Access (Target),
Table_Spec => "p{1em}l|"
& "*{" & Image (Last_Month) & "}"
& "{p{\larghezzacella}p{\larghezzasep}@{}}",
Callback => Make_GANTT'Access,
Default_Style => "",
Caption => "GANTT \label{tbl:gantt}");
Close (Target);
end Print_Gantt_Old;
------------------------
-- Longest_Label_Size --
------------------------
procedure Longest_Label_Size (Input : EU_Projects.Projects.Project_Descriptor;
WP_Label_Size : out Natural;
Task_Label_Size : out Natural;
Wp_And_Task_Count : out Natural)
is
begin
WP_Label_Size := 0;
Task_Label_Size := 0;
Wp_And_Task_Count := 0;
for Wp in Input.All_WPs loop
WP_Label_Size := Integer'Max (WP_Label_Size,
Element (Wp).Short_Name'Length);
Wp_And_Task_Count := Wp_And_Task_Count + 1;
for Tsk in Element (Wp).All_Tasks loop
Task_Label_Size := Integer'Max (Task_Label_Size,
WPs.Element (Tsk).Short_Name'Length);
Wp_And_Task_Count := Wp_And_Task_Count + 1;
end loop;
end loop;
-- Put_Line ("WW=" & Wp_And_Task_Count'Image);
end Longest_Label_Size;
-----------------
-- Print_Gantt --
-----------------
type Graphic_Setup_Descriptor is
record
Task_X0 : Picture_Length;
Month_Step : Month_Number;
Label_Size : Picture_Length;
Month_Width : Picture_Length;
Line_Heigth : Picture_Length;
Pre_Skip : Picture_Length;
Post_Skip : Picture_Length;
Interline : Picture_Length;
Unit_Length : Latex_Length;
Last_Month : Month_Number;
Top_Position : Picture_Length;
Total_Width : Picture_Length;
Small_Interline : Picture_Length;
Grid_Height : Picture_Length;
Tick_Length : Picture_Length;
Top_WP : Picture_Length;
Header_Skip : Picture_Length;
Font_Height : Picture_Length;
end record;
procedure Make_GANTT (Input : EU_Projects.Projects.Project_Descriptor;
Output : File_Access;
Graphic_Setup : Graphic_Setup_Descriptor;
Parameters : GANTT_Parameters)
is
use EU_Projects;
-- use EU_Projects.Times;
procedure Make_WP_Separator;
Current_V_Pos : Picture_Length;
function Month_Position (Month : Projects.Month_Number;
Setup : Graphic_Setup_Descriptor)
return Picture_Length
is (Setup.Label_Size + (Integer (Month) - 1) * Setup.Month_Width);
function To_Length (L : Picture_Length;
Setup : Graphic_Setup_Descriptor)
return Latex_Length
is (Float (L) * Setup.Unit_Length);
procedure Next_Row is
begin
-- Put_Line (Current_V_Pos'Image);
-- Put_Line (Graphic_Setup.Month_Heigth'Image);
-- Put_Line (Graphic_Setup.Interline'image);
Current_V_Pos := Current_V_Pos - Graphic_Setup.Line_Heigth;
end Next_Row;
procedure Show_Busy_Time (Item : EU_Projects.Nodes.Action_Nodes.Action_Node'Class;
Style : String;
Intensity : EU_Projects.Nodes.Action_Nodes.Tasks.Task_Intensity)
is
procedure Make_Bar (From, To : Month_Number;
Command : String;
Show_Intensity : Boolean) is
Start : constant Picture_Length :=
Month_Position (From, Graphic_Setup);
Len : constant Latex_Length :=
To_Length (Month_Position (To, Graphic_Setup)-Start, Graphic_Setup);
Shrink : constant Float := 0.8;
H : constant Latex_Length :=
Shrink * To_Length (Graphic_Setup.Line_Heigth, Graphic_Setup);
H2 : constant Latex_Length := Float'Max (Intensity, 0.15) * H;
Box_Raise : constant Latex_Length :=
(1.0 - Shrink) * 0.5 * To_Length (Graphic_Setup.Line_Heigth, Graphic_Setup);
begin
if Show_Intensity then
Put_Line (Output.all, Put (X => Start,
Y => Current_V_Pos,
What => Style
& "{"
& (
"\shadedrule"
& "[" & Image (Box_Raise) & "]"
& "{" & Image (Len) & "}"
& "{" & Image (H) & "}"
)
& "}"));
Put_Line (Output.all, Put (X => Start,
Y => Current_V_Pos,
What => Style
& "{"
& (
Command
& "[" & Image (Box_Raise) & "]"
& "{" & Image (Len) & "}"
& "{" & Image (H2) & "}"
)
& "}"));
else
Put_Line (Output.all, Put (X => Start,
Y => Current_V_Pos,
What => Style
& "{"
& (
Command
& "[" & Image (Box_Raise) & "]"
& "{" & Image (Len) & "}"
& "{" & Image (H) & "}"
)
& "}"));
end if;
declare
Dx : constant Picture_Length := Picture_Length (Len / Graphic_Setup.Unit_Length);
Dy : constant Picture_Length := Picture_Length (H / Graphic_Setup.Unit_Length);
B : constant Picture_Length := Picture_Length (Box_Raise / Graphic_Setup.Unit_Length);
Y0 : constant Picture_Length := Current_V_Pos + B;
begin
Put_Line (Output.all, Put (X => Start,
Y => Y0,
What => HLine (Dx)));
Put_Line (Output.all, Put (X => Start,
Y => Y0,
What => Vline (Dy)));
Put_Line (Output.all, Put (X => Start,
Y => Y0 + Dy,
What => HLine (Dx)));
Put_Line (Output.all, Put (X => Start + Dx,
Y => Y0,
What => VLine (Dy)));
end;
end Make_Bar;
From : constant Instant := Item.Starting_Time;
To : constant Instant := Item.Ending_Time;
begin
if From = To_Be_Decided or To = To_Be_Decided then
Make_Bar (From => 1,
To => Graphic_Setup.Last_Month,
Command => "\lightshadedrule",
Show_Intensity => False);
else
Make_Bar (From => Projects.Month_Number (Months (From)),
To => Projects.Month_Number (Months (To)),
Command => "\rule",
Show_Intensity => Intensity < 0.99);
end if;
end Show_Busy_Time;
procedure Make_Label (Command : String;
Item : EU_Projects.Nodes.Action_Nodes.Action_Node'Class;
Indent : Picture_Length)
is
begin
Put_Line (Output.all,
Picture.Put (X => Indent,
Y => Current_V_Pos,
What => Command
& "{" & Item.Full_Index (True) & "~" & Item.Short_Name & "}"));
end Make_Label;
procedure Mark_Month_With_Milestone (Month : Projects.Month_Number) is
begin
Put_Line (Output.all,
Picture.Text (X => Month_Position (Month, Graphic_Setup),
Y => Current_V_Pos,
Content => "\GANTThasmilestone"));
end Mark_Month_With_Milestone;
procedure Put_Milestone (Month : Month_Number;
Mstone : Milestones.Milestone_Access)
is
begin
Put_Line (Output.all,
Text (X => Month_Position (Month, Graphic_Setup),
Y => Current_V_Pos,
Content => Hbox ("\GANTTmstoneNumber "
& Mstone.Full_Index (False)
& ";")));
end Put_Milestone;
procedure Mark_Milestones
is
use EU_Projects.Nodes.Timed_Nodes.Milestones;
Mstone_Table : constant Milestone_Table_Type := Input.Milestone_Table;
Has_Milestone : array (Mstone_Table'Range (1)) of Boolean := (others => False);
begin
Make_WP_Separator;
Put_Line (Output.all,
Picture.Put (X => 0.0,
Y => Current_V_Pos,
What => "\milestonelabel"));
for Row in Mstone_Table'Range (2) loop
for Month in Mstone_Table'Range (1) loop
if Mstone_Table (Month, Row) /= null then
Has_Milestone (Month) := True;
end if;
end loop;
end loop;
for Month in Has_Milestone'Range loop
if Has_Milestone (Month) then
Mark_Month_With_Milestone (Month);
end if;
end loop;
Next_Row;
for Row in Mstone_Table'Range (2) loop
for Month in Mstone_Table'Range (1) loop
if Mstone_Table (Month, Row) /= null then
Put_Milestone (Month, Mstone_Table (Month, Row));
end if;
end loop;
Next_Row;
end loop;
end Mark_Milestones;
procedure Make_Header_And_Grid (Setup : Graphic_Setup_Descriptor)
is
Current_Month : Month_Number;
function Skip (Month : Month_Number) return Picture_Length
is
begin
return Setup.Header_Skip + (if Month mod 12 = 0 then
0.0
elsif Month mod 6 = 0 then
0.4 * Setup.Tick_Length
elsif Month mod 3 = 0 then
0.8 * Setup.Tick_Length
else
0.8 * Setup.Tick_Length);
end Skip;
begin
Current_Month := Setup.Month_Step;
while Current_Month <= Setup.Last_Month loop
Put_Line (Output.all,
Picture.Put (X => Month_Position (Current_Month, Setup),
Y => Current_V_Pos,
What => Hbox (Chop (Current_Month'Image))));
Current_Month := Current_Month + Setup.Month_Step;
end loop;
for Month in 1 .. Setup.Last_Month loop
Put (Output.all, "{");
Put (Output.all,
(if Month mod 12 = 0 then
"\xiithick"
elsif Month mod 6 = 0 then
"\vithick"
elsif Month mod 3 = 0 then
"\iiithick"
else
"\ithick"));
Put (Output.all,
Picture.VLine (X => Month_Position (Month, Setup),
Y => 2 * Setup.Line_Heigth,
Length => Current_V_Pos - Skip (Month)-2 * Setup.Line_Heigth,
Direction => Up));
Put_Line (Output.all, "}");
end loop;
end Make_Header_And_Grid;
procedure Make_WP_Separator
is
begin
Put_Line (Output.all,
Picture.Hline
(X =>
0.0,
Y =>
Current_V_Pos
+ Graphic_Setup.Font_Height
+ Graphic_Setup.Small_Interline,
Length =>
Month_Position (Graphic_Setup.Last_Month, Graphic_Setup)));
end Make_WP_Separator;
procedure Show_Deliverables (Wp : WPs.Project_WP)
is
use type Deliverables.Deliverable_Status;
package Instant_Sets is
new Ada.Containers.Ordered_Sets (Times.Instant);
Active_Months : Instant_Sets.Set;
H : constant Latex_Length :=
0.5 * To_Length (Graphic_Setup.Line_Heigth, Graphic_Setup);
begin
for Pos in Wp.All_Deliverables loop
if WPs.Element (Pos).Status /= Deliverables.Parent then
Active_Months.Include (WPs.Element (Pos).Due_On);
end if;
end loop;
for M of Active_Months loop
if M /= To_Be_Decided then
Put_Line (Output.all,
Picture.Put (X => Month_Position (Month_Number (Months (M)), Graphic_Setup),
Y => Current_V_Pos + Picture_Length (H / Graphic_Setup.Unit_Length),
What => "\GANTTdeliv{" & Image (0.9 * H) & "}"));
end if;
end loop;
end Show_Deliverables;
begin
Current_V_Pos := Graphic_Setup.Top_Position;
Make_Header_And_Grid (Graphic_Setup);
Current_V_Pos := Graphic_Setup.Top_WP;
for WP in Input.All_WPs loop
Make_WP_Separator;
Make_Label (Command => "\GANTTwpname",
Item => Element (WP).all,
Indent => 0.0);
Show_Busy_Time (Element (WP).all, "\GANTTwpBarStyle", 1.0);
if Parameters.Show_Deliverables then
Show_Deliverables (Element (Wp).all);
end if;
Next_Row;
for T in Element (WP).All_Tasks loop
Make_Label (Command => "\GANTTtaskname",
Item => WPs.Element (T).all,
Indent => Graphic_Setup.Task_X0);
Show_Busy_Time (WPs.Element (T).all, "\GANTTtaskBarStyle", Wps.Element (T).Intensity);
Next_Row;
end loop;
end loop;
Mark_Milestones;
end Make_GANTT;
procedure Print_Gantt (Input : EU_Projects.Projects.Project_Descriptor;
Target : Target_Spec;
Parameters : GANTT_Parameters)
is
-- use EU_Projects.Times;
--
-- We use as unit length in the picture environment 0.5em that is
-- (we measured) approximately the average letter length. 1em is
-- approximately the font size, so we use half the font size
-- as \unitlength.
--
Extended_Output : Extended_File := Open (Target);
Output : File_Access;
Longest_WP_Label : Natural;
Longest_Task_Label : Natural;
Wp_And_Task_Count : Natural;
Task_Indent : constant Positive := 1;
Last_Month : constant Month_Number :=
(if Input.Duration = To_Be_Decided
then
36
else
Month_Number (Months (Input.Duration)));
begin
if Extended_Output.Class = None then
return;
else
Output := To_File_Access (Extended_Output);
end if;
Longest_Label_Size (Input => Input,
WP_Label_Size => Longest_WP_Label,
Task_Label_Size => Longest_Task_Label,
Wp_And_Task_Count => Wp_And_Task_Count);
declare
--
-- We checked experimentally that the average width of a char
-- is half the font size. This allows us a crude estimation of
-- text size.
--
Average_Font_Size : constant Latex_Length := 0.5 * Parameters.Font_Size;
--
-- We choose the picture \unitlength so that the average letter
-- width is equal to Averave_Font_Picture_Size in picture units
--
Unit_Length : constant Latex_Length := 1.0 * Pt;
Font_Width : constant Picture_Length :=
Picture_Length (Average_Font_Size / Unit_Length);
Font_Height : constant Picture_Length :=
Picture_Length (Parameters.Font_Size / Unit_Length);
Picture_Width : constant Picture_Length :=
Picture_Length (Parameters.Textwidth / Unit_Length);
Pre_Skip : constant Picture_Length :=
Picture_Length (Parameters.Pre_Label_Skip * Parameters.Font_Size / Unit_Length);
Post_Skip : constant Picture_Length :=
Picture_Length (Parameters.Post_Label_Skip * Parameters.Font_Size / Unit_Length);
Longest_Label : constant Positive :=
Integer'Max (Longest_WP_Label, Task_Indent + Longest_Task_Label);
pragma Warnings (Off, "static fixed-point value is not a multiple of Small");
Label_Width : constant Picture_Length :=
Longest_Label * Font_Width;
Month_Width : constant Picture_Length :=
(Picture_Width - Label_Width) / Picture_Length (Last_Month);
Line_Height : constant Picture_Length :=
Pre_Skip + Font_Height + Post_Skip;
Header_Skip : constant Picture_Length :=
Picture_Length (Parameters.Header_Skip * Parameters.Font_Size / Unit_Length);
Tick_Length : constant Picture_Length :=
Picture_Length (Parameters.Tick_Length * Parameters.Font_Size / Unit_Length);
Header_Height : constant Picture_Length :=
Font_Height + Tick_Length + Header_Skip;
Grid_Height : constant Picture_Length :=
Wp_And_Task_Count * Line_Height;
Picture_Heigth : constant Picture_Length :=
Header_Height + Grid_Height + 3.0 * Line_Height;
Graphic_Setup : constant Graphic_Setup_Descriptor :=
Graphic_Setup_Descriptor'
(Task_X0 => Parameters.Task_Indent * Font_Width,
Month_Step => 3,
Label_Size => Label_Width,
Month_Width => Month_Width,
Line_Heigth => Line_Height,
Unit_Length => Unit_Length,
Last_Month => Last_Month,
Pre_Skip => Pre_Skip,
Post_Skip => Post_Skip,
Interline => Pre_Skip + Post_Skip,
Small_Interline => Pre_Skip * 0.25,
Top_Position => Picture_Heigth - Font_Height,
Total_Width => Picture_Width,
Grid_Height => Grid_Height,
Tick_Length => Tick_Length,
Top_WP => (Wp_And_Task_Count - 1 + 3) * Line_Height,
Header_Skip => Header_Skip,
Font_Height => Font_Height);
procedure Make_Picture (Output : File_Access) is
procedure Make_GANTT_Gateway (Output : File_Access) is
begin
Make_GANTT (Input, Output, Graphic_Setup, Parameters);
end Make_GANTT_Gateway;
begin
Put_Line (Output.all, "\setlength{\unitlength}{" & Image (Unit_Length, Pt) & "}");
Put (Output.all, "\rotategannt{");
Within_Picture (Output => Output,
Width => Picture_Width,
Heigth => Picture_Heigth,
Callback => Make_GANTT_Gateway'Access);
Put_Line (Output.all, "}");
end Make_Picture;
begin
Within (Output => Output,
Env_Name => "gantt",
Callback => Make_Picture'Access,
Parameter => "\GANTTcaption");
-- Put (Output.all, "\begin{gantt}{\GANTTcaption}");
-- Put (Output.all, "\centering");
-- Put_Line (Output.all, "\setlength{\unitlength}{" & Image (Unit_Length, Pt) & "}");
-- Within_Picture (Output => Output,
-- Width => Picture_Width,
-- Heigth => Picture_Heigth,
-- Callback => Make_GANTT_Gateway'Access);
-- Put (Output.all, "\end{gantt}");
end;
Close (Extended_Output);
end Print_Gantt;
-------------
-- Process --
-------------
overriding procedure Process
(Processor : Processor_Type;
Input : EU_Projects.Projects.Project_Descriptor)
is
begin
Print_Partners (Input, Processor.Partner_Target);
Print_WPs (Input, Processor.Wp_Target);
Print_WP_Summary (Input, Processor.WP_Summary_Target, Light);
Print_Milestones (Input, Processor.Milestone_Target, Full);
if True then
Print_Deliv_Summary (Input, Processor.Deliv_Summary_Target);
else
Print_Deliv_Summary_Low_Level (Input, Processor.Deliv_Summary_Target, Light);
end if;
Print_Compact_Deliv_Summary (Input, Processor.Deliv_Compact_Summary_Target);
Print_Effort_Summary (Input, Processor.Effort_Summary_Target);
if False then
Print_Gantt_Old (Input, Processor.Gantt_Target);
else
Print_Gantt (Input => Input,
Target => Processor.Gantt_Target,
Parameters => Processor.Gantt_Style);
end if;
end Process;
begin
Processor_Tables.Register (ID => To_Id ("latex"),
Tag => Processor_Type'Tag);
end Project_Processor.Processors.LaTeX;
|
with
gel.Window.lumen,
gel.Applet.gui_world,
gel.Forge,
gel.Sprite,
openGL.Palette,
openGL.Model.text.lit_colored_textured,
Physics;
pragma unreferenced (gel.Window.lumen);
procedure launch_text_sprite_Demo
--
-- Shows a few text sprites.
--
is
use gel.Applet,
gel.Math,
openGL.Palette;
the_Applet : constant gel.Applet.gui_World.view := gel.forge.new_gui_Applet ("text sprite Demo",
space_Kind => physics.Bullet);
the_Text_1 : constant gel.Sprite.view := gel.forge.new_text_Sprite (the_Applet.gui_World,
Origin_3D,
"Howdy",
the_Applet.Font,
Green);
the_Text_2 : constant gel.Sprite.view := gel.forge.new_text_Sprite (the_Applet.gui_World,
Origin_3D,
"Doody",
the_Applet.Font,
Green);
text_1_Model : constant openGL.Model.text.lit_colored_textured.view
:= openGL.Model.text.lit_colored_textured.view (the_Text_1.graphics_Model);
begin
the_Applet.gui_Camera.Site_is ((0.0, 0.0, 50.0)); -- Position the camera.
the_Applet.enable_simple_Dolly (1); -- Enable user camera control via keyboards.
the_Applet.gui_World.add (the_Text_1);
the_Applet.gui_World.add (the_Text_2);
the_Text_2.Site_is ((0.0, 10.0, 0.0));
while the_Applet.is_open
loop
if text_1_Model.Text.all = "Yay"
then
text_1_Model.Text_is ("Howdy");
else
text_1_Model.Text_is ("Yay");
end if;
the_Applet.gui_World.evolve (by => 1.0 / 60.0);
the_Applet.freshen; -- Handle any new events and update the screen.
delay 0.5;
end loop;
the_Applet.destroy;
end launch_text_sprite_Demo;
|
-- { dg-do run }
with Init12; use Init12;
with Text_IO; use Text_IO;
with Dump;
procedure R12 is
function Get_Elem (A : Arr1) return Integer is
Tmp : Arr1 := A;
begin
return Tmp(1);
end;
procedure Set_Elem (A : access Arr1; I : Integer) is
Tmp : Arr1 := A.all;
begin
Tmp(1) := I;
A.all := Tmp;
end;
function Get_Elem (A : Arr11) return Integer is
Tmp : Arr11 := A;
begin
return Tmp(1,1);
end;
procedure Set_Elem (A : access Arr11; I : Integer) is
Tmp : Arr11 := A.all;
begin
Tmp(1,1) := I;
A.all := Tmp;
end;
function Get_Elem (A : Arr2) return Integer is
Tmp : Arr2 := A;
begin
return Tmp(1);
end;
procedure Set_Elem (A : access Arr2; I : Integer) is
Tmp : Arr2 := A.all;
begin
Tmp(1) := I;
A.all := Tmp;
end;
function Get_Elem (A : Arr22) return Integer is
Tmp : Arr22 := A;
begin
return Tmp(1,1);
end;
procedure Set_Elem (A : access Arr22; I : Integer) is
Tmp : Arr22 := A.all;
begin
Tmp(1,1) := I;
A.all := Tmp;
end;
A1 : aliased Arr1 := My_A1;
A11 : aliased Arr11 := My_A11;
A2 : aliased Arr2 := My_A2;
A22 : aliased Arr22 := My_A22;
begin
Put ("A1 :");
Dump (A1'Address, Arr1'Max_Size_In_Storage_Elements);
New_Line;
-- { dg-output "A1 : 12 00 ab 00 34 00 cd 00 56 00 ef 00.*\n" }
Put ("A11 :");
Dump (A11'Address, Arr11'Max_Size_In_Storage_Elements);
New_Line;
-- { dg-output "A11 : 12 00 ab 00 34 00 cd 00 12 00 ab 00 34 00 cd 00.*\n" }
Put ("A2 :");
Dump (A2'Address, Arr2'Max_Size_In_Storage_Elements);
New_Line;
-- { dg-output "A2 : 00 ab 00 12 00 cd 00 34 00 ef 00 56.*\n" }
Put ("A22 :");
Dump (A22'Address, Arr22'Max_Size_In_Storage_Elements);
New_Line;
-- { dg-output "A22 : 00 ab 00 12 00 cd 00 34 00 ab 00 12 00 cd 00 34.*\n" }
if Get_Elem (A1) /= 16#AB0012# then
raise Program_Error;
end if;
Set_Elem (A1'Access, 16#CD0034#);
if Get_Elem (A1) /= 16#CD0034# then
raise Program_Error;
end if;
if Get_Elem (A11) /= 16#AB0012# then
raise Program_Error;
end if;
Set_Elem (A11'Access, 16#CD0034#);
if Get_Elem (A11) /= 16#CD0034# then
raise Program_Error;
end if;
if Get_Elem (A2) /= 16#AB0012# then
raise Program_Error;
end if;
Set_Elem (A2'Access, 16#CD0034#);
if Get_Elem (A2) /= 16#CD0034# then
raise Program_Error;
end if;
if Get_Elem (A22) /= 16#AB0012# then
raise Program_Error;
end if;
Set_Elem (A22'Access, 16#CD0034#);
if Get_Elem (A22) /= 16#CD0034# then
raise Program_Error;
end if;
end;
|
with
Interfaces.C;
use type
Interfaces.C.int;
package body FLTK.Screen is
function fl_screen_x
return Interfaces.C.int;
pragma Import (C, fl_screen_x, "fl_screen_x");
pragma Inline (fl_screen_x);
function fl_screen_y
return Interfaces.C.int;
pragma Import (C, fl_screen_y, "fl_screen_y");
pragma Inline (fl_screen_y);
function fl_screen_w
return Interfaces.C.int;
pragma Import (C, fl_screen_w, "fl_screen_w");
pragma Inline (fl_screen_w);
function fl_screen_h
return Interfaces.C.int;
pragma Import (C, fl_screen_h, "fl_screen_h");
pragma Inline (fl_screen_h);
function fl_screen_count
return Interfaces.C.int;
pragma Import (C, fl_screen_count, "fl_screen_count");
pragma Inline (fl_screen_count);
procedure fl_screen_dpi
(H, V : out Interfaces.C.C_float;
N : in Interfaces.C.int);
pragma Import (C, fl_screen_dpi, "fl_screen_dpi");
pragma Inline (fl_screen_dpi);
function fl_screen_num
(X, Y : in Interfaces.C.int)
return Interfaces.C.int;
pragma Import (C, fl_screen_num, "fl_screen_num");
pragma Inline (fl_screen_num);
function fl_screen_num2
(X, Y, W, H : in Interfaces.C.int)
return Interfaces.C.int;
pragma Import (C, fl_screen_num2, "fl_screen_num2");
pragma Inline (fl_screen_num2);
procedure fl_screen_work_area
(X, Y, W, H : out Interfaces.C.int;
PX, PY : in Interfaces.C.int);
pragma Import (C, fl_screen_work_area, "fl_screen_work_area");
pragma Inline (fl_screen_work_area);
procedure fl_screen_work_area2
(X, Y, W, H : out Interfaces.C.int;
N : in Interfaces.C.int);
pragma Import (C, fl_screen_work_area2, "fl_screen_work_area2");
pragma Inline (fl_screen_work_area2);
procedure fl_screen_work_area3
(X, Y, W, H : out Interfaces.C.int);
pragma Import (C, fl_screen_work_area3, "fl_screen_work_area3");
pragma Inline (fl_screen_work_area3);
procedure fl_screen_xywh
(X, Y, W, H : out Interfaces.C.int;
PX, PY : in Interfaces.C.int);
pragma Import (C, fl_screen_xywh, "fl_screen_xywh");
pragma Inline (fl_screen_xywh);
procedure fl_screen_xywh2
(X, Y, W, H : out Interfaces.C.int;
N : in Interfaces.C.int);
pragma Import (C, fl_screen_xywh2, "fl_screen_xywh2");
pragma Inline (fl_screen_xywh2);
procedure fl_screen_xywh3
(X, Y, W, H : out Interfaces.C.int);
pragma Import (C, fl_screen_xywh3, "fl_screen_xywh3");
pragma Inline (fl_screen_xywh3);
procedure fl_screen_xywh4
(X, Y, W, H : out Interfaces.C.int;
PX, PY, PW, PH : in Interfaces.C.int);
pragma Import (C, fl_screen_xywh4, "fl_screen_xywh4");
pragma Inline (fl_screen_xywh4);
function Get_X return Integer is
begin
return Integer (fl_screen_x);
end Get_X;
function Get_Y return Integer is
begin
return Integer (fl_screen_y);
end Get_Y;
function Get_W return Integer is
begin
return Integer (fl_screen_w);
end Get_W;
function Get_H return Integer is
begin
return Integer (fl_screen_h);
end Get_H;
function Count return Integer is
begin
return Integer (fl_screen_count);
end Count;
-- Screen numbers in the range 1 .. Get_Count
procedure DPI
(Horizontal, Vertical : out Float;
Screen_Number : in Integer := 1) is
begin
fl_screen_dpi
(Interfaces.C.C_float (Horizontal),
Interfaces.C.C_float (Vertical),
Interfaces.C.int (Screen_Number) - 1);
end DPI;
function Containing
(X, Y : in Integer)
return Integer is
begin
return Integer (fl_screen_num
(Interfaces.C.int (X),
Interfaces.C.int (Y)));
end Containing;
function Containing
(X, Y, W, H : in Integer)
return Integer is
begin
return Integer (fl_screen_num2
(Interfaces.C.int (X),
Interfaces.C.int (Y),
Interfaces.C.int (W),
Interfaces.C.int (H)));
end Containing;
procedure Work_Area
(X, Y, W, H : out Integer;
Pos_X, Pos_Y : in Integer) is
begin
fl_screen_work_area
(Interfaces.C.int (X),
Interfaces.C.int (Y),
Interfaces.C.int (W),
Interfaces.C.int (H),
Interfaces.C.int (Pos_X),
Interfaces.C.int (Pos_Y));
end Work_Area;
procedure Work_Area
(X, Y, W, H : out Integer;
Screen_Num : in Integer) is
begin
fl_screen_work_area2
(Interfaces.C.int (X),
Interfaces.C.int (Y),
Interfaces.C.int (W),
Interfaces.C.int (H),
Interfaces.C.int (Screen_Num));
end Work_Area;
procedure Work_Area
(X, Y, W, H : out Integer) is
begin
fl_screen_work_area3
(Interfaces.C.int (X),
Interfaces.C.int (Y),
Interfaces.C.int (W),
Interfaces.C.int (H));
end Work_Area;
procedure Bounding_Rect
(X, Y, W, H : out Integer;
Pos_X, Pos_Y : in Integer) is
begin
fl_screen_xywh
(Interfaces.C.int (X),
Interfaces.C.int (Y),
Interfaces.C.int (W),
Interfaces.C.int (H),
Interfaces.C.int (Pos_X),
Interfaces.C.int (Pos_Y));
end Bounding_Rect;
procedure Bounding_Rect
(X, Y, W, H : out Integer;
Screen_Num : in Integer) is
begin
fl_screen_xywh2
(Interfaces.C.int (X),
Interfaces.C.int (Y),
Interfaces.C.int (W),
Interfaces.C.int (H),
Interfaces.C.int (Screen_Num));
end Bounding_Rect;
procedure Bounding_Rect
(X, Y, W, H : out Integer) is
begin
fl_screen_xywh3
(Interfaces.C.int (X),
Interfaces.C.int (Y),
Interfaces.C.int (W),
Interfaces.C.int (H));
end Bounding_Rect;
procedure Bounding_Rect
(X, Y, W, H : out Integer;
PX, PY, PW, PH : in Integer) is
begin
fl_screen_xywh4
(Interfaces.C.int (X),
Interfaces.C.int (Y),
Interfaces.C.int (W),
Interfaces.C.int (H),
Interfaces.C.int (PX),
Interfaces.C.int (PY),
Interfaces.C.int (PW),
Interfaces.C.int (PH));
end Bounding_Rect;
end FLTK.Screen;
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2016, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with Ada.Interrupts.Names; use Ada.Interrupts.Names;
with Ada.Synchronous_Task_Control; use Ada.Synchronous_Task_Control;
package Button_Irq is
Button_Pressed : Suspension_Object;
protected Handler is
pragma Interrupt_Priority;
private
procedure IRQ_Handler;
pragma Attach_Handler (IRQ_Handler, EXTI15_10);
end Handler;
end Button_Irq;
|
------------------------------------------------------------------------------
-- --
-- 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 _ V E C T O R S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2004-2005, 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. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
with Ada.Finalization;
with Ada.Streams;
generic
type Index_Type is range <>;
type Element_Type (<>) is private;
with function "=" (Left, Right : Element_Type) return Boolean is <>;
package Ada.Containers.Indefinite_Vectors is
pragma Preelaborate;
subtype Extended_Index is Index_Type'Base
range Index_Type'First - 1 ..
Index_Type'Min (Index_Type'Base'Last - 1, Index_Type'Last) + 1;
No_Index : constant Extended_Index := Extended_Index'First;
type Vector is tagged private;
type Cursor is private;
Empty_Vector : constant Vector;
No_Element : constant Cursor;
function "=" (Left, Right : Vector) return Boolean;
function To_Vector (Length : Count_Type) return Vector;
function To_Vector
(New_Item : Element_Type;
Length : Count_Type) return Vector;
function "&" (Left, Right : Vector) return Vector;
function "&" (Left : Vector; Right : Element_Type) return Vector;
function "&" (Left : Element_Type; Right : Vector) return Vector;
function "&" (Left, Right : Element_Type) return Vector;
function Capacity (Container : Vector) return Count_Type;
procedure Reserve_Capacity
(Container : in out Vector;
Capacity : Count_Type);
function Length (Container : Vector) return Count_Type;
procedure Set_Length
(Container : in out Vector;
Length : Count_Type);
function Is_Empty (Container : Vector) return Boolean;
procedure Clear (Container : in out Vector);
function To_Cursor
(Container : Vector;
Index : Extended_Index) return Cursor;
function To_Index (Position : Cursor) return Extended_Index;
function Element
(Container : Vector;
Index : Index_Type) return Element_Type;
function Element (Position : Cursor) return Element_Type;
procedure Replace_Element
(Container : in out Vector;
Index : Index_Type;
New_Item : Element_Type);
procedure Replace_Element
(Container : in out Vector;
Position : Cursor;
New_Item : Element_Type);
procedure Query_Element
(Container : Vector;
Index : Index_Type;
Process : not null access procedure (Element : Element_Type));
procedure Query_Element
(Position : Cursor;
Process : not null access procedure (Element : Element_Type));
procedure Update_Element
(Container : in out Vector;
Index : Index_Type;
Process : not null access procedure (Element : in out Element_Type));
procedure Update_Element
(Container : in out Vector;
Position : Cursor;
Process : not null access procedure (Element : in out Element_Type));
procedure Move (Target : in out Vector; Source : in out Vector);
procedure Insert
(Container : in out Vector;
Before : Extended_Index;
New_Item : Vector);
procedure Insert
(Container : in out Vector;
Before : Cursor;
New_Item : Vector);
procedure Insert
(Container : in out Vector;
Before : Cursor;
New_Item : Vector;
Position : out Cursor);
procedure Insert
(Container : in out Vector;
Before : Extended_Index;
New_Item : Element_Type;
Count : Count_Type := 1);
procedure Insert
(Container : in out Vector;
Before : Cursor;
New_Item : Element_Type;
Count : Count_Type := 1);
procedure Insert
(Container : in out Vector;
Before : Cursor;
New_Item : Element_Type;
Position : out Cursor;
Count : Count_Type := 1);
procedure Prepend
(Container : in out Vector;
New_Item : Vector);
procedure Prepend
(Container : in out Vector;
New_Item : Element_Type;
Count : Count_Type := 1);
procedure Append
(Container : in out Vector;
New_Item : Vector);
procedure Append
(Container : in out Vector;
New_Item : Element_Type;
Count : Count_Type := 1);
procedure Insert_Space
(Container : in out Vector;
Before : Extended_Index;
Count : Count_Type := 1);
procedure Insert_Space
(Container : in out Vector;
Before : Cursor;
Position : out Cursor;
Count : Count_Type := 1);
procedure Delete
(Container : in out Vector;
Index : Extended_Index;
Count : Count_Type := 1);
procedure Delete
(Container : in out Vector;
Position : in out Cursor;
Count : Count_Type := 1);
procedure Delete_First
(Container : in out Vector;
Count : Count_Type := 1);
procedure Delete_Last
(Container : in out Vector;
Count : Count_Type := 1);
procedure Reverse_Elements (Container : in out Vector);
procedure Swap (Container : in out Vector; I, J : Index_Type);
procedure Swap (Container : in out Vector; I, J : Cursor);
function First_Index (Container : Vector) return Index_Type;
function First (Container : Vector) return Cursor;
function First_Element (Container : Vector) return Element_Type;
function Last_Index (Container : Vector) return Extended_Index;
function Last (Container : Vector) return Cursor;
function Last_Element (Container : Vector) return Element_Type;
function Next (Position : Cursor) return Cursor;
procedure Next (Position : in out Cursor);
function Previous (Position : Cursor) return Cursor;
procedure Previous (Position : in out Cursor);
function Find_Index
(Container : Vector;
Item : Element_Type;
Index : Index_Type := Index_Type'First) return Extended_Index;
function Find
(Container : Vector;
Item : Element_Type;
Position : Cursor := No_Element) return Cursor;
function Reverse_Find_Index
(Container : Vector;
Item : Element_Type;
Index : Index_Type := Index_Type'Last) return Extended_Index;
function Reverse_Find
(Container : Vector;
Item : Element_Type;
Position : Cursor := No_Element) return Cursor;
function Contains
(Container : Vector;
Item : Element_Type) return Boolean;
function Has_Element (Position : Cursor) return Boolean;
procedure Iterate
(Container : Vector;
Process : not null access procedure (Position : Cursor));
procedure Reverse_Iterate
(Container : Vector;
Process : not null access procedure (Position : Cursor));
generic
with function "<" (Left, Right : Element_Type) return Boolean is <>;
package Generic_Sorting is
function Is_Sorted (Container : Vector) return Boolean;
procedure Sort (Container : in out Vector);
procedure Merge (Target : in out Vector; Source : in out Vector);
end Generic_Sorting;
private
pragma Inline (First_Index);
pragma Inline (Last_Index);
pragma Inline (Element);
pragma Inline (First_Element);
pragma Inline (Last_Element);
pragma Inline (Query_Element);
pragma Inline (Update_Element);
pragma Inline (Replace_Element);
pragma Inline (Contains);
type Element_Access is access Element_Type;
type Elements_Type is array (Index_Type range <>) of Element_Access;
function "=" (L, R : Elements_Type) return Boolean is abstract;
type Elements_Access is access Elements_Type;
use Ada.Finalization;
type Vector is new Controlled with record
Elements : Elements_Access;
Last : Extended_Index := No_Index;
Busy : Natural := 0;
Lock : Natural := 0;
end record;
procedure Adjust (Container : in out Vector);
procedure Finalize (Container : in out Vector);
use Ada.Streams;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Container : Vector);
for Vector'Write use Write;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Container : out Vector);
for Vector'Read use Read;
Empty_Vector : constant Vector := (Controlled with null, No_Index, 0, 0);
type Vector_Access is access constant Vector;
for Vector_Access'Storage_Size use 0;
type Cursor is record
Container : Vector_Access;
Index : Index_Type := Index_Type'First;
end record;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Position : Cursor);
for Cursor'Write use Write;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Position : out Cursor);
for Cursor'Read use Read;
No_Element : constant Cursor := Cursor'(null, Index_Type'First);
end Ada.Containers.Indefinite_Vectors;
|
package datos is
Max_Elem : constant Integer := 10;
type Vector_De_Enteros is array (Integer range <>) of Integer;
type Lista_Enteros is
record
Numeros : Vector_De_Enteros (1 .. Max_Elem);
Cont : Integer;
end record;
type Vector_De_Reales is array (Integer range <>) of Float;
type Vector_De_Booleanos is array (Integer range <>) of Boolean;
type Vector_De_Caracteres is array (Integer range <>) of Character;
end datos;
|
-- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2016 onox <denkpadje@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 Orka.Transforms.SIMD_Vectors;
generic
with package Vector_Transforms is new Orka.Transforms.SIMD_Vectors (<>);
type Matrix_Type is array (Index_Homogeneous) of Vector_Transforms.Vector_Type;
with function Multiply_Matrices (Left, Right : Matrix_Type) return Matrix_Type;
with function Multiply_Vector
(Left : Matrix_Type;
Right : Vector_Transforms.Vector_Type) return Vector_Transforms.Vector_Type;
with function Transpose_Matrix (Matrix : Matrix_Type) return Matrix_Type;
package Orka.Transforms.SIMD_Matrices is
pragma Pure;
package Vectors renames Vector_Transforms;
function "-" (Elements : Vectors.Point) return Vectors.Point renames Vectors."-";
subtype Element_Type is Vectors.Element_Type;
subtype Vector_Type is Vectors.Vector_Type;
subtype Matrix4 is Matrix_Type;
subtype Vector4 is Vector_Type;
Identity_Matrix : constant Matrix_Type :=
((1.0, 0.0, 0.0, 0.0),
(0.0, 1.0, 0.0, 0.0),
(0.0, 0.0, 1.0, 0.0),
(0.0, 0.0, 0.0, 1.0));
function Zero_Point return Vectors.Point is (Vectors.Zero_Point);
-- Return a zero vector that indicates a point. The fourth (W) component
-- is 1.
function Diagonal (Elements : Vector_Type) return Matrix_Type;
-- Return a matrix with the main diagonal equal to the given
-- vector and zeros in all other elements
function Main_Diagonal (Matrix : Matrix_Type) return Vector_Type;
-- Return a vector with the elements of the main diagonal
function Trace (Matrix : Matrix_Type) return Element_Type;
-- Return the trace of the (square) matrix
--
-- The trace is a linear mapping:
--
-- tr(A + B) = tr(A) + tr(B)
-- tr(c * A) = c * tr(A) where c is a scalar (tr(A*B) /= tr(A) * tr(B))
--
-- And invariant under cyclic permutation:
--
-- tr(A * B * C) = tr(C * A * B)
-- Linear transform: a transform in which vector addition and scalar
-- multiplication is preserved.
-- Affine transform: a transform that includes a linear transform and
-- a translation. Parallelism of lines remain unchanged, but lengths
-- and angles may not. A concatenation of affine transforms is affine.
--
-- Orthogonal matrix: the inverse of the matrix is equal to the transpose.
-- A concatenation of orthogonal matrices is orthogonal.
function T (Offset : Vector_Type) return Matrix_Type;
function T (Offset : Vectors.Point) return Matrix_Type;
-- Translate points by the given amount
--
-- Matrix is affine.
--
-- The inverse T^-1 (t) = T (-t).
function Rx (Angle : Element_Type) return Matrix_Type;
-- Rotate around the x-axis by the given amount in radians
--
-- Matrix is orthogonal and affine.
--
-- The inverse Rx^-1 (o) = Rx (-o) = (Rx (o))^T.
function Ry (Angle : Element_Type) return Matrix_Type;
-- Rotate around the y-axis by the given amount in radians
--
-- Matrix is orthogonal and affine.
--
-- The inverse Ry^-1 (o) = Ry (-o) = (Ry (o))^T.
function Rz (Angle : Element_Type) return Matrix_Type;
-- Rotate around the z-axis by the given amount in radians
--
-- Matrix is orthogonal and affine.
--
-- The inverse Rz^-1 (o) = Rz (-o) = (Rz (o))^T.
function R (Axis : Vector_Type; Angle : Element_Type) return Matrix_Type;
-- Rotate around the given axis by the given amount in radians
--
-- Matrix is orthogonal and affine.
--
-- The inverse is R^-1 (a, o) = R (a, -o) = (R (a, o))^T.
function R (Quaternion : Vector_Type) return Matrix_Type;
-- Converts a quaternion to a rotation matrix
--
-- Note: the quaternion must be a unit quaternion (normalized).
function S (Factors : Vector_Type) return Matrix_Type;
-- Scale points by the given amount in the x-, y-, and z-axis
--
-- If all axes are scaled by the same amount, then the matrix is
-- affine.
--
-- The inverse is S^-1 (s) = S (1/s_x, 1/s_y, 1/s_z).
function "*" (Left, Right : Matrix_Type) return Matrix_Type renames Multiply_Matrices;
function "*"
(Left : Matrix_Type;
Right : Vector_Type) return Vector_Type renames Multiply_Vector;
function "*" (Left : Vector_Type; Right : Matrix_Type) return Vector_Type;
-- Return sum of inner products
function "+" (Offset : Vector_Type; Matrix : Matrix_Type) return Matrix_Type is
(T (Offset) * Matrix);
-- Add a translation transformation to the matrix
function "*" (Factor : Element_Type; Matrix : Matrix_Type) return Matrix_Type is
(S ((Factor, Factor, Factor, 1.0)) * Matrix);
-- Add a scale transformation to the matrix
function Transpose (Matrix : Matrix_Type) return Matrix_Type renames Transpose_Matrix;
-- Return the transpose of the matrix
function Outer (Left, Right : Vector_Type) return Matrix_Type;
function R
(Axis : Vector_Type;
Angle : Element_Type;
Point : Vectors.Point) return Matrix_Type
is (T (Point) * R (Axis, Angle) * T (-Point));
-- Return a rotation matrix with the center of rotation at the given point
function R
(Quaternion : Vector_Type;
Point : Vectors.Point) return Matrix_Type
is (T (Point) * R (Quaternion) * T (-Point));
-- Return rotation matrix using a quaternion with the center of rotation at the given point
--
-- The quaternion must be a unit quaternion (normalized).
function Rx (Angle : Element_Type; Point : Vectors.Point) return Matrix_Type is
(T (Point) * Rx (Angle) * T (-Point));
-- Add a rotation transformation around the X axis with the center
-- of rotation at the given point to the matrix
function Ry (Angle : Element_Type; Point : Vectors.Point) return Matrix_Type is
(T (Point) * Ry (Angle) * T (-Point));
-- Add a rotation transformation around the Y axis with the center
-- of rotation at the given point to the matrix
function Rz (Angle : Element_Type; Point : Vectors.Point) return Matrix_Type is
(T (Point) * Rz (Angle) * T (-Point));
-- Add a rotation transformation around the Z axis with the center
-- of rotation at the given point to the matrix
----------------------------------------------------------------------------
use type Element_Type;
function FOV (Width, Distance : Element_Type) return Element_Type;
-- Return an appropriate field of view in radians for a given screen
-- width and view distance in physical units (mm/inches)
--
-- For example, for a 35 mm frame (which is 36 mm wide) and a
-- 50 mm standard lens, the function gives ~ 39 degrees.
function Finite_Perspective (FOV, Aspect, Z_Near, Z_Far : Element_Type) return Matrix_Type
with Pre => FOV > 0.0 and Aspect > 0.0 and Z_Near > 0.0 and Z_Far > Z_Near;
-- Return a matrix providing perspective projection with a depth
-- range of [0, 1]
--
-- The vertical field of view must be in radians.
function Infinite_Perspective (FOV, Aspect, Z_Near : Element_Type) return Matrix_Type
with Pre => FOV > 0.0 and Aspect > 0.0 and Z_Near > 0.0;
-- Return a matrix providing perspective projection with Z_far to
-- infinite and a depth range of [0, 1]
--
-- The vertical field of view must be in radians.
function Infinite_Perspective_Reversed_Z
(FOV, Aspect, Z_Near : Element_Type) return Matrix_Type
with Pre => FOV > 0.0 and Aspect > 0.0 and Z_Near > 0.0;
-- Return a matrix providing perspective projection with Z_far to
-- infinite and a depth range of [1, 0]
--
-- The vertical field of view must be in radians.
function Orthographic (X_Mag, Y_Mag, Z_Near, Z_Far : Element_Type) return Matrix_Type
with Pre => Z_Near >= 0.0 and Z_Far >= 0.0;
-- Return a matrix providing orthographic projection with a depth
-- range of [0, 1]
end Orka.Transforms.SIMD_Matrices;
|
------------------------------------------------------------------------------
-- AGAR CORE LIBRARY --
-- A G A R . D A T A _ S O U R C E --
-- S p e c --
------------------------------------------------------------------------------
with System;
with Interfaces; use Interfaces;
with Interfaces.C;
with Interfaces.C.Strings; use Interfaces.C.Strings;
with Agar.Error;
with Agar.Types; use Agar.Types;
--
-- Data_Source provides basic I/O routines for serializing data to file,
-- memory or network streams.
--
package Agar.Data_Source is
package C renames Interfaces.C;
package CS renames Interfaces.C.Strings;
package ERR renames Agar.Error;
LOAD_STRING_MAX : constant Natural := $AG_LOAD_STRING_MAX;
type Data_Source is array (1 .. $SIZEOF_AG_DATASOURCE) of
aliased Interfaces.Unsigned_8 with Convention => C;
for Data_Source'Size use $SIZEOF_AG_DATASOURCE * System.Storage_Unit;
type Data_Source_Access is access all Data_Source with Convention => C;
subtype Data_Source_Not_Null_Access is not null Data_Source_Access;
type IO_Status is (Success, EOF, Error, Unavailable) with Convention => C;
for IO_Status use
(Success => 0,
EOF => 1,
Error => 2,
Unavailable => 3);
for IO_Status'Size use C.unsigned'Size;
type Seek_Mode is (Seek_Set, Seek_Current, Seek_End) with Convention => C;
for Seek_Mode use
(Seek_Set => 0,
Seek_Current => 1,
Seek_End => 2);
for Seek_Mode'Size use C.unsigned'Size;
type Byte_Order_t is (Big_Endian, Little_Endian) with Convention => C;
for Byte_Order_t use
(Big_Endian => 0,
Little_Endian => 1);
for Byte_Order_t'Size use C.unsigned'Size;
----------------
-- Base Types --
----------------
type Signed_8 is range -127 .. 127 with Convention => C;
for Signed_8'Size use 8;
type Signed_16 is range -(2 **15) .. +(2 **15 - 1) with Convention => C;
for Signed_16'Size use 16;
type Signed_32 is range -(2 **31) .. +(2 **31 - 1) with Convention => C;
for Signed_32'Size use 32;
subtype Unsigned_8 is Interfaces.Unsigned_8;
subtype Unsigned_16 is Interfaces.Unsigned_16;
subtype Unsigned_32 is Interfaces.Unsigned_32;
#if HAVE_64BIT
type Signed_64 is range -(2 **63) .. +(2 **63 - 1) with Convention => C;
for Signed_64'Size use 64;
subtype Unsigned_64 is Interfaces.Unsigned_64;
#end if;
#if HAVE_FLOAT
subtype Float is Interfaces.C.C_float;
subtype Double is Interfaces.C.double;
# if HAVE_LONG_DOUBLE
subtype Long_Double is Interfaces.C.long_double;
# end if;
#end if;
--
-- Create a new Data_Source by opening a file. Modes include "r" (reading),
-- "w" (writing) and "a" (writing at end of file).
--
procedure Open_File
(Path : in String;
Mode : in String;
Source : out Data_Source_Access);
--
-- Create a Data_Source to access Size bytes of data at address Core.
--
function Open_Core
(Core : in System.Address;
Size : in AG_Size) return Data_Source_Access
with Import, Convention => C, Link_Name => "AG_OpenCore";
--
-- Create a Data_Source to access Size bytes of data (read-only) at Core.
--
function Open_Constant_Core
(Core : in System.Address;
Size : in AG_Size) return Data_Source_Access
with Import, Convention => C, Link_Name => "AG_OpenConstCore";
--
-- Create a Data_Source with a dynamically-allocated buffer which will be
-- made to grow implicitely by Write operations.
--
function Open_Auto_Core return Data_Source_Access
with Import, Convention => C, Link_Name => "AG_OpenAutoCore";
--
-- Close a Data_Source. Close_Data_Source closes any type of Data_Source.
-- The Close_* procedures are only provided for symmetry.
--
procedure Close_Data_Source (Source : in Data_Source_Access)
with Import, Convention => C, Link_Name => "AG_CloseDataSource";
procedure Close_File (Source : in Data_Source_Access)
with Import, Convention => C, Link_Name => "AG_CloseFile";
procedure Close_Core (Source : in Data_Source_Access)
with Import, Convention => C, Link_Name => "AG_CloseCore";
procedure Close_Constant_Core (Source : in Data_Source_Access)
with Import, Convention => C, Link_Name => "AG_CloseConstCore";
procedure Close_Auto_Core (Source : in Data_Source_Access)
with Import, Convention => C, Link_Name => "AG_CloseAutoCore";
--
-- Return the current position in the Data_Source.
--
function Tell (Source : in Data_Source_Access) return AG_Size
with Import, Convention => C, Link_Name => "AG_Tell";
--
-- Seek to specified position in the Data_Source. Mode can be Seek_Set
-- (relative to 0), Seek_Current (relative to current position) and
-- Seek_End (relative to end of data).
--
function Seek
(Source : in Data_Source_Access;
Offset : in AG_Offset;
Mode : in Seek_Mode) return C.int
with Import, Convention => C, Link_Name => "AG_Seek";
--
-- Acquire/release the mutex protecting access to a Data_Source.
--
procedure Lock (Source : in Data_Source_Access)
with Import, Convention => C, Link_Name => "AG_LockDataSource";
procedure Unlock (Source : in Data_Source_Access)
with Import, Convention => C, Link_Name => "AG_UnlockDataSource";
--
-- Select the preferred byte order for serialized integers.
-- Big endian is the default.
--
procedure Set_Byte_Order
(Source : in Data_Source_Access;
Byte_Order : in Byte_Order_t)
with Import, Convention => C, Link_Name => "AG_SetByteOrder";
--
-- Embed serialization markers to enforce low-level type safety checks.
-- A type signature will precede every data item. Note: Serialized data with
-- debug is not compatible with serialized data produced without debug.
--
procedure Set_Source_Debug
(Source : in Data_Source_Access;
Enable : in C.int)
with Import, Convention => C, Link_Name => "AG_SetSourceDebug";
--
-- Initialization/finalization routines. Implied by Open_*.
--
procedure Init (Source : in Data_Source_Access)
with Import, Convention => C, Link_Name => "AG_DataSourceInit";
procedure Destroy (Source : in Data_Source_Access)
with Import, Convention => C, Link_Name => "AG_DataSourceDestroy";
-- XXX TODO
-- type Error_Func_Access is not null access procedure (Event : Event_Access);
-- procedure Set_Error_Func
-- (Source : in Data_Source_Access;
-- Func : in Event_Func_Access);
-- pragma Import (C, Destroy, "AG_DataSourceSetErrorFn");
-----------------
-- Integer I/O --
-----------------
function Read_Unsigned_8
(Source : in Data_Source_Access) return Interfaces.Unsigned_8
with Import, Convention => C, Link_Name => "ag_read_uint8";
function Read_Signed_8 (Source : in Data_Source_Access) return Signed_8
with Import, Convention => C, Link_Name => "ag_read_sint8";
procedure Write_Unsigned_8
(Source : in Data_Source_Access;
Value : in Interfaces.Unsigned_8)
with Import, Convention => C, Link_Name => "ag_write_uint8";
procedure Write_Signed_8
(Source : in Data_Source_Access;
Value : in Signed_8)
with Import, Convention => C, Link_Name => "ag_write_sint8";
procedure Write_Unsigned_8_At
(Source : in Data_Source_Access;
Value : in Interfaces.Unsigned_8;
Offset : in AG_Offset)
with Import, Convention => C, Link_Name => "ag_write_uint8_at";
procedure Write_Signed_8_At
(Source : in Data_Source_Access;
Value : in Signed_8;
Offset : in AG_Offset)
with Import, Convention => C, Link_Name => "ag_write_sint8_at";
function Read_Unsigned_16
(Source : in Data_Source_Access) return Interfaces.Unsigned_16
with Import, Convention => C, Link_Name => "ag_read_uint16";
function Read_Signed_16
(Source : in Data_Source_Access) return Signed_16
with Import, Convention => C, Link_Name => "ag_read_sint16";
procedure Write_Unsigned_16
(Source : in Data_Source_Access;
Value : in Interfaces.Unsigned_16)
with Import, Convention => C, Link_Name => "ag_write_uint16";
procedure Write_Signed_16
(Source : in Data_Source_Access;
Value : in Signed_16)
with Import, Convention => C, Link_Name => "ag_write_sint16";
procedure Write_Unsigned_16_At
(Source : in Data_Source_Access;
Value : in Interfaces.Unsigned_16;
Offset : in AG_Offset)
with Import, Convention => C, Link_Name => "ag_write_uint16_at";
procedure Write_Signed_16_At
(Source : in Data_Source_Access;
Value : in Signed_16;
Offset : in AG_Offset)
with Import, Convention => C, Link_Name => "ag_write_sint16_at";
function Read_Unsigned_32
(Source : in Data_Source_Access) return Interfaces.Unsigned_32
with Import, Convention => C, Link_Name => "ag_read_uint32";
function Read_Signed_32
(Source : in Data_Source_Access) return Signed_32
with Import, Convention => C, Link_Name => "ag_read_sint32";
procedure Write_Unsigned_32
(Source : in Data_Source_Access;
Value : in Interfaces.Unsigned_32)
with Import, Convention => C, Link_Name => "ag_write_uint32";
procedure Write_Signed_32
(Source : in Data_Source_Access;
Value : in Signed_32)
with Import, Convention => C, Link_Name => "ag_write_sint32";
procedure Write_Unsigned_32_At
(Source : in Data_Source_Access;
Value : in Interfaces.Unsigned_32;
Offset : in AG_Offset)
with Import, Convention => C, Link_Name => "ag_write_uint32_at";
procedure Write_Signed_32_At
(Source : in Data_Source_Access;
Value : in Signed_32;
Offset : in AG_Offset)
with Import, Convention => C, Link_Name => "ag_write_sint32_at";
#if HAVE_64BIT
function Read_Unsigned_64
(Source : in Data_Source_Access) return Interfaces.Unsigned_64
with Import, Convention => C, Link_Name => "ag_read_uint64";
function Read_Signed_64
(Source : in Data_Source_Access) return Signed_64
with Import, Convention => C, Link_Name => "ag_read_sint64";
procedure Write_Unsigned_64
(Source : in Data_Source_Access;
Value : in Interfaces.Unsigned_64)
with Import, Convention => C, Link_Name => "ag_write_uint64";
procedure Write_Signed_64
(Source : in Data_Source_Access;
Value : in Signed_64)
with Import, Convention => C, Link_Name => "ag_write_sint64";
procedure Write_Unsigned_64_At
(Source : in Data_Source_Access;
Value : in Interfaces.Unsigned_64;
Offset : in AG_Offset)
with Import, Convention => C, Link_Name => "ag_write_uint64_at";
procedure Write_Signed_64_At
(Source : in Data_Source_Access;
Value : in Signed_64;
Offset : in AG_Offset)
with Import, Convention => C, Link_Name => "ag_write_sint64_at";
#end if;
------------------------
-- Floating-point I/O --
------------------------
#if HAVE_FLOAT
function Read_Float (Source : in Data_Source_Access) return Float
with Import, Convention => C, Link_Name => "ag_read_float";
procedure Write_Float
(Source : in Data_Source_Access;
Value : in Float)
with Import, Convention => C, Link_Name => "ag_write_float";
procedure Write_Float_At
(Source : in Data_Source_Access;
Value : in Float;
Offset : in AG_Offset)
with Import, Convention => C, Link_Name => "ag_write_float_at";
function Read_Double (Source : in Data_Source_Access) return Double
with Import, Convention => C, Link_Name => "ag_read_double";
procedure Write_Double
(Source : in Data_Source_Access;
Value : in Double)
with Import, Convention => C, Link_Name => "ag_write_double";
procedure Write_Double_At
(Source : in Data_Source_Access;
Value : in Double;
Offset : in AG_Offset)
with Import, Convention => C, Link_Name => "ag_write_double_at";
#if HAVE_LONG_DOUBLE
function Read_Long_Double
(Source : in Data_Source_Access) return Long_Double
with Import, Convention => C, Link_Name => "ag_read_long_double";
procedure Write_Long_Double
(Source : in Data_Source_Access;
Value : in Long_Double)
with Import, Convention => C, Link_Name => "ag_write_long_double";
procedure Write_Long_Double_At
(Source : in Data_Source_Access;
Value : in Long_Double;
Offset : in AG_Offset)
with Import, Convention => C, Link_Name => "ag_write_long_double_at";
# end if;
#end if;
----------------
-- String I/O --
----------------
function Read_String
(Source : in Data_Source_Access) return String;
function Read_String
(Source : in Data_Source_Access;
Max_Length : in Natural) return String;
function Read_Padded_String
(Source : in Data_Source_Access;
Length : in Natural) return String;
procedure Write_String
(Source : in Data_Source_Access;
Data : in String);
procedure Write_Padded_String
(Source : in Data_Source_Access;
Data : in String;
Length : in Natural);
procedure Skip_String
(Source : in Data_Source_Access)
with Import, Convention => C, Link_Name => "AG_SkipString";
procedure Skip_Padded_String
(Source : in Data_Source_Access)
with Import, Convention => C, Link_Name => "AG_SkipStringPadded";
-----------------
-- Generic I/O --
-----------------
generic
type Element_Type is private;
type Element_Count_Type is range <>;
type Element_Array_Index_Type is (<>);
type Element_Array_Type is array (Element_Array_Index_Type range <>) of Element_Type;
package IO is
procedure Read
(Source : in Data_Source_not_null_Access;
Buffer : out Element_Array_Type;
Read : out Element_Count_Type;
Status : out IO_Status);
procedure Read_At_Offset
(Source : in Data_Source_not_null_Access;
Offset : in AG_Offset;
Buffer : out Element_Array_Type;
Read : out Element_Count_Type;
Status : out IO_Status);
procedure Write
(Source : in Data_Source_Not_Null_Access;
Buffer : in Element_Array_Type;
Wrote : out Element_Count_Type;
Status : out IO_Status);
procedure Write_At_Offset
(Source : in Data_Source_Not_Null_Access;
Offset : in AG_Offset;
Buffer : in Element_Array_Type;
Wrote : out Element_Count_Type;
Status : out IO_Status);
end IO;
private
function AG_OpenFile
(Path : in CS.chars_ptr;
Mode : in CS.chars_ptr) return Data_Source_Access
with Import, Convention => C, Link_Name => "AG_OpenFile";
function AG_Read
(Source : in Data_Source_Access;
Buffer : in System.Address;
Size : in AG_Size;
Members : in AG_Size) return IO_Status
with Import, Convention => C, Link_Name => "AG_Read";
function AG_ReadAt
(Source : in Data_Source_Access;
Buffer : in System.Address;
Size : in AG_Size;
Members : in AG_Size;
Offset : in AG_Offset) return IO_Status
with Import, Convention => C, Link_Name => "AG_ReadAt";
function AG_Write
(Source : in Data_Source_Access;
Buffer : in System.Address;
Size : in AG_Size;
Members : in AG_Size) return IO_Status
with Import, Convention => C, Link_Name => "AG_Write";
function AG_WriteAt
(Source : in Data_Source_Access;
Buffer : in System.Address;
Size : in AG_Size;
Members : in AG_Size;
Offset : in AG_Offset) return IO_Status
with Import, Convention => C, Link_Name => "AG_WriteAt";
function AG_ReadStringLen
(Source : in Data_Source_Access;
Max_Size : in AG_Size) return CS.chars_ptr
with Import, Convention => C, Link_Name => "AG_ReadStringLen";
function AG_CopyString
(Buffer : in CS.chars_ptr;
Source : in Data_Source_Access;
Size : in AG_Size) return AG_Size
with Import, Convention => C, Link_Name => "AG_CopyString";
function AG_CopyStringPadded
(Buffer : in CS.chars_ptr;
Source : in Data_Source_Access;
Size : in AG_Size) return AG_Size
with Import, Convention => C, Link_Name => "AG_CopyStringPadded";
procedure AG_WriteString
(Source : in Data_Source_Access;
Data : in CS.chars_ptr)
with Import, Convention => C, Link_Name => "AG_WriteString";
procedure AG_WriteStringPadded
(Source : in Data_Source_Access;
Data : in CS.chars_ptr;
Length : in AG_Size)
with Import, Convention => C, Link_Name => "AG_WriteStringPadded";
end Agar.Data_Source;
|
------------------------------------------------------------------------------
-- --
-- Ada binding for OpenGL/WebGL --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2016-2020, 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. --
-- --
------------------------------------------------------------------------------
package body OpenGL.Shaders.Internals is
----------------------
-- Get_WebGL_Shader --
----------------------
function Get_WebGL_Shader
(Self : not null access OpenGL_Shader'Class)
return Web.GL.Shaders.WebGL_Shader is
begin
return Self.Shader;
end Get_WebGL_Shader;
end OpenGL.Shaders.Internals;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with AMF.Internals.UML_Named_Elements;
with AMF.UML.Activities;
with AMF.UML.Activity_Edges.Collections;
with AMF.UML.Activity_Groups.Collections;
with AMF.UML.Activity_Nodes.Collections;
with AMF.UML.Activity_Partitions.Collections;
with AMF.UML.Add_Structural_Feature_Value_Actions;
with AMF.UML.Classifiers.Collections;
with AMF.UML.Constraints.Collections;
with AMF.UML.Dependencies.Collections;
with AMF.UML.Exception_Handlers.Collections;
with AMF.UML.Input_Pins.Collections;
with AMF.UML.Interruptible_Activity_Regions.Collections;
with AMF.UML.Named_Elements;
with AMF.UML.Namespaces;
with AMF.UML.Output_Pins.Collections;
with AMF.UML.Packages.Collections;
with AMF.UML.Redefinable_Elements.Collections;
with AMF.UML.String_Expressions;
with AMF.UML.Structural_Features;
with AMF.UML.Structured_Activity_Nodes;
with AMF.Visitors;
package AMF.Internals.UML_Add_Structural_Feature_Value_Actions is
type UML_Add_Structural_Feature_Value_Action_Proxy is
limited new AMF.Internals.UML_Named_Elements.UML_Named_Element_Proxy
and AMF.UML.Add_Structural_Feature_Value_Actions.UML_Add_Structural_Feature_Value_Action with null record;
overriding function Get_Insert_At
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return AMF.UML.Input_Pins.UML_Input_Pin_Access;
-- Getter of AddStructuralFeatureValueAction::insertAt.
--
-- Gives the position at which to insert a new value or move an existing
-- value in ordered structural features. The type of the pin is
-- UnlimitedNatural, but the value cannot be zero. This pin is omitted for
-- unordered structural features.
overriding procedure Set_Insert_At
(Self : not null access UML_Add_Structural_Feature_Value_Action_Proxy;
To : AMF.UML.Input_Pins.UML_Input_Pin_Access);
-- Setter of AddStructuralFeatureValueAction::insertAt.
--
-- Gives the position at which to insert a new value or move an existing
-- value in ordered structural features. The type of the pin is
-- UnlimitedNatural, but the value cannot be zero. This pin is omitted for
-- unordered structural features.
overriding function Get_Is_Replace_All
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return Boolean;
-- Getter of AddStructuralFeatureValueAction::isReplaceAll.
--
-- Specifies whether existing values of the structural feature of the
-- object should be removed before adding the new value.
overriding procedure Set_Is_Replace_All
(Self : not null access UML_Add_Structural_Feature_Value_Action_Proxy;
To : Boolean);
-- Setter of AddStructuralFeatureValueAction::isReplaceAll.
--
-- Specifies whether existing values of the structural feature of the
-- object should be removed before adding the new value.
overriding function Get_Result
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return AMF.UML.Output_Pins.UML_Output_Pin_Access;
-- Getter of WriteStructuralFeatureAction::result.
--
-- Gives the output pin on which the result is put.
overriding procedure Set_Result
(Self : not null access UML_Add_Structural_Feature_Value_Action_Proxy;
To : AMF.UML.Output_Pins.UML_Output_Pin_Access);
-- Setter of WriteStructuralFeatureAction::result.
--
-- Gives the output pin on which the result is put.
overriding function Get_Value
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return AMF.UML.Input_Pins.UML_Input_Pin_Access;
-- Getter of WriteStructuralFeatureAction::value.
--
-- Value to be added or removed from the structural feature.
overriding procedure Set_Value
(Self : not null access UML_Add_Structural_Feature_Value_Action_Proxy;
To : AMF.UML.Input_Pins.UML_Input_Pin_Access);
-- Setter of WriteStructuralFeatureAction::value.
--
-- Value to be added or removed from the structural feature.
overriding function Get_Object
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return AMF.UML.Input_Pins.UML_Input_Pin_Access;
-- Getter of StructuralFeatureAction::object.
--
-- Gives the input pin from which the object whose structural feature is
-- to be read or written is obtained.
overriding procedure Set_Object
(Self : not null access UML_Add_Structural_Feature_Value_Action_Proxy;
To : AMF.UML.Input_Pins.UML_Input_Pin_Access);
-- Setter of StructuralFeatureAction::object.
--
-- Gives the input pin from which the object whose structural feature is
-- to be read or written is obtained.
overriding function Get_Structural_Feature
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return AMF.UML.Structural_Features.UML_Structural_Feature_Access;
-- Getter of StructuralFeatureAction::structuralFeature.
--
-- Structural feature to be read.
overriding procedure Set_Structural_Feature
(Self : not null access UML_Add_Structural_Feature_Value_Action_Proxy;
To : AMF.UML.Structural_Features.UML_Structural_Feature_Access);
-- Setter of StructuralFeatureAction::structuralFeature.
--
-- Structural feature to be read.
overriding function Get_Context
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return AMF.UML.Classifiers.UML_Classifier_Access;
-- Getter of Action::context.
--
-- The classifier that owns the behavior of which this action is a part.
overriding function Get_Input
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return AMF.UML.Input_Pins.Collections.Ordered_Set_Of_UML_Input_Pin;
-- Getter of Action::input.
--
-- The ordered set of input pins connected to the Action. These are among
-- the total set of inputs.
overriding function Get_Is_Locally_Reentrant
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return Boolean;
-- Getter of Action::isLocallyReentrant.
--
-- If true, the action can begin a new, concurrent execution, even if
-- there is already another execution of the action ongoing. If false, the
-- action cannot begin a new execution until any previous execution has
-- completed.
overriding procedure Set_Is_Locally_Reentrant
(Self : not null access UML_Add_Structural_Feature_Value_Action_Proxy;
To : Boolean);
-- Setter of Action::isLocallyReentrant.
--
-- If true, the action can begin a new, concurrent execution, even if
-- there is already another execution of the action ongoing. If false, the
-- action cannot begin a new execution until any previous execution has
-- completed.
overriding function Get_Local_Postcondition
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return AMF.UML.Constraints.Collections.Set_Of_UML_Constraint;
-- Getter of Action::localPostcondition.
--
-- Constraint that must be satisfied when executed is completed.
overriding function Get_Local_Precondition
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return AMF.UML.Constraints.Collections.Set_Of_UML_Constraint;
-- Getter of Action::localPrecondition.
--
-- Constraint that must be satisfied when execution is started.
overriding function Get_Output
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return AMF.UML.Output_Pins.Collections.Ordered_Set_Of_UML_Output_Pin;
-- Getter of Action::output.
--
-- The ordered set of output pins connected to the Action. The action
-- places its results onto pins in this set.
overriding function Get_Handler
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return AMF.UML.Exception_Handlers.Collections.Set_Of_UML_Exception_Handler;
-- Getter of ExecutableNode::handler.
--
-- A set of exception handlers that are examined if an uncaught exception
-- propagates to the outer level of the executable node.
overriding function Get_Activity
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return AMF.UML.Activities.UML_Activity_Access;
-- Getter of ActivityNode::activity.
--
-- Activity containing the node.
overriding procedure Set_Activity
(Self : not null access UML_Add_Structural_Feature_Value_Action_Proxy;
To : AMF.UML.Activities.UML_Activity_Access);
-- Setter of ActivityNode::activity.
--
-- Activity containing the node.
overriding function Get_In_Group
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return AMF.UML.Activity_Groups.Collections.Set_Of_UML_Activity_Group;
-- Getter of ActivityNode::inGroup.
--
-- Groups containing the node.
overriding function Get_In_Interruptible_Region
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return AMF.UML.Interruptible_Activity_Regions.Collections.Set_Of_UML_Interruptible_Activity_Region;
-- Getter of ActivityNode::inInterruptibleRegion.
--
-- Interruptible regions containing the node.
overriding function Get_In_Partition
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return AMF.UML.Activity_Partitions.Collections.Set_Of_UML_Activity_Partition;
-- Getter of ActivityNode::inPartition.
--
-- Partitions containing the node.
overriding function Get_In_Structured_Node
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return AMF.UML.Structured_Activity_Nodes.UML_Structured_Activity_Node_Access;
-- Getter of ActivityNode::inStructuredNode.
--
-- Structured activity node containing the node.
overriding procedure Set_In_Structured_Node
(Self : not null access UML_Add_Structural_Feature_Value_Action_Proxy;
To : AMF.UML.Structured_Activity_Nodes.UML_Structured_Activity_Node_Access);
-- Setter of ActivityNode::inStructuredNode.
--
-- Structured activity node containing the node.
overriding function Get_Incoming
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return AMF.UML.Activity_Edges.Collections.Set_Of_UML_Activity_Edge;
-- Getter of ActivityNode::incoming.
--
-- Edges that have the node as target.
overriding function Get_Outgoing
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return AMF.UML.Activity_Edges.Collections.Set_Of_UML_Activity_Edge;
-- Getter of ActivityNode::outgoing.
--
-- Edges that have the node as source.
overriding function Get_Redefined_Node
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return AMF.UML.Activity_Nodes.Collections.Set_Of_UML_Activity_Node;
-- Getter of ActivityNode::redefinedNode.
--
-- Inherited nodes replaced by this node in a specialization of the
-- activity.
overriding function Get_Is_Leaf
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return Boolean;
-- Getter of RedefinableElement::isLeaf.
--
-- Indicates whether it is possible to further redefine a
-- RedefinableElement. If the value is true, then it is not possible to
-- further redefine the RedefinableElement. Note that this property is
-- preserved through package merge operations; that is, the capability to
-- redefine a RedefinableElement (i.e., isLeaf=false) must be preserved in
-- the resulting RedefinableElement of a package merge operation where a
-- RedefinableElement with isLeaf=false is merged with a matching
-- RedefinableElement with isLeaf=true: the resulting RedefinableElement
-- will have isLeaf=false. Default value is false.
overriding procedure Set_Is_Leaf
(Self : not null access UML_Add_Structural_Feature_Value_Action_Proxy;
To : Boolean);
-- Setter of RedefinableElement::isLeaf.
--
-- Indicates whether it is possible to further redefine a
-- RedefinableElement. If the value is true, then it is not possible to
-- further redefine the RedefinableElement. Note that this property is
-- preserved through package merge operations; that is, the capability to
-- redefine a RedefinableElement (i.e., isLeaf=false) must be preserved in
-- the resulting RedefinableElement of a package merge operation where a
-- RedefinableElement with isLeaf=false is merged with a matching
-- RedefinableElement with isLeaf=true: the resulting RedefinableElement
-- will have isLeaf=false. Default value is false.
overriding function Get_Redefined_Element
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return AMF.UML.Redefinable_Elements.Collections.Set_Of_UML_Redefinable_Element;
-- Getter of RedefinableElement::redefinedElement.
--
-- The redefinable element that is being redefined by this element.
overriding function Get_Redefinition_Context
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier;
-- Getter of RedefinableElement::redefinitionContext.
--
-- References the contexts that this element may be redefined from.
overriding function Get_Client_Dependency
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency;
-- Getter of NamedElement::clientDependency.
--
-- Indicates the dependencies that reference the client.
overriding function Get_Name_Expression
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return AMF.UML.String_Expressions.UML_String_Expression_Access;
-- Getter of NamedElement::nameExpression.
--
-- The string expression used to define the name of this named element.
overriding procedure Set_Name_Expression
(Self : not null access UML_Add_Structural_Feature_Value_Action_Proxy;
To : AMF.UML.String_Expressions.UML_String_Expression_Access);
-- Setter of NamedElement::nameExpression.
--
-- The string expression used to define the name of this named element.
overriding function Get_Namespace
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access;
-- Getter of NamedElement::namespace.
--
-- Specifies the namespace that owns the NamedElement.
overriding function Get_Qualified_Name
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return AMF.Optional_String;
-- Getter of NamedElement::qualifiedName.
--
-- A name which allows the NamedElement to be identified within a
-- hierarchy of nested Namespaces. It is constructed from the names of the
-- containing namespaces starting at the root of the hierarchy and ending
-- with the name of the NamedElement itself.
overriding function Context
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return AMF.UML.Classifiers.UML_Classifier_Access;
-- Operation Action::context.
--
-- Missing derivation for Action::/context : Classifier
overriding function Is_Consistent_With
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy;
Redefinee : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean;
-- Operation RedefinableElement::isConsistentWith.
--
-- The query isConsistentWith() specifies, for any two RedefinableElements
-- in a context in which redefinition is possible, whether redefinition
-- would be logically consistent. By default, this is false; this
-- operation must be overridden for subclasses of RedefinableElement to
-- define the consistency conditions.
overriding function Is_Redefinition_Context_Valid
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy;
Redefined : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean;
-- Operation RedefinableElement::isRedefinitionContextValid.
--
-- The query isRedefinitionContextValid() specifies whether the
-- redefinition contexts of this RedefinableElement are properly related
-- to the redefinition contexts of the specified RedefinableElement to
-- allow this element to redefine the other. By default at least one of
-- the redefinition contexts of this element must be a specialization of
-- at least one of the redefinition contexts of the specified element.
overriding function All_Owning_Packages
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return AMF.UML.Packages.Collections.Set_Of_UML_Package;
-- Operation NamedElement::allOwningPackages.
--
-- The query allOwningPackages() returns all the directly or indirectly
-- owning packages.
overriding function Is_Distinguishable_From
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy;
N : AMF.UML.Named_Elements.UML_Named_Element_Access;
Ns : AMF.UML.Namespaces.UML_Namespace_Access)
return Boolean;
-- Operation NamedElement::isDistinguishableFrom.
--
-- The query isDistinguishableFrom() determines whether two NamedElements
-- may logically co-exist within a Namespace. By default, two named
-- elements are distinguishable if (a) they have unrelated types or (b)
-- they have related types but different names.
overriding function Namespace
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access;
-- Operation NamedElement::namespace.
--
-- Missing derivation for NamedElement::/namespace : Namespace
overriding procedure Enter_Element
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of visitor interface.
overriding procedure Leave_Element
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of visitor interface.
overriding procedure Visit_Element
(Self : not null access constant UML_Add_Structural_Feature_Value_Action_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of iterator interface.
end AMF.Internals.UML_Add_Structural_Feature_Value_Actions;
|
-----------------------------------------------------------------------
-- search-testsuite -- Testsuite for search
-- 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.
-----------------------------------------------------------------------
with Search.Tokens.Tests;
with Search.Fields.Tests;
with Search.Tokenizers.Tests;
with Search.Positions.Tests;
package body Search.Testsuite is
Tests : aliased Util.Tests.Test_Suite;
function Suite return Util.Tests.Access_Test_Suite is
begin
Search.Positions.Tests.Add_Tests (Tests'Access);
Search.Tokens.Tests.Add_Tests (Tests'Access);
Search.Fields.Tests.Add_Tests (Tests'Access);
Search.Tokenizers.Tests.Add_Tests (Tests'Access);
return Tests'Access;
end Suite;
end Search.Testsuite;
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- G N A T . C R C 3 2 --
-- --
-- S p e c --
-- --
-- Copyright (C) 2004-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. --
-- --
------------------------------------------------------------------------------
-- This package provides routines for computing a commonly used checksum
-- called CRC-32. This is a checksum based on treating the binary data
-- as a polynomial over a binary field, and the exact specifications of
-- the CRC-32 algorithm are as follows:
-- Name : "CRC-32"
-- Width : 32
-- Poly : 04C11DB7
-- Init : FFFFFFFF
-- RefIn : True
-- RefOut : True
-- XorOut : FFFFFFFF
-- Check : CBF43926
-- Note that this is the algorithm used by PKZip, Ethernet and FDDI
-- For more information about this algorithm see:
-- ftp://ftp.rocksoft.com/papers/crc_v3.txt
-- "A Painless Guide to CRC Error Detection Algorithms", Ross N. Williams
-- "Computation of Cyclic Redundancy Checks via Table Look-Up", Communications
-- of the ACM, Vol. 31 No. 8, pp.1008-1013 Aug. 1988. Sarwate, D.V.
with Ada.Streams;
with Interfaces;
with System.CRC32;
package GNAT.CRC32 is
subtype CRC32 is System.CRC32.CRC32;
-- Used to represent CRC32 values, which are 32 bit bit-strings
procedure Initialize (C : out CRC32)
renames System.CRC32.Initialize;
-- Initialize CRC value by assigning the standard Init value (16#FFFF_FFFF)
procedure Update
(C : in out CRC32;
Value : Character)
renames System.CRC32.Update;
-- Evolve CRC by including the contribution from Character'Pos (Value)
procedure Update
(C : in out CRC32;
Value : String);
-- For each character in the Value string call above routine
procedure Wide_Update
(C : in out CRC32;
Value : Wide_Character);
-- Evolve CRC by including the contribution from Wide_Character'Pos (Value)
-- with the bytes being included in the natural memory order.
procedure Wide_Update
(C : in out CRC32;
Value : Wide_String);
-- For each character in the Value string call above routine
procedure Update
(C : in out CRC32;
Value : Ada.Streams.Stream_Element);
-- Evolve CRC by including the contribution from Value
procedure Update
(C : in out CRC32;
Value : Ada.Streams.Stream_Element_Array);
-- For each element in the Value array call above routine
function Get_Value (C : CRC32) return Interfaces.Unsigned_32
renames System.CRC32.Get_Value;
-- Get_Value computes the CRC32 value by performing an XOR with the
-- standard XorOut value (16#FFFF_FFFF). Note that this does not
-- change the value of C, so it may be used to retrieve intermediate
-- values of the CRC32 value during a sequence of Update calls.
pragma Inline (Update);
pragma Inline (Wide_Update);
end GNAT.CRC32;
|
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
package Program.Elements.Clauses is
pragma Pure (Program.Elements.Clauses);
type Clause is limited interface and Program.Elements.Element;
type Clause_Access is access all Clause'Class with Storage_Size => 0;
end Program.Elements.Clauses;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 1 1 --
-- --
-- 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 = 11
package System.Pack_11 is
pragma Preelaborate;
Bits : constant := 11;
type Bits_11 is mod 2 ** Bits;
for Bits_11'Size use Bits;
-- In all subprograms below, Rev_SSO is set True if the array has the
-- non-default scalar storage order.
function Get_11
(Arr : System.Address;
N : Natural;
Rev_SSO : Boolean) return Bits_11 with Inline;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned.
procedure Set_11
(Arr : System.Address;
N : Natural;
E : Bits_11;
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_11;
|
-- C92005B.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- CHECK THAT FOR A TASK OBJECT CREATED BY AN ALLOCATOR THE
-- OBJECT VALUE IS SET DURING EXECUTION OF THE ALLOCATOR.
-- WEI 3/ 4/82
-- JBG 5/25/85
-- RLB 1/ 7/05
WITH REPORT;
USE REPORT;
WITH SYSTEM;
PROCEDURE C92005B IS
TYPE BIG_INT IS RANGE 0..SYSTEM.MAX_INT;
BEGIN
TEST ("C92005B", "TASK VALUE SET BY EXECUTION OF ALLOCATOR");
BLOCK:
DECLARE
TASK TYPE TT1;
TYPE ATT1 IS ACCESS TT1;
TASK BODY TT1 IS
BEGIN
NULL;
END TT1;
PACKAGE PACK IS
END PACK;
PACKAGE BODY PACK IS
POINTER_TT1 : ATT1 := NEW TT1;
I : BIG_INT := POINTER_TT1.ALL'STORAGE_SIZE;
BEGIN
IF NOT EQUAL(INTEGER(I MOD 1024), INTEGER(I MOD 1024)) THEN
FAILED ("UNEXPECTED PROBLEM");
END IF;
END PACK;
BEGIN
NULL;
EXCEPTION
WHEN PROGRAM_ERROR | CONSTRAINT_ERROR =>
FAILED ("TASK OBJECT VALUE NOT SET DURING " &
"EXECUTION OF ALLOCATOR");
END BLOCK;
RESULT;
END C92005B;
|
with Vector_package, Ada.Integer_Text_IO,Ada.Text_IO; use Vector_package, Ada.Text_IO;
procedure DemoVec is
V: Vector(5);
V2: Vector(5);
Arr : TArray := (1,8);
begin
insert(V,2);
insert(V,5);
insert(V,5);
insert(V2,5);
insert(V2,2);
insert(V2,2);
--assign(V2,3,7);
if (compare(V,V2)=True) then
Put_Line("They have same numbers");
else
Put_Line("Not same numbers"); -- my sample not same (2,5) and (2,5,7,7,7)
end if;
print_Vector(V); -- (2,5)
New_Line;
New_Line;
print_Vector(V2); -- (2,5,7,7,7)
New_Line;
New_Line;
if (compare(V,V2)=True) then
Put_Line("They are same");
else
Put_Line("Not same"); -- my sample not same (2,5) and (2,5,7,7,7)
end if;
swap(V,V2);
New_Line;
New_Line;
print_Vector(V); --(2,5,7,7,7)
New_Line;
New_Line;
print_Vector(V2); -- (2,5)
remove(V,7,all_occurrences => True); --(2,5); it was (2,5,7,7,7) before
join(V,V2); -- (2,5) and (2,5) --> (2,5,2,5)
New_Line;
New_Line;
print_Vector(V); --(2,5,2,5) works correctly
copy(V2,Arr); --V2: (2,5) ; Arr: (1,8) -> expected : (2,5,1,8)
New_Line;
New_Line;
print_Vector(V2); -- (2,5,1,8) works correctly.
remove(V2,8,all_occurrences => False); -- -> expected output: (2,5,1)
New_Line;
New_Line;
print_Vector(V2); -- (2,5,1) works correctly
New_Line;
New_Line;
Ada.Integer_Text_IO.Put(size(V)); -- 4 (2,5,2,5)
New_Line;
Ada.Integer_Text_IO.Put(first(V)); --2
New_Line;
Ada.Integer_Text_IO.Put(last(V)); -- 5
New_Line;
if(is_Empty(V)) then Put_Line("It is empty"); else Put_Line("Not empty"); end if; -- V:(2,5,2,5) -> expected Not empty
clear(V); -- testing clear.
New_Line;
if(is_Empty(V)) then Put_Line("It is empty"); else Put_Line("Not empty"); end if; -- It is empty, clear works correctly.
end DemoVec;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012-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$
------------------------------------------------------------------------------
pragma Restrictions (No_Elaboration_Code);
-- GNAT: enforce generation of preinitialized data section instead of
-- generation of elaboration code.
package Matreshka.Internals.Unicode.Ucd.Core_0E02 is
pragma Preelaborate;
Group_0E02 : aliased constant Core_Second_Stage
:= (others =>
(Unassigned, Neutral,
Control, Other, Other, Unknown,
(Other_Default_Ignorable_Code_Point
| Default_Ignorable_Code_Point
| Changes_When_NFKC_Casefolded => True,
others => False)));
end Matreshka.Internals.Unicode.Ucd.Core_0E02;
|
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="11">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>matrixmul</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>3</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>a</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>a</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>3</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>b</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>b</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>3</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>res</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>res</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>9</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>48</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name></name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>54</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</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>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>54</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>66</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>indvar_flatten</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>68</item>
<item>69</item>
<item>70</item>
<item>71</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>i</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>56</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>56</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>73</item>
<item>74</item>
<item>75</item>
<item>76</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>12</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>2</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>77</item>
<item>78</item>
<item>79</item>
<item>80</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name>exitcond_flatten</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>81</item>
<item>83</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name>indvar_flatten_next</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>84</item>
<item>86</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>87</item>
<item>88</item>
<item>89</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>exitcond</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>56</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</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>90</item>
<item>92</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>j_mid2</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>56</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>56</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>93</item>
<item>94</item>
<item>95</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>i_s</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>54</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>54</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>97</item>
<item>98</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>i_mid2</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>56</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>56</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>99</item>
<item>100</item>
<item>101</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>tmp</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>57</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>57</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>102</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>tmp_2</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>57</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>57</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>103</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>tmp_trn_cast</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>57</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>57</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>104</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>tmp_2_trn_cast</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>56</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>56</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>105</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>tmp_1</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>56</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>56</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>107</item>
<item>108</item>
<item>109</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>p_shl_cast</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>57</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>57</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>110</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>p_addr</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>57</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>57</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>111</item>
<item>112</item>
</oprand_edges>
<opcode>sub</opcode>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>p_addr_cast</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>57</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>57</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>113</item>
</oprand_edges>
<opcode>sext</opcode>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>p_addr1</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>57</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>57</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>114</item>
<item>115</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>p_addr1_cast</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>57</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>57</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>116</item>
</oprand_edges>
<opcode>sext</opcode>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>tmp_5</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>57</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>57</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>117</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>res_addr</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>57</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>57</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>118</item>
<item>120</item>
<item>121</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name>a_addr</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>60</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>60</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>122</item>
<item>123</item>
<item>124</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>a_load</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>60</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>60</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>125</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>tmp_6</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>60</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>60</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>126</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>tmp_s</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>60</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>60</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>127</item>
</oprand_edges>
<opcode>sext</opcode>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>b_addr</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>60</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>60</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>128</item>
<item>129</item>
<item>130</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>b_load</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>60</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>60</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>131</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>tmp_12</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>60</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>60</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>132</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>tmp_4</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>60</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>60</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>133</item>
</oprand_edges>
<opcode>sext</opcode>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>tmp_7</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>60</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>60</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>134</item>
<item>135</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name>tmp_9</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>60</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>60</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>137</item>
<item>138</item>
<item>140</item>
<item>142</item>
</oprand_edges>
<opcode>partselect</opcode>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name>tmp_5_1</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>60</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>60</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>143</item>
</oprand_edges>
<opcode>sext</opcode>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name>tmp_8</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>60</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>60</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>144</item>
<item>145</item>
<item>146</item>
<item>147</item>
</oprand_edges>
<opcode>partselect</opcode>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>tmp_6_1</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>60</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>60</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>148</item>
</oprand_edges>
<opcode>sext</opcode>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>51</id>
<name>tmp_7_1</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>60</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>60</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>149</item>
<item>150</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name>tmp_10</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>60</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>60</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>151</item>
<item>152</item>
<item>154</item>
<item>156</item>
</oprand_edges>
<opcode>partselect</opcode>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>tmp_5_2</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>60</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>60</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>157</item>
</oprand_edges>
<opcode>sext</opcode>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>54</id>
<name>tmp_11</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>60</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>60</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>158</item>
<item>159</item>
<item>160</item>
<item>161</item>
</oprand_edges>
<opcode>partselect</opcode>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>tmp_6_2</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>60</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>60</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>162</item>
</oprand_edges>
<opcode>sext</opcode>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name>tmp_7_2</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>60</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>60</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>163</item>
<item>164</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name>tmp1</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>60</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>60</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>165</item>
<item>166</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name>tmp_8_2</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>60</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>60</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>167</item>
<item>168</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>59</id>
<name></name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>60</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>60</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>169</item>
<item>170</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>61</id>
<name>j_1</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>56</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>56</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>171</item>
<item>172</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>62</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>173</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>64</id>
<name></name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</fileDirectory>
<lineNumber>65</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>65</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>11</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_52">
<Value>
<Obj>
<type>2</type>
<id>67</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="_53">
<Value>
<Obj>
<type>2</type>
<id>72</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="_54">
<Value>
<Obj>
<type>2</type>
<id>82</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>9</content>
</item>
<item class_id_reference="16" object_id="_55">
<Value>
<Obj>
<type>2</type>
<id>85</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="_56">
<Value>
<Obj>
<type>2</type>
<id>91</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<const_type>0</const_type>
<content>3</content>
</item>
<item class_id_reference="16" object_id="_57">
<Value>
<Obj>
<type>2</type>
<id>96</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</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>119</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_59">
<Value>
<Obj>
<type>2</type>
<id>139</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_60">
<Value>
<Obj>
<type>2</type>
<id>141</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>15</content>
</item>
<item class_id_reference="16" object_id="_61">
<Value>
<Obj>
<type>2</type>
<id>153</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>16</content>
</item>
<item class_id_reference="16" object_id="_62">
<Value>
<Obj>
<type>2</type>
<id>155</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>23</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_63">
<Obj>
<type>3</type>
<id>9</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>8</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_64">
<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>6</count>
<item_version>0</item_version>
<item>10</item>
<item>11</item>
<item>12</item>
<item>13</item>
<item>14</item>
<item>15</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_65">
<Obj>
<type>3</type>
<id>63</id>
<name>.reset</name>
<fileName></fileName>
<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>40</count>
<item_version>0</item_version>
<item>19</item>
<item>20</item>
<item>21</item>
<item>22</item>
<item>23</item>
<item>27</item>
<item>28</item>
<item>29</item>
<item>30</item>
<item>31</item>
<item>32</item>
<item>33</item>
<item>34</item>
<item>35</item>
<item>36</item>
<item>37</item>
<item>38</item>
<item>39</item>
<item>40</item>
<item>41</item>
<item>42</item>
<item>43</item>
<item>44</item>
<item>45</item>
<item>46</item>
<item>47</item>
<item>48</item>
<item>49</item>
<item>50</item>
<item>51</item>
<item>52</item>
<item>53</item>
<item>54</item>
<item>55</item>
<item>56</item>
<item>57</item>
<item>58</item>
<item>59</item>
<item>61</item>
<item>62</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_66">
<Obj>
<type>3</type>
<id>65</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>94</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_67">
<id>66</id>
<edge_type>2</edge_type>
<source_obj>16</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_68">
<id>68</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_69">
<id>69</id>
<edge_type>2</edge_type>
<source_obj>9</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_70">
<id>70</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_71">
<id>71</id>
<edge_type>2</edge_type>
<source_obj>63</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_72">
<id>73</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_73">
<id>74</id>
<edge_type>2</edge_type>
<source_obj>9</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_74">
<id>75</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_75">
<id>76</id>
<edge_type>2</edge_type>
<source_obj>63</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_76">
<id>77</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_77">
<id>78</id>
<edge_type>2</edge_type>
<source_obj>9</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_78">
<id>79</id>
<edge_type>1</edge_type>
<source_obj>61</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_79">
<id>80</id>
<edge_type>2</edge_type>
<source_obj>63</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_80">
<id>81</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_81">
<id>83</id>
<edge_type>1</edge_type>
<source_obj>82</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_82">
<id>84</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_83">
<id>86</id>
<edge_type>1</edge_type>
<source_obj>85</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_84">
<id>87</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_85">
<id>88</id>
<edge_type>2</edge_type>
<source_obj>63</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_86">
<id>89</id>
<edge_type>2</edge_type>
<source_obj>65</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_87">
<id>90</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_88">
<id>92</id>
<edge_type>1</edge_type>
<source_obj>91</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_89">
<id>93</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>94</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_91">
<id>95</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_92">
<id>97</id>
<edge_type>1</edge_type>
<source_obj>96</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_93">
<id>98</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_94">
<id>99</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_95">
<id>100</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_96">
<id>101</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_97">
<id>102</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_98">
<id>103</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_99">
<id>104</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_100">
<id>105</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_101">
<id>108</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_102">
<id>109</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_103">
<id>110</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_104">
<id>111</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_105">
<id>112</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_106">
<id>113</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_107">
<id>114</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_108">
<id>115</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_109">
<id>116</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_110">
<id>117</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_111">
<id>118</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_112">
<id>120</id>
<edge_type>1</edge_type>
<source_obj>119</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_113">
<id>121</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_114">
<id>122</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_115">
<id>123</id>
<edge_type>1</edge_type>
<source_obj>119</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_116">
<id>124</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_117">
<id>125</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_118">
<id>126</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_119">
<id>127</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_120">
<id>128</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_121">
<id>129</id>
<edge_type>1</edge_type>
<source_obj>119</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_122">
<id>130</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_123">
<id>131</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_124">
<id>132</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_125">
<id>133</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_126">
<id>134</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_127">
<id>135</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_128">
<id>138</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_129">
<id>140</id>
<edge_type>1</edge_type>
<source_obj>139</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_130">
<id>142</id>
<edge_type>1</edge_type>
<source_obj>141</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_131">
<id>143</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_132">
<id>145</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_133">
<id>146</id>
<edge_type>1</edge_type>
<source_obj>139</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_134">
<id>147</id>
<edge_type>1</edge_type>
<source_obj>141</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_135">
<id>148</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_136">
<id>149</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>51</sink_obj>
</item>
<item class_id_reference="20" object_id="_137">
<id>150</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>51</sink_obj>
</item>
<item class_id_reference="20" object_id="_138">
<id>152</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_139">
<id>154</id>
<edge_type>1</edge_type>
<source_obj>153</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_140">
<id>156</id>
<edge_type>1</edge_type>
<source_obj>155</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_141">
<id>157</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_142">
<id>159</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>54</sink_obj>
</item>
<item class_id_reference="20" object_id="_143">
<id>160</id>
<edge_type>1</edge_type>
<source_obj>153</source_obj>
<sink_obj>54</sink_obj>
</item>
<item class_id_reference="20" object_id="_144">
<id>161</id>
<edge_type>1</edge_type>
<source_obj>155</source_obj>
<sink_obj>54</sink_obj>
</item>
<item class_id_reference="20" object_id="_145">
<id>162</id>
<edge_type>1</edge_type>
<source_obj>54</source_obj>
<sink_obj>55</sink_obj>
</item>
<item class_id_reference="20" object_id="_146">
<id>163</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_147">
<id>164</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_148">
<id>165</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>57</sink_obj>
</item>
<item class_id_reference="20" object_id="_149">
<id>166</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>57</sink_obj>
</item>
<item class_id_reference="20" object_id="_150">
<id>167</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>58</sink_obj>
</item>
<item class_id_reference="20" object_id="_151">
<id>168</id>
<edge_type>1</edge_type>
<source_obj>51</source_obj>
<sink_obj>58</sink_obj>
</item>
<item class_id_reference="20" object_id="_152">
<id>169</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>59</sink_obj>
</item>
<item class_id_reference="20" object_id="_153">
<id>170</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>59</sink_obj>
</item>
<item class_id_reference="20" object_id="_154">
<id>171</id>
<edge_type>1</edge_type>
<source_obj>96</source_obj>
<sink_obj>61</sink_obj>
</item>
<item class_id_reference="20" object_id="_155">
<id>172</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>61</sink_obj>
</item>
<item class_id_reference="20" object_id="_156">
<id>173</id>
<edge_type>2</edge_type>
<source_obj>16</source_obj>
<sink_obj>62</sink_obj>
</item>
<item class_id_reference="20" object_id="_157">
<id>215</id>
<edge_type>2</edge_type>
<source_obj>9</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_158">
<id>216</id>
<edge_type>2</edge_type>
<source_obj>16</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_159">
<id>217</id>
<edge_type>2</edge_type>
<source_obj>16</source_obj>
<sink_obj>63</sink_obj>
</item>
<item class_id_reference="20" object_id="_160">
<id>218</id>
<edge_type>2</edge_type>
<source_obj>63</source_obj>
<sink_obj>16</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_161">
<mId>1</mId>
<mTag>matrixmul</mTag>
<mType>0</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>12</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_162">
<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>9</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="_163">
<mId>3</mId>
<mTag>Row_Col</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>16</item>
<item>63</item>
</basic_blocks>
<mII>1</mII>
<mDepth>3</mDepth>
<mMinTripCount>9</mMinTripCount>
<mMaxTripCount>9</mMaxTripCount>
<mMinLatency>10</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_164">
<mId>4</mId>
<mTag>Return</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>65</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="_165">
<states class_id="25" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_166">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_167">
<id>4</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_168">
<id>5</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_169">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_170">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_171">
<id>8</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_172">
<id>2</id>
<operations>
<count>17</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_173">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_174">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_175">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_176">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_177">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_178">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_179">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_180">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_181">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_182">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_183">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_184">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_185">
<id>38</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_186">
<id>39</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_187">
<id>42</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_188">
<id>43</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_189">
<id>61</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_190">
<id>3</id>
<operations>
<count>15</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_191">
<id>39</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_192">
<id>40</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_193">
<id>41</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_194">
<id>43</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_195">
<id>44</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_196">
<id>45</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_197">
<id>46</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_198">
<id>47</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_199">
<id>49</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_200">
<id>52</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_201">
<id>53</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_202">
<id>54</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_203">
<id>55</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_204">
<id>56</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_205">
<id>57</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_206">
<id>4</id>
<operations>
<count>22</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_207">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_208">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_209">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_210">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_211">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_212">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_213">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_214">
<id>30</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_215">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_216">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_217">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_218">
<id>34</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_219">
<id>35</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_220">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_221">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_222">
<id>48</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_223">
<id>50</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_224">
<id>51</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_225">
<id>58</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_226">
<id>59</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_227">
<id>60</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_228">
<id>62</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_229">
<id>5</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_230">
<id>64</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_231">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>23</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="_232">
<inState>3</inState>
<outState>4</outState>
<condition>
<id>32</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="_233">
<inState>4</inState>
<outState>2</outState>
<condition>
<id>33</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="_234">
<inState>2</inState>
<outState>5</outState>
<condition>
<id>31</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>13</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_235">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>34</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>13</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="36" tracking_level="1" version="0" object_id="_236">
<dp_component_resource class_id="37" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_resource>
<dp_expression_resource>
<count>0</count>
<item_version>0</item_version>
</dp_expression_resource>
<dp_fifo_resource>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_resource>
<dp_memory_resource>
<count>0</count>
<item_version>0</item_version>
</dp_memory_resource>
<dp_multiplexer_resource>
<count>0</count>
<item_version>0</item_version>
</dp_multiplexer_resource>
<dp_register_resource>
<count>0</count>
<item_version>0</item_version>
</dp_register_resource>
<dp_component_map class_id="38" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_map>
<dp_expression_map>
<count>0</count>
<item_version>0</item_version>
</dp_expression_map>
<dp_fifo_map>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_map>
<dp_memory_map>
<count>0</count>
<item_version>0</item_version>
</dp_memory_map>
</res>
<node_label_latency class_id="39" tracking_level="0" version="0">
<count>48</count>
<item_version>0</item_version>
<item class_id="40" tracking_level="0" version="0">
<first>8</first>
<second class_id="41" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>1</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>23</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>28</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>2</first>
<second>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>1</first>
<second>0</second>
</second>
</item>
<item>
<first>62</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="42" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="43" tracking_level="0" version="0">
<first>9</first>
<second class_id="44" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>63</first>
<second>
<first>1</first>
<second>3</second>
</second>
</item>
<item>
<first>65</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="45" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="46" tracking_level="1" version="0" object_id="_237">
<region_name>Row_Col</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>16</item>
<item>63</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>3</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="47" tracking_level="0" version="0">
<count>42</count>
<item_version>0</item_version>
<item class_id="48" tracking_level="0" version="0">
<first>60</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>67</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>39</item>
<item>39</item>
</second>
</item>
<item>
<first>72</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>79</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>43</item>
<item>43</item>
</second>
</item>
<item>
<first>84</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>91</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>100</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>111</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>122</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>129</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>135</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>141</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>147</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>155</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>161</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>169</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>174</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>179</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>185</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>189</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>197</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>201</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>207</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>217</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>227</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>237</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>241</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>251</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>255</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>258</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>261</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>268</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>272</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>278</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>282</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>288</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>292</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>297</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>300</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>303</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>51</item>
<item>58</item>
</second>
</item>
<item>
<first>311</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>56</item>
<item>57</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="50" tracking_level="0" version="0">
<count>39</count>
<item_version>0</item_version>
<item class_id="51" tracking_level="0" version="0">
<first>a_addr_gep_fu_60</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>b_addr_gep_fu_72</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>exitcond_flatten_fu_129</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>exitcond_fu_141</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>grp_fu_303</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>51</item>
<item>58</item>
</second>
</item>
<item>
<first>grp_fu_311</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>56</item>
<item>57</item>
</second>
</item>
<item>
<first>i_mid2_fu_161</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>i_phi_fu_111</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>i_s_fu_155</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_135</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>indvar_flatten_phi_fu_100</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>j_1_fu_179</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>j_mid2_fu_147</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>j_phi_fu_122</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>p_addr1_cast_fu_288</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>p_addr1_fu_282</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>p_addr_cast_fu_278</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>p_addr_fu_272</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>p_shl_cast_fu_268</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>res_addr_gep_fu_84</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>tmp_10_fu_227</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>tmp_11_fu_241</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>tmp_12_fu_193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>tmp_1_fu_261</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>tmp_2_fu_174</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>tmp_2_trn_cast_fu_258</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>tmp_4_fu_197</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>tmp_5_1_fu_297</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>tmp_5_2_fu_237</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>tmp_5_fu_292</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>tmp_6_1_fu_300</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>tmp_6_2_fu_251</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>tmp_6_fu_185</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>tmp_7_fu_201</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>tmp_8_fu_217</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>tmp_9_fu_207</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>tmp_fu_169</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>tmp_s_fu_189</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>tmp_trn_cast_fu_255</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</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>0</count>
<item_version>0</item_version>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="52" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="53" tracking_level="0" version="0">
<first class_id="54" tracking_level="0" version="0">
<first>a</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>39</item>
<item>39</item>
</second>
</item>
<item>
<first>
<first>b</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>43</item>
<item>43</item>
</second>
</item>
<item>
<first>
<first>res</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>13</count>
<item_version>0</item_version>
<item>
<first>96</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>107</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>118</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>319</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>323</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>328</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>333</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>340</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>345</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>350</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>355</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>360</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>365</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>13</count>
<item_version>0</item_version>
<item>
<first>a_addr_reg_340</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>b_addr_reg_345</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>exitcond_flatten_reg_319</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>i_mid2_reg_333</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>i_reg_107</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>indvar_flatten_next_reg_323</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_96</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>j_1_reg_350</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>j_mid2_reg_328</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>j_reg_118</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>tmp1_reg_365</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>tmp_8_reg_360</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>tmp_9_reg_355</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>3</count>
<item_version>0</item_version>
<item>
<first>96</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>107</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>118</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>3</count>
<item_version>0</item_version>
<item>
<first>i_reg_107</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_96</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>j_reg_118</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="55" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="56" tracking_level="0" version="0">
<first>a(p0)</first>
<second>
<count>1</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>
</second>
</item>
<item>
<first>b(p0)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>load</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>43</item>
<item>43</item>
</second>
</item>
</second>
</item>
<item>
<first>res(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>59</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="57" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="58" tracking_level="0" version="0">
<first>1</first>
<second>RAM</second>
</item>
<item>
<first>2</first>
<second>RAM</second>
</item>
<item>
<first>3</first>
<second>RAM</second>
</item>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
|
with
GL,
GL.Binding,
openGL.Tasks,
interfaces.C;
package body openGL.Renderer
is
use GL,
interfaces.C;
procedure Background_is (Self : in out Item; Now : in openGL.Color;
Opacity : in Opaqueness := 1.0)
is
begin
Self.Background.Primary := +Now;
Self.Background.Alpha := to_color_Value (Primary (Opacity));
end Background_is;
procedure Background_is (Self : in out Item; Now : in openGL.lucid_Color)
is
begin
Self.Background := +Now;
end Background_is;
procedure clear_Frame (Self : in Item)
is
use GL.Binding;
check_is_OK : constant Boolean := openGL.Tasks.Check with Unreferenced;
begin
glClearColor (GLfloat (to_Primary (Self.Background.Primary.Red)),
GLfloat (to_Primary (Self.Background.Primary.Green)),
GLfloat (to_Primary (Self.Background.Primary.Blue)),
GLfloat (to_Primary (Self.Background.Alpha)));
glClear ( GL_COLOR_BUFFER_BIT
or GL_DEPTH_BUFFER_BIT);
glCullFace (GL_BACK);
glEnable (GL_CULL_FACE);
end clear_Frame;
end openGL.Renderer;
|
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
package body Program.Nodes.Formal_Derived_Type_Definitions is
function Create
(Abstract_Token : Program.Lexical_Elements.Lexical_Element_Access;
Limited_Token : Program.Lexical_Elements.Lexical_Element_Access;
Synchronized_Token : Program.Lexical_Elements.Lexical_Element_Access;
New_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Subtype_Mark : not null Program.Elements.Expressions
.Expression_Access;
And_Token : Program.Lexical_Elements.Lexical_Element_Access;
Progenitors : Program.Elements.Expressions
.Expression_Vector_Access;
With_Token : Program.Lexical_Elements.Lexical_Element_Access;
Private_Token : Program.Lexical_Elements.Lexical_Element_Access)
return Formal_Derived_Type_Definition is
begin
return Result : Formal_Derived_Type_Definition :=
(Abstract_Token => Abstract_Token, Limited_Token => Limited_Token,
Synchronized_Token => Synchronized_Token, New_Token => New_Token,
Subtype_Mark => Subtype_Mark, And_Token => And_Token,
Progenitors => Progenitors, With_Token => With_Token,
Private_Token => Private_Token, Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
function Create
(Subtype_Mark : not null Program.Elements.Expressions
.Expression_Access;
Progenitors : Program.Elements.Expressions
.Expression_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False;
Has_Abstract : Boolean := False;
Has_Limited : Boolean := False;
Has_Synchronized : Boolean := False;
Has_With_Private : Boolean := False)
return Implicit_Formal_Derived_Type_Definition is
begin
return Result : Implicit_Formal_Derived_Type_Definition :=
(Subtype_Mark => Subtype_Mark, Progenitors => Progenitors,
Is_Part_Of_Implicit => Is_Part_Of_Implicit,
Is_Part_Of_Inherited => Is_Part_Of_Inherited,
Is_Part_Of_Instance => Is_Part_Of_Instance,
Has_Abstract => Has_Abstract, Has_Limited => Has_Limited,
Has_Synchronized => Has_Synchronized,
Has_With_Private => Has_With_Private, Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
overriding function Subtype_Mark
(Self : Base_Formal_Derived_Type_Definition)
return not null Program.Elements.Expressions.Expression_Access is
begin
return Self.Subtype_Mark;
end Subtype_Mark;
overriding function Progenitors
(Self : Base_Formal_Derived_Type_Definition)
return Program.Elements.Expressions.Expression_Vector_Access is
begin
return Self.Progenitors;
end Progenitors;
overriding function Abstract_Token
(Self : Formal_Derived_Type_Definition)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Abstract_Token;
end Abstract_Token;
overriding function Limited_Token
(Self : Formal_Derived_Type_Definition)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Limited_Token;
end Limited_Token;
overriding function Synchronized_Token
(Self : Formal_Derived_Type_Definition)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Synchronized_Token;
end Synchronized_Token;
overriding function New_Token
(Self : Formal_Derived_Type_Definition)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.New_Token;
end New_Token;
overriding function And_Token
(Self : Formal_Derived_Type_Definition)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.And_Token;
end And_Token;
overriding function With_Token
(Self : Formal_Derived_Type_Definition)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.With_Token;
end With_Token;
overriding function Private_Token
(Self : Formal_Derived_Type_Definition)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Private_Token;
end Private_Token;
overriding function Has_Abstract
(Self : Formal_Derived_Type_Definition)
return Boolean is
begin
return Self.Abstract_Token.Assigned;
end Has_Abstract;
overriding function Has_Limited
(Self : Formal_Derived_Type_Definition)
return Boolean is
begin
return Self.Limited_Token.Assigned;
end Has_Limited;
overriding function Has_Synchronized
(Self : Formal_Derived_Type_Definition)
return Boolean is
begin
return Self.Synchronized_Token.Assigned;
end Has_Synchronized;
overriding function Has_With_Private
(Self : Formal_Derived_Type_Definition)
return Boolean is
begin
return Self.With_Token.Assigned;
end Has_With_Private;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Formal_Derived_Type_Definition)
return Boolean is
begin
return Self.Is_Part_Of_Implicit;
end Is_Part_Of_Implicit;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Formal_Derived_Type_Definition)
return Boolean is
begin
return Self.Is_Part_Of_Inherited;
end Is_Part_Of_Inherited;
overriding function Is_Part_Of_Instance
(Self : Implicit_Formal_Derived_Type_Definition)
return Boolean is
begin
return Self.Is_Part_Of_Instance;
end Is_Part_Of_Instance;
overriding function Has_Abstract
(Self : Implicit_Formal_Derived_Type_Definition)
return Boolean is
begin
return Self.Has_Abstract;
end Has_Abstract;
overriding function Has_Limited
(Self : Implicit_Formal_Derived_Type_Definition)
return Boolean is
begin
return Self.Has_Limited;
end Has_Limited;
overriding function Has_Synchronized
(Self : Implicit_Formal_Derived_Type_Definition)
return Boolean is
begin
return Self.Has_Synchronized;
end Has_Synchronized;
overriding function Has_With_Private
(Self : Implicit_Formal_Derived_Type_Definition)
return Boolean is
begin
return Self.Has_With_Private;
end Has_With_Private;
procedure Initialize
(Self : aliased in out Base_Formal_Derived_Type_Definition'Class) is
begin
Set_Enclosing_Element (Self.Subtype_Mark, Self'Unchecked_Access);
for Item in Self.Progenitors.Each_Element loop
Set_Enclosing_Element (Item.Element, Self'Unchecked_Access);
end loop;
null;
end Initialize;
overriding function Is_Formal_Derived_Type_Definition_Element
(Self : Base_Formal_Derived_Type_Definition)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Formal_Derived_Type_Definition_Element;
overriding function Is_Formal_Type_Definition_Element
(Self : Base_Formal_Derived_Type_Definition)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Formal_Type_Definition_Element;
overriding function Is_Definition_Element
(Self : Base_Formal_Derived_Type_Definition)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Definition_Element;
overriding procedure Visit
(Self : not null access Base_Formal_Derived_Type_Definition;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class) is
begin
Visitor.Formal_Derived_Type_Definition (Self);
end Visit;
overriding function To_Formal_Derived_Type_Definition_Text
(Self : aliased in out Formal_Derived_Type_Definition)
return Program.Elements.Formal_Derived_Type_Definitions
.Formal_Derived_Type_Definition_Text_Access is
begin
return Self'Unchecked_Access;
end To_Formal_Derived_Type_Definition_Text;
overriding function To_Formal_Derived_Type_Definition_Text
(Self : aliased in out Implicit_Formal_Derived_Type_Definition)
return Program.Elements.Formal_Derived_Type_Definitions
.Formal_Derived_Type_Definition_Text_Access is
pragma Unreferenced (Self);
begin
return null;
end To_Formal_Derived_Type_Definition_Text;
end Program.Nodes.Formal_Derived_Type_Definitions;
|
-- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2021 onox <denkpadje@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.UTF_Encoding.Wide_Wide_Strings;
package body Emojis is
package UTF renames Ada.Strings.UTF_Encoding;
function Unicode (Number : Long_Integer) return UTF.UTF_8_String is
(UTF.Wide_Wide_Strings.Encode ("" & Wide_Wide_Character'Val (Number)));
function Unicode (Number_1, Number_2 : Long_Integer) return UTF.UTF_8_String is
(UTF.Wide_Wide_Strings.Encode
(Wide_Wide_Character'Val (Number_1) &
Wide_Wide_Character'Val (Number_2)));
function Unicode (Number_1, Number_2, Number_3 : Long_Integer) return UTF.UTF_8_String is
(UTF.Wide_Wide_Strings.Encode
(Wide_Wide_Character'Val (Number_1) &
Wide_Wide_Character'Val (Number_2) &
Wide_Wide_Character'Val (Number_3)));
use type SU.Unbounded_String;
function Labels return String_List is
Result : String_List
(1 .. Name_Emojis_1'Length + Name_Emojis_2'Length + Name_Emojis_3'Length);
Index : Positive := Result'First;
begin
for Pair of Name_Emojis_1 loop
Result (Index) := Pair.Text;
Index := Index + 1;
end loop;
for Pair of Name_Emojis_2 loop
Result (Index) := Pair.Text;
Index := Index + 1;
end loop;
for Pair of Name_Emojis_3 loop
Result (Index) := Pair.Text;
Index := Index + 1;
end loop;
return Result;
end Labels;
function Value (Label : String) return String is
begin
for Pair of Name_Emojis_3 loop
if Pair.Text = Label then
return Unicode (Pair.Point_1, Pair.Point_2, Pair.Point_3);
end if;
end loop;
for Pair of Name_Emojis_2 loop
if Pair.Text = Label then
return Unicode (Pair.Point_1, Pair.Point_2) & " ";
end if;
end loop;
for Pair of Name_Emojis_1 loop
if Pair.Text = Label then
return Unicode (Pair.Point_1);
end if;
end loop;
return "";
end Value;
procedure Replace_Labels (Text : in out SU.Unbounded_String) is
Text_List : constant String_List := Strings.Split (+Text, Separator => ":");
Result : SU.Unbounded_String;
begin
for Index in Text_List'Range loop
if Index mod 2 = 0 then
declare
Slice : constant String := +Text_List (Index);
Emoji : constant String := (if Index < Text_List'Last then Value (Slice) else "");
begin
if Emoji /= "" then
SU.Append (Result, Emoji);
else
if Index = Text_List'Last then
SU.Append (Result, ":" & Slice);
else
SU.Append (Result, ":" & Slice & ":");
end if;
end if;
end;
else
SU.Append (Result, Text_List (Index));
end if;
end loop;
Text := Result;
end Replace_Labels;
function Replace
(Text : String;
Mappings : Label_Mappings := Text_Emojis;
Completions : Completion_Mappings := (1 .. 0 => <>)) return String
is
Slices : String_List := Strings.Split (Text, Separator => " ");
Is_Space : constant Boolean := Slices (Slices'Last) = "";
begin
for Index in Slices'Range loop
declare
Is_Completion : constant Boolean := Index = Slices'Last - 1 and Is_Space;
begin
for Pair of Mappings loop
if not (for some C of Completions => C = Pair.Text)
or (Index < Slices'Last and not Is_Completion)
then
if Slices (Index) = Pair.Text then
Slices (Index) := ":" & Pair.Label & ":";
end if;
end if;
end loop;
if Completions'Length = 0 or not Is_Completion then
Replace_Labels (Slices (Index));
end if;
end;
end loop;
return Strings.Join (Slices, " ");
end Replace;
end Emojis;
|
-- 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 = "ThreatCrowd"
type = "api"
function start()
setratelimit(10)
end
function vertical(ctx, domain)
local c
local cfg = datasrc_config()
if cfg ~= nil then
c = cfg.credentials
end
local resp
-- Check if the response data is in the graph database
if (cfg ~= nil and cfg.ttl ~= nil and cfg.ttl > 0) then
resp = obtain_response(domain, cfg.ttl)
end
if (resp == nil or resp == "") then
local err
local hdrs = {['Content-Type']="application/json"}
resp, err = request({
url=buildurl(domain),
headers=hdrs,
})
if (err ~= nil and err ~= "") then
return
end
if (cfg ~= nil and cfg.ttl ~= nil and cfg.ttl > 0) then
cache_response(domain, resp)
end
end
local d = json.decode(resp)
if (d == nil or d.response_code ~= "1" or #(d.subdomains) == 0) then
return
end
for i, sub in pairs(d.subdomains) do
sendnames(ctx, sub)
end
for i, tb in pairs(d.resolutions) do
newaddr(ctx, tb.ip_address, domain)
end
end
function buildurl(domain)
return "https://www.threatcrowd.org/searchApi/v2/domain/report/?domain=" .. domain
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
|
-- part of OpenGLAda, (c) 2017 Felix Krause
-- released under the terms of the MIT license, see the file "COPYING"
with GL.Low_Level.Enums;
package GL.Objects.Queries is
pragma Preelaborate;
type Query_Object is new GL_Object with private;
Default_Query : constant Query_Object;
procedure Begin_Query (Target : GL.Low_Level.Enums.Query_Param;
Object : Query_Object);
procedure End_Query (Target : GL.Low_Level.Enums.Query_Param);
procedure Begin_Query_Indexed (Target : GL.Low_Level.Enums.Query_Param;
Index : UInt; Object : Query_Object);
procedure End_Query_Indexed (Target : GL.Low_Level.Enums.Query_Param;
Index : UInt);
procedure Get_Query_Object (Object : Query_Object;
Pname : GL.Low_Level.Enums.Query_Results;
Params : out UInt);
function Is_Query (Query : Query_Object) return Boolean;
procedure Query_Counter (Object : Query_Object;
Target : Low_Level.Enums.Query_Param);
private
type Query_Object is new GL_Object with null record;
overriding
procedure Internal_Create_Id (Object : Query_Object; Id : out UInt);
overriding
procedure Internal_Release_Id (Object : Query_Object; Id : UInt);
Default_Query : constant Query_Object := Query_Object'(
Ada.Finalization.Controlled with
Reference => Reference_To_Null_Object'Access);
end GL.Objects.Queries;
|
with Ada.Text_IO;
use Ada.Text_IO;
procedure cal is
type daynum is range 1 .. 31;
type monthnum is range 1 .. 12;
type monthname is (Jan, Feb, Mar, Apr, May, Jun, Jul, Aug, Sep, Oct, Nov, Dec);
type weekday is (Mon, Tue, Wed, Thu, Fri, Sat, Sun);
--variables
today_weekday : weekday;
today_monthnum : monthnum;
today_daynum : daynum;
begin
-- GET DAY
Put ("What weekday is today (");
for w in weekday'Range loop
Put(weekday'Image(w)); Put("/");
end loop;
Put (")? ");
today_weekday := weekday'value(ada.Text_IO.Get_Line);
-- GET MONTH
Put("What month is today (");
for w in monthnum'Range loop
Put(monthnum'Image(w)); Put("/");
end loop;
Put (")? ");
today_monthnum := monthnum'value(ada.Text_IO.get_line);
-- GET DAY OF MONTH
Put("What day of the month is today (");
for w in daynum'Range loop
Put(daynum'Image(w)); Put("/");
end loop;
Put (")? ");
today_daynum := daynum'value(ada.Text_IO.get_line);
Put_Line("----------------------");
Put_Line(" => Today is " & weekday'Image(today_weekday) & ", " & monthname'Image(monthname'val(today_monthnum - 1)) & " " & daynum'Image(today_daynum));
Put_Line("----------------------"); new_line;
-- check that the day is legal for the given month
-- print cal
Put_Line("Calendar for the next 30 days:");
for d in Integer range 1 .. 31 loop
-- print
Put(weekday'Image(today_weekday) & ", " & monthname'Image(monthname'Val(today_monthnum-1)) & " " & daynum'Image(today_daynum)); new_line;
-- next day
if (today_weekday /= weekday'Last) then -- ada enums do not wrap around
today_weekday := weekday'succ(today_weekday);
else
Put_Line("----------------------"); -- separate weeks
today_weekday := Mon;
end if;
if (today_daynum = daynum'Last) then -- new month starts
if (today_monthnum = monthnum'last) then
today_monthnum := monthnum'first;
else
today_monthnum := monthnum'Succ(today_monthnum);
end if;
today_daynum := daynum'First;
else
today_daynum := daynum'succ(today_daynum);
end if;
end loop;
end cal;
|
------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding --
-- --
-- Terminal_Interface.Curses.Forms.Field_Types.IntField --
-- --
-- B O D Y --
-- --
------------------------------------------------------------------------------
-- Copyright (c) 1998 Free Software Foundation, Inc. --
-- --
-- Permission is hereby granted, free of charge, to any person obtaining a --
-- copy of this software and associated documentation files (the --
-- "Software"), to deal in the Software without restriction, including --
-- without limitation the rights to use, copy, modify, merge, publish, --
-- distribute, distribute with modifications, sublicense, and/or sell --
-- copies of the Software, and to permit persons to whom the Software is --
-- furnished to do so, subject to the following conditions: --
-- --
-- The above copyright notice and this permission notice shall be included --
-- in all copies or substantial portions of the Software. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS --
-- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF --
-- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. --
-- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, --
-- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR --
-- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR --
-- THE USE OR OTHER DEALINGS IN THE SOFTWARE. --
-- --
-- Except as contained in this notice, the name(s) of the above copyright --
-- holders shall not be used in advertising or otherwise to promote the --
-- sale, use or other dealings in this Software without prior written --
-- authorization. --
------------------------------------------------------------------------------
-- Author: Juergen Pfeifer <Juergen.Pfeifer@T-Online.de> 1996
-- Version Control:
-- $Revision: 1.3 $
-- Binding Version 00.93
------------------------------------------------------------------------------
with Interfaces.C;
with Terminal_Interface.Curses.Aux; use Terminal_Interface.Curses.Aux;
package body Terminal_Interface.Curses.Forms.Field_Types.IntField is
use type Interfaces.C.Int;
procedure Set_Field_Type (Fld : in Field;
Typ : in Integer_Field)
is
C_Integer_Field_Type : C_Field_Type;
pragma Import (C, C_Integer_Field_Type, "TYPE_INTEGER");
function Set_Fld_Type (F : Field := Fld;
Cft : C_Field_Type := C_Integer_Field_Type;
Arg1 : C_Int;
Arg2 : C_Long_Int;
Arg3 : C_Long_Int) return C_Int;
pragma Import (C, Set_Fld_Type, "set_field_type");
Res : Eti_Error;
begin
Res := Set_Fld_Type (Arg1 => C_Int (Typ.Precision),
Arg2 => C_Long_Int (Typ.Lower_Limit),
Arg3 => C_Long_Int (Typ.Upper_Limit));
if Res /= E_Ok then
Eti_Exception (Res);
end if;
Wrap_Builtin (Fld, Typ);
end Set_Field_Type;
end Terminal_Interface.Curses.Forms.Field_Types.IntField;
|
-- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2019 onox <denkpadje@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 SDL.Events.Events;
with SDL.Events.Keyboards;
with SDL.Events.Mice;
with SDL.Events.Windows;
with SDL.Video.Windows.Makers;
with Orka.Inputs.SDL;
with Orka.Logging;
with GL.Context;
with GL.Viewports;
package body Orka.Windows.SDL is
use all type Orka.Logging.Source;
use all type Orka.Logging.Severity;
use Orka.Logging;
package Messages is new Orka.Logging.Messages (Window_System);
overriding
procedure Finalize (Object : in out SDL_Context) is
begin
if Object.Flags.Debug then
Messages.Log (Debug, "Shutting down SDL");
end if;
Standard.SDL.Finalise;
end Finalize;
overriding
procedure Enable (Object : in out SDL_Context; Subject : Contexts.Feature) is
begin
Contexts.Enable (Object.Features, Subject);
end Enable;
overriding
function Enabled (Object : SDL_Context; Subject : Contexts.Feature) return Boolean
is (Contexts.Enabled (Object.Features, Subject));
overriding
function Is_Current (Object : SDL_Context; Kind : Orka.Contexts.Task_Kind) return Boolean is
begin
raise GL.Feature_Not_Supported_Exception;
return True;
end Is_Current;
overriding
procedure Make_Current (Object : SDL_Context) is
begin
raise GL.Feature_Not_Supported_Exception;
end Make_Current;
overriding
procedure Make_Current
(Object : SDL_Context;
Window : in out Orka.Windows.Window'Class)
is
package GL renames Standard.SDL.Video.GL;
package Windows renames Standard.SDL.Video.Windows;
begin
GL.Set_Current (SDL_Window (Window).Context, Windows.Window (Window));
end Make_Current;
overriding
procedure Make_Not_Current (Object : SDL_Context) is
begin
raise GL.Feature_Not_Supported_Exception;
-- TODO Make sure Object is current on calling task
end Make_Not_Current;
overriding
function Version (Object : SDL_Context) return Contexts.Context_Version is
begin
return
(Major => GL.Context.Major_Version,
Minor => GL.Context.Minor_Version);
end Version;
overriding
function Flags (Object : SDL_Context) return Contexts.Context_Flags is
Flags : constant GL.Context.Context_Flags := GL.Context.Flags;
Result : Contexts.Context_Flags;
begin
pragma Assert (Flags.Forward_Compatible);
Result.Debug := Flags.Debug;
Result.Robust := Flags.Robust_Access;
Result.No_Error := Flags.No_Error;
return Result;
end Flags;
overriding
function Create_Context
(Version : Contexts.Context_Version;
Flags : Contexts.Context_Flags := (others => False)) return SDL_Context
is
package GL renames Standard.SDL.Video.GL;
use type GL.Flags;
Context_Flags : GL.Flags := GL.Context_Forward_Compatible;
begin
if Flags.Debug then
Context_Flags := Context_Flags or GL.Context_Debug;
end if;
if Flags.Robust then
Context_Flags := Context_Flags or GL.Context_Robust_Access;
end if;
-- Initialize SDL
if not Standard.SDL.Initialise then
raise Program_Error with "Initializing SDL failed";
end if;
pragma Assert (Standard.SDL.Was_Initialised (Standard.SDL.Enable_Screen));
Standard.SDL.Video.Disable_Screen_Saver;
Messages.Log (Debug, "SDL driver: " & Standard.SDL.Video.Current_Driver_Name);
-- Initialize OpenGL context
GL.Set_Context_Major_Version (GL.Major_Versions (Version.Major));
GL.Set_Context_Minor_Version (GL.Minor_Versions (Version.Minor));
GL.Set_Context_Profile (GL.Core);
GL.Set_Context_Flags (Context_Flags);
return (Ada.Finalization.Limited_Controlled with
Version => Version,
Flags => Flags,
Features => <>);
end Create_Context;
overriding
procedure Finalize (Object : in out SDL_Window) is
begin
if not Object.Finalized then
Messages.Log (Debug, "Closing SDL window");
Object.Window.Finalize;
Object.Finalized := True;
end if;
end Finalize;
overriding
function Create_Window
(Context : Contexts.Surface_Context'Class;
Width, Height : Positive;
Title : String := "";
Samples : Natural := 0;
Visible, Resizable : Boolean := True;
Transparent : Boolean := False) return SDL_Window
is
package SDL_GL renames Standard.SDL.Video.GL;
package SDL_Windows renames Standard.SDL.Video.Windows;
use type SDL_Windows.Window_Flags;
begin
return Result : aliased SDL_Window := SDL_Window'(Ada.Finalization.Limited_Controlled
with Input => Inputs.SDL.Create_Pointer_Input, Finalized => False, others => <>)
do
declare
Reference : SDL_Windows.Window renames Result.Window;
Position : constant Standard.SDL.Natural_Coordinates
:= (X => SDL_Windows.Centered_Window_Position (0),
Y => SDL_Windows.Centered_Window_Position (1));
Extents : constant Standard.SDL.Positive_Sizes
:= (Standard.SDL.Positive_Dimension (Width),
Standard.SDL.Positive_Dimension (Height));
Flags : SDL_Windows.Window_Flags := SDL_Windows.OpenGL;
begin
if Resizable then
Flags := Flags or SDL_Windows.Resizable;
end if;
if Visible then
Flags := Flags or SDL_Windows.Shown;
end if;
SDL_GL.Set_Multisampling (Samples > 0);
SDL_GL.Set_Multisampling_Samples (SDL_GL.Multisample_Samples (Samples));
-- Create window and make GL context current
SDL_Windows.Makers.Create (Reference, Title, Position, Extents, Flags);
SDL_GL.Create (Result.Context, Reference);
pragma Assert (SDL_Windows.Exist);
Inputs.SDL.SDL_Pointer_Input (Result.Input.all).Set_Window (Reference);
declare
Extents : constant Standard.SDL.Sizes := Reference.Get_Size;
begin
Result.Width := Positive (Extents.Width);
Result.Height := Positive (Extents.Height);
Messages.Log (Debug, "Created SDL window and GL context");
Messages.Log (Debug, " size: " &
Trim (Result.Width'Image) & " × " & Trim (Result.Height'Image));
Messages.Log (Debug, " visible: " & (if Visible then "yes" else "no"));
Messages.Log (Debug, " resizable: " & (if Resizable then "yes" else "no"));
end;
SDL_GL.Set_Current (Result.Context, Reference);
Messages.Log (Debug, " context:");
Messages.Log (Debug, " flags: " & Orka.Contexts.Image (Context.Flags));
Messages.Log (Debug, " version: " & GL.Context.Version_String);
Messages.Log (Debug, " renderer: " & GL.Context.Renderer);
GL.Viewports.Set_Clipping (GL.Viewports.Lower_Left, GL.Viewports.Zero_To_One);
Result.Vertex_Array.Create;
end;
end return;
end Create_Window;
overriding
function Pointer_Input
(Object : SDL_Window) return Inputs.Pointers.Pointer_Input_Ptr
is (Object.Input);
overriding
function Width (Object : SDL_Window) return Positive is
(Object.Width);
overriding
function Height (Object : SDL_Window) return Positive is
(Object.Height);
overriding
procedure Set_Title (Object : in out SDL_Window; Value : String) is
begin
Object.Window.Set_Title (Value);
end Set_Title;
overriding
procedure Close (Object : in out SDL_Window) is
begin
Object.Close_Window := True;
end Close;
overriding
function Should_Close (Object : SDL_Window) return Boolean is
begin
return Object.Close_Window;
end Should_Close;
overriding
procedure Process_Input (Object : in out SDL_Window) is
package Events renames Standard.SDL.Events;
Event : Events.Events.Events;
Quit : Boolean := False;
use type Events.Event_Types;
use type Events.Keyboards.Key_Codes;
use type GL.Types.Double;
begin
Object.Scroll_X := 0.0;
Object.Scroll_Y := 0.0;
while Events.Events.Poll (Event) loop
case Event.Common.Event_Type is
when Events.Quit =>
Object.Close;
Quit := True;
when Events.Keyboards.Key_Down =>
-- TODO Add Button_Input object
if Event.Keyboard.Key_Sym.Key_Code = Events.Keyboards.Code_Escape then
Object.Close;
Quit := True;
end if;
when Events.Keyboards.Key_Up =>
null;
when Events.Mice.Motion =>
Object.Position_X := GL.Types.Double (Event.Mouse_Motion.X);
Object.Position_Y := GL.Types.Double (Event.Mouse_Motion.Y);
when Events.Mice.Wheel =>
-- Accumulate the offset in case multiple events are processed
Object.Scroll_X := Object.Scroll_X + GL.Types.Double (Event.Mouse_Wheel.X);
Object.Scroll_Y := Object.Scroll_Y + GL.Types.Double (Event.Mouse_Wheel.Y);
when Events.Mice.Button_Down =>
Inputs.SDL.SDL_Pointer_Input (Object.Input.all).Set_Button_State
(Event.Mouse_Button.Button, Inputs.Pointers.Pressed);
when Events.Mice.Button_Up =>
Inputs.SDL.SDL_Pointer_Input (Object.Input.all).Set_Button_State
(Event.Mouse_Button.Button, Inputs.Pointers.Released);
when Events.Windows.Window =>
case Event.Window.Event_ID is
when Events.Windows.Resized | Events.Windows.Size_Changed =>
Object.Width := Integer (Event.Window.Data_1);
Object.Height := Integer (Event.Window.Data_2);
when Events.Windows.Close =>
Object.Close;
Quit := True;
when others =>
-- Ignore other window events
null;
end case;
when others =>
-- Ignore other events
null;
end case;
exit when Quit;
end loop;
-- Update position of mouse
Inputs.SDL.SDL_Pointer_Input (Object.Input.all).Set_Position
(Object.Position_X, Object.Position_Y);
-- Update scroll offset of mouse
Inputs.SDL.SDL_Pointer_Input (Object.Input.all).Set_Scroll_Offset
(Object.Scroll_X, Object.Scroll_Y);
end Process_Input;
overriding
procedure Swap_Buffers (Object : in out SDL_Window) is
begin
Standard.SDL.Video.GL.Swap (Object.Window);
end Swap_Buffers;
overriding
procedure Set_Vertical_Sync (Object : in out SDL_Window; Enable : Boolean) is
use all type Standard.SDL.Video.GL.Swap_Intervals;
begin
if not Standard.SDL.Video.GL.Set_Swap_Interval
((if Enable then Synchronised else Not_Synchronised), Late_Swap_Tear => True)
then
Messages.Log (Debug,
(if Enable then "Enabling" else "Disabling") & " vertical sync failed");
end if;
end Set_Vertical_Sync;
end Orka.Windows.SDL;
|
-----------------------------------------------------------------------
-- facebook - Use Facebook Graph API
-- Copyright (C) 2012, 2013, 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 Util.Log.Loggers;
with Util.Serialize.Mappers.Record_Mapper;
with ASF.Sessions;
with ASF.Contexts.Faces;
with ASF.Events.Faces.Actions;
package body Facebook is
Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("Facebook");
type Friend_Field_Type is (FIELD_NAME, FIELD_ID);
type Feed_Field_Type is (FIELD_ID, FIELD_NAME, FIELD_FROM, FIELD_MESSAGE,
FIELD_PICTURE, FIELD_LINK, FIELD_DESCRIPTION, FIELD_ICON);
procedure Set_Member (Into : in out Friend_Info;
Field : in Friend_Field_Type;
Value : in Util.Beans.Objects.Object);
procedure Set_Member (Into : in out Feed_Info;
Field : in Feed_Field_Type;
Value : in Util.Beans.Objects.Object);
procedure Set_Member (Into : in out Friend_Info;
Field : in Friend_Field_Type;
Value : in Util.Beans.Objects.Object) is
begin
case Field is
when FIELD_ID =>
Into.Id := Value;
when FIELD_NAME =>
Into.Name := Value;
end case;
end Set_Member;
procedure Set_Member (Into : in out Feed_Info;
Field : in Feed_Field_Type;
Value : in Util.Beans.Objects.Object) is
begin
Log.Info ("Set field {0} to {1}", Feed_Field_Type'Image (Field),
Util.Beans.Objects.To_String (Value));
case Field is
when FIELD_ID =>
Into.Id := Value;
when FIELD_NAME =>
Into.Name := Value;
when FIELD_FROM =>
Into.From := Value;
when FIELD_MESSAGE =>
Into.Message := Value;
when FIELD_LINK =>
Into.Link := Value;
when FIELD_PICTURE =>
Into.Picture := Value;
when FIELD_ICON =>
Into.Icon := Value;
when FIELD_DESCRIPTION =>
Into.Description := Value;
end case;
end Set_Member;
package Friend_Mapper is
new Util.Serialize.Mappers.Record_Mapper (Element_Type => Friend_Info,
Element_Type_Access => Friend_Info_Access,
Fields => Friend_Field_Type,
Set_Member => Set_Member);
package Feed_Mapper is
new Util.Serialize.Mappers.Record_Mapper (Element_Type => Feed_Info,
Element_Type_Access => Feed_Info_Access,
Fields => Feed_Field_Type,
Set_Member => Set_Member);
Friend_Map : aliased Friend_Mapper.Mapper;
Feed_Map : aliased Feed_Mapper.Mapper;
-- ------------------------------
-- Get the access token from the user session.
-- ------------------------------
function Get_Access_Token return String is
use type ASF.Contexts.Faces.Faces_Context_Access;
Context : constant ASF.Contexts.Faces.Faces_Context_Access := ASF.Contexts.Faces.Current;
begin
if Context = null then
return "";
end if;
declare
S : constant ASF.Sessions.Session := Context.Get_Session;
begin
if not S.Is_Valid then
return "";
end if;
declare
Token : constant Util.Beans.Objects.Object := S.Get_Attribute ("access_token");
begin
if Util.Beans.Objects.Is_Null (Token) then
return "";
else
return Util.Beans.Objects.To_String (Token);
end if;
end;
end;
end Get_Access_Token;
-- ------------------------------
-- Get the value identified by the name.
-- If the name cannot be found, the method should return the Null object.
-- ------------------------------
overriding
function Get_Value (From : in Friend_Info;
Name : in String) return Util.Beans.Objects.Object is
begin
if Name = "name" then
return From.Name;
elsif Name = "id" then
return From.Id;
else
return Util.Beans.Objects.Null_Object;
end if;
end Get_Value;
-- ------------------------------
-- Get the value identified by the name.
-- If the name cannot be found, the method should return the Null object.
-- ------------------------------
overriding
function Get_Value (From : in Feed_Info;
Name : in String) return Util.Beans.Objects.Object is
begin
if Name = "id" then
return From.Id;
elsif Name = "name" then
return From.Name;
elsif Name = "from" then
return From.From;
elsif Name = "message" then
return From.Message;
elsif Name = "picture" then
return From.Picture;
elsif Name = "link" then
return From.Link;
elsif Name = "description" then
return From.Description;
elsif Name = "icon" then
return From.Icon;
else
return Util.Beans.Objects.Null_Object;
end if;
end Get_Value;
-- ------------------------------
-- Get the value identified by the name.
-- If the name cannot be found, the method should return the Null object.
-- ------------------------------
overriding
function Get_Value (From : in Friend_List_Bean;
Name : in String) return Util.Beans.Objects.Object is
begin
if Name = "hasAccessToken" then
return Util.Beans.Objects.To_Object (False);
end if;
return Friend_List.List_Bean (From).Get_Value (Name);
end Get_Value;
-- ------------------------------
-- Create a Friend_List bean instance.
-- ------------------------------
function Create_Friends_Bean return Util.Beans.Basic.Readonly_Bean_Access is
List : constant Friend_List_Bean_Access := new Friend_List_Bean;
begin
return List.all'Access;
end Create_Friends_Bean;
-- ------------------------------
-- Build and return a Facebook feed list.
-- ------------------------------
function Create_Feed_List_Bean return Util.Beans.Basic.Readonly_Bean_Access is
List : constant Feed_List.List_Bean_Access := new Feed_List.List_Bean;
begin
return List.all'Access;
end Create_Feed_List_Bean;
-- ------------------------------
-- Get the user information identified by the given name.
-- ------------------------------
overriding
function Get_Value (From : in Facebook_Auth;
Name : in String) return Util.Beans.Objects.Object is
use type ASF.Contexts.Faces.Faces_Context_Access;
F : constant ASF.Contexts.Faces.Faces_Context_Access := ASF.Contexts.Faces.Current;
begin
if F /= null and Name = "authenticate_url" then
declare
S : constant ASF.Sessions.Session := F.Get_Session (True);
Id : constant String := S.Get_Id;
State : constant String := From.Get_State (Id);
Params : constant String := From.Get_Auth_Params (State, "user_posts");
begin
Log.Info ("OAuth params: {0}", Params);
return Util.Beans.Objects.To_Object ("https://www.facebook.com/dialog/oauth?"
& Params);
end;
elsif F /= null and Name = "isAuthenticated" then
declare
S : constant ASF.Sessions.Session := F.Get_Session (False);
begin
if S.Is_Valid and
then not Util.Beans.Objects.Is_Null (S.Get_Attribute ("access_token")) then
return Util.Beans.Objects.To_Object (True);
else
return Util.Beans.Objects.To_Object (False);
end if;
end;
end if;
return Util.Beans.Objects.Null_Object;
end Get_Value;
-- ------------------------------
-- Authenticate result from Facebook.
-- ------------------------------
procedure Authenticate (From : in out Facebook_Auth;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is
pragma Unreferenced (Outcome);
use type Security.OAuth.Clients.Access_Token_Access;
F : constant ASF.Contexts.Faces.Faces_Context_Access := ASF.Contexts.Faces.Current;
Session : ASF.Sessions.Session := F.Get_Session;
State : constant String := F.Get_Parameter (Security.OAuth.State);
Code : constant String := F.Get_Parameter (Security.OAuth.Code);
begin
Log.Info ("Auth code {0} for state {1}", Code, State);
if Session.Is_Valid then
if From.Is_Valid_State (Session.Get_Id, State) then
declare
Acc : constant Security.OAuth.Clients.Access_Token_Access
:= From.Request_Access_Token (Code);
begin
if Acc /= null then
Log.Info ("Access token is {0}", Acc.Get_Name);
Session.Set_Attribute ("access_token",
Util.Beans.Objects.To_Object (Acc.Get_Name));
end if;
end;
end if;
end if;
end Authenticate;
package Authenticate_Binding is
new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Facebook_Auth,
Method => Authenticate,
Name => "authenticate");
Binding_Array : aliased constant Util.Beans.Methods.Method_Binding_Array
:= (1 => Authenticate_Binding.Proxy'Unchecked_Access);
-- ------------------------------
-- This bean provides some methods that can be used in a Method_Expression
-- ------------------------------
overriding
function Get_Method_Bindings (From : in Facebook_Auth)
return Util.Beans.Methods.Method_Binding_Array_Access is
pragma Unreferenced (From);
begin
return Binding_Array'Access;
end Get_Method_Bindings;
begin
Friend_Map.Add_Default_Mapping;
Feed_Map.Add_Mapping ("id", FIELD_ID);
Feed_Map.Add_Mapping ("name", FIELD_NAME);
Feed_Map.Add_Mapping ("message", FIELD_MESSAGE);
Feed_Map.Add_Mapping ("description", FIELD_DESCRIPTION);
Feed_Map.Add_Mapping ("from/name", FIELD_FROM);
Feed_Map.Add_Mapping ("picture", FIELD_PICTURE);
Feed_Map.Add_Mapping ("link", FIELD_LINK);
Feed_Map.Add_Mapping ("icon", FIELD_ICON);
end Facebook;
|
package Test.Cache is
procedure Run_Tests;
end Test.Cache;
|
-- This spec has been automatically generated from STM32L4x3.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.COMP is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype COMP1_CSR_COMP1_PWRMODE_Field is HAL.UInt2;
subtype COMP1_CSR_COMP1_INMSEL_Field is HAL.UInt3;
subtype COMP1_CSR_COMP1_HYST_Field is HAL.UInt2;
subtype COMP1_CSR_COMP1_BLANKING_Field is HAL.UInt3;
-- Comparator 1 control and status register
type COMP1_CSR_Register is record
-- Comparator 1 enable bit
COMP1_EN : Boolean := False;
-- unspecified
Reserved_1_1 : HAL.Bit := 16#0#;
-- Power Mode of the comparator 1
COMP1_PWRMODE : COMP1_CSR_COMP1_PWRMODE_Field := 16#0#;
-- Comparator 1 Input Minus connection configuration bit
COMP1_INMSEL : COMP1_CSR_COMP1_INMSEL_Field := 16#0#;
-- Comparator1 input plus selection bit
COMP1_INPSEL : Boolean := False;
-- unspecified
Reserved_8_14 : HAL.UInt7 := 16#0#;
-- Comparator 1 polarity selection bit
COMP1_POLARITY : Boolean := False;
-- Comparator 1 hysteresis selection bits
COMP1_HYST : COMP1_CSR_COMP1_HYST_Field := 16#0#;
-- Comparator 1 blanking source selection bits
COMP1_BLANKING : COMP1_CSR_COMP1_BLANKING_Field := 16#0#;
-- unspecified
Reserved_21_21 : HAL.Bit := 16#0#;
-- Scaler bridge enable
COMP1_BRGEN : Boolean := False;
-- Voltage scaler enable bit
COMP1_SCALEN : Boolean := False;
-- unspecified
Reserved_24_29 : HAL.UInt6 := 16#0#;
-- Read-only. Comparator 1 output status bit
COMP1_VALUE : Boolean := False;
-- Write-only. COMP1_CSR register lock bit
COMP1_LOCK : Boolean := False;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for COMP1_CSR_Register use record
COMP1_EN at 0 range 0 .. 0;
Reserved_1_1 at 0 range 1 .. 1;
COMP1_PWRMODE at 0 range 2 .. 3;
COMP1_INMSEL at 0 range 4 .. 6;
COMP1_INPSEL at 0 range 7 .. 7;
Reserved_8_14 at 0 range 8 .. 14;
COMP1_POLARITY at 0 range 15 .. 15;
COMP1_HYST at 0 range 16 .. 17;
COMP1_BLANKING at 0 range 18 .. 20;
Reserved_21_21 at 0 range 21 .. 21;
COMP1_BRGEN at 0 range 22 .. 22;
COMP1_SCALEN at 0 range 23 .. 23;
Reserved_24_29 at 0 range 24 .. 29;
COMP1_VALUE at 0 range 30 .. 30;
COMP1_LOCK at 0 range 31 .. 31;
end record;
subtype COMP2_CSR_COMP2_PWRMODE_Field is HAL.UInt2;
subtype COMP2_CSR_COMP2_INMSEL_Field is HAL.UInt3;
subtype COMP2_CSR_COMP2_HYST_Field is HAL.UInt2;
subtype COMP2_CSR_COMP2_BLANKING_Field is HAL.UInt3;
-- Comparator 2 control and status register
type COMP2_CSR_Register is record
-- Comparator 2 enable bit
COMP2_EN : Boolean := False;
-- unspecified
Reserved_1_1 : HAL.Bit := 16#0#;
-- Power Mode of the comparator 2
COMP2_PWRMODE : COMP2_CSR_COMP2_PWRMODE_Field := 16#0#;
-- Comparator 2 Input Minus connection configuration bit
COMP2_INMSEL : COMP2_CSR_COMP2_INMSEL_Field := 16#0#;
-- Comparator 2 Input Plus connection configuration bit
COMP2_INPSEL : Boolean := False;
-- unspecified
Reserved_8_8 : HAL.Bit := 16#0#;
-- Windows mode selection bit
COMP2_WINMODE : Boolean := False;
-- unspecified
Reserved_10_14 : HAL.UInt5 := 16#0#;
-- Comparator 2 polarity selection bit
COMP2_POLARITY : Boolean := False;
-- Comparator 2 hysteresis selection bits
COMP2_HYST : COMP2_CSR_COMP2_HYST_Field := 16#0#;
-- Comparator 2 blanking source selection bits
COMP2_BLANKING : COMP2_CSR_COMP2_BLANKING_Field := 16#0#;
-- unspecified
Reserved_21_21 : HAL.Bit := 16#0#;
-- Scaler bridge enable
COMP2_BRGEN : Boolean := False;
-- Voltage scaler enable bit
COMP2_SCALEN : Boolean := False;
-- unspecified
Reserved_24_29 : HAL.UInt6 := 16#0#;
-- Read-only. Comparator 2 output status bit
COMP2_VALUE : Boolean := False;
-- Write-only. COMP2_CSR register lock bit
COMP2_LOCK : Boolean := False;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for COMP2_CSR_Register use record
COMP2_EN at 0 range 0 .. 0;
Reserved_1_1 at 0 range 1 .. 1;
COMP2_PWRMODE at 0 range 2 .. 3;
COMP2_INMSEL at 0 range 4 .. 6;
COMP2_INPSEL at 0 range 7 .. 7;
Reserved_8_8 at 0 range 8 .. 8;
COMP2_WINMODE at 0 range 9 .. 9;
Reserved_10_14 at 0 range 10 .. 14;
COMP2_POLARITY at 0 range 15 .. 15;
COMP2_HYST at 0 range 16 .. 17;
COMP2_BLANKING at 0 range 18 .. 20;
Reserved_21_21 at 0 range 21 .. 21;
COMP2_BRGEN at 0 range 22 .. 22;
COMP2_SCALEN at 0 range 23 .. 23;
Reserved_24_29 at 0 range 24 .. 29;
COMP2_VALUE at 0 range 30 .. 30;
COMP2_LOCK at 0 range 31 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Comparator
type COMP_Peripheral is record
-- Comparator 1 control and status register
COMP1_CSR : aliased COMP1_CSR_Register;
-- Comparator 2 control and status register
COMP2_CSR : aliased COMP2_CSR_Register;
end record
with Volatile;
for COMP_Peripheral use record
COMP1_CSR at 16#0# range 0 .. 31;
COMP2_CSR at 16#4# range 0 .. 31;
end record;
-- Comparator
COMP_Periph : aliased COMP_Peripheral
with Import, Address => COMP_Base;
end STM32_SVD.COMP;
|
------------------------------------------------------------------------------
-- Copyright (c) 2006-2013, Maxim Reznik
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
--
-- * Redistributions of source code must retain the above copyright notice,
-- this list of conditions and the following disclaimer.
-- * Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
-- * Neither the name of the Maxim Reznik, IE nor the names of its
-- contributors may be used to endorse or promote products derived from
-- this software without specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
-- LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
-- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-- POSSIBILITY OF SUCH DAMAGE.
------------------------------------------------------------------------------
package Asis.Gela.Elements.Clause.Rep is
---------------------------------------
-- Record_Representation_Clause_Node --
---------------------------------------
type Record_Representation_Clause_Node is
new Representation_Clause_Node with private;
type Record_Representation_Clause_Ptr is
access all Record_Representation_Clause_Node;
for Record_Representation_Clause_Ptr'Storage_Pool use Lists.Pool;
function New_Record_Representation_Clause_Node
(The_Context : ASIS.Context)
return Record_Representation_Clause_Ptr;
function Mod_Clause_Expression
(Element : Record_Representation_Clause_Node) return Asis.Expression;
procedure Set_Mod_Clause_Expression
(Element : in out Record_Representation_Clause_Node;
Value : in Asis.Expression);
function Component_Clauses
(Element : Record_Representation_Clause_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List;
procedure Set_Component_Clauses
(Element : in out Record_Representation_Clause_Node;
Value : in Asis.Element);
function Component_Clauses_List
(Element : Record_Representation_Clause_Node) return Asis.Element;
function Representation_Clause_Kind (Element : Record_Representation_Clause_Node)
return Asis.Representation_Clause_Kinds;
function Children (Element : access Record_Representation_Clause_Node)
return Traverse_List;
function Clone
(Element : Record_Representation_Clause_Node;
Parent : Asis.Element)
return Asis.Element;
procedure Copy
(Source : in Asis.Element;
Target : access Record_Representation_Clause_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element);
--------------------
-- At_Clause_Node --
--------------------
type At_Clause_Node is
new Representation_Clause_Node with private;
type At_Clause_Ptr is
access all At_Clause_Node;
for At_Clause_Ptr'Storage_Pool use Lists.Pool;
function New_At_Clause_Node
(The_Context : ASIS.Context)
return At_Clause_Ptr;
function Representation_Clause_Expression
(Element : At_Clause_Node) return Asis.Expression;
procedure Set_Representation_Clause_Expression
(Element : in out At_Clause_Node;
Value : in Asis.Expression);
function Representation_Clause_Kind (Element : At_Clause_Node)
return Asis.Representation_Clause_Kinds;
function Children (Element : access At_Clause_Node)
return Traverse_List;
function Clone
(Element : At_Clause_Node;
Parent : Asis.Element)
return Asis.Element;
procedure Copy
(Source : in Asis.Element;
Target : access At_Clause_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element);
--------------------------------------
-- Attribute_Definition_Clause_Node --
--------------------------------------
type Attribute_Definition_Clause_Node is
new At_Clause_Node with private;
type Attribute_Definition_Clause_Ptr is
access all Attribute_Definition_Clause_Node;
for Attribute_Definition_Clause_Ptr'Storage_Pool use Lists.Pool;
function New_Attribute_Definition_Clause_Node
(The_Context : ASIS.Context)
return Attribute_Definition_Clause_Ptr;
function Representation_Clause_Kind (Element : Attribute_Definition_Clause_Node)
return Asis.Representation_Clause_Kinds;
function Clone
(Element : Attribute_Definition_Clause_Node;
Parent : Asis.Element)
return Asis.Element;
procedure Copy
(Source : in Asis.Element;
Target : access Attribute_Definition_Clause_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element);
--------------------------------------------
-- Enumeration_Representation_Clause_Node --
--------------------------------------------
type Enumeration_Representation_Clause_Node is
new At_Clause_Node with private;
type Enumeration_Representation_Clause_Ptr is
access all Enumeration_Representation_Clause_Node;
for Enumeration_Representation_Clause_Ptr'Storage_Pool use Lists.Pool;
function New_Enumeration_Representation_Clause_Node
(The_Context : ASIS.Context)
return Enumeration_Representation_Clause_Ptr;
function Representation_Clause_Kind (Element : Enumeration_Representation_Clause_Node)
return Asis.Representation_Clause_Kinds;
function Clone
(Element : Enumeration_Representation_Clause_Node;
Parent : Asis.Element)
return Asis.Element;
procedure Copy
(Source : in Asis.Element;
Target : access Enumeration_Representation_Clause_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element);
private
type Record_Representation_Clause_Node is
new Representation_Clause_Node with
record
Mod_Clause_Expression : aliased Asis.Expression;
Component_Clauses : aliased Primary_Clause_Lists.List;
end record;
type At_Clause_Node is
new Representation_Clause_Node with
record
Representation_Clause_Expression : aliased Asis.Expression;
end record;
type Attribute_Definition_Clause_Node is
new At_Clause_Node with
record
null;
end record;
type Enumeration_Representation_Clause_Node is
new At_Clause_Node with
record
null;
end record;
end Asis.Gela.Elements.Clause.Rep;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . I M G _ I N T --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
package body System.Img_Int is
-------------------
-- Image_Integer --
-------------------
function Image_Integer (V : Integer) return String is
P : Natural;
S : String (1 .. Integer'Width);
begin
if V >= 0 then
P := 1;
S (P) := ' ';
else
P := 0;
end if;
Set_Image_Integer (V, S, P);
return S (1 .. P);
end Image_Integer;
-----------------------
-- Set_Image_Integer --
-----------------------
procedure Set_Image_Integer
(V : Integer;
S : out String;
P : in out Natural)
is
procedure Set_Digits (T : Integer);
-- Set digits of absolute value of T, which is zero or negative. We work
-- with the negative of the value so that the largest negative number is
-- not a special case.
procedure Set_Digits (T : Integer) is
begin
if T <= -10 then
Set_Digits (T / 10);
P := P + 1;
S (P) := Character'Val (48 - (T rem 10));
else
P := P + 1;
S (P) := Character'Val (48 - T);
end if;
end Set_Digits;
-- Start of processing for Set_Image_Integer
begin
if V >= 0 then
Set_Digits (-V);
else
P := P + 1;
S (P) := '-';
Set_Digits (V);
end if;
end Set_Image_Integer;
end System.Img_Int;
|
-- CB1010D.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- CHECK THAT STORAGE_ERROR IS RAISED WHEN STORAGE FOR THE EXECUTION OF
-- A SUBPROGRAM IS INSUFFICIENT.
-- PNH 8/26/85
-- JRK 8/30/85
WITH REPORT; USE REPORT;
PROCEDURE CB1010D IS
N : INTEGER := IDENT_INT (1);
M : INTEGER := IDENT_INT (0);
PROCEDURE OVERFLOW_STACK IS
BEGIN
N := N + M;
IF N > M THEN -- ALWAYS TRUE.
OVERFLOW_STACK;
END IF;
N := N - M; -- TO PREVENT TAIL RECURSION OPTIMIZATION.
END OVERFLOW_STACK;
BEGIN
TEST ("CB1010D", "CHECK THAT STORAGE_ERROR IS RAISED WHEN " &
"STORAGE FOR THE EXECUTION OF A SUBPROGRAM " &
"IS INSUFFICIENT");
-- CHECK HANDLING OF STORAGE_ERROR IN MAIN PROGRAM.
BEGIN
OVERFLOW_STACK;
FAILED ("EXCEPTION NOT RAISED BY STACK OVERFLOW - 1");
EXCEPTION
WHEN STORAGE_ERROR =>
IF N /= 1 THEN
FAILED ("VALUE OF VARIABLE N ALTERED - 1");
END IF;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED BY STACK OVERFLOW - 1");
END;
-- CHECK HANDLING OF STORAGE_ERROR IN SUBPROGRAM.
DECLARE
PROCEDURE P IS
BEGIN
OVERFLOW_STACK;
FAILED ("EXCEPTION NOT RAISED BY STACK OVERFLOW - 2");
EXCEPTION
WHEN STORAGE_ERROR =>
IF N /= 1 THEN
FAILED ("VALUE OF VARIABLE N ALTERED - 2");
END IF;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED BY STACK " &
"OVERFLOW - 2");
END P;
BEGIN
N := IDENT_INT (1);
P;
END;
RESULT;
END CB1010D;
|
------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding --
-- --
-- Terminal_Interface.Curses.Forms.Field_Types.Numeric --
-- --
-- B O D Y --
-- --
------------------------------------------------------------------------------
-- Copyright (c) 1998 Free Software Foundation, Inc. --
-- --
-- Permission is hereby granted, free of charge, to any person obtaining a --
-- copy of this software and associated documentation files (the --
-- "Software"), to deal in the Software without restriction, including --
-- without limitation the rights to use, copy, modify, merge, publish, --
-- distribute, distribute with modifications, sublicense, and/or sell --
-- copies of the Software, and to permit persons to whom the Software is --
-- furnished to do so, subject to the following conditions: --
-- --
-- The above copyright notice and this permission notice shall be included --
-- in all copies or substantial portions of the Software. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS --
-- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF --
-- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. --
-- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, --
-- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR --
-- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR --
-- THE USE OR OTHER DEALINGS IN THE SOFTWARE. --
-- --
-- Except as contained in this notice, the name(s) of the above copyright --
-- holders shall not be used in advertising or otherwise to promote the --
-- sale, use or other dealings in this Software without prior written --
-- authorization. --
------------------------------------------------------------------------------
-- Author: Juergen Pfeifer, 1996
-- Version Control:
-- $Revision: 1.9 $
-- Binding Version 01.00
------------------------------------------------------------------------------
with Interfaces.C;
with Terminal_Interface.Curses.Aux; use Terminal_Interface.Curses.Aux;
package body Terminal_Interface.Curses.Forms.Field_Types.Numeric is
use type Interfaces.C.int;
procedure Set_Field_Type (Fld : in Field;
Typ : in Numeric_Field)
is
type Double is new Interfaces.C.double;
C_Numeric_Field_Type : C_Field_Type;
pragma Import (C, C_Numeric_Field_Type, "TYPE_NUMERIC");
function Set_Fld_Type (F : Field := Fld;
Cft : C_Field_Type := C_Numeric_Field_Type;
Arg1 : C_Int;
Arg2 : Double;
Arg3 : Double) return C_Int;
pragma Import (C, Set_Fld_Type, "set_field_type");
Res : Eti_Error;
begin
Res := Set_Fld_Type (Arg1 => C_Int (Typ.Precision),
Arg2 => Double (Typ.Lower_Limit),
Arg3 => Double (Typ.Upper_Limit));
if Res /= E_Ok then
Eti_Exception (Res);
end if;
Wrap_Builtin (Fld, Typ);
end Set_Field_Type;
end Terminal_Interface.Curses.Forms.Field_Types.Numeric;
|
-- Copyright 2012-2019 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package body Pck is
procedure Archive is
begin
null;
end Archive;
function Get_Action return Action is
begin
return Archive;
end Get_Action;
end Pck;
|
-- Based on AdaCore's Ada Drivers Library,
-- see https://github.com/AdaCore/Ada_Drivers_Library,
-- checkout 93b5f269341f970698af18f9182fac82a0be66c3.
-- Copyright (C) Adacore
-- Initially based on stm32f7xx_hal_sd.h
-- V1.0.4
-- 09-December-2015
--
-- Tailored to StratoX project.
-- Author: Martin Becker (becker@rcs.ei.tum.de)
--
-- @summary
-- low-level SDCard driver. Controls the SD peripheral, SDIO version.
with System;
with STM32_SVD.SDIO; use STM32_SVD.SDIO;
with STM32.DMA;
package STM32.SDMMC is
type SDMMC_Controller is private;
function As_Controller
(Periph : access STM32_SVD.SDIO.SDIO_Peripheral)
return SDMMC_Controller;
type SD_Error is
(OK,
Error,
Timeout_Error,
Unsupported_Card,
Rx_Overrun,
Tx_Underrun,
Startbit_Not_Detected,
Request_Not_Applicable,
CRC_Check_Fail,
Illegal_Cmd,
Address_Out_Of_Range,
Address_Missaligned,
Block_Length_Error,
Erase_Seq_Error,
Bad_Erase_Parameter,
Write_Protection_Violation,
Lock_Unlock_Failed,
Card_ECC_Failed,
Card_ECC_Disabled,
CC_Error,
General_Unknown_Error,
Stream_Read_Underrun,
Stream_Write_Underrun,
CID_CSD_Overwrite,
WP_Erase_Skip,
Erase_Reset,
AKE_SEQ_Error,
Invalid_Voltage_Range,
DMA_Alignment_Error);
type Supported_SD_Memory_Cards is
(STD_Capacity_SD_Card_V1_1,
STD_Capacity_SD_Card_v2_0,
High_Capacity_SD_Card,
Multimedia_Card,
Secure_Digital_IO_Card,
High_Speed_Multimedia_Card,
Secure_Digital_IO_Combo_Card,
High_Capacity_MMC_Card);
type Card_Specific_Data_Register is record
CSD_Structure : Byte;
System_Specification_Version : Byte;
Reserved : Byte;
Data_Read_Access_Time_1 : Byte;
Data_Read_Access_Time_2 : Byte; -- In CLK Cycles
Max_Bus_Clock_Frequency : Byte;
Card_Command_Class : Short;
Max_Read_Data_Block_Length : Byte; -- ld (blocksize in bytes)
Partial_Block_For_Read_Allowed : Boolean;
Write_Block_Missalignment : Boolean;
Read_Block_Missalignment : Boolean;
DSR_Implemented : Boolean;
Reserved_2 : Byte;
Device_Size : Word;
Max_Read_Current_At_VDD_Min : Byte;
Max_Read_Current_At_VDD_Max : Byte;
Max_Write_Current_At_VDD_Min : Byte;
Max_Write_Current_At_VDD_Max : Byte;
Device_Size_Multiplier : Byte;
Erase_Group_Size : Byte;
Erase_Group_Size_Multiplier : Byte;
Write_Protect_Group_Size : Byte;
Write_Protect_Group_Enable : Boolean;
Manufacturer_Default_ECC : Byte;
Write_Speed_Factor : Byte;
Max_Write_Data_Block_Length : Byte; -- =Max_Read_Data_Block_Length
Partial_Blocks_For_Write_Allowed : Boolean;
Reserved_3 : Byte;
Content_Protection_Application : Boolean;
File_Format_Group : Boolean;
Copy_Flag : Boolean;
Permanent_Write_Protection : Boolean;
Temporary_Write_Protection : Boolean;
File_Format : Byte;
ECC_Code : Byte;
CSD_CRC : Byte;
Reserved_4 : Byte; -- Always 1
end record;
type Card_Revision is record
Major : UInt4;
Minor : UInt4;
end record with Pack;
type Manufacturing_Year is range 2000 .. 2255;
type Manufacturing_Month is
(January,
February,
March,
April,
May,
June,
July,
August,
September,
October,
November,
December) with Size => 4;
type Manufacturing_Date_Type is record
Year : Manufacturing_Year;
Month : Manufacturing_Month;
end record;
type Card_Identification_Data_Register is record
Manufacturer_ID : Byte;
OEM_Application_ID : String (1 .. 2);
Product_Name : String (1 .. 5);
Product_Revision : Card_Revision;
Product_Serial_Number : Word;
Reserved_1 : Byte;
Manufacturing_Date : Manufacturing_Date_Type;
CID_CRC : Byte;
Reserved_2 : Byte; -- Always 1
end record;
type Card_Information is record
SD_CSD : Card_Specific_Data_Register;
SD_CID : Card_Identification_Data_Register;
Card_Capacity : Unsigned_64;
Card_Block_Size : Unsigned_32;
RCA : Short; -- SD relative card address
Card_Type : Supported_SD_Memory_Cards :=
STD_Capacity_SD_Card_V1_1;
end record;
-- Wide bus mode
type Wide_Bus_Mode is
(
-- Default bus mode: SDMMC_D0 is used.
Wide_Bus_1B,
-- 4-wide bus mode: SDMMC_D[3:0] used.
Wide_Bus_4B,
-- 8-wide bus mode: SDMMC_D[7:0] used.
Wide_Bus_8B)
with Size => 2;
for Wide_Bus_Mode use
(Wide_Bus_1B => 0,
Wide_Bus_4B => 1,
Wide_Bus_8B => 2);
function Initialize
(Controller : in out SDMMC_Controller;
Info : out Card_Information) return SD_Error;
function Initialized (Controller : SDMMC_Controller) return Boolean;
function Get_Card_Type
(Controller : SDMMC_Controller) return Supported_SD_Memory_Cards
with Pre => Initialized (Controller);
function Configure_Wide_Bus_Mode
(Controller : in out SDMMC_Controller;
Wide_Mode : Wide_Bus_Mode) return SD_Error;
type SD_Data is array (Unsigned_32 range <>) of Byte
with Pack;
function Read_Blocks
(Controller : in out SDMMC_Controller;
Addr : Unsigned_64;
Data : out SD_Data) return SD_Error
with Pre => Data'Length mod 512 = 0;
function Write_Blocks
(Controller : in out SDMMC_Controller;
Addr : Unsigned_64;
Data : SD_Data) return SD_Error
with Pre => Data'Length mod 512 = 0;
function Read_Blocks_DMA
(Controller : in out SDMMC_Controller;
Addr : Unsigned_64;
DMA : STM32.DMA.DMA_Controller;
Stream : STM32.DMA.DMA_Stream_Selector;
Data : out SD_Data) return SD_Error
with Pre => Data'Length <= 65535;
function Write_Blocks_DMA
(Controller : in out SDMMC_Controller;
Addr : Unsigned_64;
DMA : STM32.DMA.DMA_Controller;
Stream : STM32.DMA.DMA_Stream_Selector;
Data : SD_Data) return SD_Error
with Pre => Data'Length <= 65535;
function Stop_Transfer
(Controller : in out SDMMC_Controller) return SD_Error;
function Get_FIFO_Address
(Controller : SDMMC_Controller) return System.Address;
-- function Get_Transfer_Status
-- (Controller : in out SDMMC_Controller) return SD_Error;
type SDMMC_Flags is
(Data_End,
Data_CRC_Fail,
Data_Timeout,
RX_Overrun,
TX_Underrun,
RX_Active,
TX_Active);
subtype SDMMC_Clearable_Flags is SDMMC_Flags range Data_End .. TX_Underrun;
function Get_Flag
(Controller : SDMMC_Controller;
Flag : SDMMC_Flags) return Boolean;
procedure Clear_Flag
(Controller : in out SDMMC_Controller;
Flag : SDMMC_Clearable_Flags);
procedure Clear_Static_Flags (Controller : in out SDMMC_Controller);
type SDMMC_Interrupts is
(Data_End_Interrupt,
Data_CRC_Fail_Interrupt,
Data_Timeout_Interrupt,
TX_FIFO_Empty_Interrupt,
RX_FIFO_Full_Interrupt,
TX_Underrun_Interrupt,
RX_Overrun_Interrupt);
procedure Enable_Interrupt
(Controller : in out SDMMC_Controller;
Interrupt : SDMMC_Interrupts);
procedure Disable_Interrupt
(Controller : in out SDMMC_Controller;
Interrupt : SDMMC_Interrupts);
type SDMMC_Operation is
(No_Operation,
Read_Single_Block_Operation,
Read_Multiple_Blocks_Operation,
Write_Single_Block_Operation,
Write_Multiple_Blocks_Operation);
function Last_Operation
(Controller : SDMMC_Controller) return SDMMC_Operation;
function Read_FIFO
(Controller : in out SDMMC_Controller) return Word; -- originally this was in the body
private
type SDMMC_Command is new Byte;
-- Resets the SD memory card
Go_Idle_State : constant SDMMC_Command := 0;
-- Sends host capacity support information and activates the card's
-- initialization process
Send_Op_Cond : constant SDMMC_Command := 1;
-- Asks any card connected to the host to send the CID numbers on the
-- CMD line.
All_Send_CID : constant SDMMC_Command := 2;
-- Asks the card to publish a new relative address (RCA).
Set_Rel_Addr : constant SDMMC_Command := 3;
-- Programs the DSR of all cards.
Set_DSR : constant SDMMC_Command := 4;
-- Sends host capacity support information (HCS) and asks the accessed
-- card to send its operating condition register (OCR) content in the
-- response on the CMD line.
SDMMC_Send_Op_Cond : constant SDMMC_Command := 5;
-- Checks switchable function (mode 0) and switch card function (mode
-- 1).
HS_Switch : constant SDMMC_Command := 6;
-- Selects the card by its own relative address and gets deselected by
-- any other address
Sel_Desel_Card : constant SDMMC_Command := 7;
-- Sends SD Memory Card interface condition
HS_Send_Ext_CSD : constant SDMMC_Command := 8;
-- Addressed card sends its card specific data
Send_CSD : constant SDMMC_Command := 9;
-- Addressed card sends its card identification (CID) on the CMD line.
Send_CID : constant SDMMC_Command := 10;
Read_Dat_Until_Stop : constant SDMMC_Command := 11;
Stop_Transmission : constant SDMMC_Command := 12;
Send_Status : constant SDMMC_Command := 13;
HS_Bustest_Read : constant SDMMC_Command := 14;
Go_Inactive_State : constant SDMMC_Command := 15;
Set_Blocklen : constant SDMMC_Command := 16;
Read_Single_Block : constant SDMMC_Command := 17;
Read_Multi_Block : constant SDMMC_Command := 18;
HS_Bustest_Write : constant SDMMC_Command := 19;
Write_Dat_Until_Stop : constant SDMMC_Command := 20;
Set_Block_Count : constant SDMMC_Command := 23; -- Only for MMC
Write_Single_Block : constant SDMMC_Command := 24;
Write_Multi_Block : constant SDMMC_Command := 25;
Prog_CID : constant SDMMC_Command := 26;
Prog_CSD : constant SDMMC_Command := 27;
Set_Write_Prot : constant SDMMC_Command := 28;
Clr_Write_Prot : constant SDMMC_Command := 29;
Send_Write_Prot : constant SDMMC_Command := 30;
SD_Erase_Grp_Start : constant SDMMC_Command := 32;
SD_Erase_Grp_End : constant SDMMC_Command := 33;
Erase_Grp_Start : constant SDMMC_Command := 35;
Erase_Grp_End : constant SDMMC_Command := 36;
Erase : constant SDMMC_Command := 38;
Fast_IO : constant SDMMC_Command := 39;
Go_IRQ_State : constant SDMMC_Command := 40;
Lock_Unlock : constant SDMMC_Command := 42;
App_Cmd : constant SDMMC_Command := 55;
Gen_Cmd : constant SDMMC_Command := 56;
No_Cmd : constant SDMMC_Command := 64;
-- SD-Card speciric commands
-- App_Cmd should be sent before sending these commands
subtype SD_Specific_Command is SDMMC_Command;
SD_App_Set_Buswidth : constant SD_Specific_Command := 6;
SD_App_Status : constant SD_Specific_Command := 13;
SD_App_Secure_Read_Multi_Block : constant SD_Specific_Command := 18;
SD_App_Send_Num_Write_Blocks : constant SD_Specific_Command := 22;
SD_App_Set_Write_Block_Erase_Count : constant SD_Specific_Command := 23;
SD_App_Secure_Write_Multi_Block : constant SD_Specific_Command := 25;
SD_App_Secure_Erase : constant SD_Specific_Command := 38;
SD_App_Op_Cond : constant SD_Specific_Command := 41;
SD_App_Get_MKB : constant SD_Specific_Command := 43;
SD_App_Get_MID : constant SD_Specific_Command := 44;
SD_App_Set_CER_RN1 : constant SD_Specific_Command := 45;
SD_App_Get_CER_RN2 : constant SD_Specific_Command := 46;
SD_App_Set_CER_RES2 : constant SD_Specific_Command := 47;
SD_App_Get_CER_RES1 : constant SD_Specific_Command := 48;
SD_App_Change_Secure_Area : constant SD_Specific_Command := 49;
SD_App_Send_SCR : constant SD_Specific_Command := 51;
type Card_Data_Table is array (0 .. 3) of Word;
type SDMMC_Controller is record
Periph : access STM32_SVD.SDIO.SDIO_Peripheral;
CID : Card_Data_Table;
CSD : Card_Data_Table;
Card_Type : Supported_SD_Memory_Cards :=
STD_Capacity_SD_Card_V1_1;
RCA : Word;
Operation : SDMMC_Operation := No_Operation;
end record;
function As_Controller
(Periph : access STM32_SVD.SDIO.SDIO_Peripheral)
return SDMMC_Controller
is (Periph, CID => (others => 0), CSD => (others => 0), others => <>);
function Initialized (Controller : SDMMC_Controller) return Boolean
is (Controller.CID /= (0, 0, 0, 0));
function Get_Card_Type
(Controller : SDMMC_Controller) return Supported_SD_Memory_Cards
is (Controller.Card_Type);
type Data_Direction is (Read, Write);
function Get_FIFO_Address
(Controller : SDMMC_Controller) return System.Address
is (Controller.Periph.FIFO'Address);
function Get_Flag
(Controller : SDMMC_Controller;
Flag : SDMMC_Flags) return Boolean
is (case Flag is
when Data_End => Controller.Periph.STA.DATAEND,
when Data_CRC_Fail => Controller.Periph.STA.DCRCFAIL,
when Data_Timeout => Controller.Periph.STA.DTIMEOUT,
when RX_Overrun => Controller.Periph.STA.RXOVERR,
when TX_Underrun => Controller.Periph.STA.TXUNDERR,
when RX_Active => Controller.Periph.STA.RXACT,
when TX_Active => Controller.Periph.STA.TXACT);
function Last_Operation
(Controller : SDMMC_Controller) return SDMMC_Operation
is (Controller.Operation);
end STM32.SDMMC;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T . E X C E P T I O N _ A C T I O N S . C O R E _ D U M P --
-- --
-- B o d y --
-- --
-- Copyright (C) 2003 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 is the default (Unix) version.
separate (GNAT.Exception_Actions)
procedure Core_Dump (Occurrence : Exception_Occurrence) is
pragma Unreferenced (Occurrence);
SIG_ABORT : constant := 6;
procedure C_Abort;
pragma Import (C, C_Abort, "abort");
procedure Signal (Signum : Integer; Handler : System.Address);
pragma Import (C, Signal, "signal");
begin
-- Unregister the default handler for SIGABRT, since otherwise we would
-- simply get a standard Ada exception, which is not what we want.
Signal (SIG_ABORT, System.Null_Address);
C_Abort;
end Core_Dump;
|
-------------------------------------------------------------------------------
-- --
-- 0MQ Ada-binding --
-- --
-- Z M Q . S O C K E T S . I N D E F I N I T E _ T Y P E D _ G E N E R I C --
-- --
-- S p e c --
-- --
-- Copyright (C) 2020-2030, per.s.sandberg@bahnhof.se --
-- --
-- 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.Streams;
generic
type Element_Type (<>) is private;
Initial_Size : Ada.Streams.Stream_Element_Offset := 1024;
package ZMQ.Sockets.Indefinite_Typed_Generic is
-- This package provides a wraper for first serializeing any object
-- then send the serialized data over the socket.
type Socket is new ZMQ.Sockets.Socket with private;
not overriding
procedure Send
(This : in out Socket;
Msg : Element_Type);
not overriding
procedure Recv
(This : in Socket;
Msg : out Element_Type);
private
type Socket is new ZMQ.Sockets.Socket with record
Acutal_Initial_Size : Ada.Streams.Stream_Element_Offset := Initial_Size;
end record;
end ZMQ.Sockets.Indefinite_Typed_Generic;
|
with
interfaces.C,
System;
package Freetype_C
--
-- Provides core types for the Freetype C library.
--
is
use Interfaces;
-- FT_UShort
--
subtype FT_UShort is C.unsigned_short;
type FT_UShort_array is array (C.Size_t range <>) of aliased FT_UShort;
-- FT_Int
--
subtype FT_Int is C.int;
type FT_Int_array is array (C.Size_t range <>) of aliased FT_Int;
-- FT_UInt
--
subtype FT_UInt is C.unsigned;
type FT_UInt_array is array (C.Size_t range <>) of aliased FT_UInt;
-- FT_Long
--
subtype FT_Long is C.long;
type FT_Long_array is array (C.Size_t range <>) of aliased FT_Long;
-- FT_ULong
--
subtype FT_ULong is C.unsigned_long;
type FT_ULong_array is array (C.Size_t range <>) of aliased FT_ULong;
-- FT_Fixed
--
subtype FT_Fixed is C.long;
type FT_Fixed_array is array (C.Size_t range <>) of aliased FT_Fixed;
-- FT_Pos
--
subtype FT_Pos is C.long;
type FT_Pos_array is array (C.Size_t range <>) of aliased FT_Pos;
-- FT_Error
--
subtype FT_Error is C.int;
type FT_Error_array is array (C.Size_t range <>) of aliased FT_Error;
-- FT_Encoding
--
subtype FT_Encoding is C.unsigned;
type FT_Encoding_array is array (C.Size_t range <>) of aliased FT_Encoding;
-- FT_F26Dot6
--
subtype FT_F26Dot6 is C.long;
type FT_F26Dot6_array is array (C.Size_t range <>) of aliased FT_F26Dot6;
-- FT_Int32
--
subtype FT_Int32 is C.int;
type FT_Int32_array is array (C.Size_t range <>) of aliased FT_Int32;
-- FT_UInt32
--
subtype FT_UInt32 is C.unsigned;
type FT_UInt32_array is array (C.Size_t range <>) of aliased FT_UInt32;
-- FT_Render_Mode
--
type FT_Render_Mode is (FT_RENDER_MODE_NORMAL,
FT_RENDER_MODE_LIGHT,
FT_RENDER_MODE_MONO,
FT_RENDER_MODE_LCD,
FT_RENDER_MODE_LCD_V,
FT_RENDER_MODE_MAX);
type FT_Render_Mode_array is array (C.Size_t range <>) of aliased FT_Render_Mode;
-- FT_Outline
--
subtype FT_Outline is System.Address;
type FT_Outline_array is array (C.Size_t range <>) of aliased FT_Outline;
-- FT_LibraryRec
--
subtype FT_LibraryRec is System.Address;
type FT_LibraryRec_array is array (C.Size_t range <>) of aliased FT_LibraryRec;
-- FT_GlyphSlotRec
--
subtype FT_GlyphSlotRec is System.Address;
type FT_GlyphSlotRec_array is array (C.Size_t range <>) of aliased FT_GlyphSlotRec;
-- FT_FaceRec
--
subtype FT_FaceRec is System.Address;
type FT_FaceRec_array is array (C.Size_t range <>) of aliased FT_FaceRec;
-- FT_Kerning_Mode
--
type FT_Kerning_Mode is (FT_KERNING_DEFAULT,
FT_KERNING_UNFITTED,
FT_KERNING_UNSCALED);
type FT_Kerning_Mode_array is array (C.Size_t range <>) of aliased FT_Kerning_Mode;
-- FT_SizeRec
--
subtype FT_SizeRec is System.Address;
type FT_SizeRec_array is array (C.Size_t range <>) of aliased FT_SizeRec;
private
for FT_Render_Mode use (FT_RENDER_MODE_NORMAL => 0,
FT_RENDER_MODE_LIGHT => 1,
FT_RENDER_MODE_MONO => 2,
FT_RENDER_MODE_LCD => 3,
FT_RENDER_MODE_LCD_V => 4,
FT_RENDER_MODE_MAX => 5);
pragma Convention (C, FT_Render_Mode);
for FT_Kerning_Mode use (FT_KERNING_DEFAULT => 0,
FT_KERNING_UNFITTED => 1,
FT_KERNING_UNSCALED => 2);
pragma Convention (C, FT_Kerning_Mode);
end Freetype_C;
|
-----------------------------------------------------------------------
-- awa-audits-services -- AWA Audit Manager
-- Copyright (C) 2018, 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.
-----------------------------------------------------------------------
with Ada.Calendar;
with Ada.Strings.Hash;
with Util.Strings;
with Util.Beans.Objects;
with Util.Log.Loggers;
with ADO.Objects;
with ADO.Schemas;
with ADO.Statements;
with ADO.Sessions.Entities;
with AWA.Audits.Models;
with AWA.Services.Contexts;
package body AWA.Audits.Services is
package ASC renames AWA.Services.Contexts;
package UBO renames Util.Beans.Objects;
use type ASC.Service_Context_Access;
Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("AWA.Audits.Services");
function Hash (Item : in Field_Key) return Ada.Containers.Hash_Type is
use type Ada.Containers.Hash_Type;
begin
return Ada.Containers.Hash_Type (Item.Entity) + Ada.Strings.Hash (Item.Name);
end Hash;
-- ------------------------------
-- Save the audit changes in the database.
-- ------------------------------
overriding
procedure Save (Manager : in out Audit_Manager;
Session : in out ADO.Sessions.Master_Session'Class;
Object : in ADO.Audits.Auditable_Object_Record'Class;
Changes : in ADO.Audits.Audit_Array) is
Context : constant ASC.Service_Context_Access := ASC.Current;
Now : constant Ada.Calendar.Time := Ada.Calendar.Clock;
Class : constant ADO.Schemas.Class_Mapping_Access
:= Object.Get_Key.Of_Class;
Kind : constant ADO.Entity_Type
:= ADO.Sessions.Entities.Find_Entity_Type (Session, Object.Get_Key);
begin
for C of Changes loop
declare
Audit : AWA.Audits.Models.Audit_Ref;
Field : constant Util.Strings.Name_Access := Class.Members (C.Field);
begin
Audit.Set_Entity_Id (ADO.Objects.Get_Value (Object.Get_Key));
Audit.Set_Entity_Type (Kind);
Audit.Set_Field (Manager.Get_Audit_Field (Field.all, Kind));
if UBO.Is_Null (C.Old_Value) then
Audit.Set_Old_Value (ADO.Null_String);
else
Audit.Set_Old_Value (UBO.To_String (C.Old_Value));
end if;
if UBO.Is_Null (C.New_Value) then
Audit.Set_New_Value (ADO.Null_String);
else
Audit.Set_New_Value (UBO.To_String (C.New_Value));
end if;
Audit.Set_Date (Now);
if Context /= null then
Audit.Set_Session (Context.Get_User_Session);
end if;
Audit.Save (Session);
end;
end loop;
end Save;
-- ------------------------------
-- Find the audit field identification number from the entity type and field name.
-- ------------------------------
function Get_Audit_Field (Manager : in Audit_Manager;
Name : in String;
Entity : in ADO.Entity_Type) return Integer is
Key : constant Field_Key := Field_Key '(Len => Name'Length,
Name => Name,
Entity => Entity);
Pos : constant Audit_Field_Maps.Cursor := Manager.Fields.Find (Key);
begin
if Audit_Field_Maps.Has_Element (Pos) then
return Audit_Field_Maps.Element (Pos);
else
Log.Warn ("Audit field {0} for{1} not found",
Name, ADO.Entity_Type'Image (Entity));
return 0;
end if;
end Get_Audit_Field;
-- ------------------------------
-- Initialize the audit manager.
-- ------------------------------
procedure Initialize (Manager : in out Audit_Manager;
App : in Application_Access) is
DB : constant ADO.Sessions.Session := App.Get_Session;
Stmt : ADO.Statements.Query_Statement
:= DB.Create_Statement ("SELECT id, entity_type, name FROM awa_audit_field");
Count : Natural := 0;
begin
Stmt.Execute;
while Stmt.Has_Elements loop
declare
Id : constant Integer := Stmt.Get_Integer (0);
Kind : constant ADO.Entity_Type := ADO.Entity_Type (Stmt.Get_Integer (1));
Name : constant String := Stmt.Get_String (2);
Key : constant Field_Key := (Len => Name'Length,
Name => Name,
Entity => Kind);
begin
Log.Debug ("Field {0} of{1} ={2}",
Name, ADO.Entity_Type'Image (Kind), Integer'Image (Id));
if Manager.Fields.Contains (Key) then
Log.Error ("Field {0} of{1} is already defined",
Name, ADO.Entity_Type'Image (Kind));
else
Manager.Fields.Insert (Key => Key,
New_Item => Id);
end if;
end;
Count := Count + 1;
Stmt.Next;
end loop;
Log.Info ("Loaded{0} audit fields", Natural'Image (Count));
end Initialize;
end AWA.Audits.Services;
|
-- This file is generated by SWIG. Please do not modify by hand.
--
with Interfaces.C;
with Interfaces.C;
with Interfaces.C.Pointers;
package xcb.xcb_glx_is_query_arb_cookie_t is
-- Item
--
type Item is record
sequence : aliased Interfaces.C.unsigned;
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb.xcb_glx_is_query_arb_cookie_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_is_query_arb_cookie_t.Item,
Element_Array => xcb.xcb_glx_is_query_arb_cookie_t.Item_Array,
Default_Terminator => (others => <>));
subtype Pointer is C_Pointers.Pointer;
-- Pointer_Array
--
type Pointer_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb.xcb_glx_is_query_arb_cookie_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_is_query_arb_cookie_t.Pointer,
Element_Array => xcb.xcb_glx_is_query_arb_cookie_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_glx_is_query_arb_cookie_t;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . N U M E R I C S . S H O R T _ C O M P L E X _ T Y P E S --
-- --
-- S p e c --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. In accordance with the copyright of that document, you can freely --
-- copy and modify this specification, provided that if you redistribute a --
-- modified version, any changes that you have made are clearly indicated. --
-- --
------------------------------------------------------------------------------
with Ada.Numerics.Generic_Complex_Types;
package Ada.Numerics.Short_Complex_Types is
new Ada.Numerics.Generic_Complex_Types (Short_Float);
pragma Pure (Short_Complex_Types);
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S T Y L E --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-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. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING3. If not, go to --
-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Atree; use Atree;
with Casing; use Casing;
with Csets; use Csets;
with Einfo; use Einfo;
with Errout; use Errout;
with Namet; use Namet;
with Nlists; use Nlists;
with Opt; use Opt;
with Sinfo; use Sinfo;
with Sinput; use Sinput;
with Stand; use Stand;
with Stylesw; use Stylesw;
package body Style is
-----------------------
-- Body_With_No_Spec --
-----------------------
-- If the check specs mode (-gnatys) is set, then all subprograms must
-- have specs unless they are parameterless procedures at the library
-- level (i.e. they are possible main programs).
procedure Body_With_No_Spec (N : Node_Id) is
begin
if Style_Check_Specs then
if Nkind (Parent (N)) = N_Compilation_Unit then
declare
Spec : constant Node_Id := Specification (N);
Defnm : constant Node_Id := Defining_Unit_Name (Spec);
begin
if Nkind (Spec) = N_Procedure_Specification
and then Nkind (Defnm) = N_Defining_Identifier
and then No (First_Formal (Defnm))
then
return;
end if;
end;
end if;
Error_Msg_N ("(style) subprogram body has no previous spec", N);
end if;
end Body_With_No_Spec;
---------------------------------
-- Check_Array_Attribute_Index --
---------------------------------
procedure Check_Array_Attribute_Index
(N : Node_Id;
E1 : Node_Id;
D : Int)
is
begin
if Style_Check_Array_Attribute_Index then
if D = 1 and then Present (E1) then
Error_Msg_N -- CODEFIX
("(style) index number not allowed for one dimensional array",
E1);
elsif D > 1 and then No (E1) then
Error_Msg_N -- CODEFIX
("(style) index number required for multi-dimensional array",
N);
end if;
end if;
end Check_Array_Attribute_Index;
----------------------
-- Check_Identifier --
----------------------
-- In check references mode (-gnatyr), identifier uses must be cased
-- the same way as the corresponding identifier declaration. If standard
-- references are checked (-gnatyn), then identifiers from Standard must
-- be cased as in the Reference Manual.
procedure Check_Identifier
(Ref : Node_Or_Entity_Id;
Def : Node_Or_Entity_Id)
is
Sref : Source_Ptr := Sloc (Ref);
Sdef : Source_Ptr := Sloc (Def);
Tref : Source_Buffer_Ptr;
Tdef : Source_Buffer_Ptr;
Nlen : Nat;
Cas : Casing_Type;
begin
-- If reference does not come from source, nothing to check
if not Comes_From_Source (Ref) then
return;
-- If previous error on either node/entity, ignore
elsif Error_Posted (Ref) or else Error_Posted (Def) then
return;
-- Case of definition comes from source
elsif Comes_From_Source (Def) then
-- Check same casing if we are checking references
if Style_Check_References then
Tref := Source_Text (Get_Source_File_Index (Sref));
Tdef := Source_Text (Get_Source_File_Index (Sdef));
-- Ignore operator name case completely. This also catches the
-- case of where one is an operator and the other is not. This
-- is a phenomenon from rewriting of operators as functions,
-- and is to be ignored.
if Tref (Sref) = '"' or else Tdef (Sdef) = '"' then
return;
else
while Tref (Sref) = Tdef (Sdef) loop
-- If end of identifier, all done
if not Identifier_Char (Tref (Sref)) then
return;
-- Otherwise loop continues
else
Sref := Sref + 1;
Sdef := Sdef + 1;
end if;
end loop;
-- Fall through loop when mismatch between identifiers
-- If either identifier is not terminated, error.
if Identifier_Char (Tref (Sref))
or else
Identifier_Char (Tdef (Sdef))
then
Error_Msg_Node_1 := Def;
Error_Msg_Sloc := Sloc (Def);
Error_Msg -- CODEFIX
("(style) bad casing of & declared#", Sref);
return;
-- Else end of identifiers, and they match
else
return;
end if;
end if;
end if;
-- Case of definition in package Standard
elsif Sdef = Standard_Location
or else
Sdef = Standard_ASCII_Location
then
-- Check case of identifiers in Standard
if Style_Check_Standard then
Tref := Source_Text (Get_Source_File_Index (Sref));
-- Ignore operators
if Tref (Sref) = '"' then
null;
-- Otherwise determine required casing of Standard entity
else
-- ASCII is all upper case
if Entity (Ref) = Standard_ASCII then
Cas := All_Upper_Case;
-- Special handling for names in package ASCII
elsif Sdef = Standard_ASCII_Location then
declare
Nam : constant String := Get_Name_String (Chars (Def));
begin
-- Bar is mixed case
if Nam = "bar" then
Cas := Mixed_Case;
-- All names longer than 4 characters are mixed case
elsif Nam'Length > 4 then
Cas := Mixed_Case;
-- All names shorter than 4 characters (other than Bar,
-- which we already tested for specially) are Upper case.
else
Cas := All_Upper_Case;
end if;
end;
-- All other entities are in mixed case
else
Cas := Mixed_Case;
end if;
Nlen := Length_Of_Name (Chars (Ref));
-- Now check if we have the right casing
if Determine_Casing
(Tref (Sref .. Sref + Source_Ptr (Nlen) - 1)) = Cas
then
null;
else
Name_Len := Integer (Nlen);
Name_Buffer (1 .. Name_Len) :=
String (Tref (Sref .. Sref + Source_Ptr (Nlen) - 1));
Set_Casing (Cas);
Error_Msg_Name_1 := Name_Enter;
Error_Msg_N -- CODEFIX
("(style) bad casing of %% declared in Standard", Ref);
end if;
end if;
end if;
end if;
end Check_Identifier;
------------------------
-- Missing_Overriding --
------------------------
procedure Missing_Overriding (N : Node_Id; E : Entity_Id) is
Nod : Node_Id;
begin
-- Perform the check on source subprograms and on subprogram instances,
-- because these can be primitives of untagged types. Note that such
-- indicators were introduced in Ada 2005. We apply Comes_From_Source
-- to Original_Node to catch the case of a procedure body declared with
-- "is null" that has been rewritten as a normal empty body.
if Style_Check_Missing_Overriding
and then (Comes_From_Source (Original_Node (N))
or else Is_Generic_Instance (E))
and then Ada_Version_Explicit >= Ada_2005
then
-- If the subprogram is an instantiation, its declaration appears
-- within a wrapper package that precedes the instance node. Place
-- warning on the node to avoid references to the original generic.
if Nkind (N) = N_Subprogram_Declaration
and then Is_Generic_Instance (E)
then
Nod := Next (Parent (Parent (List_Containing (N))));
else
Nod := N;
end if;
if Nkind (N) = N_Subprogram_Body then
Error_Msg_NE -- CODEFIX
("(style) missing OVERRIDING indicator in body of&", N, E);
else
Error_Msg_NE -- CODEFIX
("(style) missing OVERRIDING indicator in declaration of&",
Nod, E);
end if;
end if;
end Missing_Overriding;
-----------------------------------
-- Subprogram_Not_In_Alpha_Order --
-----------------------------------
procedure Subprogram_Not_In_Alpha_Order (Name : Node_Id) is
begin
if Style_Check_Order_Subprograms then
Error_Msg_N -- CODEFIX
("(style) subprogram body& not in alphabetical order", Name);
end if;
end Subprogram_Not_In_Alpha_Order;
end Style;
|
package Giza.Bitmap_Fonts.FreeSansOblique32pt7b is
Font : constant Giza.Font.Ref_Const;
private
FreeSansOblique32pt7bBitmaps : aliased constant Font_Bitmap := (
16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#F0#, 16#03#, 16#E0#, 16#07#,
16#C0#, 16#0F#, 16#80#, 16#1E#, 16#00#, 16#7C#, 16#00#, 16#F8#, 16#01#,
16#F0#, 16#03#, 16#C0#, 16#0F#, 16#80#, 16#1F#, 16#00#, 16#3E#, 16#00#,
16#7C#, 16#01#, 16#F0#, 16#03#, 16#E0#, 16#07#, 16#C0#, 16#0F#, 16#80#,
16#1E#, 16#00#, 16#7C#, 16#00#, 16#F8#, 16#01#, 16#F0#, 16#03#, 16#E0#,
16#07#, 16#80#, 16#1F#, 16#00#, 16#3C#, 16#00#, 16#78#, 16#00#, 16#F0#,
16#01#, 16#C0#, 16#03#, 16#80#, 16#06#, 16#00#, 16#1C#, 16#00#, 16#38#,
16#00#, 16#60#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#F8#, 16#01#, 16#F0#, 16#07#,
16#C0#, 16#0F#, 16#80#, 16#1F#, 16#00#, 16#00#, 16#7E#, 16#1F#, 16#BF#,
16#0F#, 16#DF#, 16#07#, 16#CF#, 16#83#, 16#E7#, 16#C1#, 16#F7#, 16#E1#,
16#FB#, 16#F0#, 16#FD#, 16#F0#, 16#7C#, 16#F8#, 16#3E#, 16#7C#, 16#1F#,
16#3C#, 16#0F#, 16#1E#, 16#07#, 16#8E#, 16#03#, 16#87#, 16#01#, 16#C3#,
16#80#, 16#E0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#F8#, 16#00#, 16#00#,
16#78#, 16#07#, 16#C0#, 16#00#, 16#03#, 16#E0#, 16#1F#, 16#00#, 16#00#,
16#0F#, 16#80#, 16#78#, 16#00#, 16#00#, 16#7C#, 16#03#, 16#E0#, 16#00#,
16#01#, 16#F0#, 16#0F#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#7C#, 16#00#,
16#00#, 16#3E#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#F8#, 16#07#, 16#80#,
16#00#, 16#07#, 16#C0#, 16#3E#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#F8#,
16#00#, 16#00#, 16#7C#, 16#07#, 16#C0#, 16#01#, 16#FF#, 16#FF#, 16#FF#,
16#FC#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#F0#, 16#3F#, 16#FF#, 16#FF#,
16#FF#, 16#80#, 16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#07#, 16#C0#,
16#3C#, 16#00#, 16#00#, 16#1E#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#F8#,
16#07#, 16#80#, 16#00#, 16#03#, 16#C0#, 16#3E#, 16#00#, 16#00#, 16#1F#,
16#00#, 16#F8#, 16#00#, 16#00#, 16#7C#, 16#03#, 16#C0#, 16#00#, 16#01#,
16#E0#, 16#1F#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#78#, 16#00#, 16#00#,
16#3C#, 16#03#, 16#E0#, 16#00#, 16#01#, 16#F0#, 16#0F#, 16#80#, 16#00#,
16#07#, 16#C0#, 16#3C#, 16#00#, 16#00#, 16#1E#, 16#01#, 16#F0#, 16#00#,
16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 16#FC#,
16#07#, 16#FF#, 16#FF#, 16#FF#, 16#F0#, 16#1F#, 16#FF#, 16#FF#, 16#FF#,
16#C0#, 16#01#, 16#E0#, 16#1F#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#7C#,
16#00#, 16#00#, 16#3E#, 16#01#, 16#E0#, 16#00#, 16#01#, 16#F0#, 16#0F#,
16#80#, 16#00#, 16#07#, 16#C0#, 16#3C#, 16#00#, 16#00#, 16#1E#, 16#01#,
16#F0#, 16#00#, 16#00#, 16#F8#, 16#07#, 16#C0#, 16#00#, 16#03#, 16#C0#,
16#3E#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#7C#,
16#03#, 16#C0#, 16#00#, 16#01#, 16#E0#, 16#1F#, 16#00#, 16#00#, 16#0F#,
16#80#, 16#78#, 16#00#, 16#00#, 16#3C#, 16#03#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#C0#, 16#00#,
16#01#, 16#FF#, 16#FC#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#80#, 16#00#,
16#FF#, 16#FF#, 16#F0#, 16#00#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#3F#,
16#8F#, 16#3F#, 16#80#, 16#1F#, 16#83#, 16#87#, 16#F0#, 16#0F#, 16#C0#,
16#E0#, 16#FC#, 16#03#, 16#E0#, 16#78#, 16#1F#, 16#01#, 16#F0#, 16#1E#,
16#07#, 16#C0#, 16#7C#, 16#07#, 16#01#, 16#F0#, 16#1F#, 16#01#, 16#C0#,
16#7C#, 16#0F#, 16#80#, 16#70#, 16#1F#, 16#03#, 16#E0#, 16#3C#, 16#00#,
16#00#, 16#F8#, 16#0F#, 16#00#, 16#00#, 16#3E#, 16#03#, 16#80#, 16#00#,
16#0F#, 16#80#, 16#E0#, 16#00#, 16#03#, 16#F0#, 16#78#, 16#00#, 16#00#,
16#FE#, 16#1E#, 16#00#, 16#00#, 16#3F#, 16#C7#, 16#00#, 16#00#, 16#07#,
16#FF#, 16#C0#, 16#00#, 16#00#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#1F#,
16#FF#, 16#E0#, 16#00#, 16#03#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#3F#,
16#FF#, 16#C0#, 16#00#, 16#03#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#3F#,
16#FF#, 16#00#, 16#00#, 16#1E#, 16#7F#, 16#E0#, 16#00#, 16#07#, 16#87#,
16#F8#, 16#00#, 16#01#, 16#C0#, 16#FE#, 16#00#, 16#00#, 16#70#, 16#1F#,
16#80#, 16#00#, 16#1C#, 16#07#, 16#E0#, 16#00#, 16#0F#, 16#01#, 16#F8#,
16#F8#, 16#03#, 16#C0#, 16#7E#, 16#3E#, 16#00#, 16#E0#, 16#1F#, 16#8F#,
16#80#, 16#38#, 16#07#, 16#C3#, 16#E0#, 16#1E#, 16#03#, 16#F0#, 16#F8#,
16#07#, 16#80#, 16#FC#, 16#3E#, 16#01#, 16#C0#, 16#3E#, 16#0F#, 16#C0#,
16#70#, 16#1F#, 16#83#, 16#F8#, 16#1C#, 16#0F#, 16#C0#, 16#7F#, 16#0F#,
16#07#, 16#E0#, 16#1F#, 16#F3#, 16#CF#, 16#F0#, 16#03#, 16#FF#, 16#FF#,
16#F8#, 16#00#, 16#3F#, 16#FF#, 16#FC#, 16#00#, 16#07#, 16#FF#, 16#FC#,
16#00#, 16#00#, 16#3F#, 16#F8#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#,
16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#F0#, 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#F0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#01#, 16#E0#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#03#, 16#C0#,
16#01#, 16#FF#, 16#C0#, 16#00#, 16#03#, 16#80#, 16#03#, 16#FF#, 16#F0#,
16#00#, 16#07#, 16#80#, 16#07#, 16#FF#, 16#F8#, 16#00#, 16#0F#, 16#00#,
16#0F#, 16#C1#, 16#F8#, 16#00#, 16#1E#, 16#00#, 16#1F#, 16#00#, 16#7C#,
16#00#, 16#3C#, 16#00#, 16#3C#, 16#00#, 16#7C#, 16#00#, 16#38#, 16#00#,
16#7C#, 16#00#, 16#3C#, 16#00#, 16#78#, 16#00#, 16#78#, 16#00#, 16#3C#,
16#00#, 16#F0#, 16#00#, 16#F0#, 16#00#, 16#3C#, 16#01#, 16#E0#, 16#00#,
16#F0#, 16#00#, 16#3C#, 16#01#, 16#C0#, 16#00#, 16#F0#, 16#00#, 16#38#,
16#03#, 16#C0#, 16#00#, 16#F0#, 16#00#, 16#78#, 16#07#, 16#80#, 16#00#,
16#F0#, 16#00#, 16#F8#, 16#0F#, 16#00#, 16#00#, 16#F8#, 16#01#, 16#F0#,
16#1E#, 16#00#, 16#00#, 16#FC#, 16#03#, 16#E0#, 16#1C#, 16#00#, 16#00#,
16#7E#, 16#0F#, 16#C0#, 16#3C#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#80#,
16#78#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#1F#, 16#FE#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#01#,
16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#,
16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#7F#, 16#F0#,
16#00#, 16#00#, 16#1E#, 16#00#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#3C#,
16#01#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#78#, 16#03#, 16#F0#, 16#7E#,
16#00#, 16#00#, 16#70#, 16#07#, 16#C0#, 16#1F#, 16#00#, 16#00#, 16#F0#,
16#0F#, 16#00#, 16#1F#, 16#00#, 16#01#, 16#E0#, 16#1F#, 16#00#, 16#0F#,
16#00#, 16#03#, 16#C0#, 16#1E#, 16#00#, 16#0F#, 16#00#, 16#07#, 16#80#,
16#3C#, 16#00#, 16#0F#, 16#00#, 16#07#, 16#00#, 16#3C#, 16#00#, 16#0F#,
16#00#, 16#0F#, 16#00#, 16#3C#, 16#00#, 16#0E#, 16#00#, 16#1E#, 16#00#,
16#3C#, 16#00#, 16#1E#, 16#00#, 16#3C#, 16#00#, 16#3C#, 16#00#, 16#3E#,
16#00#, 16#38#, 16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#78#, 16#00#,
16#3F#, 16#00#, 16#F8#, 16#00#, 16#F0#, 16#00#, 16#1F#, 16#83#, 16#F0#,
16#01#, 16#E0#, 16#00#, 16#1F#, 16#FF#, 16#E0#, 16#03#, 16#C0#, 16#00#,
16#0F#, 16#FF#, 16#C0#, 16#03#, 16#80#, 16#00#, 16#07#, 16#FF#, 16#80#,
16#07#, 16#80#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#0F#,
16#E0#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#FF#,
16#FC#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#E0#, 16#00#, 16#03#, 16#F0#,
16#7F#, 16#00#, 16#00#, 16#7C#, 16#03#, 16#F0#, 16#00#, 16#0F#, 16#80#,
16#1F#, 16#00#, 16#00#, 16#F8#, 16#01#, 16#F0#, 16#00#, 16#1F#, 16#00#,
16#1F#, 16#00#, 16#01#, 16#F0#, 16#01#, 16#F0#, 16#00#, 16#1F#, 16#00#,
16#1F#, 16#00#, 16#01#, 16#F0#, 16#03#, 16#E0#, 16#00#, 16#1F#, 16#00#,
16#7E#, 16#00#, 16#01#, 16#F8#, 16#0F#, 16#C0#, 16#00#, 16#1F#, 16#81#,
16#F8#, 16#00#, 16#00#, 16#FC#, 16#3F#, 16#00#, 16#00#, 16#0F#, 16#EF#,
16#E0#, 16#00#, 16#00#, 16#7F#, 16#FC#, 16#00#, 16#00#, 16#07#, 16#FF#,
16#80#, 16#00#, 16#00#, 16#7F#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#F8#,
16#00#, 16#00#, 16#03#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#7F#, 16#FC#,
16#00#, 16#00#, 16#1F#, 16#EF#, 16#E0#, 16#1F#, 16#03#, 16#FC#, 16#7E#,
16#01#, 16#F0#, 16#7F#, 16#07#, 16#F0#, 16#3E#, 16#0F#, 16#E0#, 16#3F#,
16#03#, 16#E1#, 16#F8#, 16#01#, 16#F8#, 16#7E#, 16#3F#, 16#00#, 16#1F#,
16#C7#, 16#C3#, 16#F0#, 16#00#, 16#FC#, 16#FC#, 16#7E#, 16#00#, 16#0F#,
16#FF#, 16#87#, 16#E0#, 16#00#, 16#7F#, 16#F0#, 16#7C#, 16#00#, 16#07#,
16#FF#, 16#0F#, 16#C0#, 16#00#, 16#3F#, 16#E0#, 16#FC#, 16#00#, 16#01#,
16#FC#, 16#0F#, 16#C0#, 16#00#, 16#1F#, 16#C0#, 16#FC#, 16#00#, 16#03#,
16#FE#, 16#0F#, 16#E0#, 16#00#, 16#7F#, 16#E0#, 16#FE#, 16#00#, 16#0F#,
16#FF#, 16#0F#, 16#F0#, 16#03#, 16#FF#, 16#F0#, 16#7F#, 16#C0#, 16#FF#,
16#3F#, 16#87#, 16#FF#, 16#FF#, 16#E1#, 16#F8#, 16#3F#, 16#FF#, 16#FC#,
16#1F#, 16#C1#, 16#FF#, 16#FF#, 16#00#, 16#FE#, 16#07#, 16#FF#, 16#C0#,
16#0F#, 16#E0#, 16#1F#, 16#E0#, 16#00#, 16#00#, 16#7E#, 16#FD#, 16#F3#,
16#E7#, 16#DF#, 16#BF#, 16#7C#, 16#F9#, 16#F3#, 16#C7#, 16#8E#, 16#1C#,
16#38#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#07#, 16#80#, 16#00#,
16#78#, 16#00#, 16#07#, 16#80#, 16#00#, 16#3C#, 16#00#, 16#03#, 16#C0#,
16#00#, 16#3C#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#1E#, 16#00#, 16#01#,
16#E0#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#0F#, 16#80#,
16#00#, 16#F8#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#7C#, 16#00#, 16#03#,
16#E0#, 16#00#, 16#3E#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#1F#, 16#00#,
16#00#, 16#F8#, 16#00#, 16#07#, 16#80#, 16#00#, 16#7C#, 16#00#, 16#03#,
16#E0#, 16#00#, 16#3E#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#0F#, 16#80#,
16#00#, 16#FC#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#3E#, 16#00#, 16#01#,
16#F0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#FC#, 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#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#F0#, 16#00#,
16#0F#, 16#80#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#0F#,
16#00#, 16#00#, 16#7C#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#1F#, 16#00#,
16#00#, 16#78#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#1F#, 16#00#, 16#00#,
16#78#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#78#,
16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#01#, 16#E0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#3C#, 16#00#,
16#01#, 16#F0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#3C#, 16#00#, 16#01#,
16#F0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#E0#,
16#00#, 16#0F#, 16#00#, 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#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#0F#,
16#C0#, 16#00#, 16#7E#, 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#7C#, 16#00#, 16#03#,
16#E0#, 16#00#, 16#1F#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#0F#, 16#80#,
16#00#, 16#7C#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#3E#, 16#00#, 16#01#,
16#F0#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#0F#, 16#80#,
16#00#, 16#7C#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#3E#, 16#00#, 16#03#,
16#E0#, 16#00#, 16#1E#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#F0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#78#, 16#00#, 16#07#,
16#80#, 16#00#, 16#78#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#3C#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#,
16#0F#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#78#, 16#00#, 16#0F#, 16#00#,
16#C1#, 16#E0#, 16#9E#, 16#38#, 16#F7#, 16#FF#, 16#FE#, 16#FF#, 16#FF#,
16#E7#, 16#FF#, 16#F0#, 16#0F#, 16#C0#, 16#03#, 16#F8#, 16#00#, 16#FF#,
16#80#, 16#3E#, 16#F0#, 16#0F#, 16#9F#, 16#03#, 16#E1#, 16#E0#, 16#78#,
16#3E#, 16#06#, 16#03#, 16#00#, 16#00#, 16#40#, 16#00#, 16#00#, 16#00#,
16#78#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#,
16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#,
16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#C0#,
16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#07#,
16#FF#, 16#FF#, 16#FF#, 16#EF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#,
16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#,
16#FC#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#,
16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#01#,
16#E0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#80#,
16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#,
16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#,
16#C0#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#1F#, 16#C7#,
16#F1#, 16#F8#, 16#7E#, 16#3F#, 16#8F#, 16#E0#, 16#38#, 16#1C#, 16#07#,
16#01#, 16#C0#, 16#E0#, 16#38#, 16#1C#, 16#3E#, 16#0E#, 16#00#, 16#7F#,
16#FF#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#FF#, 16#FE#,
16#7F#, 16#7F#, 16#7E#, 16#7E#, 16#FE#, 16#FE#, 16#00#, 16#00#, 16#00#,
16#70#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#,
16#00#, 16#0C#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#18#,
16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#,
16#07#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#0E#, 16#00#,
16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#03#,
16#80#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#,
16#00#, 16#60#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#C0#,
16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#,
16#38#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#,
16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#1C#,
16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#,
16#03#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#06#, 16#00#,
16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#01#,
16#C0#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#,
16#00#, 16#70#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#E0#,
16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#,
16#18#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#30#, 16#00#,
16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#E0#, 16#00#,
16#0F#, 16#FF#, 16#F0#, 16#00#, 16#1F#, 16#FF#, 16#F8#, 16#00#, 16#3F#,
16#FF#, 16#FC#, 16#00#, 16#7F#, 16#83#, 16#FC#, 16#00#, 16#FE#, 16#00#,
16#FE#, 16#01#, 16#FC#, 16#00#, 16#7E#, 16#01#, 16#F8#, 16#00#, 16#7F#,
16#03#, 16#F0#, 16#00#, 16#7F#, 16#07#, 16#E0#, 16#00#, 16#3F#, 16#07#,
16#E0#, 16#00#, 16#3F#, 16#0F#, 16#C0#, 16#00#, 16#3F#, 16#0F#, 16#C0#,
16#00#, 16#3F#, 16#0F#, 16#80#, 16#00#, 16#3F#, 16#1F#, 16#80#, 16#00#,
16#3F#, 16#1F#, 16#80#, 16#00#, 16#3F#, 16#1F#, 16#80#, 16#00#, 16#3E#,
16#3F#, 16#00#, 16#00#, 16#7E#, 16#3F#, 16#00#, 16#00#, 16#7E#, 16#3F#,
16#00#, 16#00#, 16#7E#, 16#3F#, 16#00#, 16#00#, 16#7E#, 16#7E#, 16#00#,
16#00#, 16#7E#, 16#7E#, 16#00#, 16#00#, 16#FC#, 16#7E#, 16#00#, 16#00#,
16#FC#, 16#7E#, 16#00#, 16#00#, 16#FC#, 16#7E#, 16#00#, 16#00#, 16#FC#,
16#FC#, 16#00#, 16#00#, 16#FC#, 16#FC#, 16#00#, 16#01#, 16#F8#, 16#FC#,
16#00#, 16#01#, 16#F8#, 16#FC#, 16#00#, 16#01#, 16#F8#, 16#FC#, 16#00#,
16#03#, 16#F0#, 16#FC#, 16#00#, 16#03#, 16#F0#, 16#FC#, 16#00#, 16#03#,
16#F0#, 16#FC#, 16#00#, 16#07#, 16#E0#, 16#FC#, 16#00#, 16#07#, 16#E0#,
16#FC#, 16#00#, 16#0F#, 16#C0#, 16#FE#, 16#00#, 16#1F#, 16#80#, 16#7E#,
16#00#, 16#3F#, 16#80#, 16#7F#, 16#00#, 16#7F#, 16#00#, 16#7F#, 16#C1#,
16#FE#, 16#00#, 16#3F#, 16#FF#, 16#FC#, 16#00#, 16#1F#, 16#FF#, 16#F8#,
16#00#, 16#0F#, 16#FF#, 16#F0#, 16#00#, 16#07#, 16#FF#, 16#C0#, 16#00#,
16#00#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#F0#,
16#00#, 16#78#, 16#00#, 16#1E#, 16#00#, 16#0F#, 16#80#, 16#07#, 16#E0#,
16#03#, 16#F8#, 16#03#, 16#FC#, 16#0F#, 16#FF#, 16#3F#, 16#FF#, 16#CF#,
16#FF#, 16#F3#, 16#FF#, 16#FC#, 16#FF#, 16#FE#, 16#00#, 16#0F#, 16#80#,
16#03#, 16#E0#, 16#00#, 16#F8#, 16#00#, 16#7E#, 16#00#, 16#1F#, 16#00#,
16#07#, 16#C0#, 16#01#, 16#F0#, 16#00#, 16#7C#, 16#00#, 16#3F#, 16#00#,
16#0F#, 16#80#, 16#03#, 16#E0#, 16#00#, 16#F8#, 16#00#, 16#3E#, 16#00#,
16#1F#, 16#80#, 16#07#, 16#C0#, 16#01#, 16#F0#, 16#00#, 16#7C#, 16#00#,
16#3F#, 16#00#, 16#0F#, 16#C0#, 16#03#, 16#E0#, 16#00#, 16#F8#, 16#00#,
16#3E#, 16#00#, 16#1F#, 16#80#, 16#07#, 16#E0#, 16#01#, 16#F0#, 16#00#,
16#7C#, 16#00#, 16#3F#, 16#00#, 16#0F#, 16#C0#, 16#03#, 16#F0#, 16#00#,
16#F8#, 16#00#, 16#3E#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#00#,
16#1F#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#F0#, 16#00#, 16#00#,
16#FF#, 16#FF#, 16#E0#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 16#80#, 16#00#,
16#FF#, 16#FF#, 16#FE#, 16#00#, 16#0F#, 16#F8#, 16#0F#, 16#F0#, 16#00#,
16#FF#, 16#00#, 16#3F#, 16#C0#, 16#07#, 16#E0#, 16#00#, 16#7E#, 16#00#,
16#7E#, 16#00#, 16#03#, 16#F8#, 16#03#, 16#F0#, 16#00#, 16#0F#, 16#C0#,
16#3F#, 16#00#, 16#00#, 16#7E#, 16#01#, 16#F8#, 16#00#, 16#03#, 16#F0#,
16#1F#, 16#80#, 16#00#, 16#1F#, 16#80#, 16#FC#, 16#00#, 16#00#, 16#FC#,
16#07#, 16#C0#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#7E#,
16#00#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#3F#,
16#00#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#3F#,
16#80#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#3F#,
16#80#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#FF#,
16#80#, 16#00#, 16#00#, 16#1F#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#FF#,
16#00#, 16#00#, 16#00#, 16#7F#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#FC#,
16#00#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#1F#, 16#F8#,
16#00#, 16#00#, 16#03#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#E0#,
16#00#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#80#,
16#00#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#80#,
16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#80#,
16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#FC#, 16#03#, 16#FF#,
16#FF#, 16#FF#, 16#E0#, 16#3F#, 16#FF#, 16#FF#, 16#FF#, 16#01#, 16#FF#,
16#FF#, 16#FF#, 16#F8#, 16#0F#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#00#,
16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#7F#, 16#FE#, 16#00#,
16#00#, 16#7F#, 16#FF#, 16#E0#, 16#00#, 16#7F#, 16#FF#, 16#FC#, 16#00#,
16#3F#, 16#FF#, 16#FF#, 16#80#, 16#0F#, 16#F0#, 16#3F#, 16#E0#, 16#07#,
16#F0#, 16#03#, 16#FC#, 16#03#, 16#F0#, 16#00#, 16#7F#, 16#01#, 16#F8#,
16#00#, 16#0F#, 16#C0#, 16#7E#, 16#00#, 16#03#, 16#F0#, 16#1F#, 16#00#,
16#00#, 16#FC#, 16#0F#, 16#C0#, 16#00#, 16#3F#, 16#03#, 16#E0#, 16#00#,
16#0F#, 16#C0#, 16#F8#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#01#,
16#F8#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#7F#,
16#00#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#7F#, 16#C0#,
16#00#, 16#07#, 16#FF#, 16#E0#, 16#00#, 16#01#, 16#FF#, 16#E0#, 16#00#,
16#00#, 16#7F#, 16#F0#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#00#, 16#00#,
16#0F#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#,
16#00#, 16#7F#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#00#,
16#01#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#00#,
16#1F#, 16#80#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#01#,
16#F8#, 16#FC#, 16#00#, 16#00#, 16#7E#, 16#3F#, 16#00#, 16#00#, 16#3F#,
16#0F#, 16#C0#, 16#00#, 16#0F#, 16#C3#, 16#F0#, 16#00#, 16#03#, 16#F0#,
16#FC#, 16#00#, 16#01#, 16#F8#, 16#3F#, 16#80#, 16#00#, 16#FE#, 16#0F#,
16#E0#, 16#00#, 16#7F#, 16#01#, 16#FC#, 16#00#, 16#3F#, 16#80#, 16#7F#,
16#C0#, 16#7F#, 16#C0#, 16#0F#, 16#FF#, 16#FF#, 16#E0#, 16#03#, 16#FF#,
16#FF#, 16#F0#, 16#00#, 16#7F#, 16#FF#, 16#F8#, 16#00#, 16#07#, 16#FF#,
16#F8#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#,
16#3E#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#FE#,
16#00#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#00#, 16#03#, 16#FC#, 16#00#,
16#00#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#0F#, 16#FC#, 16#00#, 16#00#,
16#1F#, 16#F8#, 16#00#, 16#00#, 16#3F#, 16#F8#, 16#00#, 16#00#, 16#7E#,
16#F8#, 16#00#, 16#00#, 16#FC#, 16#F8#, 16#00#, 16#01#, 16#F9#, 16#F8#,
16#00#, 16#03#, 16#F1#, 16#F0#, 16#00#, 16#07#, 16#E1#, 16#F0#, 16#00#,
16#0F#, 16#C1#, 16#F0#, 16#00#, 16#1F#, 16#81#, 16#F0#, 16#00#, 16#3F#,
16#03#, 16#E0#, 16#00#, 16#7E#, 16#03#, 16#E0#, 16#00#, 16#FC#, 16#03#,
16#E0#, 16#00#, 16#F8#, 16#03#, 16#E0#, 16#01#, 16#F0#, 16#07#, 16#C0#,
16#03#, 16#E0#, 16#07#, 16#C0#, 16#07#, 16#C0#, 16#07#, 16#C0#, 16#0F#,
16#80#, 16#07#, 16#C0#, 16#1F#, 16#00#, 16#0F#, 16#C0#, 16#3E#, 16#00#,
16#0F#, 16#80#, 16#7E#, 16#00#, 16#0F#, 16#80#, 16#7F#, 16#FF#, 16#FF#,
16#FF#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#7F#, 16#FF#, 16#FF#, 16#FF#,
16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#00#,
16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#,
16#3F#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#3E#,
16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#,
16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#,
16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#0F#,
16#FF#, 16#FF#, 16#E0#, 16#00#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#0F#,
16#FF#, 16#FF#, 16#E0#, 16#01#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#1F#,
16#FF#, 16#FF#, 16#E0#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#3E#,
16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#7C#,
16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#7C#,
16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#F8#,
16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#01#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#1F#, 16#0F#, 16#F0#, 16#00#, 16#01#, 16#E3#,
16#FF#, 16#E0#, 16#00#, 16#3E#, 16#FF#, 16#FF#, 16#00#, 16#03#, 16#FF#,
16#FF#, 16#F8#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#C0#, 16#07#, 16#FE#,
16#07#, 16#FE#, 16#00#, 16#7F#, 16#00#, 16#1F#, 16#E0#, 16#0F#, 16#E0#,
16#00#, 16#FF#, 16#00#, 16#FC#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#FC#, 16#00#,
16#00#, 16#FC#, 16#0F#, 16#C0#, 16#00#, 16#0F#, 16#C0#, 16#FC#, 16#00#,
16#01#, 16#F8#, 16#0F#, 16#E0#, 16#00#, 16#3F#, 16#00#, 16#FE#, 16#00#,
16#07#, 16#F0#, 16#07#, 16#F0#, 16#00#, 16#FE#, 16#00#, 16#7F#, 16#C0#,
16#7F#, 16#C0#, 16#03#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#1F#, 16#FF#,
16#FF#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#03#, 16#FF#,
16#F0#, 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#FF#, 16#F8#, 16#00#, 16#01#, 16#FF#,
16#FE#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#C0#, 16#03#, 16#FF#, 16#FF#,
16#E0#, 16#03#, 16#FE#, 16#0F#, 16#F8#, 16#01#, 16#FC#, 16#01#, 16#FC#,
16#01#, 16#F8#, 16#00#, 16#7F#, 16#01#, 16#F8#, 16#00#, 16#3F#, 16#81#,
16#FC#, 16#00#, 16#0F#, 16#C0#, 16#FC#, 16#00#, 16#07#, 16#E0#, 16#FC#,
16#00#, 16#03#, 16#F0#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#00#,
16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#,
16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#FE#, 16#00#,
16#07#, 16#E1#, 16#FF#, 16#E0#, 16#07#, 16#E3#, 16#FF#, 16#F8#, 16#03#,
16#F3#, 16#FF#, 16#FE#, 16#01#, 16#FB#, 16#FF#, 16#FF#, 16#80#, 16#FF#,
16#F0#, 16#3F#, 16#E0#, 16#FF#, 16#E0#, 16#07#, 16#F0#, 16#7F#, 16#C0#,
16#01#, 16#FC#, 16#3F#, 16#C0#, 16#00#, 16#FE#, 16#1F#, 16#C0#, 16#00#,
16#3F#, 16#0F#, 16#E0#, 16#00#, 16#1F#, 16#8F#, 16#E0#, 16#00#, 16#0F#,
16#C7#, 16#F0#, 16#00#, 16#07#, 16#E3#, 16#F0#, 16#00#, 16#03#, 16#F1#,
16#F8#, 16#00#, 16#01#, 16#F0#, 16#FC#, 16#00#, 16#01#, 16#F8#, 16#7E#,
16#00#, 16#00#, 16#FC#, 16#3F#, 16#00#, 16#00#, 16#7C#, 16#1F#, 16#80#,
16#00#, 16#7E#, 16#0F#, 16#C0#, 16#00#, 16#3E#, 16#07#, 16#F0#, 16#00#,
16#3F#, 16#01#, 16#FC#, 16#00#, 16#3F#, 16#00#, 16#FF#, 16#00#, 16#7F#,
16#80#, 16#3F#, 16#C0#, 16#FF#, 16#80#, 16#1F#, 16#FF#, 16#FF#, 16#80#,
16#07#, 16#FF#, 16#FF#, 16#80#, 16#01#, 16#FF#, 16#FF#, 16#00#, 16#00#,
16#3F#, 16#FF#, 16#00#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#1F#,
16#FF#, 16#FF#, 16#FF#, 16#8F#, 16#FF#, 16#FF#, 16#FF#, 16#C7#, 16#FF#,
16#FF#, 16#FF#, 16#E3#, 16#FF#, 16#FF#, 16#FF#, 16#E3#, 16#FF#, 16#FF#,
16#FF#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#01#,
16#F0#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#01#, 16#F8#,
16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#,
16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#,
16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#00#,
16#FC#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#7C#,
16#00#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#00#,
16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#,
16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#,
16#1F#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#1F#,
16#80#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#C0#,
16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#,
16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#,
16#03#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#01#,
16#F8#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#FC#,
16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#00#,
16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#,
16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#,
16#0F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#C0#,
16#00#, 16#00#, 16#7F#, 16#FE#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#E0#,
16#00#, 16#7F#, 16#FF#, 16#FC#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#00#,
16#1F#, 16#F0#, 16#3F#, 16#E0#, 16#07#, 16#F0#, 16#03#, 16#F8#, 16#03#,
16#F8#, 16#00#, 16#7F#, 16#01#, 16#FC#, 16#00#, 16#0F#, 16#C0#, 16#7E#,
16#00#, 16#03#, 16#F0#, 16#1F#, 16#80#, 16#00#, 16#FC#, 16#0F#, 16#C0#,
16#00#, 16#3F#, 16#03#, 16#F0#, 16#00#, 16#0F#, 16#C0#, 16#FC#, 16#00#,
16#07#, 16#E0#, 16#3F#, 16#00#, 16#01#, 16#F8#, 16#0F#, 16#C0#, 16#00#,
16#FC#, 16#03#, 16#F8#, 16#00#, 16#7F#, 16#00#, 16#FF#, 16#00#, 16#3F#,
16#80#, 16#1F#, 16#E0#, 16#3F#, 16#C0#, 16#03#, 16#FF#, 16#FF#, 16#C0#,
16#00#, 16#7F#, 16#FF#, 16#E0#, 16#00#, 16#0F#, 16#FF#, 16#F0#, 16#00#,
16#0F#, 16#FF#, 16#FE#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 16#C0#, 16#07#,
16#FC#, 16#07#, 16#F8#, 16#03#, 16#F8#, 16#00#, 16#FF#, 16#01#, 16#FC#,
16#00#, 16#0F#, 16#C0#, 16#FE#, 16#00#, 16#03#, 16#F8#, 16#3F#, 16#00#,
16#00#, 16#7E#, 16#1F#, 16#80#, 16#00#, 16#1F#, 16#87#, 16#E0#, 16#00#,
16#07#, 16#E3#, 16#F0#, 16#00#, 16#01#, 16#F8#, 16#FC#, 16#00#, 16#00#,
16#7E#, 16#3F#, 16#00#, 16#00#, 16#1F#, 16#0F#, 16#C0#, 16#00#, 16#0F#,
16#C3#, 16#F0#, 16#00#, 16#03#, 16#F0#, 16#FC#, 16#00#, 16#01#, 16#F8#,
16#3F#, 16#80#, 16#00#, 16#FE#, 16#0F#, 16#E0#, 16#00#, 16#7F#, 16#01#,
16#FE#, 16#00#, 16#3F#, 16#80#, 16#7F#, 16#C0#, 16#7F#, 16#E0#, 16#0F#,
16#FF#, 16#FF#, 16#F0#, 16#01#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#3F#,
16#FF#, 16#F8#, 16#00#, 16#03#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#1F#,
16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#03#,
16#FF#, 16#F0#, 16#00#, 16#07#, 16#FF#, 16#FE#, 16#00#, 16#07#, 16#FF#,
16#FF#, 16#80#, 16#07#, 16#FF#, 16#FF#, 16#E0#, 16#07#, 16#FC#, 16#0F#,
16#F0#, 16#07#, 16#F8#, 16#03#, 16#FC#, 16#07#, 16#F0#, 16#00#, 16#FE#,
16#03#, 16#F0#, 16#00#, 16#3F#, 16#83#, 16#F0#, 16#00#, 16#0F#, 16#C1#,
16#F8#, 16#00#, 16#07#, 16#E1#, 16#F8#, 16#00#, 16#03#, 16#F0#, 16#FC#,
16#00#, 16#01#, 16#F8#, 16#7C#, 16#00#, 16#00#, 16#FC#, 16#7E#, 16#00#,
16#00#, 16#7E#, 16#3F#, 16#00#, 16#00#, 16#3F#, 16#1F#, 16#80#, 16#00#,
16#3F#, 16#8F#, 16#C0#, 16#00#, 16#1F#, 16#C7#, 16#E0#, 16#00#, 16#1F#,
16#C3#, 16#F0#, 16#00#, 16#0F#, 16#E1#, 16#FC#, 16#00#, 16#0F#, 16#F0#,
16#FE#, 16#00#, 16#0F#, 16#F8#, 16#3F#, 16#80#, 16#1F#, 16#FC#, 16#1F#,
16#F0#, 16#3F#, 16#FE#, 16#07#, 16#FF#, 16#FF#, 16#7E#, 16#01#, 16#FF#,
16#FF#, 16#3F#, 16#00#, 16#7F#, 16#FF#, 16#1F#, 16#80#, 16#1F#, 16#FE#,
16#1F#, 16#C0#, 16#03#, 16#FC#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#07#,
16#E0#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#F0#,
16#00#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#,
16#00#, 16#00#, 16#FC#, 16#1F#, 16#80#, 16#00#, 16#FC#, 16#0F#, 16#C0#,
16#00#, 16#FE#, 16#07#, 16#E0#, 16#00#, 16#FE#, 16#03#, 16#F8#, 16#00#,
16#7E#, 16#00#, 16#FE#, 16#00#, 16#FF#, 16#00#, 16#7F#, 16#81#, 16#FF#,
16#00#, 16#1F#, 16#FF#, 16#FF#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 16#00#,
16#03#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#7F#, 16#FC#, 16#00#, 16#00#,
16#07#, 16#F8#, 16#00#, 16#00#, 16#01#, 16#FC#, 16#07#, 16#F0#, 16#1F#,
16#80#, 16#7E#, 16#03#, 16#F8#, 16#0F#, 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#1F#, 16#C0#, 16#7F#,
16#01#, 16#F8#, 16#07#, 16#E0#, 16#3F#, 16#80#, 16#FE#, 16#00#, 16#00#,
16#7F#, 16#00#, 16#7F#, 16#00#, 16#7E#, 16#00#, 16#7E#, 16#00#, 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#1F#,
16#C0#, 16#1F#, 16#C0#, 16#1F#, 16#80#, 16#1F#, 16#80#, 16#3F#, 16#80#,
16#3F#, 16#80#, 16#03#, 16#80#, 16#07#, 16#00#, 16#07#, 16#00#, 16#07#,
16#00#, 16#0E#, 16#00#, 16#0E#, 16#00#, 16#1C#, 16#00#, 16#F8#, 16#00#,
16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#,
16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#,
16#3F#, 16#E0#, 16#00#, 16#00#, 16#3F#, 16#FC#, 16#00#, 16#00#, 16#1F#,
16#FC#, 16#00#, 16#00#, 16#1F#, 16#FE#, 16#00#, 16#00#, 16#0F#, 16#FE#,
16#00#, 16#00#, 16#0F#, 16#FF#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#00#,
16#00#, 16#07#, 16#FF#, 16#80#, 16#00#, 16#07#, 16#FF#, 16#80#, 16#00#,
16#03#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#FF#, 16#C0#, 16#00#, 16#00#,
16#1F#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#00#, 16#00#,
16#7F#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#00#, 16#00#, 16#00#,
16#3F#, 16#F8#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#C0#, 16#00#, 16#00#,
16#0F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#F8#, 16#00#, 16#00#,
16#03#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#FE#, 16#00#, 16#00#,
16#00#, 16#7F#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#80#, 16#00#,
16#00#, 16#1F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#,
16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#1F#,
16#FF#, 16#FF#, 16#FF#, 16#8F#, 16#FF#, 16#FF#, 16#FF#, 16#CF#, 16#FF#,
16#FF#, 16#FF#, 16#E7#, 16#FF#, 16#FF#, 16#FF#, 16#F3#, 16#FF#, 16#FF#,
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#1F#,
16#FF#, 16#FF#, 16#FF#, 16#CF#, 16#FF#, 16#FF#, 16#FF#, 16#E7#, 16#FF#,
16#FF#, 16#FF#, 16#F3#, 16#FF#, 16#FF#, 16#FF#, 16#F1#, 16#FF#, 16#FF#,
16#FF#, 16#F8#, 16#03#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#,
16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#FE#, 16#00#,
16#00#, 16#00#, 16#7F#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#80#,
16#00#, 16#00#, 16#1F#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#F0#,
16#00#, 16#00#, 16#07#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#3F#, 16#FC#,
16#00#, 16#00#, 16#00#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#FF#,
16#00#, 16#00#, 16#00#, 16#3F#, 16#FC#, 16#00#, 16#00#, 16#01#, 16#FF#,
16#80#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#FE#,
16#00#, 16#00#, 16#00#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#7F#, 16#F0#,
16#00#, 16#00#, 16#7F#, 16#F8#, 16#00#, 16#00#, 16#7F#, 16#F8#, 16#00#,
16#00#, 16#3F#, 16#FC#, 16#00#, 16#00#, 16#3F#, 16#FC#, 16#00#, 16#00#,
16#1F#, 16#FC#, 16#00#, 16#00#, 16#1F#, 16#FE#, 16#00#, 16#00#, 16#0F#,
16#FE#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#00#, 16#00#, 16#01#, 16#FF#,
16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#,
16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#0F#, 16#F8#, 16#00#, 16#07#, 16#FF#, 16#E0#, 16#01#, 16#FF#, 16#FF#,
16#80#, 16#3F#, 16#FF#, 16#FC#, 16#07#, 16#FF#, 16#FF#, 16#C0#, 16#FF#,
16#03#, 16#FE#, 16#1F#, 16#C0#, 16#0F#, 16#E3#, 16#F8#, 16#00#, 16#7F#,
16#3F#, 16#00#, 16#03#, 16#F7#, 16#F0#, 16#00#, 16#3F#, 16#7E#, 16#00#,
16#03#, 16#F7#, 16#E0#, 16#00#, 16#3F#, 16#FC#, 16#00#, 16#03#, 16#FF#,
16#C0#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#,
16#FE#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#01#, 16#FC#, 16#00#,
16#00#, 16#3F#, 16#80#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#01#, 16#FE#,
16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#01#,
16#FE#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#07#, 16#F8#, 16#00#,
16#00#, 16#7E#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#01#, 16#FC#,
16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#,
16#3F#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#3F#, 16#00#,
16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#0F#, 16#C0#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#,
16#0F#, 16#80#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#1F#, 16#80#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#,
16#3F#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#,
16#FF#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#F0#, 16#03#,
16#FF#, 16#C0#, 16#00#, 16#00#, 16#7F#, 16#F0#, 16#00#, 16#07#, 16#FE#,
16#00#, 16#00#, 16#1F#, 16#F8#, 16#00#, 16#00#, 16#1F#, 16#F0#, 16#00#,
16#03#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#7F#,
16#C0#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#0F#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#1F#, 16#C0#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#00#,
16#00#, 16#FC#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#07#,
16#E0#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#00#,
16#FE#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#03#, 16#E0#, 16#1F#, 16#C0#,
16#00#, 16#FF#, 16#E0#, 16#F8#, 16#3F#, 16#01#, 16#F8#, 16#00#, 16#3F#,
16#FF#, 16#1F#, 16#03#, 16#F0#, 16#3F#, 16#80#, 16#07#, 16#FF#, 16#F9#,
16#F0#, 16#1F#, 16#07#, 16#F0#, 16#00#, 16#FE#, 16#0F#, 16#BE#, 16#01#,
16#F0#, 16#7E#, 16#00#, 16#3F#, 16#80#, 16#3F#, 16#E0#, 16#1F#, 16#0F#,
16#C0#, 16#07#, 16#F0#, 16#03#, 16#FC#, 16#01#, 16#F0#, 16#FC#, 16#00#,
16#FE#, 16#00#, 16#3F#, 16#C0#, 16#1F#, 16#1F#, 16#80#, 16#0F#, 16#C0#,
16#03#, 16#F8#, 16#01#, 16#F1#, 16#F8#, 16#01#, 16#F8#, 16#00#, 16#3F#,
16#80#, 16#1F#, 16#3F#, 16#00#, 16#3F#, 16#00#, 16#03#, 16#F0#, 16#03#,
16#F3#, 16#F0#, 16#03#, 16#F0#, 16#00#, 16#3F#, 16#00#, 16#3E#, 16#7E#,
16#00#, 16#7E#, 16#00#, 16#07#, 16#E0#, 16#03#, 16#E7#, 16#E0#, 16#0F#,
16#C0#, 16#00#, 16#7C#, 16#00#, 16#3E#, 16#7E#, 16#00#, 16#FC#, 16#00#,
16#0F#, 16#C0#, 16#07#, 16#E7#, 16#E0#, 16#0F#, 16#C0#, 16#00#, 16#F8#,
16#00#, 16#7C#, 16#FC#, 16#01#, 16#F8#, 16#00#, 16#0F#, 16#80#, 16#0F#,
16#CF#, 16#C0#, 16#1F#, 16#80#, 16#01#, 16#F0#, 16#01#, 16#F8#, 16#FC#,
16#01#, 16#F8#, 16#00#, 16#3F#, 16#00#, 16#1F#, 16#8F#, 16#C0#, 16#1F#,
16#80#, 16#03#, 16#E0#, 16#03#, 16#F0#, 16#FC#, 16#01#, 16#F8#, 16#00#,
16#7E#, 16#00#, 16#7E#, 16#0F#, 16#C0#, 16#1F#, 16#80#, 16#0F#, 16#C0#,
16#0F#, 16#E0#, 16#FC#, 16#01#, 16#FC#, 16#01#, 16#FC#, 16#01#, 16#FC#,
16#0F#, 16#C0#, 16#1F#, 16#C0#, 16#3F#, 16#C0#, 16#7F#, 16#80#, 16#FC#,
16#00#, 16#FF#, 16#0F#, 16#FE#, 16#1F#, 16#E0#, 16#0F#, 16#E0#, 16#0F#,
16#FF#, 16#F7#, 16#FF#, 16#FC#, 16#00#, 16#7E#, 16#00#, 16#7F#, 16#FC#,
16#7F#, 16#FF#, 16#00#, 16#07#, 16#E0#, 16#03#, 16#FF#, 16#83#, 16#FF#,
16#E0#, 16#00#, 16#7F#, 16#00#, 16#0F#, 16#E0#, 16#1F#, 16#F0#, 16#00#,
16#03#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#,
16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FC#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#3F#, 16#F8#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#01#,
16#FF#, 16#F0#, 16#01#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#,
16#FF#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#,
16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#03#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#FF#,
16#C0#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#01#,
16#FF#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#E0#, 16#00#, 16#00#,
16#03#, 16#EF#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#EF#, 16#E0#, 16#00#,
16#00#, 16#0F#, 16#CF#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#CF#, 16#E0#,
16#00#, 16#00#, 16#1F#, 16#87#, 16#E0#, 16#00#, 16#00#, 16#1F#, 16#87#,
16#F0#, 16#00#, 16#00#, 16#3F#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#3E#,
16#07#, 16#F0#, 16#00#, 16#00#, 16#7E#, 16#07#, 16#F0#, 16#00#, 16#00#,
16#FC#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#FC#, 16#03#, 16#F0#, 16#00#,
16#01#, 16#F8#, 16#03#, 16#F8#, 16#00#, 16#01#, 16#F0#, 16#03#, 16#F8#,
16#00#, 16#03#, 16#F0#, 16#03#, 16#F8#, 16#00#, 16#03#, 16#E0#, 16#03#,
16#F8#, 16#00#, 16#07#, 16#E0#, 16#03#, 16#F8#, 16#00#, 16#07#, 16#C0#,
16#03#, 16#F8#, 16#00#, 16#0F#, 16#C0#, 16#01#, 16#F8#, 16#00#, 16#1F#,
16#80#, 16#01#, 16#FC#, 16#00#, 16#1F#, 16#00#, 16#01#, 16#FC#, 16#00#,
16#3F#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#FC#,
16#00#, 16#7F#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#7F#, 16#FF#, 16#FF#,
16#FC#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#01#, 16#F8#, 16#00#,
16#00#, 16#FE#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#FE#, 16#03#, 16#F0#,
16#00#, 16#00#, 16#FE#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#FE#, 16#07#,
16#E0#, 16#00#, 16#00#, 16#FE#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#FE#,
16#0F#, 16#C0#, 16#00#, 16#00#, 16#7F#, 16#1F#, 16#C0#, 16#00#, 16#00#,
16#7F#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#7F#, 16#3F#, 16#00#, 16#00#,
16#00#, 16#7F#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#7E#, 16#00#,
16#00#, 16#00#, 16#7F#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FC#,
16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#00#,
16#00#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#01#, 16#FF#, 16#FF#, 16#FF#,
16#C0#, 16#03#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#07#, 16#FF#, 16#FF#,
16#FF#, 16#C0#, 16#1F#, 16#C0#, 16#00#, 16#FF#, 16#80#, 16#3F#, 16#00#,
16#00#, 16#7F#, 16#80#, 16#7E#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#FC#,
16#00#, 16#00#, 16#7E#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#FC#, 16#07#,
16#F0#, 16#00#, 16#01#, 16#F8#, 16#0F#, 16#C0#, 16#00#, 16#03#, 16#F0#,
16#1F#, 16#80#, 16#00#, 16#07#, 16#E0#, 16#3F#, 16#00#, 16#00#, 16#0F#,
16#80#, 16#7E#, 16#00#, 16#00#, 16#3F#, 16#01#, 16#F8#, 16#00#, 16#00#,
16#7E#, 16#03#, 16#F0#, 16#00#, 16#01#, 16#F8#, 16#07#, 16#E0#, 16#00#,
16#07#, 16#E0#, 16#0F#, 16#C0#, 16#00#, 16#1F#, 16#C0#, 16#1F#, 16#80#,
16#00#, 16#FF#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#FF#,
16#FF#, 16#FF#, 16#E0#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#03#,
16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#0F#, 16#FF#, 16#FF#, 16#FF#, 16#E0#,
16#1F#, 16#80#, 16#00#, 16#1F#, 16#E0#, 16#3F#, 16#00#, 16#00#, 16#1F#,
16#C0#, 16#7E#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#FC#, 16#00#, 16#00#,
16#1F#, 16#83#, 16#F8#, 16#00#, 16#00#, 16#3F#, 16#07#, 16#E0#, 16#00#,
16#00#, 16#7E#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#FC#, 16#1F#, 16#80#,
16#00#, 16#01#, 16#F8#, 16#3F#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#FE#,
16#00#, 16#00#, 16#0F#, 16#C1#, 16#F8#, 16#00#, 16#00#, 16#1F#, 16#83#,
16#F0#, 16#00#, 16#00#, 16#3F#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#FC#,
16#0F#, 16#C0#, 16#00#, 16#03#, 16#F8#, 16#3F#, 16#80#, 16#00#, 16#0F#,
16#E0#, 16#7E#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#FF#, 16#FF#, 16#FF#,
16#FE#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 16#F8#, 16#03#, 16#FF#, 16#FF#,
16#FF#, 16#E0#, 16#0F#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#1F#, 16#FF#,
16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FE#, 16#00#,
16#00#, 16#00#, 16#0F#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#FF#,
16#FF#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#07#,
16#FF#, 16#FF#, 16#FC#, 16#00#, 16#03#, 16#FF#, 16#00#, 16#FF#, 16#80#,
16#03#, 16#FE#, 16#00#, 16#0F#, 16#F0#, 16#01#, 16#FE#, 16#00#, 16#01#,
16#FC#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#3F#, 16#00#,
16#00#, 16#07#, 16#E0#, 16#1F#, 16#80#, 16#00#, 16#01#, 16#F8#, 16#0F#,
16#C0#, 16#00#, 16#00#, 16#7F#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#0F#,
16#C1#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#FC#, 16#00#, 16#00#,
16#00#, 16#FC#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#80#,
16#00#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#01#,
16#F8#, 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#1F#, 16#80#, 16#00#,
16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#01#, 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#C0#, 16#00#, 16#00#,
16#00#, 16#03#, 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#C0#, 16#00#, 16#00#, 16#07#, 16#F3#, 16#F0#, 16#00#, 16#00#, 16#01#,
16#F8#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#3F#, 16#00#, 16#00#,
16#00#, 16#3F#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#C3#, 16#F8#,
16#00#, 16#00#, 16#07#, 16#E0#, 16#7E#, 16#00#, 16#00#, 16#03#, 16#F0#,
16#1F#, 16#C0#, 16#00#, 16#01#, 16#FC#, 16#07#, 16#F0#, 16#00#, 16#00#,
16#FE#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#3F#, 16#C0#,
16#00#, 16#3F#, 16#C0#, 16#07#, 16#F8#, 16#00#, 16#3F#, 16#E0#, 16#01#,
16#FF#, 16#C0#, 16#3F#, 16#F0#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#F0#,
16#00#, 16#07#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#7F#, 16#FF#,
16#F8#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#00#,
16#3F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#00#,
16#00#, 16#0F#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#03#, 16#FF#, 16#FF#,
16#FF#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#3F#,
16#FF#, 16#FF#, 16#FC#, 16#00#, 16#1F#, 16#80#, 16#01#, 16#FF#, 16#80#,
16#07#, 16#C0#, 16#00#, 16#1F#, 16#F0#, 16#01#, 16#F0#, 16#00#, 16#01#,
16#FC#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#3F#, 16#00#,
16#00#, 16#0F#, 16#E0#, 16#0F#, 16#80#, 16#00#, 16#01#, 16#F8#, 16#03#,
16#E0#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#0F#,
16#C0#, 16#7E#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#1F#, 16#80#, 16#00#,
16#00#, 16#FC#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#3F#, 16#01#, 16#F0#,
16#00#, 16#00#, 16#0F#, 16#C0#, 16#7C#, 16#00#, 16#00#, 16#03#, 16#F0#,
16#3F#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#0F#, 16#80#, 16#00#, 16#00#,
16#3F#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#F8#, 16#00#,
16#00#, 16#07#, 16#E0#, 16#7E#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#1F#,
16#00#, 16#00#, 16#00#, 16#7E#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#1F#,
16#81#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#FC#, 16#00#, 16#00#,
16#03#, 16#F0#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#0F#, 16#80#,
16#00#, 16#00#, 16#3F#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#1F#, 16#80#,
16#F8#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#7E#, 16#00#, 16#00#, 16#03#,
16#F0#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#07#, 16#C0#, 16#00#,
16#00#, 16#7E#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#FC#,
16#00#, 16#00#, 16#0F#, 16#C0#, 16#3E#, 16#00#, 16#00#, 16#07#, 16#E0#,
16#0F#, 16#80#, 16#00#, 16#03#, 16#F8#, 16#03#, 16#E0#, 16#00#, 16#03#,
16#FC#, 16#00#, 16#F8#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#7E#, 16#00#,
16#03#, 16#FF#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#07#,
16#FF#, 16#FF#, 16#FF#, 16#80#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 16#C0#,
16#00#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#3F#, 16#FF#, 16#FF#,
16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#FF#, 16#C0#,
16#0F#, 16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#03#, 16#FF#, 16#FF#, 16#FF#,
16#F8#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#3F#, 16#FF#,
16#FF#, 16#FF#, 16#80#, 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#7C#, 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#7E#, 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#7C#, 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#FF#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#FF#, 16#FF#, 16#FF#,
16#FC#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#1F#, 16#FF#,
16#FF#, 16#FF#, 16#C0#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#E0#, 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#C0#, 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#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#C0#, 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#1F#, 16#FF#, 16#FF#, 16#FF#, 16#F0#, 16#07#, 16#FF#,
16#FF#, 16#FF#, 16#FC#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#00#,
16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#3F#, 16#FF#, 16#FF#, 16#FF#,
16#E0#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#1F#,
16#FF#, 16#FF#, 16#FF#, 16#80#, 16#0F#, 16#FF#, 16#FF#, 16#FF#, 16#C0#,
16#07#, 16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#03#, 16#FF#, 16#FF#, 16#FF#,
16#F0#, 16#03#, 16#F0#, 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#7E#, 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#0F#, 16#C0#, 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#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#00#,
16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#,
16#F8#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#1F#, 16#FF#,
16#FF#, 16#FE#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#07#,
16#FF#, 16#FF#, 16#FF#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#03#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#,
16#00#, 16#00#, 16#FC#, 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#3F#,
16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#80#, 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#07#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#01#, 16#F8#, 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#7E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 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#0F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#80#,
16#00#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#7F#,
16#FF#, 16#FC#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#F0#, 16#00#,
16#07#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#FF#, 16#C0#, 16#1F#,
16#FC#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#3F#, 16#C0#, 16#07#, 16#F8#,
16#00#, 16#01#, 16#FE#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#0F#, 16#E0#,
16#0F#, 16#C0#, 16#00#, 16#00#, 16#7F#, 16#01#, 16#F8#, 16#00#, 16#00#,
16#07#, 16#F0#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#07#, 16#F0#,
16#00#, 16#00#, 16#03#, 16#F0#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#3F#,
16#0F#, 16#C0#, 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#01#, 16#F8#,
16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 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#07#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7E#,
16#00#, 16#00#, 16#FF#, 16#FF#, 16#E7#, 16#E0#, 16#00#, 16#1F#, 16#FF#,
16#FE#, 16#FC#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#CF#, 16#C0#, 16#00#,
16#1F#, 16#FF#, 16#FC#, 16#FC#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#CF#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#FC#, 16#00#, 16#00#, 16#00#,
16#0F#, 16#8F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#FC#, 16#00#,
16#00#, 16#00#, 16#1F#, 16#8F#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#F8#,
16#FC#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#0F#, 16#C0#, 16#00#, 16#00#,
16#03#, 16#F0#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#07#, 16#E0#,
16#00#, 16#00#, 16#07#, 16#F0#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#FF#,
16#07#, 16#F0#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#3F#, 16#80#, 16#00#,
16#03#, 16#FE#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#7F#, 16#E0#, 16#1F#,
16#E0#, 16#00#, 16#0F#, 16#FE#, 16#01#, 16#FF#, 16#00#, 16#03#, 16#FB#,
16#C0#, 16#0F#, 16#FE#, 16#01#, 16#FF#, 16#3C#, 16#00#, 16#7F#, 16#FF#,
16#FF#, 16#E3#, 16#C0#, 16#03#, 16#FF#, 16#FF#, 16#F8#, 16#3C#, 16#00#,
16#0F#, 16#FF#, 16#FE#, 16#03#, 16#80#, 16#00#, 16#7F#, 16#FF#, 16#80#,
16#38#, 16#00#, 16#00#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#3F#,
16#00#, 16#00#, 16#01#, 16#F8#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#0F#,
16#C0#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#7C#, 16#00#,
16#00#, 16#03#, 16#E0#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#1F#, 16#00#,
16#3E#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#01#, 16#F0#, 16#00#, 16#00#,
16#0F#, 16#C0#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#7C#,
16#00#, 16#00#, 16#03#, 16#E0#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#3F#,
16#00#, 16#3E#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#01#, 16#F0#, 16#00#,
16#00#, 16#0F#, 16#C0#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#7C#, 16#00#,
16#FC#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#07#, 16#C0#, 16#00#, 16#00#,
16#3F#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#01#, 16#F0#,
16#00#, 16#00#, 16#0F#, 16#80#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#7C#,
16#00#, 16#FC#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#07#, 16#C0#, 16#00#,
16#00#, 16#3F#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#FF#, 16#F0#, 16#01#,
16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#1F#, 16#FF#, 16#FF#, 16#FF#,
16#FC#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#07#, 16#FF#,
16#FF#, 16#FF#, 16#FF#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#01#, 16#F0#,
16#03#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#1F#, 16#80#, 16#00#,
16#00#, 16#7C#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#07#,
16#C0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#01#,
16#F0#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#1F#, 16#80#,
16#00#, 16#00#, 16#7C#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#C0#,
16#07#, 16#C0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#7E#, 16#00#, 16#00#,
16#01#, 16#F0#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#1F#,
16#80#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#07#,
16#C0#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#7E#, 16#00#,
16#00#, 16#01#, 16#F0#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#1F#, 16#80#,
16#1F#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#F8#, 16#00#, 16#00#,
16#07#, 16#C0#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#7E#,
16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#7C#,
16#01#, 16#F0#, 16#03#, 16#E0#, 16#07#, 16#C0#, 16#0F#, 16#80#, 16#3F#,
16#00#, 16#7C#, 16#00#, 16#F8#, 16#01#, 16#F0#, 16#03#, 16#E0#, 16#0F#,
16#C0#, 16#1F#, 16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#F8#, 16#03#,
16#E0#, 16#07#, 16#C0#, 16#0F#, 16#80#, 16#1F#, 16#00#, 16#7E#, 16#00#,
16#F8#, 16#01#, 16#F0#, 16#03#, 16#E0#, 16#07#, 16#C0#, 16#1F#, 16#80#,
16#3E#, 16#00#, 16#7C#, 16#00#, 16#F8#, 16#01#, 16#F0#, 16#07#, 16#E0#,
16#0F#, 16#80#, 16#1F#, 16#00#, 16#3E#, 16#00#, 16#FC#, 16#01#, 16#F0#,
16#03#, 16#E0#, 16#07#, 16#C0#, 16#0F#, 16#80#, 16#3F#, 16#00#, 16#7C#,
16#00#, 16#F8#, 16#01#, 16#F0#, 16#03#, 16#E0#, 16#0F#, 16#C0#, 16#1F#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#,
16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#,
16#7E#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#07#,
16#E0#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#FC#,
16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#C0#,
16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#,
16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#,
16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#,
16#0F#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#01#,
16#F8#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#1F#,
16#80#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#,
16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#,
16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#01#, 16#F8#,
16#00#, 16#1F#, 16#80#, 16#7E#, 16#00#, 16#07#, 16#C0#, 16#1F#, 16#80#,
16#03#, 16#F0#, 16#0F#, 16#C0#, 16#00#, 16#FC#, 16#03#, 16#F0#, 16#00#,
16#3F#, 16#00#, 16#FC#, 16#00#, 16#0F#, 16#C0#, 16#3F#, 16#00#, 16#07#,
16#F0#, 16#0F#, 16#C0#, 16#03#, 16#F8#, 16#03#, 16#F8#, 16#00#, 16#FE#,
16#00#, 16#FE#, 16#00#, 16#FF#, 16#00#, 16#1F#, 16#E0#, 16#7F#, 16#80#,
16#07#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#FF#, 16#FF#, 16#E0#, 16#00#,
16#1F#, 16#FF#, 16#F0#, 16#00#, 16#03#, 16#FF#, 16#F0#, 16#00#, 16#00#,
16#1F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#03#,
16#FC#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#03#, 16#E0#,
16#00#, 16#00#, 16#FE#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#07#, 16#F0#,
16#00#, 16#3E#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#01#, 16#F0#, 16#00#,
16#03#, 16#FC#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#1F#, 16#C0#, 16#00#,
16#1F#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#07#,
16#F0#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#0F#,
16#80#, 16#03#, 16#FC#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#1F#, 16#C0#,
16#00#, 16#00#, 16#F8#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#07#, 16#E0#,
16#07#, 16#F0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#7F#, 16#80#, 16#00#,
16#00#, 16#7C#, 16#03#, 16#FC#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#1F#,
16#C0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#FE#, 16#00#, 16#00#, 16#00#,
16#3F#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#7F#, 16#C0#,
16#00#, 16#00#, 16#03#, 16#E3#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#0F#,
16#9F#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#FF#, 16#F8#, 16#00#,
16#00#, 16#01#, 16#F7#, 16#E7#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#FF#,
16#0F#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#F8#, 16#3F#, 16#80#, 16#00#,
16#00#, 16#FF#, 16#C0#, 16#7E#, 16#00#, 16#00#, 16#03#, 16#FE#, 16#01#,
16#FC#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#07#, 16#F0#, 16#00#, 16#00#,
16#3F#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#3F#,
16#80#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#1F#,
16#80#, 16#01#, 16#FC#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#03#, 16#F8#,
16#00#, 16#01#, 16#F0#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#0F#, 16#C0#,
16#00#, 16#1F#, 16#C0#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#7F#, 16#00#,
16#00#, 16#FC#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#03#, 16#E0#, 16#00#,
16#03#, 16#F8#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#07#, 16#F0#, 16#00#,
16#7E#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#01#, 16#F8#, 16#00#, 16#00#,
16#7F#, 16#80#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#1F#,
16#00#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#07#,
16#F0#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#00#,
16#3F#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#E0#,
16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#,
16#01#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#1F#,
16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#,
16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#,
16#F8#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#1F#, 16#00#,
16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#,
16#07#, 16#C0#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#F8#,
16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#,
16#00#, 16#7E#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#07#,
16#C0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#,
16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#,
16#3E#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#E0#,
16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#,
16#01#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#3E#,
16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#,
16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#01#,
16#FF#, 16#FF#, 16#FF#, 16#F7#, 16#FF#, 16#FF#, 16#FF#, 16#9F#, 16#FF#,
16#FF#, 16#FE#, 16#FF#, 16#FF#, 16#FF#, 16#FB#, 16#FF#, 16#FF#, 16#FF#,
16#E0#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#F8#, 16#01#,
16#FE#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#0F#, 16#F0#, 16#00#,
16#00#, 16#07#, 16#FC#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#00#, 16#3F#,
16#E0#, 16#03#, 16#FC#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#00#, 16#3F#,
16#E0#, 16#00#, 16#00#, 16#1F#, 16#F8#, 16#01#, 16#FF#, 16#80#, 16#00#,
16#01#, 16#FF#, 16#C0#, 16#0F#, 16#FC#, 16#00#, 16#00#, 16#0F#, 16#FC#,
16#00#, 16#7F#, 16#E0#, 16#00#, 16#00#, 16#FB#, 16#E0#, 16#07#, 16#DF#,
16#00#, 16#00#, 16#0F#, 16#DF#, 16#00#, 16#3E#, 16#F8#, 16#00#, 16#00#,
16#7C#, 16#F8#, 16#01#, 16#F7#, 16#C0#, 16#00#, 16#07#, 16#EF#, 16#80#,
16#0F#, 16#BE#, 16#00#, 16#00#, 16#3E#, 16#7C#, 16#00#, 16#FD#, 16#F8#,
16#00#, 16#03#, 16#F3#, 16#E0#, 16#07#, 16#C7#, 16#C0#, 16#00#, 16#1F#,
16#1F#, 16#00#, 16#3E#, 16#3E#, 16#00#, 16#01#, 16#F8#, 16#F8#, 16#01#,
16#F1#, 16#F0#, 16#00#, 16#0F#, 16#8F#, 16#80#, 16#0F#, 16#8F#, 16#80#,
16#00#, 16#F8#, 16#7C#, 16#00#, 16#F8#, 16#7C#, 16#00#, 16#0F#, 16#C3#,
16#E0#, 16#07#, 16#C3#, 16#E0#, 16#00#, 16#7C#, 16#1F#, 16#00#, 16#3E#,
16#1F#, 16#00#, 16#07#, 16#E1#, 16#F0#, 16#01#, 16#F0#, 16#7C#, 16#00#,
16#3E#, 16#0F#, 16#80#, 16#1F#, 16#03#, 16#E0#, 16#03#, 16#F0#, 16#7C#,
16#00#, 16#F8#, 16#1F#, 16#00#, 16#1F#, 16#03#, 16#E0#, 16#07#, 16#C0#,
16#F8#, 16#01#, 16#F8#, 16#1E#, 16#00#, 16#3E#, 16#07#, 16#C0#, 16#0F#,
16#81#, 16#F0#, 16#03#, 16#F0#, 16#3E#, 16#00#, 16#F8#, 16#0F#, 16#80#,
16#1F#, 16#01#, 16#F0#, 16#07#, 16#C0#, 16#7C#, 16#00#, 16#F8#, 16#0F#,
16#80#, 16#7C#, 16#03#, 16#E0#, 16#07#, 16#C0#, 16#3E#, 16#07#, 16#E0#,
16#3E#, 16#00#, 16#3E#, 16#01#, 16#F0#, 16#3E#, 16#01#, 16#F0#, 16#03#,
16#E0#, 16#0F#, 16#83#, 16#F0#, 16#0F#, 16#80#, 16#1F#, 16#00#, 16#7C#,
16#1F#, 16#00#, 16#7C#, 16#00#, 16#F8#, 16#03#, 16#E1#, 16#F8#, 16#07#,
16#C0#, 16#07#, 16#C0#, 16#1F#, 16#0F#, 16#80#, 16#3E#, 16#00#, 16#7C#,
16#00#, 16#F8#, 16#FC#, 16#01#, 16#F0#, 16#03#, 16#E0#, 16#07#, 16#C7#,
16#C0#, 16#0F#, 16#80#, 16#1F#, 16#00#, 16#1F#, 16#7C#, 16#00#, 16#7C#,
16#00#, 16#F8#, 16#00#, 16#FF#, 16#E0#, 16#07#, 16#C0#, 16#07#, 16#C0#,
16#07#, 16#FE#, 16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#3F#, 16#F0#,
16#01#, 16#F0#, 16#03#, 16#E0#, 16#01#, 16#FF#, 16#00#, 16#0F#, 16#80#,
16#1F#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#F8#, 16#00#, 16#F8#, 16#00#,
16#7F#, 16#80#, 16#07#, 16#C0#, 16#0F#, 16#80#, 16#03#, 16#FC#, 16#00#,
16#3E#, 16#00#, 16#7C#, 16#00#, 16#0F#, 16#C0#, 16#01#, 16#F0#, 16#00#,
16#00#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#FE#, 16#00#,
16#00#, 16#03#, 16#E0#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#0F#, 16#80#,
16#0F#, 16#F0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#3F#, 16#C0#, 16#00#,
16#00#, 16#F8#, 16#01#, 16#FF#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#07#,
16#FE#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#1F#, 16#FC#, 16#00#, 16#00#,
16#7C#, 16#00#, 16#7F#, 16#F0#, 16#00#, 16#01#, 16#F0#, 16#03#, 16#FF#,
16#C0#, 16#00#, 16#07#, 16#C0#, 16#0F#, 16#BF#, 16#80#, 16#00#, 16#3E#,
16#00#, 16#3E#, 16#FE#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#F9#, 16#FC#,
16#00#, 16#03#, 16#E0#, 16#07#, 16#E7#, 16#F0#, 16#00#, 16#0F#, 16#80#,
16#1F#, 16#0F#, 16#E0#, 16#00#, 16#7C#, 16#00#, 16#7C#, 16#3F#, 16#80#,
16#01#, 16#F0#, 16#01#, 16#F0#, 16#FE#, 16#00#, 16#07#, 16#C0#, 16#07#,
16#C1#, 16#FC#, 16#00#, 16#1F#, 16#00#, 16#3E#, 16#07#, 16#F0#, 16#00#,
16#FC#, 16#00#, 16#F8#, 16#0F#, 16#E0#, 16#03#, 16#E0#, 16#03#, 16#E0#,
16#3F#, 16#80#, 16#0F#, 16#80#, 16#0F#, 16#80#, 16#7F#, 16#00#, 16#3E#,
16#00#, 16#7C#, 16#01#, 16#FC#, 16#00#, 16#F8#, 16#01#, 16#F0#, 16#07#,
16#F8#, 16#07#, 16#C0#, 16#07#, 16#C0#, 16#0F#, 16#E0#, 16#1F#, 16#00#,
16#1F#, 16#00#, 16#3F#, 16#80#, 16#7C#, 16#00#, 16#FC#, 16#00#, 16#7F#,
16#01#, 16#F0#, 16#03#, 16#E0#, 16#01#, 16#FC#, 16#0F#, 16#80#, 16#0F#,
16#80#, 16#03#, 16#F8#, 16#3E#, 16#00#, 16#3E#, 16#00#, 16#0F#, 16#E0#,
16#F8#, 16#00#, 16#F8#, 16#00#, 16#1F#, 16#C3#, 16#E0#, 16#07#, 16#C0#,
16#00#, 16#7F#, 16#1F#, 16#80#, 16#1F#, 16#00#, 16#01#, 16#FC#, 16#7C#,
16#00#, 16#7C#, 16#00#, 16#03#, 16#F9#, 16#F0#, 16#01#, 16#F0#, 16#00#,
16#0F#, 16#E7#, 16#C0#, 16#0F#, 16#80#, 16#00#, 16#1F#, 16#DF#, 16#00#,
16#3E#, 16#00#, 16#00#, 16#7F#, 16#F8#, 16#00#, 16#F8#, 16#00#, 16#00#,
16#FF#, 16#E0#, 16#03#, 16#E0#, 16#00#, 16#03#, 16#FF#, 16#80#, 16#0F#,
16#80#, 16#00#, 16#0F#, 16#FE#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#1F#,
16#F8#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#07#, 16#C0#,
16#00#, 16#00#, 16#FF#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#03#, 16#FC#,
16#00#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#03#, 16#E0#, 16#00#,
16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#80#,
16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#0F#,
16#FF#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#C0#,
16#00#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#3F#, 16#F8#,
16#07#, 16#FF#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#07#, 16#FE#, 16#00#,
16#1F#, 16#F0#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#FF#, 16#00#, 16#00#,
16#0F#, 16#F0#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#1F#,
16#C0#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#FE#, 16#00#, 16#00#, 16#00#,
16#FE#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#1F#, 16#80#,
16#00#, 16#00#, 16#07#, 16#F0#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#0F#,
16#C3#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#1F#, 16#80#, 16#00#,
16#00#, 16#00#, 16#FC#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F3#,
16#F0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#CF#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#3F#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FD#, 16#F8#,
16#00#, 16#00#, 16#00#, 16#03#, 16#F7#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#1F#, 16#DF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FC#, 16#00#,
16#00#, 16#00#, 16#01#, 16#FB#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#07#,
16#EF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#BF#, 16#00#, 16#00#,
16#00#, 16#00#, 16#FE#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F3#,
16#F0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#CF#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#7F#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#FC#,
16#00#, 16#00#, 16#00#, 16#0F#, 16#E3#, 16#F0#, 16#00#, 16#00#, 16#00#,
16#3F#, 16#8F#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#FC#, 16#1F#, 16#80#,
16#00#, 16#00#, 16#0F#, 16#E0#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#3F#,
16#81#, 16#FC#, 16#00#, 16#00#, 16#01#, 16#FC#, 16#03#, 16#F8#, 16#00#,
16#00#, 16#0F#, 16#E0#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#7F#, 16#00#,
16#1F#, 16#E0#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#7F#, 16#E0#, 16#00#,
16#7F#, 16#C0#, 16#00#, 16#FF#, 16#E0#, 16#0F#, 16#FE#, 16#00#, 16#01#,
16#FF#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#FF#,
16#00#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#03#,
16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#3F#, 16#FF#,
16#FF#, 16#F0#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#3F#,
16#FF#, 16#FF#, 16#FC#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#FE#, 16#00#,
16#7E#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#FF#,
16#00#, 16#7C#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#7C#, 16#00#, 16#00#,
16#3F#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#F8#, 16#00#,
16#00#, 16#3F#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#F8#,
16#00#, 16#00#, 16#3F#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#3F#, 16#01#,
16#F0#, 16#00#, 16#00#, 16#7E#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#7E#,
16#01#, 16#F0#, 16#00#, 16#00#, 16#FE#, 16#01#, 16#F0#, 16#00#, 16#00#,
16#FC#, 16#03#, 16#F0#, 16#00#, 16#01#, 16#FC#, 16#03#, 16#E0#, 16#00#,
16#07#, 16#F8#, 16#03#, 16#E0#, 16#00#, 16#1F#, 16#F0#, 16#03#, 16#FF#,
16#FF#, 16#FF#, 16#E0#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#07#,
16#FF#, 16#FF#, 16#FF#, 16#80#, 16#07#, 16#FF#, 16#FF#, 16#FE#, 16#00#,
16#07#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#,
16#00#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#1F#,
16#80#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#,
16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#,
16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#,
16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#,
16#00#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7E#,
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#FC#, 16#00#, 16#00#, 16#00#,
16#00#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#,
16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#C0#, 16#00#,
16#00#, 16#0F#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#7F#, 16#FF#,
16#FF#, 16#C0#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#00#,
16#3F#, 16#F8#, 16#07#, 16#FF#, 16#00#, 16#03#, 16#FF#, 16#00#, 16#07#,
16#FE#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#7F#,
16#00#, 16#00#, 16#0F#, 16#F0#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#1F#,
16#C0#, 16#1F#, 16#C0#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#FE#, 16#00#,
16#00#, 16#00#, 16#7E#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#F8#,
16#1F#, 16#80#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#FC#, 16#00#, 16#00#,
16#00#, 16#0F#, 16#C3#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#1F#,
16#80#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#7E#, 16#00#, 16#00#, 16#00#,
16#03#, 16#F3#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#CF#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#3F#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#,
16#FD#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F7#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#0F#, 16#DF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#3E#,
16#7C#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FB#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#07#, 16#EF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#BF#,
16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#FC#, 16#00#, 16#00#, 16#00#,
16#03#, 16#F3#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#CF#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#7E#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#01#,
16#F8#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#C3#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#3F#, 16#0F#, 16#E0#, 16#00#, 16#03#, 16#01#, 16#F8#,
16#1F#, 16#80#, 16#00#, 16#1E#, 16#0F#, 16#E0#, 16#7E#, 16#00#, 16#00#,
16#FC#, 16#7F#, 16#01#, 16#FC#, 16#00#, 16#07#, 16#FB#, 16#F8#, 16#03#,
16#F8#, 16#00#, 16#0F#, 16#FF#, 16#C0#, 16#0F#, 16#F0#, 16#00#, 16#1F#,
16#FE#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#3F#, 16#F8#, 16#00#, 16#7F#,
16#C0#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#FF#, 16#E0#, 16#1F#, 16#FF#,
16#00#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#03#, 16#FF#,
16#FF#, 16#FF#, 16#FC#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#E7#, 16#F8#,
16#00#, 16#03#, 16#FF#, 16#FE#, 16#0F#, 16#F0#, 16#00#, 16#01#, 16#FF#,
16#C0#, 16#1F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#,
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#3F#, 16#FF#, 16#FF#, 16#F0#, 16#00#,
16#07#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#FF#, 16#FF#, 16#FF#,
16#FC#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#03#, 16#FF#,
16#FF#, 16#FF#, 16#FC#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#FF#, 16#80#,
16#1F#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#03#, 16#E0#, 16#00#, 16#00#,
16#7F#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#1F#, 16#80#,
16#00#, 16#00#, 16#FC#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#1F#, 16#80#,
16#7C#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#0F#, 16#80#, 16#00#, 16#00#,
16#7E#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#7E#, 16#00#,
16#00#, 16#03#, 16#F0#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#7E#, 16#01#,
16#F0#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#3E#, 16#00#, 16#00#, 16#03#,
16#F0#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#FC#, 16#01#, 16#F0#, 16#00#,
16#00#, 16#7F#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#07#,
16#FF#, 16#FF#, 16#FF#, 16#F0#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 16#F8#,
16#00#, 16#3F#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#07#, 16#FF#, 16#FF#,
16#FF#, 16#F0#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#3F#,
16#00#, 16#00#, 16#1F#, 16#F0#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#FE#,
16#00#, 16#FC#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#1F#, 16#00#, 16#00#,
16#01#, 16#F8#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#FC#,
16#00#, 16#00#, 16#07#, 16#E0#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#FC#,
16#03#, 16#E0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#7C#, 16#00#, 16#00#,
16#07#, 16#E0#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#FC#, 16#03#, 16#F0#,
16#00#, 16#00#, 16#1F#, 16#80#, 16#7E#, 16#00#, 16#00#, 16#03#, 16#F0#,
16#0F#, 16#80#, 16#00#, 16#00#, 16#7C#, 16#01#, 16#F0#, 16#00#, 16#00#,
16#1F#, 16#80#, 16#7E#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#0F#, 16#C0#,
16#00#, 16#00#, 16#7E#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#C0#,
16#3E#, 16#00#, 16#00#, 16#01#, 16#FC#, 16#0F#, 16#C0#, 16#00#, 16#00#,
16#3F#, 16#C1#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#0F#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#C0#,
16#00#, 16#03#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#07#, 16#FF#, 16#FF#,
16#F8#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#3F#, 16#F0#,
16#07#, 16#FC#, 16#00#, 16#3F#, 16#80#, 16#01#, 16#FE#, 16#00#, 16#7F#,
16#00#, 16#00#, 16#FE#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#7F#, 16#00#,
16#FC#, 16#00#, 16#00#, 16#3F#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#3F#,
16#01#, 16#F0#, 16#00#, 16#00#, 16#3F#, 16#03#, 16#F0#, 16#00#, 16#00#,
16#3F#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#3F#, 16#03#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#03#,
16#FE#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#00#, 16#00#,
16#01#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#00#,
16#00#, 16#00#, 16#7F#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#3F#, 16#FF#,
16#FE#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#00#,
16#FF#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#E0#, 16#00#,
16#00#, 16#01#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#03#,
16#F8#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#FC#, 16#00#, 16#00#,
16#01#, 16#F8#, 16#FC#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#FC#, 16#00#,
16#00#, 16#01#, 16#F8#, 16#FC#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#FC#,
16#00#, 16#00#, 16#03#, 16#F0#, 16#FC#, 16#00#, 16#00#, 16#03#, 16#E0#,
16#FE#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#FE#, 16#00#, 16#00#, 16#0F#,
16#C0#, 16#7F#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#7F#, 16#80#, 16#00#,
16#7F#, 16#80#, 16#3F#, 16#F0#, 16#03#, 16#FF#, 16#00#, 16#1F#, 16#FF#,
16#FF#, 16#FE#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#07#,
16#FF#, 16#FF#, 16#E0#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#80#, 16#00#,
16#00#, 16#3F#, 16#F8#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#FF#,
16#FB#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#DF#, 16#FF#, 16#FF#, 16#FF#,
16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#EF#, 16#FF#, 16#FF#, 16#FF#,
16#FF#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#07#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#7C#,
16#00#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#3E#,
16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#0F#,
16#80#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#07#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#01#,
16#F0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#00#,
16#FC#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#,
16#3E#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#,
16#1F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#,
16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#,
16#03#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#,
16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#,
16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#,
16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#,
16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#,
16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#7C#,
16#00#, 16#00#, 16#03#, 16#F0#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#FC#,
16#07#, 16#C0#, 16#00#, 16#00#, 16#3E#, 16#03#, 16#F0#, 16#00#, 16#00#,
16#0F#, 16#80#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#3E#, 16#00#,
16#00#, 16#01#, 16#F8#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#7C#, 16#07#,
16#E0#, 16#00#, 16#00#, 16#1F#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#07#,
16#C0#, 16#7C#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#1F#, 16#00#, 16#00#,
16#00#, 16#F8#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#3E#, 16#03#, 16#F0#,
16#00#, 16#00#, 16#0F#, 16#80#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#E0#,
16#3E#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#0F#, 16#80#, 16#00#, 16#00#,
16#7C#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#1F#, 16#01#, 16#F8#, 16#00#,
16#00#, 16#0F#, 16#C0#, 16#7C#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#1F#,
16#00#, 16#00#, 16#00#, 16#F8#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#3E#,
16#03#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#F8#, 16#00#, 16#00#,
16#07#, 16#E0#, 16#3E#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#1F#, 16#80#,
16#00#, 16#00#, 16#7C#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#1F#, 16#01#,
16#F0#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#7C#, 16#00#, 16#00#, 16#03#,
16#F0#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#0F#, 16#C0#, 16#00#,
16#00#, 16#3E#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#FC#,
16#00#, 16#00#, 16#07#, 16#E0#, 16#3F#, 16#00#, 16#00#, 16#01#, 16#F8#,
16#0F#, 16#C0#, 16#00#, 16#00#, 16#7E#, 16#03#, 16#F0#, 16#00#, 16#00#,
16#3F#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#3F#, 16#00#,
16#00#, 16#07#, 16#E0#, 16#0F#, 16#E0#, 16#00#, 16#03#, 16#F8#, 16#01#,
16#FC#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#7F#, 16#80#, 16#01#, 16#FE#,
16#00#, 16#0F#, 16#FC#, 16#03#, 16#FF#, 16#00#, 16#01#, 16#FF#, 16#FF#,
16#FF#, 16#80#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#07#,
16#FF#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#C0#, 16#00#,
16#00#, 16#03#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#,
16#00#, 16#7F#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#C0#, 16#00#,
16#00#, 16#1F#, 16#BF#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#FC#, 16#00#,
16#00#, 16#03#, 16#F3#, 16#F8#, 16#00#, 16#00#, 16#0F#, 16#8F#, 16#E0#,
16#00#, 16#00#, 16#7E#, 16#3F#, 16#80#, 16#00#, 16#01#, 16#F0#, 16#FE#,
16#00#, 16#00#, 16#0F#, 16#C3#, 16#F8#, 16#00#, 16#00#, 16#7E#, 16#07#,
16#E0#, 16#00#, 16#01#, 16#F0#, 16#1F#, 16#80#, 16#00#, 16#0F#, 16#C0#,
16#7F#, 16#00#, 16#00#, 16#3E#, 16#01#, 16#FC#, 16#00#, 16#01#, 16#F8#,
16#07#, 16#F0#, 16#00#, 16#07#, 16#C0#, 16#1F#, 16#C0#, 16#00#, 16#3F#,
16#00#, 16#3F#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#FC#, 16#00#, 16#07#,
16#C0#, 16#03#, 16#F8#, 16#00#, 16#3F#, 16#00#, 16#0F#, 16#E0#, 16#00#,
16#F8#, 16#00#, 16#3F#, 16#80#, 16#07#, 16#E0#, 16#00#, 16#FE#, 16#00#,
16#1F#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#FC#, 16#00#, 16#07#, 16#E0#,
16#03#, 16#E0#, 16#00#, 16#1F#, 16#80#, 16#1F#, 16#00#, 16#00#, 16#7F#,
16#00#, 16#7C#, 16#00#, 16#01#, 16#FC#, 16#03#, 16#E0#, 16#00#, 16#07#,
16#F0#, 16#1F#, 16#80#, 16#00#, 16#1F#, 16#C0#, 16#7C#, 16#00#, 16#00#,
16#7F#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#FC#, 16#0F#, 16#80#, 16#00#,
16#03#, 16#F8#, 16#7C#, 16#00#, 16#00#, 16#0F#, 16#E1#, 16#F0#, 16#00#,
16#00#, 16#3F#, 16#8F#, 16#80#, 16#00#, 16#00#, 16#FE#, 16#3E#, 16#00#,
16#00#, 16#03#, 16#F9#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#EF#, 16#C0#,
16#00#, 16#00#, 16#1F#, 16#BE#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#F0#,
16#00#, 16#00#, 16#01#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#FE#,
16#00#, 16#00#, 16#00#, 16#1F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#7F#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#03#,
16#F8#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#00#,
16#FC#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#3F#, 16#FE#, 16#00#,
16#00#, 16#7F#, 16#00#, 16#00#, 16#1F#, 16#BF#, 16#00#, 16#00#, 16#3F#,
16#80#, 16#00#, 16#1F#, 16#DF#, 16#80#, 16#00#, 16#3F#, 16#C0#, 16#00#,
16#0F#, 16#CF#, 16#C0#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#0F#, 16#E7#,
16#E0#, 16#00#, 16#1F#, 16#F8#, 16#00#, 16#07#, 16#E3#, 16#F0#, 16#00#,
16#0F#, 16#FC#, 16#00#, 16#07#, 16#F1#, 16#F8#, 16#00#, 16#0F#, 16#FE#,
16#00#, 16#03#, 16#F0#, 16#FC#, 16#00#, 16#07#, 16#FF#, 16#00#, 16#01#,
16#F8#, 16#7E#, 16#00#, 16#07#, 16#FF#, 16#80#, 16#01#, 16#F8#, 16#3F#,
16#00#, 16#03#, 16#F7#, 16#C0#, 16#00#, 16#FC#, 16#1F#, 16#80#, 16#01#,
16#F3#, 16#E0#, 16#00#, 16#FC#, 16#0F#, 16#E0#, 16#01#, 16#F9#, 16#F0#,
16#00#, 16#7E#, 16#07#, 16#F0#, 16#00#, 16#F8#, 16#F8#, 16#00#, 16#7E#,
16#03#, 16#F8#, 16#00#, 16#FC#, 16#7C#, 16#00#, 16#3F#, 16#01#, 16#FC#,
16#00#, 16#7C#, 16#3E#, 16#00#, 16#3F#, 16#00#, 16#FE#, 16#00#, 16#7E#,
16#1F#, 16#00#, 16#1F#, 16#80#, 16#7F#, 16#00#, 16#3E#, 16#0F#, 16#80#,
16#0F#, 16#80#, 16#3F#, 16#80#, 16#3F#, 16#07#, 16#C0#, 16#0F#, 16#C0#,
16#1F#, 16#C0#, 16#1F#, 16#03#, 16#F0#, 16#07#, 16#E0#, 16#0F#, 16#E0#,
16#1F#, 16#81#, 16#F8#, 16#07#, 16#E0#, 16#03#, 16#F0#, 16#0F#, 16#80#,
16#FC#, 16#03#, 16#F0#, 16#01#, 16#F8#, 16#0F#, 16#C0#, 16#7E#, 16#03#,
16#F0#, 16#00#, 16#FC#, 16#07#, 16#C0#, 16#3F#, 16#01#, 16#F8#, 16#00#,
16#7E#, 16#07#, 16#E0#, 16#0F#, 16#81#, 16#F8#, 16#00#, 16#3F#, 16#03#,
16#E0#, 16#07#, 16#C0#, 16#FC#, 16#00#, 16#1F#, 16#83#, 16#F0#, 16#03#,
16#E0#, 16#7C#, 16#00#, 16#0F#, 16#C1#, 16#F0#, 16#01#, 16#F0#, 16#7E#,
16#00#, 16#07#, 16#E1#, 16#F8#, 16#00#, 16#F8#, 16#3E#, 16#00#, 16#03#,
16#F0#, 16#F8#, 16#00#, 16#7C#, 16#3F#, 16#00#, 16#01#, 16#F8#, 16#FC#,
16#00#, 16#3E#, 16#1F#, 16#00#, 16#00#, 16#FC#, 16#7C#, 16#00#, 16#1F#,
16#1F#, 16#80#, 16#00#, 16#7E#, 16#7E#, 16#00#, 16#0F#, 16#8F#, 16#80#,
16#00#, 16#3F#, 16#3E#, 16#00#, 16#07#, 16#EF#, 16#C0#, 16#00#, 16#1F#,
16#BF#, 16#00#, 16#03#, 16#F7#, 16#C0#, 16#00#, 16#0F#, 16#DF#, 16#00#,
16#01#, 16#FB#, 16#E0#, 16#00#, 16#07#, 16#FF#, 16#80#, 16#00#, 16#FF#,
16#E0#, 16#00#, 16#03#, 16#FF#, 16#80#, 16#00#, 16#7F#, 16#F0#, 16#00#,
16#00#, 16#FF#, 16#C0#, 16#00#, 16#3F#, 16#F0#, 16#00#, 16#00#, 16#7F#,
16#C0#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#,
16#07#, 16#F8#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#03#, 16#FC#,
16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#00#,
16#07#, 16#F8#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#03#, 16#F8#,
16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#00#,
16#3F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#00#,
16#3F#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#03#,
16#F8#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#FE#, 16#00#, 16#00#,
16#3F#, 16#80#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#00#,
16#1F#, 16#C0#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#0F#, 16#E0#, 16#00#,
16#3F#, 16#80#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#3F#, 16#80#, 16#00#,
16#01#, 16#FC#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#7E#, 16#00#,
16#1F#, 16#80#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#1F#, 16#80#, 16#00#,
16#00#, 16#1F#, 16#C0#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#07#, 16#F0#,
16#1F#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#1F#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#FE#, 16#1F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#7F#,
16#1F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#9F#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#0F#, 16#EF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#03#,
16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#3F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#0F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FE#, 16#00#,
16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#,
16#0F#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#E7#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#0F#, 16#E3#, 16#F8#, 16#00#, 16#00#, 16#00#,
16#07#, 16#E0#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#7F#,
16#00#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#1F#, 16#C0#, 16#00#, 16#00#,
16#07#, 16#E0#, 16#0F#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#03#,
16#F8#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#01#, 16#FC#, 16#00#, 16#00#,
16#07#, 16#F0#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#,
16#3F#, 16#80#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#1F#, 16#C0#, 16#00#,
16#07#, 16#F0#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#07#, 16#F0#, 16#00#,
16#03#, 16#F8#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#FE#, 16#00#,
16#07#, 16#F0#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#03#, 16#F0#, 16#00#,
16#00#, 16#3F#, 16#C0#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#0F#, 16#E0#,
16#03#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#FE#, 16#00#,
16#00#, 16#00#, 16#7F#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#FF#,
16#00#, 16#00#, 16#00#, 16#FC#, 16#7F#, 16#00#, 16#00#, 16#01#, 16#FC#,
16#7F#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#3F#, 16#80#, 16#00#, 16#07#,
16#F0#, 16#3F#, 16#80#, 16#00#, 16#0F#, 16#E0#, 16#1F#, 16#C0#, 16#00#,
16#0F#, 16#C0#, 16#1F#, 16#C0#, 16#00#, 16#1F#, 16#80#, 16#1F#, 16#C0#,
16#00#, 16#3F#, 16#80#, 16#0F#, 16#E0#, 16#00#, 16#7F#, 16#00#, 16#0F#,
16#E0#, 16#00#, 16#FE#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#FC#, 16#00#,
16#07#, 16#F0#, 16#01#, 16#F8#, 16#00#, 16#03#, 16#F0#, 16#03#, 16#F0#,
16#00#, 16#03#, 16#F8#, 16#07#, 16#F0#, 16#00#, 16#03#, 16#F8#, 16#0F#,
16#E0#, 16#00#, 16#01#, 16#F8#, 16#1F#, 16#C0#, 16#00#, 16#01#, 16#FC#,
16#1F#, 16#80#, 16#00#, 16#00#, 16#FC#, 16#3F#, 16#00#, 16#00#, 16#00#,
16#FE#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#FE#, 16#00#, 16#00#,
16#00#, 16#7F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#F8#, 16#00#,
16#00#, 16#00#, 16#3F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#1F#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#,
16#1F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#,
16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#,
16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#,
16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#,
16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#,
16#7E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7E#, 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#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#,
16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#,
16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#FF#, 16#F0#,
16#00#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#07#, 16#FF#, 16#FF#,
16#FF#, 16#FC#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#01#,
16#FF#, 16#FF#, 16#FF#, 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#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 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#F0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#7F#, 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#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 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#F0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#7F#, 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#7F#, 16#80#,
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#7F#, 16#80#, 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#7F#, 16#80#, 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#7F#, 16#80#, 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#03#,
16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#1F#, 16#FF#, 16#FF#, 16#FF#,
16#FC#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#0F#, 16#FF#,
16#FF#, 16#FF#, 16#FE#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#F0#,
16#00#, 16#00#, 16#03#, 16#FF#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#01#,
16#FF#, 16#C0#, 16#00#, 16#FF#, 16#E0#, 16#00#, 16#7F#, 16#F0#, 16#00#,
16#3C#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#,
16#0F#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#03#, 16#E0#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#F0#, 16#00#,
16#00#, 16#78#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#3E#, 16#00#,
16#00#, 16#1E#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#0F#, 16#80#,
16#00#, 16#07#, 16#C0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#01#, 16#E0#,
16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#7C#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#1F#,
16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#03#,
16#C0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#,
16#F8#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#,
16#3E#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#,
16#07#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#03#, 16#E0#, 16#00#,
16#01#, 16#F0#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#F8#, 16#00#,
16#00#, 16#7C#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#1F#, 16#00#,
16#00#, 16#1F#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#07#, 16#C0#,
16#00#, 16#03#, 16#E0#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#01#, 16#FF#,
16#E0#, 16#00#, 16#FF#, 16#F0#, 16#00#, 16#7F#, 16#F0#, 16#00#, 16#3F#,
16#F8#, 16#00#, 16#3F#, 16#FC#, 16#00#, 16#00#, 16#E0#, 16#F0#, 16#F0#,
16#F0#, 16#F0#, 16#70#, 16#70#, 16#70#, 16#70#, 16#70#, 16#70#, 16#78#,
16#78#, 16#78#, 16#78#, 16#38#, 16#38#, 16#38#, 16#38#, 16#38#, 16#38#,
16#3C#, 16#3C#, 16#3C#, 16#3C#, 16#3C#, 16#1C#, 16#1C#, 16#1C#, 16#1C#,
16#1C#, 16#1C#, 16#1E#, 16#1E#, 16#1E#, 16#1E#, 16#0E#, 16#0E#, 16#0E#,
16#0E#, 16#0E#, 16#0E#, 16#0F#, 16#0F#, 16#0F#, 16#0F#, 16#07#, 16#00#,
16#07#, 16#FF#, 16#80#, 16#03#, 16#FF#, 16#80#, 16#01#, 16#FF#, 16#C0#,
16#01#, 16#FF#, 16#E0#, 16#00#, 16#FF#, 16#F0#, 16#00#, 16#01#, 16#F8#,
16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#3E#,
16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#0F#,
16#80#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#01#,
16#E0#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#,
16#7C#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#,
16#1F#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#01#, 16#F0#, 16#00#,
16#00#, 16#F8#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#7C#, 16#00#,
16#00#, 16#3E#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#07#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#03#, 16#E0#,
16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#F8#,
16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#1E#,
16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#07#,
16#C0#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#01#,
16#F0#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#,
16#3C#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#,
16#0F#, 16#80#, 16#00#, 16#07#, 16#80#, 16#01#, 16#FF#, 16#C0#, 16#00#,
16#FF#, 16#E0#, 16#00#, 16#7F#, 16#F0#, 16#00#, 16#3F#, 16#F0#, 16#00#,
16#1F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#07#,
16#C0#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#FE#,
16#00#, 16#03#, 16#DE#, 16#00#, 16#07#, 16#BC#, 16#00#, 16#1E#, 16#78#,
16#00#, 16#7C#, 16#F0#, 16#00#, 16#F1#, 16#E0#, 16#03#, 16#C1#, 16#E0#,
16#0F#, 16#83#, 16#C0#, 16#1E#, 16#07#, 16#80#, 16#7C#, 16#0F#, 16#00#,
16#F0#, 16#1E#, 16#03#, 16#C0#, 16#1E#, 16#0F#, 16#80#, 16#3C#, 16#1E#,
16#00#, 16#78#, 16#78#, 16#00#, 16#F1#, 16#F0#, 16#01#, 16#E3#, 16#C0#,
16#03#, 16#EF#, 16#80#, 16#03#, 16#DE#, 16#00#, 16#07#, 16#F8#, 16#00#,
16#0F#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#FF#, 16#FF#, 16#FF#,
16#FF#, 16#FB#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#F0#, 16#FE#, 16#0F#,
16#C0#, 16#FC#, 16#0F#, 16#80#, 16#F8#, 16#0F#, 16#00#, 16#F0#, 16#1E#,
16#01#, 16#E0#, 16#00#, 16#00#, 16#FF#, 16#C0#, 16#00#, 16#07#, 16#FF#,
16#F0#, 16#00#, 16#1F#, 16#FF#, 16#FC#, 16#00#, 16#3F#, 16#FF#, 16#FE#,
16#00#, 16#7F#, 16#FF#, 16#FE#, 16#00#, 16#FF#, 16#01#, 16#FF#, 16#01#,
16#FC#, 16#00#, 16#7F#, 16#01#, 16#F8#, 16#00#, 16#3F#, 16#03#, 16#F8#,
16#00#, 16#3F#, 16#03#, 16#F0#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#,
16#3E#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#7E#,
16#00#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#01#, 16#FC#, 16#00#,
16#03#, 16#FF#, 16#FC#, 16#00#, 16#7F#, 16#FF#, 16#FC#, 16#03#, 16#FF#,
16#FF#, 16#FC#, 16#0F#, 16#FF#, 16#F8#, 16#7C#, 16#1F#, 16#FE#, 16#00#,
16#F8#, 16#3F#, 16#C0#, 16#00#, 16#F8#, 16#3F#, 16#00#, 16#00#, 16#F8#,
16#7E#, 16#00#, 16#00#, 16#F8#, 16#7E#, 16#00#, 16#00#, 16#F0#, 16#FC#,
16#00#, 16#01#, 16#F0#, 16#FC#, 16#00#, 16#01#, 16#F0#, 16#FC#, 16#00#,
16#03#, 16#F0#, 16#FC#, 16#00#, 16#07#, 16#F0#, 16#FE#, 16#00#, 16#1F#,
16#E0#, 16#FF#, 16#80#, 16#FF#, 16#F0#, 16#7F#, 16#FF#, 16#FB#, 16#FE#,
16#7F#, 16#FF#, 16#F3#, 16#FE#, 16#3F#, 16#FF#, 16#E1#, 16#FC#, 16#0F#,
16#FF#, 16#81#, 16#FC#, 16#03#, 16#FC#, 16#00#, 16#F8#, 16#00#, 16#3E#,
16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#03#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#,
16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#,
16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#,
16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#3F#, 16#C0#, 16#00#,
16#7C#, 16#3F#, 16#FC#, 16#00#, 16#1F#, 16#3F#, 16#FF#, 16#C0#, 16#07#,
16#9F#, 16#FF#, 16#F8#, 16#01#, 16#EF#, 16#FF#, 16#FF#, 16#00#, 16#FF#,
16#F0#, 16#7F#, 16#C0#, 16#3F#, 16#E0#, 16#07#, 16#F8#, 16#0F#, 16#F0#,
16#00#, 16#FE#, 16#03#, 16#F8#, 16#00#, 16#1F#, 16#81#, 16#FC#, 16#00#,
16#07#, 16#F0#, 16#7F#, 16#00#, 16#00#, 16#FC#, 16#1F#, 16#80#, 16#00#,
16#3F#, 16#07#, 16#C0#, 16#00#, 16#0F#, 16#C1#, 16#F0#, 16#00#, 16#03#,
16#F0#, 16#FC#, 16#00#, 16#00#, 16#FC#, 16#3E#, 16#00#, 16#00#, 16#3F#,
16#0F#, 16#80#, 16#00#, 16#0F#, 16#C3#, 16#E0#, 16#00#, 16#03#, 16#E1#,
16#F0#, 16#00#, 16#01#, 16#F8#, 16#7C#, 16#00#, 16#00#, 16#7E#, 16#1F#,
16#00#, 16#00#, 16#1F#, 16#87#, 16#C0#, 16#00#, 16#0F#, 16#C3#, 16#F0#,
16#00#, 16#03#, 16#F0#, 16#FC#, 16#00#, 16#01#, 16#FC#, 16#3F#, 16#00#,
16#00#, 16#7E#, 16#0F#, 16#E0#, 16#00#, 16#3F#, 16#07#, 16#F8#, 16#00#,
16#1F#, 16#C1#, 16#FF#, 16#00#, 16#0F#, 16#E0#, 16#7F#, 16#E0#, 16#07#,
16#F0#, 16#1F#, 16#FC#, 16#0F#, 16#F8#, 16#07#, 16#DF#, 16#FF#, 16#FC#,
16#03#, 16#E7#, 16#FF#, 16#FE#, 16#00#, 16#F8#, 16#FF#, 16#FF#, 16#00#,
16#3E#, 16#0F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#,
16#00#, 16#03#, 16#FE#, 16#00#, 16#00#, 16#3F#, 16#FE#, 16#00#, 16#03#,
16#FF#, 16#FE#, 16#00#, 16#3F#, 16#FF#, 16#FC#, 16#01#, 16#FF#, 16#FF#,
16#F0#, 16#0F#, 16#F8#, 16#1F#, 16#E0#, 16#7F#, 16#80#, 16#3F#, 16#C3#,
16#FC#, 16#00#, 16#7F#, 16#0F#, 16#E0#, 16#00#, 16#FC#, 16#7F#, 16#00#,
16#03#, 16#F1#, 16#F8#, 16#00#, 16#0F#, 16#CF#, 16#E0#, 16#00#, 16#3F#,
16#3F#, 16#00#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#00#, 16#07#, 16#E0#,
16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#,
16#03#, 16#F8#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#3F#,
16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#,
16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#F8#,
16#FC#, 16#00#, 16#07#, 16#E3#, 16#F0#, 16#00#, 16#1F#, 16#8F#, 16#E0#,
16#00#, 16#FC#, 16#1F#, 16#80#, 16#07#, 16#F0#, 16#7F#, 16#00#, 16#3F#,
16#80#, 16#FF#, 16#03#, 16#FC#, 16#03#, 16#FF#, 16#FF#, 16#F0#, 16#07#,
16#FF#, 16#FF#, 16#80#, 16#0F#, 16#FF#, 16#F8#, 16#00#, 16#1F#, 16#FF#,
16#80#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#,
16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#,
16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#,
16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#,
16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#,
16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#03#, 16#FC#,
16#0F#, 16#80#, 16#01#, 16#FF#, 16#F0#, 16#F8#, 16#00#, 16#3F#, 16#FF#,
16#8F#, 16#80#, 16#0F#, 16#FF#, 16#FC#, 16#F8#, 16#01#, 16#FF#, 16#FF#,
16#EF#, 16#00#, 16#3F#, 16#E0#, 16#7F#, 16#F0#, 16#07#, 16#F8#, 16#01#,
16#FF#, 16#00#, 16#FF#, 16#00#, 16#0F#, 16#F0#, 16#0F#, 16#E0#, 16#00#,
16#FE#, 16#01#, 16#FC#, 16#00#, 16#07#, 16#E0#, 16#1F#, 16#80#, 16#00#,
16#7E#, 16#03#, 16#F8#, 16#00#, 16#07#, 16#E0#, 16#3F#, 16#00#, 16#00#,
16#7E#, 16#07#, 16#F0#, 16#00#, 16#07#, 16#C0#, 16#7E#, 16#00#, 16#00#,
16#7C#, 16#07#, 16#E0#, 16#00#, 16#07#, 16#C0#, 16#7E#, 16#00#, 16#00#,
16#7C#, 16#0F#, 16#C0#, 16#00#, 16#07#, 16#80#, 16#FC#, 16#00#, 16#00#,
16#F8#, 16#0F#, 16#C0#, 16#00#, 16#0F#, 16#80#, 16#FC#, 16#00#, 16#00#,
16#F8#, 16#0F#, 16#C0#, 16#00#, 16#1F#, 16#80#, 16#FC#, 16#00#, 16#01#,
16#F0#, 16#0F#, 16#C0#, 16#00#, 16#1F#, 16#00#, 16#FC#, 16#00#, 16#03#,
16#F0#, 16#0F#, 16#E0#, 16#00#, 16#7F#, 16#00#, 16#FE#, 16#00#, 16#07#,
16#E0#, 16#07#, 16#F0#, 16#00#, 16#FE#, 16#00#, 16#7F#, 16#80#, 16#3F#,
16#E0#, 16#07#, 16#FC#, 16#0F#, 16#FE#, 16#00#, 16#3F#, 16#FF#, 16#FB#,
16#C0#, 16#01#, 16#FF#, 16#FF#, 16#3C#, 16#00#, 16#0F#, 16#FF#, 16#E3#,
16#C0#, 16#00#, 16#7F#, 16#F8#, 16#7C#, 16#00#, 16#01#, 16#FC#, 16#00#,
16#00#, 16#00#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#0F#, 16#FF#,
16#C0#, 16#00#, 16#3F#, 16#FF#, 16#F0#, 16#00#, 16#7F#, 16#FF#, 16#F8#,
16#01#, 16#FF#, 16#FF#, 16#FC#, 16#03#, 16#FF#, 16#03#, 16#FE#, 16#03#,
16#F8#, 16#01#, 16#FE#, 16#07#, 16#F0#, 16#00#, 16#7F#, 16#0F#, 16#E0#,
16#00#, 16#7F#, 16#0F#, 16#C0#, 16#00#, 16#3F#, 16#1F#, 16#80#, 16#00#,
16#3F#, 16#1F#, 16#00#, 16#00#, 16#3F#, 16#3F#, 16#00#, 16#00#, 16#3F#,
16#3F#, 16#00#, 16#00#, 16#3F#, 16#3F#, 16#FF#, 16#FF#, 16#FF#, 16#7F#,
16#FF#, 16#FF#, 16#FE#, 16#7F#, 16#FF#, 16#FF#, 16#FE#, 16#7F#, 16#FF#,
16#FF#, 16#FE#, 16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#FC#, 16#00#, 16#00#,
16#00#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#00#,
16#FC#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#FC#,
16#00#, 16#01#, 16#F8#, 16#FE#, 16#00#, 16#03#, 16#F0#, 16#7E#, 16#00#,
16#03#, 16#F0#, 16#7F#, 16#00#, 16#07#, 16#E0#, 16#7F#, 16#80#, 16#1F#,
16#E0#, 16#3F#, 16#E0#, 16#7F#, 16#C0#, 16#1F#, 16#FF#, 16#FF#, 16#80#,
16#0F#, 16#FF#, 16#FF#, 16#00#, 16#07#, 16#FF#, 16#FC#, 16#00#, 16#03#,
16#FF#, 16#F0#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#00#, 16#03#,
16#F0#, 16#00#, 16#FF#, 16#00#, 16#1F#, 16#F0#, 16#03#, 16#FE#, 16#00#,
16#7F#, 16#E0#, 16#07#, 16#E0#, 16#00#, 16#FC#, 16#00#, 16#0F#, 16#80#,
16#00#, 16#F8#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#F8#, 16#00#, 16#1F#,
16#00#, 16#01#, 16#F0#, 16#03#, 16#FF#, 16#F8#, 16#3F#, 16#FF#, 16#83#,
16#FF#, 16#F8#, 16#3F#, 16#FF#, 16#80#, 16#3E#, 16#00#, 16#03#, 16#E0#,
16#00#, 16#3E#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#3C#, 16#00#, 16#07#,
16#C0#, 16#00#, 16#7C#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#78#, 16#00#,
16#0F#, 16#80#, 16#00#, 16#F8#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#F0#,
16#00#, 16#0F#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#1F#, 16#00#, 16#01#,
16#F0#, 16#00#, 16#1E#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#3E#, 16#00#,
16#03#, 16#E0#, 16#00#, 16#3C#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#7C#,
16#00#, 16#07#, 16#C0#, 16#00#, 16#78#, 16#00#, 16#07#, 16#80#, 16#00#,
16#F8#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#80#,
16#00#, 16#00#, 16#1F#, 16#FE#, 16#1F#, 16#00#, 16#07#, 16#FF#, 16#F1#,
16#F0#, 16#00#, 16#FF#, 16#FF#, 16#9F#, 16#00#, 16#3F#, 16#FF#, 16#FD#,
16#E0#, 16#07#, 16#FC#, 16#0F#, 16#FE#, 16#00#, 16#7F#, 16#00#, 16#3F#,
16#E0#, 16#0F#, 16#E0#, 16#01#, 16#FE#, 16#01#, 16#FC#, 16#00#, 16#1F#,
16#E0#, 16#1F#, 16#80#, 16#00#, 16#FC#, 16#03#, 16#F0#, 16#00#, 16#0F#,
16#C0#, 16#3F#, 16#00#, 16#00#, 16#FC#, 16#07#, 16#E0#, 16#00#, 16#0F#,
16#C0#, 16#7E#, 16#00#, 16#00#, 16#FC#, 16#07#, 16#C0#, 16#00#, 16#0F#,
16#80#, 16#FC#, 16#00#, 16#00#, 16#F8#, 16#0F#, 16#C0#, 16#00#, 16#0F#,
16#80#, 16#FC#, 16#00#, 16#00#, 16#F8#, 16#1F#, 16#80#, 16#00#, 16#0F#,
16#81#, 16#F8#, 16#00#, 16#01#, 16#F0#, 16#1F#, 16#80#, 16#00#, 16#1F#,
16#01#, 16#F8#, 16#00#, 16#01#, 16#F0#, 16#1F#, 16#80#, 16#00#, 16#3F#,
16#01#, 16#F8#, 16#00#, 16#03#, 16#E0#, 16#1F#, 16#80#, 16#00#, 16#7E#,
16#01#, 16#FC#, 16#00#, 16#0F#, 16#E0#, 16#1F#, 16#C0#, 16#01#, 16#FE#,
16#00#, 16#FE#, 16#00#, 16#1F#, 16#E0#, 16#0F#, 16#E0#, 16#07#, 16#FC#,
16#00#, 16#7F#, 16#81#, 16#FF#, 16#C0#, 16#07#, 16#FF#, 16#FF#, 16#7C#,
16#00#, 16#3F#, 16#FF#, 16#EF#, 16#C0#, 16#01#, 16#FF#, 16#FC#, 16#F8#,
16#00#, 16#0F#, 16#FF#, 16#0F#, 16#80#, 16#00#, 16#1F#, 16#C0#, 16#F8#,
16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#,
16#0F#, 16#C0#, 16#00#, 16#7E#, 16#00#, 16#FC#, 16#00#, 16#0F#, 16#C0#,
16#0F#, 16#E0#, 16#01#, 16#FC#, 16#00#, 16#7F#, 16#80#, 16#7F#, 16#80#,
16#07#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#3F#, 16#FF#, 16#FE#, 16#00#,
16#01#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#0F#, 16#FF#, 16#F0#, 16#00#,
16#00#, 16#1F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#,
16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#,
16#3C#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#7C#,
16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#,
16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#,
16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#1F#, 16#E0#, 16#01#, 16#F0#, 16#FF#, 16#F8#, 16#01#, 16#F3#,
16#FF#, 16#FC#, 16#01#, 16#E7#, 16#FF#, 16#FE#, 16#01#, 16#EF#, 16#FF#,
16#FE#, 16#03#, 16#FF#, 16#81#, 16#FF#, 16#03#, 16#FE#, 16#00#, 16#7F#,
16#03#, 16#FC#, 16#00#, 16#7F#, 16#03#, 16#F0#, 16#00#, 16#3F#, 16#07#,
16#F0#, 16#00#, 16#3E#, 16#07#, 16#E0#, 16#00#, 16#3E#, 16#07#, 16#C0#,
16#00#, 16#3E#, 16#07#, 16#C0#, 16#00#, 16#3E#, 16#07#, 16#80#, 16#00#,
16#3C#, 16#0F#, 16#80#, 16#00#, 16#7C#, 16#0F#, 16#80#, 16#00#, 16#7C#,
16#0F#, 16#80#, 16#00#, 16#7C#, 16#0F#, 16#00#, 16#00#, 16#7C#, 16#1F#,
16#00#, 16#00#, 16#78#, 16#1F#, 16#00#, 16#00#, 16#F8#, 16#1F#, 16#00#,
16#00#, 16#F8#, 16#1F#, 16#00#, 16#00#, 16#F8#, 16#3E#, 16#00#, 16#00#,
16#F0#, 16#3E#, 16#00#, 16#01#, 16#F0#, 16#3E#, 16#00#, 16#01#, 16#F0#,
16#3E#, 16#00#, 16#01#, 16#F0#, 16#7C#, 16#00#, 16#01#, 16#E0#, 16#7C#,
16#00#, 16#03#, 16#E0#, 16#7C#, 16#00#, 16#03#, 16#E0#, 16#7C#, 16#00#,
16#03#, 16#E0#, 16#78#, 16#00#, 16#03#, 16#E0#, 16#F8#, 16#00#, 16#03#,
16#C0#, 16#F8#, 16#00#, 16#07#, 16#C0#, 16#F8#, 16#00#, 16#07#, 16#C0#,
16#00#, 16#3E#, 16#00#, 16#7C#, 16#01#, 16#F0#, 16#03#, 16#E0#, 16#07#,
16#C0#, 16#0F#, 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#3E#, 16#00#,
16#7C#, 16#00#, 16#F8#, 16#01#, 16#E0#, 16#03#, 16#C0#, 16#0F#, 16#80#,
16#1F#, 16#00#, 16#3E#, 16#00#, 16#78#, 16#01#, 16#F0#, 16#03#, 16#E0#,
16#07#, 16#C0#, 16#0F#, 16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#F8#,
16#01#, 16#E0#, 16#03#, 16#C0#, 16#0F#, 16#80#, 16#1F#, 16#00#, 16#3E#,
16#00#, 16#78#, 16#01#, 16#F0#, 16#03#, 16#E0#, 16#07#, 16#C0#, 16#0F#,
16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#F8#, 16#01#, 16#E0#, 16#03#,
16#C0#, 16#0F#, 16#80#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#,
16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#01#, 16#F0#,
16#00#, 16#07#, 16#C0#, 16#00#, 16#0F#, 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#1F#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#78#, 16#00#, 16#01#,
16#F0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#0F#,
16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#F8#,
16#00#, 16#01#, 16#E0#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#0F#, 16#80#,
16#00#, 16#1F#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#78#, 16#00#,
16#01#, 16#F0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#07#, 16#C0#, 16#00#,
16#0F#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#,
16#F8#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#0F#,
16#80#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#78#,
16#00#, 16#01#, 16#F0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#07#, 16#C0#,
16#00#, 16#0F#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#7C#, 16#00#,
16#00#, 16#F8#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#0F#, 16#80#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#01#,
16#FC#, 16#00#, 16#3F#, 16#F0#, 16#00#, 16#7F#, 16#E0#, 16#00#, 16#FF#,
16#80#, 16#03#, 16#FE#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#3E#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#0F#,
16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#07#, 16#C0#,
16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#,
16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#,
16#1E#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#0F#,
16#80#, 16#03#, 16#F8#, 16#07#, 16#80#, 16#03#, 16#F8#, 16#03#, 16#C0#,
16#03#, 16#F8#, 16#01#, 16#E0#, 16#03#, 16#F8#, 16#01#, 16#F0#, 16#07#,
16#F0#, 16#00#, 16#F8#, 16#07#, 16#F0#, 16#00#, 16#78#, 16#07#, 16#F0#,
16#00#, 16#3C#, 16#07#, 16#F0#, 16#00#, 16#3E#, 16#0F#, 16#E0#, 16#00#,
16#1F#, 16#0F#, 16#E0#, 16#00#, 16#0F#, 16#0F#, 16#E0#, 16#00#, 16#07#,
16#8F#, 16#E0#, 16#00#, 16#03#, 16#CF#, 16#F0#, 16#00#, 16#03#, 16#FF#,
16#FC#, 16#00#, 16#01#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#FF#, 16#9F#,
16#00#, 16#00#, 16#7F#, 16#8F#, 16#C0#, 16#00#, 16#7F#, 16#83#, 16#E0#,
16#00#, 16#3F#, 16#81#, 16#F8#, 16#00#, 16#1F#, 16#00#, 16#FC#, 16#00#,
16#0F#, 16#80#, 16#3F#, 16#00#, 16#0F#, 16#80#, 16#1F#, 16#80#, 16#07#,
16#C0#, 16#0F#, 16#C0#, 16#03#, 16#E0#, 16#03#, 16#F0#, 16#01#, 16#F0#,
16#01#, 16#F8#, 16#01#, 16#F0#, 16#00#, 16#7E#, 16#00#, 16#F8#, 16#00#,
16#3F#, 16#00#, 16#7C#, 16#00#, 16#1F#, 16#80#, 16#3E#, 16#00#, 16#07#,
16#E0#, 16#1F#, 16#00#, 16#03#, 16#F0#, 16#1F#, 16#00#, 16#00#, 16#FC#,
16#0F#, 16#80#, 16#00#, 16#7E#, 16#07#, 16#C0#, 16#00#, 16#3F#, 16#00#,
16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#F0#, 16#01#, 16#E0#, 16#03#,
16#C0#, 16#0F#, 16#80#, 16#1F#, 16#00#, 16#3C#, 16#00#, 16#78#, 16#01#,
16#F0#, 16#03#, 16#E0#, 16#07#, 16#80#, 16#0F#, 16#00#, 16#3E#, 16#00#,
16#7C#, 16#00#, 16#F0#, 16#01#, 16#E0#, 16#03#, 16#C0#, 16#0F#, 16#80#,
16#1F#, 16#00#, 16#3C#, 16#00#, 16#78#, 16#01#, 16#F0#, 16#03#, 16#E0#,
16#07#, 16#80#, 16#0F#, 16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#F0#,
16#01#, 16#E0#, 16#03#, 16#C0#, 16#0F#, 16#80#, 16#1F#, 16#00#, 16#3C#,
16#00#, 16#78#, 16#01#, 16#F0#, 16#03#, 16#E0#, 16#07#, 16#80#, 16#0F#,
16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#F0#, 16#01#, 16#E0#, 16#03#,
16#C0#, 16#0F#, 16#80#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#,
16#80#, 16#03#, 16#F0#, 16#00#, 16#F0#, 16#FF#, 16#F0#, 16#0F#, 16#FE#,
16#00#, 16#78#, 16#FF#, 16#FC#, 16#1F#, 16#FF#, 16#80#, 16#7C#, 16#FF#,
16#FF#, 16#1F#, 16#FF#, 16#E0#, 16#3F#, 16#FF#, 16#FF#, 16#9F#, 16#FF#,
16#F0#, 16#1F#, 16#F8#, 16#1F#, 16#FF#, 16#03#, 16#FC#, 16#0F#, 16#F0#,
16#07#, 16#FE#, 16#00#, 16#FE#, 16#07#, 16#F0#, 16#01#, 16#FE#, 16#00#,
16#3F#, 16#07#, 16#F0#, 16#00#, 16#FE#, 16#00#, 16#1F#, 16#83#, 16#F0#,
16#00#, 16#7E#, 16#00#, 16#0F#, 16#C1#, 16#F0#, 16#00#, 16#3F#, 16#00#,
16#07#, 16#C0#, 16#F8#, 16#00#, 16#1F#, 16#00#, 16#03#, 16#E0#, 16#F8#,
16#00#, 16#0F#, 16#80#, 16#01#, 16#F0#, 16#7C#, 16#00#, 16#07#, 16#C0#,
16#00#, 16#F8#, 16#3E#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#7C#, 16#1F#,
16#00#, 16#03#, 16#E0#, 16#00#, 16#3C#, 16#0F#, 16#00#, 16#01#, 16#F0#,
16#00#, 16#3E#, 16#0F#, 16#80#, 16#00#, 16#F8#, 16#00#, 16#1F#, 16#07#,
16#C0#, 16#00#, 16#78#, 16#00#, 16#0F#, 16#83#, 16#E0#, 16#00#, 16#7C#,
16#00#, 16#07#, 16#81#, 16#F0#, 16#00#, 16#3E#, 16#00#, 16#07#, 16#C1#,
16#F0#, 16#00#, 16#1F#, 16#00#, 16#03#, 16#E0#, 16#F8#, 16#00#, 16#0F#,
16#80#, 16#01#, 16#F0#, 16#7C#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#F0#,
16#3E#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#F8#, 16#1E#, 16#00#, 16#03#,
16#E0#, 16#00#, 16#7C#, 16#1F#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#3E#,
16#0F#, 16#80#, 16#00#, 16#F0#, 16#00#, 16#1F#, 16#07#, 16#C0#, 16#00#,
16#F8#, 16#00#, 16#0F#, 16#03#, 16#E0#, 16#00#, 16#7C#, 16#00#, 16#0F#,
16#81#, 16#E0#, 16#00#, 16#3E#, 16#00#, 16#07#, 16#C1#, 16#F0#, 16#00#,
16#1E#, 16#00#, 16#03#, 16#E0#, 16#F8#, 16#00#, 16#1F#, 16#00#, 16#01#,
16#E0#, 16#7C#, 16#00#, 16#0F#, 16#80#, 16#01#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#1F#, 16#E0#, 16#01#, 16#E0#, 16#FF#, 16#F8#, 16#01#, 16#E3#,
16#FF#, 16#FC#, 16#03#, 16#EF#, 16#FF#, 16#FE#, 16#03#, 16#FF#, 16#FF#,
16#FE#, 16#03#, 16#FF#, 16#81#, 16#FF#, 16#03#, 16#FE#, 16#00#, 16#7F#,
16#03#, 16#F8#, 16#00#, 16#7F#, 16#07#, 16#F0#, 16#00#, 16#3E#, 16#07#,
16#E0#, 16#00#, 16#3E#, 16#07#, 16#E0#, 16#00#, 16#3E#, 16#07#, 16#C0#,
16#00#, 16#3E#, 16#0F#, 16#C0#, 16#00#, 16#3E#, 16#0F#, 16#80#, 16#00#,
16#3C#, 16#0F#, 16#80#, 16#00#, 16#7C#, 16#0F#, 16#80#, 16#00#, 16#7C#,
16#0F#, 16#00#, 16#00#, 16#7C#, 16#1F#, 16#00#, 16#00#, 16#78#, 16#1F#,
16#00#, 16#00#, 16#F8#, 16#1F#, 16#00#, 16#00#, 16#F8#, 16#1F#, 16#00#,
16#00#, 16#F8#, 16#3E#, 16#00#, 16#00#, 16#F8#, 16#3E#, 16#00#, 16#00#,
16#F0#, 16#3E#, 16#00#, 16#01#, 16#F0#, 16#3E#, 16#00#, 16#01#, 16#F0#,
16#3C#, 16#00#, 16#01#, 16#F0#, 16#7C#, 16#00#, 16#01#, 16#E0#, 16#7C#,
16#00#, 16#03#, 16#E0#, 16#7C#, 16#00#, 16#03#, 16#E0#, 16#7C#, 16#00#,
16#03#, 16#E0#, 16#78#, 16#00#, 16#03#, 16#C0#, 16#F8#, 16#00#, 16#03#,
16#C0#, 16#F8#, 16#00#, 16#07#, 16#C0#, 16#F8#, 16#00#, 16#07#, 16#C0#,
16#00#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#C0#, 16#00#,
16#3F#, 16#FF#, 16#F0#, 16#00#, 16#7F#, 16#FF#, 16#F8#, 16#01#, 16#FF#,
16#FF#, 16#FC#, 16#03#, 16#FE#, 16#03#, 16#FC#, 16#03#, 16#F8#, 16#01#,
16#FE#, 16#07#, 16#F0#, 16#00#, 16#FE#, 16#0F#, 16#E0#, 16#00#, 16#7F#,
16#0F#, 16#C0#, 16#00#, 16#7F#, 16#1F#, 16#80#, 16#00#, 16#3F#, 16#1F#,
16#80#, 16#00#, 16#3F#, 16#3F#, 16#00#, 16#00#, 16#3F#, 16#3F#, 16#00#,
16#00#, 16#3F#, 16#7E#, 16#00#, 16#00#, 16#3F#, 16#7E#, 16#00#, 16#00#,
16#3F#, 16#7E#, 16#00#, 16#00#, 16#3F#, 16#7E#, 16#00#, 16#00#, 16#7E#,
16#FC#, 16#00#, 16#00#, 16#7E#, 16#FC#, 16#00#, 16#00#, 16#7E#, 16#FC#,
16#00#, 16#00#, 16#7E#, 16#FC#, 16#00#, 16#00#, 16#FC#, 16#FC#, 16#00#,
16#00#, 16#FC#, 16#FC#, 16#00#, 16#01#, 16#F8#, 16#FC#, 16#00#, 16#01#,
16#F8#, 16#FE#, 16#00#, 16#03#, 16#F0#, 16#FE#, 16#00#, 16#07#, 16#F0#,
16#7F#, 16#00#, 16#0F#, 16#E0#, 16#7F#, 16#80#, 16#1F#, 16#C0#, 16#3F#,
16#C0#, 16#FF#, 16#C0#, 16#3F#, 16#FF#, 16#FF#, 16#80#, 16#1F#, 16#FF#,
16#FE#, 16#00#, 16#0F#, 16#FF#, 16#FC#, 16#00#, 16#03#, 16#FF#, 16#F0#,
16#00#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F8#,
16#00#, 16#01#, 16#F0#, 16#FF#, 16#F8#, 16#00#, 16#0F#, 16#9F#, 16#FF#,
16#E0#, 16#00#, 16#79#, 16#FF#, 16#FF#, 16#80#, 16#03#, 16#DF#, 16#FF#,
16#FE#, 16#00#, 16#3F#, 16#F8#, 16#1F#, 16#F0#, 16#01#, 16#FF#, 16#00#,
16#3F#, 16#C0#, 16#0F#, 16#F0#, 16#00#, 16#FE#, 16#00#, 16#7F#, 16#00#,
16#03#, 16#F8#, 16#03#, 16#F0#, 16#00#, 16#1F#, 16#C0#, 16#3F#, 16#00#,
16#00#, 16#7E#, 16#01#, 16#F8#, 16#00#, 16#03#, 16#F0#, 16#0F#, 16#80#,
16#00#, 16#1F#, 16#80#, 16#7C#, 16#00#, 16#00#, 16#FC#, 16#07#, 16#C0#,
16#00#, 16#07#, 16#E0#, 16#3E#, 16#00#, 16#00#, 16#3F#, 16#01#, 16#F0#,
16#00#, 16#01#, 16#F8#, 16#0F#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#F8#,
16#00#, 16#00#, 16#FC#, 16#07#, 16#C0#, 16#00#, 16#07#, 16#E0#, 16#3E#,
16#00#, 16#00#, 16#3F#, 16#01#, 16#F0#, 16#00#, 16#03#, 16#F8#, 16#0F#,
16#80#, 16#00#, 16#1F#, 16#80#, 16#FC#, 16#00#, 16#01#, 16#FC#, 16#07#,
16#E0#, 16#00#, 16#0F#, 16#C0#, 16#3F#, 16#00#, 16#00#, 16#FE#, 16#01#,
16#FC#, 16#00#, 16#0F#, 16#E0#, 16#1F#, 16#E0#, 16#00#, 16#FE#, 16#00#,
16#FF#, 16#80#, 16#0F#, 16#F0#, 16#07#, 16#FF#, 16#01#, 16#FF#, 16#00#,
16#3F#, 16#FF#, 16#FF#, 16#F0#, 16#03#, 16#F7#, 16#FF#, 16#FE#, 16#00#,
16#1F#, 16#1F#, 16#FF#, 16#E0#, 16#00#, 16#F8#, 16#7F#, 16#FC#, 16#00#,
16#07#, 16#C0#, 16#FF#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#,
16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#,
16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#,
16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#,
16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#,
16#FC#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#F0#, 16#FC#, 16#00#, 16#FF#,
16#FF#, 16#1F#, 16#00#, 16#3F#, 16#FF#, 16#F3#, 16#E0#, 16#0F#, 16#FF#,
16#FE#, 16#7C#, 16#07#, 16#FE#, 16#07#, 16#FF#, 16#80#, 16#FE#, 16#00#,
16#7F#, 16#E0#, 16#3F#, 16#80#, 16#07#, 16#FC#, 16#0F#, 16#E0#, 16#00#,
16#7F#, 16#81#, 16#F8#, 16#00#, 16#0F#, 16#F0#, 16#7E#, 16#00#, 16#00#,
16#FC#, 16#0F#, 16#C0#, 16#00#, 16#1F#, 16#83#, 16#F0#, 16#00#, 16#03#,
16#F0#, 16#7E#, 16#00#, 16#00#, 16#7E#, 16#1F#, 16#80#, 16#00#, 16#0F#,
16#C3#, 16#F0#, 16#00#, 16#01#, 16#F0#, 16#7E#, 16#00#, 16#00#, 16#3E#,
16#0F#, 16#C0#, 16#00#, 16#0F#, 16#C3#, 16#F0#, 16#00#, 16#01#, 16#F8#,
16#7E#, 16#00#, 16#00#, 16#3E#, 16#0F#, 16#C0#, 16#00#, 16#0F#, 16#C1#,
16#F8#, 16#00#, 16#01#, 16#F8#, 16#3F#, 16#00#, 16#00#, 16#3F#, 16#07#,
16#E0#, 16#00#, 16#0F#, 16#E0#, 16#FC#, 16#00#, 16#03#, 16#F8#, 16#1F#,
16#C0#, 16#00#, 16#7F#, 16#03#, 16#F8#, 16#00#, 16#1F#, 16#E0#, 16#3F#,
16#80#, 16#07#, 16#FC#, 16#07#, 16#F8#, 16#01#, 16#FF#, 16#00#, 16#7F#,
16#C1#, 16#FF#, 16#E0#, 16#0F#, 16#FF#, 16#FF#, 16#7C#, 16#00#, 16#FF#,
16#FF#, 16#CF#, 16#80#, 16#0F#, 16#FF#, 16#F3#, 16#E0#, 16#00#, 16#7F#,
16#F8#, 16#7C#, 16#00#, 16#03#, 16#F8#, 16#0F#, 16#80#, 16#00#, 16#00#,
16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#00#,
16#0F#, 16#80#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#,
16#3E#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#01#,
16#F0#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#07#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#3E#,
16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#3E#,
16#03#, 16#C1#, 16#FC#, 16#07#, 16#8F#, 16#F0#, 16#1F#, 16#3F#, 16#E0#,
16#3E#, 16#FF#, 16#C0#, 16#7F#, 16#F8#, 16#00#, 16#FF#, 16#80#, 16#01#,
16#FE#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#1F#,
16#80#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#01#, 16#F0#,
16#00#, 16#03#, 16#E0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#3E#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#F8#, 16#00#,
16#01#, 16#F0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#0F#, 16#80#, 16#00#,
16#1F#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#78#, 16#00#, 16#01#,
16#F0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#0F#,
16#80#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#F8#,
16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FE#, 16#00#,
16#00#, 16#7F#, 16#FF#, 16#00#, 16#03#, 16#FF#, 16#FE#, 16#00#, 16#3F#,
16#FF#, 16#FC#, 16#01#, 16#FF#, 16#FF#, 16#F8#, 16#0F#, 16#F8#, 16#1F#,
16#F0#, 16#3F#, 16#80#, 16#1F#, 16#C1#, 16#F8#, 16#00#, 16#3F#, 16#07#,
16#E0#, 16#00#, 16#FC#, 16#3F#, 16#00#, 16#03#, 16#F0#, 16#FC#, 16#00#,
16#00#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#00#,
16#3F#, 16#C0#, 16#00#, 16#00#, 16#FF#, 16#C0#, 16#00#, 16#01#, 16#FF#,
16#F0#, 16#00#, 16#03#, 16#FF#, 16#FC#, 16#00#, 16#07#, 16#FF#, 16#FE#,
16#00#, 16#07#, 16#FF#, 16#FC#, 16#00#, 16#03#, 16#FF#, 16#F8#, 16#00#,
16#00#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#00#,
16#7F#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#FC#, 16#00#, 16#03#, 16#F3#,
16#F0#, 16#00#, 16#0F#, 16#CF#, 16#C0#, 16#00#, 16#7E#, 16#3F#, 16#80#,
16#03#, 16#F8#, 16#FE#, 16#00#, 16#1F#, 16#E3#, 16#FE#, 16#01#, 16#FF#,
16#07#, 16#FF#, 16#FF#, 16#F8#, 16#0F#, 16#FF#, 16#FF#, 16#C0#, 16#1F#,
16#FF#, 16#FC#, 16#00#, 16#3F#, 16#FF#, 16#E0#, 16#00#, 16#1F#, 16#F8#,
16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#7C#, 16#00#, 16#3E#, 16#00#,
16#3E#, 16#00#, 16#1F#, 16#00#, 16#0F#, 16#80#, 16#07#, 16#C0#, 16#07#,
16#C0#, 16#03#, 16#E0#, 16#1F#, 16#FF#, 16#DF#, 16#FF#, 16#CF#, 16#FF#,
16#E7#, 16#FF#, 16#F0#, 16#3E#, 16#00#, 16#1F#, 16#00#, 16#0F#, 16#80#,
16#07#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#E0#, 16#01#, 16#F0#, 16#00#,
16#F8#, 16#00#, 16#78#, 16#00#, 16#7C#, 16#00#, 16#3E#, 16#00#, 16#1F#,
16#00#, 16#0F#, 16#00#, 16#0F#, 16#80#, 16#07#, 16#C0#, 16#03#, 16#E0#,
16#01#, 16#F0#, 16#00#, 16#F0#, 16#00#, 16#F8#, 16#00#, 16#7C#, 16#00#,
16#3E#, 16#00#, 16#1F#, 16#00#, 16#1F#, 16#80#, 16#0F#, 16#C0#, 16#07#,
16#F0#, 16#03#, 16#FF#, 16#81#, 16#FF#, 16#C0#, 16#7F#, 16#E0#, 16#1F#,
16#E0#, 16#07#, 16#F0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#1F#, 16#03#,
16#C0#, 16#00#, 16#1F#, 16#07#, 16#C0#, 16#00#, 16#1F#, 16#07#, 16#C0#,
16#00#, 16#1E#, 16#07#, 16#C0#, 16#00#, 16#3E#, 16#07#, 16#80#, 16#00#,
16#3E#, 16#0F#, 16#80#, 16#00#, 16#3E#, 16#0F#, 16#80#, 16#00#, 16#3E#,
16#0F#, 16#80#, 16#00#, 16#7C#, 16#0F#, 16#80#, 16#00#, 16#7C#, 16#0F#,
16#00#, 16#00#, 16#7C#, 16#1F#, 16#00#, 16#00#, 16#7C#, 16#1F#, 16#00#,
16#00#, 16#78#, 16#1F#, 16#00#, 16#00#, 16#F8#, 16#1E#, 16#00#, 16#00#,
16#F8#, 16#3E#, 16#00#, 16#00#, 16#F8#, 16#3E#, 16#00#, 16#00#, 16#F8#,
16#3E#, 16#00#, 16#01#, 16#F0#, 16#3E#, 16#00#, 16#01#, 16#F0#, 16#3C#,
16#00#, 16#01#, 16#F0#, 16#7C#, 16#00#, 16#01#, 16#F0#, 16#7C#, 16#00#,
16#03#, 16#E0#, 16#7C#, 16#00#, 16#03#, 16#E0#, 16#7C#, 16#00#, 16#07#,
16#E0#, 16#FC#, 16#00#, 16#07#, 16#E0#, 16#FC#, 16#00#, 16#0F#, 16#E0#,
16#FE#, 16#00#, 16#1F#, 16#C0#, 16#FF#, 16#00#, 16#7F#, 16#C0#, 16#FF#,
16#81#, 16#FF#, 16#C0#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#7F#, 16#FF#,
16#F7#, 16#80#, 16#3F#, 16#FF#, 16#C7#, 16#80#, 16#1F#, 16#FF#, 16#0F#,
16#80#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#FF#,
16#F0#, 16#00#, 16#03#, 16#EF#, 16#C0#, 16#00#, 16#1F#, 16#9F#, 16#00#,
16#00#, 16#FC#, 16#7E#, 16#00#, 16#03#, 16#F1#, 16#F8#, 16#00#, 16#1F#,
16#87#, 16#E0#, 16#00#, 16#7C#, 16#1F#, 16#80#, 16#03#, 16#F0#, 16#7E#,
16#00#, 16#0F#, 16#81#, 16#F8#, 16#00#, 16#7E#, 16#03#, 16#E0#, 16#03#,
16#F0#, 16#0F#, 16#80#, 16#0F#, 16#80#, 16#3E#, 16#00#, 16#7E#, 16#00#,
16#FC#, 16#01#, 16#F0#, 16#03#, 16#F0#, 16#0F#, 16#C0#, 16#0F#, 16#C0#,
16#7E#, 16#00#, 16#3F#, 16#01#, 16#F0#, 16#00#, 16#7C#, 16#0F#, 16#C0#,
16#01#, 16#F0#, 16#3E#, 16#00#, 16#07#, 16#C1#, 16#F8#, 16#00#, 16#1F#,
16#07#, 16#C0#, 16#00#, 16#7C#, 16#3E#, 16#00#, 16#01#, 16#F9#, 16#F8#,
16#00#, 16#07#, 16#E7#, 16#C0#, 16#00#, 16#0F#, 16#BF#, 16#00#, 16#00#,
16#3E#, 16#F8#, 16#00#, 16#00#, 16#FF#, 16#C0#, 16#00#, 16#03#, 16#FF#,
16#00#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#,
16#00#, 16#FF#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#07#,
16#E0#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#1F#, 16#80#, 16#03#, 16#FF#,
16#C0#, 16#03#, 16#F8#, 16#00#, 16#3E#, 16#FC#, 16#00#, 16#3F#, 16#80#,
16#07#, 16#EF#, 16#C0#, 16#07#, 16#F8#, 16#00#, 16#7C#, 16#FC#, 16#00#,
16#7F#, 16#80#, 16#0F#, 16#CF#, 16#C0#, 16#0F#, 16#F8#, 16#00#, 16#F8#,
16#7C#, 16#00#, 16#FF#, 16#80#, 16#0F#, 16#87#, 16#C0#, 16#0F#, 16#F8#,
16#01#, 16#F0#, 16#7E#, 16#01#, 16#F7#, 16#80#, 16#1F#, 16#07#, 16#E0#,
16#1F#, 16#78#, 16#03#, 16#E0#, 16#7E#, 16#03#, 16#E7#, 16#80#, 16#3E#,
16#07#, 16#E0#, 16#3E#, 16#78#, 16#07#, 16#C0#, 16#7E#, 16#07#, 16#C7#,
16#80#, 16#7C#, 16#07#, 16#E0#, 16#7C#, 16#7C#, 16#0F#, 16#80#, 16#7E#,
16#0F#, 16#87#, 16#C0#, 16#F8#, 16#07#, 16#E0#, 16#F8#, 16#7C#, 16#1F#,
16#00#, 16#7E#, 16#1F#, 16#07#, 16#C1#, 16#F0#, 16#07#, 16#E1#, 16#F0#,
16#7C#, 16#3E#, 16#00#, 16#7E#, 16#3E#, 16#07#, 16#C3#, 16#E0#, 16#03#,
16#E3#, 16#E0#, 16#7C#, 16#7C#, 16#00#, 16#3E#, 16#3C#, 16#03#, 16#C7#,
16#C0#, 16#03#, 16#E7#, 16#C0#, 16#3C#, 16#F8#, 16#00#, 16#3E#, 16#78#,
16#03#, 16#CF#, 16#80#, 16#03#, 16#EF#, 16#80#, 16#3D#, 16#F0#, 16#00#,
16#3F#, 16#F0#, 16#03#, 16#DF#, 16#00#, 16#03#, 16#FF#, 16#00#, 16#3F#,
16#E0#, 16#00#, 16#3F#, 16#F0#, 16#03#, 16#FE#, 16#00#, 16#03#, 16#FE#,
16#00#, 16#3F#, 16#C0#, 16#00#, 16#3F#, 16#E0#, 16#03#, 16#FC#, 16#00#,
16#03#, 16#FC#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#3F#, 16#C0#, 16#03#,
16#F8#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#1F#,
16#80#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#07#,
16#E0#, 16#0F#, 16#C0#, 16#00#, 16#FC#, 16#00#, 16#7E#, 16#00#, 16#0F#,
16#80#, 16#07#, 16#E0#, 16#01#, 16#F8#, 16#00#, 16#3F#, 16#00#, 16#3F#,
16#00#, 16#03#, 16#F0#, 16#07#, 16#E0#, 16#00#, 16#1F#, 16#80#, 16#FC#,
16#00#, 16#01#, 16#F8#, 16#1F#, 16#80#, 16#00#, 16#0F#, 16#83#, 16#F0#,
16#00#, 16#00#, 16#FC#, 16#7E#, 16#00#, 16#00#, 16#07#, 16#CF#, 16#C0#,
16#00#, 16#00#, 16#7E#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#00#,
16#00#, 16#00#, 16#3F#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#FE#, 16#00#,
16#00#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#,
16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#FC#, 16#00#,
16#00#, 16#00#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#1F#, 16#FE#, 16#00#,
16#00#, 16#03#, 16#F3#, 16#F0#, 16#00#, 16#00#, 16#7E#, 16#3F#, 16#00#,
16#00#, 16#07#, 16#C3#, 16#F8#, 16#00#, 16#00#, 16#FC#, 16#1F#, 16#80#,
16#00#, 16#1F#, 16#81#, 16#F8#, 16#00#, 16#03#, 16#F0#, 16#0F#, 16#C0#,
16#00#, 16#7E#, 16#00#, 16#FC#, 16#00#, 16#0F#, 16#C0#, 16#07#, 16#E0#,
16#01#, 16#F8#, 16#00#, 16#7E#, 16#00#, 16#3F#, 16#00#, 16#03#, 16#F0#,
16#07#, 16#E0#, 16#00#, 16#3F#, 16#00#, 16#7E#, 16#00#, 16#01#, 16#F8#,
16#00#, 16#00#, 16#F8#, 16#00#, 16#01#, 16#F0#, 16#07#, 16#E0#, 16#00#,
16#1F#, 16#80#, 16#3F#, 16#00#, 16#00#, 16#F8#, 16#01#, 16#F8#, 16#00#,
16#0F#, 16#80#, 16#0F#, 16#C0#, 16#00#, 16#7C#, 16#00#, 16#7E#, 16#00#,
16#07#, 16#C0#, 16#01#, 16#F0#, 16#00#, 16#7E#, 16#00#, 16#0F#, 16#80#,
16#03#, 16#E0#, 16#00#, 16#7C#, 16#00#, 16#3F#, 16#00#, 16#03#, 16#E0#,
16#01#, 16#F0#, 16#00#, 16#1F#, 16#80#, 16#1F#, 16#00#, 16#00#, 16#FC#,
16#00#, 16#F8#, 16#00#, 16#07#, 16#E0#, 16#0F#, 16#80#, 16#00#, 16#3F#,
16#00#, 16#FC#, 16#00#, 16#00#, 16#F8#, 16#07#, 16#C0#, 16#00#, 16#07#,
16#C0#, 16#7C#, 16#00#, 16#00#, 16#3E#, 16#03#, 16#E0#, 16#00#, 16#01#,
16#F0#, 16#3E#, 16#00#, 16#00#, 16#0F#, 16#83#, 16#F0#, 16#00#, 16#00#,
16#7E#, 16#1F#, 16#00#, 16#00#, 16#03#, 16#F1#, 16#F0#, 16#00#, 16#00#,
16#1F#, 16#8F#, 16#80#, 16#00#, 16#00#, 16#7C#, 16#F8#, 16#00#, 16#00#,
16#03#, 16#EF#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#7C#, 16#00#, 16#00#,
16#00#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#FE#, 16#00#, 16#00#,
16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#00#,
16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#,
16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#,
16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#,
16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#1F#, 16#FC#, 16#00#,
16#00#, 16#01#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#FC#, 16#00#,
16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#7F#,
16#FF#, 16#FF#, 16#C0#, 16#3F#, 16#FF#, 16#FF#, 16#E0#, 16#1F#, 16#FF#,
16#FF#, 16#E0#, 16#0F#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#01#,
16#F8#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#01#, 16#F0#,
16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#,
16#00#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#,
16#03#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#03#,
16#F0#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#F0#,
16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#,
16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#,
16#07#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#07#,
16#E0#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#E0#,
16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#00#,
16#00#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#03#, 16#FF#, 16#FF#, 16#FF#,
16#83#, 16#FF#, 16#FF#, 16#FF#, 16#81#, 16#FF#, 16#FF#, 16#FF#, 16#C0#,
16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#,
16#0F#, 16#E0#, 16#00#, 16#FF#, 16#80#, 16#03#, 16#FE#, 16#00#, 16#1F#,
16#80#, 16#00#, 16#7C#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#0F#, 16#80#,
16#00#, 16#3E#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#07#, 16#C0#, 16#00#,
16#1F#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#0F#,
16#80#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#03#, 16#E0#,
16#00#, 16#1F#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#F0#, 16#00#,
16#07#, 16#C0#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#07#,
16#E0#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#0F#, 16#C0#,
16#00#, 16#FE#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#0F#, 16#C0#, 16#00#,
16#3F#, 16#80#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#01#,
16#F0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#7C#,
16#00#, 16#01#, 16#F0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#1F#, 16#00#,
16#00#, 16#7C#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#0F#, 16#80#, 16#00#,
16#3E#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#1F#,
16#00#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#07#, 16#C0#,
16#00#, 16#3E#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#03#, 16#E0#, 16#00#,
16#0F#, 16#C0#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#FF#, 16#80#, 16#01#,
16#FE#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#,
16#07#, 16#00#, 16#06#, 16#00#, 16#0E#, 16#00#, 16#0E#, 16#00#, 16#0E#,
16#00#, 16#0E#, 16#00#, 16#1C#, 16#00#, 16#1C#, 16#00#, 16#1C#, 16#00#,
16#1C#, 16#00#, 16#18#, 16#00#, 16#38#, 16#00#, 16#38#, 16#00#, 16#38#,
16#00#, 16#30#, 16#00#, 16#70#, 16#00#, 16#70#, 16#00#, 16#70#, 16#00#,
16#70#, 16#00#, 16#60#, 16#00#, 16#E0#, 16#00#, 16#E0#, 16#00#, 16#E0#,
16#00#, 16#C0#, 16#01#, 16#C0#, 16#01#, 16#C0#, 16#01#, 16#C0#, 16#01#,
16#80#, 16#03#, 16#80#, 16#03#, 16#80#, 16#03#, 16#80#, 16#03#, 16#80#,
16#03#, 16#00#, 16#07#, 16#00#, 16#07#, 16#00#, 16#07#, 16#00#, 16#06#,
16#00#, 16#0E#, 16#00#, 16#0E#, 16#00#, 16#0E#, 16#00#, 16#0E#, 16#00#,
16#1C#, 16#00#, 16#1C#, 16#00#, 16#1C#, 16#00#, 16#1C#, 16#00#, 16#18#,
16#00#, 16#38#, 16#00#, 16#38#, 16#00#, 16#38#, 16#00#, 16#30#, 16#00#,
16#70#, 16#00#, 16#70#, 16#00#, 16#70#, 16#00#, 16#70#, 16#00#, 16#E0#,
16#00#, 16#E0#, 16#00#, 16#E0#, 16#00#, 16#20#, 16#00#, 16#00#, 16#07#,
16#E0#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#7F#, 16#80#, 16#01#, 16#FF#,
16#00#, 16#00#, 16#FC#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#07#, 16#C0#,
16#00#, 16#1F#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#03#, 16#E0#, 16#00#,
16#0F#, 16#80#, 16#00#, 16#3E#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#07#,
16#C0#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#F0#,
16#00#, 16#0F#, 16#80#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#F8#, 16#00#,
16#03#, 16#E0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#3E#, 16#00#, 16#00#,
16#F8#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#1F#,
16#80#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#03#, 16#F0#,
16#00#, 16#1F#, 16#C0#, 16#00#, 16#FC#, 16#00#, 16#07#, 16#C0#, 16#00#,
16#3E#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#3F#,
16#00#, 16#00#, 16#F8#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#0F#, 16#80#,
16#00#, 16#3E#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#07#, 16#C0#, 16#00#,
16#1F#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#0F#,
16#80#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#03#, 16#E0#,
16#00#, 16#1F#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#F0#, 16#00#,
16#0F#, 16#80#, 16#00#, 16#7E#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#7F#,
16#C0#, 16#01#, 16#FC#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#03#,
16#E0#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#07#, 16#1F#, 16#FC#, 16#00#,
16#73#, 16#FF#, 16#E0#, 16#0E#, 16#3C#, 16#7F#, 16#80#, 16#E7#, 16#81#,
16#FE#, 16#1E#, 16#70#, 16#0F#, 16#FF#, 16#CF#, 16#00#, 16#3F#, 16#F8#,
16#E0#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#07#, 16#C0#);
FreeSansOblique32pt7bGlyphs : aliased constant Glyph_Array := (
(0, 0, 0, 18, 0, 1), -- 0x20 ' '
(0, 15, 46, 18, 8, -45), -- 0x21 '!'
(87, 17, 15, 22, 11, -44), -- 0x22 '"'
(119, 38, 45, 35, 3, -43), -- 0x23 '#'
(333, 34, 57, 35, 4, -48), -- 0x24 '$'
(576, 48, 46, 56, 8, -44), -- 0x25 '%'
(852, 36, 46, 42, 5, -44), -- 0x26 '&'
(1059, 7, 15, 12, 11, -44), -- 0x27 '''
(1073, 21, 59, 21, 7, -45), -- 0x28 '('
(1228, 21, 59, 21, 0, -45), -- 0x29 ')'
(1383, 19, 19, 25, 11, -45), -- 0x2A '*'
(1429, 31, 30, 37, 6, -28), -- 0x2B '+'
(1546, 10, 15, 18, 3, -5), -- 0x2C ','
(1565, 16, 5, 21, 6, -19), -- 0x2D '-'
(1575, 8, 6, 18, 5, -5), -- 0x2E '.'
(1581, 28, 47, 18, -1, -45), -- 0x2F '/'
(1746, 32, 46, 35, 6, -44), -- 0x30 '0'
(1930, 18, 45, 35, 13, -44), -- 0x31 '1'
(2032, 37, 45, 35, 3, -44), -- 0x32 '2'
(2241, 34, 46, 35, 4, -44), -- 0x33 '3'
(2437, 32, 45, 35, 4, -44), -- 0x34 '4'
(2617, 36, 46, 35, 4, -44), -- 0x35 '5'
(2824, 33, 46, 35, 6, -44), -- 0x36 '6'
(3014, 33, 45, 35, 9, -44), -- 0x37 '7'
(3200, 34, 46, 35, 5, -44), -- 0x38 '8'
(3396, 33, 46, 35, 5, -44), -- 0x39 '9'
(3586, 14, 33, 18, 6, -32), -- 0x3A ':'
(3644, 16, 42, 18, 4, -32), -- 0x3B ';'
(3728, 35, 30, 37, 5, -28), -- 0x3C '<'
(3860, 33, 16, 37, 5, -22), -- 0x3D '='
(3926, 35, 30, 37, 3, -29), -- 0x3E '>'
(4058, 28, 47, 35, 12, -46), -- 0x3F '?'
(4223, 60, 56, 64, 5, -46), -- 0x40 '@'
(4643, 40, 46, 42, 1, -45), -- 0x41 'A'
(4873, 39, 46, 42, 5, -45), -- 0x42 'B'
(5098, 42, 48, 45, 6, -46), -- 0x43 'C'
(5350, 42, 46, 44, 5, -45), -- 0x44 'D'
(5592, 42, 46, 41, 5, -45), -- 0x45 'E'
(5834, 41, 46, 38, 5, -45), -- 0x46 'F'
(6070, 44, 48, 49, 7, -46), -- 0x47 'G'
(6334, 45, 46, 45, 5, -45), -- 0x48 'H'
(6593, 15, 46, 18, 6, -45), -- 0x49 'I'
(6680, 34, 47, 32, 3, -45), -- 0x4A 'J'
(6880, 46, 46, 42, 5, -45), -- 0x4B 'K'
(7145, 30, 46, 35, 5, -45), -- 0x4C 'L'
(7318, 53, 46, 53, 5, -45), -- 0x4D 'M'
(7623, 46, 46, 46, 5, -45), -- 0x4E 'N'
(7888, 46, 48, 49, 6, -46), -- 0x4F 'O'
(8164, 40, 46, 41, 5, -45), -- 0x50 'P'
(8394, 46, 51, 49, 6, -46), -- 0x51 'Q'
(8688, 43, 46, 45, 5, -45), -- 0x52 'R'
(8936, 40, 48, 41, 5, -46), -- 0x53 'S'
(9176, 37, 46, 38, 10, -45), -- 0x54 'T'
(9389, 42, 47, 45, 8, -45), -- 0x55 'U'
(9636, 38, 46, 41, 11, -45), -- 0x56 'V'
(9855, 57, 46, 59, 11, -45), -- 0x57 'W'
(10183, 49, 46, 42, 1, -45), -- 0x58 'X'
(10465, 40, 46, 43, 11, -45), -- 0x59 'Y'
(10695, 45, 46, 38, 2, -45), -- 0x5A 'Z'
(10954, 25, 59, 18, 1, -45), -- 0x5B '['
(11139, 8, 47, 18, 9, -45), -- 0x5C '\'
(11186, 25, 59, 18, -2, -45), -- 0x5D ']'
(11371, 23, 24, 30, 8, -44), -- 0x5E '^'
(11440, 39, 3, 35, -4, 9), -- 0x5F '_'
(11455, 11, 9, 21, 11, -46), -- 0x60 '`'
(11468, 32, 35, 35, 4, -33), -- 0x61 'a'
(11608, 34, 47, 35, 4, -45), -- 0x62 'b'
(11808, 30, 35, 32, 5, -33), -- 0x63 'c'
(11940, 36, 47, 35, 5, -45), -- 0x64 'd'
(12152, 32, 35, 34, 5, -33), -- 0x65 'e'
(12292, 20, 46, 16, 4, -45), -- 0x66 'f'
(12407, 36, 48, 35, 2, -33), -- 0x67 'g'
(12623, 32, 46, 34, 4, -45), -- 0x68 'h'
(12807, 15, 46, 14, 4, -45), -- 0x69 'i'
(12894, 23, 60, 15, -3, -45), -- 0x6A 'j'
(13067, 33, 46, 32, 4, -45), -- 0x6B 'k'
(13257, 15, 46, 14, 4, -45), -- 0x6C 'l'
(13344, 49, 34, 51, 4, -33), -- 0x6D 'm'
(13553, 32, 34, 34, 4, -33), -- 0x6E 'n'
(13689, 32, 35, 35, 5, -33), -- 0x6F 'o'
(13829, 37, 47, 35, 1, -33), -- 0x70 'p'
(14047, 35, 47, 35, 4, -33), -- 0x71 'q'
(14253, 23, 34, 20, 4, -33), -- 0x72 'r'
(14351, 30, 35, 31, 4, -33), -- 0x73 's'
(14483, 17, 43, 17, 5, -41), -- 0x74 't'
(14575, 32, 34, 34, 5, -32), -- 0x75 'u'
(14711, 30, 33, 31, 8, -32), -- 0x76 'v'
(14835, 44, 33, 46, 8, -32), -- 0x77 'w'
(15017, 36, 33, 31, 1, -32), -- 0x78 'x'
(15166, 37, 47, 30, 0, -32), -- 0x79 'y'
(15384, 33, 33, 31, 2, -32), -- 0x7A 'z'
(15521, 22, 59, 21, 6, -45), -- 0x7B '{'
(15684, 16, 59, 16, 3, -45), -- 0x7C '|'
(15802, 22, 59, 21, -2, -45), -- 0x7D '}'
(15965, 28, 10, 37, 9, -26)); -- 0x7E '~'
Font_D : aliased constant Bitmap_Font :=
(FreeSansOblique32pt7bBitmaps'Access,
FreeSansOblique32pt7bGlyphs'Access,
75);
Font : constant Giza.Font.Ref_Const := Font_D'Access;
end Giza.Bitmap_Fonts.FreeSansOblique32pt7b;
|
package body LATIN_FILE_NAMES is
function ADD_FILE_NAME_EXTENSION(NAME, EXTENSION : STRING) return STRING is
-- This is the version that creates a DOS file name
-- One that has a name, a '.', and an extension no longer than 3 characters
-- Arbitarily, we also truncate the NAME to 8 characters
-- To port to another system, one needs to do this function appropriately
NAME_LENGTH : INTEGER := NAME'LENGTH;
EXTENSION_LENGTH : INTEGER := EXTENSION'LENGTH;
begin
if NAME_LENGTH >= 8 then
NAME_LENGTH := 8;
end if;
if EXTENSION'LENGTH >= 3 then
EXTENSION_LENGTH := 3;
end if;
return NAME(1..NAME_LENGTH) & '.' & EXTENSION(1..EXTENSION_LENGTH);
end ADD_FILE_NAME_EXTENSION;
end LATIN_FILE_NAMES;
|
with Ada.Text_IO;
procedure Integers is
Value : Integer := 1;
begin
loop
Ada.Text_IO.Put_Line (Integer'Image (Value));
Value := Value + 1; -- raises exception Constraint_Error on overflow
end loop;
end Integers;
|
-- 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.MP_RAT is
-- Item
--
subtype Item is gmp_c.a_a_mpq_struct.Item;
-- Items
--
type Items is
array (Interfaces.C.size_t range <>) of aliased gmp_c.MP_RAT.Item;
-- Pointer
--
type Pointer is access all gmp_c.MP_RAT.Item;
-- Pointers
--
type Pointers is
array (Interfaces.C.size_t range <>) of aliased gmp_c.MP_RAT.Pointer;
-- Pointer_Pointer
--
type Pointer_Pointer is access all gmp_c.MP_RAT.Pointer;
end gmp_c.MP_RAT;
|
with Asis,
AdaM.Source;
package AdaM.Assist.Query.find_All.Actuals_for_traversing
is
type Traversal_State is
record
parent_Stack : AdaM.Source.Entities;
ignore_Starter : asis.Element := asis.Nil_Element;
end record;
Initial_Traversal_State : constant Traversal_State := (others => <>);
procedure Pre_Op
(Element : Asis.Element;
Control : in out Asis.Traverse_Control;
State : in out Traversal_State);
procedure Post_Op
(Element : Asis.Element;
Control : in out Asis.Traverse_Control;
State : in out Traversal_State);
end AdaM.Assist.Query.find_All.Actuals_for_traversing;
|
-- generated parser support file.
-- command line: wisitoken-bnf-generate.exe --generate LR1 Ada_Emacs re2c PROCESS text_rep ada.wy
--
-- Copyright (C) 2013 - 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, or (at
-- your option) any later version.
--
-- This software 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 GNU Emacs. If not, see <http://www.gnu.org/licenses/>.
with Wisi; use Wisi;
with Wisi.Ada; use Wisi.Ada;
package body Ada_Process_Actions is
use WisiToken.Semantic_Checks;
use all type Motion_Param_Array;
procedure abstract_subprogram_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_Override), (6,
Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end abstract_subprogram_declaration_0;
procedure accept_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Motion), (9, Statement_End)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (5, Invalid_Token_ID) & (6, 72) &
(9, Invalid_Token_ID)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, 3, 1), (8, 3, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (True, (Simple, (Label => None)), (Simple, (Int, Ada_Indent))), (True, (Simple, (Int,
Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label =>
None))), (False, (Simple, (Label => None)))));
end case;
end accept_statement_0;
function accept_statement_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 2, 8, End_Names_Optional);
end accept_statement_0_check;
procedure accept_statement_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Statement_End)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end accept_statement_1;
procedure access_definition_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple,
(Anchored_1, 4, Ada_Indent_Broken)))));
end case;
end access_definition_0;
procedure access_definition_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple,
(Anchored_2, 4, Ada_Indent_Broken)))));
end case;
end access_definition_1;
procedure access_definition_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (4, 1, 2)));
when Indent =>
null;
end case;
end access_definition_2;
procedure actual_parameter_part_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple,
(Anchored_0, 1, 1)), (Simple, (Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 0)))));
end case;
end actual_parameter_part_0;
procedure actual_parameter_part_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple,
(Anchored_0, 1, 1)), (Simple, (Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 0)))));
end case;
end actual_parameter_part_1;
procedure aggregate_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 1))), (False, (Simple, (Label => None))), (False,
(Simple, (Label => None))), (False, (Simple, (Anchored_0, 1, 0)))));
end case;
end aggregate_0;
procedure aggregate_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 1))), (True, (Simple, (Anchored_0, 1, 1)), (Simple,
(Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 0)))));
end case;
end aggregate_1;
procedure aggregate_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple,
(Anchored_0, 1, 1)), (Simple, (Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 0)))));
end case;
end aggregate_3;
procedure aggregate_4
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple,
(Anchored_0, 1, 1)), (Simple, (Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 0)))));
end case;
end aggregate_4;
procedure array_type_definition_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Anchored_0, 2, 1))), (False, (Simple, (Anchored_0, 2, 0))), (False,
(Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end array_type_definition_0;
procedure array_type_definition_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Anchored_0, 2, 1))), (False, (Simple, (Anchored_0, 2, 0))), (False,
(Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end array_type_definition_1;
procedure aspect_clause_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Statement_End)));
when Face =>
null;
when Indent =>
null;
end case;
end aspect_clause_0;
procedure aspect_specification_opt_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken)))));
end case;
end aspect_specification_opt_0;
procedure assignment_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Hanging_0, (Anchored_1, 2, Ada_Indent_Broken), (Anchored_1, 3,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end assignment_statement_0;
procedure association_opt_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (True, (Simple, (Anchored_1, 2, Ada_Indent_Broken)), (Simple, (Anchored_1, 2,
Ada_Indent_Broken)))));
end case;
end association_opt_0;
procedure association_opt_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Hanging_0, (Label => None), (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (True, (Hanging_3, (Anchored_1, 2,
Ada_Indent_Broken), (Anchored_1, 2, 2 * Ada_Indent_Broken)), (Hanging_3, (Anchored_1, 2, Ada_Indent_Broken),
(Anchored_1, 2, 2 * Ada_Indent_Broken)))));
end case;
end association_opt_2;
procedure association_opt_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Hanging_0, (Label => None), (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end association_opt_3;
procedure association_opt_4
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, (1 => (True, (Hanging_0, (Label => None), (Int,
Ada_Indent_Broken)), (Hanging_0, (Label => None), (Int, Ada_Indent_Broken)))));
end case;
end association_opt_4;
procedure asynchronous_select_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Motion), (8, Statement_End)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (3, Invalid_Token_ID) & (8,
Invalid_Token_ID)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple, (Int,
Ada_Indent)), (Simple, (Int, Ada_Indent))), (True, (Simple, (Label => None)), (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (True, (Simple, (Int, Ada_Indent)),
(Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False,
(Simple, (Label => None)))));
end case;
end asynchronous_select_0;
procedure at_clause_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Statement_End)));
when Face =>
null;
when Indent =>
null;
end case;
end at_clause_0;
procedure block_label_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Int, Ada_Indent_Label))), (False,
(Simple, (Label => None)))));
end case;
end block_label_0;
function block_label_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Propagate_Name (Nonterm, Tokens, 1);
end block_label_0_check;
function block_label_opt_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Propagate_Name (Nonterm, Tokens, 1);
end block_label_opt_0_check;
procedure block_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Motion), (4, Motion), (8,
Statement_End)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, Invalid_Token_ID) & (4, Invalid_Token_ID) & (5, 72) &
(8, Invalid_Token_ID)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label
=> None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label =>
None))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end block_statement_0;
function block_statement_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 1, 7, End_Names_Optional);
end block_statement_0_check;
procedure block_statement_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Motion), (6, Statement_End)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, Invalid_Token_ID) & (3, 72) & (6, Invalid_Token_ID)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label
=> None))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end block_statement_1;
function block_statement_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 1, 5, End_Names_Optional);
end block_statement_1_check;
procedure case_expression_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Motion)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (4, Invalid_Token_ID)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Int, Ada_Indent_When)))));
end case;
end case_expression_0;
procedure case_expression_alternative_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Motion)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Hanging_0, (Anchored_1, 1,
Ada_Indent), (Anchored_1, 1, Ada_Indent + Ada_Indent_Broken)))));
end case;
end case_expression_alternative_0;
procedure case_expression_alternative_list_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (3, Invalid_Token_ID)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple,
(Label => None)), (Simple, (Int, Ada_Indent_When))), (False, (Simple, (Label => None)))));
end case;
end case_expression_alternative_list_0;
procedure case_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (4, Invalid_Token_ID) & (7,
Invalid_Token_ID)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (True, (Simple, (Int, Ada_Indent_When)),
(Simple, (Int, Ada_Indent_When))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))),
(False, (Simple, (Label => None)))));
end case;
end case_statement_0;
procedure case_statement_alternative_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Motion)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (True, (Simple, (Int, Ada_Indent)),
(Simple, (Int, Ada_Indent)))));
end case;
end case_statement_alternative_0;
procedure case_statement_alternative_list_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (2, Invalid_Token_ID)));
when Face =>
null;
when Indent =>
null;
end case;
end case_statement_alternative_list_0;
procedure compilation_unit_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Int, 0))), (False, (Simple, (Int,
0)))));
end case;
end compilation_unit_2;
procedure compilation_unit_list_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Int, 0))), (True, (Simple, (Int, 0)),
(Simple, (Int, 0)))));
end case;
end compilation_unit_list_0;
procedure compilation_unit_list_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, (1 => (True, (Simple, (Int, 0)), (Simple, (Int, 0)))));
end case;
end compilation_unit_list_1;
function compilation_unit_list_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Tokens);
begin
return Terminate_Partial_Parse (Partial_Parse_Active, Partial_Parse_Byte_Goal, Recover_Active, Nonterm);
end compilation_unit_list_1_check;
procedure component_clause_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (8, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end component_clause_0;
procedure component_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 4, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end component_declaration_0;
procedure component_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end component_declaration_1;
procedure component_list_4
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_End)));
when Face =>
null;
when Indent =>
null;
end case;
end component_list_4;
procedure conditional_entry_call_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Motion), (7, Statement_End)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (3, Invalid_Token_ID) & (7,
Invalid_Token_ID)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple, (Int,
Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))), (True, (Simple, (Int,
Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label =>
None))), (False, (Simple, (Label => None)))));
end case;
end conditional_entry_call_0;
procedure declaration_9
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Hanging_0, (Label => None), (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 4,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end declaration_9;
procedure delay_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end delay_statement_0;
procedure delay_statement_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end delay_statement_1;
procedure derived_type_definition_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1, 2)));
when Indent =>
null;
end case;
end derived_type_definition_0;
procedure derived_type_definition_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1, 2)));
when Indent =>
null;
end case;
end derived_type_definition_1;
procedure discriminant_part_opt_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 0)))));
end case;
end discriminant_part_opt_1;
procedure elsif_expression_item_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Motion), (3, Motion)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (3, Invalid_Token_ID)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple, (Int,
Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent)))));
end case;
end elsif_expression_item_0;
procedure elsif_expression_list_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (2, Invalid_Token_ID)));
when Face =>
null;
when Indent =>
null;
end case;
end elsif_expression_list_0;
procedure elsif_statement_item_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Motion), (3, Motion)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (3, Invalid_Token_ID)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple, (Int,
Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (True, (Simple,
(Int, Ada_Indent)), (Simple, (Int, Ada_Indent)))));
end case;
end elsif_statement_item_0;
procedure elsif_statement_list_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (2, Invalid_Token_ID)));
when Face =>
null;
when Indent =>
null;
end case;
end elsif_statement_list_0;
procedure entry_body_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Motion), (6, Motion), (8,
Motion), (12, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (4, Invalid_Token_ID) & (6,
Invalid_Token_ID) & (8, Invalid_Token_ID) & (9, 72) & (12, Invalid_Token_ID)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, 3, 1), (11, 3, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 4, Ada_Indent_Broken))), (False, (Simple, (Label =>
None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))),
(True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))), (False,
(Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end entry_body_0;
function entry_body_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 2, 11, End_Names_Optional);
end entry_body_0_check;
procedure entry_body_formal_part_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 1))), (False,
(Simple, (Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 0))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
end case;
end entry_body_formal_part_0;
procedure entry_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_Override), (8,
Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 3, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Anchored_0, 4, 1))), (False, (Simple, (Anchored_0, 4, 0))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end entry_declaration_0;
procedure entry_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_Override), (6,
Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 3, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end entry_declaration_1;
procedure enumeration_representation_clause_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Statement_End)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 1, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end enumeration_representation_clause_0;
procedure enumeration_type_definition_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 0)))));
end case;
end enumeration_type_definition_0;
procedure exception_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Statement_End)));
when Face =>
null;
when Indent =>
null;
end case;
end exception_declaration_0;
procedure exception_handler_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Motion)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (True, (Simple, (Int, Ada_Indent)),
(Simple, (Int, Ada_Indent)))));
end case;
end exception_handler_0;
procedure exception_handler_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Motion)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (True, (Simple, (Int, Ada_Indent)),
(Simple, (Int, Ada_Indent)))));
end case;
end exception_handler_1;
procedure exception_handler_list_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (2, Invalid_Token_ID)));
when Face =>
null;
when Indent =>
null;
end case;
end exception_handler_list_0;
procedure exit_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False,
(Simple, (Label => None)))));
end case;
end exit_statement_0;
procedure exit_statement_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Statement_End)));
when Face =>
null;
when Indent =>
null;
end case;
end exit_statement_1;
procedure expression_function_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_Override), (6,
Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end expression_function_declaration_0;
procedure extended_return_object_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple,
(Anchored_1, 6, Ada_Indent_Broken)))));
end case;
end extended_return_object_declaration_0;
procedure extended_return_object_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken)))));
end case;
end extended_return_object_declaration_1;
procedure extended_return_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Motion), (7, Statement_End)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (3, Invalid_Token_ID) & (4, 72) &
(7, Invalid_Token_ID)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((True, (Simple, (Label => None)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (True,
(Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))), (False,
(Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end extended_return_statement_0;
procedure extended_return_statement_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Statement_End)));
when Face =>
null;
when Indent =>
null;
end case;
end extended_return_statement_1;
procedure formal_object_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (9, Statement_End)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (5, 1, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 6, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end formal_object_declaration_0;
procedure formal_object_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (8, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 5,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end formal_object_declaration_1;
procedure formal_object_declaration_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (5, 1, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end formal_object_declaration_2;
procedure formal_object_declaration_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end formal_object_declaration_3;
procedure formal_part_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Misc)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 0)))));
end case;
end formal_part_0;
procedure formal_subprogram_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple,
(Label => None)))));
end case;
end formal_subprogram_declaration_0;
procedure formal_subprogram_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end formal_subprogram_declaration_1;
procedure formal_subprogram_declaration_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end formal_subprogram_declaration_2;
procedure formal_subprogram_declaration_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end formal_subprogram_declaration_3;
procedure formal_type_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end formal_type_declaration_0;
procedure formal_type_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end formal_type_declaration_1;
procedure formal_type_declaration_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Statement_End)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end formal_type_declaration_2;
procedure formal_derived_type_definition_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1, 2)));
when Indent =>
null;
end case;
end formal_derived_type_definition_0;
procedure formal_derived_type_definition_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1, 2)));
when Indent =>
null;
end case;
end formal_derived_type_definition_1;
procedure formal_package_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (9, Statement_End)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 1, 1), (6, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end formal_package_declaration_0;
procedure full_type_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False,
(Simple, (Label => None)))));
end case;
end full_type_declaration_0;
procedure function_specification_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Statement_Start)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken)))));
end case;
end function_specification_0;
function function_specification_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Propagate_Name (Nonterm, Tokens, 2);
end function_specification_0_check;
procedure generic_formal_part_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Statement_Start)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent)))));
end case;
end generic_formal_part_0;
procedure generic_formal_part_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Statement_Start)));
when Face =>
null;
when Indent =>
null;
end case;
end generic_formal_part_1;
procedure generic_instantiation_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, 1, 1), (5, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple,
(Label => None)))));
end case;
end generic_instantiation_0;
procedure generic_instantiation_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_Override), (8,
Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 1, 1), (6, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end generic_instantiation_1;
procedure generic_instantiation_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_Override), (8,
Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 1, 1), (6, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False,
(Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end generic_instantiation_2;
procedure generic_package_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Statement_End)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (2, Invalid_Token_ID) & (3,
Invalid_Token_ID)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((True, (Simple, (Label => None)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end generic_package_declaration_0;
procedure generic_renaming_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 1, 1), (5, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple,
(Label => None)))));
end case;
end generic_renaming_declaration_0;
procedure generic_renaming_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 1, 1), (5, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Language,
Ada_Indent_Renames_0'Access, +3))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end generic_renaming_declaration_1;
procedure generic_renaming_declaration_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 1, 1), (5, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Language,
Ada_Indent_Renames_0'Access, +3))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end generic_renaming_declaration_2;
procedure generic_subprogram_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_Override), (4,
Statement_End)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (2, Invalid_Token_ID) & (4,
Invalid_Token_ID)));
when Face =>
null;
when Indent =>
null;
end case;
end generic_subprogram_declaration_0;
procedure goto_label_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 0)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Int, Ada_Indent_Label))), (False,
(Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end goto_label_0;
procedure handled_sequence_of_statements_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((True, (Simple, (Label => None)), (Simple, (Label =>
None))), (False, (Simple, (Int, -Ada_Indent))), (True, (Simple, (Int, Ada_Indent_When - Ada_Indent)), (Simple,
(Int, Ada_Indent_When - Ada_Indent)))));
end case;
end handled_sequence_of_statements_0;
procedure identifier_list_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken)))));
end case;
end identifier_list_0;
procedure identifier_list_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 1);
when Face =>
null;
when Indent =>
null;
end case;
end identifier_list_1;
function identifier_opt_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Propagate_Name (Nonterm, Tokens, 1);
end identifier_opt_0_check;
procedure if_expression_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Motion), (3, Motion), (6, Motion)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (3, Invalid_Token_ID) & (5,
Invalid_Token_ID) & (6, Invalid_Token_ID)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple, (Int,
Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent)))));
end case;
end if_expression_0;
procedure if_expression_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Motion), (3, Motion), (5, Motion)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (3, Invalid_Token_ID) & (5,
Invalid_Token_ID)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple, (Int,
Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Int, Ada_Indent)))));
end case;
end if_expression_1;
procedure if_expression_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Motion), (3, Motion)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (3, Invalid_Token_ID) & (5,
Invalid_Token_ID)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple, (Int,
Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent))), (False, (Simple, (Label => None)))));
end case;
end if_expression_2;
procedure if_expression_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Motion), (3, Motion)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (3, Invalid_Token_ID)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple, (Int,
Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent)))));
end case;
end if_expression_3;
procedure if_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Motion), (6, Motion), (10,
Statement_End)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (3, Invalid_Token_ID) & (5,
Invalid_Token_ID) & (6, Invalid_Token_ID) & (10, Invalid_Token_ID)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Hanging_2,
(Int, Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken))), (False, (Simple,
(Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label
=> None))), (False, (Simple, (Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple, (Label
=> None)))));
end case;
end if_statement_0;
procedure if_statement_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Motion), (5, Motion), (9,
Statement_End)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (3, Invalid_Token_ID) & (5,
Invalid_Token_ID) & (9, Invalid_Token_ID)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Hanging_2,
(Int, Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken))), (False, (Simple,
(Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label
=> None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label =>
None))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end if_statement_1;
procedure if_statement_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Motion), (8, Statement_End)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (3, Invalid_Token_ID) & (5,
Invalid_Token_ID) & (8, Invalid_Token_ID)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Hanging_2,
(Int, Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken))), (False, (Simple,
(Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label
=> None))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple, (Label =>
None)))));
end case;
end if_statement_2;
procedure if_statement_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Motion), (7, Statement_End)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (3, Invalid_Token_ID) & (7,
Invalid_Token_ID)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Hanging_2,
(Int, Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken))), (False, (Simple,
(Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label
=> None))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end if_statement_3;
procedure incomplete_type_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end incomplete_type_declaration_0;
procedure incomplete_type_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end incomplete_type_declaration_1;
procedure index_constraint_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 0)))));
end case;
end index_constraint_0;
procedure interface_list_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1, 2)));
when Indent =>
null;
end case;
end interface_list_0;
procedure interface_list_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, 1, 2)));
when Indent =>
null;
end case;
end interface_list_1;
procedure iteration_scheme_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple, (Int,
Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken)))));
end case;
end iteration_scheme_0;
procedure iteration_scheme_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple, (Int,
Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken)))));
end case;
end iteration_scheme_1;
procedure iterator_specification_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Remove_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => 4));
when Indent =>
null;
end case;
end iterator_specification_2;
procedure iterator_specification_5
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Remove_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => 3));
when Indent =>
null;
end case;
end iterator_specification_5;
procedure loop_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_Override), (3,
Motion), (8, Statement_End)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, Invalid_Token_ID) & (3, Invalid_Token_ID) & (8,
Invalid_Token_ID)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple, (Label
=> None))), (False, (Simple, (Label => None)))));
end case;
end loop_statement_0;
function loop_statement_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 1, 7, End_Names_Optional);
end loop_statement_0_check;
procedure loop_statement_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_Override), (4,
Motion), (7, Statement_End)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, Invalid_Token_ID) & (4, Invalid_Token_ID) & (7,
Invalid_Token_ID)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label
=> None))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple, (Label =>
None)))));
end case;
end loop_statement_1;
function loop_statement_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 1, 6, End_Names_Optional);
end loop_statement_1_check;
procedure name_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Anchored_1, 1, Ada_Indent_Broken))), (False, (Hanging_0, (Anchored_0, 2, 1), (Anchored_0, 2, 1 +
Ada_Indent_Broken))), (False, (Simple, (Anchored_0, 2, 0)))));
end case;
end name_0;
procedure name_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple, (if
Ada_Indent_Hanging_Rel_Exp then (Anchored_0, 1, Ada_Indent_Broken) else (Anchored_1, 1,
Ada_Indent_Broken))))));
end case;
end name_1;
function name_2_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Propagate_Name (Nonterm, Tokens, 1);
end name_2_check;
procedure name_5
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Mark_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Suffix)));
when Indent =>
null;
end case;
end name_5;
function name_5_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Propagate_Name (Nonterm, Tokens, 1);
end name_5_check;
function name_7_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Propagate_Name (Nonterm, Tokens, 1);
end name_7_check;
function name_opt_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Propagate_Name (Nonterm, Tokens, 1);
end name_opt_0_check;
procedure null_exclusion_opt_name_type_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, 3, 2)));
when Indent =>
null;
end case;
end null_exclusion_opt_name_type_0;
procedure null_exclusion_opt_name_type_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, 1, 2)));
when Indent =>
null;
end case;
end null_exclusion_opt_name_type_1;
procedure null_exclusion_opt_name_type_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 3, 2)));
when Indent =>
null;
end case;
end null_exclusion_opt_name_type_2;
procedure null_exclusion_opt_name_type_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1, 2)));
when Indent =>
null;
end case;
end null_exclusion_opt_name_type_3;
procedure null_procedure_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_Override), (6,
Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end null_procedure_declaration_0;
procedure object_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (9, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Anchored_2, 6, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end object_declaration_0;
procedure object_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (9, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 6, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end object_declaration_1;
procedure object_declaration_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (9, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 6, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end object_declaration_2;
procedure object_declaration_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end object_declaration_3;
procedure object_declaration_4
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end object_declaration_4;
procedure object_declaration_5
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end object_declaration_5;
procedure object_renaming_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (8, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 1);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (4, 1, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end object_renaming_declaration_0;
procedure object_renaming_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 1);
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end object_renaming_declaration_1;
procedure object_renaming_declaration_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 1);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (5, 1, 3)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end object_renaming_declaration_2;
procedure overriding_indicator_opt_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_Override)));
when Face =>
null;
when Indent =>
null;
end case;
end overriding_indicator_opt_0;
procedure overriding_indicator_opt_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Statement_Start)));
when Face =>
null;
when Indent =>
null;
end case;
end overriding_indicator_opt_1;
procedure package_body_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Motion), (7, Motion), (11,
Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (5, Invalid_Token_ID) & (7,
Invalid_Token_ID) & (8, 72) & (11, Invalid_Token_ID)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 1, 1), (10, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))),
(False, (Simple, (Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False,
(Simple, (Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end package_body_0;
function package_body_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 3, 10, End_Names_Optional);
end package_body_0_check;
procedure package_body_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Motion), (9, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (5, Invalid_Token_ID) & (9,
Invalid_Token_ID)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 1, 1), (8, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple, (Label
=> None)))));
end case;
end package_body_1;
function package_body_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 3, 8, End_Names_Optional);
end package_body_1_check;
procedure package_body_stub_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))),
(False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple,
(Label => None)))));
end case;
end package_body_stub_0;
procedure package_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_End)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (2, Invalid_Token_ID)));
when Face =>
null;
when Indent =>
null;
end case;
end package_declaration_0;
procedure package_renaming_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, 1, 1), (4, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end package_renaming_declaration_0;
procedure package_specification_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Motion), (6, Motion)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (4, Invalid_Token_ID) & (6,
Invalid_Token_ID)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, 1, 1), (9, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))),
(True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))), (True,
(Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))), (False,
(Simple, (Label => None)))));
end case;
end package_specification_0;
function package_specification_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 2, 9, End_Names_Optional);
end package_specification_0_check;
procedure package_specification_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Motion)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (4, Invalid_Token_ID)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, 1, 1), (7, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))),
(True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))), (False,
(Simple, (Label => None)))));
end case;
end package_specification_1;
function package_specification_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 2, 7, End_Names_Optional);
end package_specification_1_check;
procedure parameter_and_result_profile_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Language, Ada_Indent_Return_0'Access, 1 & 0)))));
end case;
end parameter_and_result_profile_0;
procedure parameter_specification_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (6, 1, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 7,
Ada_Indent_Broken)))));
end case;
end parameter_specification_0;
procedure parameter_specification_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (6, 1, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
end case;
end parameter_specification_1;
procedure parameter_specification_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 5,
Ada_Indent_Broken)))));
end case;
end parameter_specification_2;
procedure parameter_specification_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
end case;
end parameter_specification_3;
procedure paren_expression_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Hanging_0,
(Anchored_0, 1, 1), (Anchored_0, 1, 1 + Ada_Indent_Broken))), (False, (Simple, (Anchored_0, 1, 0)))));
end case;
end paren_expression_0;
procedure pragma_g_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Statement_End)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Anchored_0, 3,
1))), (False, (Simple, (Anchored_0, 3, 0))), (False, (Simple, (Label => None)))));
end case;
end pragma_g_0;
procedure pragma_g_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Statement_End)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Anchored_0, 3,
1))), (False, (Simple, (Anchored_0, 3, 0))), (False, (Simple, (Label => None)))));
end case;
end pragma_g_1;
procedure pragma_g_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Statement_End)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end pragma_g_2;
procedure primary_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, 3, 0)));
when Indent =>
null;
end case;
end primary_0;
procedure primary_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, (1 => (False, (Simple, (Language,
Ada_Indent_Aggregate'Access, Null_Args)))));
end case;
end primary_2;
procedure primary_4
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 1, 2)));
when Indent =>
null;
end case;
end primary_4;
procedure private_extension_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (12, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end private_extension_declaration_0;
procedure private_type_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (8, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))),
(False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple,
(Label => None))), (False, (Simple, (Label => None)))));
end case;
end private_type_declaration_0;
procedure procedure_call_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Hanging_0, (Label => None), (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end procedure_call_statement_0;
procedure procedure_specification_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Statement_Start)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken)))));
end case;
end procedure_specification_0;
function procedure_specification_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Propagate_Name (Nonterm, Tokens, 2);
end procedure_specification_0_check;
procedure protected_body_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Motion), (9, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (5, Invalid_Token_ID) & (9,
Invalid_Token_ID)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 3, 2), (8, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))),
(False, (Simple, (Label => None))), (False, (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))),
(False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end protected_body_0;
function protected_body_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 3, 8, End_Names_Optional);
end protected_body_0_check;
procedure protected_body_stub_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end protected_body_stub_0;
procedure protected_definition_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, Motion)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (5, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end protected_definition_0;
function protected_definition_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Propagate_Name (Nonterm, Tokens, 5);
end protected_definition_0_check;
procedure protected_definition_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end protected_definition_1;
function protected_definition_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Propagate_Name (Nonterm, Tokens, 3);
end protected_definition_1_check;
procedure protected_type_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Motion), (11,
Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (6, Invalid_Token_ID) & (10, 49) &
(11, Invalid_Token_ID)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end protected_type_declaration_0;
function protected_type_declaration_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 3, 10, End_Names_Optional);
end protected_type_declaration_0_check;
procedure protected_type_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Motion), (8, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (6, Invalid_Token_ID) & (7, 49) &
(8, Invalid_Token_ID)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None))), (True, (Simple, (Label => None)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end protected_type_declaration_1;
function protected_type_declaration_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 3, 7, End_Names_Optional);
end protected_type_declaration_1_check;
procedure qualified_expression_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, 1, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (if Ada_Indent_Hanging_Rel_Exp then (Anchored_0, 1, Ada_Indent_Broken)
else (Anchored_1, 1, Ada_Indent_Broken))))));
end case;
end qualified_expression_0;
procedure quantified_expression_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 4, Ada_Indent_Broken)))));
end case;
end quantified_expression_0;
procedure raise_expression_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 3,
Ada_Indent_Broken)))));
end case;
end raise_expression_0;
procedure raise_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 3,
Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end raise_statement_0;
procedure raise_statement_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end raise_statement_1;
procedure raise_statement_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_End)));
when Face =>
null;
when Indent =>
null;
end case;
end raise_statement_2;
procedure range_g_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Anchored_0, 4, 1))), (False, (Simple, (Anchored_0, 4, 0)))));
end case;
end range_g_0;
procedure record_definition_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((True, (Simple, (Language, Ada_Indent_Record_1'Access, 69
& 1 & 0)), (Simple, (Language, Ada_Indent_Record_1'Access, 69 & 1 & Ada_Indent))), (True, (Simple, (Language,
Ada_Indent_Record_1'Access, 69 & 1 & Ada_Indent)), (Simple, (Language, Ada_Indent_Record_1'Access, 69 & 1 &
Ada_Indent))), (False, (Simple, (Language, Ada_Indent_Record_1'Access, 69 & 1 & 0))), (False, (Simple, (Label
=> None)))));
end case;
end record_definition_0;
procedure record_representation_clause_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Statement_End)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 1, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Language,
Ada_Indent_Record_0'Access, 1 & 4 & 0))), (False, (Simple, (Language, Ada_Indent_Record_0'Access, 1 & 4 &
Ada_Indent))), (False, (Simple, (Language, Ada_Indent_Record_0'Access, 1 & 4 & Ada_Indent))), (False, (Simple,
(Language, Ada_Indent_Record_0'Access, 1 & 4 & 0))), (False, (Simple, (Label => None))), (False, (Simple,
(Label => None)))));
end case;
end record_representation_clause_0;
procedure requeue_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Statement_End)));
when Face =>
null;
when Indent =>
null;
end case;
end requeue_statement_0;
procedure requeue_statement_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Statement_End)));
when Face =>
null;
when Indent =>
null;
end case;
end requeue_statement_1;
procedure result_profile_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1, 2)));
when Indent =>
Indent_Action_1 (Parse_Data, Tree, Nonterm, Tokens, 1, ((False, (Simple, (Label => None))), (False, (Simple,
(Anchored_3, 1, Ada_Indent_Broken))), (False, (Simple, (Anchored_3, 1, Ada_Indent_Broken)))));
end case;
end result_profile_0;
procedure result_profile_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_1 (Parse_Data, Tree, Nonterm, Tokens, 1, ((False, (Simple, (Label => None))), (False, (Simple,
(Anchored_4, 1, Ada_Indent_Broken)))));
end case;
end result_profile_1;
procedure selected_component_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Mark_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Prefix), (3, Suffix)));
when Indent =>
null;
end case;
end selected_component_0;
function selected_component_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Merge_Names (Nonterm, Tokens, 1, 3);
end selected_component_0_check;
procedure selected_component_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Mark_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Prefix)));
when Indent =>
null;
end case;
end selected_component_1;
procedure selected_component_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Mark_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Prefix)));
when Indent =>
null;
end case;
end selected_component_2;
function selected_component_2_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Merge_Names (Nonterm, Tokens, 1, 3);
end selected_component_2_check;
procedure selected_component_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Mark_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Prefix)));
when Indent =>
null;
end case;
end selected_component_3;
procedure selective_accept_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Motion), (7, Statement_End)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (2, 43) & (3, Invalid_Token_ID) &
(7, Invalid_Token_ID)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((True, (Simple, (Label => None)), (Simple, (Int,
Ada_Indent))), (True, (Simple, (Label => None)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label =>
None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))),
(False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end selective_accept_0;
procedure selective_accept_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Statement_End)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (2, 43) & (5, Invalid_Token_ID)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((True, (Simple, (Label => None)), (Simple, (Int,
Ada_Indent))), (True, (Simple, (Label => None)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label =>
None))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end selective_accept_1;
procedure select_alternative_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Motion)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent))),
(False, (Simple, (Int, Ada_Indent)))));
end case;
end select_alternative_0;
procedure select_alternative_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Motion), (4, Statement_Start), (5, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent))),
(False, (Simple, (Label => None)))));
end case;
end select_alternative_1;
procedure select_alternative_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Motion)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent)))));
end case;
end select_alternative_2;
procedure select_alternative_4
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_End)));
when Face =>
null;
when Indent =>
null;
end case;
end select_alternative_4;
procedure select_alternative_list_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, Motion)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, 43) & (2, Invalid_Token_ID)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent)))));
end case;
end select_alternative_list_0;
procedure select_alternative_list_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, (1 => (False, (Simple, (Int, Ada_Indent)))));
end case;
end select_alternative_list_1;
procedure simple_return_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end simple_return_statement_0;
procedure simple_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_End)));
when Face =>
null;
when Indent =>
null;
end case;
end simple_statement_0;
procedure simple_statement_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Statement_End)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 0)));
when Indent =>
null;
end case;
end simple_statement_3;
procedure simple_statement_8
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Statement_End)));
when Face =>
null;
when Indent =>
null;
end case;
end simple_statement_8;
procedure single_protected_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Motion), (7, Motion), (9,
Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (4, Invalid_Token_ID) & (7,
Invalid_Token_ID) & (8, 49) & (9, Invalid_Token_ID)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False,
(Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end single_protected_declaration_0;
function single_protected_declaration_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 2, 8, End_Names_Optional);
end single_protected_declaration_0_check;
procedure single_protected_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Motion), (6, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (4, Invalid_Token_ID) & (5, 49) &
(6, Invalid_Token_ID)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (True, (Simple, (Label => None)), (Simple,
(Int, Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end single_protected_declaration_1;
function single_protected_declaration_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 2, 5, End_Names_Optional);
end single_protected_declaration_1_check;
procedure single_task_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Motion), (11,
Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (4, Invalid_Token_ID) & (8, 49) &
(11, Invalid_Token_ID)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, 3, 2), (9, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False,
(Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Label => None)))));
end case;
end single_task_declaration_0;
function single_task_declaration_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 2, 10, End_Names_Optional);
end single_task_declaration_0_check;
procedure single_task_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Motion), (8, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (4, Invalid_Token_ID) & (5, 49) &
(8, Invalid_Token_ID)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, 3, 2), (6, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (True, (Simple, (Label => None)), (Simple,
(Int, Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Label => None)))));
end case;
end single_task_declaration_1;
function single_task_declaration_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 2, 7, End_Names_Optional);
end single_task_declaration_1_check;
procedure single_task_declaration_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end single_task_declaration_2;
procedure subprogram_body_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_Override), (4,
Motion), (6, Motion), (10, Statement_End)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (2, Invalid_Token_ID) & (4,
Invalid_Token_ID) & (6, Invalid_Token_ID) & (7, 72) & (10, Invalid_Token_ID)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (9, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple,
(Label => None)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label =>
None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))),
(True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))), (False,
(Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end subprogram_body_0;
function subprogram_body_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 2, 9, End_Names_Optional);
end subprogram_body_0_check;
procedure subprogram_body_stub_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_Override), (6,
Statement_End)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False,
(Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end subprogram_body_stub_0;
procedure subprogram_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_Override), (4,
Statement_End)));
when Face =>
null;
when Indent =>
null;
end case;
end subprogram_declaration_0;
procedure subprogram_default_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, 1, 1)));
when Indent =>
null;
end case;
end subprogram_default_0;
procedure subprogram_renaming_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (2, Statement_Override), (6,
Statement_End)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (4, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Language, Ada_Indent_Renames_0'Access, +2))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end subprogram_renaming_declaration_0;
function subprogram_specification_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Propagate_Name (Nonterm, Tokens, 1);
end subprogram_specification_0_check;
function subprogram_specification_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Lexer, Recover_Active);
begin
return Propagate_Name (Nonterm, Tokens, 1);
end subprogram_specification_1_check;
procedure subtype_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end subtype_declaration_0;
procedure subtype_indication_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1, 2)));
when Indent =>
null;
end case;
end subtype_indication_0;
procedure subtype_indication_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1, 2)));
when Indent =>
null;
end case;
end subtype_indication_1;
procedure subtype_indication_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, 1, 2)));
when Indent =>
null;
end case;
end subtype_indication_2;
procedure subtype_indication_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, 1, 2)));
when Indent =>
null;
end case;
end subtype_indication_3;
procedure subunit_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Statement_Override)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Anchored_0, 2, 1))), (False, (Simple, (Anchored_0, 2, 0))),
(False, (Simple, (Label => None)))));
end case;
end subunit_0;
procedure task_body_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Motion), (7, Motion), (11,
Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (5, Invalid_Token_ID) & (7,
Invalid_Token_ID) & (8, 72) & (11, Invalid_Token_ID)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 3, 2), (10, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False,
(Simple, (Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple,
(Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label
=> None))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end task_body_0;
function task_body_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 3, 10, End_Names_Optional);
end task_body_0_check;
procedure task_body_stub_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False,
(Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label =>
None)))));
end case;
end task_body_stub_0;
procedure task_definition_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, Motion)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent)))));
end case;
end task_definition_0;
procedure task_definition_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
null;
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, (1 => (True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent)))));
end case;
end task_definition_1;
procedure task_type_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Motion), (9, Motion), (13,
Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (6, Invalid_Token_ID) & (9,
Invalid_Token_ID) & (10, 49) & (13, Invalid_Token_ID)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 3, 2), (12, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Label => None)))));
end case;
end task_type_declaration_0;
function task_type_declaration_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 3, 12, End_Names_Optional);
end task_type_declaration_0_check;
procedure task_type_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Motion), (10,
Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (6, Invalid_Token_ID) & (7, 49) &
(10, Invalid_Token_ID)));
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 3, 2), (9, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None))), (True, (Simple, (Label => None)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple, (Label
=> None))), (False, (Simple, (Label => None)))));
end case;
end task_type_declaration_1;
function task_type_declaration_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
return Match_Names (Lexer, Descriptor, Tokens, 3, 9, End_Names_Optional);
end task_type_declaration_1_check;
procedure task_type_declaration_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (6, Statement_End)));
Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
when Face =>
Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 3, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end task_type_declaration_2;
procedure timed_entry_call_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Motion), (6, Statement_End)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (3, Invalid_Token_ID) & (6,
Invalid_Token_ID)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (True, (Simple, (Int,
Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))), (True, (Simple, (Int,
Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple, (Label =>
None))), (False, (Simple, (Label => None)))));
end case;
end timed_entry_call_0;
procedure variant_part_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (7, Statement_End)));
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (4, Invalid_Token_ID) & (7,
Invalid_Token_ID)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False, (Simple, (Int, Ada_Indent_When))),
(False, (Simple, (Label => None))), (False, (Simple, (Label => None))), (False, (Simple, (Label => None)))));
end case;
end variant_part_0;
procedure variant_list_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Invalid_Token_ID) & (2, Invalid_Token_ID)));
when Face =>
null;
when Indent =>
null;
end case;
end variant_list_0;
procedure variant_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, Motion)));
when Face =>
null;
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Hanging_0,
(Label => None), (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent))), (True, (Simple, (Int,
Ada_Indent)), (Simple, (Int, Ada_Indent)))));
end case;
end variant_0;
procedure use_clause_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Statement_End)));
when Face =>
Face_Apply_List_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (4, 1, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Use))), (False, (Simple, (Label => None)))));
end case;
end use_clause_0;
procedure use_clause_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Statement_End)));
when Face =>
Face_Apply_List_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1, 2)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Use))), (False, (Simple, (Label => None)))));
end case;
end use_clause_1;
procedure use_clause_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Statement_End)));
when Face =>
Face_Apply_List_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Use))), (False, (Simple, (Label => None)))));
end case;
end use_clause_2;
procedure with_clause_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (5, Statement_End)));
when Face =>
Face_Apply_List_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (4, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_With))), (False, (Simple, (Label => None)))));
end case;
end with_clause_0;
procedure with_clause_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Statement_End)));
when Face =>
Face_Apply_List_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_With))), (False, (Simple, (Label => None)))));
end case;
end with_clause_1;
procedure with_clause_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (4, Statement_End)));
when Face =>
Face_Apply_List_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_With))), (False, (Simple, (Label => None)))));
end case;
end with_clause_2;
procedure with_clause_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type (User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Statement_Start), (3, Statement_End)));
when Face =>
Face_Apply_List_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 1, 1)));
when Indent =>
Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_With))), (False, (Simple, (Label => None)))));
end case;
end with_clause_3;
end Ada_Process_Actions;
|
with Rejuvenation.Match_Patterns; use Rejuvenation.Match_Patterns;
with Rejuvenation.Node_Locations; use Rejuvenation.Node_Locations;
with Rejuvenation.Patterns; use Rejuvenation.Patterns;
with Rejuvenation.Text_Rewrites; use Rejuvenation.Text_Rewrites;
package Rejuvenation.Find_And_Replacer is
type Match_Accepter is not null access function
(Match : Match_Pattern) return Boolean;
function Accept_All_Matches (Match : Match_Pattern) return Boolean;
procedure Find_And_Replace
(TR : in out Text_Rewrite'Class; Node : Ada_Node'Class;
Find_Pattern, Replace_Pattern : Pattern;
Accept_Match : Match_Accepter := Accept_All_Matches'Access;
Before, After : Node_Location := No_Trivia);
function Find_And_Replace
(File_Path : String; Find_Pattern, Replace_Pattern : Pattern;
Accept_Match : Match_Accepter := Accept_All_Matches'Access;
Before, After : Node_Location := No_Trivia) return Boolean;
-- Find instances of the given pattern and
-- for each accepted match replaces using the given replacement pattern.
-- Placeholder names defined in the find pattern that occur
-- in the replacement pattern are replaced
-- by the matching string at the placeholder.
-- Return value indicates whether any match was found and accepted
-- Note: When a match is found and accepted, the file will be changed
end Rejuvenation.Find_And_Replacer;
|
-----------------------------------------------------------------------
-- pipe -- Print the GNAT version by using a pipe
-- Copyright (C) 2011 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.Text_IO;
with Ada.Strings.Unbounded;
with Util.Processes;
with Util.Streams.Pipes;
with Util.Streams.Buffered;
procedure Popen is
Command : constant String := "gnatmake --version";
Pipe : aliased Util.Streams.Pipes.Pipe_Stream;
Buffer : Util.Streams.Buffered.Input_Buffer_Stream;
Content : Ada.Strings.Unbounded.Unbounded_String;
begin
Pipe.Open (Command, Util.Processes.READ);
Buffer.Initialize (Pipe'Access, 1024);
Buffer.Read (Content);
Pipe.Close;
if Pipe.Get_Exit_Status /= 0 then
Ada.Text_IO.Put_Line (Command & " exited with status "
& Integer'Image (Pipe.Get_Exit_Status));
return;
end if;
Ada.Text_IO.Put_Line ("Result: " & Ada.Strings.Unbounded.To_String (Content));
end Popen;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Tools 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$
------------------------------------------------------------------------------
with Ada.Containers.Indefinite_Vectors;
private with Ada.Finalization;
private with Ada.Text_IO;
package Unicode_Data_File_Parsers is
package String_Vectors is
new Ada.Containers.Indefinite_Vectors (Positive, String);
type Unicode_Data_File_Parser is abstract tagged limited private;
not overriding procedure Open
(Self : in out Unicode_Data_File_Parser;
File_Name : String);
not overriding procedure Close (Self : in out Unicode_Data_File_Parser);
not overriding procedure Parse (Self : in out Unicode_Data_File_Parser);
not overriding procedure Start_Section
(Self : in out Unicode_Data_File_Parser;
Name : String)
is null;
not overriding procedure End_Section
(Self : in out Unicode_Data_File_Parser)
is null;
not overriding procedure Data
(Self : in out Unicode_Data_File_Parser;
Data : String_Vectors.Vector)
is abstract;
private
type Unicode_Data_File_Parser is
abstract new Ada.Finalization.Limited_Controlled with
record
File : Ada.Text_IO.File_Type;
Line : String (1 .. 1024);
Last : Natural;
end record;
overriding procedure Finalize (Self : in out Unicode_Data_File_Parser);
end Unicode_Data_File_Parsers;
|
------------------------------------------------------------------------------
-- ZLib for Ada thick binding. --
-- --
-- Copyright (C) 2002-2004 Dmitriy Anisimkov --
-- --
-- This library is free software; you can redistribute it and/or modify --
-- it under the terms of the GNU General Public License as published by --
-- the Free Software Foundation; either version 2 of the License, or (at --
-- your option) any later version. --
-- --
-- This library is distributed in the hope that it will be useful, but --
-- WITHOUT ANY WARRANTY; without even the implied warranty of --
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU --
-- General Public License for more details. --
-- --
-- You should have received a copy of the GNU General Public License --
-- along with this library; if not, write to the Free Software Foundation, --
-- Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
------------------------------------------------------------------------------
-- Id: zlib.ads,v 1.26 2004/09/06 06:53:19 vagul Exp
with Ada.Streams;
with Interfaces;
package ZLib is
ZLib_Error : exception;
Status_Error : exception;
type Compression_Level is new Integer range -1 .. 9;
type Flush_Mode is private;
type Compression_Method is private;
type Window_Bits_Type is new Integer range 8 .. 15;
type Memory_Level_Type is new Integer range 1 .. 9;
type Unsigned_32 is new Interfaces.Unsigned_32;
type Strategy_Type is private;
type Header_Type is (None, Auto, Default, GZip);
-- Header type usage have a some limitation for inflate.
-- See comment for Inflate_Init.
subtype Count is Ada.Streams.Stream_Element_Count;
Default_Memory_Level : constant Memory_Level_Type := 8;
Default_Window_Bits : constant Window_Bits_Type := 15;
----------------------------------
-- Compression method constants --
----------------------------------
Deflated : constant Compression_Method;
-- Only one method allowed in this ZLib version
---------------------------------
-- Compression level constants --
---------------------------------
No_Compression : constant Compression_Level := 0;
Best_Speed : constant Compression_Level := 1;
Best_Compression : constant Compression_Level := 9;
Default_Compression : constant Compression_Level := -1;
--------------------------
-- Flush mode constants --
--------------------------
No_Flush : constant Flush_Mode;
-- Regular way for compression, no flush
Partial_Flush : constant Flush_Mode;
-- Will be removed, use Z_SYNC_FLUSH instead
Sync_Flush : constant Flush_Mode;
-- All pending output is flushed to the output buffer and the output
-- is aligned on a byte boundary, so that the decompressor can get all
-- input data available so far. (In particular avail_in is zero after the
-- call if enough output space has been provided before the call.)
-- Flushing may degrade compression for some compression algorithms and so
-- it should be used only when necessary.
Block_Flush : constant Flush_Mode;
-- Z_BLOCK requests that inflate() stop
-- if and when it get to the next deflate block boundary. When decoding the
-- zlib or gzip format, this will cause inflate() to return immediately
-- after the header and before the first block. When doing a raw inflate,
-- inflate() will go ahead and process the first block, and will return
-- when it gets to the end of that block, or when it runs out of data.
Full_Flush : constant Flush_Mode;
-- All output is flushed as with SYNC_FLUSH, and the compression state
-- is reset so that decompression can restart from this point if previous
-- compressed data has been damaged or if random access is desired. Using
-- Full_Flush too often can seriously degrade the compression.
Finish : constant Flush_Mode;
-- Just for tell the compressor that input data is complete.
------------------------------------
-- Compression strategy constants --
------------------------------------
-- RLE stategy could be used only in version 1.2.0 and later.
Filtered : constant Strategy_Type;
Huffman_Only : constant Strategy_Type;
RLE : constant Strategy_Type;
Default_Strategy : constant Strategy_Type;
Default_Buffer_Size : constant := 4096;
type Filter_Type is tagged limited private;
-- The filter is for compression and for decompression.
-- The usage of the type is depend of its initialization.
function Version return String;
pragma Inline (Version);
-- Return string representation of the ZLib version.
procedure Deflate_Init
(Filter : in out Filter_Type;
Level : in Compression_Level := Default_Compression;
Strategy : in Strategy_Type := Default_Strategy;
Method : in Compression_Method := Deflated;
Window_Bits : in Window_Bits_Type := Default_Window_Bits;
Memory_Level : in Memory_Level_Type := Default_Memory_Level;
Header : in Header_Type := Default);
-- Compressor initialization.
-- When Header parameter is Auto or Default, then default zlib header
-- would be provided for compressed data.
-- When Header is GZip, then gzip header would be set instead of
-- default header.
-- When Header is None, no header would be set for compressed data.
procedure Inflate_Init
(Filter : in out Filter_Type;
Window_Bits : in Window_Bits_Type := Default_Window_Bits;
Header : in Header_Type := Default);
-- Decompressor initialization.
-- Default header type mean that ZLib default header is expecting in the
-- input compressed stream.
-- Header type None mean that no header is expecting in the input stream.
-- GZip header type mean that GZip header is expecting in the
-- input compressed stream.
-- Auto header type mean that header type (GZip or Native) would be
-- detected automatically in the input stream.
-- Note that header types parameter values None, GZip and Auto are
-- supported for inflate routine only in ZLib versions 1.2.0.2 and later.
-- Deflate_Init is supporting all header types.
function Is_Open (Filter : in Filter_Type) return Boolean;
pragma Inline (Is_Open);
-- Is the filter opened for compression or decompression.
procedure Close
(Filter : in out Filter_Type;
Ignore_Error : in Boolean := False);
-- Closing the compression or decompressor.
-- If stream is closing before the complete and Ignore_Error is False,
-- The exception would be raised.
generic
with procedure Data_In
(Item : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset);
with procedure Data_Out
(Item : in Ada.Streams.Stream_Element_Array);
procedure Generic_Translate
(Filter : in out Filter_Type;
In_Buffer_Size : in Integer := Default_Buffer_Size;
Out_Buffer_Size : in Integer := Default_Buffer_Size);
-- Compress/decompress data fetch from Data_In routine and pass the result
-- to the Data_Out routine. User should provide Data_In and Data_Out
-- for compression/decompression data flow.
-- Compression or decompression depend on Filter initialization.
function Total_In (Filter : in Filter_Type) return Count;
pragma Inline (Total_In);
-- Returns total number of input bytes read so far
function Total_Out (Filter : in Filter_Type) return Count;
pragma Inline (Total_Out);
-- Returns total number of bytes output so far
function CRC32
(CRC : in Unsigned_32;
Data : in Ada.Streams.Stream_Element_Array)
return Unsigned_32;
pragma Inline (CRC32);
-- Compute CRC32, it could be necessary for make gzip format
procedure CRC32
(CRC : in out Unsigned_32;
Data : in Ada.Streams.Stream_Element_Array);
pragma Inline (CRC32);
-- Compute CRC32, it could be necessary for make gzip format
-------------------------------------------------
-- Below is more complex low level routines. --
-------------------------------------------------
procedure Translate
(Filter : in out Filter_Type;
In_Data : in Ada.Streams.Stream_Element_Array;
In_Last : out Ada.Streams.Stream_Element_Offset;
Out_Data : out Ada.Streams.Stream_Element_Array;
Out_Last : out Ada.Streams.Stream_Element_Offset;
Flush : in Flush_Mode);
-- Compress/decompress the In_Data buffer and place the result into
-- Out_Data. In_Last is the index of last element from In_Data accepted by
-- the Filter. Out_Last is the last element of the received data from
-- Filter. To tell the filter that incoming data are complete put the
-- Flush parameter to Finish.
function Stream_End (Filter : in Filter_Type) return Boolean;
pragma Inline (Stream_End);
-- Return the true when the stream is complete.
procedure Flush
(Filter : in out Filter_Type;
Out_Data : out Ada.Streams.Stream_Element_Array;
Out_Last : out Ada.Streams.Stream_Element_Offset;
Flush : in Flush_Mode);
pragma Inline (Flush);
-- Flushing the data from the compressor.
generic
with procedure Write
(Item : in Ada.Streams.Stream_Element_Array);
-- User should provide this routine for accept
-- compressed/decompressed data.
Buffer_Size : in Ada.Streams.Stream_Element_Offset
:= Default_Buffer_Size;
-- Buffer size for Write user routine.
procedure Write
(Filter : in out Filter_Type;
Item : in Ada.Streams.Stream_Element_Array;
Flush : in Flush_Mode := No_Flush);
-- Compress/Decompress data from Item to the generic parameter procedure
-- Write. Output buffer size could be set in Buffer_Size generic parameter.
generic
with procedure Read
(Item : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset);
-- User should provide data for compression/decompression
-- thru this routine.
Buffer : in out Ada.Streams.Stream_Element_Array;
-- Buffer for keep remaining data from the previous
-- back read.
Rest_First, Rest_Last : in out Ada.Streams.Stream_Element_Offset;
-- Rest_First have to be initialized to Buffer'Last + 1
-- Rest_Last have to be initialized to Buffer'Last
-- before usage.
Allow_Read_Some : in Boolean := False;
-- Is it allowed to return Last < Item'Last before end of data.
procedure Read
(Filter : in out Filter_Type;
Item : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset;
Flush : in Flush_Mode := No_Flush);
-- Compress/Decompress data from generic parameter procedure Read to the
-- Item. User should provide Buffer and initialized Rest_First, Rest_Last
-- indicators. If Allow_Read_Some is True, Read routines could return
-- Last < Item'Last only at end of stream.
private
use Ada.Streams;
pragma Assert (Ada.Streams.Stream_Element'Size = 8);
pragma Assert (Ada.Streams.Stream_Element'Modulus = 2**8);
type Flush_Mode is new Integer range 0 .. 5;
type Compression_Method is new Integer range 8 .. 8;
type Strategy_Type is new Integer range 0 .. 3;
No_Flush : constant Flush_Mode := 0;
Partial_Flush : constant Flush_Mode := 1;
Sync_Flush : constant Flush_Mode := 2;
Full_Flush : constant Flush_Mode := 3;
Finish : constant Flush_Mode := 4;
Block_Flush : constant Flush_Mode := 5;
Filtered : constant Strategy_Type := 1;
Huffman_Only : constant Strategy_Type := 2;
RLE : constant Strategy_Type := 3;
Default_Strategy : constant Strategy_Type := 0;
Deflated : constant Compression_Method := 8;
type Z_Stream;
type Z_Stream_Access is access all Z_Stream;
type Filter_Type is tagged limited record
Strm : Z_Stream_Access;
Compression : Boolean;
Stream_End : Boolean;
Header : Header_Type;
CRC : Unsigned_32;
Offset : Stream_Element_Offset;
-- Offset for gzip header/footer output.
end record;
end ZLib;
|
--------------------------------------------------------------------------------
-- --
-- Copyright (C) 2004, RISC OS Ada Library (RASCAL) developers. --
-- --
-- This library is free software; you can redistribute it and/or --
-- modify it under the terms of the GNU Lesser General Public --
-- License as published by the Free Software Foundation; either --
-- version 2.1 of the License, or (at your option) any later version. --
-- --
-- This library is distributed in the hope that it will be useful, --
-- but WITHOUT ANY WARRANTY; without even the implied warranty of --
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU --
-- Lesser General Public License for more details. --
-- --
-- You should have received a copy of the GNU Lesser General Public --
-- License along with this library; if not, write to the Free Software --
-- Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA --
-- --
--------------------------------------------------------------------------------
-- $Author$
-- $Date$
-- $Revision$
with Kernel; use Kernel;
with Interfaces.C; use Interfaces.C;
with System.Storage_Elements; use System.Storage_Elements;
with Reporter;
with RASCAL.Memory; use RASCAL.Memory;
with RASCAL.Utility; use RASCAL.Utility;
with RASCAL.OS;
package body RASCAL.Variable is
OS_ReadVarVal : constant := 16#23#;
OS_SetVarVal : constant := 16#24#;
OS_GSTrans : constant := 16#27#;
--
function Exists (Name : in String) return Boolean is
Name_0 : String := Name & ASCII.NUL;
Register : aliased Kernel.SWI_regs;
Error : OSError_Access;
begin
Register.R(0) := Adr_To_Int(Name_0'address);
Register.R(1) := 0;
Register.R(2) := -1;
Register.R(3) := 0;
Register.R(4) := 0;
Error := Kernel.SWI (OS_ReadVarVal,register'Access,register'Access);
return Integer(Register.R(2)) /=0;
end Exists;
--
procedure Set_Value (Name : string;
New_Value : string;
Var_Type : Variable_Type := Literal) is
Register : aliased Kernel.swi_regs;
Name_0 : string := Name & ASCII.NUL;
Error : OSError_Access;
begin
Register.R(0) := Adr_To_Int(Name_0'Address);
Register.R(1) := Adr_To_Int(New_Value'Address);
Register.R(2) := New_Value'Length;
Register.R(3) := 0;
Register.R(4) := Variable_Type'Pos(Var_Type);
Error := Kernel.SWI (OS_SetVarVal,Register'Access,Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("Variable.Set_Variable: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
end Set_Value;
--
procedure UnSet (Name : string) is
Register : aliased Kernel.SWI_regs;
Name_0 : string := Name & ASCII.NUL;
Error : OSError_Access;
begin
Register.R(0) := Adr_To_Int(Name_0'Address);
Register.R(1) := 0;
Register.R(2) := -1;
Register.R(3) := 0;
Register.R(4) := 0;
Error := Kernel.SWI (OS_SetVarVal,Register'Access,Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("Variable.UnSet_Variable: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
end UnSet;
--
function Get_Value (Variable : in String) return String is
variable_0 : String := Variable & ASCII.NUL;
Register : aliased Kernel.SWI_regs;
Error : OSError_Access;
Bytes : Integer;
begin
Register.R(0) := int(To_Integer(Variable_0'address));
Register.R(1) := 0;
Register.R(2) := -1;
Register.R(3) := 0;
Register.R(4) := 0;
Error := Kernel.SWI (OS_ReadVarVal,Register'Access,Register'Access);
Bytes := -1*Integer(Register.R(2));
if Bytes = 0 then
return "";
end if;
declare
Buffer : String (1..Bytes);
begin
Register.R(0) := int(To_Integer(Variable_0'address));
Register.R(1) := Adr_To_Int(Buffer'Address);
Register.R(2) := int(Bytes);
Register.R(3) := 0;
Register.R(4) := 0;
Error := Kernel.SWI (OS_ReadVarVal,Register'Access,Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("Variable.Get_Variable: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
return Buffer(1..Bytes-1);
end;
end Get_Value;
--
function Translate (Str : in String) return String is
Str_0 : String := Str & ASCII.NUL;
Register : aliased Kernel.SWI_regs;
Error : OSError_Access;
Result : String(1..1024);
begin
Register.R(0) := int(To_Integer(Str_0'address));
Register.R(1) := int(To_Integer(Result'Address));
Register.R(2) := 1024;
Error := Kernel.SWI (OS_GSTrans,Register'Access,Register'Access);
if Error /= null then
return "";
else
return Result (1..Integer(Register.R(2)));
end if;
end Translate;
--
end RASCAL.Variable;
|
with
openGL.Texture,
freetype_c.FT_GlyphSlot;
private
with
openGL.Geometry.lit_textured,
openGL.Primitive.indexed,
GL;
package openGL.GlyphImpl.texture
--
-- Implements a texture-based glyph.
--
is
type Item is new GlyphImpl.item with private;
type View is access all Item'Class;
---------
-- Types
--
type Vertex is
record
Site : Vector_3;
Coords : Coordinate_2D;
end record;
type Quad_t is
record
NW, NE,
SW, SE : Vertex;
Advance : Vector_3;
end record;
---------
-- Forge
--
function new_GlyphImpl (glyth_Slot : in freetype_c.FT_GlyphSlot.item;
texture_Id : in openGL.Texture.texture_Name;
xOffset, yOffset : in Integer;
Width, Height : in Integer) return GlyphImpl.texture.view;
--
-- glyth_Slot: The Freetype glyph to be processed.
-- texture_Id: The Id of the texture that this glyph will be drawn in.
-- xOffset, yOffset: The x any y offset into the parent texture to draw this glyph.
-- Width, Height: The width and height (number of rows) of the parent texture.
--------------
-- Attributes
--
function Quad (Self : in Item; Pen : in Vector_3) return Quad_t;
--------------
-- Operations
--
function renderImpl (Self : in Item; Pen : in Vector_3;
renderMode : in Integer) return Vector_3;
--
-- Pen: The current pen position.
-- renderMode: Render mode to display.
--
-- Returns the advance distance for this glyph.
-------------
-- Protected - for derived class use only.
--
procedure ResetActiveTexture;
--
-- Reset the currently active texture to zero to get into a known
-- state before drawing a string. This is to get around possible threading issues.
private
type Item is new GlyphImpl.item with
record
destWidth, -- The width and height of the glyph 'image'.
destHeight : GL.GLint;
Corner : Vector_3; -- Vector from the pen site to the top left of the pixmap.
UV : Coordinates_2D (1 .. 2); -- The texture co-ords of this glyph within the texture.
glTextureID : openGL.texture.texture_Name; -- The texture index that this glyph is contained in.
Geometry : access Geometry.lit_textured.item;
Primitive : openGL.Primitive.indexed.view;
end record;
end openGL.GlyphImpl.texture;
|
------------------------------------------------------------------------------
-- --
-- GNU ADA RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . T A S K _ P R I M I T I V E S . O P E R A T I O N S --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1991-2001 Florida State University --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNARL is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNARL; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. It is --
-- now maintained by Ada Core Technologies Inc. in cooperation with Florida --
-- State University (http://www.gnat.com). --
-- --
------------------------------------------------------------------------------
-- This is an OS/2 version of this package
-- This package contains all the GNULL primitives that interface directly
-- with the underlying OS.
pragma Polling (Off);
-- Turn off polling, we do not want ATC polling to take place during
-- tasking operations. It causes infinite loops and other problems.
with System.Tasking.Debug;
-- used for Known_Tasks
with Interfaces.C;
-- used for size_t
with Interfaces.C.Strings;
-- used for Null_Ptr
with Interfaces.OS2Lib.Errors;
with Interfaces.OS2Lib.Threads;
with Interfaces.OS2Lib.Synchronization;
with System.Parameters;
-- used for Size_Type
with System.Tasking;
-- used for Task_ID
with System.Parameters;
-- used for Size_Type
with System.Soft_Links;
-- used for Defer/Undefer_Abort
-- Note that we do not use System.Tasking.Initialization directly since
-- this is a higher level package that we shouldn't depend on. For example
-- when using the restricted run time, it is replaced by
-- System.Tasking.Restricted.Initialization
with System.OS_Primitives;
-- used for Delay_Modes
-- Clock
with Unchecked_Conversion;
with Unchecked_Deallocation;
package body System.Task_Primitives.Operations is
package IC renames Interfaces.C;
package ICS renames Interfaces.C.Strings;
package OSP renames System.OS_Primitives;
package SSL renames System.Soft_Links;
use Interfaces.OS2Lib;
use Interfaces.OS2Lib.Errors;
use Interfaces.OS2Lib.Threads;
use Interfaces.OS2Lib.Synchronization;
use System.Tasking.Debug;
use System.Tasking;
use System.OS_Interface;
use Interfaces.C;
use System.OS_Primitives;
----------------------
-- Local Constants --
----------------------
Max_Locks_Per_Task : constant := 100;
Suppress_Owner_Check : constant Boolean := False;
------------------
-- Local Types --
------------------
type Microseconds is new IC.long;
subtype Lock_Range is Integer range 0 .. Max_Locks_Per_Task;
------------------
-- Local Data --
------------------
-- The OS/2 DosAllocThreadLocalMemory API is used to allocate our TCB_Ptr.
-- This API reserves a small range of virtual addresses that is backed
-- by different physical memory for each running thread. In this case we
-- create a pointer at a fixed address that points to the TCB_Ptr for the
-- running thread. So all threads will be able to query and update their
-- own TCB_Ptr without destroying the TCB_Ptr of other threads.
type Thread_Local_Data is record
Self_ID : Task_ID; -- ID of the current thread
Lock_Prio_Level : Lock_Range; -- Nr of priority changes due to locks
-- ... room for expansion here, if we decide to make access to
-- jump-buffer and exception stack more efficient in future
end record;
type Access_Thread_Local_Data is access all Thread_Local_Data;
-- Pointer to Thread Local Data
Thread_Local_Data_Ptr : aliased Access_Thread_Local_Data;
type PPTLD is access all Access_Thread_Local_Data;
All_Tasks_L : aliased System.Task_Primitives.RTS_Lock;
-- See comments on locking rules in System.Tasking (spec).
Environment_Task_ID : Task_ID;
-- A variable to hold Task_ID for the environment task.
-----------------------
-- Local Subprograms --
-----------------------
function To_PPVOID is new Unchecked_Conversion (PPTLD, PPVOID);
function To_Address is new Unchecked_Conversion (Task_ID, System.Address);
function To_PFNTHREAD is
new Unchecked_Conversion (System.Address, PFNTHREAD);
function To_MS (D : Duration) return ULONG;
procedure Set_Temporary_Priority
(T : in Task_ID;
New_Priority : in System.Any_Priority);
-----------
-- To_MS --
-----------
function To_MS (D : Duration) return ULONG is
begin
return ULONG (D * 1_000);
end To_MS;
-----------
-- Clock --
-----------
function Monotonic_Clock return Duration renames OSP.Monotonic_Clock;
-------------------
-- RT_Resolution --
-------------------
function RT_Resolution return Duration is
begin
return 10#1.0#E-6;
end RT_Resolution;
-------------------
-- Abort_Handler --
-------------------
-- OS/2 only has limited support for asynchronous signals.
-- It seems not to be possible to jump out of an exception
-- handler or to change the execution context of the thread.
-- So asynchonous transfer of control is not supported.
-------------------
-- Stack_Guard --
-------------------
-- The underlying thread system sets a guard page at the
-- bottom of a thread stack, so nothing is needed.
-- ??? Check the comment above
procedure Stack_Guard (T : ST.Task_ID; On : Boolean) is
begin
null;
end Stack_Guard;
--------------------
-- Get_Thread_Id --
--------------------
function Get_Thread_Id (T : ST.Task_ID) return OSI.Thread_Id is
begin
return OSI.Thread_Id (T.Common.LL.Thread);
end Get_Thread_Id;
----------
-- Self --
----------
function Self return Task_ID is
Self_ID : Task_ID renames Thread_Local_Data_Ptr.Self_ID;
begin
-- Check that the thread local data has been initialized.
pragma Assert
((Thread_Local_Data_Ptr /= null
and then Thread_Local_Data_Ptr.Self_ID /= null));
return Self_ID;
end Self;
---------------------
-- Initialize_Lock --
---------------------
procedure Initialize_Lock
(Prio : System.Any_Priority;
L : access Lock)
is
begin
if DosCreateMutexSem
(ICS.Null_Ptr, L.Mutex'Unchecked_Access, 0, False32) /= NO_ERROR
then
raise Storage_Error;
end if;
pragma Assert (L.Mutex /= 0, "Error creating Mutex");
L.Priority := Prio;
L.Owner_ID := Null_Address;
end Initialize_Lock;
procedure Initialize_Lock (L : access RTS_Lock; Level : Lock_Level) is
begin
if DosCreateMutexSem
(ICS.Null_Ptr, L.Mutex'Unchecked_Access, 0, False32) /= NO_ERROR
then
raise Storage_Error;
end if;
pragma Assert (L.Mutex /= 0, "Error creating Mutex");
L.Priority := System.Any_Priority'Last;
L.Owner_ID := Null_Address;
end Initialize_Lock;
-------------------
-- Finalize_Lock --
-------------------
procedure Finalize_Lock (L : access Lock) is
begin
Must_Not_Fail (DosCloseMutexSem (L.Mutex));
end Finalize_Lock;
procedure Finalize_Lock (L : access RTS_Lock) is
begin
Must_Not_Fail (DosCloseMutexSem (L.Mutex));
end Finalize_Lock;
----------------
-- Write_Lock --
----------------
procedure Write_Lock (L : access Lock; Ceiling_Violation : out Boolean) is
Self_ID : constant Task_ID := Thread_Local_Data_Ptr.Self_ID;
Old_Priority : constant Any_Priority :=
Self_ID.Common.LL.Current_Priority;
begin
if L.Priority < Old_Priority then
Ceiling_Violation := True;
return;
end if;
Ceiling_Violation := False;
-- Increase priority before getting the lock
-- to prevent priority inversion
Thread_Local_Data_Ptr.Lock_Prio_Level :=
Thread_Local_Data_Ptr.Lock_Prio_Level + 1;
if L.Priority > Old_Priority then
Set_Temporary_Priority (Self_ID, L.Priority);
end if;
-- Request the lock and then update the lock owner data
Must_Not_Fail (DosRequestMutexSem (L.Mutex, SEM_INDEFINITE_WAIT));
L.Owner_Priority := Old_Priority;
L.Owner_ID := Self_ID.all'Address;
end Write_Lock;
procedure Write_Lock (L : access RTS_Lock) is
Self_ID : constant Task_ID := Thread_Local_Data_Ptr.Self_ID;
Old_Priority : constant Any_Priority :=
Self_ID.Common.LL.Current_Priority;
begin
-- Increase priority before getting the lock
-- to prevent priority inversion
Thread_Local_Data_Ptr.Lock_Prio_Level :=
Thread_Local_Data_Ptr.Lock_Prio_Level + 1;
if L.Priority > Old_Priority then
Set_Temporary_Priority (Self_ID, L.Priority);
end if;
-- Request the lock and then update the lock owner data
Must_Not_Fail (DosRequestMutexSem (L.Mutex, SEM_INDEFINITE_WAIT));
L.Owner_Priority := Old_Priority;
L.Owner_ID := Self_ID.all'Address;
end Write_Lock;
procedure Write_Lock (T : Task_ID) is
begin
-- Request the lock and then update the lock owner data
Must_Not_Fail
(DosRequestMutexSem (T.Common.LL.L.Mutex, SEM_INDEFINITE_WAIT));
T.Common.LL.L.Owner_ID := Null_Address;
end Write_Lock;
---------------
-- Read_Lock --
---------------
procedure Read_Lock (L : access Lock; Ceiling_Violation : out Boolean)
renames Write_Lock;
------------
-- Unlock --
------------
procedure Unlock (L : access Lock) is
Self_ID : constant Task_ID := Thread_Local_Data_Ptr.Self_ID;
Old_Priority : constant Any_Priority := L.Owner_Priority;
begin
-- Check that this task holds the lock
pragma Assert (Suppress_Owner_Check
or else L.Owner_ID = Self_ID.all'Address);
-- Upate the owner data
L.Owner_ID := Null_Address;
-- Do the actual unlocking. No more references
-- to owner data of L after this point.
Must_Not_Fail (DosReleaseMutexSem (L.Mutex));
-- Reset priority after unlocking to avoid priority inversion
Thread_Local_Data_Ptr.Lock_Prio_Level :=
Thread_Local_Data_Ptr.Lock_Prio_Level - 1;
if L.Priority /= Old_Priority then
Set_Temporary_Priority (Self_ID, Old_Priority);
end if;
end Unlock;
procedure Unlock (L : access RTS_Lock) is
Self_ID : constant Task_ID := Thread_Local_Data_Ptr.Self_ID;
Old_Priority : constant Any_Priority := L.Owner_Priority;
begin
-- Check that this task holds the lock
pragma Assert (Suppress_Owner_Check
or else L.Owner_ID = Self_ID.all'Address);
-- Upate the owner data
L.Owner_ID := Null_Address;
-- Do the actual unlocking. No more references
-- to owner data of L after this point.
Must_Not_Fail (DosReleaseMutexSem (L.Mutex));
-- Reset priority after unlocking to avoid priority inversion
Thread_Local_Data_Ptr.Lock_Prio_Level :=
Thread_Local_Data_Ptr.Lock_Prio_Level - 1;
if L.Priority /= Old_Priority then
Set_Temporary_Priority (Self_ID, Old_Priority);
end if;
end Unlock;
procedure Unlock (T : Task_ID) is
begin
-- Check the owner data
pragma Assert (Suppress_Owner_Check
or else T.Common.LL.L.Owner_ID = Null_Address);
-- Do the actual unlocking. No more references
-- to owner data of T.Common.LL.L after this point.
Must_Not_Fail (DosReleaseMutexSem (T.Common.LL.L.Mutex));
end Unlock;
-----------
-- Sleep --
-----------
procedure Sleep (Self_ID : Task_ID;
Reason : System.Tasking.Task_States) is
Count : aliased ULONG; -- Used to store dummy result
begin
-- Must reset Cond BEFORE L is unlocked.
Sem_Must_Not_Fail
(DosResetEventSem (Self_ID.Common.LL.CV, Count'Unchecked_Access));
Unlock (Self_ID);
-- No problem if we are interrupted here.
-- If the condition is signaled, DosWaitEventSem will simply not block.
Sem_Must_Not_Fail
(DosWaitEventSem (Self_ID.Common.LL.CV, SEM_INDEFINITE_WAIT));
-- Since L was previously accquired, lock operation should not fail.
Write_Lock (Self_ID);
end Sleep;
-----------------
-- Timed_Sleep --
-----------------
-- This is for use within the run-time system, so abort is
-- assumed to be already deferred, and the caller should be
-- holding its own ATCB lock.
-- Pre-assertion: Cond is posted
-- Self is locked.
-- Post-assertion: Cond is posted
-- Self is locked.
procedure Timed_Sleep
(Self_ID : Task_ID;
Time : Duration;
Mode : ST.Delay_Modes;
Reason : System.Tasking.Task_States;
Timedout : out Boolean;
Yielded : out Boolean)
is
Check_Time : constant Duration := OSP.Monotonic_Clock;
Rel_Time : Duration;
Abs_Time : Duration;
Time_Out : ULONG;
Result : APIRET;
Count : aliased ULONG; -- Used to store dummy result
begin
-- Must reset Cond BEFORE Self_ID is unlocked.
Sem_Must_Not_Fail
(DosResetEventSem (Self_ID.Common.LL.CV,
Count'Unchecked_Access));
Unlock (Self_ID);
Timedout := True;
Yielded := False;
if Mode = Relative then
Rel_Time := Time;
Abs_Time := Duration'Min (Time, Max_Sensible_Delay) + Check_Time;
else
Rel_Time := Time - Check_Time;
Abs_Time := Time;
end if;
if Rel_Time > 0.0 then
loop
exit when Self_ID.Pending_ATC_Level < Self_ID.ATC_Nesting_Level
or else Self_ID.Pending_Priority_Change;
Time_Out := To_MS (Rel_Time);
Result := DosWaitEventSem (Self_ID.Common.LL.CV, Time_Out);
pragma Assert
((Result = NO_ERROR or Result = ERROR_TIMEOUT
or Result = ERROR_INTERRUPT));
-- ???
-- What to do with error condition ERROR_NOT_ENOUGH_MEMORY? Can
-- we raise an exception here? And what about ERROR_INTERRUPT?
-- Should that be treated as a simple timeout?
-- For now, consider only ERROR_TIMEOUT to be a timeout.
exit when Abs_Time <= OSP.Monotonic_Clock;
if Result /= ERROR_TIMEOUT then
-- somebody may have called Wakeup for us
Timedout := False;
exit;
end if;
Rel_Time := Abs_Time - OSP.Monotonic_Clock;
end loop;
end if;
-- Ensure post-condition
Write_Lock (Self_ID);
if Timedout then
Sem_Must_Not_Fail (DosPostEventSem (Self_ID.Common.LL.CV));
end if;
end Timed_Sleep;
-----------------
-- Timed_Delay --
-----------------
procedure Timed_Delay
(Self_ID : Task_ID;
Time : Duration;
Mode : ST.Delay_Modes)
is
Check_Time : constant Duration := OSP.Monotonic_Clock;
Rel_Time : Duration;
Abs_Time : Duration;
Timedout : Boolean := True;
Time_Out : ULONG;
Result : APIRET;
Count : aliased ULONG; -- Used to store dummy result
begin
-- Only the little window between deferring abort and
-- locking Self_ID is the reason we need to
-- check for pending abort and priority change below! :(
SSL.Abort_Defer.all;
Write_Lock (Self_ID);
-- Must reset Cond BEFORE Self_ID is unlocked.
Sem_Must_Not_Fail
(DosResetEventSem (Self_ID.Common.LL.CV,
Count'Unchecked_Access));
Unlock (Self_ID);
if Mode = Relative then
Rel_Time := Time;
Abs_Time := Time + Check_Time;
else
Rel_Time := Time - Check_Time;
Abs_Time := Time;
end if;
if Rel_Time > 0.0 then
Self_ID.Common.State := Delay_Sleep;
loop
if Self_ID.Pending_Priority_Change then
Self_ID.Pending_Priority_Change := False;
Self_ID.Common.Base_Priority := Self_ID.New_Base_Priority;
Set_Priority (Self_ID, Self_ID.Common.Base_Priority);
end if;
exit when Self_ID.Pending_ATC_Level < Self_ID.ATC_Nesting_Level;
Time_Out := To_MS (Rel_Time);
Result := DosWaitEventSem (Self_ID.Common.LL.CV, Time_Out);
exit when Abs_Time <= OSP.Monotonic_Clock;
Rel_Time := Abs_Time - OSP.Monotonic_Clock;
end loop;
Self_ID.Common.State := Runnable;
Timedout := Result = ERROR_TIMEOUT;
end if;
-- Ensure post-condition
Write_Lock (Self_ID);
if Timedout then
Sem_Must_Not_Fail (DosPostEventSem (Self_ID.Common.LL.CV));
end if;
Unlock (Self_ID);
System.OS_Interface.Yield;
SSL.Abort_Undefer.all;
end Timed_Delay;
------------
-- Wakeup --
------------
procedure Wakeup (T : Task_ID; Reason : System.Tasking.Task_States) is
begin
Sem_Must_Not_Fail (DosPostEventSem (T.Common.LL.CV));
end Wakeup;
-----------
-- Yield --
-----------
procedure Yield (Do_Yield : Boolean := True) is
begin
if Do_Yield then
System.OS_Interface.Yield;
end if;
end Yield;
----------------------------
-- Set_Temporary_Priority --
----------------------------
procedure Set_Temporary_Priority
(T : Task_ID;
New_Priority : System.Any_Priority)
is
use Interfaces.C;
Delta_Priority : Integer;
begin
-- When Lock_Prio_Level = 0, we always need to set the
-- Active_Priority. In this way we can make priority changes
-- due to locking independent of those caused by calling
-- Set_Priority.
if Thread_Local_Data_Ptr.Lock_Prio_Level = 0
or else New_Priority < T.Common.Current_Priority
then
Delta_Priority := T.Common.Current_Priority -
T.Common.LL.Current_Priority;
else
Delta_Priority := New_Priority - T.Common.LL.Current_Priority;
end if;
if Delta_Priority /= 0 then
-- ??? There is a race-condition here
-- The TCB is updated before the system call to make
-- pre-emption in the critical section less likely.
T.Common.LL.Current_Priority :=
T.Common.LL.Current_Priority + Delta_Priority;
Must_Not_Fail
(DosSetPriority (Scope => PRTYS_THREAD,
Class => PRTYC_NOCHANGE,
Delta_P => IC.long (Delta_Priority),
PorTid => T.Common.LL.Thread));
end if;
end Set_Temporary_Priority;
------------------
-- Set_Priority --
------------------
procedure Set_Priority
(T : Task_ID;
Prio : System.Any_Priority;
Loss_Of_Inheritance : Boolean := False) is
begin
T.Common.Current_Priority := Prio;
Set_Temporary_Priority (T, Prio);
end Set_Priority;
------------------
-- Get_Priority --
------------------
function Get_Priority (T : Task_ID) return System.Any_Priority is
begin
return T.Common.Current_Priority;
end Get_Priority;
----------------
-- Enter_Task --
----------------
procedure Enter_Task (Self_ID : Task_ID) is
begin
-- Initialize thread local data. Must be done first.
Thread_Local_Data_Ptr.Self_ID := Self_ID;
Thread_Local_Data_Ptr.Lock_Prio_Level := 0;
Lock_All_Tasks_List;
for I in Known_Tasks'Range loop
if Known_Tasks (I) = null then
Known_Tasks (I) := Self_ID;
Self_ID.Known_Tasks_Index := I;
exit;
end if;
end loop;
Unlock_All_Tasks_List;
-- For OS/2, we can set Self_ID.Common.LL.Thread in
-- Create_Task, since the thread is created suspended.
-- That is, there is no danger of the thread racing ahead
-- and trying to reference Self_ID.Common.LL.Thread before it
-- has been initialized.
-- .... Do we need to do anything with signals for OS/2 ???
null;
end Enter_Task;
--------------
-- New_ATCB --
--------------
function New_ATCB (Entry_Num : Task_Entry_Index) return Task_ID is
begin
return new Ada_Task_Control_Block (Entry_Num);
end New_ATCB;
----------------------
-- Initialize_TCB --
----------------------
procedure Initialize_TCB (Self_ID : Task_ID; Succeeded : out Boolean) is
begin
if DosCreateEventSem (ICS.Null_Ptr,
Self_ID.Common.LL.CV'Unchecked_Access, 0, True32) = NO_ERROR
then
if DosCreateMutexSem (ICS.Null_Ptr,
Self_ID.Common.LL.L.Mutex'Unchecked_Access, 0, False32) /= NO_ERROR
then
Succeeded := False;
Must_Not_Fail (DosCloseEventSem (Self_ID.Common.LL.CV));
else
Succeeded := True;
end if;
pragma Assert (Self_ID.Common.LL.L.Mutex /= 0);
-- We now want to do the equivalent of:
-- Initialize_Lock
-- (Self_ID.Common.LL.L'Unchecked_Access, ATCB_Level);
-- But we avoid that because the Initialize_TCB routine has an
-- exception handler, and it is too early for us to deal with
-- installing handlers (see comment below), so we do our own
-- Initialize_Lock operation manually.
Self_ID.Common.LL.L.Priority := System.Any_Priority'Last;
Self_ID.Common.LL.L.Owner_ID := Null_Address;
else
Succeeded := False;
end if;
-- Note: at one time we had anb exception handler here, whose code
-- was as follows:
-- exception
-- Assumes any failure must be due to insufficient resources
-- when Storage_Error =>
-- Must_Not_Fail (DosCloseEventSem (Self_ID.Common.LL.CV));
-- Succeeded := False;
-- but that won't work with the old exception scheme, since it would
-- result in messing with Jmpbuf values too early. If and when we get
-- switched entirely to the new zero-cost exception scheme, we could
-- put this handler back in!
end Initialize_TCB;
-----------------
-- Create_Task --
-----------------
procedure Create_Task
(T : Task_ID;
Wrapper : System.Address;
Stack_Size : System.Parameters.Size_Type;
Priority : System.Any_Priority;
Succeeded : out Boolean)
is
Result : aliased APIRET;
Adjusted_Stack_Size : System.Parameters.Size_Type;
use System.Parameters;
begin
-- In OS/2 the allocated stack size should be based on the
-- amount of address space that should be reserved for the stack.
-- Actual memory will only be used when the stack is touched anyway.
-- The new minimum size is 12 kB, although the EMX docs
-- recommend a minimum size of 32 kB. (The original was 4 kB)
-- Systems that use many tasks (say > 30) and require much
-- memory may run out of virtual address space, since OS/2
-- has a per-process limit of 512 MB, of which max. 300 MB is
-- usable in practise.
if Stack_Size = Unspecified_Size then
Adjusted_Stack_Size := Default_Stack_Size;
elsif Stack_Size < Minimum_Stack_Size then
Adjusted_Stack_Size := Minimum_Stack_Size;
else
Adjusted_Stack_Size := Stack_Size;
end if;
-- GB970222:
-- Because DosCreateThread is called directly here, the
-- C RTL doesn't get initialized for the new thead. EMX by
-- default uses per-thread local heaps in addition to the
-- global heap. There might be other effects of by-passing the
-- C library here.
-- When using _beginthread the newly created thread is not
-- blocked initially. Does this matter or can I create the
-- thread running anyway? The LL.Thread variable will be set
-- anyway because the variable is passed by reference to OS/2.
T.Common.LL.Wrapper := To_PFNTHREAD (Wrapper);
-- The OS implicitly gives the new task the priority of this task.
T.Common.LL.Current_Priority := Self.Common.LL.Current_Priority;
-- If task was locked before activator task was
-- initialized, assume it has OS standard priority
if T.Common.LL.L.Owner_Priority not in Any_Priority'Range then
T.Common.LL.L.Owner_Priority := 1;
end if;
-- Create the thread, in blocked mode
Result := DosCreateThread
(F_ptid => T.Common.LL.Thread'Unchecked_Access,
pfn => T.Common.LL.Wrapper,
param => To_Address (T),
flag => Block_Child + Commit_Stack,
cbStack => ULONG (Adjusted_Stack_Size));
Succeeded := (Result = NO_ERROR);
if not Succeeded then
return;
end if;
-- Set the new thread's priority
-- (child has inherited priority from parent)
Set_Priority (T, Priority);
-- Start the thread executing
Must_Not_Fail (DosResumeThread (T.Common.LL.Thread));
end Create_Task;
------------------
-- Finalize_TCB --
------------------
procedure Finalize_TCB (T : Task_ID) is
Tmp : Task_ID := T;
procedure Free is new
Unchecked_Deallocation (Ada_Task_Control_Block, Task_ID);
begin
Must_Not_Fail (DosCloseEventSem (T.Common.LL.CV));
Finalize_Lock (T.Common.LL.L'Unchecked_Access);
if T.Known_Tasks_Index /= -1 then
Known_Tasks (T.Known_Tasks_Index) := null;
end if;
Free (Tmp);
end Finalize_TCB;
---------------
-- Exit_Task --
---------------
procedure Exit_Task is
begin
DosExit (EXIT_THREAD, 0);
-- Do not finalize TCB here.
-- GNARL layer is responsible for that.
end Exit_Task;
----------------
-- Abort_Task --
----------------
procedure Abort_Task (T : Task_ID) is
begin
null;
-- Task abortion not implemented yet.
-- Should perform other action ???
end Abort_Task;
----------------
-- Check_Exit --
----------------
-- Dummy versions. The only currently working versions is for solaris
-- (native).
function Check_Exit (Self_ID : ST.Task_ID) return Boolean is
begin
return Check_No_Locks (Self_ID);
end Check_Exit;
--------------------
-- Check_No_Locks --
--------------------
function Check_No_Locks (Self_ID : ST.Task_ID) return Boolean is
TLD : constant Access_Thread_Local_Data := Thread_Local_Data_Ptr;
begin
return Self_ID = TLD.Self_ID
and then TLD.Lock_Prio_Level = 0;
end Check_No_Locks;
----------------------
-- Environment_Task --
----------------------
function Environment_Task return Task_ID is
begin
return Environment_Task_ID;
end Environment_Task;
-------------------------
-- Lock_All_Tasks_List --
-------------------------
procedure Lock_All_Tasks_List is
begin
Write_Lock (All_Tasks_L'Access);
end Lock_All_Tasks_List;
---------------------------
-- Unlock_All_Tasks_List --
---------------------------
procedure Unlock_All_Tasks_List is
begin
Unlock (All_Tasks_L'Access);
end Unlock_All_Tasks_List;
------------------
-- Suspend_Task --
------------------
function Suspend_Task
(T : ST.Task_ID;
Thread_Self : Thread_Id) return Boolean is
begin
if Thread_Id (T.Common.LL.Thread) /= Thread_Self then
return DosSuspendThread (T.Common.LL.Thread) = NO_ERROR;
else
return True;
end if;
end Suspend_Task;
-----------------
-- Resume_Task --
-----------------
function Resume_Task
(T : ST.Task_ID;
Thread_Self : Thread_Id) return Boolean is
begin
if Thread_Id (T.Common.LL.Thread) /= Thread_Self then
return DosResumeThread (T.Common.LL.Thread) = NO_ERROR;
else
return True;
end if;
end Resume_Task;
----------------
-- Initialize --
----------------
procedure Initialize (Environment_Task : Task_ID) is
Succeeded : Boolean;
begin
Environment_Task_ID := Environment_Task;
Initialize_Lock (All_Tasks_L'Access, All_Tasks_Level);
-- Initialize the lock used to synchronize chain of all ATCBs.
-- Set ID of environment task.
Thread_Local_Data_Ptr.Self_ID := Environment_Task;
Environment_Task.Common.LL.Thread := 1; -- By definition
-- This priority is unknown in fact.
-- If actual current priority is different,
-- it will get synchronized later on anyway.
Environment_Task.Common.LL.Current_Priority :=
Environment_Task.Common.Current_Priority;
-- Initialize TCB for this task.
-- This includes all the normal task-external initialization.
-- This is also done by Initialize_ATCB, why ???
Initialize_TCB (Environment_Task, Succeeded);
-- Consider raising Storage_Error,
-- if propagation can be tolerated ???
pragma Assert (Succeeded);
-- Do normal task-internal initialization,
-- which depends on an initialized TCB.
Enter_Task (Environment_Task);
-- Insert here any other special
-- initialization needed for the environment task.
end Initialize;
begin
-- Initialize pointer to task local data.
-- This is done once, for all tasks.
Must_Not_Fail (DosAllocThreadLocalMemory
((Thread_Local_Data'Size + 31) / 32, -- nr of 32-bit words
To_PPVOID (Thread_Local_Data_Ptr'Access)));
-- Initialize thread local data for main thread
Thread_Local_Data_Ptr.Self_ID := null;
Thread_Local_Data_Ptr.Lock_Prio_Level := 0;
end System.Task_Primitives.Operations;
|
------------------------------------------------------------------------------
-- --
-- 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.Component_Realizations.Hash is
new AMF.Elements.Generic_Hash (UML_Component_Realization, UML_Component_Realization_Access);
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2015-2017, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of STMicroelectronics nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
-- --
-- This file is based on: --
-- --
-- @file stm32f4xx_hal_gpio.c --
-- @author MCD Application Team --
-- @version V1.1.0 --
-- @date 19-June-2014 --
-- @brief GPIO HAL module driver. --
-- --
-- COPYRIGHT(c) 2014 STMicroelectronics --
------------------------------------------------------------------------------
with System; use System;
with STM32_SVD.GPIO; use STM32_SVD.GPIO;
with STM32.RCC;
with STM32.SYSCFG;
with System.Machine_Code;
package body STM32.GPIO is
procedure Lock_The_Pin (This : in out GPIO_Port; Pin : GPIO_Pin);
-- This is the routine that actually locks the pin for the port. It is an
-- internal routine and has no preconditions. We use it to avoid redundant
-- calls to the precondition that checks that the pin is not already
-- locked. The redundancy would otherwise occur because the routine that
-- locks an array of pins is implemented by calling the routine that locks
-- a single pin: both those Lock routines have a precondition that checks
-- that the pin(s) is not already being locked.
subtype GPIO_Pin_Index is Natural range 0 .. GPIO_Pin'Pos (GPIO_Pin'Last);
-------------
-- Any_Set --
-------------
function Any_Set (Pins : GPIO_Points) return Boolean is
begin
for Pin of Pins loop
if Pin.Set then
return True;
end if;
end loop;
return False;
end Any_Set;
----------
-- Mode --
----------
overriding
function Mode (This : GPIO_Point) return HAL.GPIO.GPIO_Mode is
Index : constant GPIO_Pin_Index := GPIO_Pin'Pos (This.Pin);
begin
case This.Periph.MODER.Arr (Index) is
when Pin_IO_Modes'Enum_Rep (Mode_Out) => return HAL.GPIO.Output;
when Pin_IO_Modes'Enum_Rep (Mode_In) => return HAL.GPIO.Input;
when others => return HAL.GPIO.Unknown;
end case;
end Mode;
--------------
-- Set_Mode --
--------------
overriding
function Set_Mode
(This : in out GPIO_Point;
Mode : HAL.GPIO.GPIO_Config_Mode)
return Boolean
is
Index : constant GPIO_Pin_Index := GPIO_Pin'Pos (This.Pin);
begin
case Mode is
when HAL.GPIO.Output =>
This.Periph.MODER.Arr (Index) := Pin_IO_Modes'Enum_Rep (Mode_Out);
when HAL.GPIO.Input =>
This.Periph.MODER.Arr (Index) := Pin_IO_Modes'Enum_Rep (Mode_In);
end case;
return True;
end Set_Mode;
-------------------
-- Pull_Resistor --
-------------------
overriding
function Pull_Resistor
(This : GPIO_Point)
return HAL.GPIO.GPIO_Pull_Resistor
is
Index : constant GPIO_Pin_Index := GPIO_Pin'Pos (This.Pin);
begin
if This.Periph.PUPDR.Arr (Index) = 0 then
return HAL.GPIO.Floating;
elsif This.Periph.PUPDR.Arr (Index) = 1 then
return HAL.GPIO.Pull_Up;
else
return HAL.GPIO.Pull_Down;
end if;
end Pull_Resistor;
-----------------------
-- Set_Pull_Resistor --
-----------------------
overriding
function Set_Pull_Resistor
(This : in out GPIO_Point;
Pull : HAL.GPIO.GPIO_Pull_Resistor)
return Boolean
is
Index : constant GPIO_Pin_Index := GPIO_Pin'Pos (This.Pin);
begin
case Pull is
when HAL.GPIO.Floating =>
This.Periph.PUPDR.Arr (Index) := 0;
when HAL.GPIO.Pull_Up =>
This.Periph.PUPDR.Arr (Index) := 1;
when HAL.GPIO.Pull_Down =>
This.Periph.PUPDR.Arr (Index) := 2;
end case;
return True;
end Set_Pull_Resistor;
---------
-- Set --
---------
overriding
function Set (This : GPIO_Point) return Boolean is
Pin_Mask : constant UInt16 := GPIO_Pin'Enum_Rep (This.Pin);
begin
return (This.Periph.IDR.ID.Val and Pin_Mask) = Pin_Mask;
end Set;
-------------
-- All_Set --
-------------
function All_Set (Pins : GPIO_Points) return Boolean is
begin
for Pin of Pins loop
if not Pin.Set then
return False;
end if;
end loop;
return True;
end All_Set;
---------
-- Set --
---------
overriding
procedure Set (This : in out GPIO_Point) is
begin
This.Periph.BSRR.BS.Val := GPIO_Pin'Enum_Rep (This.Pin);
-- The bit-set and bit-reset registers ignore writes of zeros so we
-- don't need to preserve the existing bit values in those registers.
end Set;
---------
-- Set --
---------
procedure Set (Pins : in out GPIO_Points) is
begin
for Pin of Pins loop
Pin.Set;
end loop;
end Set;
-----------
-- Clear --
-----------
overriding
procedure Clear (This : in out GPIO_Point) is
begin
This.Periph.BSRR.BR.Val := GPIO_Pin'Enum_Rep (This.Pin);
-- The bit-set and bit-reset registers ignore writes of zeros so we
-- don't need to preserve the existing bit values in those registers.
end Clear;
-----------
-- Clear --
-----------
procedure Clear (Pins : in out GPIO_Points) is
begin
for Pin of Pins loop
Pin.Clear;
end loop;
end Clear;
------------
-- Toggle --
------------
overriding
procedure Toggle (This : in out GPIO_Point) is
begin
This.Periph.ODR.OD.Val := This.Periph.ODR.OD.Val xor GPIO_Pin'Enum_Rep (This.Pin);
end Toggle;
------------
-- Toggle --
------------
procedure Toggle (Points : in out GPIO_Points) is
begin
for Point of Points loop
Point.Toggle;
end loop;
end Toggle;
------------
-- Locked --
------------
function Locked (This : GPIO_Point) return Boolean is
Mask : constant UInt16 := GPIO_Pin'Enum_Rep (This.Pin);
begin
return (This.Periph.LCKR.LCK.Val and Mask) = Mask;
end Locked;
------------------
-- Lock_The_Pin --
------------------
procedure Lock_The_Pin (This : in out GPIO_Port; Pin : GPIO_Pin) is
Temp : UInt32;
pragma Volatile (Temp);
use System.Machine_Code;
use ASCII;
begin
-- As per the Reference Manual (RM0090; Doc ID 018909 Rev 6) pg 282,
-- a specific sequence is required to set the Lock bit. Throughout the
-- sequence the same value for the lower 15 bits of the word must be
-- used (ie the pin number). The lock bit is referred to as LCKK in
-- the doc.
-- Temp := LCCK or Pin'Enum_Rep;
--
-- -- set the lock bit
-- Port.LCKR := Temp;
--
-- -- clear the lock bit
-- Port.LCKR := Pin'Enum_Rep;
--
-- -- set the lock bit again
-- Port.LCKR := Temp;
--
-- -- read the lock bit
-- Temp := Port.LCKR;
--
-- -- read the lock bit again
-- Temp := Port.LCKR;
-- We use the following assembly language sequence because the above
-- high-level version in Ada works only if the optimizer is enabled.
-- This is not an issue specific to Ada. If you need a specific sequence
-- of instructions you should really specify those instructions.
-- We don't want the functionality to depend on the switches, and we
-- don't want to preclude debugging, hence the following:
Asm ("orr r3, %2, #65536" & LF & HT &
"str r3, %0" & LF & HT &
"ldr r3, %0" & LF & HT & -- temp <- pin or LCCK
"str r3, [%1, #28]" & LF & HT & -- temp -> lckr
"str %2, [%1, #28]" & LF & HT & -- pin -> lckr
"ldr r3, %0" & LF & HT &
"str r3, [%1, #28]" & LF & HT & -- temp -> lckr
"ldr r3, [%1, #28]" & LF & HT &
"str r3, %0" & LF & HT & -- temp <- lckr
"ldr r3, [%1, #28]" & LF & HT &
"str r3, %0" & LF & HT, -- temp <- lckr
Inputs => (Address'Asm_Input ("r", This'Address), -- %1
(GPIO_Pin'Asm_Input ("r", Pin))), -- %2
Outputs => (UInt32'Asm_Output ("=m", Temp)), -- %0
Volatile => True,
Clobber => ("r2, r3"));
end Lock_The_Pin;
----------
-- Lock --
----------
procedure Lock (This : GPIO_Point) is
begin
Lock_The_Pin (This.Periph.all, This.Pin);
end Lock;
----------
-- Lock --
----------
procedure Lock (Points : GPIO_Points) is
begin
for Point of Points loop
if not Locked (Point) then
Point.Lock;
end if;
end loop;
end Lock;
------------------
-- Configure_IO --
------------------
procedure Configure_IO
(This : GPIO_Point;
Config : GPIO_Port_Configuration)
is
Index : constant GPIO_Pin_Index := GPIO_Pin'Pos (This.Pin);
begin
This.Periph.MODER.Arr (Index) := Pin_IO_Modes'Enum_Rep (Config.Mode);
This.Periph.OTYPER.OT.Arr (Index) := Config.Output_Type = Open_Drain;
This.Periph.OSPEEDR.Arr (Index) := Pin_Output_Speeds'Enum_Rep (Config.Speed);
This.Periph.PUPDR.Arr (Index) := Internal_Pin_Resistors'Enum_Rep (Config.Resistors);
end Configure_IO;
------------------
-- Configure_IO --
------------------
procedure Configure_IO
(Points : GPIO_Points;
Config : GPIO_Port_Configuration)
is
begin
for Point of Points loop
Point.Configure_IO (Config);
end loop;
end Configure_IO;
----------------------------------
-- Configure_Alternate_Function --
----------------------------------
procedure Configure_Alternate_Function
(This : GPIO_Point;
AF : GPIO_Alternate_Function)
is
Index : constant GPIO_Pin_Index := GPIO_Pin'Pos (This.Pin);
begin
if Index < 8 then
This.Periph.AFRL.Arr (Index) := UInt4 (AF);
else
This.Periph.AFRH.Arr (Index) := UInt4 (AF);
end if;
end Configure_Alternate_Function;
----------------------------------
-- Configure_Alternate_Function --
----------------------------------
procedure Configure_Alternate_Function
(Points : GPIO_Points;
AF : GPIO_Alternate_Function)
is
begin
for Point of Points loop
Point.Configure_Alternate_Function (AF);
end loop;
end Configure_Alternate_Function;
---------------------------
-- Interrupt_Line_Number --
---------------------------
function Interrupt_Line_Number
(This : GPIO_Point) return EXTI.External_Line_Number
is
begin
return EXTI.External_Line_Number'Val (GPIO_Pin'Pos (This.Pin));
end Interrupt_Line_Number;
-----------------------
-- Configure_Trigger --
-----------------------
procedure Configure_Trigger
(This : GPIO_Point;
Trigger : EXTI.External_Triggers)
is
use STM32.EXTI;
Line : constant External_Line_Number := External_Line_Number'Val (GPIO_Pin'Pos (This.Pin));
use STM32.SYSCFG, STM32.RCC;
begin
SYSCFG_Clock_Enable;
Connect_External_Interrupt (This);
if Trigger in Interrupt_Triggers then
Enable_External_Interrupt (Line, Trigger);
else
Enable_External_Event (Line, Trigger);
end if;
end Configure_Trigger;
-----------------------
-- Configure_Trigger --
-----------------------
procedure Configure_Trigger
(Points : GPIO_Points;
Trigger : EXTI.External_Triggers)
is
begin
for Point of Points loop
Point.Configure_Trigger (Trigger);
end loop;
end Configure_Trigger;
end STM32.GPIO;
|
package body WFC is
function Modular_Index (Matrix : in Element_Matrix; X, Y : Natural) return Element_Type
with Inline
is
Matrix_X : constant Natural := ((X - Matrix'First(1)) mod Matrix'Length(1)) + Matrix'First(1);
Matrix_Y : constant Natural := ((Y - Matrix'First(2)) mod Matrix'Length(2)) + Matrix'First(2);
begin
return Matrix(Matrix_X, Matrix_Y);
end;
function Invert_Horizontal (Matrix : in Element_Matrix) return Element_Matrix
with Inline
is
Out_Matrix : Element_Matrix (Matrix'Range(1), Matrix'Range(2));
Out_X : Natural;
begin
for The_X in Matrix'Range(1) loop
for The_Y in Matrix'Range(2) loop
Out_X := Matrix'First(1) + Matrix'Last(1) - The_X;
Out_Matrix(Out_X, The_Y) := Matrix(The_X, The_Y);
end loop;
end loop;
return Out_Matrix;
end;
function Invert_Vertical (Matrix : in Element_Matrix) return Element_Matrix
with Inline
is
Out_Matrix : Element_Matrix (Matrix'Range(1), Matrix'Range(2));
Out_Y : Natural;
begin
for The_X in Matrix'Range(1) loop
for The_Y in Matrix'Range(2) loop
Out_Y := Matrix'First(2) + Matrix'Last(2) - The_Y;
Out_Matrix(The_X, Out_Y) := Matrix(The_X, The_Y);
end loop;
end loop;
return Out_Matrix;
end;
function Rotate_Clockwise (Matrix : in Element_Matrix) return Element_Matrix
with Inline
is
Out_Matrix : Element_Matrix (Matrix'Range(2), Matrix'Range(1));
Out_X : Natural;
begin
for The_X in Matrix'Range(1) loop
for The_Y in Matrix'Range(2) loop
Out_X := Matrix'First(2) + Matrix'Last(2) - The_Y;
Out_Matrix(Out_X, The_X) := Matrix(The_X, The_Y);
end loop;
end loop;
return Out_Matrix;
end;
function Opposite_Direction(Dir : Adjacency_Direction) return Adjacency_Direction is
(case Dir is
when Upwards => Downwards,
when Downwards => Upwards,
when Leftwards => Rightwards,
when Rightwards => Leftwards)
with Inline;
function Initialize_From_Sample
( Sample : in Element_Matrix;
Include_Rotations : in Boolean := False;
Include_Reflections : in Boolean := False;
N, M : in Positive := 2
) return Instance
is separate;
package body Extended_Interfaces is separate;
function Collapse_Within
(Parameters : in Instance; World : out Element_Matrix) return Boolean
is
subtype X_Dim is Natural range World'First(1) .. World'Last(1);
subtype Y_Dim is Natural range World'First(2) .. World'Last(2);
package Extended is new Extended_Interfaces(X_Dim, Y_Dim);
subtype Collapse_Info is Extended.Collapse_Info'Class;
procedure Set_Resulting_Element (X : X_Dim; Y : Y_Dim; Element : Element_Type)
with Inline is
begin
World(X, Y) := Element;
end;
procedure Upon_Collapse (X : X_Dim; Y : Y_Dim; Info : in Collapse_Info'Class) is null;
function Collapse is new
Extended.Generic_Collapse_Within
( Set_Resulting_Element => Set_Resulting_Element
, Upon_Collapse => Upon_Collapse
);
begin
return Collapse(Parameters);
end;
end;
|
-- { dg-do compile }
pragma Restrictions (No_Streams);
with Ada.Containers.Ordered_Maps;
package No_Streams is
type Arr is new String (1..8);
package My_Ordered_Map is new Ada.Containers.Ordered_Maps
(Key_Type => Natural, Element_Type => Arr);
end No_Streams;
|
-----------------------------------------------------------------------
-- contexts-facelets -- Contexts for facelets
-- Copyright (C) 2009, 2010, 2011, 2013, 2018 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.Directories;
with Util.Files;
with Util.Log.Loggers;
with EL.Variables;
with ASF.Views.Nodes.Facelets;
package body ASF.Contexts.Facelets is
-- The logger
Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("ASF.Contexts.Facelets");
-- ------------------------------
-- Get the EL context for evaluating expressions.
-- ------------------------------
function Get_ELContext (Context : in Facelet_Context)
return EL.Contexts.ELContext_Access is
begin
return Context.Context;
end Get_ELContext;
-- ------------------------------
-- Set the EL context for evaluating expressions.
-- ------------------------------
procedure Set_ELContext (Context : in out Facelet_Context;
ELContext : in EL.Contexts.ELContext_Access) is
begin
Context.Context := ELContext;
end Set_ELContext;
-- ------------------------------
-- Get the function mapper associated with the EL context.
-- ------------------------------
function Get_Function_Mapper (Context : in Facelet_Context)
return EL.Functions.Function_Mapper_Access is
use EL.Contexts;
begin
if Context.Context = null then
return null;
else
return Context.Context.Get_Function_Mapper;
end if;
end Get_Function_Mapper;
-- ------------------------------
-- Set the attribute having given name with the value.
-- ------------------------------
procedure Set_Attribute (Context : in out Facelet_Context;
Name : in String;
Value : in EL.Objects.Object) is
begin
null;
end Set_Attribute;
-- ------------------------------
-- Set the attribute having given name with the value.
-- ------------------------------
procedure Set_Attribute (Context : in out Facelet_Context;
Name : in Unbounded_String;
Value : in EL.Objects.Object) is
begin
null;
end Set_Attribute;
-- ------------------------------
-- Set the attribute having given name with the expression.
-- ------------------------------
procedure Set_Variable (Context : in out Facelet_Context;
Name : in Unbounded_String;
Value : in EL.Expressions.Expression) is
Mapper : constant access EL.Variables.Variable_Mapper'Class
:= Context.Context.Get_Variable_Mapper;
begin
if Mapper /= null then
Mapper.Set_Variable (Name, Value);
end if;
end Set_Variable;
-- Set the attribute having given name with the expression.
procedure Set_Variable (Context : in out Facelet_Context;
Name : in String;
Value : in EL.Expressions.Expression) is
N : constant Unbounded_String := To_Unbounded_String (Name);
begin
Set_Variable (Context, N, Value);
end Set_Variable;
-- ------------------------------
-- Include the facelet from the given source file.
-- The included views appended to the parent component tree.
-- ------------------------------
procedure Include_Facelet (Context : in out Facelet_Context;
Source : in String;
Parent : in Base.UIComponent_Access) is
begin
null;
end Include_Facelet;
-- ------------------------------
-- Include the definition having the given name.
-- ------------------------------
procedure Include_Definition (Context : in out Facelet_Context;
Name : in Unbounded_String;
Parent : in Base.UIComponent_Access;
Found : out Boolean) is
Node : Composition_Tag_Node;
Iter : Defines_Vector.Cursor := Context.Defines.Last;
The_Name : aliased constant String := To_String (Name);
begin
if Context.Inserts.Contains (The_Name'Unchecked_Access) then
Found := True;
return;
end if;
Context.Inserts.Insert (The_Name'Unchecked_Access);
while Defines_Vector.Has_Element (Iter) loop
Node := Defines_Vector.Element (Iter);
Node.Include_Definition (Parent => Parent,
Context => Context,
Name => Name,
Found => Found);
if Found then
Context.Inserts.Delete (The_Name'Unchecked_Access);
return;
end if;
Defines_Vector.Previous (Iter);
end loop;
Found := False;
Context.Inserts.Delete (The_Name'Unchecked_Access);
end Include_Definition;
-- ------------------------------
-- Push into the current facelet context the <ui:define> nodes contained in
-- the composition/decorate tag.
-- ------------------------------
procedure Push_Defines (Context : in out Facelet_Context;
Node : access ASF.Views.Nodes.Facelets.Composition_Tag_Node) is
begin
Context.Defines.Append (Node.all'Access);
end Push_Defines;
-- ------------------------------
-- Pop from the current facelet context the <ui:define> nodes.
-- ------------------------------
procedure Pop_Defines (Context : in out Facelet_Context) is
use Ada.Containers;
begin
if Context.Defines.Length > 0 then
Context.Defines.Delete_Last;
end if;
end Pop_Defines;
-- ------------------------------
-- Set the path to resolve relative facelet paths and get the previous path.
-- ------------------------------
procedure Set_Relative_Path (Context : in out Facelet_Context;
Path : in String;
Previous : out Unbounded_String) is
begin
Log.Debug ("Set facelet relative path: {0}", Path);
Previous := Context.Path;
Context.Path := To_Unbounded_String (Ada.Directories.Containing_Directory (Path));
end Set_Relative_Path;
-- ------------------------------
-- Set the path to resolve relative facelet paths.
-- ------------------------------
procedure Set_Relative_Path (Context : in out Facelet_Context;
Path : in Unbounded_String) is
begin
Log.Debug ("Set facelet relative path: {0}", Path);
Context.Path := Path;
end Set_Relative_Path;
-- ------------------------------
-- Resolve the facelet relative path
-- ------------------------------
function Resolve_Path (Context : Facelet_Context;
Path : String) return String is
begin
if Path (Path'First) = '/' then
return Path;
else
Log.Debug ("Resolve {0} with context {1}", Path, To_String (Context.Path));
return Util.Files.Compose (To_String (Context.Path), Path);
end if;
end Resolve_Path;
end ASF.Contexts.Facelets;
|
----------------------------------------------------------------------------
-- Symbolic Expressions (symexpr)
--
-- Copyright (C) 2012, Riccardo Bernardini
--
-- This file is part of symexpr.
--
-- symexpr is free software: you can redistribute it and/or modify
-- it under the terms of the Lesser GNU General Public License as published by
-- the Free Software Foundation, either version 3 of the License, or
-- (at your option) any later version.
--
-- symexpr 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 Lesser GNU General Public License
-- along with gclp. If not, see <http://www.gnu.org/licenses/>.
----------------------------------------------------------------------------
with Ada.Strings.Fixed;
with Ada.Strings.Maps;
package body Test is
function Call(Name : String; Param : Int_Array)
return Integer
is
Result : Integer;
begin
if Name = "min" then
if Param'Length = 0 then
raise Constraint_Error;
end if;
Result := Param (Param'First);
for I in Param'Range loop
Result := Integer'Min (Result, Param (I));
end loop;
elsif Name = "max" then
if Param'Length = 0 then
raise Constraint_Error;
end if;
Result := Param (Param'First);
for I in Param'Range loop
Result := Integer'Max (Result, Param (I));
end loop;
elsif Name = "magic" then
if Param'Length /= 0 then
raise Constraint_Error;
end if;
Result := 42;
else
raise Constraint_Error;
end if;
return Result;
end Call;
function Get_Int (X : String) return String
is
use Ada.Strings.Fixed;
use Ada.Strings.Maps;
Index : constant Natural := Index_Non_Blank (X);
First : Positive;
Last : Natural;
Int_Chars : constant Character_Set := To_Set (Character_Range'('0', '9'));
begin
-- Ada.Text_Io.Put_Line ("Called [" & X & "]");
if Index = 0 or else not Is_In (X (Index), Int_Chars) then
return "";
end if;
Find_Token (Source => X (Index .. X'Last),
Set => Int_Chars,
Test => Ada.Strings.Inside,
First => First,
Last => Last);
-- Last should not be zero since we checked that X(Index) is a digit
pragma Assert (Last /= 0);
return X (First .. Last);
end Get_Int;
end Test;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . T E X T _ I O --
-- --
-- S p e c --
-- --
-- Copyright (C) 2011-2021, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package defines the console I/O interface for the simplified version
-- of Ada.Text_IO used in ZFP runtimes or bare board platforms.
package System.Text_IO is
pragma No_Elaboration_Code_All;
pragma Preelaborate;
-- The interface uses two subprograms for each direction: one for the ready
-- status and one for the action. This is done on purpose to avoid busy
-- waiting loops in the body.
procedure Initialize;
-- Must be called before all other subprograms to initialize the service.
-- We avoid the use of elaboration to make this package preelaborated.
Initialized : Boolean := False;
-- Set to True (by Initialize) when the service is initialized. Having this
-- variable outside allows reinitialization of the service.
--------------
-- Output --
--------------
function Is_Tx_Ready return Boolean;
-- Return True if it is possible to call Put. This function can be used for
-- checking that the output register of an UART is empty before write a
-- new character on it. For non blocking output system, this function can
-- always return True. Once this function has returned True, it must always
-- return True before the next call to Put.
procedure Put (C : Character);
-- Write a character on the console. Must be called only when Is_Tx_Ready
-- has returned True before, otherwise its behavior is undefined.
function Use_Cr_Lf_For_New_Line return Boolean;
-- Return True if New_Line should output CR + LF, otherwise it will output
-- only LF.
-------------
-- Input --
-------------
function Is_Rx_Ready return Boolean;
-- Return True is a character can be read by Get. On systems where is it
-- difficult or impossible to know wether a character is available, this
-- function can always return True and Get will be blocking.
function Get return Character;
-- Read a character from the console. Must be called only when Is_Rx_Ready
-- has returned True, otherwise behavior is undefined.
end System.Text_IO;
|
------------------------------------------------------------------------------
-- --
-- tiled-code-gen --
-- --
-- Copyright (C) 2018 Fabien Chouteau --
-- --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Containers.Hashed_Maps;
with Ada.Containers.Vectors;
use Ada.Containers;
with Interfaces; use Interfaces;
package body TCG.Palette is
function ID_Hashed (C : ARGB_Color) return Hash_Type;
package Color_Hashmap is new Ada.Containers.Hashed_Maps
(Key_Type => ARGB_Color,
Element_Type => Color_Id,
Hash => ID_Hashed,
Equivalent_Keys => "=");
use Color_Hashmap;
package Color_Id_Vector is new Ada.Containers.Vectors
(Index_Type => Color_Id,
Element_Type => ARGB_Color);
use Color_Id_Vector;
Convert_Vect : Color_Id_Vector.Vector;
Hashmap : Color_Hashmap.Map;
Transparent_Color : ARGB_Color;
Transparent_Color_Id : Color_Id;
Transparent_Has_Definition : Boolean := False;
type String_Access is access all String;
Format_Strings : constant array (Output_Color_Format) of String_Access
:= (ARGB => new String'("ARGB"),
RGB565 => new String'("RGB565"),
RGB565_Swap => new String'("RGB565_Swap"),
RGB555 => new String'("RGB555"),
RGB888 => new String'("RGB888"));
---------------
-- ID_Hashed --
---------------
function ID_Hashed (C : ARGB_Color) return Hash_Type is
begin
return Hash_Type'Val (C.A + C.R + C.G + C.B);
end ID_Hashed;
---------------
-- Add_Color --
---------------
function Add_Color (C : ARGB_Color) return Color_Id is
Id : Color_Id;
begin
if In_Palette (C) then
Id := Element (Hashmap.Find (C));
else
Convert_Vect.Append (C);
Id := Convert_Vect.Last_Index;
Hashmap.Insert (C, Id);
end if;
return Id;
end Add_Color;
-------------
-- Convert --
-------------
function Convert (Id : Color_Id) return ARGB_Color
is (Convert_Vect.Element (Id));
----------------
-- In_Palette --
----------------
function In_Palette (C : ARGB_Color) return Boolean
is (Hashmap.Contains (C));
-------------------------
-- Transparent_Defined --
-------------------------
function Transparent_Defined return Boolean
is (Transparent_Has_Definition);
-----------------
-- Transparent --
-----------------
function Transparent return Color_Id
is (Transparent_Color_Id);
function Transparent return ARGB_Color
is (Transparent_Color);
---------------------
-- Set_Transparent --
---------------------
procedure Set_Transparent (C : ARGB_Color) is
begin
if Transparent_Has_Definition and then Transparent_Color /= C then
raise Program_Error with
"Incompatible new definition of transparent color";
end if;
-- Transparent_Color_Id := Add_Color (C);
Convert_Vect.Replace_Element (Transparent_Color_Id, C);
Hashmap.Insert (C, Transparent_Color_Id);
Transparent_Color := C;
Transparent_Has_Definition := True;
end Set_Transparent;
----------------------
-- Number_Of_Colors --
----------------------
function Number_Of_Colors return Natural
is (Natural (Convert_Vect.Length));
--------------
-- First_Id --
--------------
function First_Id return Color_Id
is (Convert_Vect.First_Index);
-------------
-- Last_Id --
-------------
function Last_Id return Color_Id
is (Convert_Vect.Last_Index);
-----------
-- Image --
-----------
function Image (Id : Color_Id) return String
is (Id'Img);
-------------
-- To_ARGB --
-------------
function To_ARGB (Str : String) return ARGB_Color is
R : constant String := Str (Str'First .. Str'First + 1);
G : constant String := Str (Str'First + 2 .. Str'First + 3);
B : constant String := Str (Str'First + 4 .. Str'First + 5);
begin
return (A => 255,
R => Component'Value ("16#" & R & "#"),
G => Component'Value ("16#" & G & "#"),
B => Component'Value ("16#" & B & "#"));
end To_ARGB;
---------------
-- To_RGB565 --
---------------
function To_RGB565 (C : ARGB_Color) return Unsigned_16 is
R : constant Unsigned_16 :=
Shift_Right (Unsigned_16 (C.R), 3) and 16#1F#;
G : constant Unsigned_16 :=
Shift_Right (Unsigned_16 (C.G), 2) and 16#3F#;
B : constant Unsigned_16 :=
Shift_Right (Unsigned_16 (C.B), 3) and 16#1F#;
begin
return (Shift_Left (R, 11) or Shift_Left (G, 5) or B);
end To_RGB565;
--------------------
-- To_RGB565_Swap --
--------------------
function To_RGB565_Swap (C : ARGB_Color) return Unsigned_16 is
RGB : constant Unsigned_16 := To_RGB565 (C);
begin
return Shift_Right (RGB and 16#FF00#, 8) or
(Shift_Left (RGB, 8) and 16#FF00#);
end To_RGB565_Swap;
---------------
-- To_RGB888 --
---------------
function To_RGB888 (C : ARGB_Color) return Unsigned_32 is
R : constant Unsigned_32 := Shift_Left (Unsigned_32 (C.R), 16);
G : constant Unsigned_32 := Shift_Left (Unsigned_32 (C.G), 8);
B : constant Unsigned_32 := Shift_Left (Unsigned_32 (C.B), 0);
begin
return R or G or B;
end To_RGB888;
---------------
-- To_RGB555 --
---------------
function To_RGB555 (C : ARGB_Color) return Unsigned_16 is
R : constant Unsigned_16 :=
Shift_Right (Unsigned_16 (C.R), 3) and 16#1F#;
G : constant Unsigned_16 :=
Shift_Right (Unsigned_16 (C.G), 3) and 16#1F#;
B : constant Unsigned_16 :=
Shift_Right (Unsigned_16 (C.B), 3) and 16#1F#;
begin
return (Shift_Left (B, 10) or Shift_Left (G, 5) or R);
end To_RGB555;
-----------
-- Image --
-----------
function Image (C : ARGB_Color;
Format : Output_Color_Format)
return String
is
begin
case Format is
when ARGB =>
return Image (C);
when RGB565 =>
return To_RGB565 (C)'Img;
when RGB565_Swap =>
return To_RGB565_Swap (C)'Img;
when RGB555 =>
return To_RGB555 (C)'Img;
when RGB888 =>
return To_RGB888 (C)'Img;
end case;
end Image;
----------------------
-- Format_Supported --
----------------------
function Format_Supported (Fmt : String)
return Boolean
is (for some Str of Format_Strings => Str.all = Fmt);
-----------------------
-- Supported_Formats --
-----------------------
function Supported_Formats return String
is (Format_Strings (ARGB).all & ", " &
Format_Strings (RGB565).all & ", " &
Format_Strings (RGB565_Swap).all);
-------------
-- Convert --
-------------
function Convert (Fmt : String) return Output_Color_Format
is
begin
for Format in Output_Color_Format loop
if Fmt = Format_Strings (Format).all then
return Format;
end if;
end loop;
raise Program_Error with "Invalid output color format: " & Fmt;
end Convert;
---------
-- Put --
---------
procedure Put is
begin
Put_Line ("Palette ->");
Put_Line ("Number_Of_Colors: " & Length (Hashmap)'Img);
Put_Line ("Transparent color: " & Image (Transparent_Color));
for Cur in Convert_Vect.Iterate loop
Put_Line (To_Index (Cur)'Img & " => " & Image (Element (Cur)));
end loop;
end Put;
-----------
-- Image --
-----------
function Image (C : ARGB_Color) return String
is ("(" & C.A'Img & "," & C.R'Img & "," &
C.G'Img & "," & C.B'Img & ")");
begin
Transparent_Color_Id := Add_Color ((0, 0, 0, 0));
if Transparent_Color_Id /= 0 then
raise Program_Error with "Transparent_Color_Id should be zero";
end if;
end TCG.Palette;
|
--
-- Copyright (C) 2019, AdaCore
--
-- Copyright (c) 2010 - 2018, Nordic Semiconductor ASA
--
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
--
-- 1. Redistributions of source code must retain the above copyright notice,
-- this list of conditions and the following disclaimer.
--
-- 2. Redistributions in binary form, except as embedded into a Nordic
-- Semiconductor ASA integrated circuit in a product or a software update for
-- such product, must reproduce the above copyright notice, this list of
-- conditions and the following disclaimer in the documentation and/or other
-- materials provided with the distribution.
--
-- 3. Neither the name of Nordic Semiconductor ASA nor the names of its
-- contributors may be used to endorse or promote products derived from this
-- software without specific prior written permission.
--
-- 4. This software, with or without modification, must only be used with a
-- Nordic Semiconductor ASA integrated circuit.
--
-- 5. Any software provided in binary form under this license must not be
-- reverse engineered, decompiled, modified and/or disassembled.
--
-- THIS SOFTWARE IS PROVIDED BY NORDIC SEMICONDUCTOR ASA "AS IS" AND ANY
-- EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-- WARRANTIES OF MERCHANTABILITY, NONINFRINGEMENT, AND FITNESS FOR A
-- PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL NORDIC SEMICONDUCTOR
-- ASA OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
--
-- This spec has been automatically generated from nrf52.svd
pragma Ada_2012;
pragma Style_Checks (Off);
with System;
package Interfaces.NRF52.UART is
pragma Preelaborate;
pragma No_Elaboration_Code_All;
---------------
-- Registers --
---------------
subtype TASKS_STARTRX_TASKS_STARTRX_Field is Interfaces.NRF52.Bit;
-- Start UART receiver
type TASKS_STARTRX_Register is record
-- Write-only.
TASKS_STARTRX : TASKS_STARTRX_TASKS_STARTRX_Field := 16#0#;
-- unspecified
Reserved_1_31 : Interfaces.NRF52.UInt31 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for TASKS_STARTRX_Register use record
TASKS_STARTRX at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
subtype TASKS_STOPRX_TASKS_STOPRX_Field is Interfaces.NRF52.Bit;
-- Stop UART receiver
type TASKS_STOPRX_Register is record
-- Write-only.
TASKS_STOPRX : TASKS_STOPRX_TASKS_STOPRX_Field := 16#0#;
-- unspecified
Reserved_1_31 : Interfaces.NRF52.UInt31 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for TASKS_STOPRX_Register use record
TASKS_STOPRX at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
subtype TASKS_STARTTX_TASKS_STARTTX_Field is Interfaces.NRF52.Bit;
-- Start UART transmitter
type TASKS_STARTTX_Register is record
-- Write-only.
TASKS_STARTTX : TASKS_STARTTX_TASKS_STARTTX_Field := 16#0#;
-- unspecified
Reserved_1_31 : Interfaces.NRF52.UInt31 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for TASKS_STARTTX_Register use record
TASKS_STARTTX at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
subtype TASKS_STOPTX_TASKS_STOPTX_Field is Interfaces.NRF52.Bit;
-- Stop UART transmitter
type TASKS_STOPTX_Register is record
-- Write-only.
TASKS_STOPTX : TASKS_STOPTX_TASKS_STOPTX_Field := 16#0#;
-- unspecified
Reserved_1_31 : Interfaces.NRF52.UInt31 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for TASKS_STOPTX_Register use record
TASKS_STOPTX at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
subtype TASKS_SUSPEND_TASKS_SUSPEND_Field is Interfaces.NRF52.Bit;
-- Suspend UART
type TASKS_SUSPEND_Register is record
-- Write-only.
TASKS_SUSPEND : TASKS_SUSPEND_TASKS_SUSPEND_Field := 16#0#;
-- unspecified
Reserved_1_31 : Interfaces.NRF52.UInt31 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for TASKS_SUSPEND_Register use record
TASKS_SUSPEND at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
subtype EVENTS_CTS_EVENTS_CTS_Field is Interfaces.NRF52.Bit;
-- CTS is activated (set low). Clear To Send.
type EVENTS_CTS_Register is record
EVENTS_CTS : EVENTS_CTS_EVENTS_CTS_Field := 16#0#;
-- unspecified
Reserved_1_31 : Interfaces.NRF52.UInt31 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for EVENTS_CTS_Register use record
EVENTS_CTS at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
subtype EVENTS_NCTS_EVENTS_NCTS_Field is Interfaces.NRF52.Bit;
-- CTS is deactivated (set high). Not Clear To Send.
type EVENTS_NCTS_Register is record
EVENTS_NCTS : EVENTS_NCTS_EVENTS_NCTS_Field := 16#0#;
-- unspecified
Reserved_1_31 : Interfaces.NRF52.UInt31 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for EVENTS_NCTS_Register use record
EVENTS_NCTS at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
subtype EVENTS_RXDRDY_EVENTS_RXDRDY_Field is Interfaces.NRF52.Bit;
-- Data received in RXD
type EVENTS_RXDRDY_Register is record
EVENTS_RXDRDY : EVENTS_RXDRDY_EVENTS_RXDRDY_Field := 16#0#;
-- unspecified
Reserved_1_31 : Interfaces.NRF52.UInt31 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for EVENTS_RXDRDY_Register use record
EVENTS_RXDRDY at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
subtype EVENTS_TXDRDY_EVENTS_TXDRDY_Field is Interfaces.NRF52.Bit;
-- Data sent from TXD
type EVENTS_TXDRDY_Register is record
EVENTS_TXDRDY : EVENTS_TXDRDY_EVENTS_TXDRDY_Field := 16#0#;
-- unspecified
Reserved_1_31 : Interfaces.NRF52.UInt31 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for EVENTS_TXDRDY_Register use record
EVENTS_TXDRDY at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
subtype EVENTS_ERROR_EVENTS_ERROR_Field is Interfaces.NRF52.Bit;
-- Error detected
type EVENTS_ERROR_Register is record
EVENTS_ERROR : EVENTS_ERROR_EVENTS_ERROR_Field := 16#0#;
-- unspecified
Reserved_1_31 : Interfaces.NRF52.UInt31 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for EVENTS_ERROR_Register use record
EVENTS_ERROR at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
subtype EVENTS_RXTO_EVENTS_RXTO_Field is Interfaces.NRF52.Bit;
-- Receiver timeout
type EVENTS_RXTO_Register is record
EVENTS_RXTO : EVENTS_RXTO_EVENTS_RXTO_Field := 16#0#;
-- unspecified
Reserved_1_31 : Interfaces.NRF52.UInt31 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for EVENTS_RXTO_Register use record
EVENTS_RXTO at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
-- Shortcut between CTS event and STARTRX task
type SHORTS_CTS_STARTRX_Field is
(-- Disable shortcut
Disabled,
-- Enable shortcut
Enabled)
with Size => 1;
for SHORTS_CTS_STARTRX_Field use
(Disabled => 0,
Enabled => 1);
-- Shortcut between NCTS event and STOPRX task
type SHORTS_NCTS_STOPRX_Field is
(-- Disable shortcut
Disabled,
-- Enable shortcut
Enabled)
with Size => 1;
for SHORTS_NCTS_STOPRX_Field use
(Disabled => 0,
Enabled => 1);
-- Shortcut register
type SHORTS_Register is record
-- unspecified
Reserved_0_2 : Interfaces.NRF52.UInt3 := 16#0#;
-- Shortcut between CTS event and STARTRX task
CTS_STARTRX : SHORTS_CTS_STARTRX_Field :=
Interfaces.NRF52.UART.Disabled;
-- Shortcut between NCTS event and STOPRX task
NCTS_STOPRX : SHORTS_NCTS_STOPRX_Field :=
Interfaces.NRF52.UART.Disabled;
-- unspecified
Reserved_5_31 : Interfaces.NRF52.UInt27 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SHORTS_Register use record
Reserved_0_2 at 0 range 0 .. 2;
CTS_STARTRX at 0 range 3 .. 3;
NCTS_STOPRX at 0 range 4 .. 4;
Reserved_5_31 at 0 range 5 .. 31;
end record;
-- Write '1' to Enable interrupt for CTS event
type INTENSET_CTS_Field is
(-- Read: Disabled
Disabled,
-- Read: Enabled
Enabled)
with Size => 1;
for INTENSET_CTS_Field use
(Disabled => 0,
Enabled => 1);
-- Write '1' to Enable interrupt for CTS event
type INTENSET_CTS_Field_1 is
(-- Reset value for the field
Intenset_Cts_Field_Reset,
-- Enable
Set)
with Size => 1;
for INTENSET_CTS_Field_1 use
(Intenset_Cts_Field_Reset => 0,
Set => 1);
-- Write '1' to Enable interrupt for NCTS event
type INTENSET_NCTS_Field is
(-- Read: Disabled
Disabled,
-- Read: Enabled
Enabled)
with Size => 1;
for INTENSET_NCTS_Field use
(Disabled => 0,
Enabled => 1);
-- Write '1' to Enable interrupt for NCTS event
type INTENSET_NCTS_Field_1 is
(-- Reset value for the field
Intenset_Ncts_Field_Reset,
-- Enable
Set)
with Size => 1;
for INTENSET_NCTS_Field_1 use
(Intenset_Ncts_Field_Reset => 0,
Set => 1);
-- Write '1' to Enable interrupt for RXDRDY event
type INTENSET_RXDRDY_Field is
(-- Read: Disabled
Disabled,
-- Read: Enabled
Enabled)
with Size => 1;
for INTENSET_RXDRDY_Field use
(Disabled => 0,
Enabled => 1);
-- Write '1' to Enable interrupt for RXDRDY event
type INTENSET_RXDRDY_Field_1 is
(-- Reset value for the field
Intenset_Rxdrdy_Field_Reset,
-- Enable
Set)
with Size => 1;
for INTENSET_RXDRDY_Field_1 use
(Intenset_Rxdrdy_Field_Reset => 0,
Set => 1);
-- Write '1' to Enable interrupt for TXDRDY event
type INTENSET_TXDRDY_Field is
(-- Read: Disabled
Disabled,
-- Read: Enabled
Enabled)
with Size => 1;
for INTENSET_TXDRDY_Field use
(Disabled => 0,
Enabled => 1);
-- Write '1' to Enable interrupt for TXDRDY event
type INTENSET_TXDRDY_Field_1 is
(-- Reset value for the field
Intenset_Txdrdy_Field_Reset,
-- Enable
Set)
with Size => 1;
for INTENSET_TXDRDY_Field_1 use
(Intenset_Txdrdy_Field_Reset => 0,
Set => 1);
-- Write '1' to Enable interrupt for ERROR event
type INTENSET_ERROR_Field is
(-- Read: Disabled
Disabled,
-- Read: Enabled
Enabled)
with Size => 1;
for INTENSET_ERROR_Field use
(Disabled => 0,
Enabled => 1);
-- Write '1' to Enable interrupt for ERROR event
type INTENSET_ERROR_Field_1 is
(-- Reset value for the field
Intenset_Error_Field_Reset,
-- Enable
Set)
with Size => 1;
for INTENSET_ERROR_Field_1 use
(Intenset_Error_Field_Reset => 0,
Set => 1);
-- Write '1' to Enable interrupt for RXTO event
type INTENSET_RXTO_Field is
(-- Read: Disabled
Disabled,
-- Read: Enabled
Enabled)
with Size => 1;
for INTENSET_RXTO_Field use
(Disabled => 0,
Enabled => 1);
-- Write '1' to Enable interrupt for RXTO event
type INTENSET_RXTO_Field_1 is
(-- Reset value for the field
Intenset_Rxto_Field_Reset,
-- Enable
Set)
with Size => 1;
for INTENSET_RXTO_Field_1 use
(Intenset_Rxto_Field_Reset => 0,
Set => 1);
-- Enable interrupt
type INTENSET_Register is record
-- Write '1' to Enable interrupt for CTS event
CTS : INTENSET_CTS_Field_1 := Intenset_Cts_Field_Reset;
-- Write '1' to Enable interrupt for NCTS event
NCTS : INTENSET_NCTS_Field_1 := Intenset_Ncts_Field_Reset;
-- Write '1' to Enable interrupt for RXDRDY event
RXDRDY : INTENSET_RXDRDY_Field_1 := Intenset_Rxdrdy_Field_Reset;
-- unspecified
Reserved_3_6 : Interfaces.NRF52.UInt4 := 16#0#;
-- Write '1' to Enable interrupt for TXDRDY event
TXDRDY : INTENSET_TXDRDY_Field_1 := Intenset_Txdrdy_Field_Reset;
-- unspecified
Reserved_8_8 : Interfaces.NRF52.Bit := 16#0#;
-- Write '1' to Enable interrupt for ERROR event
ERROR : INTENSET_ERROR_Field_1 := Intenset_Error_Field_Reset;
-- unspecified
Reserved_10_16 : Interfaces.NRF52.UInt7 := 16#0#;
-- Write '1' to Enable interrupt for RXTO event
RXTO : INTENSET_RXTO_Field_1 := Intenset_Rxto_Field_Reset;
-- unspecified
Reserved_18_31 : Interfaces.NRF52.UInt14 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for INTENSET_Register use record
CTS at 0 range 0 .. 0;
NCTS at 0 range 1 .. 1;
RXDRDY at 0 range 2 .. 2;
Reserved_3_6 at 0 range 3 .. 6;
TXDRDY at 0 range 7 .. 7;
Reserved_8_8 at 0 range 8 .. 8;
ERROR at 0 range 9 .. 9;
Reserved_10_16 at 0 range 10 .. 16;
RXTO at 0 range 17 .. 17;
Reserved_18_31 at 0 range 18 .. 31;
end record;
-- Write '1' to Disable interrupt for CTS event
type INTENCLR_CTS_Field is
(-- Read: Disabled
Disabled,
-- Read: Enabled
Enabled)
with Size => 1;
for INTENCLR_CTS_Field use
(Disabled => 0,
Enabled => 1);
-- Write '1' to Disable interrupt for CTS event
type INTENCLR_CTS_Field_1 is
(-- Reset value for the field
Intenclr_Cts_Field_Reset,
-- Disable
Clear)
with Size => 1;
for INTENCLR_CTS_Field_1 use
(Intenclr_Cts_Field_Reset => 0,
Clear => 1);
-- Write '1' to Disable interrupt for NCTS event
type INTENCLR_NCTS_Field is
(-- Read: Disabled
Disabled,
-- Read: Enabled
Enabled)
with Size => 1;
for INTENCLR_NCTS_Field use
(Disabled => 0,
Enabled => 1);
-- Write '1' to Disable interrupt for NCTS event
type INTENCLR_NCTS_Field_1 is
(-- Reset value for the field
Intenclr_Ncts_Field_Reset,
-- Disable
Clear)
with Size => 1;
for INTENCLR_NCTS_Field_1 use
(Intenclr_Ncts_Field_Reset => 0,
Clear => 1);
-- Write '1' to Disable interrupt for RXDRDY event
type INTENCLR_RXDRDY_Field is
(-- Read: Disabled
Disabled,
-- Read: Enabled
Enabled)
with Size => 1;
for INTENCLR_RXDRDY_Field use
(Disabled => 0,
Enabled => 1);
-- Write '1' to Disable interrupt for RXDRDY event
type INTENCLR_RXDRDY_Field_1 is
(-- Reset value for the field
Intenclr_Rxdrdy_Field_Reset,
-- Disable
Clear)
with Size => 1;
for INTENCLR_RXDRDY_Field_1 use
(Intenclr_Rxdrdy_Field_Reset => 0,
Clear => 1);
-- Write '1' to Disable interrupt for TXDRDY event
type INTENCLR_TXDRDY_Field is
(-- Read: Disabled
Disabled,
-- Read: Enabled
Enabled)
with Size => 1;
for INTENCLR_TXDRDY_Field use
(Disabled => 0,
Enabled => 1);
-- Write '1' to Disable interrupt for TXDRDY event
type INTENCLR_TXDRDY_Field_1 is
(-- Reset value for the field
Intenclr_Txdrdy_Field_Reset,
-- Disable
Clear)
with Size => 1;
for INTENCLR_TXDRDY_Field_1 use
(Intenclr_Txdrdy_Field_Reset => 0,
Clear => 1);
-- Write '1' to Disable interrupt for ERROR event
type INTENCLR_ERROR_Field is
(-- Read: Disabled
Disabled,
-- Read: Enabled
Enabled)
with Size => 1;
for INTENCLR_ERROR_Field use
(Disabled => 0,
Enabled => 1);
-- Write '1' to Disable interrupt for ERROR event
type INTENCLR_ERROR_Field_1 is
(-- Reset value for the field
Intenclr_Error_Field_Reset,
-- Disable
Clear)
with Size => 1;
for INTENCLR_ERROR_Field_1 use
(Intenclr_Error_Field_Reset => 0,
Clear => 1);
-- Write '1' to Disable interrupt for RXTO event
type INTENCLR_RXTO_Field is
(-- Read: Disabled
Disabled,
-- Read: Enabled
Enabled)
with Size => 1;
for INTENCLR_RXTO_Field use
(Disabled => 0,
Enabled => 1);
-- Write '1' to Disable interrupt for RXTO event
type INTENCLR_RXTO_Field_1 is
(-- Reset value for the field
Intenclr_Rxto_Field_Reset,
-- Disable
Clear)
with Size => 1;
for INTENCLR_RXTO_Field_1 use
(Intenclr_Rxto_Field_Reset => 0,
Clear => 1);
-- Disable interrupt
type INTENCLR_Register is record
-- Write '1' to Disable interrupt for CTS event
CTS : INTENCLR_CTS_Field_1 := Intenclr_Cts_Field_Reset;
-- Write '1' to Disable interrupt for NCTS event
NCTS : INTENCLR_NCTS_Field_1 := Intenclr_Ncts_Field_Reset;
-- Write '1' to Disable interrupt for RXDRDY event
RXDRDY : INTENCLR_RXDRDY_Field_1 := Intenclr_Rxdrdy_Field_Reset;
-- unspecified
Reserved_3_6 : Interfaces.NRF52.UInt4 := 16#0#;
-- Write '1' to Disable interrupt for TXDRDY event
TXDRDY : INTENCLR_TXDRDY_Field_1 := Intenclr_Txdrdy_Field_Reset;
-- unspecified
Reserved_8_8 : Interfaces.NRF52.Bit := 16#0#;
-- Write '1' to Disable interrupt for ERROR event
ERROR : INTENCLR_ERROR_Field_1 := Intenclr_Error_Field_Reset;
-- unspecified
Reserved_10_16 : Interfaces.NRF52.UInt7 := 16#0#;
-- Write '1' to Disable interrupt for RXTO event
RXTO : INTENCLR_RXTO_Field_1 := Intenclr_Rxto_Field_Reset;
-- unspecified
Reserved_18_31 : Interfaces.NRF52.UInt14 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for INTENCLR_Register use record
CTS at 0 range 0 .. 0;
NCTS at 0 range 1 .. 1;
RXDRDY at 0 range 2 .. 2;
Reserved_3_6 at 0 range 3 .. 6;
TXDRDY at 0 range 7 .. 7;
Reserved_8_8 at 0 range 8 .. 8;
ERROR at 0 range 9 .. 9;
Reserved_10_16 at 0 range 10 .. 16;
RXTO at 0 range 17 .. 17;
Reserved_18_31 at 0 range 18 .. 31;
end record;
-- Overrun error
type ERRORSRC_OVERRUN_Field is
(-- Read: error not present
Notpresent,
-- Read: error present
Present)
with Size => 1;
for ERRORSRC_OVERRUN_Field use
(Notpresent => 0,
Present => 1);
-- Parity error
type ERRORSRC_PARITY_Field is
(-- Read: error not present
Notpresent,
-- Read: error present
Present)
with Size => 1;
for ERRORSRC_PARITY_Field use
(Notpresent => 0,
Present => 1);
-- Framing error occurred
type ERRORSRC_FRAMING_Field is
(-- Read: error not present
Notpresent,
-- Read: error present
Present)
with Size => 1;
for ERRORSRC_FRAMING_Field use
(Notpresent => 0,
Present => 1);
-- Break condition
type ERRORSRC_BREAK_Field is
(-- Read: error not present
Notpresent,
-- Read: error present
Present)
with Size => 1;
for ERRORSRC_BREAK_Field use
(Notpresent => 0,
Present => 1);
-- Error source
type ERRORSRC_Register is record
-- Overrun error
OVERRUN : ERRORSRC_OVERRUN_Field :=
Interfaces.NRF52.UART.Notpresent;
-- Parity error
PARITY : ERRORSRC_PARITY_Field :=
Interfaces.NRF52.UART.Notpresent;
-- Framing error occurred
FRAMING : ERRORSRC_FRAMING_Field :=
Interfaces.NRF52.UART.Notpresent;
-- Break condition
BREAK : ERRORSRC_BREAK_Field :=
Interfaces.NRF52.UART.Notpresent;
-- unspecified
Reserved_4_31 : Interfaces.NRF52.UInt28 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ERRORSRC_Register use record
OVERRUN at 0 range 0 .. 0;
PARITY at 0 range 1 .. 1;
FRAMING at 0 range 2 .. 2;
BREAK at 0 range 3 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
-- Enable or disable UART
type ENABLE_ENABLE_Field is
(-- Disable UART
Disabled,
-- Enable UART
Enabled)
with Size => 4;
for ENABLE_ENABLE_Field use
(Disabled => 0,
Enabled => 4);
-- Enable UART
type ENABLE_Register is record
-- Enable or disable UART
ENABLE : ENABLE_ENABLE_Field := Interfaces.NRF52.UART.Disabled;
-- unspecified
Reserved_4_31 : Interfaces.NRF52.UInt28 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ENABLE_Register use record
ENABLE at 0 range 0 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
subtype RXD_RXD_Field is Interfaces.NRF52.Byte;
-- RXD register
type RXD_Register is record
-- Read-only. *** Reading this field has side effects on other resources
-- ***. RX data received in previous transfers, double buffered
RXD : RXD_RXD_Field;
-- unspecified
Reserved_8_31 : Interfaces.NRF52.UInt24;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for RXD_Register use record
RXD at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
subtype TXD_TXD_Field is Interfaces.NRF52.Byte;
-- TXD register
type TXD_Register is record
-- Write-only. TX data to be transferred
TXD : TXD_TXD_Field := 16#0#;
-- unspecified
Reserved_8_31 : Interfaces.NRF52.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for TXD_Register use record
TXD at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-- Hardware flow control
type CONFIG_HWFC_Field is
(-- Disabled
Disabled,
-- Enabled
Enabled)
with Size => 1;
for CONFIG_HWFC_Field use
(Disabled => 0,
Enabled => 1);
-- Parity
type CONFIG_PARITY_Field is
(-- Exclude parity bit
Excluded,
-- Include parity bit
Included)
with Size => 3;
for CONFIG_PARITY_Field use
(Excluded => 0,
Included => 7);
-- Configuration of parity and hardware flow control
type CONFIG_Register is record
-- Hardware flow control
HWFC : CONFIG_HWFC_Field := Interfaces.NRF52.UART.Disabled;
-- Parity
PARITY : CONFIG_PARITY_Field := Interfaces.NRF52.UART.Excluded;
-- unspecified
Reserved_4_31 : Interfaces.NRF52.UInt28 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CONFIG_Register use record
HWFC at 0 range 0 .. 0;
PARITY at 0 range 1 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Universal Asynchronous Receiver/Transmitter
type UART_Peripheral is record
-- Start UART receiver
TASKS_STARTRX : aliased TASKS_STARTRX_Register;
-- Stop UART receiver
TASKS_STOPRX : aliased TASKS_STOPRX_Register;
-- Start UART transmitter
TASKS_STARTTX : aliased TASKS_STARTTX_Register;
-- Stop UART transmitter
TASKS_STOPTX : aliased TASKS_STOPTX_Register;
-- Suspend UART
TASKS_SUSPEND : aliased TASKS_SUSPEND_Register;
-- CTS is activated (set low). Clear To Send.
EVENTS_CTS : aliased EVENTS_CTS_Register;
-- CTS is deactivated (set high). Not Clear To Send.
EVENTS_NCTS : aliased EVENTS_NCTS_Register;
-- Data received in RXD
EVENTS_RXDRDY : aliased EVENTS_RXDRDY_Register;
-- Data sent from TXD
EVENTS_TXDRDY : aliased EVENTS_TXDRDY_Register;
-- Error detected
EVENTS_ERROR : aliased EVENTS_ERROR_Register;
-- Receiver timeout
EVENTS_RXTO : aliased EVENTS_RXTO_Register;
-- Shortcut register
SHORTS : aliased SHORTS_Register;
-- Enable interrupt
INTENSET : aliased INTENSET_Register;
-- Disable interrupt
INTENCLR : aliased INTENCLR_Register;
-- Error source
ERRORSRC : aliased ERRORSRC_Register;
-- Enable UART
ENABLE : aliased ENABLE_Register;
-- Pin select for RTS
PSELRTS : aliased Interfaces.NRF52.UInt32;
-- Pin select for TXD
PSELTXD : aliased Interfaces.NRF52.UInt32;
-- Pin select for CTS
PSELCTS : aliased Interfaces.NRF52.UInt32;
-- Pin select for RXD
PSELRXD : aliased Interfaces.NRF52.UInt32;
-- RXD register
RXD : aliased RXD_Register;
-- TXD register
TXD : aliased TXD_Register;
-- Baud rate
BAUDRATE : aliased Interfaces.NRF52.UInt32;
-- Configuration of parity and hardware flow control
CONFIG : aliased CONFIG_Register;
end record
with Volatile;
for UART_Peripheral use record
TASKS_STARTRX at 16#0# range 0 .. 31;
TASKS_STOPRX at 16#4# range 0 .. 31;
TASKS_STARTTX at 16#8# range 0 .. 31;
TASKS_STOPTX at 16#C# range 0 .. 31;
TASKS_SUSPEND at 16#1C# range 0 .. 31;
EVENTS_CTS at 16#100# range 0 .. 31;
EVENTS_NCTS at 16#104# range 0 .. 31;
EVENTS_RXDRDY at 16#108# range 0 .. 31;
EVENTS_TXDRDY at 16#11C# range 0 .. 31;
EVENTS_ERROR at 16#124# range 0 .. 31;
EVENTS_RXTO at 16#144# range 0 .. 31;
SHORTS at 16#200# range 0 .. 31;
INTENSET at 16#304# range 0 .. 31;
INTENCLR at 16#308# range 0 .. 31;
ERRORSRC at 16#480# range 0 .. 31;
ENABLE at 16#500# range 0 .. 31;
PSELRTS at 16#508# range 0 .. 31;
PSELTXD at 16#50C# range 0 .. 31;
PSELCTS at 16#510# range 0 .. 31;
PSELRXD at 16#514# range 0 .. 31;
RXD at 16#518# range 0 .. 31;
TXD at 16#51C# range 0 .. 31;
BAUDRATE at 16#524# range 0 .. 31;
CONFIG at 16#56C# range 0 .. 31;
end record;
-- Universal Asynchronous Receiver/Transmitter
UART0_Periph : aliased UART_Peripheral
with Import, Address => UART0_Base;
end Interfaces.NRF52.UART;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUNTIME COMPONENTS --
-- --
-- ADA.NUMERICS.LONG_LONG_COMPLEX.ELEMENTARY_FUNCTIONS --
-- --
-- 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.Numerics.Long_Long_Complex_Types;
with Ada.Numerics.Generic_Complex_Elementary_Functions;
package Ada.Numerics.Long_Long_Complex_Elementary_Functions is
new Ada.Numerics.Generic_Complex_Elementary_Functions
(Ada.Numerics.Long_Long_Complex_Types);
|
private with STM32.GPIO, STM32.Device;
package TTS_Example2 is
procedure Main;
private
use STM32.GPIO, STM32.Device;
Probe_TT_Point : GPIO_Point := PD2;
Probe_ET_Point : GPIO_Point := PD6;
end TTS_Example2;
|
-- SPDX-FileCopyrightText: 2021 Max Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
with League.String_Vectors;
package WebIDL.Contexts is
pragma Preelaborate;
type Context is tagged limited private;
private
type Context is tagged limited record
null;
end record;
end WebIDL.Contexts;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . P A R A M E T E R S --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1998-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. --
-- --
------------------------------------------------------------------------------
-- This is the Solaris (native) specific version
package body System.Parameters is
------------------------
-- Default_Stack_Size --
------------------------
function Default_Stack_Size return Size_Type is
begin
return 100_000;
end Default_Stack_Size;
------------------------
-- Minimum_Stack_Size --
------------------------
function Minimum_Stack_Size return Size_Type is
thr_min_stack : constant Size_Type := 1160;
-- hard coded value for Solaris 8 to avoid adding dependency on
-- libthread for every Ada program.
-- This value does not really matter anyway, since this is checked
-- and adjusted at the library level when creating a thread.
begin
return thr_min_stack;
end Minimum_Stack_Size;
-------------------------
-- Adjust_Storage_Size --
-------------------------
function Adjust_Storage_Size (Size : Size_Type) return Size_Type is
begin
if Size = Unspecified_Size then
return Default_Stack_Size;
elsif Size < Minimum_Stack_Size then
return Minimum_Stack_Size;
else
return Size;
end if;
end Adjust_Storage_Size;
end System.Parameters;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 4 7 --
-- --
-- B o d y --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
with System.Storage_Elements;
with System.Unsigned_Types;
package body System.Pack_47 is
subtype Bit_Order is System.Bit_Order;
Reverse_Bit_Order : constant Bit_Order :=
Bit_Order'Val (1 - Bit_Order'Pos (System.Default_Bit_Order));
subtype Ofs is System.Storage_Elements.Storage_Offset;
subtype Uns is System.Unsigned_Types.Unsigned;
subtype N07 is System.Unsigned_Types.Unsigned range 0 .. 7;
use type System.Storage_Elements.Storage_Offset;
use type System.Unsigned_Types.Unsigned;
type Cluster is record
E0, E1, E2, E3, E4, E5, E6, E7 : Bits_47;
end record;
for Cluster use record
E0 at 0 range 0 * Bits .. 0 * Bits + Bits - 1;
E1 at 0 range 1 * Bits .. 1 * Bits + Bits - 1;
E2 at 0 range 2 * Bits .. 2 * Bits + Bits - 1;
E3 at 0 range 3 * Bits .. 3 * Bits + Bits - 1;
E4 at 0 range 4 * Bits .. 4 * Bits + Bits - 1;
E5 at 0 range 5 * Bits .. 5 * Bits + Bits - 1;
E6 at 0 range 6 * Bits .. 6 * Bits + Bits - 1;
E7 at 0 range 7 * Bits .. 7 * Bits + Bits - 1;
end record;
for Cluster'Size use Bits * 8;
for Cluster'Alignment use Integer'Min (Standard'Maximum_Alignment,
1 +
1 * Boolean'Pos (Bits mod 2 = 0) +
2 * Boolean'Pos (Bits mod 4 = 0));
-- Use maximum possible alignment, given the bit field size, since this
-- will result in the most efficient code possible for the field.
type Cluster_Ref is access Cluster;
type Rev_Cluster is new Cluster
with Bit_Order => Reverse_Bit_Order,
Scalar_Storage_Order => Reverse_Bit_Order;
type Rev_Cluster_Ref is access Rev_Cluster;
------------
-- Get_47 --
------------
function Get_47
(Arr : System.Address;
N : Natural;
Rev_SSO : Boolean) return Bits_47
is
A : constant System.Address := Arr + Bits * Ofs (Uns (N) / 8);
C : Cluster_Ref with Address => A'Address, Import;
RC : Rev_Cluster_Ref with Address => A'Address, Import;
begin
if Rev_SSO then
case N07 (Uns (N) mod 8) is
when 0 => return RC.E0;
when 1 => return RC.E1;
when 2 => return RC.E2;
when 3 => return RC.E3;
when 4 => return RC.E4;
when 5 => return RC.E5;
when 6 => return RC.E6;
when 7 => return RC.E7;
end case;
else
case N07 (Uns (N) mod 8) is
when 0 => return C.E0;
when 1 => return C.E1;
when 2 => return C.E2;
when 3 => return C.E3;
when 4 => return C.E4;
when 5 => return C.E5;
when 6 => return C.E6;
when 7 => return C.E7;
end case;
end if;
end Get_47;
------------
-- Set_47 --
------------
procedure Set_47
(Arr : System.Address;
N : Natural;
E : Bits_47;
Rev_SSO : Boolean)
is
A : constant System.Address := Arr + Bits * Ofs (Uns (N) / 8);
C : Cluster_Ref with Address => A'Address, Import;
RC : Rev_Cluster_Ref with Address => A'Address, Import;
begin
if Rev_SSO then
case N07 (Uns (N) mod 8) is
when 0 => RC.E0 := E;
when 1 => RC.E1 := E;
when 2 => RC.E2 := E;
when 3 => RC.E3 := E;
when 4 => RC.E4 := E;
when 5 => RC.E5 := E;
when 6 => RC.E6 := E;
when 7 => RC.E7 := E;
end case;
else
case N07 (Uns (N) mod 8) is
when 0 => C.E0 := E;
when 1 => C.E1 := E;
when 2 => C.E2 := E;
when 3 => C.E3 := E;
when 4 => C.E4 := E;
when 5 => C.E5 := E;
when 6 => C.E6 := E;
when 7 => C.E7 := E;
end case;
end if;
end Set_47;
end System.Pack_47;
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.