hexsha
stringlengths 40
40
| size
int64 3
1.05M
| ext
stringclasses 163
values | lang
stringclasses 53
values | max_stars_repo_path
stringlengths 3
945
| max_stars_repo_name
stringlengths 4
112
| max_stars_repo_head_hexsha
stringlengths 40
78
| max_stars_repo_licenses
sequencelengths 1
10
| max_stars_count
float64 1
191k
⌀ | max_stars_repo_stars_event_min_datetime
stringlengths 24
24
⌀ | max_stars_repo_stars_event_max_datetime
stringlengths 24
24
⌀ | max_issues_repo_path
stringlengths 3
945
| max_issues_repo_name
stringlengths 4
113
| max_issues_repo_head_hexsha
stringlengths 40
78
| max_issues_repo_licenses
sequencelengths 1
10
| max_issues_count
float64 1
116k
⌀ | max_issues_repo_issues_event_min_datetime
stringlengths 24
24
⌀ | max_issues_repo_issues_event_max_datetime
stringlengths 24
24
⌀ | max_forks_repo_path
stringlengths 3
945
| max_forks_repo_name
stringlengths 4
113
| max_forks_repo_head_hexsha
stringlengths 40
78
| max_forks_repo_licenses
sequencelengths 1
10
| max_forks_count
float64 1
105k
⌀ | max_forks_repo_forks_event_min_datetime
stringlengths 24
24
⌀ | max_forks_repo_forks_event_max_datetime
stringlengths 24
24
⌀ | content
stringlengths 3
1.05M
| avg_line_length
float64 1
966k
| max_line_length
int64 1
977k
| alphanum_fraction
float64 0
1
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
cbe638d8a6f4830618bfd4062ced8719b5388e93 | 18,417 | adb | Ada | 3-mid/physics/interface/source/private/bullet/bullet_physics-space.adb | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 3-mid/physics/interface/source/private/bullet/bullet_physics-space.adb | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 3-mid/physics/interface/source/private/bullet/bullet_physics-space.adb | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | with
bullet_c.Binding,
bullet_c.ray_Collision,
c_math_c.Vector_3,
c_math_c.Conversion,
c_math_c.Pointers,
bullet_physics.Shape,
bullet_physics.Joint,
bullet_physics.Object,
Swig,
lace.Any,
interfaces.C,
ada.unchecked_Conversion;
package body bullet_Physics.Space
is
use bullet_c.Binding,
bullet_c.Pointers,
c_math_c.Conversion,
Interfaces;
function to_Object_view is new ada.unchecked_Conversion (swig.void_ptr,
physics.Object.view);
----------
--- Forge
--
function to_Space return Item
is
begin
return Self : Item
do
Self.C := bullet_c.Binding.b3d_new_Space;
end return;
end to_Space;
overriding
procedure destruct (Self : in out Item)
is
begin
bullet_c.Binding.b3d_free_Space (Self.C);
end destruct;
---------
--- Shape
--
overriding
function new_Shape (Self : access Item; Model : in physics.Model.view) return physics.Shape.view
is
begin
raise Error with "TODO";
return null;
end new_Shape;
overriding
function new_sphere_Shape (Self : access Item; Radius : in Real := 0.5) return physics.Shape.view
is
pragma unreferenced (Self);
the_Sphere : constant physics.Shape .view := bullet_physics.Shape.new_sphere_Shape (Radius);
begin
return the_Sphere;
end new_sphere_Shape;
overriding
function new_box_Shape (Self : access Item; half_Extents : in Vector_3 := (0.5, 0.5, 0.5)) return physics.Shape.view
is
pragma Unreferenced (Self);
the_Box : constant physics.Shape.view := bullet_physics.Shape.new_box_Shape (half_Extents);
begin
return the_Box;
end new_box_Shape;
overriding
function new_capsule_Shape (Self : access Item; Radius : in Real := 0.5;
Height : in Real) return physics.Shape.view
is
pragma unreferenced (Self);
the_Capsule : constant physics.Shape .view := bullet_physics.Shape.new_capsule_Shape (Radii => (Radius, Radius),
Height => Height);
begin
return the_Capsule;
end new_capsule_Shape;
overriding
function new_cone_Shape (Self : access Item; Radius : in Real := 0.5;
Height : in Real := 1.0) return physics.Shape.view
is
pragma unreferenced (Self);
the_Cone : constant physics.Shape.view := bullet_physics.Shape.new_cone_Shape (Radius, Height);
begin
return the_Cone;
end new_cone_Shape;
overriding
function new_cylinder_Shape (Self : access Item; half_Extents : in Vector_3 := (0.5, 0.5, 0.5)) return physics.Shape.view
is
pragma unreferenced (Self);
the_Cylinder : constant physics.Shape.view := bullet_physics.Shape.new_cylinder_Shape (half_Extents);
begin
return the_Cylinder;
end New_Cylinder_Shape;
overriding
function new_heightfield_Shape (Self : access Item; Heightfield : in out physics.Heightfield;
Scale : in Vector_3) return physics.Shape.view
is
pragma unreferenced (Self);
function height_Extent (Self : in physics.Heightfield) return Vector_2
is
Min : Real := Real'Last;
Max : Real := Real'First;
begin
for Row in Self'Range (1)
loop
for Col in Self'Range (2)
loop
Min := Real'Min (Min, Self (Row, Col));
Max := Real'Max (Max, Self (Row, Col));
end loop;
end loop;
return (Min, Max);
end height_Extent;
function convert is new ada.unchecked_Conversion (physics.Space.Real_view,
c_math_c.Pointers.Real_Pointer);
the_height_Extent : constant Vector_2 := height_Extent (Heightfield);
the_Heightfield : constant physics.Shape.view := bullet_physics.Shape.new_heightfield_Shape (Heightfield'Length (1),
Heightfield'Length (2),
convert (Heightfield (1, 1)'unchecked_Access),
the_height_Extent (1),
the_height_Extent (2),
Scale);
begin
return the_Heightfield;
end new_heightfield_Shape;
overriding
function new_multisphere_Shape (Self : access Item; Sites : in physics.vector_3_array;
Radii : in Vector) return physics.Shape.view
is
pragma unreferenced (Self);
the_multi_Sphere : constant physics.Shape.view := bullet_physics.Shape.new_multisphere_Shape (Sites, Radii);
begin
return the_multi_Sphere;
end new_multisphere_Shape;
overriding
function new_plane_Shape (Self : access Item; Normal : in Vector_3 := (0.0, 1.0, 0.0);
Offset : in Real := 0.0) return physics.Shape .view
is
pragma unreferenced (Self);
the_Plane : constant physics.Shape.view := bullet_physics.Shape.new_plane_Shape (Normal, Offset);
begin
return the_Plane;
end new_plane_Shape;
overriding
function new_convex_hull_Shape (Self : access Item; Points : in physics.vector_3_array) return physics.Shape.view
is
pragma unreferenced (Self);
the_Hull : constant physics.Shape.view := bullet_physics.Shape.new_convex_hull_Shape (Points);
begin
return the_Hull;
end new_convex_hull_Shape;
overriding
function new_mesh_Shape (Self : access Item; Points : access Physics.Geometry_3D.a_Model) return physics.Shape.view
is
pragma unreferenced (Self);
the_Mesh : constant physics.Shape.view := bullet_physics.Shape.new_mesh_Shape (Points);
begin
return the_Mesh;
end new_mesh_Shape;
-- 2D
--
overriding
function new_circle_Shape (Self : access Item; Radius : in Real := 0.5) return physics.Shape.view
is
begin
raise physics.Space.unsupported_Shape with "Circle shape not allowed in bullet physics.";
return null;
end new_circle_Shape;
overriding
function new_polygon_Shape (Self : access Item; Vertices : in physics.Space.polygon_Vertices) return physics.Shape.view
is
begin
raise physics.Space.unsupported_Shape with "Polygon shape not allowed in bullet physics.";
return null;
end new_polygon_Shape;
------------
--- Objects
--
function Hash (the_C_Object : in bullet_c.Pointers.Object_pointer) return ada.Containers.Hash_type
is
function convert is new ada.unchecked_Conversion (bullet_c.Pointers.Object_pointer,
ada.Containers.Hash_type);
begin
return convert (the_C_Object);
end Hash;
overriding
function new_Object (Self : access Item; of_Shape : in physics.Shape .view;
of_Mass : in Real;
Friction : in Real;
Restitution : in Real;
at_Site : in Vector_3;
is_Kinematic : in Boolean) return physics.Object.view
is
pragma unreferenced (Self);
the_b3d_Object : constant bullet_Physics.Object.view := bullet_physics.Object.new_Object (Shape => of_Shape,
Mass => of_Mass,
Friction => Friction,
Restitution => Restitution,
at_Site => at_Site);
the_Object : constant physics.Object.view := physics.Object.view (the_b3d_Object);
begin
return the_Object;
end new_Object;
overriding
function object_Count (Self : in Item) return Natural
is
begin
raise Error with "TODO";
return 0;
end object_Count;
-----------
--- Joints
--
overriding
function new_hinge_Joint (Self : access Item; Object_A,
Object_B : in physics.Object.view;
Anchor_in_A,
Anchor_in_B : in Vector_3;
pivot_Axis : in Vector_3;
low_Limit,
high_Limit : in Real;
collide_Connected : in Boolean) return physics.Joint.hinge.view
is
begin
raise Error with "TODO";
return null;
end new_hinge_Joint;
overriding
function new_hinge_Joint (Self : access Item; Object_A : in physics.Object.view;
Frame_A : in Matrix_4x4) return physics.Joint.hinge.view
is
pragma unreferenced (Self);
the_Joint : constant physics.Joint.hinge.view := bullet_physics.Joint.new_hinge_Joint (Object_A, Frame_A);
begin
return the_Joint;
end new_hinge_Joint;
overriding
function new_hinge_Joint (Self : access Item; Object_A,
Object_B : in physics.Object.view;
Frame_A,
Frame_B : in Matrix_4x4;
low_Limit,
high_Limit : in Real;
collide_Connected : in Boolean) return physics.Joint.hinge.view
is
pragma unreferenced (Self);
the_Joint : constant physics.Joint.hinge.view := bullet_physics.Joint.new_hinge_Joint (Object_A, Object_B,
Frame_A, Frame_B);
begin
return the_Joint;
end new_hinge_Joint;
overriding
function new_DoF6_Joint (Self : access Item; Object_A,
Object_B : in physics.Object.view;
Frame_A,
Frame_B : in Matrix_4x4) return physics.Joint.DoF6.view
is
pragma Unreferenced (Self);
the_Joint : constant physics.Joint.DoF6.view := bullet_physics.Joint.new_DoF6_Joint (Object_A, Object_B,
Frame_A, Frame_B);
begin
return the_Joint;
end new_DoF6_Joint;
overriding
function new_ball_Joint (Self : access Item; Object_A,
Object_B : in physics.Object.view;
Pivot_in_A,
Pivot_in_B : in Vector_3) return physics.Joint.ball.view
is
pragma unreferenced (Self);
the_Joint : constant physics.Joint.ball.view := Standard.bullet_physics.Joint.new_ball_Joint (Object_A, Object_B,
Pivot_in_A, Pivot_in_B);
begin
return the_Joint;
end new_ball_Joint;
overriding
function new_slider_Joint (Self : access Item; Object_A,
Object_B : in physics.Object.view;
Frame_A,
Frame_B : in Matrix_4x4) return physics.Joint.slider.view
is
pragma unreferenced (Self);
the_Joint : constant physics.Joint.slider.view := bullet_physics.Joint.new_slider_Joint (Object_A, Object_B,
Frame_A, Frame_B);
begin
return the_Joint;
end new_slider_Joint;
overriding
function new_cone_twist_Joint (Self : access Item; Object_A,
Object_B : in physics.Object.view;
Frame_A,
Frame_B : in Matrix_4x4) return physics.Joint.cone_twist.view
is
pragma unreferenced (Self);
the_Joint : constant physics.Joint.cone_twist.view := bullet_physics.Joint.new_cone_twist_Joint (Object_A, Object_B,
Frame_A, Frame_B);
begin
return the_Joint;
end new_cone_twist_Joint;
---------------
--- Operations
--
overriding
procedure update_Bounds (Self : in out Item; of_Obect : in physics.Object.view)
is
the_c_Object : constant access bullet_c.Object := bullet_physics.Object.view (of_Obect).C;
begin
raise Error with "TODO";
end update_Bounds;
overriding
procedure add (Self : in out Item; Object : in physics.Object.view)
is
the_c_Object : constant Object_Pointer := bullet_physics.Object.view (Object).C;
begin
b3d_Space_add_Object (Self.C, the_c_Object);
end add;
overriding
procedure rid (Self : in out Item; Object : in physics.Object.view)
is
the_c_Object : constant Object_Pointer := bullet_physics.Object.view (Object).C;
begin
b3d_Space_rid_Object (Self.C, the_c_Object);
end rid;
overriding
function cast_Ray (Self : access Item; From, To : in Vector_3) return physics.Space.ray_Collision
is
c_From : aliased c_math_c.Vector_3.item := +From;
c_To : aliased c_math_c.Vector_3.item := +To;
the_Collision : physics.Space.ray_Collision;
the_c_Collision : constant bullet_c.ray_Collision.item := b3d_Space_cast_Ray (Self.C, c_From'unchecked_Access,
c_To 'unchecked_Access);
begin
if the_c_Collision.near_Object /= null
then
the_Collision.near_Object := to_Object_view (b3d_Object_user_Data (the_c_Collision.near_Object));
end if;
the_Collision.hit_Fraction := Real (the_c_Collision.hit_Fraction);
the_Collision.Normal_world := +the_c_Collision.Normal_world;
the_Collision.Site_world := +the_c_Collision.Site_world;
return the_Collision;
end cast_Ray;
overriding
procedure evolve (Self : in out Item; By : in Duration)
is
begin
bullet_c.Binding.b3d_Space_evolve (Self.C, C.C_float (By));
-- Update each objects dynamics.
--
declare
use c_Object_Maps_of_Object;
Cursor : c_Object_Maps_of_Object.Cursor := Self.object_Map.First;
the_Object : bullet_Physics.Object.view;
begin
while has_Element (Cursor)
loop
the_Object := Element (Cursor);
the_Object.update_Dynamics;
next (Cursor);
end loop;
end;
end evolve;
overriding
function Gravity (Self : in Item) return Vector_3
is
begin
raise Error with "TODO";
return (0.0, 0.0, 0.0);
end Gravity;
overriding
procedure Gravity_is (Self : in out Item; Now : in Vector_3)
is
c_Now : aliased c_math_c.Vector_3.item := +Now;
begin
bullet_c.Binding.b3d_Space_Gravity_is (Self.C, c_Now'unchecked_Access);
end Gravity_is;
overriding
procedure add (Self : in out Item; Joint : in physics.Joint.view)
is
the_c_Joint : constant Joint_Pointer := bullet_physics.Joint.view (Joint).C;
begin
b3d_Space_add_Joint (Self.C, the_c_Joint);
end add;
overriding
procedure rid (Self : in out Item; Joint : in physics.Joint.view)
is
begin
raise Error with "TODO";
end rid;
overriding
function manifold_Count (Self : in Item) return Natural
is
begin
raise Error with "TODO";
return 0;
end manifold_Count;
overriding
function Manifold (Self : access Item; Index : in Positive) return physics.space.a_Manifold
is
type Any_limited_view is access all lace.Any.limited_item'Class;
the_Manifold : physics.space.a_Manifold;
begin
raise Error with "TODO";
return the_Manifold;
end Manifold;
overriding
procedure set_Joint_local_Anchor (Self : in out Item; the_Joint : in physics.Joint.view;
is_Anchor_A : in Boolean;
local_Anchor : in Vector_3)
is
begin
raise Error with "TODO";
end set_Joint_local_Anchor;
-----------------
--- Joint Cursors
--
overriding
procedure next (Cursor : in out joint_Cursor)
is
begin
raise Error with "TODO";
end next;
overriding
function has_Element (Cursor : in joint_Cursor) return Boolean
is
begin
raise Error with "TODO";
return False;
end has_Element;
overriding
function Element (Cursor : in joint_Cursor) return physics.Joint.view
is
begin
raise Error with "TODO";
return null;
end Element;
overriding
function first_Joint (Self : in Item) return physics.Space.joint_Cursor'Class
is
begin
raise Error with "TODO";
return joint_Cursor' (others => <>);
end first_Joint;
end bullet_Physics.Space;
| 33.669104 | 147 | 0.544388 |
3188b8672f9d76dd6e64edd23f844010169160e2 | 6,468 | adb | Ada | ADL/drivers/stm32f334/stm32-syscfg.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ADL/drivers/stm32f334/stm32-syscfg.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ADL/drivers/stm32f334/stm32-syscfg.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- 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 stm32f407xx.h et al. --
-- @author MCD Application Team --
-- @version V1.1.0 --
-- @date 19-June-2014 --
-- @brief CMSIS STM32F407xx Device Peripheral Access Layer Header File. --
-- --
-- COPYRIGHT(c) 2014 STMicroelectronics --
------------------------------------------------------------------------------
-- This file provides register definitions for the STM32F3 (ARM Cortex M4F)
-- microcontrollers from ST Microelectronics.
with STM32_SVD.EXTI; use STM32_SVD.EXTI;
with STM32_SVD.RCC; use STM32_SVD.RCC;
with STM32_SVD.SYSCFG; use STM32_SVD.SYSCFG;
with STM32.EXTI;
with STM32.Device; use STM32.Device;
package body STM32.SYSCFG is
subtype GPIO_Pin_Index is Natural range 0 .. 15;
procedure Connect_External_Interrupt
(Port : GPIO_Port;
Pin : GPIO_Pin_Index);
-------------------------
-- Enable_SYSCFG_Clock --
-------------------------
procedure Enable_SYSCFG_Clock is
begin
RCC_Periph.APB2ENR.SYSCFGEN := True;
end Enable_SYSCFG_Clock;
-----------------------------
-- Reset_SYSCFG_COMP_OPAMP --
-----------------------------
procedure Reset_SYSCFG is
begin
RCC_Periph.APB2RSTR.SYSCFGRST := True;
RCC_Periph.APB2RSTR.SYSCFGRST := False;
end Reset_SYSCFG;
--------------------------------
-- Connect_External_Interrupt --
--------------------------------
procedure Connect_External_Interrupt
(Port : GPIO_Port;
Pin : GPIO_Pin_Index)
is
Port_Id : constant UInt4 := GPIO_Port_Representation (Port);
begin
-- Finally we assign the port 'number' to the EXTI_n value within the
-- control register. We depend upon the Port enumerals' underlying
-- numeric representation values matching what the hardware expects,
-- that is, the values 0 .. n-1, which we get automatically unless
-- overridden.
case Pin is
when 0 .. 3 =>
SYSCFG_COMP_OPAMP_Periph.SYSCFG_EXTICR1.EXTI.Arr (Pin) := Port_Id;
when 4 .. 7 =>
SYSCFG_COMP_OPAMP_Periph.SYSCFG_EXTICR2.EXTI.Arr (Pin) := Port_Id;
when 8 .. 11 =>
SYSCFG_COMP_OPAMP_Periph.SYSCFG_EXTICR3.EXTI.Arr (Pin) := Port_Id;
when 12 .. 15 =>
SYSCFG_COMP_OPAMP_Periph.SYSCFG_EXTICR4.EXTI.Arr (Pin) := Port_Id;
end case;
end Connect_External_Interrupt;
--------------------------------
-- Connect_External_Interrupt --
--------------------------------
procedure Connect_External_Interrupt
(Port : GPIO_Port;
Pin : GPIO_Pin)
is
begin
Connect_External_Interrupt (Port, GPIO_Pin'Pos (Pin));
end Connect_External_Interrupt;
--------------------------------
-- Connect_External_Interrupt --
--------------------------------
procedure Connect_External_Interrupt
(Point : GPIO_Point)
is
begin
Connect_External_Interrupt (Point.Periph.all, Point.Pin);
end Connect_External_Interrupt;
--------------------------------
-- Connect_External_Interrupt --
--------------------------------
procedure Connect_External_Interrupt
(Port : GPIO_Port;
Pins : GPIO_Pins)
is
begin
for Pin of Pins loop
Connect_External_Interrupt (Port, Pin);
end loop;
end Connect_External_Interrupt;
------------------------------
-- Clear_External_Interrupt --
------------------------------
procedure Clear_External_Interrupt (Pin : GPIO_Pin) is
use STM32.EXTI;
begin
Clear_External_Interrupt (External_Line_Number'Val (GPIO_Pin'Pos (Pin)));
end Clear_External_Interrupt;
end STM32.SYSCFG;
| 41.461538 | 79 | 0.513915 |
1d40fca6b8f6d3e480d0ea2657ccffc8f767565c | 5,943 | adb | Ada | llvm-gcc-4.2-2.9/gcc/ada/s-osinte-tru64.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | 1 | 2016-04-09T02:58:13.000Z | 2016-04-09T02:58:13.000Z | llvm-gcc-4.2-2.9/gcc/ada/s-osinte-tru64.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/s-osinte-tru64.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . O S _ I N T E R F A C E --
-- --
-- B o d y --
-- --
-- Copyright (C) 1998-2005, Free Software Foundation, Inc. --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNARL is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNARL; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
-- This is the DEC Unix version of this package
-- This package encapsulates all direct interfaces to OS services
-- that are needed by children of System.
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 Interfaces.C; use Interfaces.C;
with System.Machine_Code; use System.Machine_Code;
package body System.OS_Interface is
--------------------
-- Get_Stack_Base --
--------------------
function Get_Stack_Base (thread : pthread_t) return Address is
pragma Unreferenced (thread);
begin
return Null_Address;
end Get_Stack_Base;
------------------
-- pthread_init --
------------------
procedure pthread_init is
begin
null;
end pthread_init;
------------------
-- pthread_self --
------------------
function pthread_self return pthread_t is
Self : pthread_t;
begin
Asm ("call_pal 0x9e" & ASCII.LF & ASCII.HT &
"bis $31, $0, %0",
Outputs => pthread_t'Asm_Output ("=r", Self),
Clobber => "$0");
return Self;
end pthread_self;
----------------------
-- Hide_Yellow_Zone --
----------------------
procedure Hide_Yellow_Zone is
type Teb_Ptr is access all pthread_teb_t;
Teb : Teb_Ptr;
Res : Interfaces.C.int;
pragma Unreferenced (Res);
begin
-- Get the Thread Environment Block address
Asm ("call_pal 0x9e" & ASCII.LF & ASCII.HT &
"bis $31, $0, %0",
Outputs => Teb_Ptr'Asm_Output ("=r", Teb),
Clobber => "$0");
-- Stick a guard page right above the Yellow Zone if it exists
if Teb.all.stack_yellow /= Teb.all.stack_guard then
Res := mprotect (Teb.all.stack_yellow, Get_Page_Size, PROT_ON);
end if;
end Hide_Yellow_Zone;
-----------------
-- To_Duration --
-----------------
function To_Duration (TS : timespec) return Duration is
begin
return Duration (TS.tv_sec) + Duration (TS.tv_nsec) / 10#1#E9;
end To_Duration;
function To_Duration (TV : struct_timeval) return Duration is
begin
return Duration (TV.tv_sec) + Duration (TV.tv_usec) / 10#1#E6;
end To_Duration;
-----------------
-- To_Timespec --
-----------------
function To_Timespec (D : Duration) return timespec is
S : time_t;
F : Duration;
begin
S := time_t (Long_Long_Integer (D));
F := D - Duration (S);
-- If F has negative value due to a round-up, adjust for positive F
-- value.
if F < 0.0 then
S := S - 1;
F := F + 1.0;
end if;
return timespec'(tv_sec => S,
tv_nsec => long (Long_Long_Integer (F * 10#1#E9)));
end To_Timespec;
----------------
-- To_Timeval --
----------------
function To_Timeval (D : Duration) return struct_timeval is
S : time_t;
F : Duration;
begin
S := time_t (Long_Long_Integer (D));
F := D - Duration (S);
-- If F has negative value due to a round-up, adjust for positive F
-- value.
if F < 0.0 then
S := S - 1;
F := F + 1.0;
end if;
return
struct_timeval'
(tv_sec => S,
tv_usec => time_t (Long_Long_Integer (F * 10#1#E6)));
end To_Timeval;
end System.OS_Interface;
| 34.754386 | 78 | 0.492849 |
2f38f8917938e845b23157ca53cc7b573e2f2385 | 74 | ads | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/decl_ctx_use.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/decl_ctx_use.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/decl_ctx_use.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z |
package DECL_CTX_Use is
procedure Check_1;
procedure Check_2;
end;
| 12.333333 | 23 | 0.756757 |
31eacd63ae4b022b7d1f0f42fd60520ca336c715 | 1,673 | ads | Ada | tier-1/xcb/source/thin/xcb-xcb_big_requests_enable_reply_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | 2 | 2015-11-12T11:16:20.000Z | 2021-08-24T22:32:04.000Z | tier-1/xcb/source/thin/xcb-xcb_big_requests_enable_reply_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | 1 | 2018-06-05T05:19:35.000Z | 2021-11-20T01:13:23.000Z | tier-1/xcb/source/thin/xcb-xcb_big_requests_enable_reply_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | null | null | null | -- This file is generated by SWIG. Please do not modify by hand.
--
with Interfaces;
with Interfaces.C;
with Interfaces.C.Pointers;
package xcb.xcb_big_requests_enable_reply_t is
-- Item
--
type Item is record
response_type : aliased Interfaces.Unsigned_8;
pad0 : aliased Interfaces.Unsigned_8;
sequence : aliased Interfaces.Unsigned_16;
length : aliased Interfaces.Unsigned_32;
maximum_request_length : aliased Interfaces.Unsigned_32;
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb.xcb_big_requests_enable_reply_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_big_requests_enable_reply_t.Item,
Element_Array => xcb.xcb_big_requests_enable_reply_t.Item_Array,
Default_Terminator => (others => <>));
subtype Pointer is C_Pointers.Pointer;
-- Pointer_Array
--
type Pointer_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb.xcb_big_requests_enable_reply_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_big_requests_enable_reply_t.Pointer,
Element_Array => xcb.xcb_big_requests_enable_reply_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_big_requests_enable_reply_t;
| 29.350877 | 78 | 0.659295 |
06cf1abe5d940354c54e0d50caa3f61c1a0ba89d | 5,134 | adb | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnarl/s-osinte__rtems.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnarl/s-osinte__rtems.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnarl/s-osinte__rtems.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNU ADA RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . O S _ I N T E R F A C E --
-- --
-- B o d y --
-- --
-- Copyright (C) 1991-2017, Florida State University --
-- Copyright (C) 1995-2020, 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/>. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. It is --
-- now maintained by Ada Core Technologies Inc. in cooperation with Florida --
-- State University (http://www.gnat.com). --
-- --
-- The GNARL files that were developed for RTEMS are maintained by On-Line --
-- Applications Research Corporation (http://www.oarcorp.com) in coopera- --
-- tion with Ada Core Technologies Inc. and Florida State University. --
-- --
------------------------------------------------------------------------------
-- This is the RTEMS version of this package
-- This package encapsulates all direct interfaces to OS services
-- that are needed by children of System.
with Interfaces.C; use Interfaces.C;
package body System.OS_Interface is
-----------------
-- To_Duration --
-----------------
function To_Duration (TS : timespec) return Duration is
begin
return Duration (TS.tv_sec) + Duration (TS.tv_nsec) / 10#1#E9;
end To_Duration;
------------------------
-- To_Target_Priority --
------------------------
function To_Target_Priority
(Prio : System.Any_Priority) return Interfaces.C.int
is
begin
return Interfaces.C.int (Prio);
end To_Target_Priority;
-----------------
-- To_Timespec --
-----------------
function To_Timespec (D : Duration) return timespec is
S : time_t;
F : Duration;
begin
S := time_t (Long_Long_Integer (D));
F := D - Duration (S);
-- If F has negative value due to round-up, adjust for positive F value
if F < 0.0 then
S := S - 1;
F := F + 1.0;
end if;
return timespec'(tv_sec => S,
tv_nsec => long (Long_Long_Integer (F * 10#1#E9)));
end To_Timespec;
------------------
-- pthread_init --
------------------
procedure pthread_init is
begin
null;
end pthread_init;
--------------------
-- Get_Stack_Base --
--------------------
function Get_Stack_Base (thread : pthread_t) return Address is
pragma Warnings (Off, thread);
begin
return Null_Address;
end Get_Stack_Base;
-----------------
-- sigaltstack --
-----------------
function sigaltstack
(ss : not null access stack_t;
oss : access stack_t) return int is
pragma Unreferenced (ss);
pragma Unreferenced (oss);
begin
return 0;
end sigaltstack;
-----------------------------------
-- pthread_rwlockattr_setkind_np --
-----------------------------------
function pthread_rwlockattr_setkind_np
(attr : access pthread_rwlockattr_t;
pref : int) return int is
pragma Unreferenced (attr);
pragma Unreferenced (pref);
begin
return 0;
end pthread_rwlockattr_setkind_np;
end System.OS_Interface;
| 38.02963 | 78 | 0.462797 |
2f2a5f68d477c5f6a264fc57923ea3a340823b4a | 4,869 | adb | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-atocou__builtin.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-atocou__builtin.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-atocou__builtin.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . A T O M I C _ C O U N T E R S --
-- --
-- B o d y --
-- --
-- Copyright (C) 2011-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package implements Atomic_Counter and Atomic_Unsigned operations
-- for platforms where GCC supports __sync_add_and_fetch_4 and
-- __sync_sub_and_fetch_4 builtins.
package body System.Atomic_Counters is
procedure Sync_Add_And_Fetch
(Ptr : access Atomic_Unsigned;
Value : Atomic_Unsigned);
pragma Import (Intrinsic, Sync_Add_And_Fetch, "__sync_add_and_fetch_4");
function Sync_Sub_And_Fetch
(Ptr : access Atomic_Unsigned;
Value : Atomic_Unsigned) return Atomic_Unsigned;
pragma Import (Intrinsic, Sync_Sub_And_Fetch, "__sync_sub_and_fetch_4");
---------------
-- Decrement --
---------------
procedure Decrement (Item : aliased in out Atomic_Unsigned) is
begin
if Sync_Sub_And_Fetch (Item'Unrestricted_Access, 1) = 0 then
null;
end if;
end Decrement;
function Decrement (Item : aliased in out Atomic_Unsigned) return Boolean is
begin
return Sync_Sub_And_Fetch (Item'Unrestricted_Access, 1) = 0;
end Decrement;
function Decrement (Item : in out Atomic_Counter) return Boolean is
begin
-- Note: the use of Unrestricted_Access here is required because we
-- are obtaining an access-to-volatile pointer to a non-volatile object.
-- This is not allowed for [Unchecked_]Access, but is safe in this case
-- because we know that no aliases are being created.
return Sync_Sub_And_Fetch (Item.Value'Unrestricted_Access, 1) = 0;
end Decrement;
---------------
-- Increment --
---------------
procedure Increment (Item : aliased in out Atomic_Unsigned) is
begin
Sync_Add_And_Fetch (Item'Unrestricted_Access, 1);
end Increment;
procedure Increment (Item : in out Atomic_Counter) is
begin
-- Note: the use of Unrestricted_Access here is required because we are
-- obtaining an access-to-volatile pointer to a non-volatile object.
-- This is not allowed for [Unchecked_]Access, but is safe in this case
-- because we know that no aliases are being created.
Sync_Add_And_Fetch (Item.Value'Unrestricted_Access, 1);
end Increment;
----------------
-- Initialize --
----------------
procedure Initialize (Item : out Atomic_Counter) is
begin
Item.Value := 1;
end Initialize;
------------
-- Is_One --
------------
function Is_One (Item : Atomic_Counter) return Boolean is
begin
return Item.Value = 1;
end Is_One;
end System.Atomic_Counters;
| 43.473214 | 79 | 0.523927 |
574d0148a9c172ae79f9fe9dae724f011cd6c8d8 | 481 | ads | Ada | source/required/s-expllu.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 33 | 2015-04-04T09:19:36.000Z | 2021-11-10T05:33:34.000Z | source/required/s-expllu.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 8 | 2017-11-14T13:05:07.000Z | 2018-08-09T15:28:49.000Z | source/required/s-expllu.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 9 | 2015-02-03T17:09:53.000Z | 2021-11-12T01:16:05.000Z | pragma License (Unrestricted);
-- implementation unit required by compiler
with System.Exponentiations;
with System.Unsigned_Types;
package System.Exp_LLU is
pragma Pure;
-- required for "**" by compiler (s-expllu.ads)
-- Modular types do not raise the exceptions.
function Exp_Long_Long_Unsigned is
new Exponentiations.Generic_Exp_Unsigned (
Unsigned_Types.Long_Long_Unsigned,
Shift_Left => Unsigned_Types.Shift_Left);
end System.Exp_LLU;
| 30.0625 | 51 | 0.748441 |
59eba4de740c1955561c03a3bd96091ff5e7892b | 462 | adb | Ada | test/src/yaml-transformation_tests-harness.adb | robdaemon/AdaYaml | 2cb52c5e7eee3a2d9951945d5ddb4eeddc088f6e | [
"MIT"
] | 32 | 2017-08-02T16:45:34.000Z | 2021-08-18T20:12:57.000Z | test/src/yaml-transformation_tests-harness.adb | robdaemon/AdaYaml | 2cb52c5e7eee3a2d9951945d5ddb4eeddc088f6e | [
"MIT"
] | 15 | 2017-09-13T09:43:38.000Z | 2022-01-20T23:21:47.000Z | test/src/yaml-transformation_tests-harness.adb | robdaemon/AdaYaml | 2cb52c5e7eee3a2d9951945d5ddb4eeddc088f6e | [
"MIT"
] | 5 | 2017-09-19T16:54:22.000Z | 2020-04-09T07:17:02.000Z | -- part of AdaYaml, (c) 2017 Felix Krause
-- released under the terms of the MIT license, see the file "copying.txt"
with Yaml.Transformation_Tests.Suite;
with AUnit.Run;
with AUnit.Reporter.Text;
procedure Yaml.Transformation_Tests.Harness is
procedure Run is new AUnit.Run.Test_Runner (Suite.Suite);
Reporter : AUnit.Reporter.Text.Text_Reporter;
begin
Reporter.Set_Use_ANSI_Colors (True);
Run (Reporter);
end Yaml.Transformation_Tests.Harness;
| 30.8 | 75 | 0.774892 |
2f1052be98158d4a3836ce6266c3222998fb3f98 | 212 | ads | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/controlled6_pkg.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/controlled6_pkg.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/controlled6_pkg.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | with Ada.Finalization;
generic
type T is private;
package Controlled6_Pkg is
type Node_Type is record
Item : T;
end record;
type Node_Access_Type is access Node_Type;
end Controlled6_Pkg;
| 13.25 | 45 | 0.726415 |
29042f7b24834836c1eb6efcdf86c8e8303d575a | 9,293 | adb | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-valuti.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-valuti.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-valuti.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . V A L _ U T I L --
-- --
-- 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.Case_Util; use System.Case_Util;
package body System.Val_Util is
---------------
-- Bad_Value --
---------------
procedure Bad_Value (S : String) is
begin
-- Bad_Value might be called with very long strings allocated on the
-- heap. Limit the size of the message so that we avoid creating a
-- Storage_Error during error handling.
if S'Length > 127 then
raise Constraint_Error with "bad input for 'Value: """
& S (S'First .. S'First + 127) & "...""";
else
raise Constraint_Error with "bad input for 'Value: """ & S & '"';
end if;
end Bad_Value;
----------------------
-- Normalize_String --
----------------------
procedure Normalize_String
(S : in out String;
F, L : out Integer)
is
begin
F := S'First;
L := S'Last;
-- Scan for leading spaces
while F <= L and then S (F) = ' ' loop
F := F + 1;
end loop;
-- Check for case when the string contained no characters
if F > L then
Bad_Value (S);
end if;
-- Scan for trailing spaces
while S (L) = ' ' loop
L := L - 1;
end loop;
-- Except in the case of a character literal, convert to upper case
if S (F) /= ''' then
for J in F .. L loop
S (J) := To_Upper (S (J));
end loop;
end if;
end Normalize_String;
-------------------
-- Scan_Exponent --
-------------------
function Scan_Exponent
(Str : String;
Ptr : not null access Integer;
Max : Integer;
Real : Boolean := False) return Integer
is
P : Natural := Ptr.all;
M : Boolean;
X : Integer;
begin
if P >= Max
or else (Str (P) /= 'E' and then Str (P) /= 'e')
then
return 0;
end if;
-- We have an E/e, see if sign follows
P := P + 1;
if Str (P) = '+' then
P := P + 1;
if P > Max then
return 0;
else
M := False;
end if;
elsif Str (P) = '-' then
P := P + 1;
if P > Max or else not Real then
return 0;
else
M := True;
end if;
else
M := False;
end if;
if Str (P) not in '0' .. '9' then
return 0;
end if;
-- Scan out the exponent value as an unsigned integer. Values larger
-- than (Integer'Last / 10) are simply considered large enough here.
-- This assumption is correct for all machines we know of (e.g. in the
-- case of 16 bit integers it allows exponents up to 3276, which is
-- large enough for the largest floating types in base 2.)
X := 0;
loop
if X < (Integer'Last / 10) then
X := X * 10 + (Character'Pos (Str (P)) - Character'Pos ('0'));
end if;
P := P + 1;
exit when P > Max;
if Str (P) = '_' then
Scan_Underscore (Str, P, Ptr, Max, False);
else
exit when Str (P) not in '0' .. '9';
end if;
end loop;
if M then
X := -X;
end if;
Ptr.all := P;
return X;
end Scan_Exponent;
--------------------
-- Scan_Plus_Sign --
--------------------
procedure Scan_Plus_Sign
(Str : String;
Ptr : not null access Integer;
Max : Integer;
Start : out Positive)
is
P : Natural := Ptr.all;
begin
if P > Max then
Bad_Value (Str);
end if;
-- Scan past initial blanks
while Str (P) = ' ' loop
P := P + 1;
if P > Max then
Ptr.all := P;
Bad_Value (Str);
end if;
end loop;
Start := P;
-- Skip past an initial plus sign
if Str (P) = '+' then
P := P + 1;
if P > Max then
Ptr.all := Start;
Bad_Value (Str);
end if;
end if;
Ptr.all := P;
end Scan_Plus_Sign;
---------------
-- Scan_Sign --
---------------
procedure Scan_Sign
(Str : String;
Ptr : not null access Integer;
Max : Integer;
Minus : out Boolean;
Start : out Positive)
is
P : Natural := Ptr.all;
begin
-- Deal with case of null string (all blanks). As per spec, we raise
-- constraint error, with Ptr unchanged, and thus > Max.
if P > Max then
Bad_Value (Str);
end if;
-- Scan past initial blanks
while Str (P) = ' ' loop
P := P + 1;
if P > Max then
Ptr.all := P;
Bad_Value (Str);
end if;
end loop;
Start := P;
-- Remember an initial minus sign
if Str (P) = '-' then
Minus := True;
P := P + 1;
if P > Max then
Ptr.all := Start;
Bad_Value (Str);
end if;
-- Skip past an initial plus sign
elsif Str (P) = '+' then
Minus := False;
P := P + 1;
if P > Max then
Ptr.all := Start;
Bad_Value (Str);
end if;
else
Minus := False;
end if;
Ptr.all := P;
end Scan_Sign;
--------------------------
-- Scan_Trailing_Blanks --
--------------------------
procedure Scan_Trailing_Blanks (Str : String; P : Positive) is
begin
for J in P .. Str'Last loop
if Str (J) /= ' ' then
Bad_Value (Str);
end if;
end loop;
end Scan_Trailing_Blanks;
---------------------
-- Scan_Underscore --
---------------------
procedure Scan_Underscore
(Str : String;
P : in out Natural;
Ptr : not null access Integer;
Max : Integer;
Ext : Boolean)
is
C : Character;
begin
P := P + 1;
-- If underscore is at the end of string, then this is an error and we
-- raise Constraint_Error, leaving the pointer past the underscore. This
-- seems a bit strange. It means e.g. that if the field is:
-- 345_
-- that Constraint_Error is raised. You might think that the RM in this
-- case would scan out the 345 as a valid integer, leaving the pointer
-- at the underscore, but the ACVC suite clearly requires an error in
-- this situation (see for example CE3704M).
if P > Max then
Ptr.all := P;
Bad_Value (Str);
end if;
-- Similarly, if no digit follows the underscore raise an error. This
-- also catches the case of double underscore which is also an error.
C := Str (P);
if C in '0' .. '9'
or else (Ext and then (C in 'A' .. 'F' or else C in 'a' .. 'f'))
then
return;
else
Ptr.all := P;
Bad_Value (Str);
end if;
end Scan_Underscore;
end System.Val_Util;
| 27.093294 | 79 | 0.449048 |
1d7507b6afc75e2959bd8a61987a57cad94a1bcd | 428 | ads | Ada | src/Projects/eu_projects-event_names.ads | fintatarta/eugen | 2c384838ff0e81b51172310ce5d0e47d71ffd4fd | [
"MIT"
] | null | null | null | src/Projects/eu_projects-event_names.ads | fintatarta/eugen | 2c384838ff0e81b51172310ce5d0e47d71ffd4fd | [
"MIT"
] | null | null | null | src/Projects/eu_projects-event_names.ads | fintatarta/eugen | 2c384838ff0e81b51172310ce5d0e47d71ffd4fd | [
"MIT"
] | null | null | null | package Eu_Projects.Event_Names is
Begin_Name : constant Dotted_Identifier := To_Bounded_String ("begin");
End_Name : constant Dotted_Identifier := To_Bounded_String ("end");
Duration_Name : constant Dotted_Identifier := To_Bounded_String ("duration");
Event_Time_Name : constant Dotted_Identifier := To_Bounded_String ("when");
Default_Time : constant String := "default";
end Eu_Projects.Event_Names;
| 42.8 | 80 | 0.754673 |
20f7c5eb81be226a18f774160000f1169753dc38 | 3,447 | ads | Ada | firehog/ncurses/Ada95/ada_include/terminal_interface-curses-forms-field_types-regexp.ads | KipodAfterFree/KAF-2019-FireHog | 5f6ee3c3c3329459bc9daeabc1a16ff4619508d9 | [
"MIT"
] | 1 | 2019-04-02T20:28:58.000Z | 2019-04-02T20:28:58.000Z | Ada95/ada_include/terminal_interface-curses-forms-field_types-regexp.ads | mitchelhaan/ncurses | 0b8ae5088202164ecc1769aa255ed1aad283d2ae | [
"X11"
] | null | null | null | Ada95/ada_include/terminal_interface-curses-forms-field_types-regexp.ads | mitchelhaan/ncurses | 0b8ae5088202164ecc1769aa255ed1aad283d2ae | [
"X11"
] | 1 | 2019-12-26T10:18:16.000Z | 2019-12-26T10:18:16.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding --
-- --
-- Terminal_Interface.Curses.Forms.Field_Types.RegExp --
-- --
-- S P E C --
-- --
------------------------------------------------------------------------------
-- Copyright (c) 1998 Free Software Foundation, Inc. --
-- --
-- Permission is hereby granted, free of charge, to any person obtaining a --
-- copy of this software and associated documentation files (the --
-- "Software"), to deal in the Software without restriction, including --
-- without limitation the rights to use, copy, modify, merge, publish, --
-- distribute, distribute with modifications, sublicense, and/or sell --
-- copies of the Software, and to permit persons to whom the Software is --
-- furnished to do so, subject to the following conditions: --
-- --
-- The above copyright notice and this permission notice shall be included --
-- in all copies or substantial portions of the Software. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS --
-- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF --
-- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. --
-- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, --
-- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR --
-- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR --
-- THE USE OR OTHER DEALINGS IN THE SOFTWARE. --
-- --
-- Except as contained in this notice, the name(s) of the above copyright --
-- holders shall not be used in advertising or otherwise to promote the --
-- sale, use or other dealings in this Software without prior written --
-- authorization. --
------------------------------------------------------------------------------
-- Author: Juergen Pfeifer <[email protected]> 1996
-- Version Control:
-- $Revision: 1.5 $
-- Binding Version 00.93
------------------------------------------------------------------------------
package Terminal_Interface.Curses.Forms.Field_Types.RegExp is
pragma Preelaborate (RegExp);
type String_Access is access String;
type Regular_Expression_Field is new Field_Type with
record
Regular_Expression : String_Access;
end record;
procedure Set_Field_Type (Fld : in Field;
Typ : in Regular_Expression_Field);
pragma Inline (Set_Field_Type);
end Terminal_Interface.Curses.Forms.Field_Types.RegExp;
| 61.553571 | 78 | 0.454308 |
412b5ff33416ec98b9db9179f4d3d5fbb73b7236 | 2,263 | ads | Ada | PIM/TP10/lca.ads | Hathoute/ENSEEIHT | d42f0b0dedb269e6df3b1c006d4d45e52fc518b8 | [
"MIT"
] | 1 | 2021-06-26T21:51:11.000Z | 2021-06-26T21:51:11.000Z | PIM/TP10/lca.ads | Hathoute/ENSEEIHT | d42f0b0dedb269e6df3b1c006d4d45e52fc518b8 | [
"MIT"
] | null | null | null | PIM/TP10/lca.ads | Hathoute/ENSEEIHT | d42f0b0dedb269e6df3b1c006d4d45e52fc518b8 | [
"MIT"
] | null | null | null | with SDA_Exceptions; use SDA_Exceptions;
-- Définition de structures de données associatives sous forme d'une liste
-- chaînée associative (LCA).
generic
type T_Cle is private;
type T_Donnee is private;
package LCA is
type T_LCA is limited private;
-- Initialiser une Sda. La Sda est vide.
procedure Initialiser(Sda: out T_LCA) with
Post => Est_Vide (Sda);
-- Est-ce qu'une Sda est vide ?
function Est_Vide (Sda : T_LCA) return Boolean;
-- Obtenir le nombre d'éléments d'une Sda.
function Taille (Sda : in T_LCA) return Integer with
Post => Taille'Result >= 0
and (Taille'Result = 0) = Est_Vide (Sda);
-- Enregistrer une Donnée associée à une Clé dans une Sda.
-- Si la clé est déjà présente dans la Sda, sa donnée est changée.
procedure Enregistrer (Sda : in out T_LCA ; Cle : in T_Cle ; Donnee : in T_Donnee) with
Post => Cle_Presente (Sda, Cle)
and then (La_Donnee (Sda, Cle) = Donnee) -- donnée insérée
-- and then (if not (Cle_Presente (Sda, Cle)'Old) then Taille (Sda) = Taille (Sda)'Old)
-- and then (if Cle_Presente (Sda, Cle)'Old then Taille (Sda) = Taille (Sda)'Old + 1)
;
-- Supprimer la Donnée associée à une Clé dans une Sda.
-- Exception : Cle_Absente_Exception si Clé n'est pas utilisée dans la Sda
procedure Supprimer (Sda : in out T_LCA ; Cle : in T_Cle) with
Post => Taille (Sda) = Taille (Sda)'Old - 1 -- un élément de moins
and not Cle_Presente (Sda, Cle); -- la clé a été supprimée
-- Savoir si une Clé est présente dans une Sda.
function Cle_Presente (Sda : in T_LCA ; Cle : in T_Cle) return Boolean;
-- Obtenir la donnée associée à une Cle dans la Sda.
-- Exception : Cle_Absente_Exception si Clé n'est pas utilisée dans l'Sda
function La_Donnee (Sda : in T_LCA ; Cle : in T_Cle) return T_Donnee;
-- Supprimer tous les éléments d'une Sda.
procedure Vider (Sda : in out T_LCA) with
Post => Est_Vide (Sda);
-- Appliquer un traitement (Traiter) pour chaque couple d'une Sda.
generic
with procedure Traiter (Cle : in T_Cle; Donnee: in T_Donnee);
procedure Pour_Chaque (Sda : in T_LCA);
private
type T_Cellule;
type T_LCA is access T_Cellule;
type T_Cellule is record
Cle : T_Cle;
Donnee : T_Donnee;
Suivant : T_LCA;
end record;
end LCA;
| 29.38961 | 90 | 0.697746 |
2957c3c292034a2244bfc1d3b298ea3f7df1352c | 3,839 | adb | Ada | src/frontend/Experimental_Ada_ROSE_Connection/parser/asis_adapter/source/asis_adapter-element-defining_names.adb | LaudateCorpus1/rose-1 | 5fe906d2a01253130c5de465aded6a917a8476a0 | [
"BSD-3-Clause"
] | 488 | 2015-01-09T08:54:48.000Z | 2022-03-30T07:15:46.000Z | src/frontend/Experimental_Ada_ROSE_Connection/parser/asis_adapter/source/asis_adapter-element-defining_names.adb | LaudateCorpus1/rose-1 | 5fe906d2a01253130c5de465aded6a917a8476a0 | [
"BSD-3-Clause"
] | 174 | 2015-01-28T18:41:32.000Z | 2022-03-31T16:51:05.000Z | src/frontend/Experimental_Ada_ROSE_Connection/parser/asis_adapter/source/asis_adapter-element-defining_names.adb | LaudateCorpus1/rose-1 | 5fe906d2a01253130c5de465aded6a917a8476a0 | [
"BSD-3-Clause"
] | 146 | 2015-04-27T02:48:34.000Z | 2022-03-04T07:32:53.000Z | with Asis.Declarations;
with Asis.Elements;
package body Asis_Adapter.Element.Defining_Names is
------------
-- EXPORTED:
------------
procedure Do_Pre_Child_Processing
(Element : in Asis.Element; State : in out Class)
is
Parent_Name : constant String := Module_Name;
Module_Name : constant String := Parent_Name & ".Do_Pre_Child_Processing";
Result : a_nodes_h.Defining_Name_Struct :=
a_nodes_h.Support.Default_Defining_Name_Struct;
Defining_Name_Kind : Asis.Defining_Name_Kinds :=
Asis.Elements.Defining_Name_Kind (Element);
-- Supporting procedures are in alphabetical order:
procedure Add_Defining_Name_Image is
WS : constant Wide_String := Asis.Declarations.Defining_Name_Image (Element);
begin
State.Add_To_Dot_Label ("Defining_Name_Image", To_Quoted_String (WS));
Result.Defining_Name_Image := To_Chars_Ptr(WS);
end;
procedure Add_Defining_Prefix is
ID : constant a_nodes_h.Element_ID :=
Get_Element_ID (Asis.Declarations.Defining_Prefix (Element));
begin
State.Add_To_Dot_Label_And_Edge ("Defining_Prefix", ID);
Result.Defining_Prefix := ID;
end;
procedure Add_Defining_Selector is
ID : constant a_nodes_h.Element_ID :=
Get_Element_ID (Asis.Declarations.Defining_Selector (Element));
begin
State.Add_To_Dot_Label_And_Edge ("Defining_Selector", ID);
Result.Defining_Selector := ID;
end;
procedure Add_Position_Number_Image is
WS : constant Wide_String := Asis.Declarations.Position_Number_Image (Element);
begin
State.Add_To_Dot_Label ("Position_Number_Image", To_String (WS));
Result.Position_Number_Image := To_Chars_Ptr(WS);
end;
procedure Add_Representation_Value_Image is
WS : constant Wide_String := Asis.Declarations.Representation_Value_Image (Element);
begin
State.Add_To_Dot_Label ("Representation_Value_Image", To_String (WS));
Result.Representation_Value_Image := To_Chars_Ptr(WS);
end;
-- True if this is the name of a constant or a deferred constant.
-- TODO: Implement
function Is_Constant return Boolean is
(False);
procedure Add_Corresponding_Constant_Declaration is
ID : constant a_nodes_h.Element_ID :=
Get_Element_ID
(Asis.Declarations.Corresponding_Constant_Declaration (Element));
begin
State.Add_To_Dot_Label ("Corresponding_Constant_Declaration", To_String(ID));
Result.Corresponding_Constant_Declaration := ID;
end;
procedure Add_Common_Items is
begin
State.Add_To_Dot_Label
(Name => "Defining_Name_Kind", Value => Defining_Name_Kind'Image);
Result.Defining_Name_Kind :=
To_Defining_Name_Kinds (Defining_Name_Kind);
Add_Defining_Name_Image;
end Add_Common_Items;
use all type Asis.Defining_Name_Kinds;
begin
If Defining_Name_Kind /= Not_A_Defining_Name then
Add_Common_Items;
end if;
case Defining_Name_Kind is
when Not_A_Defining_Name =>
raise Program_Error with
Module_Name & " called with: " & Defining_Name_Kind'Image;
when A_Defining_Identifier =>
null; -- No more info
when A_Defining_Character_Literal |
A_Defining_Enumeration_Literal =>
Add_Position_Number_Image;
Add_Representation_Value_Image;
when A_Defining_Operator_Symbol =>
Result.Operator_Kind := Add_Operator_Kind (State, Element);
when A_Defining_Expanded_Name =>
Add_Defining_Prefix;
Add_Defining_Selector;
end case;
if Is_Constant then
Add_Corresponding_Constant_Declaration;
end if;
State.A_Element.Element_Kind := a_nodes_h.A_Defining_Name;
State.A_Element.The_Union.Defining_Name := Result;
end Do_Pre_Child_Processing;
end Asis_Adapter.Element.Defining_Names;
| 32.811966 | 90 | 0.724147 |
41f8e78e34c6b1a4cff581b9f1acad9a275e2393 | 18,886 | ads | Ada | source/amf/uml/amf-internals-uml_start_classifier_behavior_actions.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/uml/amf-internals-uml_start_classifier_behavior_actions.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/uml/amf-internals-uml_start_classifier_behavior_actions.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
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.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.Start_Classifier_Behavior_Actions;
with AMF.UML.String_Expressions;
with AMF.UML.Structured_Activity_Nodes;
with AMF.Visitors;
package AMF.Internals.UML_Start_Classifier_Behavior_Actions is
type UML_Start_Classifier_Behavior_Action_Proxy is
limited new AMF.Internals.UML_Named_Elements.UML_Named_Element_Proxy
and AMF.UML.Start_Classifier_Behavior_Actions.UML_Start_Classifier_Behavior_Action with null record;
overriding function Get_Object
(Self : not null access constant UML_Start_Classifier_Behavior_Action_Proxy)
return AMF.UML.Input_Pins.UML_Input_Pin_Access;
-- Getter of StartClassifierBehaviorAction::object.
--
-- Holds the object on which to start the owned behavior.
overriding procedure Set_Object
(Self : not null access UML_Start_Classifier_Behavior_Action_Proxy;
To : AMF.UML.Input_Pins.UML_Input_Pin_Access);
-- Setter of StartClassifierBehaviorAction::object.
--
-- Holds the object on which to start the owned behavior.
overriding function Get_Context
(Self : not null access constant UML_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_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_Start_Classifier_Behavior_Actions;
| 49.310705 | 107 | 0.701366 |
41ae83bb0576b61fdbc7e4c80aecee8284f631ff | 1,655 | ads | Ada | src/serial_console.ads | JeremyGrosser/synack_misc | 08f791aa6200c95767cce80a6e0998f00e19acfd | [
"BSD-3-Clause"
] | null | null | null | src/serial_console.ads | JeremyGrosser/synack_misc | 08f791aa6200c95767cce80a6e0998f00e19acfd | [
"BSD-3-Clause"
] | null | null | null | src/serial_console.ads | JeremyGrosser/synack_misc | 08f791aa6200c95767cce80a6e0998f00e19acfd | [
"BSD-3-Clause"
] | null | null | null | --
-- Copyright 2021 (C) Jeremy Grosser
--
-- SPDX-License-Identifier: BSD-3-Clause
--
with Chests.Ring_Buffers;
with HAL.UART;
package Serial_Console is
type Port
(UART : not null HAL.UART.Any_UART_Port)
is tagged private;
procedure Put
(This : in out Port;
Item : Character);
procedure Put
(This : in out Port;
Item : String);
procedure New_Line
(This : in out Port);
procedure Put_Line
(This : in out Port;
Item : String);
procedure Get
(This : in out Port;
Ch : out Character);
-- If the RX buffer is empty, Get will block
procedure Get_Nonblocking
(This : in out Port;
Ch : out Character);
-- If the receive buffer is empty, Get_Nonblocking will set Ch := ASCII.NUL
-- and return immediately
function Buffer_Size
(This : Port)
return Natural;
procedure Get
(This : in out Port;
Item : out String);
-- Get will block until Item'Length characters are received from the buffer
procedure Poll
(This : in out Port);
-- Poll should be called upon receiving a UART interrupt, it will read a
-- single byte into the buffer for Get.
--
-- Poll will block if no data is available from the UART
-- If the buffer is full, Poll will delete the oldest character in the buffer.
private
package Character_Buffers is new Chests.Ring_Buffers
(Capacity => 32,
Element_Type => Character);
type Port
(UART : not null HAL.UART.Any_UART_Port)
is tagged record
RX_Buffer : Character_Buffers.Ring_Buffer;
end record;
end Serial_Console;
| 23.309859 | 82 | 0.6429 |
57857887aaf219bb6cd15ddb038d3b036d1659d6 | 1,523 | ads | Ada | src/unbounded_sequential_stacks.ads | mgrojo/qt5ada | 66e8944e98c7671b43e81ef4e3d1979bceb47227 | [
"MIT"
] | 5 | 2020-09-25T15:41:33.000Z | 2022-03-24T18:22:06.000Z | src/unbounded_sequential_stacks.ads | mgrojo/qt5ada | 66e8944e98c7671b43e81ef4e3d1979bceb47227 | [
"MIT"
] | 2 | 2020-10-03T12:53:32.000Z | 2021-05-25T19:10:17.000Z | src/unbounded_sequential_stacks.ads | mgrojo/qt5ada | 66e8944e98c7671b43e81ef4e3d1979bceb47227 | [
"MIT"
] | 3 | 2020-10-03T11:49:34.000Z | 2021-12-04T13:25:02.000Z | --
-- This library is free software; you can redistribute it and/or modify
-- it under the terms of the GNU Library General Public License as
-- published by the Free Software Foundation; either version 3 of the
-- License; or (at your option) any later version.
-- This package provides stack abstractions that have a capacity limited only
-- by available memory. These stacks are not thread-safe.
generic
type Element is private;
package Unbounded_Sequential_Stacks is
type Stack is tagged limited private;
procedure Push (Onto : in out Stack; Item : in Element);
procedure Pop (From : in out Stack; Item : out Element);
procedure Pop (This : in out Stack);
-- Removes from This stack the last element added
procedure Clear (This : in out Stack);
-- Removes from This stack the all elements
Underflow : exception;
function Depth (This : Stack) return Natural;
function Empty (This : Stack) return Boolean;
type Reference is access all Element;
function Top (This : Stack) return Reference;
-- Provides access to the top element in the stack (the last element pushed)
-- without requiring that element to be first removed from the stack
private
type Node;
type List is access Node;
type Node is
record
Value : aliased Element;
Next : List;
end record;
type Stack is tagged limited
record
Head : List;
Count : Natural := 0;
end record;
end Unbounded_Sequential_Stacks;
| 26.258621 | 80 | 0.691399 |
0622217075f9a65aabdf592ede418974e2a8fc3d | 3,561 | adb | Ada | src/frontend/Experimental_Ada_ROSE_Connection/parser/asis_adapter/source/asis_adapter-context.adb | LaudateCorpus1/rose-1 | 5fe906d2a01253130c5de465aded6a917a8476a0 | [
"BSD-3-Clause"
] | 488 | 2015-01-09T08:54:48.000Z | 2022-03-30T07:15:46.000Z | src/frontend/Experimental_Ada_ROSE_Connection/parser/asis_adapter/source/asis_adapter-context.adb | LaudateCorpus1/rose-1 | 5fe906d2a01253130c5de465aded6a917a8476a0 | [
"BSD-3-Clause"
] | 174 | 2015-01-28T18:41:32.000Z | 2022-03-31T16:51:05.000Z | src/frontend/Experimental_Ada_ROSE_Connection/parser/asis_adapter/source/asis_adapter-context.adb | LaudateCorpus1/rose-1 | 5fe906d2a01253130c5de465aded6a917a8476a0 | [
"BSD-3-Clause"
] | 146 | 2015-04-27T02:48:34.000Z | 2022-03-04T07:32:53.000Z | with Asis.Ada_Environments;
with Asis.Compilation_Units;
with Asis.Exceptions;
with Asis.Errors;
with Asis.Implementation;
with GNAT.Directory_Operations;
with Asis_Adapter.Unit;
with a_nodes_h.Support;
package body Asis_Adapter.Context is
procedure Set_Context
(Asis_Context : in Asis.Context;
A_Nodes : in Standard.A_Nodes.Access_Class)
is
use Asis.Ada_Environments;
begin
A_Nodes.Set
(Context =>
(Name => To_Chars_Ptr (Name (Asis_Context)),
Parameters => To_Chars_Ptr (Parameters (Asis_Context)),
Debug_Image => To_Chars_Ptr (Debug_Image (Asis_Context))));
end Set_Context;
procedure Process_Units
(This : in out Class;
Options : in Unit.Options_Record;
Outputs : in Outputs_Record)
is
Parent_Name : constant String := Module_Name;
Module_Name : constant String := Parent_Name & ".Process_Units";
package Logging is new Generic_Logging (Module_Name); use Logging;
use Asis.Exceptions;
Units : Asis.Compilation_Unit_List :=
Asis.Compilation_Units.Compilation_Units (This.Asis_Context);
begin
for Unit of Units loop
declare
Tool_Unit : Asis_Adapter.Unit.Class;
begin
Tool_Unit.Process (Unit, Options, Outputs);
end;
end loop;
exception
when Ex : ASIS_Inappropriate_Context |
ASIS_Inappropriate_Container |
ASIS_Inappropriate_Compilation_Unit |
ASIS_Inappropriate_Element |
ASIS_Inappropriate_Line |
ASIS_Inappropriate_Line_Number |
ASIS_Failed =>
Log ("Caught ASIS exception: " & AEX.Exception_Name (Ex));
Log ("ASIS Error Status: " &
Asis.Errors.Error_Kinds'Image (Asis.Implementation.Status));
Log ("ASIS Diagnosis: " & To_String (Asis.Implementation.Diagnosis));
Log ("Reraising");
raise;
end Process_Units;
------------
-- EXPORTED:
------------
procedure Process
(This : in out Class;
Tree_File_Name : in String;
Unit_Options : in Unit.Options_Record;
Outputs : in Outputs_Record)
is
Parent_Name : constant String := Module_Name;
Module_Name : constant String := Parent_Name & ".Process";
package Logging is new Generic_Logging (Module_Name); use Logging;
procedure Begin_Environment is begin
Asis.Ada_Environments.Associate
(The_Context => This.Asis_Context,
Name => To_Wide_String (Tree_File_Name),
Parameters => To_Wide_String ("-C1 " & Tree_File_Name));
Asis.Ada_Environments.Open (This.Asis_Context);
Trace_Put_Line ("Context info: " & Asis.Ada_Environments.Debug_Image
(This.Asis_Context));
end;
procedure End_Environment is begin
Asis.Ada_Environments.Close (This.Asis_Context);
Asis.Ada_Environments.Dissociate (This.Asis_Context);
end;
begin
Log ("BEGIN");
Log ("Tree_File_Name => """ & Tree_File_Name & """");
Begin_Environment;
-- Call Begin_Environment first:
Outputs.Graph.Set_ID
("""" & To_String (Asis.Ada_Environments.Name (This.Asis_Context)) & """");
Set_Context (This.Asis_Context, Outputs.A_Nodes);
Process_Units (This, Unit_Options, Outputs);
End_Environment;
Log ("END");
end Process;
end Asis_Adapter.Context;
| 35.61 | 83 | 0.624824 |
41d9b67571e713d7271c53083704f754f023d0de | 3,374 | ads | Ada | source/s-finmas.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 33 | 2015-04-04T09:19:36.000Z | 2021-11-10T05:33:34.000Z | source/s-finmas.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 8 | 2017-11-14T13:05:07.000Z | 2018-08-09T15:28:49.000Z | source/s-finmas.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 9 | 2015-02-03T17:09:53.000Z | 2021-11-12T01:16:05.000Z | pragma License (Unrestricted);
-- implementation unit required by compiler
with Ada.Finalization;
with System.Storage_Elements;
with System.Storage_Pools;
private with System.Storage_Barriers;
package System.Finalization_Masters is
pragma Preelaborate;
type Finalize_Address_Ptr is access procedure (Obj : Address);
type FM_Node is private;
type FM_Node_Ptr is access all FM_Node;
Header_Size : constant Storage_Elements.Storage_Offset;
subtype Any_Storage_Pool_Ptr is Storage_Pools.Storage_Pool_Access;
pragma Suppress (Access_Check, Any_Storage_Pool_Ptr);
type Finalization_Master is
limited new Ada.Finalization.Limited_Controlled with private;
procedure Attach_Unprotected (N, L : not null FM_Node_Ptr);
procedure Detach_Unprotected (N : not null FM_Node_Ptr);
function Objects_Unprotected (
Master : aliased in out Finalization_Master'Class;
Fin_Addr_Ptr : Finalize_Address_Ptr)
return FM_Node_Ptr;
function Finalization_Started (Master : Finalization_Master'Class)
return Boolean;
pragma Inline (Finalization_Started);
procedure Set_Finalize_Address_Unprotected (
Master : in out Finalization_Master'Class;
Fin_Addr_Ptr : Finalize_Address_Ptr);
-- required by compiler (s-finmas.ads)
procedure Set_Finalize_Address (
Master : in out Finalization_Master'Class;
Fin_Addr_Ptr : Finalize_Address_Ptr);
-- required by compiler (s-finmas.ads)
procedure Set_Is_Heterogeneous (
Master : in out Finalization_Master'Class) is null;
pragma Inline (Set_Is_Heterogeneous);
-- [gcc-7] can not skip calling null procedure
-- required by compiler (s-finmas.ads)
type Finalization_Master_Ptr is access all Finalization_Master;
for Finalization_Master_Ptr'Storage_Size use 0;
private
use type Storage_Elements.Storage_Offset;
type FM_Node is record
Prev : FM_Node_Ptr;
Next : FM_Node_Ptr;
end record;
pragma Suppress_Initialization (FM_Node);
Header_Size : constant Storage_Elements.Storage_Offset :=
FM_Node'Size / Standard'Storage_Unit;
type FM_List;
type FM_List_Access is access all FM_List;
type FM_List is limited record
Objects : aliased FM_Node;
Finalize_Address : Finalize_Address_Ptr;
Next : FM_List_Access;
end record;
pragma Suppress_Initialization (FM_List);
type Finalization_Master is
limited new Ada.Finalization.Limited_Controlled with
record
List : aliased FM_List;
Base_Pool : Any_Storage_Pool_Ptr := null;
Finalization_Started : aliased Storage_Barriers.Flag;
end record;
overriding procedure Initialize (Object : in out Finalization_Master);
overriding procedure Finalize (Object : in out Finalization_Master);
-- reraise some exception propagated from its own objects
-- required by compiler (s-finmas.ads)
function Base_Pool (Master : Finalization_Master'Class)
return Any_Storage_Pool_Ptr;
procedure Set_Base_Pool (
Master : in out Finalization_Master'Class;
Pool_Ptr : Any_Storage_Pool_Ptr);
pragma Inline (Base_Pool);
-- required by compiler (s-finmas.ads)
function Add_Offset_To_Address (
Addr : Address;
Offset : Storage_Elements.Storage_Offset)
return Address
renames Storage_Elements."+";
end System.Finalization_Masters;
| 32.133333 | 73 | 0.748666 |
299cbff19c8f28b7b22bd3b51a2c227778f18c1d | 4,455 | ads | Ada | src/arch/cores/armv7-m/m4-systick.ads | mfkiwl/ewok-kernel-security-OS | ca8e2a0b5cedbc94df957be1fac6d7d4b2ceb687 | [
"Apache-2.0"
] | 65 | 2018-09-26T09:10:11.000Z | 2022-01-30T21:17:37.000Z | src/arch/cores/armv7-m/m4-systick.ads | mfkiwl/ewok-kernel-security-OS | ca8e2a0b5cedbc94df957be1fac6d7d4b2ceb687 | [
"Apache-2.0"
] | 22 | 2019-04-07T15:15:54.000Z | 2020-10-15T12:45:54.000Z | src/arch/cores/armv7-m/m4-systick.ads | mfkiwl/ewok-kernel-security-OS | ca8e2a0b5cedbc94df957be1fac6d7d4b2ceb687 | [
"Apache-2.0"
] | 10 | 2018-09-27T09:43:08.000Z | 2021-01-29T22:50:17.000Z | --
-- Copyright 2018 The wookey project team <[email protected]>
-- - Ryad Benadjila
-- - Arnauld Michelizza
-- - Mathieu Renard
-- - Philippe Thierry
-- - Philippe Trebuchet
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
--
--
with m4.layout;
package m4.systick
with spark_mode => on
is
-- FIXME - Should be defined in arch/boards
MAIN_CLOCK_FREQUENCY : constant := 168_000_000;
TICKS_PER_SECOND : constant := 1000;
subtype t_tick is unsigned_64;
----------------------------------------------------
-- SysTick control and status register (STK_CTRL) --
----------------------------------------------------
type t_clock_type is
(EXT_CLOCK, PROCESSOR_CLOCK)
with size => 1;
for t_clock_type use
(EXT_CLOCK => 0, PROCESSOR_CLOCK => 1);
type t_STK_CTRL is record
ENABLE : boolean; -- Enables the counter
TICKINT : boolean; -- Enables exception request
CLKSOURCE : t_clock_type;
COUNTFLAG : bit;
end record
with size => 32, volatile_full_access;
for t_STK_CTRL use record
ENABLE at 0 range 0 .. 0;
TICKINT at 0 range 1 .. 1;
CLKSOURCE at 0 range 2 .. 2;
COUNTFLAG at 0 range 16 .. 16;
end record;
----------------------------------------------
-- SysTick reload value register (STK_LOAD) --
----------------------------------------------
-- Note: To generate a timer with a period of N processor clock
-- cycles, use a RELOAD value of N-1.
type t_STK_LOAD is record
RELOAD : bits_24;
end record
with size => 32, volatile_full_access;
----------------------------------------------
-- SysTick current value register (STK_VAL) --
----------------------------------------------
type t_STK_VAL is record
CURRENT : bits_24;
end record
with size => 32, volatile_full_access;
----------------------------------------------------
-- SysTick calibration value register (STK_CALIB) --
----------------------------------------------------
type t_STK_CALIB is record
TENMS : bits_24;
SKEW : bit;
NOREF : bit;
end record
with size => 32, volatile_full_access;
for t_STK_CALIB use record
TENMS at 0 range 0 .. 23;
SKEW at 0 range 30 .. 30;
NOREF at 0 range 31 .. 31;
end record;
----------------
-- Peripheral --
----------------
type t_SYSTICK_peripheral is record
CTRL : t_STK_CTRL;
LOAD : t_STK_LOAD;
VAL : t_STK_VAL;
CALIB : t_STK_CALIB;
end record
with volatile;
for t_SYSTICK_peripheral use record
CTRL at 16#00# range 0 .. 31;
LOAD at 16#04# range 0 .. 31;
VAL at 16#08# range 0 .. 31;
CALIB at 16#0C# range 0 .. 31;
end record;
SYSTICK : t_SYSTICK_peripheral
with
import,
volatile,
address => m4.layout.SYS_TIMER_base;
---------------
-- Functions --
---------------
-- Initialize the systick module
procedure init;
-- Get the number of milliseconds elapsed since booting
function get_ticks return unsigned_64
with
volatile_function;
function get_milliseconds return milliseconds
with
volatile_function;
function get_microseconds return microseconds
with
volatile_function;
function to_ticks (ms : milliseconds) return t_tick
with inline_always;
function to_milliseconds (t : t_tick) return milliseconds
with inline_always;
function to_microseconds (t : t_tick) return microseconds
with inline_always;
-- Note: default Systick IRQ handler is defined in package
-- ewok.interrupts.handler and call 'increment' procedure
procedure increment
with inline_always;
private
ticks : t_tick := 0
with volatile, async_writers;
end m4.systick;
| 27 | 79 | 0.574635 |
5767c8c3b1d5eb7feb2d13a13f7d52c9b7f00c17 | 15,000 | adb | Ada | awa/plugins/awa-questions/src/awa-questions-beans.adb | Letractively/ada-awa | 3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe | [
"Apache-2.0"
] | null | null | null | awa/plugins/awa-questions/src/awa-questions-beans.adb | Letractively/ada-awa | 3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe | [
"Apache-2.0"
] | null | null | null | awa/plugins/awa-questions/src/awa-questions-beans.adb | Letractively/ada-awa | 3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- awa-questions-beans -- Beans for module questions
-- Copyright (C) 2012, 2013 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with ADO.Queries;
with ADO.Utils;
with ADO.Sessions;
with ADO.Sessions.Entities;
with Util.Beans.Lists.Strings;
with AWA.Tags.Modules;
with AWA.Services.Contexts;
package body AWA.Questions.Beans is
package ASC renames AWA.Services.Contexts;
-- ------------------------------
-- Get the value identified by the name.
-- ------------------------------
overriding
function Get_Value (From : in Question_Bean;
Name : in String) return Util.Beans.Objects.Object is
begin
if Name = "tags" then
return Util.Beans.Objects.To_Object (From.Tags_Bean, Util.Beans.Objects.STATIC);
elsif From.Is_Null then
return Util.Beans.Objects.Null_Object;
else
return AWA.Questions.Models.Question_Bean (From).Get_Value (Name);
end if;
end Get_Value;
-- ------------------------------
-- Set the value identified by the name.
-- ------------------------------
overriding
procedure Set_Value (From : in out Question_Bean;
Name : in String;
Value : in Util.Beans.Objects.Object) is
begin
if Name = "title" then
From.Set_Title (Util.Beans.Objects.To_String (Value));
elsif Name = "description" then
From.Set_Description (Util.Beans.Objects.To_String (Value));
elsif Name = "id" and not Util.Beans.Objects.Is_Empty (Value) then
declare
Ctx : constant ASC.Service_Context_Access := AWA.Services.Contexts.Current;
DB : constant ADO.Sessions.Session := AWA.Services.Contexts.Get_Session (Ctx);
Id : constant ADO.Identifier := ADO.Utils.To_Identifier (Value);
begin
From.Service.Load_Question (From, Id);
From.Tags.Load_Tags (DB, Id);
end;
end if;
end Set_Value;
-- ------------------------------
-- Create or save the question.
-- ------------------------------
procedure Save (Bean : in out Question_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is
pragma Unreferenced (Outcome);
begin
Bean.Service.Save_Question (Bean);
Bean.Tags.Update_Tags (Bean.Get_Id);
end Save;
-- ------------------------------
-- Delete the question.
-- ------------------------------
procedure Delete (Bean : in out Question_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is
pragma Unreferenced (Outcome);
begin
Bean.Service.Delete_Question (Bean);
end Delete;
-- ------------------------------
-- Create the Question_Bean bean instance.
-- ------------------------------
function Create_Question_Bean (Module : in AWA.Questions.Modules.Question_Module_Access)
return Util.Beans.Basic.Readonly_Bean_Access is
Object : constant Question_Bean_Access := new Question_Bean;
begin
Object.Service := Module;
Object.Tags_Bean := Object.Tags'Access;
Object.Tags.Set_Entity_Type (AWA.Questions.Models.QUESTION_TABLE);
Object.Tags.Set_Permission ("question-edit");
return Object.all'Access;
end Create_Question_Bean;
-- Get the value identified by the name.
overriding
function Get_Value (From : in Answer_Bean;
Name : in String) return Util.Beans.Objects.Object is
begin
if Name = "question_id" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Question.Get_Id));
elsif From.Is_Null then
return Util.Beans.Objects.Null_Object;
else
return AWA.Questions.Models.Answer_Bean (From).Get_Value (Name);
end if;
end Get_Value;
-- ------------------------------
-- Set the value identified by the name.
-- ------------------------------
overriding
procedure Set_Value (From : in out Answer_Bean;
Name : in String;
Value : in Util.Beans.Objects.Object) is
begin
if Name = "id" and not Util.Beans.Objects.Is_Empty (Value) then
From.Service.Load_Answer (From, From.Question,
ADO.Utils.To_Identifier (Value));
elsif Name = "answer" then
From.Set_Answer (Util.Beans.Objects.To_String (Value));
elsif Name = "question_id" and not Util.Beans.Objects.Is_Null (Value) then
From.Service.Load_Question (From.Question,
ADO.Utils.To_Identifier (Value));
end if;
end Set_Value;
-- ------------------------------
-- Create or save the answer.
-- ------------------------------
procedure Save (Bean : in out Answer_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is
pragma Unreferenced (Outcome);
begin
Bean.Service.Save_Answer (Question => Bean.Question,
Answer => Bean);
end Save;
-- ------------------------------
-- Delete the question.
-- ------------------------------
procedure Delete (Bean : in out Answer_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is
pragma Unreferenced (Outcome);
begin
Bean.Service.Delete_Answer (Answer => Bean);
end Delete;
-- ------------------------------
-- Create the answer bean instance.
-- ------------------------------
function Create_Answer_Bean (Module : in AWA.Questions.Modules.Question_Module_Access)
return Util.Beans.Basic.Readonly_Bean_Access is
Object : constant Answer_Bean_Access := new Answer_Bean;
begin
Object.Service := Module;
return Object.all'Access;
end Create_Answer_Bean;
-- ------------------------------
-- Get the value identified by the name.
-- ------------------------------
overriding
function Get_Value (From : in Question_List_Bean;
Name : in String) return Util.Beans.Objects.Object is
Pos : Natural;
begin
if Name = "tags" then
Pos := From.Questions.Get_Row_Index;
if Pos = 0 then
return Util.Beans.Objects.Null_Object;
end if;
declare
Item : constant Models.Question_Info := From.Questions.List.Element (Pos - 1);
begin
return From.Tags.Get_Tags (Item.Id);
end;
elsif Name = "questions" then
return Util.Beans.Objects.To_Object (Value => From.Questions_Bean,
Storage => Util.Beans.Objects.STATIC);
elsif Name = "tag" then
return Util.Beans.Objects.To_Object (From.Tag);
else
return From.Questions.Get_Value (Name);
end if;
end Get_Value;
-- ------------------------------
-- Set the value identified by the name.
-- ------------------------------
overriding
procedure Set_Value (From : in out Question_List_Bean;
Name : in String;
Value : in Util.Beans.Objects.Object) is
begin
if Name = "tag" then
From.Tag := Util.Beans.Objects.To_Unbounded_String (Value);
From.Load_List;
end if;
end Set_Value;
-- ------------------------------
-- Load the list of question. If a tag was set, filter the list of questions with the tag.
-- ------------------------------
procedure Load_List (Into : in out Question_List_Bean) is
use AWA.Questions.Models;
use AWA.Services;
use type ADO.Identifier;
Session : ADO.Sessions.Session := Into.Service.Get_Session;
Query : ADO.Queries.Context;
Tag_Id : ADO.Identifier;
begin
AWA.Tags.Modules.Find_Tag_Id (Session, Ada.Strings.Unbounded.To_String (Into.Tag), Tag_Id);
if Tag_Id /= ADO.NO_IDENTIFIER then
Query.Set_Query (AWA.Questions.Models.Query_Question_Tag_List);
Query.Bind_Param (Name => "tag", Value => Tag_Id);
else
Query.Set_Query (AWA.Questions.Models.Query_Question_List);
end if;
ADO.Sessions.Entities.Bind_Param (Params => Query,
Name => "entity_type",
Table => AWA.Questions.Models.QUESTION_TABLE,
Session => Session);
AWA.Questions.Models.List (Into.Questions, Session, Query);
declare
List : ADO.Utils.Identifier_Vector;
Iter : Question_Info_Vectors.Cursor := Into.Questions.List.First;
begin
while Question_Info_Vectors.Has_Element (Iter) loop
List.Append (Question_Info_Vectors.Element (Iter).Id);
Question_Info_Vectors.Next (Iter);
end loop;
Into.Tags.Load_Tags (Session, AWA.Questions.Models.QUESTION_TABLE.Table.all,
List);
end;
end Load_List;
-- ------------------------------
-- Create the Question_Info_List_Bean bean instance.
-- ------------------------------
function Create_Question_List_Bean (Module : in AWA.Questions.Modules.Question_Module_Access)
return Util.Beans.Basic.Readonly_Bean_Access is
use AWA.Questions.Models;
use AWA.Services;
Object : constant Question_List_Bean_Access := new Question_List_Bean;
-- Session : ADO.Sessions.Session := Module.Get_Session;
-- Query : ADO.Queries.Context;
begin
Object.Service := Module;
Object.Questions_Bean := Object.Questions'Unchecked_Access;
-- Query.Set_Query (AWA.Questions.Models.Query_Question_List);
-- ADO.Sessions.Entities.Bind_Param (Params => Query,
-- Name => "entity_type",
-- Table => AWA.Questions.Models.QUESTION_TABLE,
-- Session => Session);
-- AWA.Questions.Models.List (Object.Questions, Session, Query);
Object.Load_List;
return Object.all'Access;
end Create_Question_List_Bean;
-- ------------------------------
-- Get the value identified by the name.
-- ------------------------------
overriding
function Get_Value (From : in Question_Display_Bean;
Name : in String) return Util.Beans.Objects.Object is
begin
if Name = "answers" then
return Util.Beans.Objects.To_Object (Value => From.Answer_List_Bean,
Storage => Util.Beans.Objects.STATIC);
elsif Name = "question" then
return Util.Beans.Objects.To_Object (Value => From.Question_Bean,
Storage => Util.Beans.Objects.STATIC);
elsif Name = "tags" then
return Util.Beans.Objects.To_Object (Value => From.Tags_Bean,
Storage => Util.Beans.Objects.STATIC);
else
return Util.Beans.Objects.Null_Object;
end if;
end Get_Value;
-- ------------------------------
-- Set the value identified by the name.
-- ------------------------------
overriding
procedure Set_Value (From : in out Question_Display_Bean;
Name : in String;
Value : in Util.Beans.Objects.Object) is
begin
if Name = "id" and not Util.Beans.Objects.Is_Empty (Value) then
declare
package ASC renames AWA.Services.Contexts;
use AWA.Questions.Models;
use AWA.Services;
Session : ADO.Sessions.Session := From.Service.Get_Session;
Query : ADO.Queries.Context;
List : AWA.Questions.Models.Question_Display_Info_List_Bean;
Ctx : constant ASC.Service_Context_Access := ASC.Current;
Id : constant ADO.Identifier := ADO.Utils.To_Identifier (Value);
begin
Query.Set_Query (AWA.Questions.Models.Query_Question_Info);
Query.Bind_Param ("question_id", Id);
Query.Bind_Param ("user_id", Ctx.Get_User_Identifier);
ADO.Sessions.Entities.Bind_Param (Params => Query,
Name => "entity_type",
Table => AWA.Questions.Models.QUESTION_TABLE,
Session => Session);
AWA.Questions.Models.List (List, Session, Query);
if not List.List.Is_Empty then
From.Question := List.List.Element (0);
end if;
Query.Clear;
Query.Bind_Param ("question_id", Util.Beans.Objects.To_Integer (Value));
Query.Bind_Param ("user_id", Ctx.Get_User_Identifier);
ADO.Sessions.Entities.Bind_Param (Params => Query,
Name => "entity_type",
Table => AWA.Questions.Models.ANSWER_TABLE,
Session => Session);
Query.Set_Query (AWA.Questions.Models.Query_Answer_List);
AWA.Questions.Models.List (From.Answer_List, Session, Query);
-- Load the tags if any.
From.Tags.Load_Tags (Session, Id);
end;
end if;
end Set_Value;
-- ------------------------------
-- Create the Question_Display_Bean bean instance.
-- ------------------------------
function Create_Question_Display_Bean (Module : in AWA.Questions.Modules.Question_Module_Access)
return Util.Beans.Basic.Readonly_Bean_Access is
Object : constant Question_Display_Bean_Access := new Question_Display_Bean;
begin
Object.Service := Module;
Object.Question_Bean := Object.Question'Access;
Object.Answer_List_Bean := Object.Answer_List'Access;
Object.Tags_Bean := Object.Tags'Access;
Object.Tags.Set_Entity_Type (AWA.Questions.Models.QUESTION_TABLE);
return Object.all'Access;
end Create_Question_Display_Bean;
end AWA.Questions.Beans;
| 40.871935 | 99 | 0.557333 |
a1a97ad750bb30deb820f235d211181aeaf2c474 | 759 | ads | Ada | Read Only/gdb-6.8/gdb/testsuite/gdb.ada/fun_in_declare/pck.ads | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | Read Only/gdb-6.8/gdb/testsuite/gdb.ada/fun_in_declare/pck.ads | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | Read Only/gdb-6.8/gdb/testsuite/gdb.ada/fun_in_declare/pck.ads | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | -- Copyright 2008 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package Pck is
procedure Do_Nothing;
end Pck;
| 39.947368 | 73 | 0.73913 |
12fce7f836a1cb249de3ab6fd61df0a408e197c4 | 4,362 | adb | Ada | boards/stm32_common/stm32f746disco/stm32-board.adb | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 192 | 2016-06-01T18:32:04.000Z | 2022-03-26T22:52:31.000Z | boards/stm32_common/stm32f746disco/stm32-board.adb | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 239 | 2016-05-26T20:02:01.000Z | 2022-03-31T09:46:56.000Z | boards/stm32_common/stm32f746disco/stm32-board.adb | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 142 | 2016-06-05T08:12:20.000Z | 2022-03-24T17:37:17.000Z | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2015, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
package body STM32.Board is
------------------
-- All_LEDs_Off --
------------------
procedure All_LEDs_Off is
begin
Clear (All_LEDs);
end All_LEDs_Off;
-----------------
-- All_LEDs_On --
-----------------
procedure All_LEDs_On is
begin
Set (All_LEDs);
end All_LEDs_On;
---------------------
-- Initialize_LEDs --
---------------------
procedure Initialize_LEDs is
begin
Enable_Clock (All_LEDs);
Configure_IO (All_LEDs,
(Mode => Mode_Out,
Output_Type => Push_Pull,
Speed => Speed_100MHz,
Resistors => Floating));
end Initialize_LEDs;
-------------------------
-- Initialize_I2C_GPIO --
-------------------------
procedure Initialize_I2C_GPIO (Port : in out I2C_Port)
is
Id : constant I2C_Port_Id := As_Port_Id (Port);
Points : constant GPIO_Points (1 .. 2) :=
(if Id = I2C_Id_1 then (PB8, PB9)
elsif Id = I2C_Id_3 then (PH7, PH8)
else (PA0, PA0));
begin
if Id = I2C_Id_2 or else Id = I2C_Id_4 then
raise Unknown_Device with
"This I2C_Port cannot be used on this board";
end if;
Enable_Clock (Points);
Configure_IO (Points,
(Mode => Mode_AF,
AF => GPIO_AF_I2C2_4,
AF_Speed => Speed_25MHz,
AF_Output_Type => Open_Drain,
Resistors => Floating));
Lock (Points);
end Initialize_I2C_GPIO;
--------------------------------
-- Configure_User_Button_GPIO --
--------------------------------
procedure Configure_User_Button_GPIO is
begin
Enable_Clock (User_Button_Point);
Configure_IO (User_Button_Point, (Mode_In, Resistors => Floating));
end Configure_User_Button_GPIO;
end STM32.Board;
| 40.766355 | 78 | 0.492205 |
1d9945c7961e9eb94bd5d48bc27036f5d2089dcc | 1,939 | ads | Ada | orka/src/gl/interface/gl-types-pointers.ads | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 52 | 2016-07-30T23:00:28.000Z | 2022-02-05T11:54:55.000Z | orka/src/gl/interface/gl-types-pointers.ads | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 79 | 2016-08-01T18:36:48.000Z | 2022-02-27T12:14:20.000Z | orka/src/gl/interface/gl-types-pointers.ads | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 4 | 2018-04-28T22:36:26.000Z | 2020-11-14T23:00:29.000Z | -- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2014 Felix Krause <[email protected]>
-- Copyright (c) 2016 onox <[email protected]>
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
with Interfaces.C.Pointers;
package GL.Types.Pointers is
pragma Preelaborate;
-- Pointer types (for use with data transfer functions)
package Byte_Pointers is new Interfaces.C.Pointers
(Size, Byte, Byte_Array, Byte'Last);
package Short_Pointers is new Interfaces.C.Pointers
(Size, Short, Short_Array, Short'Last);
package Int_Pointers is new Interfaces.C.Pointers
(Size, Int, Int_Array, Int'Last);
package UByte_Pointers is new Interfaces.C.Pointers
(Size, UByte, UByte_Array, UByte'Last);
package UShort_Pointers is new Interfaces.C.Pointers
(Size, UShort, UShort_Array, UShort'Last);
package UInt_Pointers is new Interfaces.C.Pointers
(Size, UInt, UInt_Array, UInt'Last);
package Half_Pointers is new Interfaces.C.Pointers
(Size, Half, Half_Array, 0);
package Single_Pointers is new Interfaces.C.Pointers
(Size, Single, Single_Array, 0.0);
package Double_Pointers is new Interfaces.C.Pointers
(Size, Double, Double_Array, 0.0);
type String_Access is not null access constant String;
type String_Array is array (Positive range <>) of String_Access;
type UByte_Array_Access is access UByte_Array;
end GL.Types.Pointers;
| 32.864407 | 76 | 0.731305 |
597538e27d6f973a08087fa1af0da300c648fd54 | 477 | ads | Ada | src/gl/interface/gl-raster.ads | Roldak/OpenGLAda | 6807605b7321249d71286fa25231bdfd537d3eac | [
"MIT"
] | 79 | 2015-04-20T23:10:02.000Z | 2022-03-04T13:50:56.000Z | src/gl/interface/gl-raster.ads | Roldak/OpenGLAda | 6807605b7321249d71286fa25231bdfd537d3eac | [
"MIT"
] | 126 | 2015-09-10T10:41:34.000Z | 2022-03-20T11:25:40.000Z | src/gl/interface/gl-raster.ads | Roldak/OpenGLAda | 6807605b7321249d71286fa25231bdfd537d3eac | [
"MIT"
] | 20 | 2015-03-17T07:15:57.000Z | 2022-02-02T17:12:11.000Z | -- part of OpenGLAda, (c) 2017 Felix Krause
-- released under the terms of the MIT license, see the file "COPYING"
with GL.Types;
package GL.Raster is
-- Obsolete as of OpenGL 3. Supplied here to support some older 3rd party
-- functionality like Bitmap and Pixmap fonts of FTGL
use GL.Types;
use GL.Types.Doubles;
procedure Set_Pos (Position : Vector2);
procedure Set_Pos (Position : Vector3);
procedure Set_Pos (Position : Vector4);
end GL.Raster;
| 28.058824 | 76 | 0.719078 |
127bcede8b7e9e5a725f9cc86c24ccd70972f7e5 | 2,176 | ads | Ada | ada/core/demo/animal.ads | charlesdaniels/libagar | 099ce716e2ca01a7904b23f22610bf589295f5b5 | [
"BSD-2-Clause"
] | 286 | 2017-07-31T20:05:16.000Z | 2022-03-26T20:26:24.000Z | ada/core/demo/animal.ads | kalatestimine/libagar | f830265ad00a82d4cddd8b59943bd3887ebb1486 | [
"BSD-2-Clause"
] | 67 | 2017-08-30T18:56:21.000Z | 2021-09-08T03:38:20.000Z | ada/core/demo/animal.ads | kalatestimine/libagar | f830265ad00a82d4cddd8b59943bd3887ebb1486 | [
"BSD-2-Clause"
] | 31 | 2017-08-14T13:34:12.000Z | 2022-03-14T15:33:49.000Z | with Agar;
with Agar.Object;
with Agar.Data_Source;
with System.Address_To_Access_Conversions;
with Interfaces.C;
--
-- Example of an Agar object class called "Animal".
--
package Animal is
package OBJ renames Agar.Object;
package DS renames Agar.Data_Source;
package C renames Interfaces.C;
use type C.int;
use type C.C_float;
use type C.double;
Success : constant C.int := 0;
Error : constant C.int := -1;
-----------------------
-- Class Description --
-----------------------
type Ecological_Group_t is
(Undefined, Carnivore, Herbivore, Omnivore, Detritivore, Parasite);
type Animal_Class is limited record
Class : OBJ.Class; -- Agar(Object) -> Animal
-- more fields --
Ecological_Group : Ecological_Group_t;
Description : String (1 .. 200);
end record
with Convention => C;
type Animal_Class_Access is access all Animal_Class
with Convention => C;
---------------------
-- Object Instance --
---------------------
type Animal is limited record
Object : OBJ.Object; -- Agar(Object) -> Animal
-- more fields --
Age : Interfaces.Unsigned_8;
Exp : Interfaces.Unsigned_16;
Name : String (1 .. 20);
Bio : String (1 .. 100);
X : C.double;
Y : C.double;
Z : C.double;
end record
with Convention => C;
type Animal_Access is access all Animal with Convention => C;
package C_cls is new System.Address_To_Access_Conversions (Animal_Class);
Generic_Object_Class : OBJ.Class_Access := null;
Animal_Object_Class : C_cls.Object_Pointer := null;
function Create_Class return OBJ.Class_Not_Null_Access;
procedure Destroy_Class;
procedure Init (Object : OBJ.Object_Access) with Convention => C;
procedure Destroy (Object : OBJ.Object_Access) with Convention => C;
function Load
(Object : OBJ.Object_Access;
Source : DS.Data_Source_Access;
Version : OBJ.Version_Access) return C.int with Convention => C;
function Save
(Object : OBJ.Object_Access;
Dest : DS.Data_Source_Access) return C.int with Convention => C;
end Animal;
| 27.544304 | 75 | 0.636489 |
299136fab21c0872c28f4490ab1b91aac9c1e9a6 | 358 | ads | Ada | src/player.ads | thomas070605/shoot-n-loot | e242d71e9fe94271fe7fd79573ab06d231564350 | [
"MIT"
] | null | null | null | src/player.ads | thomas070605/shoot-n-loot | e242d71e9fe94271fe7fd79573ab06d231564350 | [
"MIT"
] | null | null | null | src/player.ads | thomas070605/shoot-n-loot | e242d71e9fe94271fe7fd79573ab06d231564350 | [
"MIT"
] | null | null | null | -- Shoot'n'loot
-- Copyright (c) 2020 Fabien Chouteau
with GESTE;
package Player is
procedure Spawn;
procedure Move (Pt : GESTE.Pix_Point);
function Position return GESTE.Pix_Point;
function Is_Alive return Boolean;
procedure Update;
procedure Jump;
procedure Fire;
procedure Move_Left;
procedure Move_Right;
end Player;
| 15.565217 | 44 | 0.717877 |
41f70b88c2bd5e06cd6d32c4480cceb28a034808 | 5,779 | ads | Ada | arch/ARM/STM32/svd/stm32l4x2/stm32_svd-firewall.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 2 | 2018-05-16T03:56:39.000Z | 2019-07-31T13:53:56.000Z | arch/ARM/STM32/svd/stm32l4x2/stm32_svd-firewall.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | arch/ARM/STM32/svd/stm32l4x2/stm32_svd-firewall.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | -- This spec has been automatically generated from STM32L4x2.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.Firewall is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype CSSA_ADD_Field is HAL.UInt16;
-- Code segment start address
type CSSA_Register is record
-- unspecified
Reserved_0_7 : HAL.UInt8 := 16#0#;
-- code segment start address
ADD : CSSA_ADD_Field := 16#0#;
-- unspecified
Reserved_24_31 : HAL.UInt8 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CSSA_Register use record
Reserved_0_7 at 0 range 0 .. 7;
ADD at 0 range 8 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
subtype CSL_LENG_Field is HAL.UInt14;
-- Code segment length
type CSL_Register is record
-- unspecified
Reserved_0_7 : HAL.UInt8 := 16#0#;
-- code segment length
LENG : CSL_LENG_Field := 16#0#;
-- unspecified
Reserved_22_31 : HAL.UInt10 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CSL_Register use record
Reserved_0_7 at 0 range 0 .. 7;
LENG at 0 range 8 .. 21;
Reserved_22_31 at 0 range 22 .. 31;
end record;
subtype NVDSSA_ADD_Field is HAL.UInt16;
-- Non-volatile data segment start address
type NVDSSA_Register is record
-- unspecified
Reserved_0_7 : HAL.UInt8 := 16#0#;
-- Non-volatile data segment start address
ADD : NVDSSA_ADD_Field := 16#0#;
-- unspecified
Reserved_24_31 : HAL.UInt8 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for NVDSSA_Register use record
Reserved_0_7 at 0 range 0 .. 7;
ADD at 0 range 8 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
subtype NVDSL_LENG_Field is HAL.UInt14;
-- Non-volatile data segment length
type NVDSL_Register is record
-- unspecified
Reserved_0_7 : HAL.UInt8 := 16#0#;
-- Non-volatile data segment length
LENG : NVDSL_LENG_Field := 16#0#;
-- unspecified
Reserved_22_31 : HAL.UInt10 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for NVDSL_Register use record
Reserved_0_7 at 0 range 0 .. 7;
LENG at 0 range 8 .. 21;
Reserved_22_31 at 0 range 22 .. 31;
end record;
subtype VDSSA_ADD_Field is HAL.UInt10;
-- Volatile data segment start address
type VDSSA_Register is record
-- unspecified
Reserved_0_5 : HAL.UInt6 := 16#0#;
-- Volatile data segment start address
ADD : VDSSA_ADD_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for VDSSA_Register use record
Reserved_0_5 at 0 range 0 .. 5;
ADD at 0 range 6 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype VDSL_LENG_Field is HAL.UInt10;
-- Volatile data segment length
type VDSL_Register is record
-- unspecified
Reserved_0_5 : HAL.UInt6 := 16#0#;
-- Non-volatile data segment length
LENG : VDSL_LENG_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for VDSL_Register use record
Reserved_0_5 at 0 range 0 .. 5;
LENG at 0 range 6 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- Configuration register
type CR_Register is record
-- Firewall pre alarm
FPA : Boolean := False;
-- Volatile data shared
VDS : Boolean := False;
-- Volatile data execution
VDE : Boolean := False;
-- unspecified
Reserved_3_31 : HAL.UInt29 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR_Register use record
FPA at 0 range 0 .. 0;
VDS at 0 range 1 .. 1;
VDE at 0 range 2 .. 2;
Reserved_3_31 at 0 range 3 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Firewall
type FIREWALL_Peripheral is record
-- Code segment start address
CSSA : aliased CSSA_Register;
-- Code segment length
CSL : aliased CSL_Register;
-- Non-volatile data segment start address
NVDSSA : aliased NVDSSA_Register;
-- Non-volatile data segment length
NVDSL : aliased NVDSL_Register;
-- Volatile data segment start address
VDSSA : aliased VDSSA_Register;
-- Volatile data segment length
VDSL : aliased VDSL_Register;
-- Configuration register
CR : aliased CR_Register;
end record
with Volatile;
for FIREWALL_Peripheral use record
CSSA at 16#0# range 0 .. 31;
CSL at 16#4# range 0 .. 31;
NVDSSA at 16#8# range 0 .. 31;
NVDSL at 16#C# range 0 .. 31;
VDSSA at 16#10# range 0 .. 31;
VDSL at 16#14# range 0 .. 31;
CR at 16#20# range 0 .. 31;
end record;
-- Firewall
FIREWALL_Periph : aliased FIREWALL_Peripheral
with Import, Address => System'To_Address (16#40011C00#);
end STM32_SVD.Firewall;
| 29.484694 | 65 | 0.597508 |
29ddcbb44364c7b13658fe4e7ec4d543798aaf50 | 5,001 | adb | Ada | examples/servlets/sessions/source/servlets-hello.adb | reznikmm/matreshka | 6f4414cb5fc4d6d9ffce3b61347c06ce8d365cee | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | examples/servlets/sessions/source/servlets-hello.adb | reznikmm/matreshka | 6f4414cb5fc4d6d9ffce3b61347c06ce8d365cee | [
"BSD-3-Clause"
] | 1 | 2021-03-16T16:09:54.000Z | 2021-08-30T10:37:31.000Z | examples/servlets/sessions/source/servlets-hello.adb | reznikmm/matreshka | 6f4414cb5fc4d6d9ffce3b61347c06ce8d365cee | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Examples Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2016-2019, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with Sessions;
package body Servlets.Hello is
function "+"
(Text : Wide_Wide_String) return League.Strings.Universal_String
renames League.Strings.To_Universal_String;
------------
-- Do_Get --
------------
overriding procedure Do_Get
(Self : in out Hello_Servlet;
Request : Servlet.HTTP_Requests.HTTP_Servlet_Request'Class;
Response : in out Servlet.HTTP_Responses.HTTP_Servlet_Response'Class)
is
pragma Unreferenced (Self);
Counter : Natural;
Session : constant not null Sessions.HTTP_Session_Access :=
Sessions.HTTP_Session_Access (Request.Get_Session);
begin
Session.Count (Counter);
Response.Set_Status (Servlet.HTTP_Responses.OK);
Response.Set_Content_Type (+"text/html");
Response.Set_Character_Encoding (+"utf-8");
declare
Text : constant Wide_Wide_String :=
"Counter:" & Natural'Wide_Wide_Image (Counter);
begin
Response.Get_Output_Stream.Write (+Text);
end;
end Do_Get;
----------------------
-- Get_Servlet_Info --
----------------------
overriding function Get_Servlet_Info
(Self : Hello_Servlet)
return League.Strings.Universal_String
is
pragma Unreferenced (Self);
Text : constant Wide_Wide_String :=
"Hello servlet renders Hello_World result";
begin
return +Text;
end Get_Servlet_Info;
-----------------
-- Instantiate --
-----------------
overriding function Instantiate
(Parameters : not null access
Servlet.Generic_Servlets.Instantiation_Parameters'Class)
return Hello_Servlet
is
pragma Unreferenced (Parameters);
begin
return (Servlet.HTTP_Servlets.HTTP_Servlet with null record);
end Instantiate;
end Servlets.Hello;
| 44.651786 | 78 | 0.487502 |
1d46e714cc47ba69379c1f12bb332c90d9f57953 | 4,581 | adb | Ada | gcc-gcc-7_3_0-release/gcc/ada/s-tpopsp-solaris.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/ada/s-tpopsp-solaris.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/s-tpopsp-solaris.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- SYSTEM.TASK_PRIMITIVES.OPERATIONS.SPECIFIC --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2009, Free Software Foundation, Inc. --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
-- This is a version for Solaris native threads
separate (System.Task_Primitives.Operations)
package body Specific is
----------------
-- Initialize --
----------------
procedure Initialize (Environment_Task : Task_Id) is
pragma Unreferenced (Environment_Task);
Result : Interfaces.C.int;
begin
Result := thr_keycreate (ATCB_Key'Access, System.Null_Address);
pragma Assert (Result = 0);
end Initialize;
-------------------
-- Is_Valid_Task --
-------------------
function Is_Valid_Task return Boolean is
Unknown_Task : aliased System.Address;
Result : Interfaces.C.int;
begin
Result := thr_getspecific (ATCB_Key, Unknown_Task'Unchecked_Access);
pragma Assert (Result = 0);
return Unknown_Task /= System.Null_Address;
end Is_Valid_Task;
---------
-- Set --
---------
procedure Set (Self_Id : Task_Id) is
Result : Interfaces.C.int;
begin
Result := thr_setspecific (ATCB_Key, To_Address (Self_Id));
pragma Assert (Result = 0);
end Set;
----------
-- Self --
----------
-- To make Ada tasks and C threads interoperate better, we have
-- added some functionality to Self. Suppose a C main program
-- (with threads) calls an Ada procedure and the Ada procedure
-- calls the tasking run-time system. Eventually, a call will be
-- made to self. Since the call is not coming from an Ada task,
-- there will be no corresponding ATCB.
-- What we do in Self is to catch references that do not come
-- from recognized Ada tasks, and create an ATCB for the calling
-- thread.
-- The new ATCB will be "detached" from the normal Ada task
-- master hierarchy, much like the existing implicitly created
-- signal-server tasks.
function Self return Task_Id is
Result : Interfaces.C.int;
Self_Id : aliased System.Address;
begin
Result := thr_getspecific (ATCB_Key, Self_Id'Unchecked_Access);
pragma Assert (Result = 0);
if Self_Id = System.Null_Address then
return Register_Foreign_Thread;
else
return To_Task_Id (Self_Id);
end if;
end Self;
end Specific;
| 42.813084 | 78 | 0.50251 |
1df640d1b2a5f9e760f7348cd3cf621e86ccd665 | 892 | adb | Ada | src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/mi_interface/foo.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 31 | 2018-08-01T21:25:24.000Z | 2022-02-14T07:52:34.000Z | src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/mi_interface/foo.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 40 | 2018-12-03T19:48:52.000Z | 2021-03-10T06:34:26.000Z | src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/mi_interface/foo.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 20 | 2018-11-16T21:19:22.000Z | 2021-10-18T23:08:24.000Z | -- Copyright 2014-2019 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with Pck; use Pck;
procedure Foo is
Result1 : Data_Type;
GGG1 : GADataType'Class := GADataType'Class (Result1);
begin
Do_Nothing (GGG1'Address); -- BREAK
end Foo;
| 37.166667 | 73 | 0.727578 |
1d4d85aa39ab3d37933d53c3d0444c01b08eb75a | 5,040 | ads | Ada | source/league/ucd/matreshka-internals-unicode-ucd-core_01f3.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/league/ucd/matreshka-internals-unicode-ucd-core_01f3.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/league/ucd/matreshka-internals-unicode-ucd-core_01f3.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012-2015, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
pragma Restrictions (No_Elaboration_Code);
-- GNAT: enforce generation of preinitialized data section instead of
-- generation of elaboration code.
package Matreshka.Internals.Unicode.Ucd.Core_01F3 is
pragma Preelaborate;
Group_01F3 : aliased constant Core_Second_Stage
:= (16#2D# .. 16#2F# => -- 01F32D .. 01F32F
(Unassigned, Neutral,
Other, Other, Other, Unknown,
(others => False)),
16#7E# .. 16#7F# => -- 01F37E .. 01F37F
(Unassigned, Neutral,
Other, Other, Other, Unknown,
(others => False)),
16#9C# .. 16#9D# => -- 01F39C .. 01F39D
(Other_Symbol, Neutral,
Other, Other, Other, Alphabetic,
(Grapheme_Base => True,
others => False)),
16#B5# .. 16#B6# => -- 01F3B5 .. 01F3B6
(Other_Symbol, Neutral,
Other, Other, Other, Alphabetic,
(Grapheme_Base => True,
others => False)),
16#BC# => -- 01F3BC
(Other_Symbol, Neutral,
Other, Other, Other, Alphabetic,
(Grapheme_Base => True,
others => False)),
16#CF# .. 16#D3# => -- 01F3CF .. 01F3D3
(Unassigned, Neutral,
Other, Other, Other, Unknown,
(others => False)),
16#F8# .. 16#FF# => -- 01F3F8 .. 01F3FF
(Unassigned, Neutral,
Other, Other, Other, Unknown,
(others => False)),
others =>
(Other_Symbol, Neutral,
Other, Other, Other, Ideographic,
(Grapheme_Base => True,
others => False)));
end Matreshka.Internals.Unicode.Ucd.Core_01F3;
| 54.782609 | 78 | 0.440873 |
12f21edc6cb34922e62842afed70cd92792a91c4 | 176,881 | adb | Ada | Vivado_HLS_Tutorial/Design_Optimization/lab1/matrixmul_prj/solution4/.autopilot/db/matrixmul.adb | williambong/Vivado | 68efafbc44b65c0bb047dbafc0ff7f1b56ee36bb | [
"MIT"
] | null | null | null | Vivado_HLS_Tutorial/Design_Optimization/lab1/matrixmul_prj/solution4/.autopilot/db/matrixmul.adb | williambong/Vivado | 68efafbc44b65c0bb047dbafc0ff7f1b56ee36bb | [
"MIT"
] | null | null | null | Vivado_HLS_Tutorial/Design_Optimization/lab1/matrixmul_prj/solution4/.autopilot/db/matrixmul.adb | williambong/Vivado | 68efafbc44b65c0bb047dbafc0ff7f1b56ee36bb | [
"MIT"
] | null | null | null | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="11">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName/>
<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/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>a</originalName>
<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/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>b</originalName>
<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/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>res</originalName>
<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/>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>..</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/>
<rtlName/>
<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/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<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>..</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/>
<rtlName/>
<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/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName/>
<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/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>exitcond_flatten_fu_129_p2</rtlName>
<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/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>indvar_flatten_next_fu_135_p2</rtlName>
<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/>
<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>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>..</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/>
<rtlName>exitcond_fu_141_p2</rtlName>
<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>..</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/>
<rtlName>j_mid2_fu_147_p3</rtlName>
<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>..</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/>
<rtlName>i_s_fu_155_p2</rtlName>
<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>..</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/>
<rtlName>i_mid2_fu_161_p3</rtlName>
<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>..</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/>
<rtlName>tmp_fu_169_p1</rtlName>
<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>..</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/>
<rtlName>tmp_2_fu_174_p1</rtlName>
<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>..</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/>
<rtlName>tmp_trn_cast_fu_255_p1</rtlName>
<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>..</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/>
<rtlName>tmp_2_trn_cast_fu_258_p1</rtlName>
<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>..</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/>
<rtlName>tmp_1_fu_261_p3</rtlName>
<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>..</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/>
<rtlName>p_shl_cast_fu_268_p1</rtlName>
<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>..</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/>
<rtlName>p_addr_fu_272_p2</rtlName>
<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>..</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/>
<rtlName>p_addr_cast_fu_278_p1</rtlName>
<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>..</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/>
<rtlName>p_addr1_fu_282_p2</rtlName>
<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>..</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/>
<rtlName>p_addr1_cast_fu_288_p1</rtlName>
<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>..</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/>
<rtlName>tmp_5_fu_292_p1</rtlName>
<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>..</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/>
<rtlName/>
<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>..</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/>
<rtlName/>
<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>..</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/>
<rtlName/>
<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>..</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/>
<rtlName>tmp_6_fu_185_p1</rtlName>
<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>..</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/>
<rtlName/>
<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>..</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/>
<rtlName/>
<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>..</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/>
<rtlName/>
<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>..</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/>
<rtlName>tmp_12_fu_193_p1</rtlName>
<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>..</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/>
<rtlName/>
<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>..</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/>
<rtlName>grp_fu_311_p2</rtlName>
<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>..</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/>
<rtlName>tmp_9_reg_355</rtlName>
<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>..</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/>
<rtlName/>
<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>..</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/>
<rtlName>tmp_8_reg_360</rtlName>
<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>..</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/>
<rtlName/>
<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>..</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/>
<rtlName>matrixmul_mac_muladd_8s_8s_16s_16_1_U0</rtlName>
<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>..</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/>
<rtlName>tmp_10_fu_227_p4</rtlName>
<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>..</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/>
<rtlName/>
<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>..</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/>
<rtlName>tmp_11_fu_241_p4</rtlName>
<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>..</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/>
<rtlName/>
<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>..</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/>
<rtlName>matrixmul_mac_muladd_8s_8s_16s_16_1_U1</rtlName>
<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>..</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/>
<rtlName>matrixmul_mac_muladd_8s_8s_16s_16_1_U1</rtlName>
<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>..</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/>
<rtlName>matrixmul_mac_muladd_8s_8s_16s_16_1_U0</rtlName>
<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/>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>..</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/>
<rtlName/>
<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>..</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>j_1_fu_179_p2</rtlName>
<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/>
<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>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/>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>..</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/>
<rtlName/>
<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/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_53">
<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>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/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>9</content>
</item>
<item class_id_reference="16" object_id="_55">
<Value>
<Obj>
<type>2</type>
<id>85</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_56">
<Value>
<Obj>
<type>2</type>
<id>91</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>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/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<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/>
<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="_59">
<Value>
<Obj>
<type>2</type>
<id>139</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>8</content>
</item>
<item class_id_reference="16" object_id="_60">
<Value>
<Obj>
<type>2</type>
<id>141</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>15</content>
</item>
<item class_id_reference="16" object_id="_61">
<Value>
<Obj>
<type>2</type>
<id>153</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>16</content>
</item>
<item class_id_reference="16" object_id="_62">
<Value>
<Obj>
<type>2</type>
<id>155</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>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/>
<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>8</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_64">
<Obj>
<type>3</type>
<id>16</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>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/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<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/>
<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>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"/>
</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"/>
</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"/>
</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"/>
</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>2</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>matrixmul_mac_muladd_8s_8s_16s_16_1_U0 (matrixmul_mac_muladd_8s_8s_16s_16_1)</first>
<second class_id="39" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="40" tracking_level="0" version="0">
<first>DSP48E</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>matrixmul_mac_muladd_8s_8s_16s_16_1_U1 (matrixmul_mac_muladd_8s_8s_16s_16_1)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>DSP48E</first>
<second>1</second>
</item>
</second>
</item>
</dp_component_resource>
<dp_expression_resource>
<count>10</count>
<item_version>0</item_version>
<item>
<first>exitcond_flatten_fu_129_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>4</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>exitcond_fu_141_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>2</second>
</item>
<item>
<first>(1P1)</first>
<second>2</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>grp_fu_311_p2 ( * ) </first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>8</second>
</item>
<item>
<first>(1P1)</first>
<second>8</second>
</item>
<item>
<first>DSP48E</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>0</second>
</item>
</second>
</item>
<item>
<first>i_mid2_fu_161_p3 ( Select ) </first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>2</second>
</item>
<item>
<first>(2P2)</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>i_s_fu_155_p2 ( + ) </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>indvar_flatten_next_fu_135_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>j_1_fu_179_p2 ( + ) </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>j_mid2_fu_147_p3 ( Select ) </first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>(2P2)</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>p_addr1_fu_282_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>6</second>
</item>
<item>
<first>(1P1)</first>
<second>6</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>6</second>
</item>
</second>
</item>
<item>
<first>p_addr_fu_272_p2 ( - ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>5</second>
</item>
<item>
<first>(1P1)</first>
<second>5</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>5</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>6</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>4</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>4</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_reg_ppiten_pp0_it2</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>1</second>
</item>
</second>
</item>
<item>
<first>i_phi_fu_111_p4</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>2</second>
</item>
<item>
<first>(2Count)</first>
<second>4</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>i_reg_107</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>2</second>
</item>
<item>
<first>(2Count)</first>
<second>4</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_96</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>8</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>j_reg_118</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>2</second>
</item>
<item>
<first>(2Count)</first>
<second>4</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
</dp_multiplexer_resource>
<dp_register_resource>
<count>16</count>
<item_version>0</item_version>
<item>
<first>ap_CS_fsm</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>3</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>3</second>
</item>
</second>
</item>
<item>
<first>ap_reg_ppiten_pp0_it0</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_reg_ppiten_pp0_it1</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_reg_ppiten_pp0_it2</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_reg_ppstg_exitcond_flatten_reg_319_pp0_it1</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_reg_ppstg_i_mid2_reg_333_pp0_it1</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>2</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_reg_ppstg_j_mid2_reg_328_pp0_it1</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>2</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>exitcond_flatten_reg_319</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>i_mid2_reg_333</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>2</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>i_reg_107</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>2</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_96</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>j_mid2_reg_328</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>2</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>j_reg_118</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>2</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>tmp1_reg_365</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>16</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>16</second>
</item>
</second>
</item>
<item>
<first>tmp_8_reg_360</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>8</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>8</second>
</item>
</second>
</item>
<item>
<first>tmp_9_reg_355</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>8</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>8</second>
</item>
</second>
</item>
</dp_register_resource>
<dp_component_map class_id="41" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="42" tracking_level="0" version="0">
<first>matrixmul_mac_muladd_8s_8s_16s_16_1_U0 (matrixmul_mac_muladd_8s_8s_16s_16_1)</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>51</item>
<item>58</item>
</second>
</item>
<item>
<first>matrixmul_mac_muladd_8s_8s_16s_16_1_U1 (matrixmul_mac_muladd_8s_8s_16s_16_1)</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>56</item>
<item>57</item>
</second>
</item>
</dp_component_map>
<dp_expression_map>
<count>10</count>
<item_version>0</item_version>
<item>
<first>exitcond_flatten_fu_129_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>exitcond_fu_141_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>grp_fu_311_p2 ( * ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>i_mid2_fu_161_p3 ( Select ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>i_s_fu_155_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_135_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>j_1_fu_179_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>j_mid2_fu_147_p3 ( Select ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>p_addr1_fu_282_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>p_addr_fu_272_p2 ( - ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</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>48</count>
<item_version>0</item_version>
<item class_id="44" tracking_level="0" version="0">
<first>8</first>
<second class_id="45" 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="46" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="47" tracking_level="0" version="0">
<first>9</first>
<second class_id="48" 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="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="_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="51" tracking_level="0" version="0">
<count>42</count>
<item_version>0</item_version>
<item class_id="52" 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="54" tracking_level="0" version="0">
<count>39</count>
<item_version>0</item_version>
<item class_id="55" 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="56" tracking_level="0" version="0">
<count>3</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>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="59" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="60" 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="61" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="62" 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>
| 30.365837 | 101 | 0.439996 |
1d9b3f7ec211f110bec25ee685e6b5040de58ce9 | 2,578 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/g-trasym.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/ada/g-trasym.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/g-trasym.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- G N A T . T R A C E B A C K . S Y M B O L I C --
-- --
-- S p e c --
-- --
-- Copyright (C) 1999-2014, 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. --
-- --
------------------------------------------------------------------------------
-- Run-time symbolic traceback support
-- See file s-trasym.ads for full documentation of the interface
with System.Traceback.Symbolic;
package GNAT.Traceback.Symbolic renames System.Traceback.Symbolic;
| 67.842105 | 78 | 0.396043 |
41a7f6368ec70212b1efdb236153fbda24da592e | 41,173 | adb | Ada | HLS/lab3/dct.prj/solution7/.autopilot/db/dct.sched.adb | lfVelez/ISPR | 840f41c2053a48642a7b287feecfea79c6f389b3 | [
"MIT"
] | 1 | 2021-03-03T16:53:52.000Z | 2021-03-03T16:53:52.000Z | HLS/lab3/dct.prj/solution7/.autopilot/db/dct.sched.adb | lfVelez/ISPR | 840f41c2053a48642a7b287feecfea79c6f389b3 | [
"MIT"
] | null | null | null | HLS/lab3/dct.prj/solution7/.autopilot/db/dct.sched.adb | lfVelez/ISPR | 840f41c2053a48642a7b287feecfea79c6f389b3 | [
"MIT"
] | null | null | null | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="14">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>dct</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>input_r</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>input</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>64</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>output_r</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>output</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>64</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>12</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_3">
<Value>
<Obj>
<type>0</type>
<id>7</id>
<name>row_outbuf_i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name>col_outbuf_i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>col_inbuf</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>27</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second class_id="12" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="13" tracking_level="0" version="0">
<first class_id="14" tracking_level="0" version="0">
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>27</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>col_inbuf</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>128</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>buf_2d_in</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>buf_2d_in</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>128</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>buf_2d_out</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>dct</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>buf_2d_out</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>28</item>
<item>29</item>
<item>30</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>14</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>6</count>
<item_version>0</item_version>
<item>32</item>
<item>33</item>
<item>34</item>
<item>51</item>
<item>72</item>
<item>73</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</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>5</count>
<item_version>0</item_version>
<item>36</item>
<item>37</item>
<item>38</item>
<item>71</item>
<item>74</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</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>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>6</count>
<item_version>0</item_version>
<item>40</item>
<item>41</item>
<item>42</item>
<item>52</item>
<item>70</item>
<item>75</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>44</item>
<item>45</item>
<item>46</item>
<item>69</item>
<item>76</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name></name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>90</lineNumber>
<contextFuncName>dct</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>90</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>48</item>
<item>49</item>
<item>50</item>
<item>68</item>
<item>77</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name></name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>91</lineNumber>
<contextFuncName>dct</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>91</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_15">
<Value>
<Obj>
<type>2</type>
<id>21</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_16">
<Value>
<Obj>
<type>2</type>
<id>27</id>
<name>read_data</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:read_data></content>
</item>
<item class_id_reference="16" object_id="_17">
<Value>
<Obj>
<type>2</type>
<id>31</id>
<name>Loop_Row_DCT_Loop_pr</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:Loop_Row_DCT_Loop_pr></content>
</item>
<item class_id_reference="16" object_id="_18">
<Value>
<Obj>
<type>2</type>
<id>35</id>
<name>Loop_Xpose_Row_Outer</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:Loop_Xpose_Row_Outer></content>
</item>
<item class_id_reference="16" object_id="_19">
<Value>
<Obj>
<type>2</type>
<id>39</id>
<name>Loop_Col_DCT_Loop_pr</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:Loop_Col_DCT_Loop_pr></content>
</item>
<item class_id_reference="16" object_id="_20">
<Value>
<Obj>
<type>2</type>
<id>43</id>
<name>Loop_Xpose_Col_Outer</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:Loop_Xpose_Col_Outer></content>
</item>
<item class_id_reference="16" object_id="_21">
<Value>
<Obj>
<type>2</type>
<id>47</id>
<name>write_data</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:write_data></content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_22">
<Obj>
<type>3</type>
<id>20</id>
<name>dct</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>12</count>
<item_version>0</item_version>
<item>7</item>
<item>8</item>
<item>9</item>
<item>11</item>
<item>12</item>
<item>13</item>
<item>14</item>
<item>15</item>
<item>16</item>
<item>17</item>
<item>18</item>
<item>19</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>35</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_23">
<id>22</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>7</sink_obj>
</item>
<item class_id_reference="20" object_id="_24">
<id>23</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_25">
<id>24</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_26">
<id>25</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_27">
<id>26</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_28">
<id>28</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_29">
<id>29</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_30">
<id>30</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_31">
<id>32</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_32">
<id>33</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_33">
<id>34</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_34">
<id>36</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_35">
<id>37</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_36">
<id>38</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_37">
<id>40</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_38">
<id>41</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_39">
<id>42</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_40">
<id>44</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_41">
<id>45</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_42">
<id>46</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_43">
<id>48</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_44">
<id>49</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_45">
<id>50</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_46">
<id>51</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_47">
<id>52</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_48">
<id>68</id>
<edge_type>4</edge_type>
<source_obj>17</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_49">
<id>69</id>
<edge_type>4</edge_type>
<source_obj>16</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_50">
<id>70</id>
<edge_type>4</edge_type>
<source_obj>15</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_51">
<id>71</id>
<edge_type>4</edge_type>
<source_obj>14</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_52">
<id>72</id>
<edge_type>4</edge_type>
<source_obj>13</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_53">
<id>73</id>
<edge_type>4</edge_type>
<source_obj>13</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_54">
<id>74</id>
<edge_type>4</edge_type>
<source_obj>14</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_55">
<id>75</id>
<edge_type>4</edge_type>
<source_obj>15</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_56">
<id>76</id>
<edge_type>4</edge_type>
<source_obj>16</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_57">
<id>77</id>
<edge_type>4</edge_type>
<source_obj>17</source_obj>
<sink_obj>18</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_58">
<mId>1</mId>
<mTag>dct</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>647</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>1</mIsDfPipe>
<mDfPipe class_id="23" tracking_level="1" version="0" object_id="_59">
<port_list class_id="24" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</port_list>
<process_list class_id="25" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_60">
<type>0</type>
<name>read_data_U0</name>
<ssdmobj_id>13</ssdmobj_id>
<pins class_id="27" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_61">
<port class_id="29" tracking_level="1" version="0" object_id="_62">
<name>input</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id="30" tracking_level="1" version="0" object_id="_63">
<type>0</type>
<name>read_data_U0</name>
<ssdmobj_id>13</ssdmobj_id>
</inst>
</item>
<item class_id_reference="28" object_id="_64">
<port class_id_reference="29" object_id="_65">
<name>buf</name>
<dir>2</dir>
<type>2</type>
</port>
<inst class_id_reference="30" object_id_reference="_63"></inst>
</item>
</pins>
</item>
<item class_id_reference="26" object_id="_66">
<type>0</type>
<name>Loop_Row_DCT_Loop_pr_U0</name>
<ssdmobj_id>14</ssdmobj_id>
<pins>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_67">
<port class_id_reference="29" object_id="_68">
<name>buf_2d_in</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id="_69">
<type>0</type>
<name>Loop_Row_DCT_Loop_pr_U0</name>
<ssdmobj_id>14</ssdmobj_id>
</inst>
</item>
<item class_id_reference="28" object_id="_70">
<port class_id_reference="29" object_id="_71">
<name>row_outbuf_i</name>
<dir>2</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_69"></inst>
</item>
<item class_id_reference="28" object_id="_72">
<port class_id_reference="29" object_id="_73">
<name>dct_coeff_table</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_69"></inst>
</item>
</pins>
</item>
<item class_id_reference="26" object_id="_74">
<type>0</type>
<name>Loop_Xpose_Row_Outer_U0</name>
<ssdmobj_id>15</ssdmobj_id>
<pins>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_75">
<port class_id_reference="29" object_id="_76">
<name>row_outbuf_i</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id="_77">
<type>0</type>
<name>Loop_Xpose_Row_Outer_U0</name>
<ssdmobj_id>15</ssdmobj_id>
</inst>
</item>
<item class_id_reference="28" object_id="_78">
<port class_id_reference="29" object_id="_79">
<name>col_inbuf</name>
<dir>2</dir>
<type>2</type>
</port>
<inst class_id_reference="30" object_id_reference="_77"></inst>
</item>
</pins>
</item>
<item class_id_reference="26" object_id="_80">
<type>0</type>
<name>Loop_Col_DCT_Loop_pr_U0</name>
<ssdmobj_id>16</ssdmobj_id>
<pins>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_81">
<port class_id_reference="29" object_id="_82">
<name>col_inbuf</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id="_83">
<type>0</type>
<name>Loop_Col_DCT_Loop_pr_U0</name>
<ssdmobj_id>16</ssdmobj_id>
</inst>
</item>
<item class_id_reference="28" object_id="_84">
<port class_id_reference="29" object_id="_85">
<name>col_outbuf_i</name>
<dir>2</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_83"></inst>
</item>
<item class_id_reference="28" object_id="_86">
<port class_id_reference="29" object_id="_87">
<name>dct_coeff_table</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_83"></inst>
</item>
</pins>
</item>
<item class_id_reference="26" object_id="_88">
<type>0</type>
<name>Loop_Xpose_Col_Outer_U0</name>
<ssdmobj_id>17</ssdmobj_id>
<pins>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_89">
<port class_id_reference="29" object_id="_90">
<name>col_outbuf_i</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id="_91">
<type>0</type>
<name>Loop_Xpose_Col_Outer_U0</name>
<ssdmobj_id>17</ssdmobj_id>
</inst>
</item>
<item class_id_reference="28" object_id="_92">
<port class_id_reference="29" object_id="_93">
<name>buf_2d_out</name>
<dir>2</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_91"></inst>
</item>
</pins>
</item>
<item class_id_reference="26" object_id="_94">
<type>0</type>
<name>write_data_U0</name>
<ssdmobj_id>18</ssdmobj_id>
<pins>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_95">
<port class_id_reference="29" object_id="_96">
<name>buf</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id="_97">
<type>0</type>
<name>write_data_U0</name>
<ssdmobj_id>18</ssdmobj_id>
</inst>
</item>
<item class_id_reference="28" object_id="_98">
<port class_id_reference="29" object_id="_99">
<name>output</name>
<dir>2</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_97"></inst>
</item>
</pins>
</item>
</process_list>
<channel_list class_id="31" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="32" tracking_level="1" version="0" object_id="_100">
<type>1</type>
<name>buf_2d_in</name>
<ssdmobj_id>11</ssdmobj_id>
<ctype>1</ctype>
<depth>0</depth>
<bitwidth>0</bitwidth>
<source class_id_reference="28" object_id="_101">
<port class_id_reference="29" object_id="_102">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_63"></inst>
</source>
<sink class_id_reference="28" object_id="_103">
<port class_id_reference="29" object_id="_104">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_69"></inst>
</sink>
</item>
<item class_id_reference="32" object_id="_105">
<type>1</type>
<name>row_outbuf_i</name>
<ssdmobj_id>7</ssdmobj_id>
<ctype>1</ctype>
<depth>0</depth>
<bitwidth>0</bitwidth>
<source class_id_reference="28" object_id="_106">
<port class_id_reference="29" object_id="_107">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_69"></inst>
</source>
<sink class_id_reference="28" object_id="_108">
<port class_id_reference="29" object_id="_109">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_77"></inst>
</sink>
</item>
<item class_id_reference="32" object_id="_110">
<type>1</type>
<name>col_inbuf</name>
<ssdmobj_id>9</ssdmobj_id>
<ctype>1</ctype>
<depth>0</depth>
<bitwidth>0</bitwidth>
<source class_id_reference="28" object_id="_111">
<port class_id_reference="29" object_id="_112">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_77"></inst>
</source>
<sink class_id_reference="28" object_id="_113">
<port class_id_reference="29" object_id="_114">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_83"></inst>
</sink>
</item>
<item class_id_reference="32" object_id="_115">
<type>1</type>
<name>col_outbuf_i</name>
<ssdmobj_id>8</ssdmobj_id>
<ctype>1</ctype>
<depth>0</depth>
<bitwidth>0</bitwidth>
<source class_id_reference="28" object_id="_116">
<port class_id_reference="29" object_id="_117">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_83"></inst>
</source>
<sink class_id_reference="28" object_id="_118">
<port class_id_reference="29" object_id="_119">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_91"></inst>
</sink>
</item>
<item class_id_reference="32" object_id="_120">
<type>1</type>
<name>buf_2d_out</name>
<ssdmobj_id>12</ssdmobj_id>
<ctype>1</ctype>
<depth>0</depth>
<bitwidth>0</bitwidth>
<source class_id_reference="28" object_id="_121">
<port class_id_reference="29" object_id="_122">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_91"></inst>
</source>
<sink class_id_reference="28" object_id="_123">
<port class_id_reference="29" object_id="_124">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_97"></inst>
</sink>
</item>
</channel_list>
<net_list class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</net_list>
</mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="-1"></fsm>
<res class_id="-1"></res>
<node_label_latency class_id="36" tracking_level="0" version="0">
<count>12</count>
<item_version>0</item_version>
<item class_id="37" tracking_level="0" version="0">
<first>7</first>
<second class_id="38" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>8</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>9</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<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>1</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>2</first>
<second>1</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>4</first>
<second>1</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>6</first>
<second>1</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>8</first>
<second>1</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>10</first>
<second>1</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="39" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="40" tracking_level="0" version="0">
<first>20</first>
<second class_id="41" tracking_level="0" version="0">
<first>0</first>
<second>11</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="42" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="43" tracking_level="1" version="0" object_id="_125">
<region_name>dct</region_name>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</basic_blocks>
<nodes>
<count>16</count>
<item_version>0</item_version>
<item>4</item>
<item>5</item>
<item>6</item>
<item>7</item>
<item>8</item>
<item>9</item>
<item>10</item>
<item>11</item>
<item>12</item>
<item>13</item>
<item>14</item>
<item>15</item>
<item>16</item>
<item>17</item>
<item>18</item>
<item>19</item>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>16</region_type>
<interval>0</interval>
<pipe_depth>0</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="44" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="45" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="46" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_reg_nodes>
<dp_regname_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="47" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_port_io_nodes>
<port2core class_id="48" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
| 27.951799 | 90 | 0.592791 |
2f0485a4396948df65e425a7dcc1be3cf07695b7 | 346 | ads | Ada | workshop/src/prefix_notation.ads | TNO/Rejuvenation-Ada | 8113ec28da3923ccde40d76cbab70e0e614f4b75 | [
"BSD-3-Clause"
] | 1 | 2022-03-08T13:00:47.000Z | 2022-03-08T13:00:47.000Z | src/examples/Rejuvenation_Workshop/src/prefix_notation.ads | selroc/Renaissance-Ada | 39230b34aced4a9d83831be346ca103136c53715 | [
"BSD-3-Clause"
] | null | null | null | src/examples/Rejuvenation_Workshop/src/prefix_notation.ads | selroc/Renaissance-Ada | 39230b34aced4a9d83831be346ca103136c53715 | [
"BSD-3-Clause"
] | null | null | null | package Prefix_Notation is
type My_Type is tagged private;
procedure Operator_Zero (X : My_Type);
procedure Operator_One (X : My_Type; A : Integer);
private
type My_Type is tagged null record;
procedure Operator_Zero (X : My_Type) is null;
procedure Operator_One (X : My_Type; A : Integer) is null;
end Prefix_Notation;
| 19.222222 | 61 | 0.722543 |
503475e4f128e7116b843c72115e3a17c73221bc | 19,522 | ads | Ada | llvm-gcc-4.2-2.9/gcc/ada/s-osinte-solaris.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | 1 | 2016-04-09T02:58:13.000Z | 2016-04-09T02:58:13.000Z | llvm-gcc-4.2-2.9/gcc/ada/s-osinte-solaris.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/s-osinte-solaris.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . O S _ I N T E R F A C E --
-- --
-- S p e c --
-- --
-- Copyright (C) 1991-1994, Florida State University --
-- Copyright (C) 1995-2006, Free Software Foundation, Inc. --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNARL is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNARL; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
-- This is a Solaris (native) version of this package
-- This package includes all direct interfaces to OS services
-- that are needed by children of System.
-- PLEASE DO NOT add any with-clauses to this package or remove the pragma
-- Preelaborate. This package is designed to be a bottom-level (leaf) package.
with Interfaces.C;
with Unchecked_Conversion;
package System.OS_Interface is
pragma Preelaborate;
pragma Linker_Options ("-lposix4");
pragma Linker_Options ("-lthread");
subtype int is Interfaces.C.int;
subtype short is Interfaces.C.short;
subtype long is Interfaces.C.long;
subtype unsigned is Interfaces.C.unsigned;
subtype unsigned_short is Interfaces.C.unsigned_short;
subtype unsigned_long is Interfaces.C.unsigned_long;
subtype unsigned_char is Interfaces.C.unsigned_char;
subtype plain_char is Interfaces.C.plain_char;
subtype size_t is Interfaces.C.size_t;
-----------
-- Errno --
-----------
function errno return int;
pragma Import (C, errno, "__get_errno");
EAGAIN : constant := 11;
EINTR : constant := 4;
EINVAL : constant := 22;
ENOMEM : constant := 12;
ETIME : constant := 62;
ETIMEDOUT : constant := 145;
-------------
-- Signals --
-------------
Max_Interrupt : constant := 45;
type Signal is new int range 0 .. Max_Interrupt;
for Signal'Size use int'Size;
SIGHUP : constant := 1; -- hangup
SIGINT : constant := 2; -- interrupt (rubout)
SIGQUIT : constant := 3; -- quit (ASCD FS)
SIGILL : constant := 4; -- illegal instruction (not reset)
SIGTRAP : constant := 5; -- trace trap (not reset)
SIGIOT : constant := 6; -- IOT instruction
SIGABRT : constant := 6; -- used by abort, replace SIGIOT in the future
SIGEMT : constant := 7; -- EMT instruction
SIGFPE : constant := 8; -- floating point exception
SIGKILL : constant := 9; -- kill (cannot be caught or ignored)
SIGBUS : constant := 10; -- bus error
SIGSEGV : constant := 11; -- segmentation violation
SIGSYS : constant := 12; -- bad argument to system call
SIGPIPE : constant := 13; -- write on a pipe with no one to read it
SIGALRM : constant := 14; -- alarm clock
SIGTERM : constant := 15; -- software termination signal from kill
SIGUSR1 : constant := 16; -- user defined signal 1
SIGUSR2 : constant := 17; -- user defined signal 2
SIGCLD : constant := 18; -- alias for SIGCHLD
SIGCHLD : constant := 18; -- child status change
SIGPWR : constant := 19; -- power-fail restart
SIGWINCH : constant := 20; -- window size change
SIGURG : constant := 21; -- urgent condition on IO channel
SIGPOLL : constant := 22; -- pollable event occurred
SIGIO : constant := 22; -- I/O possible (Solaris SIGPOLL alias)
SIGSTOP : constant := 23; -- stop (cannot be caught or ignored)
SIGTSTP : constant := 24; -- user stop requested from tty
SIGCONT : constant := 25; -- stopped process has been continued
SIGTTIN : constant := 26; -- background tty read attempted
SIGTTOU : constant := 27; -- background tty write attempted
SIGVTALRM : constant := 28; -- virtual timer expired
SIGPROF : constant := 29; -- profiling timer expired
SIGXCPU : constant := 30; -- CPU time limit exceeded
SIGXFSZ : constant := 31; -- filesize limit exceeded
SIGWAITING : constant := 32; -- process's lwps blocked (Solaris)
SIGLWP : constant := 33; -- used by thread library (Solaris)
SIGFREEZE : constant := 34; -- used by CPR (Solaris)
SIGTHAW : constant := 35; -- used by CPR (Solaris)
SIGCANCEL : constant := 36; -- thread cancellation signal (libthread)
type Signal_Set is array (Natural range <>) of Signal;
Unmasked : constant Signal_Set := (SIGTRAP, SIGLWP, SIGPROF);
-- Following signals should not be disturbed.
-- See c-posix-signals.c in FLORIST
Reserved : constant Signal_Set :=
(SIGKILL, SIGSTOP, SIGWAITING, SIGCANCEL, SIGTRAP, SIGSEGV);
type sigset_t is private;
function sigaddset (set : access sigset_t; sig : Signal) return int;
pragma Import (C, sigaddset, "sigaddset");
function sigdelset (set : access sigset_t; sig : Signal) return int;
pragma Import (C, sigdelset, "sigdelset");
function sigfillset (set : access sigset_t) return int;
pragma Import (C, sigfillset, "sigfillset");
function sigismember (set : access sigset_t; sig : Signal) return int;
pragma Import (C, sigismember, "sigismember");
function sigemptyset (set : access sigset_t) return int;
pragma Import (C, sigemptyset, "sigemptyset");
type union_type_3 is new String (1 .. 116);
type siginfo_t is record
si_signo : int;
si_code : int;
si_errno : int;
X_data : union_type_3;
end record;
pragma Convention (C, siginfo_t);
-- The types mcontext_t and gregset_t are part of the ucontext_t
-- information, which is specific to Solaris2.4 for SPARC
-- The ucontext_t info seems to be used by the handler
-- for SIGSEGV to decide whether it is a Storage_Error (stack overflow) or
-- a Constraint_Error (bad pointer). The original code that did this
-- is suspect, so it is not clear whether we really need this part of
-- the signal context information, or perhaps something else.
-- More analysis is needed, after which these declarations may need to
-- be changed.
FPE_INTDIV : constant := 1; -- integer divide by zero
FPE_INTOVF : constant := 2; -- integer overflow
FPE_FLTDIV : constant := 3; -- floating point divide by zero
FPE_FLTOVF : constant := 4; -- floating point overflow
FPE_FLTUND : constant := 5; -- floating point underflow
FPE_FLTRES : constant := 6; -- floating point inexact result
FPE_FLTINV : constant := 7; -- invalid floating point operation
FPE_FLTSUB : constant := 8; -- subscript out of range
type greg_t is new int;
type gregset_t is array (0 .. 18) of greg_t;
type union_type_2 is new String (1 .. 128);
type record_type_1 is record
fpu_fr : union_type_2;
fpu_q : System.Address;
fpu_fsr : unsigned;
fpu_qcnt : unsigned_char;
fpu_q_entrysize : unsigned_char;
fpu_en : unsigned_char;
end record;
pragma Convention (C, record_type_1);
type array_type_7 is array (Integer range 0 .. 20) of long;
type mcontext_t is record
gregs : gregset_t;
gwins : System.Address;
fpregs : record_type_1;
filler : array_type_7;
end record;
pragma Convention (C, mcontext_t);
type record_type_2 is record
ss_sp : System.Address;
ss_size : int;
ss_flags : int;
end record;
pragma Convention (C, record_type_2);
type array_type_8 is array (Integer range 0 .. 22) of long;
type ucontext_t is record
uc_flags : unsigned_long;
uc_link : System.Address;
uc_sigmask : sigset_t;
uc_stack : record_type_2;
uc_mcontext : mcontext_t;
uc_filler : array_type_8;
end record;
pragma Convention (C, ucontext_t);
type Signal_Handler is access procedure
(signo : Signal;
info : access siginfo_t;
context : access ucontext_t);
type union_type_1 is new plain_char;
type array_type_2 is array (Integer range 0 .. 1) of int;
type struct_sigaction is record
sa_flags : int;
sa_handler : System.Address;
sa_mask : sigset_t;
sa_resv : array_type_2;
end record;
pragma Convention (C, struct_sigaction);
type struct_sigaction_ptr is access all struct_sigaction;
SIG_BLOCK : constant := 1;
SIG_UNBLOCK : constant := 2;
SIG_SETMASK : constant := 3;
SIG_DFL : constant := 0;
SIG_IGN : constant := 1;
function sigaction
(sig : Signal;
act : struct_sigaction_ptr;
oact : struct_sigaction_ptr) return int;
pragma Import (C, sigaction, "sigaction");
----------
-- Time --
----------
type timespec is private;
type clockid_t is private;
CLOCK_REALTIME : constant clockid_t;
function clock_gettime
(clock_id : clockid_t; tp : access timespec) return int;
pragma Import (C, clock_gettime, "clock_gettime");
function clock_getres
(clock_id : clockid_t; res : access timespec) return int;
pragma Import (C, clock_getres, "clock_getres");
function To_Duration (TS : timespec) return Duration;
pragma Inline (To_Duration);
function To_Timespec (D : Duration) return timespec;
pragma Inline (To_Timespec);
type struct_timeval is private;
-- This is needed on systems that do not have clock_gettime()
-- but do have gettimeofday().
function To_Duration (TV : struct_timeval) return Duration;
pragma Inline (To_Duration);
function To_Timeval (D : Duration) return struct_timeval;
pragma Inline (To_Timeval);
-------------
-- Process --
-------------
type pid_t is private;
function kill (pid : pid_t; sig : Signal) return int;
pragma Import (C, kill, "kill");
function getpid return pid_t;
pragma Import (C, getpid, "getpid");
-------------
-- Threads --
-------------
type Thread_Body is access
function (arg : System.Address) return System.Address;
function Thread_Body_Access is new
Unchecked_Conversion (System.Address, Thread_Body);
THR_DETACHED : constant := 64;
THR_BOUND : constant := 1;
THR_NEW_LWP : constant := 2;
USYNC_THREAD : constant := 0;
type thread_t is new unsigned;
subtype Thread_Id is thread_t;
-- These types should be commented ???
function To_thread_t is new Unchecked_Conversion (Integer, thread_t);
type mutex_t is limited private;
type cond_t is limited private;
type thread_key_t is private;
function thr_create
(stack_base : System.Address;
stack_size : size_t;
start_routine : Thread_Body;
arg : System.Address;
flags : int;
new_thread : access thread_t) return int;
pragma Import (C, thr_create, "thr_create");
function thr_min_stack return size_t;
pragma Import (C, thr_min_stack, "thr_min_stack");
function thr_self return thread_t;
pragma Import (C, thr_self, "thr_self");
function mutex_init
(mutex : access mutex_t;
mtype : int;
arg : System.Address) return int;
pragma Import (C, mutex_init, "mutex_init");
function mutex_destroy (mutex : access mutex_t) return int;
pragma Import (C, mutex_destroy, "mutex_destroy");
function mutex_lock (mutex : access mutex_t) return int;
pragma Import (C, mutex_lock, "mutex_lock");
function mutex_unlock (mutex : access mutex_t) return int;
pragma Import (C, mutex_unlock, "mutex_unlock");
function cond_init
(cond : access cond_t;
ctype : int;
arg : int) return int;
pragma Import (C, cond_init, "cond_init");
function cond_wait
(cond : access cond_t; mutex : access mutex_t) return int;
pragma Import (C, cond_wait, "cond_wait");
function cond_timedwait
(cond : access cond_t;
mutex : access mutex_t;
abstime : access timespec) return int;
pragma Import (C, cond_timedwait, "cond_timedwait");
function cond_signal (cond : access cond_t) return int;
pragma Import (C, cond_signal, "cond_signal");
function cond_destroy (cond : access cond_t) return int;
pragma Import (C, cond_destroy, "cond_destroy");
function thr_setspecific
(key : thread_key_t; value : System.Address) return int;
pragma Import (C, thr_setspecific, "thr_setspecific");
function thr_getspecific
(key : thread_key_t;
value : access System.Address) return int;
pragma Import (C, thr_getspecific, "thr_getspecific");
function thr_keycreate
(key : access thread_key_t; destructor : System.Address) return int;
pragma Import (C, thr_keycreate, "thr_keycreate");
function thr_setprio (thread : thread_t; priority : int) return int;
pragma Import (C, thr_setprio, "thr_setprio");
procedure thr_exit (status : System.Address);
pragma Import (C, thr_exit, "thr_exit");
function thr_setconcurrency (new_level : int) return int;
pragma Import (C, thr_setconcurrency, "thr_setconcurrency");
function sigwait (set : access sigset_t; sig : access Signal) return int;
pragma Import (C, sigwait, "__posix_sigwait");
function thr_kill (thread : thread_t; sig : Signal) return int;
pragma Import (C, thr_kill, "thr_kill");
function thr_sigsetmask
(how : int;
set : access sigset_t;
oset : access sigset_t) return int;
pragma Import (C, thr_sigsetmask, "thr_sigsetmask");
function pthread_sigmask
(how : int;
set : access sigset_t;
oset : access sigset_t) return int;
pragma Import (C, pthread_sigmask, "thr_sigsetmask");
function thr_suspend (target_thread : thread_t) return int;
pragma Import (C, thr_suspend, "thr_suspend");
function thr_continue (target_thread : thread_t) return int;
pragma Import (C, thr_continue, "thr_continue");
procedure thr_yield;
pragma Import (C, thr_yield, "thr_yield");
---------
-- LWP --
---------
P_PID : constant := 0;
P_LWPID : constant := 8;
PC_GETCID : constant := 0;
PC_GETCLINFO : constant := 1;
PC_SETPARMS : constant := 2;
PC_GETPARMS : constant := 3;
PC_ADMIN : constant := 4;
PC_CLNULL : constant := -1;
RT_NOCHANGE : constant := -1;
RT_TQINF : constant := -2;
RT_TQDEF : constant := -3;
PC_CLNMSZ : constant := 16;
PC_VERSION : constant := 1;
type lwpid_t is new int;
type pri_t is new short;
type id_t is new long;
P_MYID : constant := -1;
-- the specified LWP or process is the current one.
type struct_pcinfo is record
pc_cid : id_t;
pc_clname : String (1 .. PC_CLNMSZ);
rt_maxpri : short;
end record;
pragma Convention (C, struct_pcinfo);
type struct_pcparms is record
pc_cid : id_t;
rt_pri : pri_t;
rt_tqsecs : long;
rt_tqnsecs : long;
end record;
pragma Convention (C, struct_pcparms);
function priocntl
(ver : int;
id_type : int;
id : lwpid_t;
cmd : int;
arg : System.Address) return Interfaces.C.long;
pragma Import (C, priocntl, "__priocntl");
function lwp_self return lwpid_t;
pragma Import (C, lwp_self, "_lwp_self");
type processorid_t is new int;
type processorid_t_ptr is access all processorid_t;
-- Constants for function processor_bind
PBIND_QUERY : constant processorid_t := -2;
-- the processor bindings are not changed.
PBIND_NONE : constant processorid_t := -1;
-- the processor bindings of the specified LWPs are cleared.
-- Flags for function p_online
PR_OFFLINE : constant int := 1;
-- processor is offline, as quiet as possible
PR_ONLINE : constant int := 2;
-- processor online
PR_STATUS : constant int := 3;
-- value passed to p_online to request status
function p_online (processorid : processorid_t; flag : int) return int;
pragma Import (C, p_online, "p_online");
function processor_bind
(id_type : int;
id : id_t;
proc_id : processorid_t;
obind : processorid_t_ptr) return int;
pragma Import (C, processor_bind, "processor_bind");
procedure pthread_init;
-- dummy procedure to share s-intman.adb with other Solaris targets.
private
type array_type_1 is array (0 .. 3) of unsigned_long;
type sigset_t is record
X_X_sigbits : array_type_1;
end record;
pragma Convention (C, sigset_t);
type pid_t is new long;
type time_t is new long;
type timespec is record
tv_sec : time_t;
tv_nsec : long;
end record;
pragma Convention (C, timespec);
type clockid_t is new int;
CLOCK_REALTIME : constant clockid_t := 0;
type struct_timeval is record
tv_sec : long;
tv_usec : long;
end record;
pragma Convention (C, struct_timeval);
type array_type_9 is array (0 .. 3) of unsigned_char;
type record_type_3 is record
flag : array_type_9;
Xtype : unsigned_long;
end record;
pragma Convention (C, record_type_3);
type mutex_t is record
flags : record_type_3;
lock : String (1 .. 8);
data : String (1 .. 8);
end record;
pragma Convention (C, mutex_t);
type cond_t is record
flag : array_type_9;
Xtype : unsigned_long;
data : String (1 .. 8);
end record;
pragma Convention (C, cond_t);
type thread_key_t is new unsigned;
end System.OS_Interface;
| 34.369718 | 79 | 0.620838 |
294b6c858288d53c57980dfd33f37b6205b31b0e | 2,853 | ads | Ada | src/support_utils/support_utils-developer_parameters.ads | finleyexp/whitakers-words | 9c07fe7e96ac15dc3262b82a37f6ea69947f458b | [
"FTL"
] | 204 | 2015-06-12T21:22:55.000Z | 2022-03-28T10:50:16.000Z | src/support_utils/support_utils-developer_parameters.ads | finleyexp/whitakers-words | 9c07fe7e96ac15dc3262b82a37f6ea69947f458b | [
"FTL"
] | 98 | 2015-06-15T22:17:04.000Z | 2021-10-01T18:17:55.000Z | src/support_utils/support_utils-developer_parameters.ads | finleyexp/whitakers-words | 9c07fe7e96ac15dc3262b82a37f6ea69947f458b | [
"FTL"
] | 50 | 2015-06-16T22:42:24.000Z | 2021-12-29T16:53:08.000Z | -- WORDS, a Latin dictionary, by Colonel William Whitaker (USAF, Retired)
--
-- Copyright William A. Whitaker (1936–2010)
--
-- This is a free program, which means it is proper to copy it and pass
-- it on to your friends. Consider it a developmental item for which
-- there is no charge. However, just for form, it is Copyrighted
-- (c). Permission is hereby freely given for any and all use of program
-- and data. You can sell it as your own, but at least tell me.
--
-- This version is distributed without obligation, but the developer
-- would appreciate comments and suggestions.
--
-- All parts of the WORDS system, source code and data files, are made freely
-- available to anyone who wishes to use them, for whatever purpose.
with Ada.Text_IO;
package Support_Utils.Developer_Parameters is
-- This package defines a number of parameters that areused in the program
-- The default values are set in the body, so that they may be changed
-- easily
-- These files are used by the program if requested, but not necessary
-- They are all text files and human readable
-- DEVELOPER MODE_FILE is used by the program to remember values
Mdev_File : Ada.Text_IO.File_Type;
Mdev_Full_Name : constant String := "WORD.MDV";
-- Debug not currently in use
-- -- DBG collects debug Output for one entry at a time
-- DBG : TEXT_IO.FILE_TYPE;
-- DEBUG_FULL_NAME : constant STRING := "WORD.DBG";
-- STATS collects statistics on the program, stems used, inflections, etc.
Stats : Ada.Text_IO.File_Type;
Stats_Full_Name : constant String := "WORD.STA";
type Mdev_Type is (
-- HAVE_DEBUG_FILE, -- No longer in use
-- WRITE_DEBUG_FILE,
Have_Statistics_File,
Write_Statistics_File,
Show_Dictionary,
Show_Dictionary_Line,
Show_Dictionary_Codes,
Do_Pearse_Codes,
Do_Only_Initial_Word,
For_Word_List_Check,
Do_Only_Fixes,
Do_Fixes_Anyway,
Use_Prefixes,
Use_Suffixes,
Use_Tackons,
Do_Medieval_Tricks,
Do_Syncope,
Do_Two_Words,
Include_Unknown_Context,
No_Meanings,
Omit_Archaic,
Omit_Medieval,
Omit_Uncommon,
Do_I_For_J,
Do_U_For_V,
Pause_In_Screen_Output,
No_Screen_Activity,
Update_Local_Dictionary,
Update_Meanings,
Minimize_Output);
package Mdev_Type_Io is new Ada.Text_IO.Enumeration_IO (Mdev_Type);
type Mdev_Array is array (Mdev_Type) of Boolean;
Words_Mdev : Mdev_Array; -- Initialized in body
Start_File_Character : Character := '@';
Change_Developer_Modes_Character : Character := '!';
procedure Change_Developer_Modes;
procedure Update_Local_Dictionary_File;
procedure Initialize_Developer_Parameters;
end Support_Utils.Developer_Parameters;
| 28.818182 | 78 | 0.70312 |
59da0980fbee8f32bf8fb4e6c1e5faa00e60b774 | 2,216 | ads | Ada | src/file_operations.ads | kraileth/ravenadm | 02bb13117bafc8887e0c90a4effc63ffcdc90642 | [
"0BSD"
] | 18 | 2017-02-28T08:43:17.000Z | 2022-03-22T21:55:56.000Z | src/file_operations.ads | kraileth/ravenadm | 02bb13117bafc8887e0c90a4effc63ffcdc90642 | [
"0BSD"
] | 49 | 2017-10-28T11:18:05.000Z | 2022-01-16T16:23:32.000Z | src/file_operations.ads | kraileth/ravenadm | 02bb13117bafc8887e0c90a4effc63ffcdc90642 | [
"0BSD"
] | 5 | 2017-09-06T14:47:57.000Z | 2021-11-25T08:31:10.000Z | -- This file is covered by the Internet Software Consortium (ISC) License
-- Reference: ../License.txt
package File_Operations is
file_handling : exception;
-- Generic function to scan a text file and convert to a string
function get_file_contents (dossier : String) return String;
-- Generic procedure to convert a string to a new text file
-- exception thrown on failures
procedure dump_contents_to_file
(contents : String;
dossier : String);
-- If relative_filename contains no path separator ("/") do nothing
-- Otherwise test the existence of extraction_directory / subdirectory and if it
-- does not exist, create it.
procedure create_subdirectory
(extraction_directory : String;
subdirectory : String);
-- generic function to return first line of file.
function head_n1 (filename : String) return String;
-- Create a pidfile on major actions and remove it when complete.
procedure create_pidfile (pidfile : String);
procedure destroy_pidfile (pidfile : String);
-- Equivalent to "mkdir -p <path/to/final/directory>
-- May throw exeption
procedure mkdirp_from_filename (filename : String);
-- Adds the contents of "another_file" to the existing contents of basefile.
-- If "basefile" does not exist, just copy it (directory must already exist in that case)
procedure concatenate_file (basefile : String; another_file : String);
-- Creates a zero-length file
procedure create_cookie (fullpath : String);
-- Replace pattern-matching files in target directory from the source directory
procedure replace_directory_contents
(source_directory : String;
target_directory : String;
pattern : String);
-- If runpath does not contain the string "$ORIGIN" then runpath is returned
-- Otherwise, the $ORIGIN text is replaced by the base directory of the filename
-- and the resulting text is returned.
function convert_ORIGIN_in_runpath (filename : String; runpath : String) return String;
private
-- helper for create_pidfile
function Get_PID return Integer;
pragma Import (C, Get_PID, "getpid");
end File_Operations;
| 36.933333 | 93 | 0.714801 |
3197158b700f75b823660cd913b3dc03d5de2384 | 20,406 | ads | Ada | source/strings/a-uscama.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 33 | 2015-04-04T09:19:36.000Z | 2021-11-10T05:33:34.000Z | source/strings/a-uscama.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 8 | 2017-11-14T13:05:07.000Z | 2018-08-09T15:28:49.000Z | source/strings/a-uscama.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 9 | 2015-02-03T17:09:53.000Z | 2021-11-12T01:16:05.000Z | pragma License (Unrestricted);
-- implementation unit, translated from UnicodeData.txt (13, 14)
package Ada.UCD.Simple_Case_Mapping is
pragma Pure;
L_Total : constant := 1043;
U_Total : constant := 1051;
type Run_Length_8 is mod 2 ** 8;
type Compressed_Item_Type is record
Start : UCS_2;
Length : Run_Length_8;
Diff : Difference_8;
end record;
pragma Suppress_Initialization (Compressed_Item_Type);
for Compressed_Item_Type'Size use 32; -- 16 + 8 + 8
for Compressed_Item_Type use record
Start at 0 range 0 .. 15;
Length at 0 range 16 .. 23;
Diff at 0 range 24 .. 31;
end record;
type Compressed_Type is array (Positive range <>) of Compressed_Item_Type;
pragma Suppress_Initialization (Compressed_Type);
for Compressed_Type'Component_Size use 32;
subtype SL_Table_XXXX_Type is Map_16x1_Type (1 .. 617);
subtype SL_Table_XXXX_Compressed_Type is Compressed_Type (1 .. 32);
subtype SL_Table_1XXXX_Compressed_Type is Compressed_Type (1 .. 1);
subtype DL_Table_XXXX_Type is Map_16x1_Type (1 .. 10);
subtype DU_Table_XXXX_Type is Map_16x1_Type (1 .. 18);
SL_Table_XXXX : constant SL_Table_XXXX_Type := (
(16#0100#, 16#0101#),
(16#0102#, 16#0103#),
(16#0104#, 16#0105#),
(16#0106#, 16#0107#),
(16#0108#, 16#0109#),
(16#010A#, 16#010B#),
(16#010C#, 16#010D#),
(16#010E#, 16#010F#),
(16#0110#, 16#0111#),
(16#0112#, 16#0113#),
(16#0114#, 16#0115#),
(16#0116#, 16#0117#),
(16#0118#, 16#0119#),
(16#011A#, 16#011B#),
(16#011C#, 16#011D#),
(16#011E#, 16#011F#),
(16#0120#, 16#0121#),
(16#0122#, 16#0123#),
(16#0124#, 16#0125#),
(16#0126#, 16#0127#),
(16#0128#, 16#0129#),
(16#012A#, 16#012B#),
(16#012C#, 16#012D#),
(16#012E#, 16#012F#),
(16#0132#, 16#0133#),
(16#0134#, 16#0135#),
(16#0136#, 16#0137#),
(16#0139#, 16#013A#),
(16#013B#, 16#013C#),
(16#013D#, 16#013E#),
(16#013F#, 16#0140#),
(16#0141#, 16#0142#),
(16#0143#, 16#0144#),
(16#0145#, 16#0146#),
(16#0147#, 16#0148#),
(16#014A#, 16#014B#),
(16#014C#, 16#014D#),
(16#014E#, 16#014F#),
(16#0150#, 16#0151#),
(16#0152#, 16#0153#),
(16#0154#, 16#0155#),
(16#0156#, 16#0157#),
(16#0158#, 16#0159#),
(16#015A#, 16#015B#),
(16#015C#, 16#015D#),
(16#015E#, 16#015F#),
(16#0160#, 16#0161#),
(16#0162#, 16#0163#),
(16#0164#, 16#0165#),
(16#0166#, 16#0167#),
(16#0168#, 16#0169#),
(16#016A#, 16#016B#),
(16#016C#, 16#016D#),
(16#016E#, 16#016F#),
(16#0170#, 16#0171#),
(16#0172#, 16#0173#),
(16#0174#, 16#0175#),
(16#0176#, 16#0177#),
(16#0178#, 16#00FF#),
(16#0179#, 16#017A#),
(16#017B#, 16#017C#),
(16#017D#, 16#017E#),
(16#0181#, 16#0253#),
(16#0182#, 16#0183#),
(16#0184#, 16#0185#),
(16#0186#, 16#0254#),
(16#0187#, 16#0188#),
(16#0189#, 16#0256#),
(16#018A#, 16#0257#),
(16#018B#, 16#018C#),
(16#018E#, 16#01DD#),
(16#018F#, 16#0259#),
(16#0190#, 16#025B#),
(16#0191#, 16#0192#),
(16#0193#, 16#0260#),
(16#0194#, 16#0263#),
(16#0196#, 16#0269#),
(16#0197#, 16#0268#),
(16#0198#, 16#0199#),
(16#019C#, 16#026F#),
(16#019D#, 16#0272#),
(16#019F#, 16#0275#),
(16#01A0#, 16#01A1#),
(16#01A2#, 16#01A3#),
(16#01A4#, 16#01A5#),
(16#01A6#, 16#0280#),
(16#01A7#, 16#01A8#),
(16#01A9#, 16#0283#),
(16#01AC#, 16#01AD#),
(16#01AE#, 16#0288#),
(16#01AF#, 16#01B0#),
(16#01B1#, 16#028A#),
(16#01B2#, 16#028B#),
(16#01B3#, 16#01B4#),
(16#01B5#, 16#01B6#),
(16#01B7#, 16#0292#),
(16#01B8#, 16#01B9#),
(16#01BC#, 16#01BD#),
(16#01C4#, 16#01C6#),
(16#01C7#, 16#01C9#),
(16#01CA#, 16#01CC#),
(16#01CD#, 16#01CE#),
(16#01CF#, 16#01D0#),
(16#01D1#, 16#01D2#),
(16#01D3#, 16#01D4#),
(16#01D5#, 16#01D6#),
(16#01D7#, 16#01D8#),
(16#01D9#, 16#01DA#),
(16#01DB#, 16#01DC#),
(16#01DE#, 16#01DF#),
(16#01E0#, 16#01E1#),
(16#01E2#, 16#01E3#),
(16#01E4#, 16#01E5#),
(16#01E6#, 16#01E7#),
(16#01E8#, 16#01E9#),
(16#01EA#, 16#01EB#),
(16#01EC#, 16#01ED#),
(16#01EE#, 16#01EF#),
(16#01F1#, 16#01F3#),
(16#01F4#, 16#01F5#),
(16#01F6#, 16#0195#),
(16#01F7#, 16#01BF#),
(16#01F8#, 16#01F9#),
(16#01FA#, 16#01FB#),
(16#01FC#, 16#01FD#),
(16#01FE#, 16#01FF#),
(16#0200#, 16#0201#),
(16#0202#, 16#0203#),
(16#0204#, 16#0205#),
(16#0206#, 16#0207#),
(16#0208#, 16#0209#),
(16#020A#, 16#020B#),
(16#020C#, 16#020D#),
(16#020E#, 16#020F#),
(16#0210#, 16#0211#),
(16#0212#, 16#0213#),
(16#0214#, 16#0215#),
(16#0216#, 16#0217#),
(16#0218#, 16#0219#),
(16#021A#, 16#021B#),
(16#021C#, 16#021D#),
(16#021E#, 16#021F#),
(16#0220#, 16#019E#),
(16#0222#, 16#0223#),
(16#0224#, 16#0225#),
(16#0226#, 16#0227#),
(16#0228#, 16#0229#),
(16#022A#, 16#022B#),
(16#022C#, 16#022D#),
(16#022E#, 16#022F#),
(16#0230#, 16#0231#),
(16#0232#, 16#0233#),
(16#023A#, 16#2C65#),
(16#023B#, 16#023C#),
(16#023D#, 16#019A#),
(16#023E#, 16#2C66#),
(16#0241#, 16#0242#),
(16#0243#, 16#0180#),
(16#0244#, 16#0289#),
(16#0245#, 16#028C#),
(16#0246#, 16#0247#),
(16#0248#, 16#0249#),
(16#024A#, 16#024B#),
(16#024C#, 16#024D#),
(16#024E#, 16#024F#),
(16#0370#, 16#0371#),
(16#0372#, 16#0373#),
(16#0376#, 16#0377#),
(16#0386#, 16#03AC#),
(16#038C#, 16#03CC#),
(16#03CF#, 16#03D7#),
(16#03D8#, 16#03D9#),
(16#03DA#, 16#03DB#),
(16#03DC#, 16#03DD#),
(16#03DE#, 16#03DF#),
(16#03E0#, 16#03E1#),
(16#03E2#, 16#03E3#),
(16#03E4#, 16#03E5#),
(16#03E6#, 16#03E7#),
(16#03E8#, 16#03E9#),
(16#03EA#, 16#03EB#),
(16#03EC#, 16#03ED#),
(16#03EE#, 16#03EF#),
(16#03F7#, 16#03F8#),
(16#03F9#, 16#03F2#),
(16#03FA#, 16#03FB#),
(16#03FD#, 16#037B#),
(16#03FE#, 16#037C#),
(16#03FF#, 16#037D#),
(16#0460#, 16#0461#),
(16#0462#, 16#0463#),
(16#0464#, 16#0465#),
(16#0466#, 16#0467#),
(16#0468#, 16#0469#),
(16#046A#, 16#046B#),
(16#046C#, 16#046D#),
(16#046E#, 16#046F#),
(16#0470#, 16#0471#),
(16#0472#, 16#0473#),
(16#0474#, 16#0475#),
(16#0476#, 16#0477#),
(16#0478#, 16#0479#),
(16#047A#, 16#047B#),
(16#047C#, 16#047D#),
(16#047E#, 16#047F#),
(16#0480#, 16#0481#),
(16#048A#, 16#048B#),
(16#048C#, 16#048D#),
(16#048E#, 16#048F#),
(16#0490#, 16#0491#),
(16#0492#, 16#0493#),
(16#0494#, 16#0495#),
(16#0496#, 16#0497#),
(16#0498#, 16#0499#),
(16#049A#, 16#049B#),
(16#049C#, 16#049D#),
(16#049E#, 16#049F#),
(16#04A0#, 16#04A1#),
(16#04A2#, 16#04A3#),
(16#04A4#, 16#04A5#),
(16#04A6#, 16#04A7#),
(16#04A8#, 16#04A9#),
(16#04AA#, 16#04AB#),
(16#04AC#, 16#04AD#),
(16#04AE#, 16#04AF#),
(16#04B0#, 16#04B1#),
(16#04B2#, 16#04B3#),
(16#04B4#, 16#04B5#),
(16#04B6#, 16#04B7#),
(16#04B8#, 16#04B9#),
(16#04BA#, 16#04BB#),
(16#04BC#, 16#04BD#),
(16#04BE#, 16#04BF#),
(16#04C0#, 16#04CF#),
(16#04C1#, 16#04C2#),
(16#04C3#, 16#04C4#),
(16#04C5#, 16#04C6#),
(16#04C7#, 16#04C8#),
(16#04C9#, 16#04CA#),
(16#04CB#, 16#04CC#),
(16#04CD#, 16#04CE#),
(16#04D0#, 16#04D1#),
(16#04D2#, 16#04D3#),
(16#04D4#, 16#04D5#),
(16#04D6#, 16#04D7#),
(16#04D8#, 16#04D9#),
(16#04DA#, 16#04DB#),
(16#04DC#, 16#04DD#),
(16#04DE#, 16#04DF#),
(16#04E0#, 16#04E1#),
(16#04E2#, 16#04E3#),
(16#04E4#, 16#04E5#),
(16#04E6#, 16#04E7#),
(16#04E8#, 16#04E9#),
(16#04EA#, 16#04EB#),
(16#04EC#, 16#04ED#),
(16#04EE#, 16#04EF#),
(16#04F0#, 16#04F1#),
(16#04F2#, 16#04F3#),
(16#04F4#, 16#04F5#),
(16#04F6#, 16#04F7#),
(16#04F8#, 16#04F9#),
(16#04FA#, 16#04FB#),
(16#04FC#, 16#04FD#),
(16#04FE#, 16#04FF#),
(16#0500#, 16#0501#),
(16#0502#, 16#0503#),
(16#0504#, 16#0505#),
(16#0506#, 16#0507#),
(16#0508#, 16#0509#),
(16#050A#, 16#050B#),
(16#050C#, 16#050D#),
(16#050E#, 16#050F#),
(16#0510#, 16#0511#),
(16#0512#, 16#0513#),
(16#0514#, 16#0515#),
(16#0516#, 16#0517#),
(16#0518#, 16#0519#),
(16#051A#, 16#051B#),
(16#051C#, 16#051D#),
(16#051E#, 16#051F#),
(16#0520#, 16#0521#),
(16#0522#, 16#0523#),
(16#0524#, 16#0525#),
(16#0526#, 16#0527#),
(16#10A0#, 16#2D00#),
(16#10A1#, 16#2D01#),
(16#10A2#, 16#2D02#),
(16#10A3#, 16#2D03#),
(16#10A4#, 16#2D04#),
(16#10A5#, 16#2D05#),
(16#10A6#, 16#2D06#),
(16#10A7#, 16#2D07#),
(16#10A8#, 16#2D08#),
(16#10A9#, 16#2D09#),
(16#10AA#, 16#2D0A#),
(16#10AB#, 16#2D0B#),
(16#10AC#, 16#2D0C#),
(16#10AD#, 16#2D0D#),
(16#10AE#, 16#2D0E#),
(16#10AF#, 16#2D0F#),
(16#10B0#, 16#2D10#),
(16#10B1#, 16#2D11#),
(16#10B2#, 16#2D12#),
(16#10B3#, 16#2D13#),
(16#10B4#, 16#2D14#),
(16#10B5#, 16#2D15#),
(16#10B6#, 16#2D16#),
(16#10B7#, 16#2D17#),
(16#10B8#, 16#2D18#),
(16#10B9#, 16#2D19#),
(16#10BA#, 16#2D1A#),
(16#10BB#, 16#2D1B#),
(16#10BC#, 16#2D1C#),
(16#10BD#, 16#2D1D#),
(16#10BE#, 16#2D1E#),
(16#10BF#, 16#2D1F#),
(16#10C0#, 16#2D20#),
(16#10C1#, 16#2D21#),
(16#10C2#, 16#2D22#),
(16#10C3#, 16#2D23#),
(16#10C4#, 16#2D24#),
(16#10C5#, 16#2D25#),
(16#10C7#, 16#2D27#),
(16#10CD#, 16#2D2D#),
(16#1E00#, 16#1E01#),
(16#1E02#, 16#1E03#),
(16#1E04#, 16#1E05#),
(16#1E06#, 16#1E07#),
(16#1E08#, 16#1E09#),
(16#1E0A#, 16#1E0B#),
(16#1E0C#, 16#1E0D#),
(16#1E0E#, 16#1E0F#),
(16#1E10#, 16#1E11#),
(16#1E12#, 16#1E13#),
(16#1E14#, 16#1E15#),
(16#1E16#, 16#1E17#),
(16#1E18#, 16#1E19#),
(16#1E1A#, 16#1E1B#),
(16#1E1C#, 16#1E1D#),
(16#1E1E#, 16#1E1F#),
(16#1E20#, 16#1E21#),
(16#1E22#, 16#1E23#),
(16#1E24#, 16#1E25#),
(16#1E26#, 16#1E27#),
(16#1E28#, 16#1E29#),
(16#1E2A#, 16#1E2B#),
(16#1E2C#, 16#1E2D#),
(16#1E2E#, 16#1E2F#),
(16#1E30#, 16#1E31#),
(16#1E32#, 16#1E33#),
(16#1E34#, 16#1E35#),
(16#1E36#, 16#1E37#),
(16#1E38#, 16#1E39#),
(16#1E3A#, 16#1E3B#),
(16#1E3C#, 16#1E3D#),
(16#1E3E#, 16#1E3F#),
(16#1E40#, 16#1E41#),
(16#1E42#, 16#1E43#),
(16#1E44#, 16#1E45#),
(16#1E46#, 16#1E47#),
(16#1E48#, 16#1E49#),
(16#1E4A#, 16#1E4B#),
(16#1E4C#, 16#1E4D#),
(16#1E4E#, 16#1E4F#),
(16#1E50#, 16#1E51#),
(16#1E52#, 16#1E53#),
(16#1E54#, 16#1E55#),
(16#1E56#, 16#1E57#),
(16#1E58#, 16#1E59#),
(16#1E5A#, 16#1E5B#),
(16#1E5C#, 16#1E5D#),
(16#1E5E#, 16#1E5F#),
(16#1E60#, 16#1E61#),
(16#1E62#, 16#1E63#),
(16#1E64#, 16#1E65#),
(16#1E66#, 16#1E67#),
(16#1E68#, 16#1E69#),
(16#1E6A#, 16#1E6B#),
(16#1E6C#, 16#1E6D#),
(16#1E6E#, 16#1E6F#),
(16#1E70#, 16#1E71#),
(16#1E72#, 16#1E73#),
(16#1E74#, 16#1E75#),
(16#1E76#, 16#1E77#),
(16#1E78#, 16#1E79#),
(16#1E7A#, 16#1E7B#),
(16#1E7C#, 16#1E7D#),
(16#1E7E#, 16#1E7F#),
(16#1E80#, 16#1E81#),
(16#1E82#, 16#1E83#),
(16#1E84#, 16#1E85#),
(16#1E86#, 16#1E87#),
(16#1E88#, 16#1E89#),
(16#1E8A#, 16#1E8B#),
(16#1E8C#, 16#1E8D#),
(16#1E8E#, 16#1E8F#),
(16#1E90#, 16#1E91#),
(16#1E92#, 16#1E93#),
(16#1E94#, 16#1E95#),
(16#1EA0#, 16#1EA1#),
(16#1EA2#, 16#1EA3#),
(16#1EA4#, 16#1EA5#),
(16#1EA6#, 16#1EA7#),
(16#1EA8#, 16#1EA9#),
(16#1EAA#, 16#1EAB#),
(16#1EAC#, 16#1EAD#),
(16#1EAE#, 16#1EAF#),
(16#1EB0#, 16#1EB1#),
(16#1EB2#, 16#1EB3#),
(16#1EB4#, 16#1EB5#),
(16#1EB6#, 16#1EB7#),
(16#1EB8#, 16#1EB9#),
(16#1EBA#, 16#1EBB#),
(16#1EBC#, 16#1EBD#),
(16#1EBE#, 16#1EBF#),
(16#1EC0#, 16#1EC1#),
(16#1EC2#, 16#1EC3#),
(16#1EC4#, 16#1EC5#),
(16#1EC6#, 16#1EC7#),
(16#1EC8#, 16#1EC9#),
(16#1ECA#, 16#1ECB#),
(16#1ECC#, 16#1ECD#),
(16#1ECE#, 16#1ECF#),
(16#1ED0#, 16#1ED1#),
(16#1ED2#, 16#1ED3#),
(16#1ED4#, 16#1ED5#),
(16#1ED6#, 16#1ED7#),
(16#1ED8#, 16#1ED9#),
(16#1EDA#, 16#1EDB#),
(16#1EDC#, 16#1EDD#),
(16#1EDE#, 16#1EDF#),
(16#1EE0#, 16#1EE1#),
(16#1EE2#, 16#1EE3#),
(16#1EE4#, 16#1EE5#),
(16#1EE6#, 16#1EE7#),
(16#1EE8#, 16#1EE9#),
(16#1EEA#, 16#1EEB#),
(16#1EEC#, 16#1EED#),
(16#1EEE#, 16#1EEF#),
(16#1EF0#, 16#1EF1#),
(16#1EF2#, 16#1EF3#),
(16#1EF4#, 16#1EF5#),
(16#1EF6#, 16#1EF7#),
(16#1EF8#, 16#1EF9#),
(16#1EFA#, 16#1EFB#),
(16#1EFC#, 16#1EFD#),
(16#1EFE#, 16#1EFF#),
(16#1F59#, 16#1F51#),
(16#1F5B#, 16#1F53#),
(16#1F5D#, 16#1F55#),
(16#1F5F#, 16#1F57#),
(16#1FBC#, 16#1FB3#),
(16#1FCC#, 16#1FC3#),
(16#1FEC#, 16#1FE5#),
(16#1FFC#, 16#1FF3#),
(16#2132#, 16#214E#),
(16#2183#, 16#2184#),
(16#2C60#, 16#2C61#),
(16#2C62#, 16#026B#),
(16#2C63#, 16#1D7D#),
(16#2C64#, 16#027D#),
(16#2C67#, 16#2C68#),
(16#2C69#, 16#2C6A#),
(16#2C6B#, 16#2C6C#),
(16#2C6D#, 16#0251#),
(16#2C6E#, 16#0271#),
(16#2C6F#, 16#0250#),
(16#2C70#, 16#0252#),
(16#2C72#, 16#2C73#),
(16#2C75#, 16#2C76#),
(16#2C7E#, 16#023F#),
(16#2C7F#, 16#0240#),
(16#2C80#, 16#2C81#),
(16#2C82#, 16#2C83#),
(16#2C84#, 16#2C85#),
(16#2C86#, 16#2C87#),
(16#2C88#, 16#2C89#),
(16#2C8A#, 16#2C8B#),
(16#2C8C#, 16#2C8D#),
(16#2C8E#, 16#2C8F#),
(16#2C90#, 16#2C91#),
(16#2C92#, 16#2C93#),
(16#2C94#, 16#2C95#),
(16#2C96#, 16#2C97#),
(16#2C98#, 16#2C99#),
(16#2C9A#, 16#2C9B#),
(16#2C9C#, 16#2C9D#),
(16#2C9E#, 16#2C9F#),
(16#2CA0#, 16#2CA1#),
(16#2CA2#, 16#2CA3#),
(16#2CA4#, 16#2CA5#),
(16#2CA6#, 16#2CA7#),
(16#2CA8#, 16#2CA9#),
(16#2CAA#, 16#2CAB#),
(16#2CAC#, 16#2CAD#),
(16#2CAE#, 16#2CAF#),
(16#2CB0#, 16#2CB1#),
(16#2CB2#, 16#2CB3#),
(16#2CB4#, 16#2CB5#),
(16#2CB6#, 16#2CB7#),
(16#2CB8#, 16#2CB9#),
(16#2CBA#, 16#2CBB#),
(16#2CBC#, 16#2CBD#),
(16#2CBE#, 16#2CBF#),
(16#2CC0#, 16#2CC1#),
(16#2CC2#, 16#2CC3#),
(16#2CC4#, 16#2CC5#),
(16#2CC6#, 16#2CC7#),
(16#2CC8#, 16#2CC9#),
(16#2CCA#, 16#2CCB#),
(16#2CCC#, 16#2CCD#),
(16#2CCE#, 16#2CCF#),
(16#2CD0#, 16#2CD1#),
(16#2CD2#, 16#2CD3#),
(16#2CD4#, 16#2CD5#),
(16#2CD6#, 16#2CD7#),
(16#2CD8#, 16#2CD9#),
(16#2CDA#, 16#2CDB#),
(16#2CDC#, 16#2CDD#),
(16#2CDE#, 16#2CDF#),
(16#2CE0#, 16#2CE1#),
(16#2CE2#, 16#2CE3#),
(16#2CEB#, 16#2CEC#),
(16#2CED#, 16#2CEE#),
(16#2CF2#, 16#2CF3#),
(16#A640#, 16#A641#),
(16#A642#, 16#A643#),
(16#A644#, 16#A645#),
(16#A646#, 16#A647#),
(16#A648#, 16#A649#),
(16#A64A#, 16#A64B#),
(16#A64C#, 16#A64D#),
(16#A64E#, 16#A64F#),
(16#A650#, 16#A651#),
(16#A652#, 16#A653#),
(16#A654#, 16#A655#),
(16#A656#, 16#A657#),
(16#A658#, 16#A659#),
(16#A65A#, 16#A65B#),
(16#A65C#, 16#A65D#),
(16#A65E#, 16#A65F#),
(16#A660#, 16#A661#),
(16#A662#, 16#A663#),
(16#A664#, 16#A665#),
(16#A666#, 16#A667#),
(16#A668#, 16#A669#),
(16#A66A#, 16#A66B#),
(16#A66C#, 16#A66D#),
(16#A680#, 16#A681#),
(16#A682#, 16#A683#),
(16#A684#, 16#A685#),
(16#A686#, 16#A687#),
(16#A688#, 16#A689#),
(16#A68A#, 16#A68B#),
(16#A68C#, 16#A68D#),
(16#A68E#, 16#A68F#),
(16#A690#, 16#A691#),
(16#A692#, 16#A693#),
(16#A694#, 16#A695#),
(16#A696#, 16#A697#),
(16#A722#, 16#A723#),
(16#A724#, 16#A725#),
(16#A726#, 16#A727#),
(16#A728#, 16#A729#),
(16#A72A#, 16#A72B#),
(16#A72C#, 16#A72D#),
(16#A72E#, 16#A72F#),
(16#A732#, 16#A733#),
(16#A734#, 16#A735#),
(16#A736#, 16#A737#),
(16#A738#, 16#A739#),
(16#A73A#, 16#A73B#),
(16#A73C#, 16#A73D#),
(16#A73E#, 16#A73F#),
(16#A740#, 16#A741#),
(16#A742#, 16#A743#),
(16#A744#, 16#A745#),
(16#A746#, 16#A747#),
(16#A748#, 16#A749#),
(16#A74A#, 16#A74B#),
(16#A74C#, 16#A74D#),
(16#A74E#, 16#A74F#),
(16#A750#, 16#A751#),
(16#A752#, 16#A753#),
(16#A754#, 16#A755#),
(16#A756#, 16#A757#),
(16#A758#, 16#A759#),
(16#A75A#, 16#A75B#),
(16#A75C#, 16#A75D#),
(16#A75E#, 16#A75F#),
(16#A760#, 16#A761#),
(16#A762#, 16#A763#),
(16#A764#, 16#A765#),
(16#A766#, 16#A767#),
(16#A768#, 16#A769#),
(16#A76A#, 16#A76B#),
(16#A76C#, 16#A76D#),
(16#A76E#, 16#A76F#),
(16#A779#, 16#A77A#),
(16#A77B#, 16#A77C#),
(16#A77D#, 16#1D79#),
(16#A77E#, 16#A77F#),
(16#A780#, 16#A781#),
(16#A782#, 16#A783#),
(16#A784#, 16#A785#),
(16#A786#, 16#A787#),
(16#A78B#, 16#A78C#),
(16#A78D#, 16#0265#),
(16#A790#, 16#A791#),
(16#A792#, 16#A793#),
(16#A7A0#, 16#A7A1#),
(16#A7A2#, 16#A7A3#),
(16#A7A4#, 16#A7A5#),
(16#A7A6#, 16#A7A7#),
(16#A7A8#, 16#A7A9#),
(16#A7AA#, 16#0266#));
SL_Table_XXXX_Compressed : constant SL_Table_XXXX_Compressed_Type := (
(16#0041#, 26, 32),
(16#00C0#, 23, 32),
(16#00D8#, 7, 32),
(16#0388#, 3, 37),
(16#038E#, 2, 63),
(16#0391#, 17, 32),
(16#03A3#, 9, 32),
(16#0400#, 16, 80),
(16#0410#, 32, 32),
(16#0531#, 38, 48),
(16#1F08#, 8, -8),
(16#1F18#, 6, -8),
(16#1F28#, 8, -8),
(16#1F38#, 8, -8),
(16#1F48#, 6, -8),
(16#1F68#, 8, -8),
(16#1F88#, 8, -8),
(16#1F98#, 8, -8),
(16#1FA8#, 8, -8),
(16#1FB8#, 2, -8),
(16#1FBA#, 2, -74),
(16#1FC8#, 4, -86),
(16#1FD8#, 2, -8),
(16#1FDA#, 2, -100),
(16#1FE8#, 2, -8),
(16#1FEA#, 2, -112),
(16#1FF8#, 2, -128),
(16#1FFA#, 2, -126),
(16#2160#, 16, 16),
(16#24B6#, 26, 26),
(16#2C00#, 47, 48),
(16#FF21#, 26, 32));
SL_Table_1XXXX_Compressed : constant SL_Table_1XXXX_Compressed_Type := (
1 => (16#0400#, 40, 40));
DL_Table_XXXX : constant DL_Table_XXXX_Type := (
(16#0130#, 16#0069#),
(16#01C5#, 16#01C6#),
(16#01C8#, 16#01C9#),
(16#01CB#, 16#01CC#),
(16#01F2#, 16#01F3#),
(16#03F4#, 16#03B8#),
(16#1E9E#, 16#00DF#),
(16#2126#, 16#03C9#),
(16#212A#, 16#006B#),
(16#212B#, 16#00E5#));
DU_Table_XXXX : constant DU_Table_XXXX_Type := (
(16#00B5#, 16#039C#),
(16#0131#, 16#0049#),
(16#017F#, 16#0053#),
(16#01C5#, 16#01C4#),
(16#01C8#, 16#01C7#),
(16#01CB#, 16#01CA#),
(16#01F2#, 16#01F1#),
(16#0345#, 16#0399#),
(16#03C2#, 16#03A3#),
(16#03D0#, 16#0392#),
(16#03D1#, 16#0398#),
(16#03D5#, 16#03A6#),
(16#03D6#, 16#03A0#),
(16#03F0#, 16#039A#),
(16#03F1#, 16#03A1#),
(16#03F5#, 16#0395#),
(16#1E9B#, 16#1E60#),
(16#1FBE#, 16#0399#));
end Ada.UCD.Simple_Case_Mapping;
| 28.224066 | 77 | 0.447662 |
29323ab12b0d313c00a0098a84db03c0bfc87e15 | 3,632 | ads | Ada | source/amf/uml/amf-uml-value_specifications-hash.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/uml/amf-uml-value_specifications-hash.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/uml/amf-uml-value_specifications-hash.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Elements.Generic_Hash;
function AMF.UML.Value_Specifications.Hash is
new AMF.Elements.Generic_Hash (UML_Value_Specification, UML_Value_Specification_Access);
| 72.64 | 90 | 0.405837 |
41a756af6a008c051f7611d182789575275eb9ae | 6,555 | adb | Ada | tools/mgrep-scanner.adb | stcarrez/ada-mail | 49960f92fb454d7d1805d70c20e380272045a07a | [
"Apache-2.0"
] | 2 | 2020-04-18T12:42:11.000Z | 2020-09-04T18:32:42.000Z | tools/mgrep-scanner.adb | stcarrez/ada-mail | 49960f92fb454d7d1805d70c20e380272045a07a | [
"Apache-2.0"
] | 1 | 2020-04-20T15:06:02.000Z | 2020-04-20T15:06:02.000Z | tools/mgrep-scanner.adb | stcarrez/ada-mail | 49960f92fb454d7d1805d70c20e380272045a07a | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- mgrep-scanner -- Scan a directory and parse mail
-- Copyright (C) 2020 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Interfaces.C.Strings;
with Ada.Directories;
with Ada.IO_Exceptions;
with Mail.Parsers;
with Util.Systems.Types;
with Util.Systems.Os;
with Util.Streams.Raw;
with Util.Log.Loggers;
package body Mgrep.Scanner is
use Ada.Strings.Unbounded;
use Ada.Directories;
use type Util.Systems.Types.File_Type;
Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("Mgrep.Scanner");
procedure Add_Directory (Scanner : in out Scanner_Type;
Path : in String) is
begin
Util.Concurrent.Counters.Increment (Scanner.Scan_Dir_Count);
Scanner.Directories.Append (Path);
end Add_Directory;
procedure Add_File (Scanner : in out Scanner_Type;
Path : in String) is
Work : Work_Type;
begin
Util.Concurrent.Counters.Increment (Scanner.Job_Count);
Util.Concurrent.Counters.Increment (Scanner.Scan_File_Count);
Work.Path := To_Unbounded_String (Path);
Work.Kind := SCAN_MAIL;
Work.Scanner := Scanner.Self;
Scanner.Manager.Execute (Work);
end Add_File;
procedure Scan_File (Scanner : in out Scanner_Type;
Path : in String) is
File : aliased Util.Streams.Raw.Raw_Stream;
-- Text : aliased Util.Streams.Texts.Reader_Stream;
Matcher : aliased Mgrep.Matcher.Mail_Processor (Scanner.Rule);
Parser : Mail.Parsers.Parser_Type;
Fd : Util.Systems.Os.File_Type;
P : Interfaces.C.Strings.chars_ptr;
begin
Log.Info ("Scanning mail {0}", Path);
Util.Concurrent.Counters.Increment (Scanner.File_Count);
P := Interfaces.C.Strings.New_String (Path);
Fd := Util.Systems.Os.Sys_Open (P, Util.Systems.Os.O_RDONLY, 8#600#);
Interfaces.C.Strings.Free (P);
if Fd = Util.Systems.Os.NO_FILE then
raise Ada.IO_Exceptions.Name_Error with Path;
end if;
File.Initialize (Fd);
-- Text.Initialize (File'Unchecked_Access);
Parser.Parse (File'Unchecked_Access, Matcher'Access);
exception
when E : others =>
Log.Error ("Exception: " & Ada.Exceptions.Exception_Message (E));
end Scan_File;
procedure Scan_Directory (Scanner : in out Scanner_Type;
Path : in String) is
Search_Filter : constant Ada.Directories.Filter_Type
:= (Ada.Directories.Ordinary_File => True,
Ada.Directories.Directory => True,
Ada.Directories.Special_File => False);
Search : Ada.Directories.Search_Type;
Ent : Ada.Directories.Directory_Entry_Type;
Is_Zero : Boolean;
begin
Log.Info ("Scanning directory {0}", Path);
Util.Concurrent.Counters.Increment (Scanner.Dir_Count);
Ada.Directories.Start_Search (Search, Directory => Path,
Pattern => "*", Filter => Search_Filter);
while Ada.Directories.More_Entries (Search) loop
Ada.Directories.Get_Next_Entry (Search, Ent);
declare
Name : constant String := Ada.Directories.Simple_Name (Ent);
Kind : constant File_Kind := Ada.Directories.Kind (Ent);
Fpath : constant String := Ada.Directories.Full_Name (Ent);
begin
if Kind /= Ada.Directories.Directory then
Scanner.Add_File (Fpath);
elsif Name /= "." and then Name /= ".." then
Scanner.Add_Directory (Fpath);
end if;
end;
end loop;
Util.Concurrent.Counters.Decrement (Scanner.Scan_Dir_Count, Is_Zero);
end Scan_Directory;
procedure Start (Scanner : in out Scanner_Type) is
begin
Scanner.Manager.Start (Autostop => True);
end Start;
procedure Process (Scanner : in out Scanner_Type;
Done : out Boolean) is
begin
while not Scanner.Directories.Is_Empty loop
declare
Path : constant String := Scanner.Directories.Last_Element;
begin
Scanner.Directories.Delete_Last;
Scanner.Scan_Directory (Path);
exit when Scanner.Directories.Is_Empty;
exit when Scanner.Manager.Get_Count > QUEUE_SIZE * 3 / 4;
end;
end loop;
Done := Scanner.Directories.Is_Empty and then Scanner.Manager.Get_Count = 0
and then Util.Concurrent.Counters.Value (Scanner.Job_Count) = 0;
end Process;
procedure Stop (Scanner : in out Scanner_Type) is
begin
Scanner.Manager.Wait;
Scanner.Manager.Stop;
end Stop;
function Get_File_Count (Scanner : in Scanner_Type) return Natural is
begin
return Util.Concurrent.Counters.Value (Scanner.File_Count);
end Get_File_Count;
function Get_Directory_Count (Scanner : in Scanner_Type) return Natural is
begin
return Util.Concurrent.Counters.Value (Scanner.Dir_Count);
end Get_Directory_Count;
procedure Execute (Work : in out Work_Type) is
begin
case Work.Kind is
when SCAN_DIRECTORY =>
Work.Scanner.Scan_Directory (To_String (Work.Path));
when SCAN_MAIL =>
Work.Scanner.Scan_File (To_String (Work.Path));
end case;
Util.Concurrent.Counters.Decrement (Work.Scanner.Job_Count);
end Execute;
procedure Error (Work : in out Work_Type;
Ex : in Ada.Exceptions.Exception_Occurrence) is
begin
Log.Error ("Error while executing work", Ex);
Util.Concurrent.Counters.Decrement (Work.Scanner.Job_Count);
end Error;
overriding
procedure Initialize (Scanner : in out Scanner_Type) is
begin
Scanner.Self := Scanner'Unrestricted_Access;
end Initialize;
end Mgrep.Scanner;
| 36.21547 | 91 | 0.640427 |
0eccc4f457a32af4b9d03d2e62fe5318dd55af5c | 183 | ads | Ada | src/generator-markdown.ads | bracke/websitegenerator | d3aee456f9f0b84e1d4e7030520fac5d8e6c8a1b | [
"CC0-1.0"
] | 1 | 2022-02-14T11:45:43.000Z | 2022-02-14T11:45:43.000Z | src/generator-markdown.ads | bracke/websitegenerator | d3aee456f9f0b84e1d4e7030520fac5d8e6c8a1b | [
"CC0-1.0"
] | null | null | null | src/generator-markdown.ads | bracke/websitegenerator | d3aee456f9f0b84e1d4e7030520fac5d8e6c8a1b | [
"CC0-1.0"
] | null | null | null | with Ada.Streams;
with Ada.Streams.Stream_IO;
package Generator.Markdown is
procedure To_HTML (Filein : in out Ada.Streams.Stream_IO.File_Type);
private
end Generator.Markdown; | 18.3 | 71 | 0.79235 |
29f1fee8281ac7ee5f96e0d8c0f09c761eeba421 | 7,011 | adb | Ada | Ada95/samples/ncurses2-getopt.adb | Ancient-Rom/android_external_libncurses | cfb80399910df8d55602d879d5cf0bc5ceaa2f89 | [
"X11"
] | 1,167 | 2017-08-21T21:21:24.000Z | 2022-03-31T15:42:10.000Z | Ada95/samples/ncurses2-getopt.adb | thabongshot/ncurses-5.9-mac | 8475dcacfcad55dda5e69f3c8d89de0264fc4429 | [
"DOC",
"Unlicense"
] | 374 | 2015-11-03T12:37:22.000Z | 2021-12-17T14:18:08.000Z | Ada95/samples/ncurses2-getopt.adb | thabongshot/ncurses-5.9-mac | 8475dcacfcad55dda5e69f3c8d89de0264fc4429 | [
"DOC",
"Unlicense"
] | 96 | 2015-11-22T07:47:26.000Z | 2022-01-20T19:52:19.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding Samples --
-- --
-- ncurses --
-- --
-- B O D Y --
-- --
------------------------------------------------------------------------------
-- Copyright (c) 2000-2008,2011 Free Software Foundation, Inc. --
-- --
-- Permission is hereby granted, free of charge, to any person obtaining a --
-- copy of this software and associated documentation files (the --
-- "Software"), to deal in the Software without restriction, including --
-- without limitation the rights to use, copy, modify, merge, publish, --
-- distribute, distribute with modifications, sublicense, and/or sell --
-- copies of the Software, and to permit persons to whom the Software is --
-- furnished to do so, subject to the following conditions: --
-- --
-- The above copyright notice and this permission notice shall be included --
-- in all copies or substantial portions of the Software. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS --
-- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF --
-- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. --
-- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, --
-- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR --
-- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR --
-- THE USE OR OTHER DEALINGS IN THE SOFTWARE. --
-- --
-- Except as contained in this notice, the name(s) of the above copyright --
-- holders shall not be used in advertising or otherwise to promote the --
-- sale, use or other dealings in this Software without prior written --
-- authorization. --
------------------------------------------------------------------------------
-- Author: Eugene V. Melaragno <[email protected]> 2000
-- Version Control
-- $Revision: 1.8 $
-- $Date: 2011/03/19 12:09:51 $
-- Binding Version 01.00
------------------------------------------------------------------------------
-- A simplified version of the GNU getopt function
-- copyright Free Software Foundtion
with Ada.Strings.Fixed;
with Ada.Strings.Bounded;
with Ada.Text_IO; use Ada.Text_IO;
package body ncurses2.getopt is
nextchar : Natural := 0;
-- Ncurses doesn't use the non option elements so we are spared
-- the job of computing those.
-- also the user is not allowed to modify argv or argc
-- Doing so is Erroneous execution.
-- long options are not handled.
procedure Qgetopt (retval : out Integer;
argc : Integer;
argv : stringfunc;
-- argv will be the Argument function.
optstring : String;
optind : in out Integer;
-- ignored for ncurses, must be initialized to 1 by
-- the caller
Optarg : out stringa
-- a garbage collector would be useful here.
) is
package BS is new Ada.Strings.Bounded.Generic_Bounded_Length (200);
use BS;
optargx : Bounded_String;
begin
if argc < optind then
retval := -1;
return;
end if;
optargx := To_Bounded_String ("");
if nextchar = 0 then
if argv (optind) = "--" then
-- the rest are non-options, we ignore them
retval := -1;
return;
end if;
if argv (optind)(1) /= '-' or argv (optind)'Length = 1 then
optind := optind + 1;
Optarg := new String'(argv (optind));
retval := 1;
return;
end if;
nextchar := 2; -- skip the one hyphen.
end if;
-- Look at and handle the next short option-character.
declare
c : Character := argv (optind) (nextchar);
temp : constant Natural :=
Ada.Strings.Fixed.Index (optstring, String'(1 => c));
begin
if temp = 0 or c = ':' then
Put_Line (Standard_Error,
argv (optind) & ": invalid option -- " & c);
c := '?';
return;
end if;
if optstring (temp + 1) = ':' then
if optstring (temp + 2) = ':' then
-- This is an option that accepts an argument optionally.
if nextchar /= argv (optind)'Length then
optargx := To_Bounded_String
(argv (optind) (nextchar .. argv (optind)'Length));
else
Optarg := null;
end if;
else
-- This is an option that requires an argument.
if nextchar /= argv (optind)'Length then
optargx := To_Bounded_String
(argv (optind) (nextchar .. argv (optind)'Length));
optind := optind + 1;
elsif optind = argc then
Put_Line (Standard_Error,
argv (optind) &
": option requires an argument -- " & c);
if optstring (optstring'First) = ':' then
c := ':';
else
c := '?';
end if;
else
-- increment it again when taking next ARGV-elt as argument.
optind := optind + 1;
optargx := To_Bounded_String (argv (optind));
optind := optind + 1;
end if;
end if;
nextchar := 0;
else -- no argument for the option
if nextchar = argv (optind)'Length then
optind := optind + 1;
nextchar := 0;
else
nextchar := nextchar + 1;
end if;
end if;
retval := Character'Pos (c);
Optarg := new String'(To_String (optargx));
return;
end;
end Qgetopt;
end ncurses2.getopt;
| 42.75 | 79 | 0.443731 |
104bfecc7ac0745dfc1a213804b817920304fb53 | 3,887 | ads | Ada | tools/scitools/conf/understand/ada/ada12/a-ztenau.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | 1 | 2020-01-20T21:26:46.000Z | 2020-01-20T21:26:46.000Z | tools/scitools/conf/understand/ada/ada12/a-ztenau.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada12/a-ztenau.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- ADA.WIDE_WIDE_TEXT_IO.ENUMERATION_AUX --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2009, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains the routines for Ada.Wide_Wide_Text_IO.Enumeration_IO
-- that are shared among separate instantiations.
private package Ada.Wide_Wide_Text_IO.Enumeration_Aux is
procedure Get_Enum_Lit
(File : File_Type;
Buf : out Wide_Wide_String;
Buflen : out Natural);
-- Reads an enumeration literal value from the file, folds to upper case,
-- and stores the result in Buf, setting Buflen to the number of stored
-- characters (Buf has a lower bound of 1). If more than Buflen characters
-- are present in the literal, Data_Error is raised.
procedure Scan_Enum_Lit
(From : Wide_Wide_String;
Start : out Natural;
Stop : out Natural);
-- Scans an enumeration literal at the start of From, skipping any leading
-- spaces. Sets Start to the first character, Stop to the last character.
-- Raises End_Error if no enumeration literal is found.
procedure Put
(File : File_Type;
Item : Wide_Wide_String;
Width : Field;
Set : Type_Set);
-- Outputs the enumeration literal image stored in Item to the given File,
-- using the given Width and Set parameters (Item is always in upper case).
procedure Puts
(To : out Wide_Wide_String;
Item : Wide_Wide_String;
Set : Type_Set);
-- Stores the enumeration literal image stored in Item to the string To,
-- padding with trailing spaces if necessary to fill To. Set is used to
end Ada.Wide_Wide_Text_IO.Enumeration_Aux;
| 55.528571 | 79 | 0.459223 |
59e322fe1719b31a846be5b48b0eebfba7186f91 | 932 | adb | Ada | gdb/testsuite/gdb.ada/var_rec_arr/pck.adb | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | 1 | 2020-10-14T03:24:35.000Z | 2020-10-14T03:24:35.000Z | gdb/testsuite/gdb.ada/var_rec_arr/pck.adb | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | null | null | null | gdb/testsuite/gdb.ada/var_rec_arr/pck.adb | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | null | null | null | -- Copyright 2015-2021 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package body Pck is
function Ident (R : Record_Type) return Record_Type is
begin
return R;
end Ident;
procedure Do_Nothing (A : System.Address) is
begin
null;
end Do_Nothing;
end Pck;
| 32.137931 | 73 | 0.719957 |
4135f1686eea932fe0a8646cd7b9277d514b448b | 20,050 | adb | Ada | tests/test_packet_parser.adb | DNSCatcher/DNSCatcher | e3865fde5ae4bd5f833210150a9d30668a051d40 | [
"MIT"
] | 4 | 2019-09-23T23:55:34.000Z | 2020-05-02T07:25:32.000Z | tests/test_packet_parser.adb | DNSCatcher/DNSCatcher | e3865fde5ae4bd5f833210150a9d30668a051d40 | [
"MIT"
] | null | null | null | tests/test_packet_parser.adb | DNSCatcher/DNSCatcher | e3865fde5ae4bd5f833210150a9d30668a051d40 | [
"MIT"
] | null | null | null | -- Copyright 2019 Michael Casadevall <[email protected]>
--
-- Permission is hereby granted, free of charge, to any person obtaining a copy
-- of this software and associated documentation files (the "Software"), to
-- deal in the Software without restriction, including without limitation the
-- rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
-- sell copies of the Software, and to permit persons to whom the Software is
-- furnished to do so, subject to the following conditions:
--
-- The above copyright notice and this permission notice shall be included in
-- all copies or substantial portions of the Software.
--
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
-- THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
-- FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
-- DEALINGS IN THE SOFTWARE.
pragma Ada_2012;
with Ada.Text_IO; use Ada.Text_IO;
with AUnit.Assertions;
with Ada.Directories; use Ada.Directories;
with Ada.Streams; use Ada.Streams;
with Ada.Streams.Stream_IO; use Ada.Streams.Stream_IO;
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with Ada.Unchecked_Conversion;
with DNSCatcher.DNS; use DNSCatcher.DNS;
with DNSCatcher.Types; use DNSCatcher.Types;
with DNSCatcher.Utils; use DNSCatcher.Utils;
with DNSCatcher.DNS.Processor.Packet; use DNSCatcher.DNS.Processor.Packet;
with DNSCatcher.DNS.Processor.RData; use DNSCatcher.DNS.Processor.RData;
with DNSCatcher.DNS.Processor.RData.SOA_Parser;
use DNSCatcher.DNS.Processor.RData.SOA_Parser;
with Interfaces.C.Extensions; use Interfaces.C.Extensions;
package body Test_Packet_Parser is
procedure Set_Up_Case (T : in out Packet_Parser_Test) is
begin
T.Capture_Config.Local_Listen_Port := 53;
T.Capture_Config.Upstream_DNS_Server := To_Unbounded_String ("4.2.2.2");
T.Capture_Config.Upstream_DNS_Server_Port := 53;
-- Configure the logger
T.Capture_Config.Logger_Config.Log_Level := DEBUG;
T.Capture_Config.Logger_Config.Use_Color := True;
T.Logger_Task.Initialize (T.Capture_Config.Logger_Config);
T.Logger_Task.Start;
end Set_Up_Case;
procedure Tear_Down_Case (T : in out Packet_Parser_Test) is
begin
T.Logger_Task.Stop;
end Tear_Down_Case;
--------------------
-- Register_Tests --
--------------------
procedure Register_Tests (T : in out Packet_Parser_Test) is
use AUnit.Test_Cases.Registration;
begin
Register_Routine (T, Test_Parse_A_Record'Access, "Parse A Record");
Register_Routine (T, Test_Parse_SOA_Record'Access, "Parse SOA Record");
Register_Routine
(T, Test_Parse_CNAME_Record'Access, "Parse CName Record");
Register_Routine (T, Test_Parse_NS_Record'Access, "Parse NS Record");
Register_Routine (T, Test_Parse_PTR_Record'Access, "Parse PTR Record");
Register_Routine (T, Test_Parse_OPT_Record'Access, "Parse OPT Record");
end Register_Tests;
----------
-- Name --
----------
pragma Warnings (Off, "formal parameter ""T"" is not referenced");
function Name
(T : Packet_Parser_Test)
return Message_String
is
begin
return Format ("Packet Parser Test");
end Name;
---------------------
-- Test_Simple_Add --
---------------------
function Load_Binary_DNS_Dump
(File : String)
return Raw_Packet_Record_Ptr
is
Input_File : Stream_IO.File_Type;
Input_Stream : Stream_Access;
Packet_Size : Stream_Element_Offset;
Read_Packet : Stream_Element_Offset;
Full_Packet : Stream_Element_Array_Ptr;
Inbound_Packet : constant Raw_Packet_Record_Ptr := new Raw_Packet_Record;
begin
Ada.Streams.Stream_IO.Open (Input_File, In_File, File);
-- We need to load and convert the header seperately because Ada sizing
-- doesn't account for Pack correct.
Input_Stream := Ada.Streams.Stream_IO.Stream (Input_File);
-- Load in the A record and try to parse it
Packet_Size := Stream_Element_Offset (Size (File));
Full_Packet := new Stream_Element_Array (1 .. Packet_Size);
Input_Stream.Read (Full_Packet.all, Read_Packet);
Inbound_Packet.Raw_Data.Header := SEA_To_DNS_Packet_Header (Full_Packet
(Full_Packet'First .. DNS_PACKET_HEADER_SIZE));
Inbound_Packet.Raw_Data.Data :=
new Stream_Element_Array (1 .. Packet_Size - DNS_PACKET_HEADER_SIZE);
Inbound_Packet.Raw_Data.Data.all := Full_Packet
(DNS_PACKET_HEADER_SIZE + 1 .. Packet_Size);
Free_Stream_Element_Array_Ptr (Full_Packet);
Close (Input_File);
return Inbound_Packet;
end Load_Binary_DNS_Dump;
procedure Test_Parse_A_Record (T : in out Test_Cases.Test_Case'Class) is
Logger_Packet : DNSCatcher.Utils.Logger.Logger_Message_Packet_Ptr;
Parsed_Packet : Parsed_DNS_Packet_Ptr;
Inbound_Packet : Raw_Packet_Record_Ptr := new Raw_Packet_Record;
Question : Parsed_DNS_Question;
Answer : Parsed_RData_Access;
begin
Logger_Packet := new Logger_Message_Packet;
Inbound_Packet := Load_Binary_DNS_Dump ("./tests/data/udp_a_record.bin");
Parsed_Packet := Packet_Parser (Logger_Packet, Inbound_Packet);
Logger_Queue.Add_Packet (Logger_Packet);
-- Verify the data we got from the packet matches what we expect
AUnit.Assertions.Assert
((Integer (Parsed_Packet.Header.Question_Count) =
Integer (Parsed_Packet.Questions.Length)),
"Question Count Mismatch!");
-- Verify the question section
Question := Parsed_Packet.Questions (1);
AUnit.Assertions.Assert
(To_String (Question.QName), "apple.com",
"Incorrect QNAME on decode!");
AUnit.Assertions.Assert
((Question.QType = DNSCatcher.DNS.A), "Incorrect QTYPE on decode!");
AUnit.Assertions.Assert
((Question.QClass = DNSCatcher.DNS.INternet),
"Incorrect QCLASS on decode!");
-- Verify the response section
AUnit.Assertions.Assert
((Integer (Parsed_Packet.Header.Answer_Record_Count) =
Integer (Parsed_Packet.Answer.Length)),
"Answer Count Mismatch!");
Answer := Parsed_Packet.Answer.Element (1);
AUnit.Assertions.Assert
(To_String (Answer.RName), "apple.com", "Incorrect RName!");
AUnit.Assertions.Assert
((Answer.RType = DNSCatcher.DNS.A), "Incorrect RName!");
AUnit.Assertions.Assert ((Answer.TTL = 3190), "Incorrect TTL!");
AUnit.Assertions.Assert
(Answer.RData_To_String, "17.172.224.47", "RData is incorrect");
Answer := Parsed_Packet.Answer.Element (2);
AUnit.Assertions.Assert
(To_String (Answer.RName), "apple.com", "Incorrect RName!");
AUnit.Assertions.Assert
((Answer.RType = DNSCatcher.DNS.A), "Incorrect RName!");
AUnit.Assertions.Assert ((Answer.TTL = 3190), "Incorrect TTL!");
AUnit.Assertions.Assert
(Answer.RData_To_String, "17.178.96.59", "RData is incorrect");
Answer := Parsed_Packet.Answer.Element (3);
AUnit.Assertions.Assert
(To_String (Answer.RName), "apple.com", "Incorrect RName!");
AUnit.Assertions.Assert
((Answer.RType = DNSCatcher.DNS.A), "Incorrect RName!");
AUnit.Assertions.Assert ((Answer.TTL = 3190), "Incorrect TTL!");
AUnit.Assertions.Assert
(Answer.RData_To_String, "17.142.160.59", "RData is incorrect");
Free_Raw_Packet_Record_Ptr (Inbound_Packet);
Free_Parsed_DNS_Packet (Parsed_Packet);
end Test_Parse_A_Record;
-- Tests if we can parse an SOA record
procedure Test_Parse_SOA_Record (T : in out Test_Cases.Test_Case'Class) is
Logger_Packet : DNSCatcher.Utils.Logger.Logger_Message_Packet_Ptr;
Parsed_Packet : Parsed_DNS_Packet_Ptr;
Inbound_Packet : Raw_Packet_Record_Ptr := new Raw_Packet_Record;
Question : Parsed_DNS_Question;
Answer : Parsed_RData_Access;
SOA_Record : Parsed_SOA_RData_Access;
function To_Parsed_SOA_RData is new Ada.Unchecked_Conversion
(Source => Parsed_RData_Access, Target => Parsed_SOA_RData_Access);
begin
Logger_Packet := new Logger_Message_Packet;
Inbound_Packet :=
Load_Binary_DNS_Dump ("./tests/data/udp_soa_record.bin");
Parsed_Packet := Packet_Parser (Logger_Packet, Inbound_Packet);
Logger_Queue.Add_Packet (Logger_Packet);
-- Verify the question section
Question := Parsed_Packet.Questions (1);
AUnit.Assertions.Assert
(To_String (Question.QName), "casadevall.pro",
"Incorrect QNAME on decode!");
AUnit.Assertions.Assert
((Question.QType = DNSCatcher.DNS.SOA), "Incorrect QTYPE on decode!");
AUnit.Assertions.Assert
((Question.QClass = DNSCatcher.DNS.INternet),
"Incorrect QCLASS on decode!");
-- Verify the response section
AUnit.Assertions.Assert
((Integer (Parsed_Packet.Header.Answer_Record_Count) =
Integer (Parsed_Packet.Answer.Length)),
"Answer Count Mismatch!");
Answer := Parsed_Packet.Answer.Element (1);
SOA_Record := To_Parsed_SOA_RData (Answer);
AUnit.Assertions.Assert
(To_String (SOA_Record.Primary_Nameserver), "ns1.casadevall.pro",
"Incorrect decode on primary nameserver");
AUnit.Assertions.Assert
(To_String (SOA_Record.Responsible_Contact), "casadevall.pro",
"Incorrect decode on responsible contact");
AUnit.Assertions.Assert
((Integer (SOA_Record.Serial) = 2018082638), "Incorrect Serial");
AUnit.Assertions.Assert
((Integer (SOA_Record.Refresh) = 300), "Incorrect Refresh");
AUnit.Assertions.Assert
((Integer (SOA_Record.Retry) = 14400), "Incorrect Refresh");
AUnit.Assertions.Assert
((Integer (SOA_Record.Expire) = 2419200), "Incorrect Expire");
AUnit.Assertions.Assert
((Integer (SOA_Record.Minimum) = 1800), "Incorrect Expire");
Free_Raw_Packet_Record_Ptr (Inbound_Packet);
Free_Parsed_DNS_Packet (Parsed_Packet);
end Test_Parse_SOA_Record;
-- Tests if we can parse an CNAME record
procedure Test_Parse_CNAME_Record (T : in out Test_Cases.Test_Case'Class) is
Logger_Packet : DNSCatcher.Utils.Logger.Logger_Message_Packet_Ptr;
Parsed_Packet : Parsed_DNS_Packet_Ptr;
Inbound_Packet : Raw_Packet_Record_Ptr := new Raw_Packet_Record;
Question : Parsed_DNS_Question;
Answer : Parsed_RData_Access;
begin
Logger_Packet := new Logger_Message_Packet;
Inbound_Packet :=
Load_Binary_DNS_Dump ("./tests/data/udp_cname_record.bin");
Parsed_Packet := Packet_Parser (Logger_Packet, Inbound_Packet);
Logger_Queue.Add_Packet (Logger_Packet);
-- Verify the question section
Question := Parsed_Packet.Questions (1);
AUnit.Assertions.Assert
(To_String (Question.QName), "mail.casadevall.pro",
"Incorrect QNAME on decode!");
AUnit.Assertions.Assert
((Question.QType = DNSCatcher.DNS.CNAME),
"Incorrect QTYPE on decode!");
AUnit.Assertions.Assert
((Question.QClass = DNSCatcher.DNS.INternet),
"Incorrect QCLASS on decode!");
AUnit.Assertions.Assert
((Integer (Parsed_Packet.Header.Answer_Record_Count) =
Integer (Parsed_Packet.Answer.Length)),
"Answer Count Mismatch!");
Answer := Parsed_Packet.Answer.Element (1);
AUnit.Assertions.Assert
(To_String (Answer.RName), "mail.casadevall.pro", "Incorrect RName!");
AUnit.Assertions.Assert
((Answer.RType = DNSCatcher.DNS.CNAME), "Incorrect RName!");
AUnit.Assertions.Assert ((Answer.TTL = 3600), "Incorrect TTL!");
AUnit.Assertions.Assert
(Answer.RData_To_String, "pathfinder.casadevall.pro",
"RData is incorrect");
Free_Raw_Packet_Record_Ptr (Inbound_Packet);
Free_Parsed_DNS_Packet (Parsed_Packet);
end Test_Parse_CNAME_Record;
procedure Test_Parse_NS_Record (T : in out Test_Cases.Test_Case'Class) is
Logger_Packet : DNSCatcher.Utils.Logger.Logger_Message_Packet_Ptr;
Parsed_Packet : Parsed_DNS_Packet_Ptr;
Inbound_Packet : Raw_Packet_Record_Ptr := new Raw_Packet_Record;
Question : Parsed_DNS_Question;
Answer : Parsed_RData_Access;
begin
Logger_Packet := new Logger_Message_Packet;
Inbound_Packet :=
Load_Binary_DNS_Dump ("./tests/data/udp_ns_record.bin");
Parsed_Packet := Packet_Parser (Logger_Packet, Inbound_Packet);
Logger_Queue.Add_Packet (Logger_Packet);
-- Verify the question section
Question := Parsed_Packet.Questions (1);
AUnit.Assertions.Assert
(To_String (Question.QName), "casadevall.pro",
"Incorrect QNAME on decode!");
AUnit.Assertions.Assert
((Question.QType = DNSCatcher.DNS.NS), "Incorrect QTYPE on decode!");
AUnit.Assertions.Assert
((Question.QClass = DNSCatcher.DNS.INternet),
"Incorrect QCLASS on decode!");
AUnit.Assertions.Assert
((Integer (Parsed_Packet.Header.Answer_Record_Count) =
Integer (Parsed_Packet.Answer.Length)),
"Answer Count Mismatch!");
Answer := Parsed_Packet.Answer.Element (1);
AUnit.Assertions.Assert
(To_String (Answer.RName), "casadevall.pro", "Incorrect RName!");
AUnit.Assertions.Assert
((Answer.RType = DNSCatcher.DNS.NS), "Incorrect RName!");
AUnit.Assertions.Assert ((Answer.TTL = 3600), "Incorrect TTL!");
AUnit.Assertions.Assert
(Answer.RData_To_String, "ns5.linode.com", "RData is incorrect");
Answer := Parsed_Packet.Answer.Element (2);
AUnit.Assertions.Assert
(To_String (Answer.RName), "casadevall.pro", "Incorrect RName!");
AUnit.Assertions.Assert
((Answer.RType = DNSCatcher.DNS.NS), "Incorrect RName!");
AUnit.Assertions.Assert ((Answer.TTL = 3600), "Incorrect TTL!");
AUnit.Assertions.Assert
(Answer.RData_To_String, "ns2.linode.com", "RData is incorrect");
Answer := Parsed_Packet.Answer.Element (3);
AUnit.Assertions.Assert
(To_String (Answer.RName), "casadevall.pro", "Incorrect RName!");
AUnit.Assertions.Assert
((Answer.RType = DNSCatcher.DNS.NS), "Incorrect RName!");
AUnit.Assertions.Assert ((Answer.TTL = 3600), "Incorrect TTL!");
AUnit.Assertions.Assert
(Answer.RData_To_String, "ns1.casadevall.pro", "RData is incorrect");
Answer := Parsed_Packet.Answer.Element (4);
AUnit.Assertions.Assert
(To_String (Answer.RName), "casadevall.pro", "Incorrect RName!");
AUnit.Assertions.Assert
((Answer.RType = DNSCatcher.DNS.NS), "Incorrect RName!");
AUnit.Assertions.Assert ((Answer.TTL = 3600), "Incorrect TTL!");
AUnit.Assertions.Assert
(Answer.RData_To_String, "ns3.linode.com", "RData is incorrect");
Answer := Parsed_Packet.Answer.Element (5);
AUnit.Assertions.Assert
(To_String (Answer.RName), "casadevall.pro", "Incorrect RName!");
AUnit.Assertions.Assert
((Answer.RType = DNSCatcher.DNS.NS), "Incorrect RName!");
AUnit.Assertions.Assert ((Answer.TTL = 3600), "Incorrect TTL!");
AUnit.Assertions.Assert
(Answer.RData_To_String, "ns1.linode.com", "RData is incorrect");
Answer := Parsed_Packet.Answer.Element (6);
AUnit.Assertions.Assert
(To_String (Answer.RName), "casadevall.pro", "Incorrect RName!");
AUnit.Assertions.Assert
((Answer.RType = DNSCatcher.DNS.NS), "Incorrect RName!");
AUnit.Assertions.Assert ((Answer.TTL = 3600), "Incorrect TTL!");
AUnit.Assertions.Assert
(Answer.RData_To_String, "ns4.linode.com", "RData is incorrect");
Free_Raw_Packet_Record_Ptr (Inbound_Packet);
Free_Parsed_DNS_Packet (Parsed_Packet);
end Test_Parse_NS_Record;
-- Tests if we can parse an PTR record
procedure Test_Parse_PTR_Record (T : in out Test_Cases.Test_Case'Class) is
Logger_Packet : DNSCatcher.Utils.Logger.Logger_Message_Packet_Ptr;
Parsed_Packet : Parsed_DNS_Packet_Ptr;
Inbound_Packet : Raw_Packet_Record_Ptr := new Raw_Packet_Record;
Question : Parsed_DNS_Question;
Answer : Parsed_RData_Access;
begin
Logger_Packet := new Logger_Message_Packet;
Inbound_Packet :=
Load_Binary_DNS_Dump ("./tests/data/udp_ptr_record.bin");
Parsed_Packet := Packet_Parser (Logger_Packet, Inbound_Packet);
Logger_Queue.Add_Packet (Logger_Packet);
-- Verify the question section
Question := Parsed_Packet.Questions (1);
AUnit.Assertions.Assert
(To_String (Question.QName), "193.112.33.45.in-addr.arpa",
"Incorrect QNAME on decode!");
AUnit.Assertions.Assert
((Question.QType = DNSCatcher.DNS.PTR), "Incorrect QTYPE on decode!");
AUnit.Assertions.Assert
((Question.QClass = DNSCatcher.DNS.INternet),
"Incorrect QCLASS on decode!");
AUnit.Assertions.Assert
((Integer (Parsed_Packet.Header.Answer_Record_Count) =
Integer (Parsed_Packet.Answer.Length)),
"Answer Count Mismatch!");
Answer := Parsed_Packet.Answer.Element (1);
AUnit.Assertions.Assert
(To_String (Answer.RName), "193.112.33.45.in-addr.arpa",
"Incorrect RName!");
AUnit.Assertions.Assert
((Answer.RType = DNSCatcher.DNS.PTR), "Incorrect RName!");
AUnit.Assertions.Assert ((Answer.TTL = 86400), "Incorrect TTL!");
AUnit.Assertions.Assert
(Answer.RData_To_String, "pathfinder.casadevall.pro",
"RData is incorrect");
Free_Raw_Packet_Record_Ptr (Inbound_Packet);
Free_Parsed_DNS_Packet (Parsed_Packet);
end Test_Parse_PTR_Record;
-- Tests if we can parse an OPT record
procedure Test_Parse_OPT_Record (T : in out Test_Cases.Test_Case'Class) is
Logger_Packet : DNSCatcher.Utils.Logger.Logger_Message_Packet_Ptr;
Parsed_Packet : Parsed_DNS_Packet_Ptr;
Inbound_Packet : Raw_Packet_Record_Ptr := new Raw_Packet_Record;
Question : Parsed_DNS_Question;
Answer : Parsed_RData_Access;
begin
Logger_Packet := new Logger_Message_Packet;
Inbound_Packet :=
Load_Binary_DNS_Dump ("./tests/data/udp_client_opt_record.bin");
Parsed_Packet := Packet_Parser (Logger_Packet, Inbound_Packet);
Logger_Queue.Add_Packet (Logger_Packet);
-- Verify the question section (this was a request for a DNSKEY on the
-- root)
Question := Parsed_Packet.Questions (1);
AUnit.Assertions.Assert
(To_String (Question.QName), "", "Incorrect QNAME on decode!");
AUnit.Assertions.Assert
((Question.QType = DNSCatcher.DNS.DNSKEY),
"Incorrect QTYPE on decode!");
AUnit.Assertions.Assert
((Question.QClass = DNSCatcher.DNS.INternet),
"Incorrect QCLASS on decode!");
Put_Line (Parsed_Packet.Header.Additional_Record_Count'Image);
Put_Line (Parsed_Packet.Additional.Length'Image);
AUnit.Assertions.Assert
((Integer (Parsed_Packet.Header.Additional_Record_Count) =
Integer (Parsed_Packet.Additional.Length)),
"Additional Count Mismatch!");
Answer := Parsed_Packet.Additional.Element (1);
AUnit.Assertions.Assert
(To_String (Answer.RName), "", "Incorrect RName!");
AUnit.Assertions.Assert
((Answer.RType = DNSCatcher.DNS.OPT), "Incorrect RName!");
AUnit.Assertions.Assert ((Answer.TTL = 0), "Incorrect TTL!");
Free_Raw_Packet_Record_Ptr (Inbound_Packet);
Free_Parsed_DNS_Packet (Parsed_Packet);
end Test_Parse_OPT_Record;
end Test_Packet_Parser;
| 41.945607 | 79 | 0.687481 |
2353ccd6684e87f7704fc3cf26e19d168efebef2 | 955 | adb | Ada | gdb-7.3/gdb/testsuite/gdb.ada/nested/hello.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | 1 | 2016-04-09T02:58:13.000Z | 2016-04-09T02:58:13.000Z | gdb-7.3/gdb/testsuite/gdb.ada/nested/hello.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | gdb-7.3/gdb/testsuite/gdb.ada/nested/hello.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | -- Copyright 2007, 2009, 2010, 2011 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
procedure Hello is
procedure First is
begin
null;
end First;
procedure Second is
begin
First;
end Second;
procedure Third is
begin
Second;
end Third;
begin
Third;
end Hello;
| 25.810811 | 73 | 0.705759 |
418199a86c231445559fe8cc4ce43a11f310e0c6 | 6,101 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce2208b.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce2208b.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce2208b.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- CE2208B.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- OBJECTIVE:
-- CHECK THAT DATA CAN BE OVERWRITTEN IN THE SEQUENTIAL FILE AND THE
-- CORRECT VALUES CAN LATER BE READ. ALSO CHECK THAT OVERWRITING
-- TRUNCATES THE FILE TO THE LAST ELEMENT WRITTEN.
-- APPLICABILITY CRITERIA:
-- THIS TEST IS APPLICABLE ONLY TO IMPLEMENTATIONS WHICH SUPPORT
-- THE CREATING AND OPENING OF SEQUENTIAL FILES.
-- HISTORY:
-- TBN 09/30/86 CREATED ORIGINAL TEST.
-- GMT 07/24/87 ADDED CHECKS FOR USE_ERROR AND REMOVED SOME CODE.
-- BCB 10/03/90 CHANGED CODE TO CHECK THAT OVERWRITING TRUNCATES
-- INSTEAD OF WHETHER IT TRUNCATES.
WITH SEQUENTIAL_IO;
WITH REPORT; USE REPORT;
PROCEDURE CE2208B IS
PACKAGE SEQ_IO IS NEW SEQUENTIAL_IO (INTEGER);
USE SEQ_IO;
FILE1 : FILE_TYPE;
INCOMPLETE : EXCEPTION;
BEGIN
TEST ("CE2208B",
"CHECK THAT DATA CAN BE OVERWRITTEN IN THE SEQUENTIAL " &
"FILE AND THE CORRECT VALUES CAN LATER BE READ. ALSO " &
"CHECK THAT OVERWRITING TRUNCATES THE FILE." );
-- INITIALIZE TEST FILE
BEGIN
CREATE (FILE1, OUT_FILE, LEGAL_FILE_NAME);
EXCEPTION
WHEN NAME_ERROR =>
NOT_APPLICABLE ("NAME_ERROR RAISED DURING CREATE");
RAISE INCOMPLETE;
WHEN USE_ERROR =>
NOT_APPLICABLE ("USE_ERROR RAISED DURING CREATE");
RAISE INCOMPLETE;
WHEN OTHERS =>
FAILED ("UNKNOWN EXCEPTION RAISED DURING CREATE");
RAISE INCOMPLETE;
END;
BEGIN
FOR I IN 1 .. 25 LOOP
WRITE (FILE1, I);
END LOOP;
EXCEPTION
WHEN OTHERS =>
FAILED ("UNEXPECTED EXCEPTION RAISED DURING WRITE");
RAISE INCOMPLETE;
END;
BEGIN
CLOSE (FILE1);
EXCEPTION
WHEN OTHERS =>
FAILED ("UNEXPECTED EXCEPTION RAISED DURING CLOSE");
RAISE INCOMPLETE;
END;
BEGIN
OPEN (FILE1, OUT_FILE, LEGAL_FILE_NAME);
EXCEPTION
WHEN USE_ERROR =>
NOT_APPLICABLE ( "OPEN WITH OUT_FILE MODE NOT " &
"SUPPORTED FOR SEQUENTIAL FILES" );
RAISE INCOMPLETE;
WHEN OTHERS =>
FAILED ("EXCEPTION RAISED DURING OPEN");
RAISE INCOMPLETE;
END;
BEGIN
FOR I IN 26 .. 36 LOOP
WRITE (FILE1, I);
END LOOP;
EXCEPTION
WHEN OTHERS =>
FAILED ("UNEXPECTED EXCEPTION RAISED DURING OVERWRITE");
RAISE INCOMPLETE;
END;
BEGIN
CLOSE (FILE1);
EXCEPTION
WHEN OTHERS =>
FAILED ("UNEXPECTED EXCEPTION RAISED DURING 2ND CLOSE");
RAISE INCOMPLETE;
END;
BEGIN
OPEN (FILE1, IN_FILE, LEGAL_FILE_NAME);
EXCEPTION
WHEN USE_ERROR =>
NOT_APPLICABLE ( "OPEN WITH IN_FILE MODE NOT " &
"SUPPORTED FOR SEQUENTIAL FILES" );
RAISE INCOMPLETE;
WHEN OTHERS =>
FAILED ("EXCEPTION RAISED DURING SECOND OPEN");
RAISE INCOMPLETE;
END;
DECLARE
END_REACHED : BOOLEAN := FALSE;
COUNT : INTEGER := 26;
NUM : INTEGER;
BEGIN
WHILE COUNT <= 36 AND NOT END_REACHED LOOP
BEGIN
READ (FILE1, NUM);
IF NUM /= COUNT THEN
FAILED ("INCORRECT RESULTS READ FROM FILE " &
INTEGER'IMAGE (NUM));
END IF;
COUNT := COUNT + 1;
EXCEPTION
WHEN END_ERROR =>
END_REACHED := TRUE;
WHEN OTHERS =>
FAILED ("UNEXPECTED EXCEPTION RAISED DURING " &
"READING - 1");
RAISE INCOMPLETE;
END;
END LOOP;
IF COUNT <= 36 THEN
FAILED ("FILE WAS INCOMPLETE");
RAISE INCOMPLETE;
ELSE
BEGIN
READ (FILE1, NUM);
FAILED ("END_ERROR NOT RAISED BY ATTEMPT TO READ");
EXCEPTION
WHEN END_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("UNEXPECTED EXCEPTION RAISED " &
"DURING READING - 2");
RAISE INCOMPLETE;
END;
END IF;
END;
BEGIN
DELETE (FILE1);
EXCEPTION
WHEN USE_ERROR =>
NULL;
END;
RESULT;
EXCEPTION
WHEN INCOMPLETE =>
RESULT;
END CE2208B;
| 32.801075 | 79 | 0.53483 |
593d43935a72c8bc79b55f945276ee2c82e16ab9 | 4,332 | ads | Ada | source/nodes/program-nodes-indexed_components.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/nodes/program-nodes-indexed_components.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/nodes/program-nodes-indexed_components.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | 2 | 2019-09-14T23:18:50.000Z | 2019-10-02T10:11:40.000Z | -- Copyright (c) 2019 Maxim Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Program.Elements.Expressions;
with Program.Lexical_Elements;
with Program.Elements.Indexed_Components;
with Program.Element_Visitors;
package Program.Nodes.Indexed_Components is
pragma Preelaborate;
type Indexed_Component is
new Program.Nodes.Node
and Program.Elements.Indexed_Components.Indexed_Component
and Program.Elements.Indexed_Components.Indexed_Component_Text
with private;
function Create
(Prefix : not null Program.Elements.Expressions
.Expression_Access;
Left_Bracket_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Expressions : Program.Elements.Expressions
.Expression_Vector_Access;
Right_Bracket_Token : not null Program.Lexical_Elements
.Lexical_Element_Access)
return Indexed_Component;
type Implicit_Indexed_Component is
new Program.Nodes.Node
and Program.Elements.Indexed_Components.Indexed_Component
with private;
function Create
(Prefix : not null Program.Elements.Expressions
.Expression_Access;
Expressions : Program.Elements.Expressions
.Expression_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_Indexed_Component
with Pre =>
Is_Part_Of_Implicit or Is_Part_Of_Inherited or Is_Part_Of_Instance;
private
type Base_Indexed_Component is
abstract new Program.Nodes.Node
and Program.Elements.Indexed_Components.Indexed_Component
with record
Prefix : not null Program.Elements.Expressions.Expression_Access;
Expressions : Program.Elements.Expressions.Expression_Vector_Access;
end record;
procedure Initialize (Self : aliased in out Base_Indexed_Component'Class);
overriding procedure Visit
(Self : not null access Base_Indexed_Component;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class);
overriding function Prefix
(Self : Base_Indexed_Component)
return not null Program.Elements.Expressions.Expression_Access;
overriding function Expressions
(Self : Base_Indexed_Component)
return Program.Elements.Expressions.Expression_Vector_Access;
overriding function Is_Indexed_Component_Element
(Self : Base_Indexed_Component)
return Boolean;
overriding function Is_Expression_Element
(Self : Base_Indexed_Component)
return Boolean;
type Indexed_Component is
new Base_Indexed_Component
and Program.Elements.Indexed_Components.Indexed_Component_Text
with record
Left_Bracket_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Right_Bracket_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
end record;
overriding function To_Indexed_Component_Text
(Self : aliased in out Indexed_Component)
return Program.Elements.Indexed_Components.Indexed_Component_Text_Access;
overriding function Left_Bracket_Token
(Self : Indexed_Component)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function Right_Bracket_Token
(Self : Indexed_Component)
return not null Program.Lexical_Elements.Lexical_Element_Access;
type Implicit_Indexed_Component is
new Base_Indexed_Component
with record
Is_Part_Of_Implicit : Boolean;
Is_Part_Of_Inherited : Boolean;
Is_Part_Of_Instance : Boolean;
end record;
overriding function To_Indexed_Component_Text
(Self : aliased in out Implicit_Indexed_Component)
return Program.Elements.Indexed_Components.Indexed_Component_Text_Access;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Indexed_Component)
return Boolean;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Indexed_Component)
return Boolean;
overriding function Is_Part_Of_Instance
(Self : Implicit_Indexed_Component)
return Boolean;
end Program.Nodes.Indexed_Components;
| 33.84375 | 79 | 0.738458 |
596dc30c6c867ad384381f086c1458f10a214900 | 31,857 | adb | Ada | src/vulkan-math/gentype/vulkan-math-gentype.adb | zrmyers/VulkanAda | ed8c46d923bc8936db3a5d55d36afebb928a9ede | [
"MIT"
] | 1 | 2021-01-29T21:10:45.000Z | 2021-01-29T21:10:45.000Z | src/vulkan-math/gentype/vulkan-math-gentype.adb | zrmyers/VulkanAda | ed8c46d923bc8936db3a5d55d36afebb928a9ede | [
"MIT"
] | 8 | 2020-04-22T14:55:20.000Z | 2021-11-22T03:58:08.000Z | src/vulkan-math/gentype/vulkan-math-gentype.adb | zrmyers/VulkanAda | ed8c46d923bc8936db3a5d55d36afebb928a9ede | [
"MIT"
] | 1 | 2021-04-05T13:19:21.000Z | 2021-04-05T13:19:21.000Z | --------------------------------------------------------------------------------
-- MIT License
--
-- Copyright (c) 2020 Zane Myers
--
-- 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.
--------------------------------------------------------------------------------
-- This package describes a generic Vulkan Math type.
--------------------------------------------------------------------------------
package body Vulkan.Math.GenType is
----------------------------------------------------------------------------
-- Operations on Vkm_GenType
----------------------------------------------------------------------------
function Image (Instance : in Vkm_GenType) return String is
begin
case Instance.Length is
when 4 =>
return "[ " & Image(Instance.data(0)) &
", " & Image(Instance.data(1)) &
", " & Image(Instance.data(2)) &
", " & Image(Instance.data(3)) & " ]";
when 3 =>
return "[ " & Image(Instance.data(0)) &
", " & Image(Instance.data(1)) &
", " & Image(Instance.data(2)) & " ]";
when 2 =>
return "[ " & Image(Instance.data(0)) &
", " & Image(Instance.data(1)) & " ]";
when 1 =>
return "[ " & Image(Instance.data(0)) & " ]";
end case;
end Image;
----------------------------------------------------------------------------
function Make_GenType (Last_Index : in Vkm_Indices;
value : in Base_Type) return Vkm_GenType is
Instance : Vkm_GenType(Last_Index => Last_Index);
begin
for I in Vkm_Indices'First .. Instance.Last_Index loop
Instance.data(I) := value;
end loop;
return Instance;
end Make_GenType;
----------------------------------------------------------------------------
function Make_GenType (value1 : in Base_Type) return Vkm_GenType is
Instance : Vkm_GenType(Last_Index => 0);
begin
Instance.data(0) := value1;
return Instance;
end Make_GenType;
----------------------------------------------------------------------------
function Make_GenType (value1, value2 : in Base_Type) return Vkm_GenType is
Instance : Vkm_GenType(Last_Index => 1);
begin
Instance.data(0) := value1;
Instance.data(1) := Value2;
return Instance;
end Make_GenType;
----------------------------------------------------------------------------
function Make_GenType (value1, value2, value3 : in Base_Type) return Vkm_GenType is
Instance : Vkm_GenType(Last_Index => 2);
begin
Instance.data(0) := value1;
Instance.data(1) := value2;
Instance.data(2) := value3;
return Instance;
end Make_GenType;
----------------------------------------------------------------------------
function Make_GenType (value1, value2, value3, value4 : in Base_Type) return Vkm_GenType is
Instance : Vkm_GenType(Last_Index => 3);
begin
Instance.data(0) := value1;
Instance.data(1) := value2;
Instance.data(2) := value3;
Instance.data(3) := value4;
return Instance;
end Make_GenType;
----------------------------------------------------------------------------
function Make_GenType (value : in Vkm_GenType) return Vkm_GenType is
Instance : Vkm_GenType(Last_Index => value.Last_Index);
begin
for I in Instance.data'Range loop
Instance.data(I) := value.data(I);
end loop;
return Instance;
end Make_GenType;
----------------------------------------------------------------------------
procedure Copy (Destination : in out Vkm_GenType;
Source : in Vkm_GenType;
Num_Copy : in Vkm_Length;
Offset : in Vkm_Indices) is
begin
for Data_Index in 0 .. To_Vkm_Indices(Num_Copy) loop
Destination.data(Offset + Data_Index) := Source.data(Data_Index);
end loop;
end Copy;
----------------------------------------------------------------------------
function Component (vec : in Vkm_GenType;
index : in Vkm_Indices) return Base_Type is
value : Base_Type := Default_Value;
begin
if index <= vec.Last_Index then
value := vec.data(index);
end if;
return value;
end Component;
----------------------------------------------------------------------------
procedure Component (vec : in out Vkm_GenType;
index : in Vkm_Indices;
value : in Base_Type) is
begin
vec.data (index) := value;
end Component;
----------------------------------------------------------------
function x (vec1 : in out Vkm_GenType;
value : in Base_Type ) return Vkm_GenType_Reference is
vec1_access : constant Vkm_GenType_Reference := (Vector => vec1'Unrestricted_Access);
begin
x(vec1,value);
return vec1_access;
end x;
procedure x (vec1 : in out Vkm_GenType;
value : in Base_Type ) is
begin
case vec1.Last_Index is
when 3 => vec1.data(0) := value;
when 2 => vec1.data(0) := value;
when 1 => vec1.data(0) := value;
when 0 => vec1.data(0) := value;
end case;
end x;
----------------------------------------------------------------
function y (vec1 : in out Vkm_GenType;
value : in Base_Type ) return Vkm_GenType_Reference is
vec1_access : constant Vkm_GenType_Reference := (Vector => vec1'Unrestricted_Access);
begin
y(vec1, value);
return vec1_access;
end y;
----------------------------------------------------------------
procedure y (vec1 : in out Vkm_GenType;
value : in Base_Type ) is
begin
case vec1.Last_Index is
when 3 => vec1.data(1) := value;
when 2 => vec1.data(1) := value;
when 1 => vec1.data(1) := value;
when 0 => null;
end case;
end y;
function z (vec1 : in out Vkm_GenType;
value : in Base_Type ) return Vkm_GenType_Reference is
vec1_access : constant Vkm_GenType_Reference := (Vector => vec1'Unrestricted_Access);
begin
z(vec1, value);
return vec1_access;
end z;
----------------------------------------------------------------
procedure z (vec1 : in out Vkm_GenType;
value : in Base_Type ) is
begin
case vec1.Last_Index is
when 3 => vec1.data(2) := value;
when 2 => vec1.data(2) := value;
when 1 => null;
when 0 => null;
end case;
end z;
function w (vec1 : in out Vkm_GenType;
value : in Base_Type ) return Vkm_GenType_Reference is
vec1_access : constant Vkm_GenType_Reference := (Vector => vec1'Unrestricted_Access);
begin
w(vec1, value);
return vec1_access;
end w;
----------------------------------------------------------------
procedure w (vec1 : in out Vkm_GenType;
value : in Base_Type ) is
begin
case vec1.Last_Index is
when 3 => vec1.data(3) := value;
when 2 => null;
when 1 => null;
when 0 => null;
end case;
end w;
----------------------------------------------------------------
procedure xy (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.x(vec2.x).y(vec2.y);
end xy;
----------------------------------------------------------------
procedure xz (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.x(vec2.x).z(vec2.y);
end xz;
----------------------------------------------------------------
procedure xw (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.x(vec2.x).w(vec2.y);
end xw;
----------------------------------------------------------------
procedure yx (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.y(vec2.x).x(vec2.y);
end yx;
----------------------------------------------------------------
procedure yz (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.y(vec2.x).z(vec2.y);
end yz;
----------------------------------------------------------------
procedure yw (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.y(vec2.x).w(vec2.y);
end yw;
----------------------------------------------------------------
procedure zx (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.z(vec2.x).x(vec2.y);
end zx;
----------------------------------------------------------------
procedure zy (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.z(vec2.x).y(vec2.y);
end zy;
----------------------------------------------------------------
procedure zw (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.z(vec2.x).w(vec2.y);
end zw;
----------------------------------------------------------------
procedure wx (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.w(vec2.x).x(vec2.y);
end wx;
----------------------------------------------------------------
procedure wy (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.w(vec2.x).y(vec2.y);
end wy;
----------------------------------------------------------------
procedure wz (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.w(vec2.x).z(vec2.y);
end wz;
----------------------------------------------------------------
procedure xyz (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.x(vec2.x)
.y(vec2.y)
.z(vec2.z);
end xyz;
----------------------------------------------------------------
procedure xyw (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.x(vec2.x)
.y(vec2.y)
.w(vec2.z);
end xyw;
----------------------------------------------------------------
procedure xzy (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.x(vec2.x)
.z(vec2.y)
.y(vec2.z);
end xzy;
----------------------------------------------------------------
procedure xzw (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.x(vec2.x)
.z(vec2.y)
.w(vec2.z);
end xzw;
----------------------------------------------------------------
procedure xwy (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.x(vec2.x)
.w(vec2.y)
.y(vec2.z);
end xwy;
----------------------------------------------------------------
procedure xwz (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.x(vec2.x)
.w(vec2.y)
.z(vec2.z);
end xwz;
----------------------------------------------------------------
procedure yxz (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.y(vec2.x)
.x(vec2.y)
.z(vec2.z);
end yxz;
----------------------------------------------------------------
procedure yxw (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.y(vec2.x)
.x(vec2.y)
.w(vec2.z);
end yxw;
----------------------------------------------------------------
procedure yzx (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.y(vec2.x)
.z(vec2.y)
.x(vec2.z);
end yzx;
----------------------------------------------------------------
procedure yzw (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.y(vec2.x)
.z(vec2.y)
.w(vec2.z);
end yzw;
----------------------------------------------------------------
procedure ywx (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.y(vec2.x)
.w(vec2.y)
.x(vec2.z);
end ywx;
----------------------------------------------------------------
procedure ywz (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.y(vec2.x)
.w(vec2.y)
.z(vec2.z);
end ywz;
----------------------------------------------------------------
procedure zxy (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.z(vec2.x)
.x(vec2.y)
.y(vec2.z);
end zxy;
----------------------------------------------------------------
procedure zxw (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.z(vec2.x)
.x(vec2.y)
.w(vec2.z);
end zxw;
----------------------------------------------------------------
procedure zyx (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.z(vec2.x)
.y(vec2.y)
.x(vec2.z);
end zyx;
----------------------------------------------------------------
procedure zyw (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.z(vec2.x)
.y(vec2.y)
.w(vec2.z);
end zyw;
----------------------------------------------------------------
procedure zwx (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.z(vec2.x)
.w(vec2.y)
.x(vec2.z);
end zwx;
----------------------------------------------------------------
procedure zwy (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.z(vec2.x)
.w(vec2.y)
.y(vec2.z);
end zwy;
----------------------------------------------------------------
procedure wxy (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.w(vec2.x)
.x(vec2.y)
.y(vec2.z);
end wxy;
----------------------------------------------------------------
procedure wxz (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.w(vec2.x)
.x(vec2.y)
.z(vec2.z);
end wxz;
----------------------------------------------------------------
procedure wyx (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.w(vec2.x)
.y(vec2.y)
.x(vec2.z);
end wyx;
----------------------------------------------------------------
procedure wyz (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.w(vec2.x)
.y(vec2.y)
.z(vec2.z);
end wyz;
----------------------------------------------------------------
procedure wzx (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.w(vec2.x)
.z(vec2.y)
.x(vec2.z);
end wzx;
----------------------------------------------------------------
procedure wzy (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.w(vec2.x)
.z(vec2.y)
.y(vec2.z);
end wzy;
----------------------------------------------------------------------------
procedure xyzw (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.x(vec2.x).y(vec2.y).z(vec2.z).w(vec2.w);
end xyzw;
----------------------------------------------------------------
procedure xywz (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.x(vec2.x).y(vec2.y).w(vec2.z).z(vec2.w);
end xywz;
----------------------------------------------------------------
procedure xzyw (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.x(vec2.x).z(vec2.y).y(vec2.z).w(vec2.w);
end xzyw;
----------------------------------------------------------------
procedure xzwy (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.x(vec2.x).z(vec2.y).w(vec2.z).y(vec2.w);
end xzwy;
----------------------------------------------------------------
procedure xwyz (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.x(vec2.x).w(vec2.y).y(vec2.z).z(vec2.w);
end xwyz;
----------------------------------------------------------------
procedure xwzy (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.x(vec2.x).w(vec2.y).z(vec2.z).y(vec2.w);
end xwzy;
----------------------------------------------------------------
procedure yxzw (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.y(vec2.x).x(vec2.y).z(vec2.z).w(vec2.w);
end yxzw;
----------------------------------------------------------------
procedure yxwz (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.y(vec2.x).x(vec2.y).w(vec2.z).z(vec2.w);
end yxwz;
----------------------------------------------------------------
procedure yzxw (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.y(vec2.x).z(vec2.y).x(vec2.z).w(vec2.w);
end yzxw;
----------------------------------------------------------------
procedure yzwx (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.y(vec2.x).z(vec2.y).w(vec2.z).x(vec2.w);
end yzwx;
----------------------------------------------------------------
procedure ywxz (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.y(vec2.x).w(vec2.y).x(vec2.z).z(vec2.w);
end ywxz;
----------------------------------------------------------------
procedure ywzx (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.y(vec2.x).w(vec2.y).z(vec2.z).x(vec2.w);
end ywzx;
----------------------------------------------------------------
procedure zxyw (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.z(vec2.x).x(vec2.y).y(vec2.z).w(vec2.w);
end zxyw;
----------------------------------------------------------------
procedure zxwy (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.z(vec2.x).x(vec2.y).w(vec2.z).y(vec2.w);
end zxwy;
----------------------------------------------------------------
procedure zyxw (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.z(vec2.x).y(vec2.y).x(vec2.z).w(vec2.w);
end zyxw;
----------------------------------------------------------------
procedure zywx (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.z(vec2.x).y(vec2.y).w(vec2.z).x(vec2.w);
end zywx;
----------------------------------------------------------------
procedure zwxy (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.z(vec2.x).w(vec2.y).x(vec2.z).y(vec2.w);
end zwxy;
----------------------------------------------------------------
procedure zwyx (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.z(vec2.x).w(vec2.y).y(vec2.z).x(vec2.w);
end zwyx;
----------------------------------------------------------------
procedure wxyz (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.w(vec2.x).x(vec2.y).y(vec2.z).z(vec2.w);
end wxyz;
----------------------------------------------------------------
procedure wxzy (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.w(vec2.x).x(vec2.y).z(vec2.z).y(vec2.w);
end wxzy;
----------------------------------------------------------------
procedure wyxz (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.w(vec2.x).y(vec2.y).x(vec2.z).z(vec2.w);
end wyxz;
----------------------------------------------------------------
procedure wyzx (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.w(vec2.x).y(vec2.y).z(vec2.z).x(vec2.w);
end wyzx;
----------------------------------------------------------------
procedure wzxy (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.w(vec2.x).z(vec2.y).x(vec2.z).y(vec2.w);
end wzxy;
----------------------------------------------------------------
procedure wzyx (vec1 : in out Vkm_GenType;
vec2 : in Vkm_GenType) is
begin
vec1.w(vec2.x).z(vec2.y).y(vec2.z).x(vec2.w);
end wzyx;
----------------------------------------------------------------------------
function Concatenate (Left, Right : in Vkm_GenType) return Vkm_GenType is
Result : Vkm_GenType(Left.Last_Index + Right.Last_Index + 1);
begin
Result.Copy(Left,Left.Length,0);
Result.Copy(Right,Right.Length,To_Vkm_Indices(Left.Length + 1));
return Result;
end Concatenate;
----------------------------------------------------------------------------
function Equals(left, right : in Vkm_GenType) return Vkm_Bool is
are_equal : Vkm_Bool := True;
begin
for index in Vkm_Indices'First .. left.last_index loop
if not (left.data(index) = right.data(index)) then
are_equal := False;
end if;
end loop;
return are_equal;
end Equals;
----------------------------------------------------------------------------
function Unary_Minus(instance : in Vkm_GenType) return Vkm_GenType is
result : Vkm_GenType(Last_Index => instance.last_index);
begin
for index in Vkm_Indices'First .. instance.last_index loop
result.data(index) := Unary_Minus(instance.data(index));
end loop;
return result;
end Unary_Minus;
----------------------------------------------------------------------------
function Componentwise_Multiply(left, right : in Vkm_GenType) return Vkm_GenType is
result : Vkm_GenType(last_index => left.last_index);
begin
for index in Vkm_Indices'First .. left.last_index loop
result.data(index) := Multiply(left.data(index), right.data(index));
end loop;
return result;
end Componentwise_Multiply;
--------------------------------------------------------------------------------
function Vector_By_Scalar_Multiply(left : in Vkm_GenType;
right : in Base_Type) return Vkm_GenType is
result : Vkm_GenType(last_index => left.last_index);
begin
for index in Vkm_Indices'First .. left.last_index loop
result.data(index) := Multiply(left.data(index), right);
end loop;
return result;
end Vector_By_Scalar_Multiply;
----------------------------------------------------------------------------
function Apply_Func_IV_IV_RV(Left, Right : in Vkm_GenType) return Vkm_GenType is
Result : Vkm_GenType(Last_Index => To_Vkm_Indices(Left.Length));
begin
for I in Vkm_Indices'First .. To_Vkm_Indices(Left.Length) loop
Result.data(I) := Func(Left.data(I), Right.data(I));
end loop;
return Result;
end Apply_Func_IV_IV_RV;
----------------------------------------------------------------------------
function Apply_Func_IS_IV_RV(Left : in Base_Type;
Right : in Vkm_GenType) return Vkm_GenType is
Result : Vkm_GenType(Last_Index => To_Vkm_Indices(Right.Length));
begin
for I in Vkm_Indices'First .. To_Vkm_Indices(Right.Length) loop
Result.data(I) := Func(Left, Right.data(I));
end loop;
return Result;
end Apply_Func_IS_IV_RV;
----------------------------------------------------------------------------
function Apply_Func_IV_IS_RV(Left : in Vkm_GenType;
Right : in Base_Type ) return Vkm_GenType is
Result : Vkm_GenType(Last_Index => To_Vkm_Indices(Left.Length));
begin
for I in Vkm_Indices'First .. To_Vkm_Indices(Left.Length) loop
Result.data(I) := Func(Left.data(I), Right);
end loop;
return Result;
end Apply_Func_IV_IS_RV;
----------------------------------------------------------------------------
function Apply_Func_IV_RV(A : in Vkm_GenType) return Vkm_GenType is
Result : Vkm_GenType(Last_Index => To_Vkm_Indices(A.Length));
begin
for I in Vkm_Indices'First .. To_Vkm_Indices(A.Length) loop
Result.data(I) := Func(A.data(I));
end loop;
return Result;
end Apply_Func_IV_RV;
function Apply_Func_IV_OV_RV(IV1 : in Vkm_GenType;
OV1 : out Vkm_GenType) return Vkm_GenType is
Result : Vkm_GenType(Last_Index => To_Vkm_Indices(IV1.Length));
begin
for I in Vkm_Indices'First .. To_Vkm_Indices(IV1.Length) loop
Result.data(I) := Func(IV1.data(I), OV1.data(I));
end loop;
return Result;
end Apply_Func_IV_OV_RV;
----------------------------------------------------------------------------
function Apply_Func_IV_IV_IV_RV(IV1, IV2, IV3 : in Vkm_GenType) return Vkm_GenType is
Result : Vkm_GenType(Last_Index => To_Vkm_Indices(IV1.Length));
begin
for I in Vkm_Indices'First .. To_Vkm_Indices(IV1.Length) loop
Result.data(I) := Func(IV1.data(I),IV2.data(I),IV3.data(I));
end loop;
return Result;
end Apply_Func_IV_IV_IV_RV;
----------------------------------------------------------------------------
function Apply_Func_IV_IV_IS_RV(IV1, IV2 : in Vkm_GenType;
IS1 : in Base_Type) return Vkm_GenType is
Result : Vkm_GenType(Last_Index => To_Vkm_Indices(IV1.Length));
begin
for I in Vkm_Indices'First .. To_Vkm_Indices(IV1.Length) loop
Result.data(I) := Func(IV1.data(I),IV2.data(I),IS1);
end loop;
return Result;
end Apply_Func_IV_IV_IS_RV;
----------------------------------------------------------------------------
function Apply_Func_IV_IS_IS_RV(IV1 : in Vkm_GenType;
IS1, IS2 : in Base_Type) return Vkm_GenType is
Result : Vkm_GenType(Last_Index => To_Vkm_Indices(IV1.Length));
begin
for I in Vkm_Indices'First .. To_Vkm_Indices(IV1.Length) loop
Result.data(I) := Func(IV1.data(I),IS1,IS2);
end loop;
return Result;
end Apply_Func_IV_IS_IS_RV;
----------------------------------------------------------------------------
function Apply_Func_IS_IS_IV_RV(IS1, IS2 : in Base_Type;
IV1 : in Vkm_GenType) return Vkm_GenType is
Result : Vkm_GenType(Last_Index => To_Vkm_Indices(IV1.Length));
begin
for I in Result.data'Range loop
Result.data(I) := Func(IS1,IS2,IV1.data(I));
end loop;
return Result;
end Apply_Func_IS_IS_IV_RV;
----------------------------------------------------------------------------
function Apply_Func_IV_IV_OV_RV(IV1, IV2 : in Vkm_GenType;
OV1 : out Vkm_GenType) return Vkm_GenType is
result : Vkm_GenType(last_index => IV1.last_index);
begin
for index in result.data'Range loop
result.data(index) := Func(IV1.data(index), IV2.data(index), OV1.data(index));
end loop;
return result;
end Apply_Func_IV_IV_OV_RV;
----------------------------------------------------------------------------
procedure Apply_Func_IV_IV_OV_OV(IV1, IV2 : in Vkm_GenType;
OV1, OV2 : out Vkm_GenType) is
begin
for index in IV1.data'Range loop
Func(IV1.data(index), IV2.data(index),
OV1.data(index), OV2.data(index));
end loop;
end Apply_Func_IV_IV_OV_OV;
----------------------------------------------------------------------------
function Apply_Func_IV_IV_IS_IS_RV(
IV1, IV2 : in Vkm_GenType;
IS1, IS2 : in Base_Type ) return Vkm_GenType is
result : Vkm_GenType(last_index => IV1.last_index);
begin
for index in IV1.data'Range loop
result.data(index) := Func(IV1.data(index),
IV2.data(index),
IS1,
IS2);
end loop;
return result;
end Apply_Func_IV_IV_IS_IS_RV;
end Vulkan.Math.GenType;
| 27.510363 | 95 | 0.422042 |
41e9423bc622444d721aea41b5c7f8f67be0b08a | 330 | adb | Ada | euler2.adb | kimtg/euler-ada | 9b12d59aefbb1e0da2d9b7308de463c8fc579294 | [
"Unlicense"
] | 7 | 2016-07-10T02:27:59.000Z | 2019-02-09T22:24:33.000Z | euler2.adb | kimtg/euler-ada | 9b12d59aefbb1e0da2d9b7308de463c8fc579294 | [
"Unlicense"
] | null | null | null | euler2.adb | kimtg/euler-ada | 9b12d59aefbb1e0da2d9b7308de463c8fc579294 | [
"Unlicense"
] | null | null | null | with ada.text_io;
use ada.text_io;
procedure euler2 is
a, b : integer := 1;
s : integer := 0;
begin
loop
declare
c : integer := a + b;
begin
exit when c > 4000000;
if c mod 2 = 0 then
s := s + c;
end if;
a := b;
b := c;
end;
end loop;
put_line(integer'image(s));
end euler2;
| 15 | 29 | 0.527273 |
59de79e49dedbb792b7e9a1b2824b4bde1c6e671 | 146,748 | ads | Ada | src/bitmap_fonts/giza-bitmap_fonts-freesansboldoblique32pt7b.ads | Fabien-Chouteau/Giza | 9f6c167666dbba8f0e5f0ba3e33825c0b3f399bd | [
"BSD-3-Clause"
] | 7 | 2017-10-18T02:40:24.000Z | 2020-12-19T22:41:19.000Z | src/bitmap_fonts/giza-bitmap_fonts-freesansboldoblique32pt7b.ads | Fabien-Chouteau/Giza | 9f6c167666dbba8f0e5f0ba3e33825c0b3f399bd | [
"BSD-3-Clause"
] | null | null | null | src/bitmap_fonts/giza-bitmap_fonts-freesansboldoblique32pt7b.ads | Fabien-Chouteau/Giza | 9f6c167666dbba8f0e5f0ba3e33825c0b3f399bd | [
"BSD-3-Clause"
] | 2 | 2019-05-06T08:30:26.000Z | 2020-11-22T11:27:27.000Z | package Giza.Bitmap_Fonts.FreeSansBoldOblique32pt7b is
Font : constant Giza.Font.Ref_Const;
private
FreeSansBoldOblique32pt7bBitmaps : aliased constant Font_Bitmap := (
16#00#, 16#38#, 16#00#, 16#07#, 16#FC#, 16#01#, 16#FF#, 16#80#, 16#3F#,
16#E0#, 16#07#, 16#FC#, 16#00#, 16#FF#, 16#80#, 16#3F#, 16#F0#, 16#07#,
16#FE#, 16#00#, 16#FF#, 16#80#, 16#1F#, 16#F0#, 16#03#, 16#FE#, 16#00#,
16#FF#, 16#C0#, 16#1F#, 16#F0#, 16#03#, 16#FE#, 16#00#, 16#7F#, 16#C0#,
16#0F#, 16#F8#, 16#01#, 16#FE#, 16#00#, 16#3F#, 16#C0#, 16#07#, 16#F8#,
16#00#, 16#FE#, 16#00#, 16#1F#, 16#C0#, 16#07#, 16#F8#, 16#00#, 16#FE#,
16#00#, 16#1F#, 16#C0#, 16#03#, 16#F0#, 16#00#, 16#7E#, 16#00#, 16#0F#,
16#C0#, 16#01#, 16#F0#, 16#00#, 16#3E#, 16#00#, 16#07#, 16#C0#, 16#00#,
16#F0#, 16#00#, 16#1E#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#,
16#0F#, 16#F8#, 16#03#, 16#FF#, 16#00#, 16#7F#, 16#E0#, 16#0F#, 16#F8#,
16#01#, 16#FF#, 16#00#, 16#3F#, 16#E0#, 16#0F#, 16#FC#, 16#01#, 16#FF#,
16#00#, 16#00#, 16#3F#, 16#C0#, 16#7F#, 16#BF#, 16#E0#, 16#7F#, 16#DF#,
16#E0#, 16#3F#, 16#CF#, 16#F0#, 16#1F#, 16#E7#, 16#F8#, 16#0F#, 16#F3#,
16#FC#, 16#07#, 16#FB#, 16#FE#, 16#07#, 16#FD#, 16#FE#, 16#03#, 16#FC#,
16#FF#, 16#01#, 16#FE#, 16#7F#, 16#80#, 16#FF#, 16#3F#, 16#80#, 16#7F#,
16#1F#, 16#80#, 16#3F#, 16#0F#, 16#C0#, 16#1F#, 16#83#, 16#C0#, 16#07#,
16#81#, 16#E0#, 16#03#, 16#C0#, 16#E0#, 16#01#, 16#C0#, 16#00#, 16#00#,
16#1F#, 16#80#, 16#FC#, 16#00#, 16#00#, 16#3F#, 16#81#, 16#FC#, 16#00#,
16#00#, 16#3F#, 16#01#, 16#FC#, 16#00#, 16#00#, 16#7F#, 16#03#, 16#F8#,
16#00#, 16#00#, 16#7E#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#FE#, 16#03#,
16#F0#, 16#00#, 16#00#, 16#FE#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#FC#,
16#07#, 16#E0#, 16#00#, 16#01#, 16#FC#, 16#0F#, 16#E0#, 16#00#, 16#01#,
16#F8#, 16#0F#, 16#C0#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#01#,
16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#03#, 16#FF#, 16#FF#, 16#FF#, 16#FE#,
16#03#, 16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#03#, 16#FF#, 16#FF#, 16#FF#,
16#FE#, 16#03#, 16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#03#, 16#FF#, 16#FF#,
16#FF#, 16#FC#, 16#00#, 16#0F#, 16#C0#, 16#7E#, 16#00#, 16#00#, 16#1F#,
16#C0#, 16#FE#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#FC#, 16#00#, 16#00#,
16#3F#, 16#81#, 16#FC#, 16#00#, 16#00#, 16#3F#, 16#81#, 16#FC#, 16#00#,
16#00#, 16#7F#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#7F#, 16#03#, 16#F8#,
16#00#, 16#00#, 16#7E#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#FE#, 16#07#,
16#F0#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#7F#, 16#FF#,
16#FF#, 16#FF#, 16#C0#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#7F#,
16#FF#, 16#FF#, 16#FF#, 16#80#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#80#,
16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#7F#, 16#FF#, 16#FF#, 16#FF#,
16#80#, 16#07#, 16#F0#, 16#3F#, 16#80#, 16#00#, 16#07#, 16#E0#, 16#3F#,
16#00#, 16#00#, 16#0F#, 16#E0#, 16#7F#, 16#00#, 16#00#, 16#0F#, 16#C0#,
16#7F#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#7E#, 16#00#, 16#00#, 16#1F#,
16#C0#, 16#FE#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#FC#, 16#00#, 16#00#,
16#3F#, 16#81#, 16#FC#, 16#00#, 16#00#, 16#3F#, 16#01#, 16#F8#, 16#00#,
16#00#, 16#7F#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#7E#, 16#03#, 16#F0#,
16#00#, 16#00#, 16#FE#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#,
16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#,
16#07#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#E0#, 16#00#,
16#1F#, 16#FF#, 16#FF#, 16#80#, 16#01#, 16#FF#, 16#FF#, 16#FC#, 16#00#,
16#1F#, 16#FF#, 16#FF#, 16#F0#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 16#80#,
16#1F#, 16#F9#, 16#E3#, 16#FE#, 16#00#, 16#FF#, 16#0F#, 16#1F#, 16#F0#,
16#0F#, 16#F0#, 16#78#, 16#7F#, 16#80#, 16#7F#, 16#83#, 16#C3#, 16#FC#,
16#07#, 16#F8#, 16#1E#, 16#1F#, 16#E0#, 16#3F#, 16#C1#, 16#E0#, 16#FF#,
16#01#, 16#FE#, 16#0F#, 16#07#, 16#F8#, 16#0F#, 16#F0#, 16#78#, 16#00#,
16#00#, 16#7F#, 16#83#, 16#C0#, 16#00#, 16#03#, 16#FE#, 16#3C#, 16#00#,
16#00#, 16#1F#, 16#FD#, 16#E0#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#00#,
16#00#, 16#03#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#F8#,
16#00#, 16#00#, 16#7F#, 16#FF#, 16#F0#, 16#00#, 16#01#, 16#FF#, 16#FF#,
16#E0#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#0F#, 16#FF#,
16#FE#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#3F#,
16#FF#, 16#C0#, 16#00#, 16#01#, 16#EF#, 16#FF#, 16#00#, 16#00#, 16#0F#,
16#3F#, 16#F8#, 16#00#, 16#00#, 16#79#, 16#FF#, 16#C0#, 16#00#, 16#03#,
16#C7#, 16#FE#, 16#00#, 16#00#, 16#3C#, 16#3F#, 16#F1#, 16#FF#, 16#81#,
16#E1#, 16#FF#, 16#8F#, 16#FC#, 16#0F#, 16#0F#, 16#FC#, 16#7F#, 16#E0#,
16#78#, 16#7F#, 16#C3#, 16#FF#, 16#07#, 16#87#, 16#FE#, 16#1F#, 16#F8#,
16#3C#, 16#3F#, 16#F0#, 16#FF#, 16#E1#, 16#E3#, 16#FF#, 16#07#, 16#FF#,
16#8F#, 16#3F#, 16#F8#, 16#1F#, 16#FF#, 16#F7#, 16#FF#, 16#80#, 16#FF#,
16#FF#, 16#FF#, 16#F8#, 16#03#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#0F#,
16#FF#, 16#FF#, 16#F8#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#00#, 16#00#,
16#7F#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#FF#, 16#FC#, 16#00#, 16#00#,
16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#,
16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#,
16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#00#,
16#01#, 16#F0#, 16#00#, 16#7F#, 16#F8#, 16#00#, 16#00#, 16#F8#, 16#00#,
16#7F#, 16#FE#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#FF#, 16#FF#, 16#80#,
16#00#, 16#F8#, 16#00#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#F8#, 16#00#,
16#FF#, 16#FF#, 16#F0#, 16#00#, 16#7C#, 16#00#, 16#7F#, 16#FF#, 16#FC#,
16#00#, 16#7C#, 16#00#, 16#7F#, 16#83#, 16#FE#, 16#00#, 16#7C#, 16#00#,
16#7F#, 16#80#, 16#7F#, 16#00#, 16#7C#, 16#00#, 16#3F#, 16#00#, 16#1F#,
16#80#, 16#3E#, 16#00#, 16#1F#, 16#80#, 16#0F#, 16#C0#, 16#3E#, 16#00#,
16#1F#, 16#80#, 16#07#, 16#E0#, 16#3E#, 16#00#, 16#0F#, 16#C0#, 16#03#,
16#F0#, 16#3E#, 16#00#, 16#07#, 16#E0#, 16#03#, 16#F0#, 16#1F#, 16#00#,
16#03#, 16#F0#, 16#01#, 16#F8#, 16#1F#, 16#00#, 16#01#, 16#FC#, 16#03#,
16#FC#, 16#1F#, 16#00#, 16#00#, 16#FF#, 16#03#, 16#FC#, 16#1F#, 16#00#,
16#00#, 16#7F#, 16#FF#, 16#FC#, 16#1F#, 16#00#, 16#00#, 16#1F#, 16#FF#,
16#FE#, 16#0F#, 16#80#, 16#00#, 16#0F#, 16#FF#, 16#FE#, 16#0F#, 16#80#,
16#00#, 16#03#, 16#FF#, 16#FE#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#FF#,
16#FC#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#3F#, 16#FC#, 16#07#, 16#C0#,
16#00#, 16#00#, 16#07#, 16#F0#, 16#07#, 16#C0#, 16#1F#, 16#C0#, 16#00#,
16#00#, 16#07#, 16#C0#, 16#7F#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#C0#,
16#FF#, 16#FE#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#FF#, 16#FF#, 16#80#,
16#00#, 16#03#, 16#E0#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#03#, 16#E0#,
16#FF#, 16#FF#, 16#F0#, 16#00#, 16#03#, 16#E0#, 16#FF#, 16#FF#, 16#FC#,
16#00#, 16#03#, 16#F0#, 16#7F#, 16#81#, 16#FE#, 16#00#, 16#01#, 16#F0#,
16#7F#, 16#00#, 16#7F#, 16#00#, 16#01#, 16#F0#, 16#3F#, 16#00#, 16#1F#,
16#80#, 16#01#, 16#F0#, 16#3F#, 16#80#, 16#0F#, 16#C0#, 16#01#, 16#F0#,
16#1F#, 16#80#, 16#07#, 16#E0#, 16#00#, 16#F8#, 16#0F#, 16#C0#, 16#03#,
16#F0#, 16#00#, 16#F8#, 16#07#, 16#E0#, 16#03#, 16#F0#, 16#00#, 16#F8#,
16#03#, 16#F8#, 16#03#, 16#F8#, 16#00#, 16#F8#, 16#01#, 16#FE#, 16#07#,
16#F8#, 16#00#, 16#7C#, 16#00#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#7C#,
16#00#, 16#3F#, 16#FF#, 16#FC#, 16#00#, 16#7C#, 16#00#, 16#1F#, 16#FF#,
16#FC#, 16#00#, 16#7C#, 16#00#, 16#07#, 16#FF#, 16#FC#, 16#00#, 16#3E#,
16#00#, 16#01#, 16#FF#, 16#FC#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#7F#,
16#F8#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FC#, 16#00#,
16#00#, 16#00#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FF#,
16#80#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#07#, 16#FF#,
16#FF#, 16#C0#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#1F#,
16#FC#, 16#7F#, 16#C0#, 16#00#, 16#1F#, 16#F8#, 16#3F#, 16#C0#, 16#00#,
16#3F#, 16#F0#, 16#3F#, 16#C0#, 16#00#, 16#3F#, 16#F0#, 16#3F#, 16#C0#,
16#00#, 16#3F#, 16#F0#, 16#3F#, 16#80#, 16#00#, 16#3F#, 16#F0#, 16#7F#,
16#80#, 16#00#, 16#3F#, 16#F8#, 16#7F#, 16#00#, 16#00#, 16#3F#, 16#F8#,
16#FF#, 16#00#, 16#00#, 16#1F#, 16#FD#, 16#FE#, 16#00#, 16#00#, 16#1F#,
16#FF#, 16#FC#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#F8#, 16#00#, 16#00#,
16#0F#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#E0#, 16#00#,
16#00#, 16#03#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#00#,
16#00#, 16#00#, 16#3F#, 16#FF#, 16#80#, 16#7F#, 16#00#, 16#FF#, 16#FF#,
16#C0#, 16#7F#, 16#01#, 16#FF#, 16#FF#, 16#C0#, 16#FF#, 16#07#, 16#FF#,
16#FF#, 16#E0#, 16#FE#, 16#0F#, 16#FF#, 16#3F#, 16#E0#, 16#FE#, 16#1F#,
16#FC#, 16#3F#, 16#F1#, 16#FC#, 16#3F#, 16#F8#, 16#1F#, 16#FB#, 16#FC#,
16#3F#, 16#F0#, 16#1F#, 16#FF#, 16#F8#, 16#7F#, 16#E0#, 16#0F#, 16#FF#,
16#F8#, 16#7F#, 16#C0#, 16#07#, 16#FF#, 16#F0#, 16#FF#, 16#C0#, 16#07#,
16#FF#, 16#F0#, 16#FF#, 16#C0#, 16#03#, 16#FF#, 16#E0#, 16#FF#, 16#C0#,
16#03#, 16#FF#, 16#C0#, 16#FF#, 16#C0#, 16#01#, 16#FF#, 16#80#, 16#FF#,
16#C0#, 16#01#, 16#FF#, 16#80#, 16#FF#, 16#E0#, 16#07#, 16#FF#, 16#C0#,
16#FF#, 16#F0#, 16#0F#, 16#FF#, 16#C0#, 16#FF#, 16#F8#, 16#3F#, 16#FF#,
16#E0#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#7F#, 16#FF#, 16#FF#,
16#FF#, 16#F0#, 16#3F#, 16#FF#, 16#FF#, 16#BF#, 16#F8#, 16#1F#, 16#FF#,
16#FF#, 16#1F#, 16#F8#, 16#0F#, 16#FF#, 16#FC#, 16#1F#, 16#FC#, 16#03#,
16#FF#, 16#F0#, 16#0F#, 16#FC#, 16#00#, 16#FF#, 16#C0#, 16#00#, 16#00#,
16#3F#, 16#DF#, 16#F7#, 16#F9#, 16#FE#, 16#7F#, 16#9F#, 16#EF#, 16#FB#,
16#FC#, 16#FF#, 16#3F#, 16#CF#, 16#E3#, 16#F0#, 16#FC#, 16#1E#, 16#07#,
16#81#, 16#C0#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#03#, 16#F8#, 16#00#,
16#07#, 16#E0#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#7F#, 16#00#, 16#01#,
16#FC#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#3F#,
16#80#, 16#00#, 16#FF#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#07#, 16#F0#,
16#00#, 16#1F#, 16#E0#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#FF#, 16#00#,
16#01#, 16#FC#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#0F#, 16#E0#, 16#00#,
16#3F#, 16#C0#, 16#00#, 16#7F#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#03#,
16#F8#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#3F#,
16#80#, 16#00#, 16#7F#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#03#, 16#F8#,
16#00#, 16#07#, 16#F0#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#1F#, 16#C0#,
16#00#, 16#7F#, 16#80#, 16#00#, 16#FE#, 16#00#, 16#01#, 16#FC#, 16#00#,
16#03#, 16#F8#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#0F#, 16#E0#, 16#00#,
16#1F#, 16#C0#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#7F#, 16#00#, 16#00#,
16#FE#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#07#,
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#80#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#FE#,
16#00#, 16#00#, 16#FC#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#03#, 16#F8#,
16#00#, 16#03#, 16#F0#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#0F#, 16#E0#,
16#00#, 16#0F#, 16#C0#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#1F#, 16#80#,
16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#1F#,
16#80#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#7E#,
16#00#, 16#00#, 16#FE#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#01#, 16#F8#,
16#00#, 16#03#, 16#F0#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#0F#, 16#E0#,
16#00#, 16#1F#, 16#C0#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#3F#, 16#00#,
16#00#, 16#7F#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#01#, 16#FC#, 16#00#,
16#03#, 16#F8#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#0F#, 16#E0#, 16#00#,
16#1F#, 16#C0#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#7F#, 16#00#, 16#00#,
16#FE#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#0F#,
16#E0#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#7F#,
16#00#, 16#00#, 16#FE#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#07#, 16#F0#,
16#00#, 16#0F#, 16#E0#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#7F#, 16#00#,
16#00#, 16#FE#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#07#, 16#F0#, 16#00#,
16#1F#, 16#E0#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#FF#, 16#00#, 16#01#,
16#FC#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#3F#,
16#C0#, 16#00#, 16#7F#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#07#, 16#F8#,
16#00#, 16#0F#, 16#E0#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#FE#, 16#00#,
16#01#, 16#FC#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#1F#, 16#C0#, 16#00#,
16#3F#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#,
16#00#, 16#3E#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#0F#, 16#00#, 16#00#,
16#78#, 16#00#, 16#07#, 16#C0#, 16#18#, 16#3E#, 16#08#, 16#F1#, 16#E3#,
16#EF#, 16#FF#, 16#FF#, 16#7F#, 16#FF#, 16#FB#, 16#FF#, 16#FF#, 16#C3#,
16#FF#, 16#E0#, 16#07#, 16#F8#, 16#00#, 16#3F#, 16#C0#, 16#03#, 16#FF#,
16#00#, 16#3E#, 16#F8#, 16#03#, 16#E7#, 16#E0#, 16#3E#, 16#1F#, 16#03#,
16#E0#, 16#FC#, 16#0F#, 16#03#, 16#80#, 16#10#, 16#10#, 16#00#, 16#00#,
16#01#, 16#FC#, 16#00#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#00#, 16#01#,
16#FC#, 16#00#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#00#, 16#03#, 16#F8#,
16#00#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#00#,
16#00#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#00#,
16#07#, 16#F0#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#7F#, 16#FF#,
16#FF#, 16#FF#, 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#FF#, 16#FF#, 16#FF#, 16#FE#,
16#FF#, 16#FF#, 16#FF#, 16#FC#, 16#FF#, 16#FF#, 16#FF#, 16#FC#, 16#00#,
16#1F#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#00#, 16#1F#,
16#C0#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#3F#, 16#C0#,
16#00#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#00#,
16#00#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#00#,
16#7F#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#00#, 16#7F#,
16#00#, 16#00#, 16#0F#, 16#F8#, 16#7F#, 16#C3#, 16#FE#, 16#1F#, 16#E1#,
16#FF#, 16#0F#, 16#F8#, 16#7F#, 16#C3#, 16#FC#, 16#3F#, 16#E1#, 16#FF#,
16#00#, 16#78#, 16#03#, 16#C0#, 16#3C#, 16#01#, 16#E0#, 16#1F#, 16#01#,
16#F0#, 16#3F#, 16#03#, 16#F0#, 16#3F#, 16#01#, 16#F0#, 16#0C#, 16#00#,
16#00#, 16#3F#, 16#FF#, 16#E7#, 16#FF#, 16#FD#, 16#FF#, 16#FF#, 16#3F#,
16#FF#, 16#E7#, 16#FF#, 16#FC#, 16#FF#, 16#FF#, 16#BF#, 16#FF#, 16#E7#,
16#FF#, 16#FC#, 16#3F#, 16#E7#, 16#FD#, 16#FF#, 16#3F#, 16#E7#, 16#FC#,
16#FF#, 16#9F#, 16#F7#, 16#FC#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#01#,
16#E0#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#,
16#01#, 16#C0#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#0E#, 16#00#,
16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#1E#,
16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#1C#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#01#, 16#E0#, 16#00#,
16#00#, 16#3C#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#01#, 16#E0#,
16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#03#,
16#C0#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#,
16#03#, 16#80#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#1C#, 16#00#,
16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#,
16#38#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#,
16#00#, 16#78#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#03#, 16#C0#,
16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#03#,
16#80#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#,
16#07#, 16#80#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#3C#, 16#00#,
16#00#, 16#07#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#00#,
16#00#, 16#1F#, 16#FF#, 16#F8#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#80#,
16#03#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#00#,
16#1F#, 16#FF#, 16#FF#, 16#F0#, 16#07#, 16#FE#, 16#1F#, 16#FE#, 16#01#,
16#FF#, 16#80#, 16#FF#, 16#E0#, 16#7F#, 16#E0#, 16#1F#, 16#FC#, 16#0F#,
16#F8#, 16#01#, 16#FF#, 16#83#, 16#FE#, 16#00#, 16#3F#, 16#F0#, 16#7F#,
16#C0#, 16#07#, 16#FE#, 16#1F#, 16#F8#, 16#00#, 16#FF#, 16#C3#, 16#FE#,
16#00#, 16#1F#, 16#F8#, 16#7F#, 16#C0#, 16#03#, 16#FF#, 16#1F#, 16#F8#,
16#00#, 16#7F#, 16#E3#, 16#FF#, 16#00#, 16#0F#, 16#FC#, 16#7F#, 16#C0#,
16#03#, 16#FF#, 16#9F#, 16#F8#, 16#00#, 16#7F#, 16#E3#, 16#FF#, 16#00#,
16#0F#, 16#FC#, 16#7F#, 16#E0#, 16#01#, 16#FF#, 16#9F#, 16#F8#, 16#00#,
16#3F#, 16#F3#, 16#FF#, 16#00#, 16#07#, 16#FE#, 16#7F#, 16#E0#, 16#01#,
16#FF#, 16#8F#, 16#FC#, 16#00#, 16#3F#, 16#F1#, 16#FF#, 16#80#, 16#07#,
16#FE#, 16#3F#, 16#F0#, 16#00#, 16#FF#, 16#CF#, 16#FC#, 16#00#, 16#3F#,
16#F1#, 16#FF#, 16#80#, 16#07#, 16#FE#, 16#3F#, 16#F0#, 16#00#, 16#FF#,
16#C7#, 16#FE#, 16#00#, 16#1F#, 16#F0#, 16#FF#, 16#C0#, 16#07#, 16#FE#,
16#1F#, 16#F8#, 16#00#, 16#FF#, 16#C3#, 16#FF#, 16#00#, 16#3F#, 16#F0#,
16#7F#, 16#E0#, 16#07#, 16#FE#, 16#0F#, 16#FE#, 16#01#, 16#FF#, 16#81#,
16#FF#, 16#C0#, 16#7F#, 16#E0#, 16#1F#, 16#FC#, 16#1F#, 16#FC#, 16#03#,
16#FF#, 16#FF#, 16#FF#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#C0#, 16#07#,
16#FF#, 16#FF#, 16#F8#, 16#00#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#0F#,
16#FF#, 16#FF#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#07#,
16#FF#, 16#E0#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#FC#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#1F#, 16#C0#, 16#00#,
16#FF#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#3F#, 16#E0#, 16#03#, 16#FF#,
16#80#, 16#7F#, 16#FE#, 16#7F#, 16#FF#, 16#F1#, 16#FF#, 16#FF#, 16#C7#,
16#FF#, 16#FF#, 16#3F#, 16#FF#, 16#FC#, 16#FF#, 16#FF#, 16#F3#, 16#FF#,
16#FF#, 16#80#, 16#01#, 16#FE#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#1F#,
16#E0#, 16#00#, 16#FF#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#0F#, 16#F0#,
16#00#, 16#3F#, 16#C0#, 16#01#, 16#FF#, 16#00#, 16#07#, 16#F8#, 16#00#,
16#1F#, 16#E0#, 16#00#, 16#7F#, 16#80#, 16#03#, 16#FE#, 16#00#, 16#0F#,
16#F0#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#FF#, 16#00#, 16#03#, 16#FC#,
16#00#, 16#1F#, 16#E0#, 16#00#, 16#7F#, 16#80#, 16#01#, 16#FE#, 16#00#,
16#07#, 16#F8#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#FF#, 16#00#, 16#03#,
16#FC#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#7F#, 16#C0#, 16#01#, 16#FE#,
16#00#, 16#07#, 16#F8#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#7F#, 16#80#,
16#03#, 16#FC#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#0F#,
16#FC#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#07#,
16#FF#, 16#FF#, 16#80#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#80#, 16#00#,
16#FF#, 16#FF#, 16#FF#, 16#80#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 16#80#,
16#07#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#1F#, 16#FC#, 16#1F#, 16#FE#,
16#00#, 16#7F#, 16#E0#, 16#0F#, 16#FE#, 16#00#, 16#FF#, 16#80#, 16#1F#,
16#FC#, 16#03#, 16#FE#, 16#00#, 16#1F#, 16#F8#, 16#07#, 16#F8#, 16#00#,
16#3F#, 16#F0#, 16#0F#, 16#F0#, 16#00#, 16#7F#, 16#E0#, 16#3F#, 16#E0#,
16#00#, 16#FF#, 16#C0#, 16#7F#, 16#80#, 16#01#, 16#FF#, 16#80#, 16#FF#,
16#00#, 16#07#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FC#, 16#00#,
16#00#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#E0#,
16#00#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#07#, 16#FF#,
16#00#, 16#00#, 16#00#, 16#1F#, 16#FC#, 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#0F#,
16#FF#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#F8#, 16#00#, 16#00#, 16#01#,
16#FF#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#80#, 16#00#, 16#00#,
16#3F#, 16#FC#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#E0#, 16#00#, 16#00#,
16#0F#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#3F#, 16#FC#, 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#0F#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#00#,
16#00#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#1F#, 16#FF#,
16#FF#, 16#FF#, 16#80#, 16#3F#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#FF#,
16#FF#, 16#FF#, 16#FE#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 16#FC#, 16#03#,
16#FF#, 16#FF#, 16#FF#, 16#F0#, 16#0F#, 16#FF#, 16#FF#, 16#FF#, 16#E0#,
16#1F#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#3F#,
16#F0#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#E0#, 16#00#, 16#07#, 16#FF#,
16#FF#, 16#80#, 16#00#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#1F#, 16#FF#,
16#FF#, 16#E0#, 16#03#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#7F#, 16#FF#,
16#FF#, 16#F0#, 16#0F#, 16#FC#, 16#1F#, 16#FF#, 16#00#, 16#FF#, 16#80#,
16#7F#, 16#F0#, 16#1F#, 16#F0#, 16#03#, 16#FF#, 16#01#, 16#FE#, 16#00#,
16#3F#, 16#F0#, 16#1F#, 16#E0#, 16#03#, 16#FF#, 16#01#, 16#FE#, 16#00#,
16#3F#, 16#F0#, 16#3F#, 16#C0#, 16#03#, 16#FE#, 16#03#, 16#FC#, 16#00#,
16#7F#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#00#,
16#FF#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#F8#, 16#00#, 16#00#, 16#0F#,
16#FF#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#FF#,
16#F8#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#00#, 16#00#, 16#01#, 16#FF#,
16#FC#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#E0#, 16#00#, 16#01#, 16#FF#,
16#FE#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#0F#,
16#FF#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#F8#, 16#00#, 16#00#, 16#03#,
16#FF#, 16#80#, 16#00#, 16#00#, 16#1F#, 16#F8#, 16#00#, 16#00#, 16#01#,
16#FF#, 16#80#, 16#00#, 16#00#, 16#1F#, 16#F8#, 16#00#, 16#00#, 16#01#,
16#FF#, 16#8F#, 16#FC#, 16#00#, 16#1F#, 16#F8#, 16#FF#, 16#C0#, 16#03#,
16#FF#, 16#0F#, 16#FC#, 16#00#, 16#3F#, 16#F0#, 16#FF#, 16#C0#, 16#07#,
16#FF#, 16#0F#, 16#FE#, 16#00#, 16#FF#, 16#E0#, 16#FF#, 16#F8#, 16#3F#,
16#FE#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#7F#, 16#FF#, 16#FF#,
16#F8#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#3F#, 16#FF#, 16#FF#,
16#E0#, 16#01#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#0F#, 16#FF#, 16#FF#,
16#80#, 16#00#, 16#3F#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#7F#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#C0#, 16#00#, 16#00#,
16#FF#, 16#E0#, 16#00#, 16#00#, 16#7F#, 16#F8#, 16#00#, 16#00#, 16#3F#,
16#FE#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#80#, 16#00#, 16#07#, 16#FF#,
16#C0#, 16#00#, 16#03#, 16#FF#, 16#F0#, 16#00#, 16#01#, 16#FF#, 16#FC#,
16#00#, 16#00#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#7F#, 16#7F#, 16#C0#,
16#00#, 16#1F#, 16#9F#, 16#E0#, 16#00#, 16#0F#, 16#C7#, 16#F8#, 16#00#,
16#07#, 16#E3#, 16#FE#, 16#00#, 16#03#, 16#F8#, 16#FF#, 16#80#, 16#01#,
16#FC#, 16#3F#, 16#C0#, 16#00#, 16#FE#, 16#0F#, 16#F0#, 16#00#, 16#3F#,
16#07#, 16#FC#, 16#00#, 16#1F#, 16#81#, 16#FF#, 16#00#, 16#0F#, 16#C0#,
16#7F#, 16#80#, 16#07#, 16#F0#, 16#1F#, 16#E0#, 16#03#, 16#F8#, 16#07#,
16#F8#, 16#00#, 16#FC#, 16#03#, 16#FE#, 16#00#, 16#7E#, 16#00#, 16#FF#,
16#80#, 16#3F#, 16#00#, 16#3F#, 16#C0#, 16#1F#, 16#C0#, 16#0F#, 16#F0#,
16#0F#, 16#E0#, 16#07#, 16#FC#, 16#07#, 16#F0#, 16#01#, 16#FF#, 16#01#,
16#FF#, 16#FF#, 16#FF#, 16#FC#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#1F#,
16#FF#, 16#FF#, 16#FF#, 16#CF#, 16#FF#, 16#FF#, 16#FF#, 16#F3#, 16#FF#,
16#FF#, 16#FF#, 16#FC#, 16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#3F#, 16#FF#,
16#FF#, 16#FF#, 16#80#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#00#, 16#01#,
16#FF#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#00#, 16#1F#,
16#F0#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#FE#,
16#00#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#3F#, 16#E0#,
16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#FC#, 16#00#,
16#00#, 16#07#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#3F#, 16#FF#, 16#FF#,
16#C0#, 16#03#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#1F#, 16#FF#, 16#FF#,
16#E0#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#0F#, 16#FF#, 16#FF#,
16#F8#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#C0#, 16#07#, 16#FF#, 16#FF#,
16#FC#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#,
16#00#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#00#,
16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#00#,
16#00#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#87#,
16#F0#, 16#00#, 16#01#, 16#FC#, 16#FF#, 16#F0#, 16#00#, 16#0F#, 16#FF#,
16#FF#, 16#C0#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#07#, 16#FF#,
16#FF#, 16#FC#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#F0#, 16#03#, 16#FF#,
16#FF#, 16#FF#, 16#80#, 16#1F#, 16#F8#, 16#3F#, 16#FE#, 16#01#, 16#FF#,
16#80#, 16#7F#, 16#F0#, 16#0F#, 16#F8#, 16#03#, 16#FF#, 16#80#, 16#00#,
16#00#, 16#0F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#E0#, 16#00#,
16#00#, 16#03#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#F8#, 16#00#,
16#00#, 16#00#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#FC#, 16#00#,
16#00#, 16#00#, 16#7F#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#07#,
16#FE#, 16#00#, 16#1F#, 16#F0#, 16#3F#, 16#F0#, 16#01#, 16#FF#, 16#81#,
16#FF#, 16#80#, 16#1F#, 16#F8#, 16#0F#, 16#FE#, 16#01#, 16#FF#, 16#C0#,
16#7F#, 16#F8#, 16#1F#, 16#FC#, 16#03#, 16#FF#, 16#FF#, 16#FF#, 16#E0#,
16#0F#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#E0#,
16#01#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#E0#,
16#00#, 16#1F#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#80#,
16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#,
16#E0#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#00#, 16#00#, 16#3F#, 16#FF#,
16#E0#, 16#00#, 16#3F#, 16#FF#, 16#FC#, 16#00#, 16#1F#, 16#FF#, 16#FF#,
16#80#, 16#0F#, 16#FF#, 16#FF#, 16#F0#, 16#07#, 16#FF#, 16#FF#, 16#FC#,
16#03#, 16#FF#, 16#03#, 16#FF#, 16#01#, 16#FF#, 16#00#, 16#7F#, 16#C0#,
16#7F#, 16#80#, 16#0F#, 16#F0#, 16#3F#, 16#C0#, 16#03#, 16#FC#, 16#0F#,
16#F0#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#01#, 16#FE#,
16#00#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#C0#,
16#00#, 16#00#, 16#1F#, 16#F0#, 16#7F#, 16#00#, 16#07#, 16#F8#, 16#FF#,
16#F8#, 16#01#, 16#FE#, 16#FF#, 16#FF#, 16#80#, 16#FF#, 16#FF#, 16#FF#,
16#F0#, 16#3F#, 16#FF#, 16#FF#, 16#FC#, 16#0F#, 16#FF#, 16#FF#, 16#FF#,
16#83#, 16#FF#, 16#FF#, 16#FF#, 16#E1#, 16#FF#, 16#F0#, 16#7F#, 16#FC#,
16#7F#, 16#F0#, 16#07#, 16#FF#, 16#1F#, 16#F8#, 16#01#, 16#FF#, 16#C7#,
16#FC#, 16#00#, 16#3F#, 16#F1#, 16#FF#, 16#00#, 16#0F#, 16#FC#, 16#FF#,
16#80#, 16#03#, 16#FF#, 16#3F#, 16#E0#, 16#00#, 16#FF#, 16#CF#, 16#F0#,
16#00#, 16#3F#, 16#F3#, 16#FC#, 16#00#, 16#0F#, 16#F8#, 16#FF#, 16#00#,
16#07#, 16#FE#, 16#3F#, 16#C0#, 16#01#, 16#FF#, 16#8F#, 16#F0#, 16#00#,
16#FF#, 16#C3#, 16#FC#, 16#00#, 16#3F#, 16#F0#, 16#FF#, 16#80#, 16#1F#,
16#F8#, 16#3F#, 16#F0#, 16#0F#, 16#FE#, 16#0F#, 16#FE#, 16#0F#, 16#FF#,
16#01#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#7F#, 16#FF#, 16#FF#, 16#E0#,
16#0F#, 16#FF#, 16#FF#, 16#F0#, 16#03#, 16#FF#, 16#FF#, 16#F8#, 16#00#,
16#7F#, 16#FF#, 16#FC#, 16#00#, 16#0F#, 16#FF#, 16#FC#, 16#00#, 16#00#,
16#FF#, 16#FC#, 16#00#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#1F#,
16#FF#, 16#FF#, 16#FF#, 16#E3#, 16#FF#, 16#FF#, 16#FF#, 16#F8#, 16#7F#,
16#FF#, 16#FF#, 16#FF#, 16#0F#, 16#FF#, 16#FF#, 16#FF#, 16#E3#, 16#FF#,
16#FF#, 16#FF#, 16#FC#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#8F#, 16#FF#,
16#FF#, 16#FF#, 16#E1#, 16#FF#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#00#,
16#01#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#00#,
16#1F#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#01#,
16#FF#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#00#, 16#1F#,
16#F0#, 16#00#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#FF#,
16#80#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#F8#,
16#00#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#80#,
16#00#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#FC#, 16#00#,
16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#,
16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#00#,
16#00#, 16#7F#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#00#,
16#03#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#00#,
16#1F#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#00#,
16#FF#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#, 16#07#,
16#FC#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#3F#,
16#E0#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#01#, 16#FF#,
16#00#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#F8#,
16#00#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#E0#,
16#00#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#3F#, 16#E0#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#C0#, 16#00#, 16#03#,
16#FF#, 16#FF#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#1F#,
16#FF#, 16#FF#, 16#C0#, 16#03#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#7F#,
16#FF#, 16#FF#, 16#E0#, 16#07#, 16#FC#, 16#0F#, 16#FF#, 16#00#, 16#FF#,
16#80#, 16#3F#, 16#F0#, 16#0F#, 16#E0#, 16#01#, 16#FF#, 16#01#, 16#FE#,
16#00#, 16#0F#, 16#F0#, 16#1F#, 16#C0#, 16#00#, 16#FF#, 16#01#, 16#FC#,
16#00#, 16#0F#, 16#F0#, 16#1F#, 16#C0#, 16#01#, 16#FE#, 16#01#, 16#FC#,
16#00#, 16#1F#, 16#E0#, 16#1F#, 16#C0#, 16#03#, 16#FC#, 16#01#, 16#FE#,
16#00#, 16#7F#, 16#80#, 16#0F#, 16#F0#, 16#3F#, 16#F8#, 16#00#, 16#7F#,
16#FF#, 16#FE#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#3F#,
16#FF#, 16#F8#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#FF#,
16#FF#, 16#FC#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#E0#, 16#07#, 16#FF#,
16#FF#, 16#FF#, 16#00#, 16#FF#, 16#E0#, 16#FF#, 16#F0#, 16#1F#, 16#F8#,
16#03#, 16#FF#, 16#83#, 16#FF#, 16#00#, 16#3F#, 16#F8#, 16#3F#, 16#F0#,
16#01#, 16#FF#, 16#87#, 16#FE#, 16#00#, 16#1F#, 16#F8#, 16#7F#, 16#E0#,
16#01#, 16#FF#, 16#87#, 16#FC#, 16#00#, 16#1F#, 16#F8#, 16#FF#, 16#C0#,
16#01#, 16#FF#, 16#8F#, 16#FC#, 16#00#, 16#3F#, 16#F0#, 16#FF#, 16#C0#,
16#03#, 16#FF#, 16#0F#, 16#FC#, 16#00#, 16#3F#, 16#F0#, 16#FF#, 16#E0#,
16#07#, 16#FE#, 16#0F#, 16#FE#, 16#00#, 16#FF#, 16#E0#, 16#FF#, 16#F8#,
16#3F#, 16#FC#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#7F#, 16#FF#,
16#FF#, 16#F8#, 16#03#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#3F#, 16#FF#,
16#FF#, 16#E0#, 16#01#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#0F#, 16#FF#,
16#FF#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#7F#,
16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#,
16#7F#, 16#FC#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#C0#, 16#00#, 16#7F#,
16#FF#, 16#F8#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#00#, 16#1F#, 16#FF#,
16#FF#, 16#C0#, 16#0F#, 16#FF#, 16#FF#, 16#F8#, 16#07#, 16#FF#, 16#07#,
16#FE#, 16#03#, 16#FF#, 16#80#, 16#FF#, 16#80#, 16#FF#, 16#C0#, 16#1F#,
16#F0#, 16#7F#, 16#E0#, 16#03#, 16#FC#, 16#1F#, 16#F8#, 16#00#, 16#FF#,
16#0F#, 16#FC#, 16#00#, 16#3F#, 16#C3#, 16#FF#, 16#00#, 16#0F#, 16#F0#,
16#FF#, 16#80#, 16#03#, 16#FC#, 16#7F#, 16#E0#, 16#00#, 16#FF#, 16#1F#,
16#F8#, 16#00#, 16#3F#, 16#C7#, 16#FE#, 16#00#, 16#1F#, 16#F1#, 16#FF#,
16#80#, 16#07#, 16#FC#, 16#7F#, 16#E0#, 16#03#, 16#FE#, 16#1F#, 16#F8#,
16#00#, 16#FF#, 16#87#, 16#FF#, 16#00#, 16#7F#, 16#E1#, 16#FF#, 16#C0#,
16#3F#, 16#F8#, 16#7F#, 16#F8#, 16#3F#, 16#FE#, 16#0F#, 16#FF#, 16#FF#,
16#FF#, 16#83#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#7F#, 16#FF#, 16#FF#,
16#F0#, 16#0F#, 16#FF#, 16#FF#, 16#FC#, 16#01#, 16#FF#, 16#FD#, 16#FE#,
16#00#, 16#3F#, 16#FC#, 16#7F#, 16#80#, 16#01#, 16#FC#, 16#1F#, 16#E0#,
16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#FC#, 16#00#,
16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#,
16#00#, 16#3F#, 16#E0#, 16#FF#, 16#C0#, 16#0F#, 16#F0#, 16#3F#, 16#F0#,
16#07#, 16#FC#, 16#0F#, 16#FF#, 16#07#, 16#FE#, 16#03#, 16#FF#, 16#FF#,
16#FF#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#C0#, 16#1F#, 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#0F#, 16#FF#, 16#F8#, 16#00#, 16#01#, 16#FF#, 16#F8#, 16#00#,
16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#01#, 16#FF#,
16#03#, 16#FE#, 16#03#, 16#FE#, 16#03#, 16#FE#, 16#03#, 16#FE#, 16#03#,
16#FE#, 16#07#, 16#FC#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#,
16#E0#, 16#3F#, 16#E0#, 16#7F#, 16#C0#, 16#7F#, 16#C0#, 16#7F#, 16#C0#,
16#7F#, 16#C0#, 16#7F#, 16#C0#, 16#FF#, 16#80#, 16#FF#, 16#80#, 16#00#,
16#7F#, 16#C0#, 16#1F#, 16#F0#, 16#0F#, 16#F8#, 16#03#, 16#FE#, 16#00#,
16#FF#, 16#80#, 16#3F#, 16#E0#, 16#0F#, 16#F8#, 16#07#, 16#FC#, 16#01#,
16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#0F#,
16#F8#, 16#03#, 16#FE#, 16#00#, 16#FF#, 16#00#, 16#7F#, 16#C0#, 16#1F#,
16#F0#, 16#07#, 16#FC#, 16#01#, 16#FE#, 16#00#, 16#FF#, 16#80#, 16#3F#,
16#E0#, 16#00#, 16#78#, 16#00#, 16#1E#, 16#00#, 16#0F#, 16#00#, 16#03#,
16#C0#, 16#01#, 16#F0#, 16#00#, 16#F8#, 16#00#, 16#FC#, 16#00#, 16#7E#,
16#00#, 16#3F#, 16#00#, 16#0F#, 16#80#, 16#03#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#,
16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#E0#, 16#00#,
16#00#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#00#, 16#00#,
16#FF#, 16#FF#, 16#E0#, 16#00#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#7F#,
16#FF#, 16#FC#, 16#00#, 16#7F#, 16#FF#, 16#FC#, 16#00#, 16#7F#, 16#FF#,
16#FC#, 16#00#, 16#3F#, 16#FF#, 16#FC#, 16#00#, 16#07#, 16#FF#, 16#FC#,
16#00#, 16#00#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#1F#, 16#FC#, 16#00#,
16#00#, 16#03#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#00#,
16#00#, 16#1F#, 16#FF#, 16#FC#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#E0#,
16#00#, 16#1F#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#7F#, 16#FF#, 16#FE#,
16#00#, 16#03#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#0F#, 16#FF#, 16#FF#,
16#00#, 16#00#, 16#7F#, 16#FF#, 16#E0#, 16#00#, 16#01#, 16#FF#, 16#F8#,
16#00#, 16#00#, 16#0F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#E0#,
16#00#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#00#, 16#20#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#FF#,
16#E1#, 16#FF#, 16#FF#, 16#FF#, 16#FC#, 16#3F#, 16#FF#, 16#FF#, 16#FF#,
16#87#, 16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#FF#, 16#FF#, 16#FF#, 16#FC#,
16#1F#, 16#FF#, 16#FF#, 16#FF#, 16#87#, 16#FF#, 16#FF#, 16#FF#, 16#F0#,
16#FF#, 16#FF#, 16#FF#, 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#03#, 16#FF#,
16#FF#, 16#FF#, 16#F8#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#0F#, 16#FF#,
16#FF#, 16#FF#, 16#C1#, 16#FF#, 16#FF#, 16#FF#, 16#F8#, 16#3F#, 16#FF#,
16#FF#, 16#FF#, 16#0F#, 16#FF#, 16#FF#, 16#FF#, 16#E1#, 16#FF#, 16#FF#,
16#FF#, 16#FC#, 16#3F#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#01#, 16#00#,
16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#E0#,
16#00#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FC#,
16#00#, 16#00#, 16#07#, 16#FF#, 16#E0#, 16#00#, 16#01#, 16#FF#, 16#FF#,
16#80#, 16#00#, 16#3F#, 16#FF#, 16#FC#, 16#00#, 16#03#, 16#FF#, 16#FF#,
16#F0#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#7F#, 16#FF#,
16#FE#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#0F#, 16#FF#,
16#FE#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#C0#, 16#00#, 16#01#, 16#FF#,
16#F0#, 16#00#, 16#00#, 16#0F#, 16#FE#, 16#00#, 16#00#, 16#0F#, 16#FF#,
16#C0#, 16#00#, 16#0F#, 16#FF#, 16#F8#, 16#00#, 16#0F#, 16#FF#, 16#FF#,
16#00#, 16#0F#, 16#FF#, 16#FF#, 16#80#, 16#0F#, 16#FF#, 16#FF#, 16#80#,
16#0F#, 16#FF#, 16#FF#, 16#80#, 16#0F#, 16#FF#, 16#FF#, 16#C0#, 16#01#,
16#FF#, 16#FF#, 16#C0#, 16#00#, 16#3F#, 16#FF#, 16#C0#, 16#00#, 16#0F#,
16#FF#, 16#C0#, 16#00#, 16#01#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#3F#,
16#C0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#00#,
16#0F#, 16#FF#, 16#E0#, 16#00#, 16#1F#, 16#FF#, 16#FC#, 16#00#, 16#3F#,
16#FF#, 16#FF#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#C0#, 16#3F#, 16#FF#,
16#FF#, 16#F0#, 16#3F#, 16#FF#, 16#FF#, 16#FC#, 16#3F#, 16#FF#, 16#FF#,
16#FE#, 16#1F#, 16#FC#, 16#1F#, 16#FF#, 16#9F#, 16#F8#, 16#03#, 16#FF#,
16#CF#, 16#F8#, 16#00#, 16#FF#, 16#EF#, 16#F8#, 16#00#, 16#3F#, 16#F7#,
16#FC#, 16#00#, 16#1F#, 16#FB#, 16#FC#, 16#00#, 16#0F#, 16#FF#, 16#FE#,
16#00#, 16#07#, 16#FF#, 16#FF#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#00#,
16#03#, 16#FF#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#00#, 16#01#,
16#FF#, 16#80#, 16#00#, 16#01#, 16#FF#, 16#C0#, 16#00#, 16#01#, 16#FF#,
16#C0#, 16#00#, 16#03#, 16#FF#, 16#C0#, 16#00#, 16#03#, 16#FF#, 16#C0#,
16#00#, 16#03#, 16#FF#, 16#C0#, 16#00#, 16#07#, 16#FF#, 16#C0#, 16#00#,
16#07#, 16#FF#, 16#80#, 16#00#, 16#07#, 16#FF#, 16#00#, 16#00#, 16#03#,
16#FE#, 16#00#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#00#, 16#03#, 16#FE#,
16#00#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#00#,
16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#00#,
16#00#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#,
16#F8#, 16#00#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#03#, 16#FE#,
16#00#, 16#00#, 16#03#, 16#FF#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#00#,
16#00#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#,
16#00#, 16#7F#, 16#E0#, 16#00#, 16#00#, 16#3F#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#7F#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FF#,
16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#FF#,
16#F8#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#E0#, 16#07#, 16#FF#, 16#E0#,
16#00#, 16#00#, 16#7F#, 16#F0#, 16#00#, 16#0F#, 16#FF#, 16#00#, 16#00#,
16#0F#, 16#F8#, 16#00#, 16#00#, 16#3F#, 16#F8#, 16#00#, 16#03#, 16#FE#,
16#00#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#7F#, 16#80#, 16#00#,
16#00#, 16#07#, 16#FC#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#,
16#3F#, 16#C0#, 16#01#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FE#,
16#00#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#07#,
16#F0#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#FE#, 16#00#, 16#FE#, 16#00#,
16#0F#, 16#FE#, 16#3F#, 16#07#, 16#F0#, 16#1F#, 16#C0#, 16#03#, 16#FF#,
16#F3#, 16#E0#, 16#7F#, 16#03#, 16#F8#, 16#00#, 16#FF#, 16#FF#, 16#7E#,
16#03#, 16#F0#, 16#3F#, 16#00#, 16#1F#, 16#FF#, 16#F7#, 16#C0#, 16#3F#,
16#07#, 16#E0#, 16#03#, 16#FE#, 16#0F#, 16#FC#, 16#03#, 16#F0#, 16#FE#,
16#00#, 16#7F#, 16#80#, 16#7F#, 16#80#, 16#3F#, 16#0F#, 16#C0#, 16#0F#,
16#E0#, 16#07#, 16#F8#, 16#03#, 16#F1#, 16#F8#, 16#01#, 16#FC#, 16#00#,
16#7F#, 16#00#, 16#3F#, 16#1F#, 16#80#, 16#3F#, 16#80#, 16#07#, 16#F0#,
16#03#, 16#F3#, 16#F0#, 16#03#, 16#F0#, 16#00#, 16#7E#, 16#00#, 16#3E#,
16#3F#, 16#00#, 16#7F#, 16#00#, 16#07#, 16#E0#, 16#07#, 16#E3#, 16#E0#,
16#07#, 16#E0#, 16#00#, 16#7C#, 16#00#, 16#7E#, 16#7E#, 16#00#, 16#FC#,
16#00#, 16#0F#, 16#C0#, 16#07#, 16#C7#, 16#E0#, 16#0F#, 16#C0#, 16#00#,
16#F8#, 16#00#, 16#FC#, 16#7E#, 16#01#, 16#FC#, 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#3F#, 16#8F#, 16#C0#,
16#3F#, 16#80#, 16#03#, 16#F0#, 16#07#, 16#F0#, 16#FC#, 16#03#, 16#F8#,
16#00#, 16#7E#, 16#00#, 16#7E#, 16#0F#, 16#C0#, 16#3F#, 16#80#, 16#0F#,
16#E0#, 16#0F#, 16#E0#, 16#FC#, 16#03#, 16#F8#, 16#01#, 16#FE#, 16#03#,
16#FC#, 16#0F#, 16#C0#, 16#3F#, 16#C0#, 16#3F#, 16#E0#, 16#7F#, 16#80#,
16#FC#, 16#03#, 16#FE#, 16#0F#, 16#FE#, 16#1F#, 16#F0#, 16#0F#, 16#E0#,
16#1F#, 16#FF#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#FE#, 16#01#, 16#FF#,
16#FF#, 16#7F#, 16#FF#, 16#80#, 16#0F#, 16#E0#, 16#0F#, 16#FF#, 16#E3#,
16#FF#, 16#F0#, 16#00#, 16#7F#, 16#00#, 16#7F#, 16#F8#, 16#3F#, 16#FC#,
16#00#, 16#07#, 16#F0#, 16#01#, 16#FC#, 16#00#, 16#FE#, 16#00#, 16#00#,
16#7F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FC#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#,
16#07#, 16#FF#, 16#80#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#3F#,
16#FF#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FF#,
16#FF#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#FF#,
16#E0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#FE#, 16#00#,
16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#3F#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#3F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#,
16#80#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FC#, 16#00#, 16#00#, 16#00#,
16#07#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FC#, 16#00#,
16#00#, 16#00#, 16#0F#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#FF#,
16#FC#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#C0#, 16#00#, 16#00#,
16#03#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#E0#,
16#00#, 16#00#, 16#07#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#FF#,
16#FF#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#FE#, 16#00#, 16#00#,
16#01#, 16#FE#, 16#7F#, 16#E0#, 16#00#, 16#00#, 16#3F#, 16#E7#, 16#FE#,
16#00#, 16#00#, 16#03#, 16#FC#, 16#7F#, 16#E0#, 16#00#, 16#00#, 16#7F#,
16#87#, 16#FF#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#7F#, 16#F0#, 16#00#,
16#00#, 16#FF#, 16#07#, 16#FF#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#3F#,
16#F0#, 16#00#, 16#01#, 16#FE#, 16#03#, 16#FF#, 16#00#, 16#00#, 16#3F#,
16#E0#, 16#3F#, 16#F0#, 16#00#, 16#03#, 16#FC#, 16#03#, 16#FF#, 16#00#,
16#00#, 16#7F#, 16#C0#, 16#3F#, 16#F8#, 16#00#, 16#07#, 16#F8#, 16#03#,
16#FF#, 16#80#, 16#00#, 16#FF#, 16#00#, 16#1F#, 16#F8#, 16#00#, 16#0F#,
16#F0#, 16#01#, 16#FF#, 16#80#, 16#01#, 16#FE#, 16#00#, 16#1F#, 16#F8#,
16#00#, 16#3F#, 16#E0#, 16#01#, 16#FF#, 16#80#, 16#03#, 16#FF#, 16#FF#,
16#FF#, 16#F8#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#07#,
16#FF#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#FF#,
16#C0#, 16#0F#, 16#FF#, 16#FF#, 16#FF#, 16#FC#, 16#01#, 16#FF#, 16#FF#,
16#FF#, 16#FF#, 16#C0#, 16#3F#, 16#FF#, 16#FF#, 16#FF#, 16#FC#, 16#03#,
16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#7F#, 16#E0#, 16#00#, 16#0F#,
16#FE#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#FF#, 16#E0#, 16#FF#, 16#C0#,
16#00#, 16#07#, 16#FE#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#7F#, 16#E1#,
16#FF#, 16#80#, 16#00#, 16#07#, 16#FE#, 16#3F#, 16#F0#, 16#00#, 16#00#,
16#7F#, 16#E3#, 16#FF#, 16#00#, 16#00#, 16#07#, 16#FE#, 16#7F#, 16#E0#,
16#00#, 16#00#, 16#7F#, 16#F7#, 16#FC#, 16#00#, 16#00#, 16#03#, 16#FF#,
16#00#, 16#1F#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#03#, 16#FF#, 16#FF#,
16#FF#, 16#E0#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#03#,
16#FF#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#FF#,
16#C0#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#7F#, 16#FF#,
16#FF#, 16#FF#, 16#E0#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#00#,
16#7F#, 16#C0#, 16#00#, 16#FF#, 16#F0#, 16#0F#, 16#F8#, 16#00#, 16#07#,
16#FF#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#3F#, 16#F0#, 16#0F#, 16#F8#,
16#00#, 16#03#, 16#FF#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#3F#, 16#F0#,
16#0F#, 16#F0#, 16#00#, 16#03#, 16#FE#, 16#01#, 16#FF#, 16#00#, 16#00#,
16#7F#, 16#E0#, 16#1F#, 16#F0#, 16#00#, 16#07#, 16#FC#, 16#01#, 16#FF#,
16#00#, 16#00#, 16#FF#, 16#C0#, 16#1F#, 16#F0#, 16#00#, 16#3F#, 16#F8#,
16#03#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#3F#, 16#FF#, 16#FF#,
16#FF#, 16#E0#, 16#03#, 16#FF#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#3F#,
16#FF#, 16#FF#, 16#FF#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#FF#, 16#FC#,
16#00#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#07#, 16#FF#, 16#FF#,
16#FF#, 16#FE#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#F0#, 16#07#,
16#FC#, 16#00#, 16#0F#, 16#FF#, 16#00#, 16#FF#, 16#C0#, 16#00#, 16#3F#,
16#F8#, 16#0F#, 16#F8#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#FF#, 16#80#,
16#00#, 16#1F#, 16#F8#, 16#0F#, 16#F8#, 16#00#, 16#01#, 16#FF#, 16#81#,
16#FF#, 16#80#, 16#00#, 16#1F#, 16#F8#, 16#1F#, 16#F0#, 16#00#, 16#01#,
16#FF#, 16#81#, 16#FF#, 16#00#, 16#00#, 16#3F#, 16#F0#, 16#1F#, 16#F0#,
16#00#, 16#03#, 16#FF#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#7F#, 16#F0#,
16#3F#, 16#E0#, 16#00#, 16#0F#, 16#FE#, 16#03#, 16#FE#, 16#00#, 16#03#,
16#FF#, 16#E0#, 16#3F#, 16#FF#, 16#FF#, 16#FF#, 16#FC#, 16#03#, 16#FF#,
16#FF#, 16#FF#, 16#FF#, 16#80#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#F0#,
16#07#, 16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#7F#, 16#FF#, 16#FF#,
16#FF#, 16#C0#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#FF#,
16#FF#, 16#FF#, 16#FC#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 16#FE#, 16#00#,
16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#03#,
16#FF#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#FC#, 16#00#,
16#00#, 16#3F#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#07#, 16#FF#, 16#FF#,
16#FF#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#3F#,
16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#FE#,
16#00#, 16#FF#, 16#FC#, 16#07#, 16#FF#, 16#E0#, 16#1F#, 16#FF#, 16#00#,
16#1F#, 16#FE#, 16#01#, 16#FF#, 16#C0#, 16#00#, 16#FF#, 16#F0#, 16#3F#,
16#F8#, 16#00#, 16#07#, 16#FF#, 16#07#, 16#FF#, 16#00#, 16#00#, 16#7F#,
16#F0#, 16#7F#, 16#E0#, 16#00#, 16#03#, 16#FF#, 16#0F#, 16#FE#, 16#00#,
16#00#, 16#3F#, 16#F0#, 16#FF#, 16#C0#, 16#00#, 16#03#, 16#FF#, 16#1F#,
16#F8#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#00#, 16#00#,
16#00#, 16#3F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#00#,
16#00#, 16#00#, 16#00#, 16#3F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#07#,
16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#07#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#0F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#,
16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FC#, 16#00#, 16#00#,
16#00#, 16#00#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FC#,
16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#,
16#0F#, 16#FC#, 16#00#, 16#00#, 16#1F#, 16#F0#, 16#FF#, 16#C0#, 16#00#,
16#03#, 16#FF#, 16#0F#, 16#FC#, 16#00#, 16#00#, 16#3F#, 16#F0#, 16#FF#,
16#E0#, 16#00#, 16#07#, 16#FE#, 16#0F#, 16#FE#, 16#00#, 16#00#, 16#7F#,
16#E0#, 16#7F#, 16#E0#, 16#00#, 16#0F#, 16#FC#, 16#07#, 16#FF#, 16#00#,
16#01#, 16#FF#, 16#C0#, 16#7F#, 16#F8#, 16#00#, 16#7F#, 16#F8#, 16#03#,
16#FF#, 16#F0#, 16#1F#, 16#FF#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#FF#,
16#F0#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#0F#, 16#FF#,
16#FF#, 16#FF#, 16#C0#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#F0#, 16#00#,
16#03#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#FF#,
16#80#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#7F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#C0#,
16#00#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#0F#, 16#FF#,
16#FF#, 16#FF#, 16#80#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#00#,
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#80#, 16#0F#,
16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#FF#, 16#80#, 16#03#, 16#FF#,
16#F0#, 16#07#, 16#FC#, 16#00#, 16#07#, 16#FF#, 16#80#, 16#3F#, 16#E0#,
16#00#, 16#1F#, 16#FC#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#7F#, 16#F0#,
16#1F#, 16#F0#, 16#00#, 16#03#, 16#FF#, 16#80#, 16#FF#, 16#80#, 16#00#,
16#0F#, 16#FC#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#7F#, 16#E0#, 16#3F#,
16#E0#, 16#00#, 16#03#, 16#FF#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#1F#,
16#F8#, 16#1F#, 16#F0#, 16#00#, 16#00#, 16#FF#, 16#C0#, 16#FF#, 16#80#,
16#00#, 16#07#, 16#FE#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#3F#, 16#F0#,
16#3F#, 16#E0#, 16#00#, 16#01#, 16#FF#, 16#83#, 16#FE#, 16#00#, 16#00#,
16#0F#, 16#F8#, 16#1F#, 16#F0#, 16#00#, 16#00#, 16#FF#, 16#C0#, 16#FF#,
16#80#, 16#00#, 16#07#, 16#FE#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#3F#,
16#F0#, 16#3F#, 16#C0#, 16#00#, 16#01#, 16#FF#, 16#83#, 16#FE#, 16#00#,
16#00#, 16#1F#, 16#F8#, 16#1F#, 16#F0#, 16#00#, 16#00#, 16#FF#, 16#C0#,
16#FF#, 16#80#, 16#00#, 16#07#, 16#FE#, 16#07#, 16#F8#, 16#00#, 16#00#,
16#7F#, 16#E0#, 16#7F#, 16#C0#, 16#00#, 16#03#, 16#FF#, 16#03#, 16#FE#,
16#00#, 16#00#, 16#3F#, 16#F0#, 16#1F#, 16#F0#, 16#00#, 16#01#, 16#FF#,
16#80#, 16#FF#, 16#80#, 16#00#, 16#1F#, 16#F8#, 16#0F#, 16#F8#, 16#00#,
16#01#, 16#FF#, 16#C0#, 16#7F#, 16#C0#, 16#00#, 16#3F#, 16#FC#, 16#03#,
16#FE#, 16#00#, 16#03#, 16#FF#, 16#C0#, 16#1F#, 16#F0#, 16#00#, 16#FF#,
16#FE#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#0F#, 16#FF#,
16#FF#, 16#FF#, 16#FE#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#E0#,
16#03#, 16#FF#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#1F#, 16#FF#, 16#FF#,
16#FF#, 16#C0#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#0F#,
16#FF#, 16#FF#, 16#FF#, 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#FF#, 16#E0#, 16#07#,
16#FF#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#FF#,
16#00#, 16#1F#, 16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#07#, 16#FF#, 16#FF#,
16#FF#, 16#FC#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#1F#,
16#FF#, 16#FF#, 16#FF#, 16#F0#, 16#03#, 16#FF#, 16#FF#, 16#FF#, 16#FC#,
16#00#, 16#7F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#,
16#03#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#,
16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#00#, 16#00#,
16#0F#, 16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#01#, 16#FF#, 16#FF#, 16#FF#,
16#FC#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#07#, 16#FF#,
16#FF#, 16#FF#, 16#F0#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 16#FC#, 16#00#,
16#3F#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#07#, 16#FF#, 16#FF#, 16#FF#,
16#F0#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#3F#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#,
16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#03#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#80#,
16#00#, 16#00#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#03#,
16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#1F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FE#, 16#00#,
16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#0F#,
16#FF#, 16#FF#, 16#FF#, 16#FC#, 16#03#, 16#FF#, 16#FF#, 16#FF#, 16#FF#,
16#80#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#0F#, 16#FF#, 16#FF#,
16#FF#, 16#FC#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#3F#,
16#FF#, 16#FF#, 16#FF#, 16#F0#, 16#0F#, 16#FF#, 16#FF#, 16#FF#, 16#FE#,
16#01#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 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#01#, 16#FF#, 16#FF#, 16#FF#,
16#FE#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#1F#, 16#FF#,
16#FF#, 16#FF#, 16#C0#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#F0#, 16#03#,
16#FF#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#00#,
16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F8#, 16#00#,
16#00#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#,
16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#00#, 16#00#,
16#1F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#00#,
16#00#, 16#03#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#80#,
16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#0F#,
16#FF#, 16#FF#, 16#FF#, 16#80#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#E0#,
16#01#, 16#FF#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#7F#, 16#FF#, 16#FF#,
16#FC#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#07#, 16#FF#,
16#FF#, 16#FF#, 16#C0#, 16#03#, 16#FF#, 16#FF#, 16#FF#, 16#F0#, 16#00#,
16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FE#, 16#00#,
16#00#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#00#, 16#00#,
16#0F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#00#,
16#00#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#07#,
16#FC#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#00#,
16#00#, 16#7F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#0F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FE#,
16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#,
16#3F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#,
16#FF#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#00#, 16#00#,
16#00#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#,
16#E0#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#FF#,
16#FF#, 16#FF#, 16#F8#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#FF#, 16#C0#,
16#07#, 16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#FF#, 16#FC#, 16#03#,
16#FF#, 16#E0#, 16#1F#, 16#FF#, 16#00#, 16#0F#, 16#FE#, 16#01#, 16#FF#,
16#C0#, 16#00#, 16#7F#, 16#F0#, 16#3F#, 16#F8#, 16#00#, 16#03#, 16#FF#,
16#07#, 16#FF#, 16#00#, 16#00#, 16#1F#, 16#F0#, 16#7F#, 16#E0#, 16#00#,
16#01#, 16#FF#, 16#0F#, 16#FC#, 16#00#, 16#00#, 16#1F#, 16#F0#, 16#FF#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#F8#, 16#00#, 16#00#, 16#00#,
16#01#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#03#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#,
16#E0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FE#, 16#00#, 16#00#, 16#00#,
16#00#, 16#7F#, 16#E0#, 16#00#, 16#7F#, 16#FF#, 16#C7#, 16#FE#, 16#00#,
16#07#, 16#FF#, 16#FC#, 16#7F#, 16#C0#, 16#00#, 16#FF#, 16#FF#, 16#CF#,
16#FC#, 16#00#, 16#0F#, 16#FF#, 16#FC#, 16#FF#, 16#C0#, 16#00#, 16#FF#,
16#FF#, 16#8F#, 16#FC#, 16#00#, 16#0F#, 16#FF#, 16#F8#, 16#FF#, 16#C0#,
16#00#, 16#FF#, 16#FF#, 16#8F#, 16#FC#, 16#00#, 16#1F#, 16#FF#, 16#F8#,
16#FF#, 16#C0#, 16#00#, 16#00#, 16#7F#, 16#0F#, 16#FC#, 16#00#, 16#00#,
16#07#, 16#F0#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#FF#, 16#0F#, 16#FE#,
16#00#, 16#00#, 16#1F#, 16#F0#, 16#FF#, 16#E0#, 16#00#, 16#01#, 16#FE#,
16#07#, 16#FF#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#7F#, 16#F8#, 16#00#,
16#07#, 16#FE#, 16#07#, 16#FF#, 16#C0#, 16#00#, 16#FF#, 16#E0#, 16#3F#,
16#FE#, 16#00#, 16#3F#, 16#FE#, 16#03#, 16#FF#, 16#F8#, 16#0F#, 16#FF#,
16#C0#, 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#FE#, 16#FC#, 16#00#,
16#7F#, 16#FF#, 16#FF#, 16#CF#, 16#80#, 16#03#, 16#FF#, 16#FF#, 16#F8#,
16#F8#, 16#00#, 16#0F#, 16#FF#, 16#FE#, 16#0F#, 16#80#, 16#00#, 16#3F#,
16#FF#, 16#C0#, 16#F8#, 16#00#, 16#00#, 16#7F#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#1F#, 16#E0#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#7F#, 16#C0#,
16#00#, 16#07#, 16#FC#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#1F#, 16#F8#,
16#01#, 16#FF#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#03#, 16#FC#, 16#00#,
16#00#, 16#7F#, 16#C0#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#FF#, 16#80#,
16#1F#, 16#F0#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#3F#, 16#E0#, 16#00#,
16#07#, 16#FC#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#0F#, 16#F8#, 16#00#,
16#FF#, 16#00#, 16#00#, 16#1F#, 16#F0#, 16#03#, 16#FE#, 16#00#, 16#00#,
16#3F#, 16#E0#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#FF#, 16#C0#, 16#0F#,
16#F8#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#03#,
16#FE#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#FF#,
16#80#, 16#00#, 16#1F#, 16#F8#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#3F#,
16#E0#, 16#03#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#07#, 16#FF#,
16#FF#, 16#FF#, 16#FF#, 16#80#, 16#1F#, 16#FF#, 16#FF#, 16#FF#, 16#FF#,
16#00#, 16#3F#, 16#FF#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#7F#, 16#FF#,
16#FF#, 16#FF#, 16#F8#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#F0#,
16#03#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#07#, 16#FF#, 16#FF#,
16#FF#, 16#FF#, 16#C0#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#FF#, 16#00#,
16#1F#, 16#F0#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#7F#, 16#E0#, 16#00#,
16#07#, 16#FC#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#0F#, 16#F8#, 16#01#,
16#FF#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#03#, 16#FE#, 16#00#, 16#00#,
16#7F#, 16#C0#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#1F#,
16#F0#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#03#,
16#FE#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#FF#,
16#80#, 16#00#, 16#1F#, 16#F0#, 16#03#, 16#FF#, 16#00#, 16#00#, 16#3F#,
16#E0#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#0F#, 16#F8#,
16#00#, 16#00#, 16#FF#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#03#, 16#FE#,
16#00#, 16#3F#, 16#E0#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#FF#, 16#80#,
16#00#, 16#0F#, 16#F8#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#1F#, 16#E0#,
16#03#, 16#FE#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#07#, 16#FC#, 16#00#,
16#00#, 16#FF#, 16#80#, 16#1F#, 16#F0#, 16#00#, 16#01#, 16#FF#, 16#00#,
16#00#, 16#00#, 16#7F#, 16#E0#, 16#0F#, 16#FC#, 16#01#, 16#FF#, 16#00#,
16#3F#, 16#E0#, 16#07#, 16#FC#, 16#01#, 16#FF#, 16#80#, 16#3F#, 16#F0#,
16#07#, 16#FC#, 16#00#, 16#FF#, 16#80#, 16#1F#, 16#F0#, 16#07#, 16#FE#,
16#00#, 16#FF#, 16#C0#, 16#1F#, 16#F0#, 16#03#, 16#FE#, 16#00#, 16#7F#,
16#C0#, 16#1F#, 16#F8#, 16#03#, 16#FF#, 16#00#, 16#7F#, 16#C0#, 16#0F#,
16#F8#, 16#01#, 16#FF#, 16#00#, 16#7F#, 16#E0#, 16#0F#, 16#FC#, 16#01#,
16#FF#, 16#00#, 16#3F#, 16#E0#, 16#0F#, 16#FC#, 16#01#, 16#FF#, 16#80#,
16#3F#, 16#E0#, 16#07#, 16#FC#, 16#00#, 16#FF#, 16#80#, 16#3F#, 16#F0#,
16#07#, 16#FE#, 16#00#, 16#FF#, 16#80#, 16#1F#, 16#F0#, 16#03#, 16#FE#,
16#00#, 16#FF#, 16#C0#, 16#1F#, 16#F8#, 16#03#, 16#FE#, 16#00#, 16#7F#,
16#C0#, 16#0F#, 16#F8#, 16#03#, 16#FF#, 16#00#, 16#7F#, 16#E0#, 16#0F#,
16#F8#, 16#01#, 16#FF#, 16#00#, 16#3F#, 16#E0#, 16#0F#, 16#FC#, 16#01#,
16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#F0#, 16#00#,
16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#F0#, 16#00#,
16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#,
16#00#, 16#03#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#,
16#00#, 16#03#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#,
16#00#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#,
16#00#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#,
16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#00#,
16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#00#,
16#00#, 16#1F#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#00#,
16#00#, 16#1F#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#00#,
16#00#, 16#1F#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#00#,
16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#00#,
16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#,
16#00#, 16#7F#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#FC#, 16#07#, 16#FE#,
16#00#, 16#7F#, 16#C0#, 16#7F#, 16#E0#, 16#0F#, 16#F8#, 16#07#, 16#FE#,
16#00#, 16#FF#, 16#80#, 16#7F#, 16#C0#, 16#0F#, 16#F8#, 16#0F#, 16#FC#,
16#00#, 16#FF#, 16#80#, 16#FF#, 16#C0#, 16#0F#, 16#F8#, 16#0F#, 16#FC#,
16#01#, 16#FF#, 16#80#, 16#FF#, 16#C0#, 16#1F#, 16#F0#, 16#0F#, 16#FE#,
16#03#, 16#FF#, 16#00#, 16#FF#, 16#F0#, 16#FF#, 16#F0#, 16#0F#, 16#FF#,
16#FF#, 16#FE#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#07#, 16#FF#,
16#FF#, 16#FC#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#80#, 16#03#, 16#FF#,
16#FF#, 16#F0#, 16#00#, 16#1F#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#7F#,
16#FF#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#,
16#3F#, 16#E0#, 16#00#, 16#07#, 16#FF#, 16#00#, 16#3F#, 16#E0#, 16#00#,
16#1F#, 16#FC#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#3F#, 16#F8#, 16#00#,
16#7F#, 16#C0#, 16#00#, 16#7F#, 16#F0#, 16#00#, 16#7F#, 16#C0#, 16#00#,
16#FF#, 16#E0#, 16#00#, 16#7F#, 16#C0#, 16#01#, 16#FF#, 16#C0#, 16#00#,
16#7F#, 16#80#, 16#03#, 16#FF#, 16#80#, 16#00#, 16#FF#, 16#80#, 16#07#,
16#FF#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#0F#, 16#FE#, 16#00#, 16#00#,
16#FF#, 16#80#, 16#1F#, 16#F8#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#7F#,
16#F0#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#FF#, 16#E0#, 16#00#, 16#01#,
16#FF#, 16#01#, 16#FF#, 16#C0#, 16#00#, 16#01#, 16#FF#, 16#03#, 16#FF#,
16#80#, 16#00#, 16#01#, 16#FF#, 16#07#, 16#FF#, 16#00#, 16#00#, 16#01#,
16#FE#, 16#0F#, 16#FE#, 16#00#, 16#00#, 16#03#, 16#FE#, 16#1F#, 16#F8#,
16#00#, 16#00#, 16#03#, 16#FE#, 16#3F#, 16#F0#, 16#00#, 16#00#, 16#03#,
16#FE#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#FD#, 16#FF#, 16#C0#,
16#00#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#07#,
16#FF#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#E0#,
16#00#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#07#,
16#FF#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 16#F8#,
16#00#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#0F#,
16#FF#, 16#1F#, 16#FC#, 16#00#, 16#00#, 16#0F#, 16#FE#, 16#1F#, 16#FC#,
16#00#, 16#00#, 16#1F#, 16#FC#, 16#0F#, 16#FE#, 16#00#, 16#00#, 16#1F#,
16#F8#, 16#0F#, 16#FE#, 16#00#, 16#00#, 16#1F#, 16#F0#, 16#07#, 16#FF#,
16#00#, 16#00#, 16#1F#, 16#F0#, 16#07#, 16#FF#, 16#80#, 16#00#, 16#3F#,
16#F0#, 16#03#, 16#FF#, 16#80#, 16#00#, 16#3F#, 16#E0#, 16#01#, 16#FF#,
16#C0#, 16#00#, 16#3F#, 16#E0#, 16#01#, 16#FF#, 16#C0#, 16#00#, 16#3F#,
16#E0#, 16#00#, 16#FF#, 16#E0#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#FF#,
16#F0#, 16#00#, 16#7F#, 16#E0#, 16#00#, 16#7F#, 16#F0#, 16#00#, 16#7F#,
16#C0#, 16#00#, 16#7F#, 16#F8#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#3F#,
16#F8#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#3F#, 16#FC#, 16#00#, 16#FF#,
16#C0#, 16#00#, 16#1F#, 16#FE#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#1F#,
16#FE#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#0F#, 16#FF#, 16#00#, 16#FF#,
16#80#, 16#00#, 16#07#, 16#FF#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#,
16#00#, 16#1F#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#,
16#07#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#00#, 16#03#,
16#FE#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#FF#,
16#80#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#00#, 16#7F#, 16#C0#,
16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#, 16#1F#, 16#F0#, 16#00#,
16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#,
16#07#, 16#FC#, 16#00#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#00#, 16#01#,
16#FE#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#FF#,
16#80#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#00#, 16#3F#, 16#E0#,
16#00#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#00#, 16#1F#, 16#F0#, 16#00#,
16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#,
16#03#, 16#FC#, 16#00#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#00#, 16#01#,
16#FF#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#7F#,
16#C0#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#3F#, 16#E0#,
16#00#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#F8#, 16#00#,
16#00#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#,
16#03#, 16#FE#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#00#,
16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#7F#,
16#FF#, 16#FF#, 16#FF#, 16#BF#, 16#FF#, 16#FF#, 16#FF#, 16#9F#, 16#FF#,
16#FF#, 16#FF#, 16#CF#, 16#FF#, 16#FF#, 16#FF#, 16#EF#, 16#FF#, 16#FF#,
16#FF#, 16#F7#, 16#FF#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#3F#, 16#FF#,
16#00#, 16#00#, 16#7F#, 16#FE#, 16#00#, 16#7F#, 16#FE#, 16#00#, 16#00#,
16#FF#, 16#F8#, 16#00#, 16#FF#, 16#FC#, 16#00#, 16#03#, 16#FF#, 16#F0#,
16#01#, 16#FF#, 16#F8#, 16#00#, 16#07#, 16#FF#, 16#E0#, 16#03#, 16#FF#,
16#F0#, 16#00#, 16#1F#, 16#FF#, 16#C0#, 16#0F#, 16#FF#, 16#E0#, 16#00#,
16#3F#, 16#FF#, 16#00#, 16#1F#, 16#FF#, 16#C0#, 16#00#, 16#FF#, 16#FE#,
16#00#, 16#3F#, 16#FF#, 16#80#, 16#01#, 16#FB#, 16#FC#, 16#00#, 16#7F#,
16#FF#, 16#00#, 16#07#, 16#F7#, 16#F8#, 16#01#, 16#FF#, 16#7E#, 16#00#,
16#0F#, 16#DF#, 16#E0#, 16#03#, 16#FE#, 16#FC#, 16#00#, 16#1F#, 16#BF#,
16#C0#, 16#07#, 16#FD#, 16#F8#, 16#00#, 16#7E#, 16#7F#, 16#80#, 16#0F#,
16#FB#, 16#F8#, 16#00#, 16#FC#, 16#FF#, 16#00#, 16#3F#, 16#E7#, 16#F0#,
16#03#, 16#F3#, 16#FE#, 16#00#, 16#7F#, 16#CF#, 16#E0#, 16#07#, 16#E7#,
16#F8#, 16#00#, 16#FF#, 16#9F#, 16#C0#, 16#1F#, 16#CF#, 16#F0#, 16#01#,
16#FF#, 16#3F#, 16#80#, 16#3F#, 16#1F#, 16#E0#, 16#03#, 16#FC#, 16#7F#,
16#00#, 16#FE#, 16#3F#, 16#C0#, 16#0F#, 16#F8#, 16#FE#, 16#01#, 16#F8#,
16#FF#, 16#00#, 16#1F#, 16#F1#, 16#FC#, 16#07#, 16#F1#, 16#FE#, 16#00#,
16#3F#, 16#E3#, 16#F8#, 16#0F#, 16#C3#, 16#FC#, 16#00#, 16#7F#, 16#87#,
16#F0#, 16#3F#, 16#87#, 16#F8#, 16#01#, 16#FF#, 16#0F#, 16#E0#, 16#7E#,
16#1F#, 16#E0#, 16#03#, 16#FE#, 16#1F#, 16#C1#, 16#FC#, 16#3F#, 16#C0#,
16#07#, 16#FC#, 16#3F#, 16#83#, 16#F8#, 16#7F#, 16#80#, 16#0F#, 16#F8#,
16#7F#, 16#07#, 16#E0#, 16#FF#, 16#00#, 16#1F#, 16#E0#, 16#FE#, 16#1F#,
16#C3#, 16#FE#, 16#00#, 16#7F#, 16#C1#, 16#FC#, 16#3F#, 16#07#, 16#F8#,
16#00#, 16#FF#, 16#83#, 16#F8#, 16#FE#, 16#0F#, 16#F0#, 16#01#, 16#FF#,
16#07#, 16#F1#, 16#F8#, 16#1F#, 16#E0#, 16#03#, 16#FC#, 16#0F#, 16#E7#,
16#F0#, 16#3F#, 16#C0#, 16#0F#, 16#F8#, 16#1F#, 16#CF#, 16#C0#, 16#FF#,
16#00#, 16#1F#, 16#F0#, 16#3F#, 16#BF#, 16#81#, 16#FE#, 16#00#, 16#3F#,
16#E0#, 16#7F#, 16#7E#, 16#03#, 16#FC#, 16#00#, 16#7F#, 16#80#, 16#FF#,
16#FC#, 16#07#, 16#F8#, 16#00#, 16#FF#, 16#01#, 16#FF#, 16#F8#, 16#1F#,
16#E0#, 16#03#, 16#FE#, 16#03#, 16#FF#, 16#E0#, 16#3F#, 16#C0#, 16#07#,
16#FC#, 16#07#, 16#FF#, 16#C0#, 16#7F#, 16#80#, 16#0F#, 16#F0#, 16#0F#,
16#FF#, 16#00#, 16#FF#, 16#00#, 16#1F#, 16#E0#, 16#1F#, 16#FE#, 16#03#,
16#FE#, 16#00#, 16#7F#, 16#C0#, 16#3F#, 16#F8#, 16#07#, 16#F8#, 16#00#,
16#FF#, 16#80#, 16#7F#, 16#F0#, 16#0F#, 16#F0#, 16#01#, 16#FE#, 16#00#,
16#FF#, 16#C0#, 16#1F#, 16#E0#, 16#03#, 16#FC#, 16#01#, 16#FF#, 16#80#,
16#7F#, 16#C0#, 16#0F#, 16#F8#, 16#03#, 16#FF#, 16#00#, 16#FF#, 16#00#,
16#1F#, 16#F0#, 16#07#, 16#FC#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#00#,
16#1F#, 16#F0#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#3F#, 16#E0#, 16#00#,
16#07#, 16#FC#, 16#00#, 16#FF#, 16#E0#, 16#00#, 16#0F#, 16#F8#, 16#01#,
16#FF#, 16#C0#, 16#00#, 16#1F#, 16#F0#, 16#03#, 16#FF#, 16#80#, 16#00#,
16#3F#, 16#C0#, 16#07#, 16#FF#, 16#80#, 16#00#, 16#FF#, 16#80#, 16#1F#,
16#FF#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#3F#, 16#FF#, 16#00#, 16#03#,
16#FE#, 16#00#, 16#7F#, 16#FE#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#FF#,
16#FC#, 16#00#, 16#1F#, 16#F0#, 16#03#, 16#FF#, 16#FC#, 16#00#, 16#3F#,
16#E0#, 16#07#, 16#FF#, 16#F8#, 16#00#, 16#7F#, 16#C0#, 16#0F#, 16#FF#,
16#F0#, 16#00#, 16#FF#, 16#80#, 16#1F#, 16#FF#, 16#F0#, 16#01#, 16#FE#,
16#00#, 16#3F#, 16#DF#, 16#E0#, 16#07#, 16#FC#, 16#00#, 16#FF#, 16#BF#,
16#E0#, 16#0F#, 16#F8#, 16#01#, 16#FE#, 16#7F#, 16#C0#, 16#1F#, 16#F0#,
16#03#, 16#FC#, 16#7F#, 16#80#, 16#3F#, 16#E0#, 16#07#, 16#F8#, 16#FF#,
16#80#, 16#7F#, 16#80#, 16#1F#, 16#F0#, 16#FF#, 16#01#, 16#FF#, 16#00#,
16#3F#, 16#E1#, 16#FF#, 16#03#, 16#FE#, 16#00#, 16#7F#, 16#83#, 16#FE#,
16#07#, 16#FC#, 16#00#, 16#FF#, 16#03#, 16#FC#, 16#0F#, 16#F8#, 16#03#,
16#FE#, 16#07#, 16#FC#, 16#1F#, 16#E0#, 16#07#, 16#FC#, 16#0F#, 16#F8#,
16#7F#, 16#C0#, 16#0F#, 16#F0#, 16#0F#, 16#F0#, 16#FF#, 16#80#, 16#1F#,
16#E0#, 16#1F#, 16#F1#, 16#FF#, 16#00#, 16#3F#, 16#C0#, 16#1F#, 16#E3#,
16#FE#, 16#00#, 16#FF#, 16#80#, 16#3F#, 16#EF#, 16#F8#, 16#01#, 16#FE#,
16#00#, 16#7F#, 16#DF#, 16#F0#, 16#03#, 16#FC#, 16#00#, 16#7F#, 16#BF#,
16#E0#, 16#07#, 16#F8#, 16#00#, 16#FF#, 16#FF#, 16#C0#, 16#1F#, 16#F0#,
16#01#, 16#FF#, 16#FF#, 16#00#, 16#3F#, 16#E0#, 16#01#, 16#FF#, 16#FE#,
16#00#, 16#7F#, 16#80#, 16#03#, 16#FF#, 16#FC#, 16#00#, 16#FF#, 16#00#,
16#07#, 16#FF#, 16#F8#, 16#03#, 16#FE#, 16#00#, 16#07#, 16#FF#, 16#F0#,
16#07#, 16#FC#, 16#00#, 16#0F#, 16#FF#, 16#C0#, 16#0F#, 16#F0#, 16#00#,
16#0F#, 16#FF#, 16#80#, 16#1F#, 16#E0#, 16#00#, 16#1F#, 16#FF#, 16#00#,
16#3F#, 16#C0#, 16#00#, 16#3F#, 16#FE#, 16#00#, 16#FF#, 16#80#, 16#00#,
16#3F#, 16#FC#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#7F#, 16#F0#, 16#03#,
16#FC#, 16#00#, 16#00#, 16#FF#, 16#E0#, 16#07#, 16#F8#, 16#00#, 16#00#,
16#FF#, 16#C0#, 16#1F#, 16#F0#, 16#00#, 16#01#, 16#FF#, 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#FF#, 16#FF#, 16#FF#, 16#00#, 16#03#,
16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#FF#,
16#F8#, 16#00#, 16#7F#, 16#FC#, 16#03#, 16#FF#, 16#F0#, 16#03#, 16#FF#,
16#C0#, 16#03#, 16#FF#, 16#C0#, 16#1F#, 16#FC#, 16#00#, 16#07#, 16#FF#,
16#80#, 16#FF#, 16#E0#, 16#00#, 16#0F#, 16#FE#, 16#07#, 16#FF#, 16#00#,
16#00#, 16#3F#, 16#F8#, 16#1F#, 16#F8#, 16#00#, 16#00#, 16#7F#, 16#F0#,
16#FF#, 16#C0#, 16#00#, 16#01#, 16#FF#, 16#C3#, 16#FF#, 16#00#, 16#00#,
16#03#, 16#FF#, 16#1F#, 16#F8#, 16#00#, 16#00#, 16#0F#, 16#FC#, 16#7F#,
16#E0#, 16#00#, 16#00#, 16#3F#, 16#F3#, 16#FF#, 16#00#, 16#00#, 16#00#,
16#FF#, 16#CF#, 16#FC#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#3F#, 16#F0#,
16#00#, 16#00#, 16#0F#, 16#FD#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#3F#,
16#F7#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#DF#, 16#F8#, 16#00#,
16#00#, 16#07#, 16#FE#, 16#7F#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#FB#,
16#FF#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#EF#, 16#FC#, 16#00#, 16#00#,
16#01#, 16#FF#, 16#BF#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#FC#, 16#FF#,
16#C0#, 16#00#, 16#00#, 16#3F#, 16#F3#, 16#FF#, 16#00#, 16#00#, 16#00#,
16#FF#, 16#CF#, 16#FC#, 16#00#, 16#00#, 16#07#, 16#FE#, 16#3F#, 16#F0#,
16#00#, 16#00#, 16#1F#, 16#F8#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#FF#,
16#C3#, 16#FF#, 16#80#, 16#00#, 16#03#, 16#FF#, 16#0F#, 16#FE#, 16#00#,
16#00#, 16#1F#, 16#F8#, 16#1F#, 16#FC#, 16#00#, 16#00#, 16#FF#, 16#E0#,
16#7F#, 16#F0#, 16#00#, 16#07#, 16#FF#, 16#01#, 16#FF#, 16#E0#, 16#00#,
16#3F#, 16#F8#, 16#03#, 16#FF#, 16#C0#, 16#03#, 16#FF#, 16#E0#, 16#0F#,
16#FF#, 16#E0#, 16#3F#, 16#FF#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#FF#,
16#F8#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#FF#,
16#FF#, 16#FF#, 16#FE#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 16#E0#,
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#FE#, 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#C0#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#00#,
16#FF#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#FF#,
16#80#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#FF#, 16#FF#,
16#FF#, 16#FF#, 16#80#, 16#1F#, 16#FF#, 16#FF#, 16#FF#, 16#F0#, 16#03#,
16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#FF#, 16#80#, 16#03#, 16#FF#,
16#E0#, 16#1F#, 16#F0#, 16#00#, 16#3F#, 16#FC#, 16#03#, 16#FE#, 16#00#,
16#03#, 16#FF#, 16#80#, 16#7F#, 16#C0#, 16#00#, 16#3F#, 16#F0#, 16#1F#,
16#F0#, 16#00#, 16#07#, 16#FE#, 16#03#, 16#FE#, 16#00#, 16#00#, 16#FF#,
16#C0#, 16#7F#, 16#C0#, 16#00#, 16#1F#, 16#F8#, 16#0F#, 16#F8#, 16#00#,
16#03#, 16#FE#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#FF#, 16#C0#, 16#7F#,
16#C0#, 16#00#, 16#1F#, 16#F8#, 16#0F#, 16#F8#, 16#00#, 16#07#, 16#FE#,
16#01#, 16#FF#, 16#00#, 16#00#, 16#FF#, 16#C0#, 16#3F#, 16#C0#, 16#00#,
16#3F#, 16#F0#, 16#0F#, 16#F8#, 16#00#, 16#1F#, 16#FE#, 16#01#, 16#FF#,
16#FF#, 16#FF#, 16#FF#, 16#80#, 16#3F#, 16#FF#, 16#FF#, 16#FF#, 16#E0#,
16#07#, 16#FF#, 16#FF#, 16#FF#, 16#FC#, 16#01#, 16#FF#, 16#FF#, 16#FF#,
16#FF#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#07#, 16#FF#,
16#FF#, 16#FF#, 16#E0#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#F0#, 16#00#,
16#1F#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#07#, 16#FE#, 16#00#, 16#00#,
16#00#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#,
16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#03#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#1F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#03#,
16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#00#,
16#00#, 16#00#, 16#00#, 16#7F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#0F#,
16#F8#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#00#, 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#FF#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#FF#,
16#C0#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#07#,
16#FF#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#FF#,
16#00#, 16#03#, 16#FF#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#1F#, 16#FF#,
16#FF#, 16#FF#, 16#F8#, 16#00#, 16#FF#, 16#FC#, 16#07#, 16#FF#, 16#F0#,
16#07#, 16#FF#, 16#C0#, 16#03#, 16#FF#, 16#C0#, 16#1F#, 16#FC#, 16#00#,
16#07#, 16#FF#, 16#80#, 16#FF#, 16#E0#, 16#00#, 16#0F#, 16#FE#, 16#07#,
16#FF#, 16#00#, 16#00#, 16#3F#, 16#F8#, 16#1F#, 16#F8#, 16#00#, 16#00#,
16#7F#, 16#F0#, 16#FF#, 16#C0#, 16#00#, 16#01#, 16#FF#, 16#C3#, 16#FF#,
16#00#, 16#00#, 16#03#, 16#FF#, 16#1F#, 16#F8#, 16#00#, 16#00#, 16#0F#,
16#FC#, 16#7F#, 16#E0#, 16#00#, 16#00#, 16#3F#, 16#F3#, 16#FF#, 16#00#,
16#00#, 16#00#, 16#FF#, 16#CF#, 16#FC#, 16#00#, 16#00#, 16#03#, 16#FF#,
16#3F#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#FD#, 16#FF#, 16#80#, 16#00#,
16#00#, 16#3F#, 16#F7#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#DF#,
16#F8#, 16#00#, 16#00#, 16#03#, 16#FE#, 16#7F#, 16#C0#, 16#00#, 16#00#,
16#1F#, 16#FB#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#EF#, 16#FC#,
16#00#, 16#00#, 16#01#, 16#FF#, 16#BF#, 16#F0#, 16#00#, 16#00#, 16#07#,
16#FC#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#3F#, 16#F3#, 16#FF#, 16#00#,
16#00#, 16#40#, 16#FF#, 16#CF#, 16#FC#, 16#00#, 16#03#, 16#07#, 16#FE#,
16#3F#, 16#F0#, 16#00#, 16#1E#, 16#1F#, 16#F8#, 16#FF#, 16#C0#, 16#01#,
16#FC#, 16#FF#, 16#C3#, 16#FF#, 16#80#, 16#0F#, 16#FB#, 16#FF#, 16#0F#,
16#FE#, 16#00#, 16#3F#, 16#FF#, 16#F8#, 16#1F#, 16#FC#, 16#00#, 16#FF#,
16#FF#, 16#C0#, 16#7F#, 16#F0#, 16#01#, 16#FF#, 16#FF#, 16#01#, 16#FF#,
16#E0#, 16#03#, 16#FF#, 16#F8#, 16#03#, 16#FF#, 16#C0#, 16#07#, 16#FF#,
16#C0#, 16#0F#, 16#FF#, 16#C0#, 16#7F#, 16#FE#, 16#00#, 16#1F#, 16#FF#,
16#FF#, 16#FF#, 16#F8#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#F0#,
16#00#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#01#, 16#FF#, 16#FF#,
16#FF#, 16#FF#, 16#80#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#00#,
16#03#, 16#FF#, 16#FF#, 16#E7#, 16#FC#, 16#00#, 16#03#, 16#FF#, 16#FE#,
16#0F#, 16#E0#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#3E#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#80#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#01#,
16#FF#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 16#FF#,
16#F0#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#07#, 16#FF#,
16#FF#, 16#FF#, 16#FE#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#FF#, 16#F8#,
16#01#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#0F#, 16#FF#, 16#FF#,
16#FF#, 16#FF#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#FF#, 16#F8#, 16#07#,
16#FC#, 16#00#, 16#01#, 16#FF#, 16#C0#, 16#3F#, 16#E0#, 16#00#, 16#07#,
16#FE#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#3F#, 16#F0#, 16#0F#, 16#F8#,
16#00#, 16#01#, 16#FF#, 16#80#, 16#FF#, 16#80#, 16#00#, 16#0F#, 16#F8#,
16#07#, 16#FC#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#3F#, 16#E0#, 16#00#,
16#07#, 16#FE#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#0F#,
16#F0#, 16#00#, 16#03#, 16#FF#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#3F#,
16#F0#, 16#07#, 16#FC#, 16#00#, 16#07#, 16#FF#, 16#00#, 16#3F#, 16#FF#,
16#FF#, 16#FF#, 16#F0#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#00#,
16#1F#, 16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#FF#, 16#FF#, 16#FF#,
16#FC#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#3F#,
16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#03#, 16#FF#, 16#FF#, 16#FF#, 16#FF#,
16#00#, 16#1F#, 16#FF#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#FF#, 16#80#,
16#01#, 16#FF#, 16#E0#, 16#07#, 16#FC#, 16#00#, 16#07#, 16#FF#, 16#00#,
16#3F#, 16#E0#, 16#00#, 16#1F#, 16#F8#, 16#03#, 16#FF#, 16#00#, 16#00#,
16#FF#, 16#C0#, 16#1F#, 16#F0#, 16#00#, 16#07#, 16#FE#, 16#00#, 16#FF#,
16#80#, 16#00#, 16#3F#, 16#F0#, 16#07#, 16#FC#, 16#00#, 16#03#, 16#FF#,
16#00#, 16#7F#, 16#E0#, 16#00#, 16#1F#, 16#F8#, 16#03#, 16#FE#, 16#00#,
16#00#, 16#FF#, 16#C0#, 16#1F#, 16#F0#, 16#00#, 16#07#, 16#FE#, 16#00#,
16#FF#, 16#80#, 16#00#, 16#3F#, 16#F0#, 16#07#, 16#FC#, 16#00#, 16#03#,
16#FF#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#1F#, 16#F8#, 16#03#, 16#FE#,
16#00#, 16#00#, 16#FF#, 16#C0#, 16#1F#, 16#F0#, 16#00#, 16#07#, 16#FE#,
16#00#, 16#FF#, 16#80#, 16#00#, 16#3F#, 16#F0#, 16#0F#, 16#FC#, 16#00#,
16#01#, 16#FF#, 16#C0#, 16#7F#, 16#C0#, 16#00#, 16#0F#, 16#FE#, 16#00#,
16#00#, 16#00#, 16#0F#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#,
16#E0#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#01#, 16#FF#,
16#FF#, 16#FF#, 16#80#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#01#,
16#FF#, 16#FF#, 16#FF#, 16#F0#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 16#FC#,
16#01#, 16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#01#, 16#FF#, 16#F0#, 16#1F#,
16#FF#, 16#80#, 16#FF#, 16#E0#, 16#03#, 16#FF#, 16#C0#, 16#FF#, 16#E0#,
16#00#, 16#FF#, 16#E0#, 16#7F#, 16#E0#, 16#00#, 16#3F#, 16#F0#, 16#3F#,
16#E0#, 16#00#, 16#1F#, 16#F8#, 16#3F#, 16#F0#, 16#00#, 16#0F#, 16#FC#,
16#1F#, 16#F8#, 16#00#, 16#07#, 16#FE#, 16#0F#, 16#FC#, 16#00#, 16#00#,
16#00#, 16#07#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#03#, 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#3F#, 16#FF#, 16#F8#, 16#00#, 16#00#,
16#1F#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#FE#,
16#00#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#7F#, 16#FF#,
16#FF#, 16#F8#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#00#,
16#FF#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#C0#,
16#00#, 16#00#, 16#1F#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#FF#,
16#F0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#F8#, 16#00#, 16#00#, 16#00#,
16#0F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FE#, 16#7F#, 16#E0#,
16#00#, 16#03#, 16#FF#, 16#3F#, 16#F0#, 16#00#, 16#01#, 16#FF#, 16#1F#,
16#F8#, 16#00#, 16#00#, 16#FF#, 16#8F#, 16#FC#, 16#00#, 16#00#, 16#FF#,
16#C7#, 16#FF#, 16#00#, 16#00#, 16#FF#, 16#C3#, 16#FF#, 16#C0#, 16#00#,
16#FF#, 16#E0#, 16#FF#, 16#FC#, 16#03#, 16#FF#, 16#E0#, 16#7F#, 16#FF#,
16#FF#, 16#FF#, 16#F0#, 16#1F#, 16#FF#, 16#FF#, 16#FF#, 16#F0#, 16#0F#,
16#FF#, 16#FF#, 16#FF#, 16#F0#, 16#03#, 16#FF#, 16#FF#, 16#FF#, 16#F0#,
16#00#, 16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#1F#, 16#FF#, 16#FF#,
16#E0#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#1F#,
16#FC#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#FF#, 16#FD#, 16#FF#,
16#FF#, 16#FF#, 16#FF#, 16#F7#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#DF#,
16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#F9#,
16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#EF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#,
16#BF#, 16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#03#, 16#FE#, 16#00#,
16#00#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#03#, 16#FC#,
16#00#, 16#00#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#7F#,
16#C0#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#07#,
16#F8#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#FF#, 16#80#, 16#00#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#00#, 16#00#,
16#0F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#00#,
16#01#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#,
16#00#, 16#1F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#,
16#00#, 16#03#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F8#, 16#00#,
16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#00#,
16#00#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#FF#,
16#00#, 16#00#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#3F#,
16#E0#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#03#,
16#FE#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#,
16#7F#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#00#,
16#07#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#00#,
16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#80#,
16#00#, 16#3F#, 16#E0#, 16#3F#, 16#F0#, 16#00#, 16#07#, 16#FC#, 16#07#,
16#FC#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#3F#,
16#E0#, 16#3F#, 16#F0#, 16#00#, 16#07#, 16#FC#, 16#07#, 16#FE#, 16#00#,
16#00#, 16#FF#, 16#80#, 16#FF#, 16#80#, 16#00#, 16#3F#, 16#E0#, 16#1F#,
16#F0#, 16#00#, 16#07#, 16#FC#, 16#07#, 16#FE#, 16#00#, 16#00#, 16#FF#,
16#80#, 16#FF#, 16#C0#, 16#00#, 16#1F#, 16#F0#, 16#1F#, 16#F8#, 16#00#,
16#03#, 16#FE#, 16#03#, 16#FE#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#7F#,
16#C0#, 16#00#, 16#1F#, 16#F0#, 16#1F#, 16#F8#, 16#00#, 16#03#, 16#FE#,
16#03#, 16#FF#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#7F#, 16#C0#, 16#00#,
16#1F#, 16#F0#, 16#0F#, 16#F8#, 16#00#, 16#03#, 16#FE#, 16#03#, 16#FF#,
16#00#, 16#00#, 16#7F#, 16#C0#, 16#7F#, 16#E0#, 16#00#, 16#0F#, 16#F8#,
16#0F#, 16#F8#, 16#00#, 16#01#, 16#FE#, 16#01#, 16#FF#, 16#00#, 16#00#,
16#7F#, 16#C0#, 16#3F#, 16#E0#, 16#00#, 16#0F#, 16#F8#, 16#0F#, 16#FC#,
16#00#, 16#01#, 16#FF#, 16#01#, 16#FF#, 16#80#, 16#00#, 16#3F#, 16#E0#,
16#3F#, 16#E0#, 16#00#, 16#0F#, 16#F8#, 16#07#, 16#FC#, 16#00#, 16#01#,
16#FF#, 16#01#, 16#FF#, 16#80#, 16#00#, 16#3F#, 16#E0#, 16#3F#, 16#F0#,
16#00#, 16#07#, 16#FC#, 16#07#, 16#FC#, 16#00#, 16#01#, 16#FF#, 16#00#,
16#FF#, 16#80#, 16#00#, 16#3F#, 16#E0#, 16#1F#, 16#F0#, 16#00#, 16#07#,
16#FC#, 16#07#, 16#FE#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#FF#, 16#C0#,
16#00#, 16#1F#, 16#F0#, 16#1F#, 16#F8#, 16#00#, 16#07#, 16#FE#, 16#03#,
16#FF#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#7F#, 16#E0#, 16#00#, 16#3F#,
16#F0#, 16#0F#, 16#FE#, 16#00#, 16#0F#, 16#FC#, 16#01#, 16#FF#, 16#E0#,
16#03#, 16#FF#, 16#80#, 16#3F#, 16#FF#, 16#01#, 16#FF#, 16#E0#, 16#03#,
16#FF#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#FF#,
16#00#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#7F#, 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#FC#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FE#, 16#00#,
16#00#, 16#00#, 16#0F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#C0#,
16#00#, 16#03#, 16#FE#, 16#FF#, 16#C0#, 16#00#, 16#07#, 16#FE#, 16#7F#,
16#C0#, 16#00#, 16#07#, 16#FC#, 16#7F#, 16#C0#, 16#00#, 16#0F#, 16#FC#,
16#7F#, 16#C0#, 16#00#, 16#0F#, 16#F8#, 16#7F#, 16#C0#, 16#00#, 16#1F#,
16#F8#, 16#7F#, 16#C0#, 16#00#, 16#1F#, 16#F0#, 16#7F#, 16#C0#, 16#00#,
16#3F#, 16#E0#, 16#7F#, 16#C0#, 16#00#, 16#3F#, 16#E0#, 16#3F#, 16#E0#,
16#00#, 16#7F#, 16#C0#, 16#3F#, 16#E0#, 16#00#, 16#7F#, 16#C0#, 16#3F#,
16#E0#, 16#00#, 16#FF#, 16#80#, 16#3F#, 16#E0#, 16#00#, 16#FF#, 16#80#,
16#3F#, 16#E0#, 16#01#, 16#FF#, 16#00#, 16#3F#, 16#E0#, 16#01#, 16#FF#,
16#00#, 16#3F#, 16#E0#, 16#03#, 16#FE#, 16#00#, 16#3F#, 16#E0#, 16#03#,
16#FC#, 16#00#, 16#1F#, 16#E0#, 16#07#, 16#FC#, 16#00#, 16#1F#, 16#E0#,
16#07#, 16#F8#, 16#00#, 16#1F#, 16#E0#, 16#0F#, 16#F8#, 16#00#, 16#1F#,
16#E0#, 16#0F#, 16#F0#, 16#00#, 16#1F#, 16#F0#, 16#1F#, 16#F0#, 16#00#,
16#1F#, 16#F0#, 16#1F#, 16#E0#, 16#00#, 16#1F#, 16#F0#, 16#3F#, 16#E0#,
16#00#, 16#1F#, 16#F0#, 16#3F#, 16#C0#, 16#00#, 16#0F#, 16#F0#, 16#7F#,
16#C0#, 16#00#, 16#0F#, 16#F0#, 16#7F#, 16#80#, 16#00#, 16#0F#, 16#F0#,
16#FF#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#FF#, 16#00#, 16#00#, 16#0F#,
16#F1#, 16#FE#, 16#00#, 16#00#, 16#0F#, 16#F1#, 16#FE#, 16#00#, 16#00#,
16#0F#, 16#F3#, 16#FC#, 16#00#, 16#00#, 16#0F#, 16#F3#, 16#FC#, 16#00#,
16#00#, 16#07#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#F8#,
16#00#, 16#00#, 16#07#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#FF#,
16#E0#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#07#,
16#FF#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#C0#, 16#00#, 16#00#,
16#07#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#80#, 16#00#,
16#00#, 16#03#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#00#,
16#00#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FC#,
16#00#, 16#00#, 16#00#, 16#FF#, 16#C0#, 16#01#, 16#FF#, 16#80#, 16#01#,
16#FF#, 16#FF#, 16#E0#, 16#00#, 16#FF#, 16#C0#, 16#00#, 16#FF#, 16#BF#,
16#F0#, 16#00#, 16#7F#, 16#E0#, 16#00#, 16#FF#, 16#DF#, 16#F8#, 16#00#,
16#7F#, 16#F0#, 16#00#, 16#7F#, 16#EF#, 16#FC#, 16#00#, 16#3F#, 16#F8#,
16#00#, 16#7F#, 16#E7#, 16#FE#, 16#00#, 16#3F#, 16#FC#, 16#00#, 16#3F#,
16#F3#, 16#FF#, 16#00#, 16#1F#, 16#FE#, 16#00#, 16#1F#, 16#F0#, 16#FF#,
16#80#, 16#0F#, 16#FF#, 16#00#, 16#1F#, 16#F8#, 16#7F#, 16#C0#, 16#0F#,
16#FF#, 16#80#, 16#0F#, 16#F8#, 16#3F#, 16#E0#, 16#07#, 16#FF#, 16#C0#,
16#0F#, 16#FC#, 16#1F#, 16#F0#, 16#07#, 16#FF#, 16#E0#, 16#07#, 16#FC#,
16#0F#, 16#F8#, 16#03#, 16#FF#, 16#F0#, 16#07#, 16#FE#, 16#07#, 16#FC#,
16#01#, 16#FB#, 16#F8#, 16#03#, 16#FE#, 16#03#, 16#FE#, 16#01#, 16#FD#,
16#FC#, 16#01#, 16#FF#, 16#01#, 16#FF#, 16#00#, 16#FC#, 16#FE#, 16#01#,
16#FF#, 16#00#, 16#FF#, 16#80#, 16#FE#, 16#7F#, 16#00#, 16#FF#, 16#80#,
16#7F#, 16#C0#, 16#7E#, 16#3F#, 16#80#, 16#FF#, 16#80#, 16#3F#, 16#E0#,
16#3F#, 16#1F#, 16#C0#, 16#7F#, 16#C0#, 16#1F#, 16#F0#, 16#3F#, 16#8F#,
16#E0#, 16#3F#, 16#C0#, 16#0F#, 16#F8#, 16#1F#, 16#87#, 16#F0#, 16#3F#,
16#E0#, 16#07#, 16#FC#, 16#1F#, 16#C3#, 16#F8#, 16#1F#, 16#E0#, 16#01#,
16#FE#, 16#0F#, 16#C1#, 16#FC#, 16#1F#, 16#F0#, 16#00#, 16#FF#, 16#07#,
16#E0#, 16#FE#, 16#0F#, 16#F0#, 16#00#, 16#7F#, 16#87#, 16#F0#, 16#7F#,
16#07#, 16#F8#, 16#00#, 16#3F#, 16#C3#, 16#F0#, 16#3F#, 16#87#, 16#F8#,
16#00#, 16#1F#, 16#E3#, 16#F8#, 16#1F#, 16#C3#, 16#FC#, 16#00#, 16#0F#,
16#F1#, 16#F8#, 16#0F#, 16#E3#, 16#FC#, 16#00#, 16#07#, 16#F8#, 16#FC#,
16#07#, 16#F1#, 16#FE#, 16#00#, 16#03#, 16#FC#, 16#FC#, 16#03#, 16#F9#,
16#FE#, 16#00#, 16#01#, 16#FE#, 16#7E#, 16#01#, 16#FC#, 16#FF#, 16#00#,
16#00#, 16#FF#, 16#7F#, 16#00#, 16#FE#, 16#7F#, 16#00#, 16#00#, 16#7F#,
16#BF#, 16#00#, 16#7F#, 16#7F#, 16#80#, 16#00#, 16#3F#, 16#DF#, 16#80#,
16#3F#, 16#BF#, 16#80#, 16#00#, 16#1F#, 16#FF#, 16#80#, 16#1F#, 16#FF#,
16#C0#, 16#00#, 16#0F#, 16#FF#, 16#C0#, 16#0F#, 16#FF#, 16#C0#, 16#00#,
16#07#, 16#FF#, 16#E0#, 16#07#, 16#FF#, 16#E0#, 16#00#, 16#01#, 16#FF#,
16#E0#, 16#03#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#FF#, 16#F0#, 16#01#,
16#FF#, 16#F0#, 16#00#, 16#00#, 16#7F#, 16#F0#, 16#00#, 16#FF#, 16#F0#,
16#00#, 16#00#, 16#3F#, 16#F8#, 16#00#, 16#7F#, 16#F8#, 16#00#, 16#00#,
16#1F#, 16#F8#, 16#00#, 16#3F#, 16#F8#, 16#00#, 16#00#, 16#0F#, 16#FC#,
16#00#, 16#1F#, 16#FC#, 16#00#, 16#00#, 16#07#, 16#FE#, 16#00#, 16#0F#,
16#FC#, 16#00#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#07#, 16#FE#, 16#00#,
16#00#, 16#01#, 16#FF#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#00#, 16#00#,
16#FF#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#,
16#FC#, 16#00#, 16#03#, 16#FF#, 16#80#, 16#07#, 16#FF#, 16#80#, 16#00#,
16#FF#, 16#C0#, 16#01#, 16#FF#, 16#E0#, 16#00#, 16#7F#, 16#E0#, 16#00#,
16#3F#, 16#F8#, 16#00#, 16#3F#, 16#F8#, 16#00#, 16#0F#, 16#FF#, 16#00#,
16#1F#, 16#FC#, 16#00#, 16#01#, 16#FF#, 16#C0#, 16#0F#, 16#FE#, 16#00#,
16#00#, 16#7F#, 16#F0#, 16#03#, 16#FF#, 16#00#, 16#00#, 16#0F#, 16#FE#,
16#01#, 16#FF#, 16#80#, 16#00#, 16#03#, 16#FF#, 16#80#, 16#FF#, 16#C0#,
16#00#, 16#00#, 16#FF#, 16#E0#, 16#7F#, 16#E0#, 16#00#, 16#00#, 16#1F#,
16#FC#, 16#3F#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#0F#, 16#FC#,
16#00#, 16#00#, 16#00#, 16#FF#, 16#C7#, 16#FE#, 16#00#, 16#00#, 16#00#,
16#3F#, 16#FB#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#FF#,
16#80#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#7F#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#,
16#F8#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FC#, 16#00#, 16#00#,
16#00#, 16#00#, 16#7F#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#,
16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#80#, 16#00#,
16#00#, 16#00#, 16#00#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#3F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FE#, 16#00#,
16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#,
16#07#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FE#,
16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#00#,
16#00#, 16#7F#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#,
16#FC#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#F3#, 16#FF#, 16#00#, 16#00#,
16#00#, 16#0F#, 16#FC#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#FE#,
16#3F#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#07#, 16#FF#, 16#00#,
16#00#, 16#01#, 16#FF#, 16#81#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#7F#,
16#E0#, 16#3F#, 16#F0#, 16#00#, 16#00#, 16#3F#, 16#F0#, 16#0F#, 16#FE#,
16#00#, 16#00#, 16#1F#, 16#F8#, 16#03#, 16#FF#, 16#80#, 16#00#, 16#0F#,
16#FC#, 16#00#, 16#7F#, 16#F0#, 16#00#, 16#07#, 16#FF#, 16#00#, 16#1F#,
16#FC#, 16#00#, 16#03#, 16#FF#, 16#80#, 16#07#, 16#FF#, 16#80#, 16#01#,
16#FF#, 16#C0#, 16#00#, 16#FF#, 16#E0#, 16#00#, 16#7F#, 16#E0#, 16#00#,
16#3F#, 16#FC#, 16#00#, 16#3F#, 16#F8#, 16#00#, 16#0F#, 16#FF#, 16#00#,
16#1F#, 16#FC#, 16#00#, 16#01#, 16#FF#, 16#C0#, 16#00#, 16#7F#, 16#E0#,
16#00#, 16#07#, 16#FE#, 16#7F#, 16#E0#, 16#00#, 16#0F#, 16#FE#, 16#7F#,
16#F0#, 16#00#, 16#0F#, 16#FC#, 16#3F#, 16#F0#, 16#00#, 16#1F#, 16#F8#,
16#3F#, 16#F0#, 16#00#, 16#3F#, 16#F0#, 16#3F#, 16#F0#, 16#00#, 16#3F#,
16#F0#, 16#1F#, 16#F8#, 16#00#, 16#7F#, 16#E0#, 16#1F#, 16#F8#, 16#00#,
16#FF#, 16#C0#, 16#1F#, 16#F8#, 16#00#, 16#FF#, 16#C0#, 16#1F#, 16#FC#,
16#01#, 16#FF#, 16#80#, 16#0F#, 16#FC#, 16#03#, 16#FF#, 16#00#, 16#0F#,
16#FC#, 16#03#, 16#FE#, 16#00#, 16#0F#, 16#FC#, 16#07#, 16#FE#, 16#00#,
16#07#, 16#FE#, 16#0F#, 16#FC#, 16#00#, 16#07#, 16#FE#, 16#0F#, 16#F8#,
16#00#, 16#07#, 16#FE#, 16#1F#, 16#F0#, 16#00#, 16#03#, 16#FE#, 16#3F#,
16#F0#, 16#00#, 16#03#, 16#FF#, 16#3F#, 16#E0#, 16#00#, 16#03#, 16#FF#,
16#7F#, 16#C0#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#01#,
16#FF#, 16#FF#, 16#80#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#00#, 16#00#,
16#00#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FE#, 16#00#,
16#00#, 16#00#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#F8#,
16#00#, 16#00#, 16#00#, 16#7F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#7F#,
16#F0#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#3F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#7F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#7F#, 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#80#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#,
16#FF#, 16#80#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#00#, 16#00#,
16#01#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#00#,
16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#00#,
16#00#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FE#,
16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#FF#, 16#F0#,
16#07#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#7F#, 16#FF#, 16#FF#,
16#FF#, 16#F0#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#7F#,
16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#FE#,
16#00#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#0F#, 16#FF#, 16#FF#,
16#FF#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#3F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#,
16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#1F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#80#, 16#00#,
16#00#, 16#00#, 16#7F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FE#,
16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#,
16#3F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#00#, 16#00#,
16#00#, 16#00#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FC#,
16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#,
16#7F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FE#, 16#00#, 16#00#,
16#00#, 16#01#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#F8#,
16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#,
16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FC#, 16#00#, 16#00#,
16#00#, 16#03#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#0F#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#01#,
16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#F8#, 16#00#, 16#00#,
16#00#, 16#07#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#1F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#03#,
16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#FF#,
16#F0#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#7F#, 16#FF#,
16#FF#, 16#FF#, 16#F0#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#00#,
16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#0F#, 16#FF#, 16#FF#, 16#FF#,
16#FE#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#0F#, 16#FF#,
16#FF#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#F0#, 16#00#,
16#3F#, 16#FF#, 16#00#, 16#07#, 16#FF#, 16#F0#, 16#00#, 16#7F#, 16#FE#,
16#00#, 16#07#, 16#FF#, 16#E0#, 16#00#, 16#7F#, 16#FE#, 16#00#, 16#0F#,
16#FF#, 16#E0#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#00#,
16#00#, 16#FE#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#01#, 16#FE#,
16#00#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#00#,
16#1F#, 16#C0#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#00#, 16#3F#, 16#C0#,
16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#07#,
16#F8#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#07#, 16#F0#, 16#00#,
16#00#, 16#7F#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#FF#,
16#00#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#,
16#0F#, 16#E0#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#1F#, 16#E0#,
16#00#, 16#01#, 16#FC#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#03#,
16#FC#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#03#, 16#F8#, 16#00#,
16#00#, 16#3F#, 16#80#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#7F#,
16#80#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#00#,
16#07#, 16#F0#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#0F#, 16#F0#,
16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#00#,
16#FE#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#01#, 16#FC#, 16#00#,
16#00#, 16#1F#, 16#C0#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#00#, 16#3F#,
16#C0#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#80#,
16#03#, 16#FF#, 16#F8#, 16#00#, 16#7F#, 16#FF#, 16#80#, 16#07#, 16#FF#,
16#F8#, 16#00#, 16#7F#, 16#FF#, 16#00#, 16#07#, 16#FF#, 16#F0#, 16#00#,
16#7F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#20#, 16#08#, 16#03#, 16#00#,
16#E0#, 16#18#, 16#07#, 16#01#, 16#C0#, 16#78#, 16#1E#, 16#07#, 16#C1#,
16#F0#, 16#7C#, 16#1F#, 16#07#, 16#C1#, 16#F0#, 16#3C#, 16#0F#, 16#03#,
16#C0#, 16#F0#, 16#3E#, 16#0F#, 16#83#, 16#E0#, 16#F8#, 16#3E#, 16#0F#,
16#81#, 16#E0#, 16#78#, 16#1E#, 16#07#, 16#81#, 16#F0#, 16#7C#, 16#1F#,
16#07#, 16#C1#, 16#F0#, 16#7C#, 16#0F#, 16#03#, 16#C0#, 16#F0#, 16#3C#,
16#0F#, 16#83#, 16#E0#, 16#F8#, 16#3E#, 16#0F#, 16#83#, 16#E0#, 16#78#,
16#1E#, 16#07#, 16#81#, 16#E0#, 16#7C#, 16#1F#, 16#07#, 16#C1#, 16#F0#,
16#7C#, 16#00#, 16#0F#, 16#FF#, 16#E0#, 16#00#, 16#FF#, 16#FE#, 16#00#,
16#0F#, 16#FF#, 16#E0#, 16#01#, 16#FF#, 16#FE#, 16#00#, 16#1F#, 16#FF#,
16#E0#, 16#01#, 16#FF#, 16#FC#, 16#00#, 16#1F#, 16#FF#, 16#C0#, 16#00#,
16#03#, 16#FC#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#03#, 16#F8#,
16#00#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#,
16#7F#, 16#80#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#7F#, 16#00#,
16#00#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#0F#,
16#F0#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#00#,
16#01#, 16#FE#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#01#, 16#FC#,
16#00#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#00#,
16#3F#, 16#C0#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#00#, 16#3F#, 16#80#,
16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#07#,
16#F8#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#,
16#00#, 16#7F#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#FE#,
16#00#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#,
16#1F#, 16#E0#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#1F#, 16#C0#,
16#00#, 16#01#, 16#FC#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#03#,
16#FC#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#03#, 16#F8#, 16#00#,
16#00#, 16#3F#, 16#80#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#7F#,
16#80#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#00#,
16#0F#, 16#F0#, 16#00#, 16#7F#, 16#FF#, 16#00#, 16#07#, 16#FF#, 16#E0#,
16#00#, 16#7F#, 16#FE#, 16#00#, 16#07#, 16#FF#, 16#E0#, 16#00#, 16#FF#,
16#FE#, 16#00#, 16#0F#, 16#FF#, 16#C0#, 16#00#, 16#FF#, 16#FC#, 16#00#,
16#00#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#0F#, 16#F8#, 16#00#,
16#00#, 16#FF#, 16#C0#, 16#00#, 16#07#, 16#FE#, 16#00#, 16#00#, 16#7F#,
16#F0#, 16#00#, 16#07#, 16#FF#, 16#80#, 16#00#, 16#3F#, 16#FE#, 16#00#,
16#03#, 16#FF#, 16#F0#, 16#00#, 16#1F#, 16#FF#, 16#80#, 16#01#, 16#FD#,
16#FC#, 16#00#, 16#1F#, 16#CF#, 16#E0#, 16#00#, 16#FE#, 16#7F#, 16#80#,
16#0F#, 16#E1#, 16#FC#, 16#00#, 16#7F#, 16#0F#, 16#E0#, 16#07#, 16#F0#,
16#7F#, 16#00#, 16#7F#, 16#03#, 16#F8#, 16#03#, 16#F8#, 16#1F#, 16#E0#,
16#3F#, 16#80#, 16#7F#, 16#01#, 16#FC#, 16#03#, 16#F8#, 16#1F#, 16#C0#,
16#1F#, 16#C1#, 16#FC#, 16#00#, 16#FE#, 16#0F#, 16#E0#, 16#07#, 16#F0#,
16#FE#, 16#00#, 16#1F#, 16#C7#, 16#F0#, 16#00#, 16#FE#, 16#7F#, 16#00#,
16#07#, 16#F7#, 16#F0#, 16#00#, 16#3F#, 16#BF#, 16#80#, 16#01#, 16#FC#,
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#F7#, 16#FF#, 16#FF#, 16#FF#,
16#FF#, 16#EF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#FE#, 16#1F#,
16#C3#, 16#F0#, 16#FC#, 16#1F#, 16#83#, 16#E0#, 16#F8#, 16#1F#, 16#03#,
16#C0#, 16#00#, 16#01#, 16#FF#, 16#C0#, 16#00#, 16#03#, 16#FF#, 16#FF#,
16#00#, 16#03#, 16#FF#, 16#FF#, 16#E0#, 16#01#, 16#FF#, 16#FF#, 16#FC#,
16#00#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#7F#, 16#FF#, 16#FF#, 16#F0#,
16#3F#, 16#FF#, 16#FF#, 16#FC#, 16#0F#, 16#FC#, 16#0F#, 16#FE#, 16#03#,
16#FC#, 16#00#, 16#FF#, 16#81#, 16#FF#, 16#00#, 16#3F#, 16#E0#, 16#7F#,
16#80#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#00#,
16#01#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#C0#, 16#00#, 16#03#,
16#FF#, 16#F0#, 16#00#, 16#3F#, 16#FF#, 16#FC#, 16#00#, 16#7F#, 16#FF#,
16#FF#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#80#, 16#7F#, 16#FF#, 16#FF#,
16#E0#, 16#3F#, 16#FF#, 16#E7#, 16#F8#, 16#1F#, 16#FF#, 16#03#, 16#FE#,
16#0F#, 16#FE#, 16#00#, 16#FF#, 16#83#, 16#FE#, 16#00#, 16#3F#, 16#C1#,
16#FF#, 16#80#, 16#0F#, 16#F0#, 16#7F#, 16#C0#, 16#07#, 16#FC#, 16#3F#,
16#F0#, 16#01#, 16#FF#, 16#0F#, 16#FC#, 16#00#, 16#FF#, 16#83#, 16#FF#,
16#00#, 16#7F#, 16#E0#, 16#FF#, 16#E0#, 16#7F#, 16#F8#, 16#3F#, 16#FF#,
16#FF#, 16#FE#, 16#0F#, 16#FF#, 16#FF#, 16#FF#, 16#81#, 16#FF#, 16#FF#,
16#FF#, 16#E0#, 16#3F#, 16#FF#, 16#DF#, 16#F8#, 16#07#, 16#FF#, 16#E7#,
16#FF#, 16#00#, 16#FF#, 16#E1#, 16#FF#, 16#C0#, 16#0F#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#FE#, 16#00#,
16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#80#,
16#00#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#C0#,
16#00#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#F0#,
16#00#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F8#,
16#00#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#FE#,
16#07#, 16#F0#, 16#00#, 16#1F#, 16#E1#, 16#FF#, 16#E0#, 16#00#, 16#FF#,
16#1F#, 16#FF#, 16#C0#, 16#07#, 16#F9#, 16#FF#, 16#FF#, 16#00#, 16#3F#,
16#DF#, 16#FF#, 16#FC#, 16#03#, 16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#1F#,
16#FF#, 16#FF#, 16#FF#, 16#80#, 16#FF#, 16#F8#, 16#3F#, 16#FC#, 16#07#,
16#FF#, 16#00#, 16#FF#, 16#E0#, 16#3F#, 16#F0#, 16#03#, 16#FF#, 16#83#,
16#FF#, 16#00#, 16#1F#, 16#FC#, 16#1F#, 16#F0#, 16#00#, 16#7F#, 16#E0#,
16#FF#, 16#80#, 16#03#, 16#FF#, 16#07#, 16#F8#, 16#00#, 16#1F#, 16#F8#,
16#7F#, 16#C0#, 16#00#, 16#FF#, 16#C3#, 16#FC#, 16#00#, 16#07#, 16#FE#,
16#1F#, 16#E0#, 16#00#, 16#3F#, 16#F0#, 16#FF#, 16#00#, 16#01#, 16#FF#,
16#8F#, 16#F8#, 16#00#, 16#0F#, 16#F8#, 16#7F#, 16#80#, 16#00#, 16#FF#,
16#C3#, 16#FC#, 16#00#, 16#07#, 16#FE#, 16#1F#, 16#E0#, 16#00#, 16#3F#,
16#F0#, 16#FF#, 16#00#, 16#03#, 16#FF#, 16#0F#, 16#F8#, 16#00#, 16#1F#,
16#F8#, 16#7F#, 16#E0#, 16#01#, 16#FF#, 16#83#, 16#FF#, 16#00#, 16#1F#,
16#FC#, 16#1F#, 16#F8#, 16#01#, 16#FF#, 16#C1#, 16#FF#, 16#E0#, 16#1F#,
16#FC#, 16#0F#, 16#FF#, 16#C3#, 16#FF#, 16#E0#, 16#7F#, 16#FF#, 16#FF#,
16#FE#, 16#03#, 16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#3F#, 16#FF#, 16#FF#,
16#FE#, 16#01#, 16#FF#, 16#7F#, 16#FF#, 16#E0#, 16#0F#, 16#F9#, 16#FF#,
16#FC#, 16#00#, 16#7F#, 16#C7#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#0F#,
16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#01#,
16#FF#, 16#FC#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#C0#, 16#01#, 16#FF#,
16#FF#, 16#F8#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#7F#, 16#FF#,
16#FF#, 16#E0#, 16#3F#, 16#FF#, 16#FF#, 16#F8#, 16#1F#, 16#FE#, 16#0F#,
16#FE#, 16#07#, 16#FE#, 16#01#, 16#FF#, 16#C3#, 16#FF#, 16#00#, 16#7F#,
16#F1#, 16#FF#, 16#80#, 16#0F#, 16#FC#, 16#7F#, 16#C0#, 16#03#, 16#FF#,
16#3F#, 16#F0#, 16#00#, 16#FF#, 16#CF#, 16#FC#, 16#00#, 16#00#, 16#03#,
16#FE#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#7F#,
16#E0#, 16#00#, 16#00#, 16#1F#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#FC#,
16#00#, 16#00#, 16#03#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#C0#,
16#00#, 16#00#, 16#3F#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#FC#, 16#00#,
16#00#, 16#03#, 16#FF#, 16#00#, 16#0F#, 16#F8#, 16#FF#, 16#C0#, 16#07#,
16#FE#, 16#3F#, 16#F0#, 16#01#, 16#FF#, 16#0F#, 16#FE#, 16#00#, 16#FF#,
16#C1#, 16#FF#, 16#80#, 16#7F#, 16#E0#, 16#7F#, 16#F8#, 16#3F#, 16#F8#,
16#1F#, 16#FF#, 16#FF#, 16#FC#, 16#03#, 16#FF#, 16#FF#, 16#FE#, 16#00#,
16#7F#, 16#FF#, 16#FF#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 16#80#, 16#01#,
16#FF#, 16#FF#, 16#C0#, 16#00#, 16#3F#, 16#FF#, 16#C0#, 16#00#, 16#00#,
16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FE#, 16#00#,
16#00#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F8#,
16#00#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#7F#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#01#,
16#FF#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#00#, 16#00#,
16#07#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#3F#, 16#E0#, 16#00#, 16#0F#, 16#E0#, 16#7F#, 16#80#, 16#00#,
16#FF#, 16#F0#, 16#FF#, 16#00#, 16#07#, 16#FF#, 16#F3#, 16#FE#, 16#00#,
16#1F#, 16#FF#, 16#F7#, 16#FC#, 16#00#, 16#7F#, 16#FF#, 16#EF#, 16#F8#,
16#01#, 16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#07#, 16#FF#, 16#FF#, 16#FF#,
16#C0#, 16#1F#, 16#FF#, 16#0F#, 16#FF#, 16#80#, 16#7F#, 16#F8#, 16#07#,
16#FF#, 16#00#, 16#FF#, 16#E0#, 16#0F#, 16#FC#, 16#03#, 16#FF#, 16#80#,
16#0F#, 16#F8#, 16#07#, 16#FE#, 16#00#, 16#1F#, 16#F0#, 16#1F#, 16#F8#,
16#00#, 16#3F#, 16#E0#, 16#3F#, 16#F0#, 16#00#, 16#7F#, 16#C0#, 16#FF#,
16#C0#, 16#00#, 16#FF#, 16#01#, 16#FF#, 16#80#, 16#01#, 16#FE#, 16#03#,
16#FF#, 16#00#, 16#03#, 16#FC#, 16#07#, 16#FC#, 16#00#, 16#07#, 16#F8#,
16#1F#, 16#F8#, 16#00#, 16#0F#, 16#E0#, 16#3F#, 16#F0#, 16#00#, 16#1F#,
16#C0#, 16#7F#, 16#E0#, 16#00#, 16#3F#, 16#80#, 16#FF#, 16#C0#, 16#00#,
16#FF#, 16#01#, 16#FF#, 16#80#, 16#01#, 16#FC#, 16#03#, 16#FF#, 16#00#,
16#07#, 16#F8#, 16#07#, 16#FE#, 16#00#, 16#0F#, 16#F0#, 16#0F#, 16#FE#,
16#00#, 16#3F#, 16#E0#, 16#1F#, 16#FC#, 16#00#, 16#FF#, 16#C0#, 16#1F#,
16#FC#, 16#03#, 16#FF#, 16#00#, 16#3F#, 16#FC#, 16#1F#, 16#FE#, 16#00#,
16#7F#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#F8#,
16#00#, 16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#FF#, 16#FF#, 16#BF#,
16#C0#, 16#00#, 16#FF#, 16#FE#, 16#7F#, 16#80#, 16#00#, 16#FF#, 16#F0#,
16#FF#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#,
16#01#, 16#FF#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#F8#, 16#00#, 16#03#,
16#FF#, 16#FF#, 16#80#, 16#01#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#FF#,
16#FF#, 16#FE#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#C0#, 16#3F#, 16#FF#,
16#FF#, 16#F8#, 16#1F#, 16#FC#, 16#0F#, 16#FE#, 16#0F#, 16#FC#, 16#01#,
16#FF#, 16#83#, 16#FE#, 16#00#, 16#7F#, 16#F1#, 16#FF#, 16#80#, 16#0F#,
16#FC#, 16#7F#, 16#C0#, 16#03#, 16#FF#, 16#3F#, 16#F0#, 16#00#, 16#FF#,
16#CF#, 16#F8#, 16#00#, 16#3F#, 16#F7#, 16#FF#, 16#FF#, 16#FF#, 16#FD#,
16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#DF#,
16#FF#, 16#FF#, 16#FF#, 16#EF#, 16#FF#, 16#FF#, 16#FF#, 16#FB#, 16#FF#,
16#FF#, 16#FF#, 16#FE#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#3F#, 16#F0#,
16#00#, 16#00#, 16#0F#, 16#FC#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#00#,
16#00#, 16#00#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#3F#, 16#F0#, 16#00#,
16#FF#, 16#8F#, 16#FE#, 16#00#, 16#7F#, 16#C1#, 16#FF#, 16#C0#, 16#3F#,
16#F0#, 16#7F#, 16#F8#, 16#3F#, 16#F8#, 16#0F#, 16#FF#, 16#FF#, 16#FC#,
16#03#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#00#,
16#0F#, 16#FF#, 16#FF#, 16#80#, 16#01#, 16#FF#, 16#FF#, 16#C0#, 16#00#,
16#1F#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#00#,
16#03#, 16#FE#, 16#00#, 16#1F#, 16#FC#, 16#00#, 16#7F#, 16#F8#, 16#01#,
16#FF#, 16#F0#, 16#07#, 16#FF#, 16#C0#, 16#0F#, 16#FF#, 16#80#, 16#3F#,
16#FF#, 16#00#, 16#7F#, 16#E0#, 16#00#, 16#FF#, 16#80#, 16#03#, 16#FE#,
16#00#, 16#07#, 16#FC#, 16#00#, 16#0F#, 16#F8#, 16#03#, 16#FF#, 16#FF#,
16#87#, 16#FF#, 16#FF#, 16#0F#, 16#FF#, 16#FC#, 16#3F#, 16#FF#, 16#F8#,
16#7F#, 16#FF#, 16#F0#, 16#FF#, 16#FF#, 16#E0#, 16#0F#, 16#F0#, 16#00#,
16#1F#, 16#E0#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#FF#, 16#80#, 16#01#,
16#FE#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#1F#,
16#F0#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#FF#,
16#00#, 16#03#, 16#FE#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#0F#, 16#F0#,
16#00#, 16#1F#, 16#E0#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#FF#, 16#80#,
16#01#, 16#FE#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#07#, 16#F8#, 16#00#,
16#1F#, 16#F0#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#7F#, 16#80#, 16#00#,
16#FF#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#0F#,
16#F0#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#,
16#80#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#83#, 16#FC#, 16#00#, 16#1F#,
16#FF#, 16#C7#, 16#F8#, 16#00#, 16#7F#, 16#FF#, 16#9F#, 16#F0#, 16#01#,
16#FF#, 16#FF#, 16#BF#, 16#C0#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#80#,
16#1F#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#7F#, 16#FC#, 16#3F#, 16#FE#,
16#00#, 16#FF#, 16#E0#, 16#1F#, 16#FC#, 16#03#, 16#FF#, 16#80#, 16#3F#,
16#F0#, 16#0F#, 16#FE#, 16#00#, 16#3F#, 16#E0#, 16#1F#, 16#F8#, 16#00#,
16#7F#, 16#C0#, 16#7F#, 16#E0#, 16#00#, 16#FF#, 16#80#, 16#FF#, 16#C0#,
16#00#, 16#FE#, 16#01#, 16#FF#, 16#00#, 16#01#, 16#FC#, 16#07#, 16#FE#,
16#00#, 16#03#, 16#F8#, 16#0F#, 16#FC#, 16#00#, 16#07#, 16#F0#, 16#1F#,
16#F0#, 16#00#, 16#1F#, 16#C0#, 16#3F#, 16#E0#, 16#00#, 16#3F#, 16#80#,
16#FF#, 16#C0#, 16#00#, 16#7F#, 16#01#, 16#FF#, 16#80#, 16#00#, 16#FE#,
16#03#, 16#FF#, 16#00#, 16#03#, 16#FC#, 16#07#, 16#FE#, 16#00#, 16#07#,
16#F0#, 16#0F#, 16#FC#, 16#00#, 16#1F#, 16#E0#, 16#1F#, 16#F8#, 16#00#,
16#3F#, 16#C0#, 16#3F#, 16#F8#, 16#00#, 16#FF#, 16#80#, 16#7F#, 16#F0#,
16#03#, 16#FE#, 16#00#, 16#FF#, 16#F0#, 16#0F#, 16#FC#, 16#00#, 16#FF#,
16#F0#, 16#7F#, 16#F8#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 16#F0#, 16#01#,
16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#03#, 16#FF#, 16#FF#, 16#FF#, 16#80#,
16#03#, 16#FF#, 16#FE#, 16#FF#, 16#00#, 16#03#, 16#FF#, 16#F9#, 16#FE#,
16#00#, 16#03#, 16#FF#, 16#C3#, 16#FC#, 16#00#, 16#00#, 16#FE#, 16#07#,
16#F0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#00#, 16#00#,
16#3F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#7F#, 16#E0#,
16#01#, 16#FF#, 16#00#, 16#FF#, 16#C0#, 16#07#, 16#FC#, 16#01#, 16#FF#,
16#80#, 16#1F#, 16#F8#, 16#01#, 16#FF#, 16#C0#, 16#FF#, 16#E0#, 16#03#,
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#07#, 16#FF#, 16#FF#, 16#C0#,
16#00#, 16#03#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#FC#,
16#00#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#FC#,
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#7F#, 16#80#, 16#00#, 16#00#, 16#07#, 16#F8#,
16#00#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#00#, 16#07#, 16#F8#,
16#00#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F0#,
16#1F#, 16#C0#, 16#00#, 16#FF#, 16#0F#, 16#FF#, 16#00#, 16#0F#, 16#F1#,
16#FF#, 16#FC#, 16#01#, 16#FF#, 16#3F#, 16#FF#, 16#C0#, 16#1F#, 16#E7#,
16#FF#, 16#FE#, 16#01#, 16#FE#, 16#FF#, 16#FF#, 16#F0#, 16#1F#, 16#FF#,
16#FF#, 16#FF#, 16#03#, 16#FF#, 16#E0#, 16#FF#, 16#F0#, 16#3F#, 16#F8#,
16#07#, 16#FF#, 16#03#, 16#FF#, 16#00#, 16#3F#, 16#F0#, 16#3F#, 16#E0#,
16#03#, 16#FE#, 16#03#, 16#FE#, 16#00#, 16#3F#, 16#E0#, 16#7F#, 16#C0#,
16#03#, 16#FE#, 16#07#, 16#FC#, 16#00#, 16#3F#, 16#E0#, 16#7F#, 16#80#,
16#03#, 16#FE#, 16#07#, 16#F8#, 16#00#, 16#3F#, 16#C0#, 16#FF#, 16#80#,
16#03#, 16#FC#, 16#0F#, 16#F8#, 16#00#, 16#7F#, 16#C0#, 16#FF#, 16#80#,
16#07#, 16#FC#, 16#0F#, 16#F0#, 16#00#, 16#7F#, 16#80#, 16#FF#, 16#00#,
16#07#, 16#F8#, 16#1F#, 16#F0#, 16#00#, 16#FF#, 16#81#, 16#FF#, 16#00#,
16#0F#, 16#F8#, 16#1F#, 16#E0#, 16#00#, 16#FF#, 16#81#, 16#FE#, 16#00#,
16#0F#, 16#F0#, 16#3F#, 16#E0#, 16#00#, 16#FF#, 16#03#, 16#FE#, 16#00#,
16#1F#, 16#F0#, 16#3F#, 16#C0#, 16#01#, 16#FF#, 16#03#, 16#FC#, 16#00#,
16#1F#, 16#E0#, 16#7F#, 16#C0#, 16#01#, 16#FE#, 16#07#, 16#FC#, 16#00#,
16#3F#, 16#E0#, 16#7F#, 16#C0#, 16#03#, 16#FE#, 16#07#, 16#F8#, 16#00#,
16#3F#, 16#C0#, 16#7F#, 16#80#, 16#03#, 16#FC#, 16#0F#, 16#F8#, 16#00#,
16#3F#, 16#C0#, 16#00#, 16#7F#, 16#C0#, 16#1F#, 16#F0#, 16#07#, 16#F8#,
16#01#, 16#FE#, 16#00#, 16#FF#, 16#80#, 16#3F#, 16#E0#, 16#0F#, 16#F8#,
16#03#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#7F#, 16#80#, 16#1F#, 16#E0#,
16#07#, 16#F8#, 16#03#, 16#FE#, 16#00#, 16#FF#, 16#00#, 16#3F#, 16#C0#,
16#0F#, 16#F0#, 16#07#, 16#FC#, 16#01#, 16#FF#, 16#00#, 16#7F#, 16#80#,
16#1F#, 16#E0#, 16#07#, 16#F8#, 16#03#, 16#FE#, 16#00#, 16#FF#, 16#80#,
16#3F#, 16#C0#, 16#0F#, 16#F0#, 16#03#, 16#FC#, 16#01#, 16#FF#, 16#00#,
16#7F#, 16#80#, 16#1F#, 16#E0#, 16#07#, 16#F8#, 16#03#, 16#FE#, 16#00#,
16#FF#, 16#80#, 16#3F#, 16#C0#, 16#0F#, 16#F0#, 16#03#, 16#FC#, 16#01#,
16#FF#, 16#00#, 16#7F#, 16#C0#, 16#1F#, 16#E0#, 16#07#, 16#F8#, 16#01#,
16#FE#, 16#00#, 16#FF#, 16#80#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#00#,
16#7F#, 16#C0#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#07#, 16#F8#, 16#00#,
16#03#, 16#FE#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#3F#, 16#E0#,
16#00#, 16#0F#, 16#F8#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#,
16#1F#, 16#E0#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#03#, 16#FC#, 16#00#,
16#00#, 16#FF#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#1F#, 16#F0#,
16#00#, 16#07#, 16#FC#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#7F#,
16#80#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#03#,
16#FC#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#,
16#1F#, 16#F0#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#01#, 16#FE#, 16#00#,
16#00#, 16#7F#, 16#80#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#0F#, 16#F8#,
16#00#, 16#03#, 16#FC#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#3F#,
16#C0#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#01#,
16#FE#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#3F#, 16#E0#, 16#00#,
16#0F#, 16#F0#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#00#, 16#FF#, 16#00#,
16#00#, 16#3F#, 16#C0#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#07#, 16#F8#,
16#00#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#3F#,
16#E0#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#07#, 16#FE#, 16#00#, 16#0F#,
16#FF#, 16#80#, 16#07#, 16#FF#, 16#C0#, 16#01#, 16#FF#, 16#F0#, 16#00#,
16#7F#, 16#F8#, 16#00#, 16#1F#, 16#FC#, 16#00#, 16#07#, 16#FE#, 16#00#,
16#03#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#,
16#01#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#00#,
16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#00#,
16#00#, 16#1F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#,
16#00#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#,
16#00#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#03#,
16#FF#, 16#00#, 16#FF#, 16#00#, 16#3F#, 16#F0#, 16#07#, 16#F8#, 16#03#,
16#FF#, 16#00#, 16#3F#, 16#C0#, 16#3F#, 16#F0#, 16#03#, 16#FE#, 16#03#,
16#FF#, 16#00#, 16#1F#, 16#E0#, 16#3F#, 16#F0#, 16#00#, 16#FF#, 16#03#,
16#FF#, 16#00#, 16#07#, 16#F8#, 16#3F#, 16#F0#, 16#00#, 16#3F#, 16#C3#,
16#FE#, 16#00#, 16#03#, 16#FC#, 16#3F#, 16#E0#, 16#00#, 16#1F#, 16#E3#,
16#FE#, 16#00#, 16#00#, 16#FF#, 16#3F#, 16#E0#, 16#00#, 16#07#, 16#FB#,
16#FE#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#F0#, 16#00#, 16#03#, 16#FF#,
16#FF#, 16#80#, 16#00#, 16#1F#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#FF#,
16#FF#, 16#F0#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#7F#,
16#FF#, 16#FE#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#1F#,
16#FC#, 16#FF#, 16#80#, 16#00#, 16#FF#, 16#87#, 16#FE#, 16#00#, 16#0F#,
16#F8#, 16#3F#, 16#F0#, 16#00#, 16#7F#, 16#C0#, 16#FF#, 16#C0#, 16#03#,
16#FE#, 16#07#, 16#FE#, 16#00#, 16#1F#, 16#E0#, 16#3F#, 16#F0#, 16#01#,
16#FF#, 16#00#, 16#FF#, 16#C0#, 16#0F#, 16#F8#, 16#07#, 16#FE#, 16#00#,
16#7F#, 16#C0#, 16#3F#, 16#F8#, 16#03#, 16#FC#, 16#00#, 16#FF#, 16#C0#,
16#3F#, 16#E0#, 16#07#, 16#FE#, 16#01#, 16#FF#, 16#00#, 16#3F#, 16#F8#,
16#0F#, 16#F8#, 16#00#, 16#FF#, 16#C0#, 16#7F#, 16#80#, 16#07#, 16#FF#,
16#00#, 16#00#, 16#3F#, 16#C0#, 16#0F#, 16#F0#, 16#07#, 16#F8#, 16#01#,
16#FE#, 16#00#, 16#7F#, 16#80#, 16#1F#, 16#E0#, 16#0F#, 16#F8#, 16#03#,
16#FC#, 16#00#, 16#FF#, 16#00#, 16#3F#, 16#C0#, 16#0F#, 16#F0#, 16#07#,
16#FC#, 16#01#, 16#FE#, 16#00#, 16#7F#, 16#80#, 16#1F#, 16#E0#, 16#07#,
16#F8#, 16#03#, 16#FC#, 16#00#, 16#FF#, 16#00#, 16#3F#, 16#C0#, 16#0F#,
16#F0#, 16#07#, 16#FC#, 16#01#, 16#FE#, 16#00#, 16#7F#, 16#80#, 16#1F#,
16#E0#, 16#07#, 16#F8#, 16#03#, 16#FE#, 16#00#, 16#FF#, 16#00#, 16#3F#,
16#C0#, 16#0F#, 16#F0#, 16#03#, 16#FC#, 16#01#, 16#FE#, 16#00#, 16#7F#,
16#80#, 16#1F#, 16#E0#, 16#07#, 16#F8#, 16#03#, 16#FE#, 16#00#, 16#FF#,
16#00#, 16#3F#, 16#C0#, 16#0F#, 16#F0#, 16#03#, 16#FC#, 16#01#, 16#FF#,
16#00#, 16#7F#, 16#80#, 16#1F#, 16#E0#, 16#07#, 16#F8#, 16#01#, 16#FE#,
16#00#, 16#FF#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#03#,
16#F8#, 16#00#, 16#7F#, 16#00#, 16#07#, 16#FC#, 16#3F#, 16#F8#, 16#0F#,
16#FF#, 16#80#, 16#1F#, 16#E3#, 16#FF#, 16#F0#, 16#FF#, 16#FF#, 16#00#,
16#7F#, 16#9F#, 16#FF#, 16#C7#, 16#FF#, 16#FE#, 16#01#, 16#FE#, 16#FF#,
16#FF#, 16#BF#, 16#FF#, 16#F8#, 16#0F#, 16#FF#, 16#FF#, 16#FF#, 16#FF#,
16#FF#, 16#F0#, 16#3F#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#C0#,
16#FF#, 16#F0#, 16#FF#, 16#FF#, 16#0F#, 16#FF#, 16#03#, 16#FF#, 16#00#,
16#FF#, 16#F0#, 16#1F#, 16#FC#, 16#0F#, 16#F8#, 16#03#, 16#FF#, 16#80#,
16#3F#, 16#F0#, 16#7F#, 16#C0#, 16#0F#, 16#FC#, 16#00#, 16#FF#, 16#81#,
16#FF#, 16#00#, 16#3F#, 16#F0#, 16#03#, 16#FE#, 16#07#, 16#F8#, 16#00#,
16#FF#, 16#80#, 16#0F#, 16#F8#, 16#1F#, 16#E0#, 16#03#, 16#FE#, 16#00#,
16#3F#, 16#E0#, 16#FF#, 16#80#, 16#0F#, 16#F8#, 16#00#, 16#FF#, 16#03#,
16#FE#, 16#00#, 16#3F#, 16#C0#, 16#03#, 16#FC#, 16#0F#, 16#F8#, 16#00#,
16#FF#, 16#00#, 16#1F#, 16#F0#, 16#3F#, 16#C0#, 16#07#, 16#FC#, 16#00#,
16#7F#, 16#C0#, 16#FF#, 16#00#, 16#1F#, 16#F0#, 16#01#, 16#FE#, 16#07#,
16#FC#, 16#00#, 16#7F#, 16#C0#, 16#07#, 16#F8#, 16#1F#, 16#F0#, 16#01#,
16#FE#, 16#00#, 16#1F#, 16#E0#, 16#7F#, 16#80#, 16#07#, 16#F8#, 16#00#,
16#FF#, 16#81#, 16#FE#, 16#00#, 16#3F#, 16#E0#, 16#03#, 16#FE#, 16#0F#,
16#F8#, 16#00#, 16#FF#, 16#80#, 16#0F#, 16#F0#, 16#3F#, 16#E0#, 16#03#,
16#FC#, 16#00#, 16#3F#, 16#C0#, 16#FF#, 16#00#, 16#0F#, 16#F0#, 16#01#,
16#FF#, 16#03#, 16#FC#, 16#00#, 16#7F#, 16#C0#, 16#07#, 16#FC#, 16#1F#,
16#F0#, 16#01#, 16#FF#, 16#00#, 16#1F#, 16#E0#, 16#7F#, 16#C0#, 16#07#,
16#FC#, 16#00#, 16#7F#, 16#81#, 16#FF#, 16#00#, 16#1F#, 16#E0#, 16#03#,
16#FE#, 16#07#, 16#F8#, 16#00#, 16#7F#, 16#80#, 16#0F#, 16#F8#, 16#1F#,
16#E0#, 16#03#, 16#FE#, 16#00#, 16#3F#, 16#C0#, 16#FF#, 16#80#, 16#0F#,
16#F8#, 16#00#, 16#FF#, 16#03#, 16#FE#, 16#00#, 16#3F#, 16#C0#, 16#03#,
16#FC#, 16#0F#, 16#F0#, 16#00#, 16#FF#, 16#00#, 16#1F#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#0F#, 16#F0#, 16#FF#, 16#F0#,
16#01#, 16#FF#, 16#3F#, 16#FF#, 16#C0#, 16#1F#, 16#E7#, 16#FF#, 16#FC#,
16#01#, 16#FE#, 16#FF#, 16#FF#, 16#E0#, 16#1F#, 16#FF#, 16#FF#, 16#FF#,
16#03#, 16#FF#, 16#FF#, 16#FF#, 16#F0#, 16#3F#, 16#FE#, 16#0F#, 16#FF#,
16#03#, 16#FF#, 16#80#, 16#7F#, 16#F0#, 16#3F#, 16#F0#, 16#03#, 16#FF#,
16#03#, 16#FE#, 16#00#, 16#3F#, 16#E0#, 16#7F#, 16#C0#, 16#03#, 16#FE#,
16#07#, 16#FC#, 16#00#, 16#3F#, 16#E0#, 16#7F#, 16#C0#, 16#03#, 16#FE#,
16#07#, 16#F8#, 16#00#, 16#3F#, 16#E0#, 16#FF#, 16#80#, 16#03#, 16#FC#,
16#0F#, 16#F8#, 16#00#, 16#3F#, 16#C0#, 16#FF#, 16#80#, 16#07#, 16#FC#,
16#0F#, 16#F0#, 16#00#, 16#7F#, 16#C1#, 16#FF#, 16#00#, 16#07#, 16#F8#,
16#1F#, 16#F0#, 16#00#, 16#7F#, 16#81#, 16#FF#, 16#00#, 16#0F#, 16#F8#,
16#1F#, 16#E0#, 16#00#, 16#FF#, 16#81#, 16#FE#, 16#00#, 16#0F#, 16#F8#,
16#3F#, 16#E0#, 16#00#, 16#FF#, 16#03#, 16#FE#, 16#00#, 16#0F#, 16#F0#,
16#3F#, 16#C0#, 16#01#, 16#FF#, 16#03#, 16#FC#, 16#00#, 16#1F#, 16#F0#,
16#7F#, 16#C0#, 16#01#, 16#FE#, 16#07#, 16#FC#, 16#00#, 16#1F#, 16#E0#,
16#7F#, 16#C0#, 16#03#, 16#FE#, 16#07#, 16#F8#, 16#00#, 16#3F#, 16#E0#,
16#7F#, 16#80#, 16#03#, 16#FC#, 16#0F#, 16#F8#, 16#00#, 16#3F#, 16#C0#,
16#FF#, 16#80#, 16#03#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#C0#,
16#00#, 16#00#, 16#7F#, 16#FF#, 16#80#, 16#00#, 16#1F#, 16#FF#, 16#FE#,
16#00#, 16#03#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#FF#, 16#FF#, 16#FF#,
16#80#, 16#1F#, 16#FF#, 16#FF#, 16#FC#, 16#03#, 16#FF#, 16#FF#, 16#FF#,
16#E0#, 16#7F#, 16#F8#, 16#3F#, 16#FE#, 16#07#, 16#FF#, 16#00#, 16#FF#,
16#E0#, 16#FF#, 16#C0#, 16#07#, 16#FF#, 16#1F#, 16#FC#, 16#00#, 16#7F#,
16#F1#, 16#FF#, 16#80#, 16#03#, 16#FF#, 16#3F#, 16#F0#, 16#00#, 16#3F#,
16#F3#, 16#FF#, 16#00#, 16#03#, 16#FF#, 16#7F#, 16#E0#, 16#00#, 16#3F#,
16#F7#, 16#FE#, 16#00#, 16#03#, 16#FF#, 16#7F#, 16#E0#, 16#00#, 16#3F#,
16#F7#, 16#FC#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#7F#,
16#EF#, 16#FC#, 16#00#, 16#07#, 16#FE#, 16#FF#, 16#C0#, 16#00#, 16#7F#,
16#EF#, 16#FC#, 16#00#, 16#07#, 16#FE#, 16#FF#, 16#C0#, 16#00#, 16#FF#,
16#CF#, 16#FC#, 16#00#, 16#0F#, 16#FC#, 16#FF#, 16#C0#, 16#01#, 16#FF#,
16#8F#, 16#FE#, 16#00#, 16#1F#, 16#F8#, 16#FF#, 16#E0#, 16#03#, 16#FF#,
16#07#, 16#FF#, 16#00#, 16#7F#, 16#E0#, 16#7F#, 16#F8#, 16#1F#, 16#FE#,
16#07#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#3F#, 16#FF#, 16#FF#, 16#F8#,
16#01#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 16#C0#,
16#00#, 16#7F#, 16#FF#, 16#F8#, 16#00#, 16#01#, 16#FF#, 16#FE#, 16#00#,
16#00#, 16#03#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#,
16#00#, 16#00#, 16#3F#, 16#E1#, 16#FF#, 16#C0#, 16#00#, 16#3F#, 16#C7#,
16#FF#, 16#F0#, 16#00#, 16#3F#, 16#CF#, 16#FF#, 16#F8#, 16#00#, 16#3F#,
16#DF#, 16#FF#, 16#FC#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#FC#, 16#00#,
16#7F#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#7F#, 16#FC#, 16#1F#, 16#FE#,
16#00#, 16#7F#, 16#F0#, 16#0F#, 16#FE#, 16#00#, 16#7F#, 16#E0#, 16#07#,
16#FF#, 16#00#, 16#FF#, 16#C0#, 16#07#, 16#FF#, 16#00#, 16#FF#, 16#C0#,
16#03#, 16#FF#, 16#00#, 16#FF#, 16#80#, 16#03#, 16#FF#, 16#00#, 16#FF#,
16#00#, 16#03#, 16#FF#, 16#00#, 16#FF#, 16#00#, 16#03#, 16#FF#, 16#01#,
16#FF#, 16#00#, 16#03#, 16#FF#, 16#01#, 16#FE#, 16#00#, 16#03#, 16#FF#,
16#01#, 16#FE#, 16#00#, 16#03#, 16#FF#, 16#01#, 16#FE#, 16#00#, 16#03#,
16#FF#, 16#03#, 16#FE#, 16#00#, 16#07#, 16#FE#, 16#03#, 16#FC#, 16#00#,
16#07#, 16#FE#, 16#03#, 16#FC#, 16#00#, 16#07#, 16#FE#, 16#03#, 16#FC#,
16#00#, 16#07#, 16#FE#, 16#07#, 16#FC#, 16#00#, 16#0F#, 16#FC#, 16#07#,
16#FE#, 16#00#, 16#0F#, 16#FC#, 16#07#, 16#FE#, 16#00#, 16#1F#, 16#F8#,
16#07#, 16#FE#, 16#00#, 16#3F#, 16#F8#, 16#07#, 16#FF#, 16#00#, 16#7F#,
16#F0#, 16#0F#, 16#FF#, 16#00#, 16#FF#, 16#F0#, 16#0F#, 16#FF#, 16#C3#,
16#FF#, 16#E0#, 16#0F#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#0F#, 16#FF#,
16#FF#, 16#FF#, 16#80#, 16#1F#, 16#F7#, 16#FF#, 16#FF#, 16#00#, 16#1F#,
16#F7#, 16#FF#, 16#FE#, 16#00#, 16#1F#, 16#F3#, 16#FF#, 16#FC#, 16#00#,
16#1F#, 16#E1#, 16#FF#, 16#F0#, 16#00#, 16#1F#, 16#E0#, 16#7F#, 16#80#,
16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#7F#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#00#, 16#00#,
16#7F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#00#,
16#00#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#00#,
16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#,
16#FC#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#F8#, 16#7F#, 16#80#, 16#0F#,
16#FF#, 16#E7#, 16#FC#, 16#00#, 16#FF#, 16#FF#, 16#3F#, 16#E0#, 16#0F#,
16#FF#, 16#FD#, 16#FF#, 16#00#, 16#FF#, 16#FF#, 16#EF#, 16#F8#, 16#0F#,
16#FF#, 16#FF#, 16#FF#, 16#80#, 16#FF#, 16#F8#, 16#7F#, 16#FC#, 16#0F#,
16#FF#, 16#00#, 16#FF#, 16#E0#, 16#7F#, 16#F0#, 16#03#, 16#FF#, 16#07#,
16#FF#, 16#00#, 16#1F#, 16#F0#, 16#3F#, 16#F0#, 16#00#, 16#FF#, 16#83#,
16#FF#, 16#80#, 16#03#, 16#FC#, 16#1F#, 16#F8#, 16#00#, 16#1F#, 16#E0#,
16#FF#, 16#C0#, 16#00#, 16#FE#, 16#0F#, 16#FC#, 16#00#, 16#07#, 16#F0#,
16#7F#, 16#E0#, 16#00#, 16#3F#, 16#83#, 16#FF#, 16#00#, 16#01#, 16#FC#,
16#3F#, 16#F0#, 16#00#, 16#1F#, 16#E1#, 16#FF#, 16#80#, 16#00#, 16#FE#,
16#0F#, 16#FC#, 16#00#, 16#07#, 16#F0#, 16#7F#, 16#E0#, 16#00#, 16#3F#,
16#83#, 16#FF#, 16#00#, 16#03#, 16#FC#, 16#1F#, 16#F8#, 16#00#, 16#1F#,
16#C0#, 16#FF#, 16#C0#, 16#01#, 16#FE#, 16#07#, 16#FE#, 16#00#, 16#0F#,
16#F0#, 16#3F#, 16#F8#, 16#00#, 16#FF#, 16#81#, 16#FF#, 16#C0#, 16#0F#,
16#FC#, 16#07#, 16#FF#, 16#00#, 16#FF#, 16#C0#, 16#3F#, 16#FC#, 16#1F#,
16#FE#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 16#F0#, 16#07#, 16#FF#, 16#FF#,
16#FF#, 16#80#, 16#3F#, 16#FF#, 16#F7#, 16#F8#, 16#00#, 16#FF#, 16#FF#,
16#3F#, 16#C0#, 16#03#, 16#FF#, 16#F1#, 16#FE#, 16#00#, 16#0F#, 16#FF#,
16#0F#, 16#F0#, 16#00#, 16#1F#, 16#C0#, 16#FF#, 16#00#, 16#00#, 16#00#,
16#07#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#,
16#01#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#00#,
16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#00#,
16#00#, 16#1F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#,
16#00#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#01#, 16#E0#, 16#1F#, 16#E1#, 16#F8#, 16#07#, 16#FC#,
16#7F#, 16#00#, 16#FF#, 16#1F#, 16#E0#, 16#1F#, 16#E7#, 16#FC#, 16#03#,
16#FD#, 16#FF#, 16#80#, 16#FF#, 16#FF#, 16#E0#, 16#1F#, 16#FF#, 16#FC#,
16#03#, 16#FF#, 16#FF#, 16#80#, 16#7F#, 16#FC#, 16#00#, 16#0F#, 16#FE#,
16#00#, 16#03#, 16#FF#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#0F#,
16#F8#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#,
16#0F#, 16#F8#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#3F#, 16#C0#,
16#00#, 16#0F#, 16#F8#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#3F#,
16#E0#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#,
16#3F#, 16#E0#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#FF#, 16#00#,
16#00#, 16#1F#, 16#E0#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#FF#,
16#80#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#00#,
16#7F#, 16#80#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#03#, 16#FE#, 16#00#,
16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#00#, 16#0F#, 16#FF#,
16#F8#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#00#, 16#1F#, 16#FF#, 16#FF#,
16#C0#, 16#1F#, 16#FF#, 16#FF#, 16#F0#, 16#1F#, 16#FF#, 16#FF#, 16#F8#,
16#1F#, 16#FF#, 16#FF#, 16#FE#, 16#1F#, 16#FC#, 16#0F#, 16#FF#, 16#0F#,
16#FC#, 16#03#, 16#FF#, 16#8F#, 16#FC#, 16#00#, 16#FF#, 16#C7#, 16#FE#,
16#00#, 16#7F#, 16#E3#, 16#FF#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#C0#,
16#00#, 16#00#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#80#,
16#00#, 16#1F#, 16#FF#, 16#F8#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 16#80#,
16#03#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#FF#, 16#FF#, 16#FC#, 16#00#,
16#1F#, 16#FF#, 16#FF#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#C0#, 16#00#,
16#7F#, 16#FF#, 16#F0#, 16#00#, 16#03#, 16#FF#, 16#F8#, 16#00#, 16#00#,
16#3F#, 16#FC#, 16#00#, 16#00#, 16#07#, 16#FE#, 16#7F#, 16#80#, 16#03#,
16#FF#, 16#3F#, 16#E0#, 16#01#, 16#FF#, 16#1F#, 16#F0#, 16#01#, 16#FF#,
16#8F#, 16#FE#, 16#03#, 16#FF#, 16#C3#, 16#FF#, 16#FF#, 16#FF#, 16#C1#,
16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#7F#, 16#FF#, 16#FF#, 16#C0#, 16#1F#,
16#FF#, 16#FF#, 16#C0#, 16#07#, 16#FF#, 16#FF#, 16#C0#, 16#01#, 16#FF#,
16#FF#, 16#80#, 16#00#, 16#0F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#FF#,
16#80#, 16#0F#, 16#F8#, 16#00#, 16#FF#, 16#80#, 16#0F#, 16#F0#, 16#01#,
16#FF#, 16#00#, 16#1F#, 16#F0#, 16#01#, 16#FF#, 16#00#, 16#1F#, 16#E0#,
16#03#, 16#FE#, 16#03#, 16#FF#, 16#FF#, 16#7F#, 16#FF#, 16#F7#, 16#FF#,
16#FF#, 16#7F#, 16#FF#, 16#E7#, 16#FF#, 16#FE#, 16#7F#, 16#FF#, 16#E0#,
16#7F#, 16#C0#, 16#07#, 16#FC#, 16#00#, 16#7F#, 16#80#, 16#07#, 16#F8#,
16#00#, 16#FF#, 16#80#, 16#0F#, 16#F8#, 16#00#, 16#FF#, 16#00#, 16#0F#,
16#F0#, 16#01#, 16#FF#, 16#00#, 16#1F#, 16#F0#, 16#01#, 16#FF#, 16#00#,
16#1F#, 16#E0#, 16#01#, 16#FE#, 16#00#, 16#3F#, 16#E0#, 16#03#, 16#FE#,
16#00#, 16#3F#, 16#C0#, 16#03#, 16#FC#, 16#00#, 16#7F#, 16#C0#, 16#07#,
16#FC#, 16#00#, 16#7F#, 16#C0#, 16#07#, 16#FC#, 16#00#, 16#FF#, 16#FC#,
16#0F#, 16#FF#, 16#C0#, 16#FF#, 16#FC#, 16#0F#, 16#FF#, 16#C0#, 16#7F#,
16#FC#, 16#03#, 16#FF#, 16#80#, 16#0F#, 16#F0#, 16#00#, 16#03#, 16#FC#,
16#00#, 16#1F#, 16#E0#, 16#FF#, 16#80#, 16#07#, 16#FC#, 16#1F#, 16#F0#,
16#00#, 16#FF#, 16#83#, 16#FC#, 16#00#, 16#1F#, 16#F0#, 16#7F#, 16#80#,
16#03#, 16#FC#, 16#0F#, 16#F0#, 16#00#, 16#7F#, 16#83#, 16#FE#, 16#00#,
16#1F#, 16#F0#, 16#7F#, 16#C0#, 16#03#, 16#FE#, 16#0F#, 16#F0#, 16#00#,
16#7F#, 16#81#, 16#FE#, 16#00#, 16#0F#, 16#F0#, 16#7F#, 16#C0#, 16#03#,
16#FE#, 16#0F#, 16#F8#, 16#00#, 16#7F#, 16#C1#, 16#FE#, 16#00#, 16#0F#,
16#F0#, 16#3F#, 16#C0#, 16#01#, 16#FE#, 16#0F#, 16#F8#, 16#00#, 16#7F#,
16#C1#, 16#FF#, 16#00#, 16#0F#, 16#F8#, 16#3F#, 16#C0#, 16#01#, 16#FF#,
16#07#, 16#F8#, 16#00#, 16#3F#, 16#C0#, 16#FF#, 16#00#, 16#07#, 16#F8#,
16#3F#, 16#E0#, 16#01#, 16#FF#, 16#07#, 16#FC#, 16#00#, 16#3F#, 16#E0#,
16#FF#, 16#80#, 16#07#, 16#F8#, 16#1F#, 16#F0#, 16#01#, 16#FF#, 16#07#,
16#FE#, 16#00#, 16#3F#, 16#E0#, 16#FF#, 16#C0#, 16#0F#, 16#FC#, 16#1F#,
16#FC#, 16#01#, 16#FF#, 16#83#, 16#FF#, 16#80#, 16#7F#, 16#E0#, 16#7F#,
16#F8#, 16#3F#, 16#FC#, 16#0F#, 16#FF#, 16#FF#, 16#FF#, 16#81#, 16#FF#,
16#FF#, 16#FF#, 16#F0#, 16#1F#, 16#FF#, 16#FB#, 16#FC#, 16#03#, 16#FF#,
16#FF#, 16#7F#, 16#80#, 16#3F#, 16#FF#, 16#8F#, 16#F0#, 16#01#, 16#FF#,
16#E3#, 16#FE#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#FF#,
16#80#, 16#00#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#FF#, 16#BF#, 16#F0#,
16#00#, 16#7F#, 16#DF#, 16#F8#, 16#00#, 16#7F#, 16#CF#, 16#FC#, 16#00#,
16#3F#, 16#C7#, 16#FE#, 16#00#, 16#3F#, 16#E1#, 16#FF#, 16#00#, 16#1F#,
16#E0#, 16#FF#, 16#80#, 16#1F#, 16#F0#, 16#7F#, 16#C0#, 16#0F#, 16#F0#,
16#3F#, 16#E0#, 16#0F#, 16#F8#, 16#1F#, 16#F0#, 16#07#, 16#F8#, 16#0F#,
16#F8#, 16#07#, 16#F8#, 16#03#, 16#FE#, 16#03#, 16#FC#, 16#01#, 16#FF#,
16#03#, 16#FC#, 16#00#, 16#FF#, 16#81#, 16#FE#, 16#00#, 16#7F#, 16#C1#,
16#FE#, 16#00#, 16#3F#, 16#E0#, 16#FF#, 16#00#, 16#1F#, 16#F0#, 16#FF#,
16#00#, 16#0F#, 16#F8#, 16#7F#, 16#00#, 16#03#, 16#FC#, 16#7F#, 16#80#,
16#01#, 16#FE#, 16#3F#, 16#80#, 16#00#, 16#FF#, 16#3F#, 16#C0#, 16#00#,
16#7F#, 16#DF#, 16#C0#, 16#00#, 16#3F#, 16#FF#, 16#E0#, 16#00#, 16#1F#,
16#FF#, 16#E0#, 16#00#, 16#0F#, 16#FF#, 16#E0#, 16#00#, 16#03#, 16#FF#,
16#F0#, 16#00#, 16#01#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#FF#, 16#F8#,
16#00#, 16#00#, 16#7F#, 16#F8#, 16#00#, 16#00#, 16#3F#, 16#FC#, 16#00#,
16#00#, 16#1F#, 16#FC#, 16#00#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#,
16#03#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#C0#, 16#0F#, 16#F0#,
16#03#, 16#FF#, 16#FF#, 16#80#, 16#3F#, 16#E0#, 16#07#, 16#FF#, 16#FF#,
16#00#, 16#7F#, 16#C0#, 16#0F#, 16#F7#, 16#FE#, 16#01#, 16#FF#, 16#80#,
16#3F#, 16#EF#, 16#FC#, 16#03#, 16#FF#, 16#00#, 16#7F#, 16#9F#, 16#F8#,
16#07#, 16#FE#, 16#01#, 16#FF#, 16#3F#, 16#F0#, 16#1F#, 16#FC#, 16#03#,
16#FC#, 16#7F#, 16#E0#, 16#3F#, 16#F8#, 16#0F#, 16#F8#, 16#FF#, 16#C0#,
16#FF#, 16#F0#, 16#1F#, 16#E1#, 16#FF#, 16#81#, 16#FF#, 16#E0#, 16#7F#,
16#C3#, 16#FF#, 16#03#, 16#FF#, 16#C0#, 16#FF#, 16#03#, 16#FE#, 16#0F#,
16#FF#, 16#83#, 16#FE#, 16#07#, 16#FC#, 16#1F#, 16#FF#, 16#07#, 16#F8#,
16#0F#, 16#F8#, 16#7E#, 16#FE#, 16#0F#, 16#F0#, 16#1F#, 16#F0#, 16#FD#,
16#FC#, 16#3F#, 16#C0#, 16#3F#, 16#E1#, 16#F3#, 16#F8#, 16#7F#, 16#80#,
16#7F#, 16#C7#, 16#E3#, 16#F1#, 16#FE#, 16#00#, 16#FF#, 16#8F#, 16#C7#,
16#E3#, 16#FC#, 16#01#, 16#FF#, 16#BF#, 16#0F#, 16#CF#, 16#F0#, 16#03#,
16#FF#, 16#7E#, 16#1F#, 16#9F#, 16#E0#, 16#07#, 16#FE#, 16#F8#, 16#3F#,
16#7F#, 16#80#, 16#0F#, 16#FF#, 16#F0#, 16#7E#, 16#FF#, 16#00#, 16#0F#,
16#FF#, 16#E0#, 16#FD#, 16#FC#, 16#00#, 16#1F#, 16#FF#, 16#81#, 16#FF#,
16#F8#, 16#00#, 16#3F#, 16#FF#, 16#03#, 16#FF#, 16#E0#, 16#00#, 16#7F#,
16#FC#, 16#07#, 16#FF#, 16#C0#, 16#00#, 16#FF#, 16#F8#, 16#0F#, 16#FF#,
16#00#, 16#01#, 16#FF#, 16#E0#, 16#1F#, 16#FE#, 16#00#, 16#03#, 16#FF#,
16#C0#, 16#3F#, 16#F8#, 16#00#, 16#07#, 16#FF#, 16#80#, 16#7F#, 16#F0#,
16#00#, 16#0F#, 16#FE#, 16#00#, 16#FF#, 16#E0#, 16#00#, 16#1F#, 16#FC#,
16#01#, 16#FF#, 16#80#, 16#00#, 16#3F#, 16#F0#, 16#03#, 16#FF#, 16#00#,
16#00#, 16#3F#, 16#E0#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#FF#,
16#C0#, 16#07#, 16#FE#, 16#00#, 16#FF#, 16#E0#, 16#0F#, 16#FC#, 16#00#,
16#7F#, 16#E0#, 16#1F#, 16#FC#, 16#00#, 16#7F#, 16#E0#, 16#1F#, 16#F8#,
16#00#, 16#7F#, 16#F0#, 16#3F#, 16#F0#, 16#00#, 16#3F#, 16#F0#, 16#7F#,
16#E0#, 16#00#, 16#3F#, 16#F0#, 16#FF#, 16#C0#, 16#00#, 16#1F#, 16#F8#,
16#FF#, 16#80#, 16#00#, 16#1F#, 16#F9#, 16#FF#, 16#00#, 16#00#, 16#0F#,
16#FB#, 16#FE#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#FC#, 16#00#, 16#00#,
16#0F#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#F8#, 16#00#,
16#00#, 16#07#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#E0#,
16#00#, 16#00#, 16#03#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#FF#,
16#80#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#07#,
16#FF#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#C0#, 16#00#, 16#00#,
16#1F#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#E0#, 16#00#,
16#00#, 16#3F#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#F0#,
16#00#, 16#00#, 16#FF#, 16#DF#, 16#F0#, 16#00#, 16#01#, 16#FF#, 16#9F#,
16#F8#, 16#00#, 16#03#, 16#FF#, 16#1F#, 16#F8#, 16#00#, 16#03#, 16#FE#,
16#0F#, 16#FC#, 16#00#, 16#07#, 16#FE#, 16#0F#, 16#FC#, 16#00#, 16#0F#,
16#FC#, 16#0F#, 16#FE#, 16#00#, 16#1F#, 16#F8#, 16#07#, 16#FE#, 16#00#,
16#3F#, 16#F0#, 16#07#, 16#FF#, 16#00#, 16#7F#, 16#F0#, 16#03#, 16#FF#,
16#00#, 16#FF#, 16#E0#, 16#03#, 16#FF#, 16#80#, 16#03#, 16#FF#, 16#00#,
16#03#, 16#FE#, 16#07#, 16#FE#, 16#00#, 16#07#, 16#F8#, 16#0F#, 16#FC#,
16#00#, 16#1F#, 16#F0#, 16#1F#, 16#F8#, 16#00#, 16#3F#, 16#C0#, 16#3F#,
16#F0#, 16#00#, 16#FF#, 16#80#, 16#3F#, 16#E0#, 16#01#, 16#FE#, 16#00#,
16#7F#, 16#C0#, 16#07#, 16#F8#, 16#00#, 16#FF#, 16#80#, 16#0F#, 16#F0#,
16#01#, 16#FF#, 16#00#, 16#3F#, 16#C0#, 16#03#, 16#FF#, 16#00#, 16#7F#,
16#80#, 16#07#, 16#FE#, 16#01#, 16#FE#, 16#00#, 16#0F#, 16#FC#, 16#03#,
16#FC#, 16#00#, 16#0F#, 16#F8#, 16#0F#, 16#F0#, 16#00#, 16#1F#, 16#F0#,
16#1F#, 16#C0#, 16#00#, 16#3F#, 16#E0#, 16#7F#, 16#80#, 16#00#, 16#7F#,
16#C0#, 16#FE#, 16#00#, 16#00#, 16#FF#, 16#83#, 16#FC#, 16#00#, 16#01#,
16#FF#, 16#07#, 16#F0#, 16#00#, 16#03#, 16#FE#, 16#1F#, 16#E0#, 16#00#,
16#03#, 16#FE#, 16#7F#, 16#80#, 16#00#, 16#07#, 16#FC#, 16#FE#, 16#00#,
16#00#, 16#0F#, 16#FB#, 16#FC#, 16#00#, 16#00#, 16#1F#, 16#F7#, 16#F0#,
16#00#, 16#00#, 16#3F#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#7F#, 16#FF#,
16#80#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#FF#,
16#FC#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#03#,
16#FF#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#80#, 16#00#, 16#00#,
16#0F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FC#, 16#00#, 16#00#,
16#00#, 16#3F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#00#,
16#00#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F8#,
16#00#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#3F#,
16#80#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#7F#,
16#FE#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#03#,
16#FF#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#C0#, 16#00#, 16#00#,
16#0F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#F8#, 16#00#, 16#00#,
16#00#, 16#7F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#,
16#FF#, 16#E0#, 16#1F#, 16#FF#, 16#FF#, 16#FC#, 16#03#, 16#FF#, 16#FF#,
16#FF#, 16#80#, 16#7F#, 16#FF#, 16#FF#, 16#E0#, 16#0F#, 16#FF#, 16#FF#,
16#FC#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#7F#, 16#FF#, 16#FF#,
16#F0#, 16#00#, 16#00#, 16#1F#, 16#FC#, 16#00#, 16#00#, 16#07#, 16#FF#,
16#00#, 16#00#, 16#01#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#7F#, 16#F0#,
16#00#, 16#00#, 16#1F#, 16#FC#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#00#,
16#00#, 16#01#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#7F#, 16#F0#, 16#00#,
16#00#, 16#1F#, 16#FC#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#00#, 16#00#,
16#01#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#7F#, 16#F0#, 16#00#, 16#00#,
16#1F#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#FE#, 16#00#, 16#00#, 16#01#,
16#FF#, 16#80#, 16#00#, 16#00#, 16#7F#, 16#E0#, 16#00#, 16#00#, 16#1F#,
16#F8#, 16#00#, 16#00#, 16#0F#, 16#FE#, 16#00#, 16#00#, 16#03#, 16#FF#,
16#80#, 16#00#, 16#00#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#1F#, 16#FF#,
16#FF#, 16#FE#, 16#03#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#FF#, 16#FF#,
16#FF#, 16#F8#, 16#1F#, 16#FF#, 16#FF#, 16#FE#, 16#03#, 16#FF#, 16#FF#,
16#FF#, 16#C0#, 16#7F#, 16#FF#, 16#FF#, 16#F8#, 16#1F#, 16#FF#, 16#FF#,
16#FF#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#03#, 16#FF#, 16#00#,
16#07#, 16#FF#, 16#00#, 16#0F#, 16#FE#, 16#00#, 16#0F#, 16#FE#, 16#00#,
16#1F#, 16#FE#, 16#00#, 16#1F#, 16#FE#, 16#00#, 16#3F#, 16#C0#, 16#00#,
16#3F#, 16#80#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#3F#, 16#80#, 16#00#,
16#3F#, 16#80#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#00#,
16#7F#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#,
16#FE#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#01#,
16#FC#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#01#,
16#FC#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#7F#,
16#F8#, 16#00#, 16#7F#, 16#F0#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#FF#,
16#80#, 16#00#, 16#FF#, 16#C0#, 16#00#, 16#FF#, 16#E0#, 16#00#, 16#1F#,
16#E0#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#0F#,
16#E0#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#0F#,
16#E0#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#1F#,
16#C0#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#3F#,
16#80#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#3F#,
16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#7F#,
16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#7F#, 16#F8#, 16#00#, 16#7F#,
16#F0#, 16#00#, 16#7F#, 16#F0#, 16#00#, 16#3F#, 16#F0#, 16#00#, 16#3F#,
16#F0#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#00#,
16#07#, 16#80#, 16#07#, 16#C0#, 16#03#, 16#C0#, 16#01#, 16#E0#, 16#00#,
16#F0#, 16#00#, 16#78#, 16#00#, 16#7C#, 16#00#, 16#3C#, 16#00#, 16#1E#,
16#00#, 16#0F#, 16#00#, 16#0F#, 16#80#, 16#07#, 16#80#, 16#03#, 16#C0#,
16#01#, 16#E0#, 16#00#, 16#F0#, 16#00#, 16#F0#, 16#00#, 16#78#, 16#00#,
16#3C#, 16#00#, 16#1E#, 16#00#, 16#1F#, 16#00#, 16#0F#, 16#00#, 16#07#,
16#80#, 16#03#, 16#C0#, 16#03#, 16#E0#, 16#01#, 16#E0#, 16#00#, 16#F0#,
16#00#, 16#78#, 16#00#, 16#3C#, 16#00#, 16#3E#, 16#00#, 16#1E#, 16#00#,
16#0F#, 16#00#, 16#07#, 16#80#, 16#07#, 16#C0#, 16#03#, 16#C0#, 16#01#,
16#E0#, 16#00#, 16#F0#, 16#00#, 16#F8#, 16#00#, 16#78#, 16#00#, 16#3C#,
16#00#, 16#1E#, 16#00#, 16#0F#, 16#00#, 16#0F#, 16#80#, 16#07#, 16#80#,
16#03#, 16#C0#, 16#01#, 16#E0#, 16#01#, 16#F0#, 16#00#, 16#F0#, 16#00#,
16#78#, 16#00#, 16#3C#, 16#00#, 16#1E#, 16#00#, 16#1E#, 16#00#, 16#0F#,
16#00#, 16#07#, 16#80#, 16#03#, 16#C0#, 16#03#, 16#E0#, 16#01#, 16#E0#,
16#00#, 16#F0#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#07#, 16#F0#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#0F#, 16#FC#, 16#00#,
16#0F#, 16#FC#, 16#00#, 16#0F#, 16#FE#, 16#00#, 16#0F#, 16#FE#, 16#00#,
16#1F#, 16#FE#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#FE#, 16#00#,
16#00#, 16#FE#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#FC#, 16#00#,
16#01#, 16#FC#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#01#, 16#FC#, 16#00#,
16#03#, 16#F8#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#03#, 16#F8#, 16#00#,
16#03#, 16#F8#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#07#, 16#F0#, 16#00#,
16#07#, 16#F0#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#07#, 16#F0#, 16#00#,
16#07#, 16#F0#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#07#, 16#F8#, 16#00#,
16#07#, 16#FF#, 16#00#, 16#03#, 16#FF#, 16#00#, 16#01#, 16#FF#, 16#00#,
16#01#, 16#FE#, 16#00#, 16#0F#, 16#FE#, 16#00#, 16#1F#, 16#FE#, 16#00#,
16#1F#, 16#E0#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#3F#, 16#80#, 16#00#,
16#3F#, 16#80#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#3F#, 16#80#, 16#00#,
16#7F#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#00#,
16#7F#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#,
16#FE#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#01#,
16#FC#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#03#,
16#FC#, 16#00#, 16#7F#, 16#F8#, 16#00#, 16#7F#, 16#F8#, 16#00#, 16#7F#,
16#F0#, 16#00#, 16#7F#, 16#F0#, 16#00#, 16#FF#, 16#E0#, 16#00#, 16#FF#,
16#C0#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#,
16#0F#, 16#FC#, 16#00#, 16#00#, 16#3F#, 16#FC#, 16#00#, 16#F0#, 16#FF#,
16#FC#, 16#03#, 16#E3#, 16#FF#, 16#FC#, 16#07#, 16#CF#, 16#C3#, 16#FE#,
16#1F#, 16#1F#, 16#03#, 16#FF#, 16#FE#, 16#3E#, 16#01#, 16#FF#, 16#F8#,
16#F8#, 16#01#, 16#FF#, 16#E0#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#00#,
16#00#, 16#FC#, 16#00#);
FreeSansBoldOblique32pt7bGlyphs : aliased constant Glyph_Array := (
(0, 0, 0, 18, 0, 1), -- 0x20 ' '
(0, 19, 46, 21, 7, -45), -- 0x21 '!'
(110, 25, 16, 30, 11, -45), -- 0x22 '"'
(160, 40, 45, 35, 2, -43), -- 0x23 '#'
(385, 37, 56, 35, 2, -47), -- 0x24 '$'
(644, 49, 46, 56, 8, -44), -- 0x25 '%'
(926, 40, 47, 45, 6, -45), -- 0x26 '&'
(1161, 10, 16, 15, 11, -45), -- 0x27 '''
(1181, 23, 59, 21, 5, -45), -- 0x28 '('
(1351, 23, 59, 21, 0, -45), -- 0x29 ')'
(1521, 21, 20, 25, 9, -45), -- 0x2A '*'
(1574, 32, 30, 37, 6, -28), -- 0x2B '+'
(1694, 13, 21, 18, 2, -9), -- 0x2C ','
(1729, 19, 8, 21, 4, -20), -- 0x2D '-'
(1748, 11, 9, 18, 4, -8), -- 0x2E '.'
(1761, 27, 46, 18, 0, -44), -- 0x2F '/'
(1917, 35, 47, 35, 5, -45), -- 0x30 '0'
(2123, 22, 45, 35, 11, -44), -- 0x31 '1'
(2247, 39, 46, 35, 2, -45), -- 0x32 '2'
(2472, 36, 47, 35, 4, -45), -- 0x33 '3'
(2684, 34, 44, 35, 4, -43), -- 0x34 '4'
(2871, 37, 46, 35, 4, -44), -- 0x35 '5'
(3084, 34, 47, 35, 5, -45), -- 0x36 '6'
(3284, 35, 45, 35, 8, -44), -- 0x37 '7'
(3481, 36, 47, 35, 4, -45), -- 0x38 '8'
(3693, 34, 47, 35, 5, -45), -- 0x39 '9'
(3893, 16, 33, 21, 7, -32), -- 0x3A ':'
(3959, 18, 44, 21, 5, -32), -- 0x3B ';'
(4058, 35, 30, 37, 5, -28), -- 0x3C '<'
(4190, 35, 23, 37, 4, -25), -- 0x3D '='
(4291, 35, 30, 37, 2, -29), -- 0x3E '>'
(4423, 33, 47, 39, 10, -46), -- 0x3F '?'
(4617, 60, 55, 61, 5, -45), -- 0x40 '@'
(5030, 44, 46, 45, 1, -45), -- 0x41 'A'
(5283, 44, 46, 45, 5, -45), -- 0x42 'B'
(5536, 44, 48, 45, 7, -46), -- 0x43 'C'
(5800, 45, 46, 45, 5, -45), -- 0x44 'D'
(6059, 43, 46, 42, 5, -45), -- 0x45 'E'
(6307, 42, 46, 38, 5, -45), -- 0x46 'F'
(6549, 44, 48, 49, 7, -46), -- 0x47 'G'
(6813, 47, 46, 45, 4, -45), -- 0x48 'H'
(7084, 19, 46, 18, 4, -45), -- 0x49 'I'
(7194, 36, 47, 35, 4, -45), -- 0x4A 'J'
(7406, 48, 46, 45, 5, -45), -- 0x4B 'K'
(7682, 33, 46, 38, 5, -45), -- 0x4C 'L'
(7872, 55, 46, 52, 4, -45), -- 0x4D 'M'
(8189, 47, 46, 45, 4, -45), -- 0x4E 'N'
(8460, 46, 48, 49, 7, -46), -- 0x4F 'O'
(8736, 43, 46, 42, 5, -45), -- 0x50 'P'
(8984, 46, 50, 49, 7, -46), -- 0x51 'Q'
(9272, 45, 46, 45, 5, -45), -- 0x52 'R'
(9531, 41, 48, 42, 5, -46), -- 0x53 'S'
(9777, 38, 46, 38, 9, -45), -- 0x54 'T'
(9996, 43, 47, 45, 8, -45), -- 0x55 'U'
(10249, 40, 46, 42, 11, -45), -- 0x56 'V'
(10479, 57, 46, 59, 11, -45), -- 0x57 'W'
(10807, 50, 46, 42, 1, -45), -- 0x58 'X'
(11095, 40, 46, 42, 11, -45), -- 0x59 'Y'
(11325, 44, 46, 38, 2, -45), -- 0x5A 'Z'
(11578, 28, 59, 21, 1, -45), -- 0x5B '['
(11785, 10, 55, 18, 9, -53), -- 0x5C '\'
(11854, 28, 59, 21, -1, -45), -- 0x5D ']'
(12061, 29, 27, 37, 8, -43), -- 0x5E '^'
(12159, 39, 5, 35, -4, 9), -- 0x5F '_'
(12184, 10, 9, 21, 11, -46), -- 0x60 '`'
(12196, 34, 36, 35, 3, -34), -- 0x61 'a'
(12349, 37, 47, 39, 4, -45), -- 0x62 'b'
(12567, 34, 36, 35, 5, -34), -- 0x63 'c'
(12720, 39, 47, 38, 5, -45), -- 0x64 'd'
(12950, 34, 36, 35, 4, -34), -- 0x65 'e'
(13103, 23, 46, 21, 6, -45), -- 0x66 'f'
(13236, 39, 49, 38, 2, -34), -- 0x67 'g'
(13475, 36, 46, 39, 4, -45), -- 0x68 'h'
(13682, 18, 46, 18, 4, -45), -- 0x69 'i'
(13786, 26, 60, 18, -3, -45), -- 0x6A 'j'
(13981, 37, 46, 35, 4, -45), -- 0x6B 'k'
(14194, 18, 46, 18, 4, -45), -- 0x6C 'l'
(14298, 54, 35, 56, 4, -34), -- 0x6D 'm'
(14535, 36, 35, 39, 4, -34), -- 0x6E 'n'
(14693, 36, 36, 38, 5, -34), -- 0x6F 'o'
(14855, 40, 49, 39, 1, -34), -- 0x70 'p'
(15100, 37, 49, 38, 5, -34), -- 0x71 'q'
(15327, 27, 35, 24, 4, -34), -- 0x72 'r'
(15446, 33, 36, 35, 5, -34), -- 0x73 's'
(15595, 20, 43, 21, 6, -41), -- 0x74 't'
(15703, 35, 35, 38, 6, -33), -- 0x75 'u'
(15857, 33, 34, 35, 8, -33), -- 0x76 'v'
(15998, 47, 34, 49, 8, -33), -- 0x77 'w'
(16198, 40, 34, 35, 1, -33), -- 0x78 'x'
(16368, 39, 48, 35, 2, -33), -- 0x79 'y'
(16602, 35, 34, 31, 1, -33), -- 0x7A 'z'
(16751, 24, 59, 24, 6, -45), -- 0x7B '{'
(16928, 17, 59, 18, 4, -45), -- 0x7C '|'
(17054, 24, 59, 25, 2, -45), -- 0x7D '}'
(17231, 31, 11, 37, 6, -19)); -- 0x7E '~'
Font_D : aliased constant Bitmap_Font :=
(FreeSansBoldOblique32pt7bBitmaps'Access,
FreeSansBoldOblique32pt7bGlyphs'Access,
75);
Font : constant Giza.Font.Ref_Const := Font_D'Access;
end Giza.Bitmap_Fonts.FreeSansBoldOblique32pt7b;
| 72.254062 | 73 | 0.485165 |
5745cab9666a3c8b6074e313a2a4d84904725af8 | 1,112 | ads | Ada | tests/events-test_data-tests-events_container-test_data.ads | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 80 | 2017-04-08T23:14:07.000Z | 2022-02-10T22:30:51.000Z | tests/events-test_data-tests-events_container-test_data.ads | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 89 | 2017-06-24T08:18:26.000Z | 2021-11-12T04:37:36.000Z | tests/events-test_data-tests-events_container-test_data.ads | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 9 | 2018-04-14T16:37:25.000Z | 2020-03-21T14:33:49.000Z | -- This package is intended to set up and tear down the test environment.
-- Once created by GNATtest, this package will never be overwritten
-- automatically. Contents of this package can be modified in any way
-- except for sections surrounded by a 'read only' marker.
with Ada.Containers.Vectors.Test_Data;
with Ada.Containers.Vectors.Test_Data.Tests;
package Events.Test_Data.Tests.Events_Container.Test_Data is
-- begin read only
type Test is new AUnit.Test_Fixtures.Test_Fixture
-- end read only
with null record;
procedure Set_Up(Gnattest_T: in out Test);
procedure Tear_Down(Gnattest_T: in out Test);
-- begin read only
package Gnattest_Data_Inst is new GNATtest_Generated.GNATtest_Standard
.Events
.Events_Container
.Test_Data
(Test);
package Gnattest_Tests_Inst is new Gnattest_Data_Inst.Tests;
type New_Test is new Gnattest_Tests_Inst.Test with null record;
-- end read only
procedure User_Set_Up(Gnattest_T: in out New_Test);
procedure User_Tear_Down(Gnattest_T: in out New_Test);
end Events.Test_Data.Tests.Events_Container.Test_Data;
| 32.705882 | 75 | 0.769784 |
297ea0c58e07245a7b6bda53206838b8ce7ec28d | 207 | ads | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/lto15.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/lto15.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/lto15.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | package Lto15 is
type Arr is array (Positive range <>) of Integer;
type R(Size : Positive) is record
Data : Arr (1 .. Size);
end record;
function Proc (Data : Arr) return R;
end Lto15;
| 17.25 | 52 | 0.628019 |
571388ac294209e63c83b944db03bfa9c5706970 | 8,972 | adb | Ada | llvm-gcc-4.2-2.9/gcc/ada/g-arrspl.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | 1 | 2016-04-09T02:58:13.000Z | 2016-04-09T02:58:13.000Z | llvm-gcc-4.2-2.9/gcc/ada/g-arrspl.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/g-arrspl.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T . A R R A Y _ S P L I T --
-- --
-- B o d y --
-- --
-- Copyright (C) 2002-2005, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Ada.Unchecked_Deallocation;
package body GNAT.Array_Split is
procedure Free is
new Ada.Unchecked_Deallocation (Slices_Indexes, Slices_Access);
procedure Free is
new Ada.Unchecked_Deallocation (Separators_Indexes, Indexes_Access);
function Count
(Source : Element_Sequence;
Pattern : Element_Set) return Natural;
-- Returns the number of occurences of Pattern elements in Source, 0 is
-- returned if no occurence is found in Source.
------------
-- Adjust --
------------
procedure Adjust (S : in out Slice_Set) is
begin
S.Ref_Counter.all := S.Ref_Counter.all + 1;
end Adjust;
------------
-- Create --
------------
procedure Create
(S : out Slice_Set;
From : Element_Sequence;
Separators : Element_Sequence;
Mode : Separator_Mode := Single)
is
begin
Create (S, From, To_Set (Separators), Mode);
end Create;
------------
-- Create --
------------
procedure Create
(S : out Slice_Set;
From : Element_Sequence;
Separators : Element_Set;
Mode : Separator_Mode := Single)
is
begin
S.Source := new Element_Sequence'(From);
Set (S, Separators, Mode);
end Create;
-----------
-- Count --
-----------
function Count
(Source : Element_Sequence;
Pattern : Element_Set) return Natural
is
C : Natural := 0;
begin
for K in Source'Range loop
if Is_In (Source (K), Pattern) then
C := C + 1;
end if;
end loop;
return C;
end Count;
--------------
-- Finalize --
--------------
procedure Finalize (S : in out Slice_Set) is
procedure Free is
new Ada.Unchecked_Deallocation (Element_Sequence, Element_Access);
procedure Free is
new Ada.Unchecked_Deallocation (Natural, Counter);
begin
S.Ref_Counter.all := S.Ref_Counter.all - 1;
if S.Ref_Counter.all = 0 then
Free (S.Source);
Free (S.Indexes);
Free (S.Slices);
Free (S.Ref_Counter);
end if;
end Finalize;
----------------
-- Initialize --
----------------
procedure Initialize (S : in out Slice_Set) is
begin
S.Ref_Counter := new Natural'(1);
end Initialize;
----------------
-- Separators --
----------------
function Separators
(S : Slice_Set;
Index : Slice_Number) return Slice_Separators
is
begin
if Index > S.N_Slice then
raise Index_Error;
elsif Index = 0
or else (Index = 1 and then S.N_Slice = 1)
then
-- Whole string, or no separator used
return (Before => Array_End,
After => Array_End);
elsif Index = 1 then
return (Before => Array_End,
After => S.Source (S.Slices (Index).Stop + 1));
elsif Index = S.N_Slice then
return (Before => S.Source (S.Slices (Index).Start - 1),
After => Array_End);
else
return (Before => S.Source (S.Slices (Index).Start - 1),
After => S.Source (S.Slices (Index).Stop + 1));
end if;
end Separators;
----------------
-- Separators --
----------------
function Separators (S : Slice_Set) return Separators_Indexes is
begin
return S.Indexes.all;
end Separators;
---------
-- Set --
---------
procedure Set
(S : in out Slice_Set;
Separators : Element_Sequence;
Mode : Separator_Mode := Single)
is
begin
Set (S, To_Set (Separators), Mode);
end Set;
---------
-- Set --
---------
procedure Set
(S : in out Slice_Set;
Separators : Element_Set;
Mode : Separator_Mode := Single)
is
Count_Sep : constant Natural := Count (S.Source.all, Separators);
J : Positive;
begin
-- Free old structure
Free (S.Indexes);
Free (S.Slices);
-- Compute all separator's indexes
S.Indexes := new Separators_Indexes (1 .. Count_Sep);
J := S.Indexes'First;
for K in S.Source'Range loop
if Is_In (S.Source (K), Separators) then
S.Indexes (J) := K;
J := J + 1;
end if;
end loop;
-- Compute slice info for fast slice access
declare
S_Info : Slices_Indexes (1 .. Slice_Number (Count_Sep) + 1);
K : Natural := 1;
Start, Stop : Natural;
begin
S.N_Slice := 0;
Start := S.Source'First;
Stop := 0;
loop
if K > Count_Sep then
-- No more separators, last slice ends at the end of the source
-- string.
Stop := S.Source'Last;
else
Stop := S.Indexes (K) - 1;
end if;
-- Add slice to the table
S.N_Slice := S.N_Slice + 1;
S_Info (S.N_Slice) := (Start, Stop);
exit when K > Count_Sep;
case Mode is
when Single =>
-- In this mode just set start to character next to the
-- current separator, advance the separator index.
Start := S.Indexes (K) + 1;
K := K + 1;
when Multiple =>
-- In this mode skip separators following each other
loop
Start := S.Indexes (K) + 1;
K := K + 1;
exit when K > Count_Sep
or else S.Indexes (K) > S.Indexes (K - 1) + 1;
end loop;
end case;
end loop;
S.Slices := new Slices_Indexes'(S_Info (1 .. S.N_Slice));
end;
end Set;
-----------
-- Slice --
-----------
function Slice
(S : Slice_Set;
Index : Slice_Number) return Element_Sequence
is
begin
if Index = 0 then
return S.Source.all;
elsif Index > S.N_Slice then
raise Index_Error;
else
return S.Source (S.Slices (Index).Start .. S.Slices (Index).Stop);
end if;
end Slice;
-----------------
-- Slice_Count --
-----------------
function Slice_Count (S : Slice_Set) return Slice_Number is
begin
return S.N_Slice;
end Slice_Count;
end GNAT.Array_Split;
| 28.75641 | 79 | 0.478712 |
5768ce0f55601f93613c6dd42f8c8c5c14503b99 | 5,239 | ads | Ada | src/gstreamer-rtsp-message.ads | persan/A-gst | 7a39693d105617adea52680424c862a1a08f7368 | [
"Apache-2.0"
] | 1 | 2018-01-18T00:51:00.000Z | 2018-01-18T00:51:00.000Z | src/gstreamer-rtsp-message.ads | persan/A-gst | 7a39693d105617adea52680424c862a1a08f7368 | [
"Apache-2.0"
] | null | null | null | src/gstreamer-rtsp-message.ads | persan/A-gst | 7a39693d105617adea52680424c862a1a08f7368 | [
"Apache-2.0"
] | null | null | null | pragma Ada_2005;
with glib.String;
with System;
with GLIB; -- with GStreamer.GST_Low_Level.glibconfig_h;
-- limited with GStreamer.GST_Low_Level.glib_2_0_glib_garray_h;
-- limited with GStreamer.GST_Low_Level.glib_2_0_glib_gstring_h;
private with Ada.Finalization;
private with GStreamer.GST_Low_Level.gstreamer_0_10_gst_rtsp_gstrtspmessage_h;
package GStreamer.rtsp.message is
--*
-- * GstRTSPMsgType:
-- * @INVALID: invalid message type
-- * @REQUEST: RTSP request message
-- * @RESPONSE: RTSP response message
-- * @HTTP_REQUEST: HTTP request message. Since 0.10.25
-- * @HTTP_RESPONSE: HTTP response message. Since 0.10.25
-- * @DATA: data message
-- *
-- * The type of a message.
--
type GstRTSPMsgType is
(INVALID,
REQUEST,
RESPONSE,
HTTP_REQUEST,
HTTP_RESPONSE,
DATA);
pragma Convention (C, GstRTSPMsgType); -- gst/rtsp/gstrtspmessage.h:71
--*
-- * GstRTSPMessage:
-- * @type: the message type
-- *
-- * An RTSP message containing request, response or data messages. Depending on
-- * the @type, the appropriate structure may be accessed.
--
type GstRTSPMessage_Record (<>) is tagged private;
type GstRTSPMessage is access all GstRTSPMessage_Record'Class;
--< private >
-- memory management
function Get_Type (Msg : access GstRTSPMessage_Record) return GstRTSPMsgType; -- gst/rtsp/gstrtspmessage.h:115
-- request
procedure new_request
(msg : System.Address;
method : GstRTSPMethod;
uri : access GLIB.gchar); -- gst/rtsp/gstrtspmessage.h:118
procedure init_request
(msg : access GstRTSPMessage;
method : GstRTSPMethod;
uri : access GLIB.gchar); -- gst/rtsp/gstrtspmessage.h:121
procedure parse_request
(msg : access GstRTSPMessage;
method : access GstRTSPMethod;
uri : System.Address;
version : access GstRTSPVersion); -- gst/rtsp/gstrtspmessage.h:124
-- response
procedure new_response
(msg : System.Address;
code : GstRTSPStatusCode;
reason : access GLIB.gchar;
request : access constant GstRTSPMessage); -- gst/rtsp/gstrtspmessage.h:130
procedure init_response
(msg : access GstRTSPMessage_Record;
code : GstRTSPStatusCode;
reason : access GLIB.gchar;
request : access constant GstRTSPMessage); -- gst/rtsp/gstrtspmessage.h:134
procedure parse_response
(msg : access GstRTSPMessage_Record;
code : access GstRTSPStatusCode;
reason : System.Address;
version : access GstRTSPVersion); -- gst/rtsp/gstrtspmessage.h:138
-- data
procedure new_data (msg : System.Address; channel : GLIB.guint8); -- gst/rtsp/gstrtspmessage.h:144
procedure init_data (msg : access GstRTSPMessage_Record; channel : GLIB.guint8); -- gst/rtsp/gstrtspmessage.h:146
procedure parse_data (msg : access GstRTSPMessage_Record; channel : access GLIB.guint8); -- gst/rtsp/gstrtspmessage.h:148
-- headers
procedure add_header
(msg : access GstRTSPMessage_Record;
field : GstRTSPHeaderField;
value : access GLIB.gchar); -- gst/rtsp/gstrtspmessage.h:152
procedure take_header
(msg : access GstRTSPMessage_Record;
field : GstRTSPHeaderField;
value : access GLIB.gchar); -- gst/rtsp/gstrtspmessage.h:155
procedure remove_header
(msg : access GstRTSPMessage_Record;
field : GstRTSPHeaderField;
indx : GLIB.gint); -- gst/rtsp/gstrtspmessage.h:158
procedure get_header
(msg : access constant GstRTSPMessage_Record;
field : GstRTSPHeaderField;
value : System.Address;
indx : GLIB.gint); -- gst/rtsp/gstrtspmessage.h:161
procedure append_headers (msg : access constant GstRTSPMessage; str : access Glib.String.GString); -- gst/rtsp/gstrtspmessage.h:165
-- handling the body
procedure set_body
(msg : access GstRTSPMessage_Record;
data : access GLIB.guint8;
size : GLIB.guint); -- gst/rtsp/gstrtspmessage.h:169
procedure take_body
(msg : access GstRTSPMessage_Record;
data : access GLIB.guint8;
size : GLIB.guint); -- gst/rtsp/gstrtspmessage.h:172
procedure get_body
(msg : access constant GstRTSPMessage_Record;
data : System.Address;
size : access GLIB.guint); -- gst/rtsp/gstrtspmessage.h:175
procedure steal_body
(msg : access GstRTSPMessage_Record;
data : System.Address;
size : access GLIB.guint); -- gst/rtsp/gstrtspmessage.h:178
-- debug
procedure dump (msg : access GstRTSPMessage_Record); -- gst/rtsp/gstrtspmessage.h:183
private
type GstRTSPMessage_Record is new Ada.Finalization.Controlled with record
Data : access GStreamer.GST_Low_Level.Gstreamer_0_10_Gst_Rtsp_Gstrtspmessage_H.GstRTSPMessage;
end record;
procedure gst_new (msg : in out GstRTSPMessage); -- gst/rtsp/gstrtspmessage.h:110 pragma Import (C, gst_new, "new");
procedure init (msg : access GstRTSPMessage_Record); -- gst/rtsp/gstrtspmessage.h:111
procedure unset (msg : access GstRTSPMessage_Record); -- gst/rtsp/gstrtspmessage.h:112
procedure free (msg : access GstRTSPMessage_Record); -- gst/rtsp/gstrtspmessage.h:113
end GStreamer.rtsp.message;
| 33.583333 | 136 | 0.700134 |
59b3e7cc81f21a07a9cf68fcbba40afc9d981985 | 2,983 | ads | Ada | tools/scitools/conf/understand/ada/ada12/s-pack37.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | 1 | 2020-01-20T21:26:46.000Z | 2020-01-20T21:26:46.000Z | tools/scitools/conf/understand/ada/ada12/s-pack37.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada12/s-pack37.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 3 7 --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2009, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Handling of packed arrays with Component_Size = 37
package System.Pack_37 is
pragma Preelaborate;
Bits : constant := 37;
type Bits_37 is mod 2 ** Bits;
for Bits_37'Size use Bits;
function Get_37 (Arr : System.Address; N : Natural) return Bits_37;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned.
procedure Set_37 (Arr : System.Address; N : Natural; E : Bits_37);
-- 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_37;
| 58.490196 | 78 | 0.376802 |
417e4c8d4acdc5a90ab1b491dbfed34c7cce9ee4 | 12,643 | adb | Ada | src/base/dates/util-dates.adb | yrashk/ada-util | 2aaa1d87e92a7137e1c63dce90f0722c549dfafd | [
"Apache-2.0"
] | 60 | 2015-01-18T23:05:34.000Z | 2022-03-20T18:56:30.000Z | src/base/dates/util-dates.adb | yrashk/ada-util | 2aaa1d87e92a7137e1c63dce90f0722c549dfafd | [
"Apache-2.0"
] | 20 | 2016-09-15T16:41:30.000Z | 2022-03-29T22:02:32.000Z | src/base/dates/util-dates.adb | yrashk/ada-util | 2aaa1d87e92a7137e1c63dce90f0722c549dfafd | [
"Apache-2.0"
] | 10 | 2015-02-13T04:00:45.000Z | 2022-03-20T18:57:54.000Z | -----------------------------------------------------------------------
-- util-dates -- Date utilities
-- Copyright (C) 2011, 2013, 2014, 2018, 2020 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
package body Util.Dates is
-- ------------------------------
-- Split the date into a date record (See Ada.Calendar.Formatting.Split).
-- ------------------------------
procedure Split (Into : out Date_Record;
Date : in Ada.Calendar.Time;
Time_Zone : in Ada.Calendar.Time_Zones.Time_Offset := 0) is
use Ada.Calendar;
D : Ada.Calendar.Time := Date;
begin
Into.Date := Date;
Into.Time_Zone := Time_Zone;
Ada.Calendar.Formatting.Split (Date => Date,
Year => Into.Year,
Month => Into.Month,
Day => Into.Month_Day,
Hour => Into.Hour,
Minute => Into.Minute,
Second => Into.Second,
Sub_Second => Into.Sub_Second,
Leap_Second => Into.Leap_Second,
Time_Zone => Time_Zone);
-- The Day_Of_Week function uses the local timezone to find the week day.
-- The wrong day is computed if the timezone is different. If the current
-- date is 23:30 GMT and the current system timezone is GMT+2, then the computed
-- day of week will be the next day due to the +2 hour offset (01:30 AM).
-- To avoid the timezone issue, we virtually force the hour to 12:00 am.
if Into.Hour > 12 then
D := D - Duration ((Into.Hour - 12) * 3600);
elsif Into.Hour < 12 then
D := D + Duration ((12 - Into.Hour) * 3600);
end if;
D := D - Duration ((60 - Into.Minute) * 60);
Into.Day := Ada.Calendar.Formatting.Day_Of_Week (D);
end Split;
-- ------------------------------
-- Return the date from the date record (See Ada.Calendar.Formatting.Time_Of).
-- ------------------------------
function Time_Of (Date : in Date_Record) return Ada.Calendar.Time is
begin
return Ada.Calendar.Formatting.Time_Of (Year => Date.Year,
Month => Date.Month,
Day => Date.Month_Day,
Hour => Date.Hour,
Minute => Date.Minute,
Second => Date.Second,
Sub_Second => Date.Sub_Second,
Time_Zone => Date.Time_Zone);
end Time_Of;
-- ------------------------------
-- Returns true if the given year is a leap year.
-- ------------------------------
function Is_Leap_Year (Year : in Ada.Calendar.Year_Number) return Boolean is
begin
if Year mod 400 = 0 then
return True;
elsif Year mod 100 = 0 then
return False;
elsif Year mod 4 = 0 then
return True;
else
return False;
end if;
end Is_Leap_Year;
-- ------------------------------
-- Returns true if both dates are on the same day.
-- ------------------------------
function Is_Same_Day (Date1, Date2 : in Ada.Calendar.Time) return Boolean is
Split_Date1 : Date_Record;
Split_Date2 : Date_Record;
begin
Split (Split_Date1, Date1);
Split (Split_Date2, Date2);
return Is_Same_Day (Split_Date1, Split_Date2);
end Is_Same_Day;
function Is_Same_Day (Date1, Date2 : in Date_Record) return Boolean is
begin
return Date1.Year = Date2.Year
and Date1.Month = Date2.Month
and Date1.Month_Day = Date2.Month_Day;
end Is_Same_Day;
-- ------------------------------
-- Get the number of days in the given year.
-- ------------------------------
function Get_Day_Count (Year : in Ada.Calendar.Year_Number)
return Ada.Calendar.Arithmetic.Day_Count is
begin
if Is_Leap_Year (Year) then
return 366;
else
return 365;
end if;
end Get_Day_Count;
Month_Day_Count : constant array (Ada.Calendar.Month_Number)
of Ada.Calendar.Arithmetic.Day_Count
:= (1 => 31, 2 => 28, 3 => 31, 4 => 30, 5 => 31, 6 => 30,
7 => 31, 8 => 31, 9 => 30, 10 => 31, 11 => 30, 12 => 31);
-- ------------------------------
-- Get the number of days in the given month.
-- ------------------------------
function Get_Day_Count (Year : in Ada.Calendar.Year_Number;
Month : in Ada.Calendar.Month_Number)
return Ada.Calendar.Arithmetic.Day_Count is
begin
if Month /= 2 then
return Month_Day_Count (Month);
elsif Is_Leap_Year (Year) then
return 29;
else
return 28;
end if;
end Get_Day_Count;
-- ------------------------------
-- Get a time representing the given date at 00:00:00.
-- ------------------------------
function Get_Day_Start (Date : in Date_Record) return Ada.Calendar.Time is
begin
return Ada.Calendar.Formatting.Time_Of (Year => Date.Year,
Month => Date.Month,
Day => Date.Month_Day,
Hour => 0,
Minute => 0,
Second => 0,
Sub_Second => 0.0,
Time_Zone => Date.Time_Zone);
end Get_Day_Start;
function Get_Day_Start (Date : in Ada.Calendar.Time) return Ada.Calendar.Time is
D : Date_Record;
begin
Split (D, Date);
return Get_Day_Start (D);
end Get_Day_Start;
-- ------------------------------
-- Get a time representing the given date at 23:59:59.
-- ------------------------------
function Get_Day_End (Date : in Date_Record) return Ada.Calendar.Time is
begin
return Ada.Calendar.Formatting.Time_Of (Year => Date.Year,
Month => Date.Month,
Day => Date.Month_Day,
Hour => 23,
Minute => 59,
Second => 59,
Sub_Second => 0.999,
Time_Zone => Date.Time_Zone);
end Get_Day_End;
function Get_Day_End (Date : in Ada.Calendar.Time) return Ada.Calendar.Time is
D : Date_Record;
begin
Split (D, Date);
return Get_Day_End (D);
end Get_Day_End;
-- ------------------------------
-- Get a time representing the beginning of the week at 00:00:00.
-- ------------------------------
function Get_Week_Start (Date : in Date_Record) return Ada.Calendar.Time is
use Ada.Calendar.Formatting;
use Ada.Calendar.Arithmetic;
T : constant Ada.Calendar.Time := Time_Of (Year => Date.Year,
Month => Date.Month,
Day => Date.Month_Day,
Hour => 0,
Minute => 0,
Second => 0,
Sub_Second => 0.0,
Time_Zone => Date.Time_Zone);
begin
if Date.Day = Ada.Calendar.Formatting.Monday then
return T;
else
return T - Day_Count (Day_Name'Pos (Date.Day) - Day_Name'Pos (Monday));
end if;
end Get_Week_Start;
function Get_Week_Start (Date : in Ada.Calendar.Time) return Ada.Calendar.Time is
D : Date_Record;
begin
Split (D, Date);
return Get_Week_Start (D);
end Get_Week_Start;
-- ------------------------------
-- Get a time representing the end of the week at 23:59:99.
-- ------------------------------
function Get_Week_End (Date : in Date_Record) return Ada.Calendar.Time is
use Ada.Calendar.Formatting;
use Ada.Calendar.Arithmetic;
T : constant Ada.Calendar.Time := Time_Of (Year => Date.Year,
Month => Date.Month,
Day => Date.Month_Day,
Hour => 23,
Minute => 59,
Second => 59,
Sub_Second => 0.999,
Time_Zone => Date.Time_Zone);
begin
-- End of week is 6 days + 23:59:59
if Date.Day = Ada.Calendar.Formatting.Sunday then
return T;
else
return T + Day_Count (6 - (Day_Name'Pos (Date.Day) - Day_Name'Pos (Monday)));
end if;
end Get_Week_End;
function Get_Week_End (Date : in Ada.Calendar.Time) return Ada.Calendar.Time is
D : Date_Record;
begin
Split (D, Date);
return Get_Week_End (D);
end Get_Week_End;
-- ------------------------------
-- Get a time representing the beginning of the month at 00:00:00.
-- ------------------------------
function Get_Month_Start (Date : in Date_Record) return Ada.Calendar.Time is
begin
return Ada.Calendar.Formatting.Time_Of (Year => Date.Year,
Month => Date.Month,
Day => Ada.Calendar.Day_Number'First,
Hour => 0,
Minute => 0,
Second => 0,
Sub_Second => 0.0,
Time_Zone => Date.Time_Zone);
end Get_Month_Start;
function Get_Month_Start (Date : in Ada.Calendar.Time) return Ada.Calendar.Time is
D : Date_Record;
begin
Split (D, Date);
return Get_Month_Start (D);
end Get_Month_Start;
-- ------------------------------
-- Get a time representing the end of the month at 23:59:59.
-- ------------------------------
function Get_Month_End (Date : in Date_Record) return Ada.Calendar.Time is
Last_Day : constant Ada.Calendar.Day_Number
:= Ada.Calendar.Day_Number (Get_Day_Count (Date.Year, Date.Month));
begin
return Ada.Calendar.Formatting.Time_Of (Year => Date.Year,
Month => Date.Month,
Day => Last_Day,
Hour => 23,
Minute => 59,
Second => 59,
Sub_Second => 0.999,
Time_Zone => Date.Time_Zone);
end Get_Month_End;
function Get_Month_End (Date : in Ada.Calendar.Time) return Ada.Calendar.Time is
D : Date_Record;
begin
Split (D, Date);
return Get_Month_End (D);
end Get_Month_End;
end Util.Dates;
| 43.297945 | 91 | 0.446334 |
2941e0625e6216e8d4bb2e701ae5333183a63487 | 5,927 | adb | Ada | tools-src/gnu/gcc/gcc/ada/s-pooloc.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 80 | 2015-01-02T10:14:04.000Z | 2021-06-07T06:29:49.000Z | tools-src/gnu/gcc/gcc/ada/s-pooloc.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 9 | 2015-05-14T11:03:12.000Z | 2018-01-04T07:12:58.000Z | tools-src/gnu/gcc/gcc/ada/s-pooloc.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . P O O L _ L O C A L --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-2001, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System.Memory;
with System.Storage_Elements;
with System.Address_To_Access_Conversions;
package body System.Pool_Local is
package SSE renames System.Storage_Elements;
use type SSE.Storage_Offset;
Pointer_Size : constant SSE.Storage_Offset := Address'Size / Storage_Unit;
Pointers_Size : constant SSE.Storage_Offset := 2 * Pointer_Size;
type Acc_Address is access all Address;
package Addr is new Address_To_Access_Conversions (Address);
-----------------------
-- Local Subprograms --
-----------------------
function Next (A : Address) return Acc_Address;
-- Given an address of a block, return an access to the next block
function Prev (A : Address) return Acc_Address;
-- Given an address of a block, return an access to the previous block
--------------
-- Allocate --
--------------
procedure Allocate
(Pool : in out Unbounded_Reclaim_Pool;
Address : out System.Address;
Storage_Size : SSE.Storage_Count;
Alignment : SSE.Storage_Count)
is
Allocated : constant System.Address :=
Memory.Alloc (Memory.size_t (Storage_Size + Pointers_Size));
begin
-- The call to Alloc returns an address whose alignment is compatible
-- with the worst case alignment requirement for the machine; thus the
-- Alignment argument can be safely ignored.
if Allocated = Null_Address then
raise Storage_Error;
else
Address := Allocated + Pointers_Size;
Next (Allocated).all := Pool.First;
Prev (Allocated).all := Null_Address;
if Pool.First /= Null_Address then
Prev (Pool.First).all := Allocated;
end if;
Pool.First := Allocated;
end if;
end Allocate;
----------------
-- Deallocate --
----------------
procedure Deallocate
(Pool : in out Unbounded_Reclaim_Pool;
Address : System.Address;
Storage_Size : SSE.Storage_Count;
Alignment : SSE.Storage_Count)
is
Allocated : constant System.Address := Address - Pointers_Size;
begin
if Prev (Allocated).all = Null_Address then
Pool.First := Next (Allocated).all;
Prev (Pool.First).all := Null_Address;
else
Next (Prev (Allocated).all).all := Next (Allocated).all;
end if;
if Next (Allocated).all /= Null_Address then
Prev (Next (Allocated).all).all := Prev (Allocated).all;
end if;
Memory.Free (Allocated);
end Deallocate;
--------------
-- Finalize --
--------------
procedure Finalize (Pool : in out Unbounded_Reclaim_Pool) is
N : System.Address := Pool.First;
Allocated : System.Address;
begin
while N /= Null_Address loop
Allocated := N;
N := Next (N).all;
Memory.Free (Allocated);
end loop;
end Finalize;
----------
-- Next --
----------
function Next (A : Address) return Acc_Address is
begin
return Acc_Address (Addr.To_Pointer (A));
end Next;
----------
-- Prev --
----------
function Prev (A : Address) return Acc_Address is
begin
return Acc_Address (Addr.To_Pointer (A + Pointer_Size));
end Prev;
end System.Pool_Local;
| 38.23871 | 78 | 0.508352 |
5733ec8fad7bf23a3d3cfc47bb5e09b2ecb6d3f7 | 4,932 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c4/c43207d.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c4/c43207d.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c4/c43207d.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- C43207D.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.
--*
-- FOR A MULTIDIMENSIONAL AGGREGATE OF THE FORM (F..G => (H..I => J)),
-- CHECK THAT:
-- D) J IS EVALUATED ONCE FOR EACH COMPONENT (ZERO TIMES IF THE
-- ARRAY IS NULL).
-- EG 01/18/84
WITH REPORT;
PROCEDURE C43207D IS
USE REPORT;
BEGIN
TEST("C43207D", "CHECK THAT THE EVALUATION OF A MULTI" &
"DIMENSIONAL AGGREGATE OF THE FORM " &
"(F..G => (H..I = J)) IS PERFORMED " &
"CORRECTLY");
DECLARE
TYPE CHOICE_INDEX IS (F, G, H, I, J);
TYPE CHOICE_CNTR IS ARRAY(CHOICE_INDEX) OF INTEGER;
CNTR : CHOICE_CNTR := (CHOICE_INDEX => 0);
SUBTYPE SINT IS INTEGER RANGE 1 .. 8;
TYPE T0 IS ARRAY(SINT RANGE <>, SINT RANGE <>) OF INTEGER;
FUNCTION CALC (A : CHOICE_INDEX; B : INTEGER)
RETURN INTEGER IS
BEGIN
CNTR(A) := CNTR(A) + 1;
RETURN IDENT_INT(B);
END CALC;
BEGIN
CASE_D : BEGIN
CASE_D1 : DECLARE
D1 : T0(8 .. 4, 5 .. 1);
BEGIN
CNTR := (CHOICE_INDEX => 0);
D1 := (8 .. 4 => (5 .. 1 => CALC(J,2)));
IF CNTR(J) /= 0 THEN
FAILED("CASE D1 : INCORRECT NUMBER " &
"OF EVALUATIONS. J EVALUATED" &
INTEGER'IMAGE(CNTR(J)) & " TIMES");
END IF;
EXCEPTION
WHEN OTHERS =>
FAILED("CASE D1 : EXCEPTION RAISED");
END CASE_D1;
CASE_D2 : DECLARE
D2 : T0(8 .. 4, 5 .. 1);
BEGIN
CNTR := (CHOICE_INDEX => 0);
D2 := (CALC(F,8) .. CALC(G,4) =>
(CALC(H,5) .. CALC(I,1) => CALC(J,2)));
IF CNTR(J) /= 0 THEN
FAILED("CASE D2 : INCORRECT NUMBER " &
"OF EVALUATIONS. J EVALUATED" &
INTEGER'IMAGE(CNTR(J)) & " TIMES");
END IF;
EXCEPTION
WHEN OTHERS =>
FAILED("CASE D2 : EXCEPTION RAISED");
END CASE_D2;
CASE_D3 : DECLARE
D3 : T0(3 .. 5, 1 .. 2);
BEGIN
CNTR := (CHOICE_INDEX => 0);
D3 := (3 .. 5 => (1 .. 2 => CALC(J,2)));
IF CNTR(J) /= 6 THEN
FAILED("CASE D3 : INCORRECT NUMBER " &
"OF EVALUATIONS. J EVALUATED" &
INTEGER'IMAGE(CNTR(J)) & " TIMES");
END IF;
EXCEPTION
WHEN OTHERS =>
FAILED("CASE D3 : EXCEPTION RAISED");
END CASE_D3;
CASE_D4 : DECLARE
D4 : T0(1 .. 2, 5 .. 7);
BEGIN
CNTR := (CHOICE_INDEX => 0);
D4 := (CALC(F,1) .. CALC(G,2) =>
(CALC(H,5) .. CALC(I,7) => CALC(J,2)));
IF CNTR(J) /= 6 THEN
FAILED("CASE D4 : INCORRECT NUMBER " &
"OF EVALUATIONS. J EVALUATED" &
INTEGER'IMAGE(CNTR(J)) & " TIMES");
END IF;
EXCEPTION
WHEN OTHERS =>
FAILED("CASE D4 : EXCEPTION RAISED");
END CASE_D4;
END CASE_D;
END;
RESULT;
END C43207D;
| 36.264706 | 79 | 0.456407 |
297a8fa765ee512c7d23a1108770572a5aca7164 | 773 | ads | Ada | src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/bp_reset/io.ads | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 31 | 2018-08-01T21:25:24.000Z | 2022-02-14T07:52:34.000Z | src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/bp_reset/io.ads | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 40 | 2018-12-03T19:48:52.000Z | 2021-03-10T06:34:26.000Z | src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/bp_reset/io.ads | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 20 | 2018-11-16T21:19:22.000Z | 2021-10-18T23:08:24.000Z | -- Copyright 2012-2016 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package IO is
procedure Put_Line (S : String);
end IO;
| 40.684211 | 73 | 0.734799 |
571be97adcc161dcc7b5909cb95a9f86660df338 | 5,802 | ads | Ada | Sources/Globe_3d/unzip/zip-headers.ads | ForYouEyesOnly/Space-Convoy | be4904f6a02695f7c4c5c3c965f4871cd3250003 | [
"MIT"
] | 1 | 2019-09-21T09:40:34.000Z | 2019-09-21T09:40:34.000Z | Sources/Globe_3d/unzip/zip-headers.ads | ForYouEyesOnly/Space-Convoy | be4904f6a02695f7c4c5c3c965f4871cd3250003 | [
"MIT"
] | null | null | null | Sources/Globe_3d/unzip/zip-headers.ads | ForYouEyesOnly/Space-Convoy | be4904f6a02695f7c4c5c3c965f4871cd3250003 | [
"MIT"
] | 1 | 2019-09-25T12:29:27.000Z | 2019-09-25T12:29:27.000Z | -- ________ ___ ______ ______ ___
-- /___ .. ._/ |.| |.___.\ /. __ .\ __|.| ____
-- / .. / |.| |.____/ |.|__|.| / .. ..| __\ .. \
-- _/ .. /___ |.| |.| === | .. __ .. ||. = .| | = .. |
-- /_______/ |_| /__| /__| |_| \__\_| \__\_|
-- This package provides:
--
-- * Definiton of PKZIP information structures (cf appnote.txt),
-- * Reading a header from a data stream (Read_and_check),
-- * Copying a header from a buffer (Copy_and_check)
-- * Writing a header to a data stream (Write)
-- Change log:
-- ==========
-- 16 - Nov - 2009 : GdM : Replaced Ada.Calendar.Time by Zip.Time in headers, due to
-- perf. issues in some run - times' Ada.Calendar.Time_Of
with Interfaces;
with Zip_Streams; use Zip_Streams;
package Zip.Headers is
use Interfaces;
----------------------------------------------------------------------
-- PKZIP data descriptor, put after streamed compressed data - PK78 --
----------------------------------------------------------------------
type Data_descriptor is record
-- PK78 -- 1 .. 4
crc_32 : Unsigned_32; -- 5 .. 8
compressed_size,
uncompressed_size : Unsigned_32;
end record;
data_descriptor_length : constant := 16;
-- This header needs to be read in continuation of
-- the compressed data - > access to a buffer
procedure Copy_and_check (buffer : Byte_Buffer;
the_data_desc : out Data_descriptor);
procedure Read_and_check (stream : Zipstream_Class;
the_data_desc : out Data_descriptor);
bad_data_descriptor : exception;
procedure Write (stream : Zipstream_Class;
the_data_desc : Data_descriptor);
-----------------------------------------------------------------------
-- PKZIP local file header, in front of every file in archive - PK34 --
-----------------------------------------------------------------------
Language_Encoding_Flag_Bit : constant := 2**11;
type Local_File_Header is record
-- PK34 -- 1 .. 4
needed_extract_version : Unsigned_16; -- 5 .. 6
bit_flag,
zip_type : Unsigned_16;
file_timedate : Time;
dd : Data_descriptor;
filename_length,
extra_field_length : Unsigned_16;
end record;
local_header_length : constant := 30;
procedure Read_and_check (stream : Zipstream_Class;
header : out Local_File_Header);
bad_local_header : exception;
procedure Write (stream : Zipstream_Class;
header : Local_File_Header);
-------------------------------------------------------
-- PKZIP file header, as in central directory - PK12 --
-------------------------------------------------------
-- NB : a central header contains a local header in the middle
type Central_File_Header is record
-- PK12 -- 1 .. 4
made_by_version : Unsigned_16; -- 5 .. 6
short_info : Local_File_Header; -- 7 .. 32
comment_length : Unsigned_16; -- 33 .. 34
disk_number_start : Unsigned_16;
internal_attributes : Unsigned_16; -- internal properties of data
external_attributes : Unsigned_32; -- 1st byte if MS - DOS : see below
local_header_offset : Unsigned_32;
end record;
-- MS - DOS external attributes:
--
-- Bit 0 Read - Only
-- Bit 1 Hidden
-- Bit 2 System
-- Bit 3 Volume Label
-- Bit 4 Directory
-- Bit 5 Archive
central_header_length : constant := 46;
procedure Read_and_check (stream : Zipstream_Class;
header : out Central_File_Header);
bad_central_header : exception;
procedure Write (stream : Zipstream_Class;
header : Central_File_Header);
-------------------------------------------
-- PKZIP end - of - central - directory - PK56 --
-------------------------------------------
type End_of_Central_Dir is record
-- PK56 -- 1 .. 4
disknum : Unsigned_16; -- 5 .. 6
disknum_with_start : Unsigned_16;
disk_total_entries : Unsigned_16;
total_entries : Unsigned_16;
central_dir_size : Unsigned_32;
central_dir_offset : Unsigned_32;
main_comment_length : Unsigned_16;
-- The Zip archive may be appended to another file (for instance an
-- executable for self - extracting purposes) of size N.
-- Then, all offsets need to be shifted by N.
-- N=0 if the Zip archive is on its own.
-- The real offset of the end - of - central - dir
-- will be N + central_dir_size + central_dir_offset.
-- This way, we have an unique chance to determine N when reading the
-- end - of - central - dir. N is stored in the field hereafter.
offset_shifting : Unsigned_32;
end record;
end_of_central_dir_length : constant := 22;
-- This header needs to be read in special
-- ways (see Load) - > access to a buffer
procedure Copy_and_check (buffer : Byte_Buffer;
the_end : out End_of_Central_Dir);
procedure Read_and_check (stream : Zipstream_Class;
the_end : out End_of_Central_Dir);
bad_end : exception;
-- A bit more elaborated : from an open file (not a stream),
-- find the End - of - Central - dir and load it; keep the file open.
procedure Load (stream : Zipstream_Class;
the_end : out End_of_Central_Dir);
procedure Write (stream : Zipstream_Class;
the_end : End_of_Central_Dir);
end Zip.Headers;
| 36.490566 | 85 | 0.541537 |
2fffc53f0d475911be324bfdd49afed3e5372f3c | 849 | ads | Ada | Ada/problem_5/problem_5.ads | PyllrNL/Project_Euler_Solutions | 3d125dae48e50b1fcddb8b8bd5b1cf653aff1005 | [
"MIT"
] | null | null | null | Ada/problem_5/problem_5.ads | PyllrNL/Project_Euler_Solutions | 3d125dae48e50b1fcddb8b8bd5b1cf653aff1005 | [
"MIT"
] | null | null | null | Ada/problem_5/problem_5.ads | PyllrNL/Project_Euler_Solutions | 3d125dae48e50b1fcddb8b8bd5b1cf653aff1005 | [
"MIT"
] | null | null | null | with Test_Solution; use Test_Solution;
with Ada.Numerics; use Ada.Numerics;
with Ada.Numerics.Elementary_Functions;
use Ada.Numerics.Elementary_Functions;
with Ada.Containers.Vectors;
package Problem_5 is
type Int64 is range -2**63 .. 2**63 - 1;
type Prime_Count is record
Prime : Int64;
Count : Int64;
end record;
package P is new Ada.Containers.Vectors(Index_Type => Natural,
Element_Type => Prime_Count);
function Solution_1( Min, Max : Integer ) return Int64;
function Solution_2( Min, Max : Integer ) return Int64;
procedure Test_Solution_1;
procedure Test_Solution_2;
function Get_Solutions return Solution_Case;
private
function Greatest_Common_Divisor( A, B : Integer ) return Integer;
function Least_Common_Multiple( A, B : Integer ) return Integer;
end Problem_5;
| 24.970588 | 70 | 0.725559 |
29956127c4a9e9a1f92511ff07f2b3e2f1085725 | 63 | ads | Ada | Bitmaps/src/bitmaps.ads | kochab/simulatedannealing-ada | ed1f2d15b0aadd31d8ca474b67ac02ae380aaf71 | [
"MIT"
] | null | null | null | Bitmaps/src/bitmaps.ads | kochab/simulatedannealing-ada | ed1f2d15b0aadd31d8ca474b67ac02ae380aaf71 | [
"MIT"
] | null | null | null | Bitmaps/src/bitmaps.ads | kochab/simulatedannealing-ada | ed1f2d15b0aadd31d8ca474b67ac02ae380aaf71 | [
"MIT"
] | null | null | null | package Bitmaps is
type Luminance is mod 2**8;
end Bitmaps;
| 15.75 | 30 | 0.730159 |
57274c3865d2b2f83929889e74a04b5768beb800 | 7,151 | ads | Ada | tools-src/gnu/gcc/gcc/ada/5osystem.ads | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 80 | 2015-01-02T10:14:04.000Z | 2021-06-07T06:29:49.000Z | tools-src/gnu/gcc/gcc/ada/5osystem.ads | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 9 | 2015-05-14T11:03:12.000Z | 2018-01-04T07:12:58.000Z | tools-src/gnu/gcc/gcc/ada/5osystem.ads | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M --
-- --
-- S p e c --
-- (OS/2 Version) --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-2001 Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
package System is
pragma Pure (System);
-- Note that we take advantage of the implementation permission to
-- make this unit Pure instead of Preelaborable, see RM 13.7(36)
type Name is (SYSTEM_NAME_GNAT);
System_Name : constant Name := SYSTEM_NAME_GNAT;
-- System-Dependent Named Numbers
Min_Int : constant := Long_Long_Integer'First;
Max_Int : constant := Long_Long_Integer'Last;
Max_Binary_Modulus : constant := 2 ** Long_Long_Integer'Size;
Max_Nonbinary_Modulus : constant := Integer'Last;
Max_Base_Digits : constant := Long_Long_Float'Digits;
Max_Digits : constant := Long_Long_Float'Digits;
Max_Mantissa : constant := 63;
Fine_Delta : constant := 2.0 ** (-Max_Mantissa);
Tick : constant := Standard'Tick;
-- Storage-related Declarations
type Address is private;
Null_Address : constant Address;
Storage_Unit : constant := Standard'Storage_Unit;
Word_Size : constant := Standard'Word_Size;
Memory_Size : constant := 2 ** Standard'Address_Size;
-- Address comparison
function "<" (Left, Right : Address) return Boolean;
function "<=" (Left, Right : Address) return Boolean;
function ">" (Left, Right : Address) return Boolean;
function ">=" (Left, Right : Address) return Boolean;
function "=" (Left, Right : Address) return Boolean;
pragma Import (Intrinsic, "<");
pragma Import (Intrinsic, "<=");
pragma Import (Intrinsic, ">");
pragma Import (Intrinsic, ">=");
pragma Import (Intrinsic, "=");
-- Other System-Dependent Declarations
type Bit_Order is (High_Order_First, Low_Order_First);
Default_Bit_Order : constant Bit_Order :=
Bit_Order'Val (Standard'Default_Bit_Order);
-- Priority-related Declarations (RM D.1)
Max_Priority : constant Positive := 30;
Max_Interrupt_Priority : constant Positive := 31;
subtype Any_Priority is Integer
range 0 .. Standard'Max_Interrupt_Priority;
subtype Priority is Any_Priority
range 0 .. Standard'Max_Priority;
-- Functional notation is needed in the following to avoid visibility
-- problems when this package is compiled through rtsfind in the middle
-- of another compilation.
subtype Interrupt_Priority is Any_Priority
range
Standard."+" (Standard'Max_Priority, 1) ..
Standard'Max_Interrupt_Priority;
Default_Priority : constant Priority :=
Standard."/" (Standard."+" (Priority'First, Priority'Last), 2);
private
type Address is mod Memory_Size;
Null_Address : constant Address := 0;
--------------------------------------
-- System Implementation Parameters --
--------------------------------------
-- These parameters provide information about the target that is used
-- by the compiler. They are in the private part of System, where they
-- can be accessed using the special circuitry in the Targparm unit
-- whose source should be consulted for more detailed descriptions
-- of the individual switch values.
AAMP : constant Boolean := False;
Command_Line_Args : constant Boolean := True;
Denorm : constant Boolean := True;
Frontend_Layout : constant Boolean := False;
Functions_Return_By_DSP : constant Boolean := False;
Long_Shifts_Inlined : constant Boolean := True;
High_Integrity_Mode : constant Boolean := False;
Machine_Overflows : constant Boolean := False;
Machine_Rounds : constant Boolean := True;
OpenVMS : constant Boolean := False;
Signed_Zeros : constant Boolean := True;
Stack_Check_Default : constant Boolean := False;
Stack_Check_Probes : constant Boolean := False;
Use_Ada_Main_Program_Name : constant Boolean := False;
ZCX_By_Default : constant Boolean := False;
GCC_ZCX_Support : constant Boolean := False;
Front_End_ZCX_Support : constant Boolean := False;
end System;
| 47.046053 | 78 | 0.543421 |
29c386f7040230d9b485f1c04c673feef1bdb197 | 31,539 | adb | Ada | source/containers/a-cohase.adb | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 33 | 2015-04-04T09:19:36.000Z | 2021-11-10T05:33:34.000Z | source/containers/a-cohase.adb | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 8 | 2017-11-14T13:05:07.000Z | 2018-08-09T15:28:49.000Z | source/containers/a-cohase.adb | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 9 | 2015-02-03T17:09:53.000Z | 2021-11-12T01:16:05.000Z | -- diff (Ada.Exceptions.Finally)
with Ada.Unchecked_Conversion;
with Ada.Unchecked_Deallocation;
with Ada.Streams; -- [gcc-4.7] can not search in private with
with System;
package body Ada.Containers.Hashed_Sets is
use type Hash_Tables.Table_Access;
use type Copy_On_Write.Data_Access;
function Upcast is
new Unchecked_Conversion (Cursor, Hash_Tables.Node_Access);
function Downcast is
new Unchecked_Conversion (Hash_Tables.Node_Access, Cursor);
function Upcast is
new Unchecked_Conversion (Data_Access, Copy_On_Write.Data_Access);
function Downcast is
new Unchecked_Conversion (Copy_On_Write.Data_Access, Data_Access);
-- diff
procedure Free is new Unchecked_Deallocation (Node, Cursor);
type Context_Type is limited record
Left : not null access Element_Type;
end record;
pragma Suppress_Initialization (Context_Type);
function Equivalent_Element (
Position : not null Hash_Tables.Node_Access;
Params : System.Address)
return Boolean;
function Equivalent_Element (
Position : not null Hash_Tables.Node_Access;
Params : System.Address)
return Boolean
is
Context : Context_Type;
for Context'Address use Params;
begin
return Equivalent_Elements (
Context.Left.all,
Downcast (Position).Element);
end Equivalent_Element;
function Equivalent_Node (Left, Right : not null Hash_Tables.Node_Access)
return Boolean;
function Equivalent_Node (Left, Right : not null Hash_Tables.Node_Access)
return Boolean is
begin
return Equivalent_Elements (
Downcast (Left).Element,
Downcast (Right).Element);
end Equivalent_Node;
-- diff (Allocate_Element)
--
--
--
--
--
--
--
--
procedure Allocate_Node (Item : out Cursor; New_Item : Element_Type);
procedure Allocate_Node (Item : out Cursor; New_Item : Element_Type) is
-- diff
-- diff
-- diff
begin
Item := new Node'(Super => <>, Element => New_Item);
-- diff
-- diff
-- diff
end Allocate_Node;
procedure Copy_Node (
Target : out Hash_Tables.Node_Access;
Source : not null Hash_Tables.Node_Access);
procedure Copy_Node (
Target : out Hash_Tables.Node_Access;
Source : not null Hash_Tables.Node_Access)
is
New_Node : Cursor;
begin
Allocate_Node (New_Node, Downcast (Source).Element);
Target := Upcast (New_Node);
end Copy_Node;
procedure Free_Node (Object : in out Hash_Tables.Node_Access);
procedure Free_Node (Object : in out Hash_Tables.Node_Access) is
X : Cursor := Downcast (Object);
begin
-- diff
Free (X);
Object := null;
end Free_Node;
procedure Allocate_Data (
Target : out not null Copy_On_Write.Data_Access;
New_Length : Count_Type;
Capacity : Count_Type);
procedure Allocate_Data (
Target : out not null Copy_On_Write.Data_Access;
New_Length : Count_Type;
Capacity : Count_Type)
is
pragma Unreferenced (New_Length);
New_Data : constant Data_Access :=
new Data'(Super => <>, Table => null, Length => 0);
begin
Hash_Tables.Rebuild (New_Data.Table, Capacity);
Target := Upcast (New_Data);
end Allocate_Data;
procedure Copy_Data (
Target : out not null Copy_On_Write.Data_Access;
Source : not null Copy_On_Write.Data_Access;
Length : Count_Type;
New_Length : Count_Type;
Capacity : Count_Type);
procedure Copy_Data (
Target : out not null Copy_On_Write.Data_Access;
Source : not null Copy_On_Write.Data_Access;
Length : Count_Type;
New_Length : Count_Type;
Capacity : Count_Type)
is
pragma Unreferenced (Length);
pragma Unreferenced (New_Length);
New_Data : constant Data_Access :=
new Data'(Super => <>, Table => null, Length => 0);
begin
Hash_Tables.Copy (
New_Data.Table,
New_Data.Length,
Downcast (Source).Table,
Capacity,
Copy => Copy_Node'Access);
Target := Upcast (New_Data);
end Copy_Data;
procedure Free is new Unchecked_Deallocation (Data, Data_Access);
procedure Free_Data (Data : in out Copy_On_Write.Data_Access);
procedure Free_Data (Data : in out Copy_On_Write.Data_Access) is
X : Data_Access := Downcast (Data);
begin
Hash_Tables.Free (X.Table, X.Length, Free => Free_Node'Access);
Free (X);
Data := null;
end Free_Data;
procedure Reallocate (
Container : in out Set;
Capacity : Count_Type;
To_Update : Boolean);
procedure Reallocate (
Container : in out Set;
Capacity : Count_Type;
To_Update : Boolean) is
begin
Copy_On_Write.Unique (
Target => Container.Super'Access,
Target_Length => 0, -- Length is unused
Target_Capacity => Hashed_Sets.Capacity (Container),
New_Length => 0,
New_Capacity => Capacity,
To_Update => To_Update,
Allocate => Allocate_Data'Access,
Move => Copy_Data'Access,
Copy => Copy_Data'Access,
Free => Free_Data'Access,
Max_Length => Copy_On_Write.Zero'Access);
end Reallocate;
procedure Unique (Container : in out Set; To_Update : Boolean);
procedure Unique (Container : in out Set; To_Update : Boolean) is
begin
if Copy_On_Write.Shared (Container.Super.Data) then
Reallocate (
Container,
Capacity (Container), -- not shrinking
To_Update);
end if;
end Unique;
function Equivalent_Sets (
Left, Right : Set;
Equivalent : not null access function (
Left, Right : not null Hash_Tables.Node_Access)
return Boolean)
return Boolean;
function Equivalent_Sets (
Left, Right : Set;
Equivalent : not null access function (
Left, Right : not null Hash_Tables.Node_Access)
return Boolean)
return Boolean
is
Left_Length : constant Count_Type := Length (Left);
Right_Length : constant Count_Type := Length (Right);
begin
if Left_Length /= Right_Length then
return False;
elsif Left_Length = 0 or else Left.Super.Data = Right.Super.Data then
return True;
else
Unique (Left'Unrestricted_Access.all, False); -- private
Unique (Right'Unrestricted_Access.all, False); -- private
declare
Left_Data : constant Data_Access := Downcast (Left.Super.Data);
Right_Data : constant Data_Access := Downcast (Right.Super.Data);
begin
return Hash_Tables.Equivalent (
Left_Data.Table,
Left_Data.Length,
Right_Data.Table,
Right_Data.Length,
Equivalent => Equivalent);
end;
end if;
end Equivalent_Sets;
function Find (Container : Set; Hash : Hash_Type; Item : Element_Type)
return Cursor;
function Find (Container : Set; Hash : Hash_Type; Item : Element_Type)
return Cursor is
begin
if Is_Empty (Container) then
return null;
else
Unique (Container'Unrestricted_Access.all, False);
declare
Context : aliased Context_Type :=
(Left => Item'Unrestricted_Access);
begin
return Downcast (Hash_Tables.Find (
Downcast (Container.Super.Data).Table,
Hash,
Context'Address,
Equivalent => Equivalent_Element'Access));
end;
end if;
end Find;
-- implementation
function Empty_Set return Set is
begin
return (Finalization.Controlled with Super => (null, null));
end Empty_Set;
function Has_Element (Position : Cursor) return Boolean is
begin
return Position /= null;
end Has_Element;
overriding function "=" (Left, Right : Set) return Boolean is
function Equivalent (Left, Right : not null Hash_Tables.Node_Access)
return Boolean;
function Equivalent (Left, Right : not null Hash_Tables.Node_Access)
return Boolean is
begin
return Downcast (Left).Element = Downcast (Right).Element;
end Equivalent;
begin
return Equivalent_Sets (Left, Right, Equivalent => Equivalent'Access);
end "=";
function Equivalent_Sets (Left, Right : Set) return Boolean is
begin
return Equivalent_Sets (Left, Right,
Equivalent => Equivalent_Node'Access);
end Equivalent_Sets;
function To_Set (New_Item : Element_Type) return Set is
begin
return Result : Set do
Insert (Result, New_Item);
end return;
end To_Set;
function Generic_Array_To_Set (S : Element_Array) return Set is
begin
return Result : Set do
Reallocate (Result, S'Length, True);
for I in S'Range loop
Insert (Result, S (I));
end loop;
end return;
end Generic_Array_To_Set;
function Capacity (Container : Set) return Count_Type is
Data : constant Data_Access := Downcast (Container.Super.Data);
begin
if Data = null then
return 0;
else
return Hash_Tables.Capacity (Data.Table);
end if;
end Capacity;
procedure Reserve_Capacity (
Container : in out Set;
Capacity : Count_Type)
is
New_Capacity : constant Count_Type :=
Count_Type'Max (Capacity, Length (Container));
begin
Reallocate (Container, New_Capacity, True);
end Reserve_Capacity;
function Length (Container : Set) return Count_Type is
Data : constant Data_Access := Downcast (Container.Super.Data);
begin
if Data = null then
return 0;
else
return Data.Length;
end if;
end Length;
function Is_Empty (Container : Set) return Boolean is
Data : constant Data_Access := Downcast (Container.Super.Data);
begin
return Data = null or else Data.Length = 0;
end Is_Empty;
procedure Clear (Container : in out Set) is
begin
Copy_On_Write.Clear (Container.Super'Access, Free => Free_Data'Access);
end Clear;
function Element (Position : Cursor) return Element_Type is
begin
return Position.Element;
end Element;
procedure Replace_Element (
Container : in out Set;
Position : Cursor;
New_Item : Element_Type) is
begin
Unique (Container, True);
-- diff
Position.Element := New_Item;
end Replace_Element;
procedure Query_Element (
Position : Cursor;
Process : not null access procedure (Element : Element_Type)) is
begin
Process (Position.Element);
end Query_Element;
function Constant_Reference (Container : aliased Set; Position : Cursor)
return Constant_Reference_Type
is
pragma Unreferenced (Container);
begin
return (Element => Position.all.Element'Access); -- [gcc-6] .all
end Constant_Reference;
procedure Assign (Target : in out Set; Source : Set) is
begin
Copy_On_Write.Assign (
Target.Super'Access,
Source.Super'Access,
Free => Free_Data'Access);
end Assign;
function Copy (Source : Set; Capacity : Count_Type := 0) return Set is
begin
return Result : Set do
Copy_On_Write.Copy (
Result.Super'Access,
Source.Super'Access,
0, -- Length is unused
Count_Type'Max (Capacity, Length (Source)),
Allocate => Allocate_Data'Access,
Copy => Copy_Data'Access);
end return;
end Copy;
procedure Move (Target : in out Set; Source : in out Set) is
begin
Copy_On_Write.Move (
Target.Super'Access,
Source.Super'Access,
Free => Free_Data'Access);
-- diff
end Move;
procedure Insert (
Container : in out Set;
New_Item : Element_Type;
Position : out Cursor;
Inserted : out Boolean)
is
-- diff
-- diff
-- diff
New_Hash : constant Hash_Type := Hash (New_Item);
begin
-- diff
-- diff
Position := Find (Container, New_Hash, New_Item);
Inserted := Position = null;
if Inserted then
Unique (Container, True);
Allocate_Node (Position, New_Item);
declare
Data : constant Data_Access := Downcast (Container.Super.Data);
begin
Hash_Tables.Insert (
Data.Table,
Data.Length,
New_Hash,
Upcast (Position));
end;
end if;
end Insert;
procedure Insert (
Container : in out Set;
New_Item : Element_Type)
is
Position : Cursor;
Inserted : Boolean;
begin
Insert (Container, New_Item, Position, Inserted);
if not Inserted then
raise Constraint_Error;
end if;
end Insert;
procedure Include (Container : in out Set; New_Item : Element_Type) is
Position : Cursor;
Inserted : Boolean;
begin
Insert (Container, New_Item, Position, Inserted);
if not Inserted then
Replace_Element (Container, Position, New_Item);
end if;
end Include;
procedure Replace (Container : in out Set; New_Item : Element_Type) is
begin
Replace_Element (Container, Find (Container, New_Item), New_Item);
end Replace;
procedure Exclude (Container : in out Set; Item : Element_Type) is
Position : Cursor := Find (Container, Item);
begin
if Position /= null then
Delete (Container, Position);
end if;
end Exclude;
procedure Delete (Container : in out Set; Item : Element_Type) is
Position : Cursor := Find (Container, Item);
begin
Delete (Container, Position);
end Delete;
procedure Delete (Container : in out Set; Position : in out Cursor) is
Position_2 : Hash_Tables.Node_Access := Upcast (Position);
begin
Unique (Container, True);
declare
Data : constant Data_Access := Downcast (Container.Super.Data);
begin
Hash_Tables.Remove (Data.Table, Data.Length, Position_2);
end;
Free_Node (Position_2);
Position := null;
end Delete;
procedure Union (Target : in out Set; Source : Set) is
begin
if Is_Empty (Source) or else Target.Super.Data = Source.Super.Data then
null;
elsif Is_Empty (Target) then
Assign (Target, Source);
else
Unique (Target, True);
Unique (Source'Unrestricted_Access.all, False); -- private
declare
Target_Data : constant Data_Access := Downcast (Target.Super.Data);
Source_Data : constant Data_Access := Downcast (Source.Super.Data);
begin
Hash_Tables.Merge (
Target_Data.Table,
Target_Data.Length,
Source_Data.Table,
Source_Data.Length,
(others => True),
Equivalent => Equivalent_Node'Access,
Copy => Copy_Node'Access,
Free => Free_Node'Access);
end;
end if;
end Union;
function Union (Left, Right : Set) return Set is
begin
return Result : Set do
if Is_Empty (Right) or else Left.Super.Data = Right.Super.Data then
Assign (Result, Left);
elsif Is_Empty (Left) then
Assign (Result, Right);
else
Unique (Result, True);
Unique (Left'Unrestricted_Access.all, False); -- private
Unique (Right'Unrestricted_Access.all, False); -- private
declare
Result_Data : constant Data_Access :=
Downcast (Result.Super.Data);
Left_Data : constant Data_Access := Downcast (Left.Super.Data);
Right_Data : constant Data_Access :=
Downcast (Right.Super.Data);
begin
Hash_Tables.Copying_Merge (
Result_Data.Table,
Result_Data.Length,
Left_Data.Table,
Left_Data.Length,
Right_Data.Table,
Right_Data.Length,
(others => True),
Equivalent => Equivalent_Node'Access,
Copy => Copy_Node'Access);
end;
end if;
end return;
end Union;
procedure Intersection (Target : in out Set; Source : Set) is
begin
if Is_Empty (Target) or else Is_Empty (Source) then
Clear (Target);
elsif Target.Super.Data = Source.Super.Data then
null;
else
Unique (Target, True);
Unique (Source'Unrestricted_Access.all, False); -- private
declare
Target_Data : constant Data_Access := Downcast (Target.Super.Data);
Source_Data : constant Data_Access := Downcast (Source.Super.Data);
begin
Hash_Tables.Merge (
Target_Data.Table,
Target_Data.Length,
Source_Data.Table,
Source_Data.Length,
(Hash_Tables.In_Both => True, others => False),
Equivalent => Equivalent_Node'Access,
Copy => Copy_Node'Access,
Free => Free_Node'Access);
end;
end if;
end Intersection;
function Intersection (Left, Right : Set) return Set is
begin
return Result : Set do
if Is_Empty (Left) or else Is_Empty (Right) then
null; -- Empty_Set
elsif Left.Super.Data = Right.Super.Data then
Assign (Result, Left);
else
Unique (Result, True);
Unique (Left'Unrestricted_Access.all, False); -- private
Unique (Right'Unrestricted_Access.all, False); -- private
declare
Result_Data : constant Data_Access :=
Downcast (Result.Super.Data);
Left_Data : constant Data_Access := Downcast (Left.Super.Data);
Right_Data : constant Data_Access :=
Downcast (Right.Super.Data);
begin
Hash_Tables.Copying_Merge (
Result_Data.Table,
Result_Data.Length,
Left_Data.Table,
Left_Data.Length,
Right_Data.Table,
Right_Data.Length,
(Hash_Tables.In_Both => True, others => False),
Equivalent => Equivalent_Node'Access,
Copy => Copy_Node'Access);
end;
end if;
end return;
end Intersection;
procedure Difference (Target : in out Set; Source : Set) is
begin
if Is_Empty (Target) or else Target.Super.Data = Source.Super.Data then
Clear (Target);
elsif Is_Empty (Source) then
null;
else
Unique (Target, True);
Unique (Source'Unrestricted_Access.all, False); -- private
declare
Target_Data : constant Data_Access := Downcast (Target.Super.Data);
Source_Data : constant Data_Access := Downcast (Source.Super.Data);
begin
Hash_Tables.Merge (
Target_Data.Table,
Target_Data.Length,
Source_Data.Table,
Source_Data.Length,
(Hash_Tables.In_Only_Left => True, others => False),
Equivalent => Equivalent_Node'Access,
Copy => Copy_Node'Access,
Free => Free_Node'Access);
end;
end if;
end Difference;
function Difference (Left, Right : Set) return Set is
begin
return Result : Set do
if Is_Empty (Left) or else Left.Super.Data = Right.Super.Data then
null; -- Empty_Set
elsif Is_Empty (Right) then
Assign (Result, Left);
else
Unique (Result, True);
Unique (Left'Unrestricted_Access.all, False); -- private
Unique (Right'Unrestricted_Access.all, False); -- private
declare
Result_Data : constant Data_Access :=
Downcast (Result.Super.Data);
Left_Data : constant Data_Access := Downcast (Left.Super.Data);
Right_Data : constant Data_Access :=
Downcast (Right.Super.Data);
begin
Hash_Tables.Copying_Merge (
Result_Data.Table,
Result_Data.Length,
Left_Data.Table,
Left_Data.Length,
Right_Data.Table,
Right_Data.Length,
(Hash_Tables.In_Only_Left => True, others => False),
Equivalent => Equivalent_Node'Access,
Copy => Copy_Node'Access);
end;
end if;
end return;
end Difference;
procedure Symmetric_Difference (Target : in out Set; Source : Set) is
begin
if Target.Super.Data = Source.Super.Data then
Clear (Target);
elsif Is_Empty (Source) then
null;
elsif Is_Empty (Target) then
Assign (Target, Source);
else
Unique (Target, True);
Unique (Source'Unrestricted_Access.all, False); -- private
declare
Target_Data : constant Data_Access := Downcast (Target.Super.Data);
Source_Data : constant Data_Access := Downcast (Source.Super.Data);
begin
Hash_Tables.Merge (
Target_Data.Table,
Target_Data.Length,
Source_Data.Table,
Source_Data.Length,
(Hash_Tables.In_Both => False, others => True),
Equivalent => Equivalent_Node'Access,
Copy => Copy_Node'Access,
Free => Free_Node'Access);
end;
end if;
end Symmetric_Difference;
function Symmetric_Difference (Left, Right : Set) return Set is
begin
return Result : Set do
if Left.Super.Data = Right.Super.Data then
null; -- Empty_Set
elsif Is_Empty (Right) then
Assign (Result, Left);
elsif Is_Empty (Left) then
Assign (Result, Right);
else
Unique (Result, True);
Unique (Left'Unrestricted_Access.all, False); -- private
Unique (Right'Unrestricted_Access.all, False); -- private
declare
Result_Data : constant Data_Access :=
Downcast (Result.Super.Data);
Left_Data : constant Data_Access := Downcast (Left.Super.Data);
Right_Data : constant Data_Access :=
Downcast (Right.Super.Data);
begin
Hash_Tables.Copying_Merge (
Result_Data.Table,
Result_Data.Length,
Left_Data.Table,
Left_Data.Length,
Right_Data.Table,
Right_Data.Length,
(Hash_Tables.In_Both => False, others => True),
Equivalent => Equivalent_Node'Access,
Copy => Copy_Node'Access);
end;
end if;
end return;
end Symmetric_Difference;
function Overlap (Left, Right : Set) return Boolean is
begin
if Is_Empty (Left) or else Is_Empty (Right) then
return False;
elsif Left.Super.Data = Right.Super.Data then
return True;
else
Unique (Left'Unrestricted_Access.all, False); -- private
Unique (Right'Unrestricted_Access.all, False); -- private
return Hash_Tables.Overlap (
Downcast (Left.Super.Data).Table,
Downcast (Right.Super.Data).Table,
Equivalent => Equivalent_Node'Access);
end if;
end Overlap;
function Is_Subset (Subset : Set; Of_Set : Set) return Boolean is
begin
if Is_Empty (Subset) or else Subset.Super.Data = Of_Set.Super.Data then
return True;
elsif Is_Empty (Of_Set) then
return False;
else
Unique (Subset'Unrestricted_Access.all, False); -- private
Unique (Of_Set'Unrestricted_Access.all, False); -- private
return Hash_Tables.Is_Subset (
Downcast (Subset.Super.Data).Table,
Downcast (Of_Set.Super.Data).Table,
Equivalent => Equivalent_Node'Access);
end if;
end Is_Subset;
function First (Container : Set) return Cursor is
begin
if Is_Empty (Container) then
return null;
else
Unique (Container'Unrestricted_Access.all, False);
return Downcast (Hash_Tables.First (
Downcast (Container.Super.Data).Table));
end if;
end First;
function Next (Position : Cursor) return Cursor is
begin
return Downcast (Position.Super.Next);
end Next;
procedure Next (Position : in out Cursor) is
begin
Position := Downcast (Position.Super.Next);
end Next;
function Find (Container : Set; Item : Element_Type) return Cursor is
begin
return Find (Container, Hash (Item), Item);
end Find;
function Contains (Container : Set; Item : Element_Type) return Boolean is
begin
return Find (Container, Item) /= null;
end Contains;
function Equivalent_Elements (Left, Right : Cursor)
return Boolean is
begin
return Equivalent_Elements (Left.Element, Right.Element);
end Equivalent_Elements;
function Equivalent_Elements (Left : Cursor; Right : Element_Type)
return Boolean is
begin
return Equivalent_Elements (Left.Element, Right);
end Equivalent_Elements;
procedure Iterate (
Container : Set'Class;
Process : not null access procedure (Position : Cursor))
is
type P1 is access procedure (Position : Cursor);
type P2 is access procedure (Position : Hash_Tables.Node_Access);
function Cast is new Unchecked_Conversion (P1, P2);
begin
if not Is_Empty (Set (Container)) then
Unique (Set (Container)'Unrestricted_Access.all, False);
Hash_Tables.Iterate (
Downcast (Container.Super.Data).Table,
Cast (Process));
end if;
end Iterate;
function Iterate (Container : Set'Class)
return Set_Iterator_Interfaces.Forward_Iterator'Class is
begin
return Set_Iterator'(First => First (Set (Container)));
end Iterate;
overriding procedure Adjust (Object : in out Set) is
begin
Copy_On_Write.Adjust (Object.Super'Access);
end Adjust;
overriding function First (Object : Set_Iterator) return Cursor is
begin
return Object.First;
end First;
overriding function Next (Object : Set_Iterator; Position : Cursor)
return Cursor
is
pragma Unreferenced (Object);
begin
return Next (Position);
end Next;
package body Generic_Keys is
type Context_Type is limited record
Left : not null access Key_Type;
end record;
pragma Suppress_Initialization (Context_Type);
function Equivalent_Key (
Position : not null Hash_Tables.Node_Access;
Params : System.Address)
return Boolean;
function Equivalent_Key (
Position : not null Hash_Tables.Node_Access;
Params : System.Address)
return Boolean
is
Context : Context_Type;
for Context'Address use Params;
begin
return Equivalent_Keys (
Context.Left.all,
Key (Downcast (Position).Element));
end Equivalent_Key;
function Key (Position : Cursor) return Key_Type is
begin
return Key (Position.Element);
end Key;
function Element (Container : Set; Key : Key_Type) return Element_Type is
begin
return Element (Find (Container, Key));
end Element;
procedure Replace (
Container : in out Set;
Key : Key_Type;
New_Item : Element_Type) is
begin
Replace_Element (Container, Find (Container, Key), New_Item);
end Replace;
procedure Exclude (Container : in out Set; Key : Key_Type) is
Position : Cursor := Find (Container, Key);
begin
if Position /= null then
Delete (Container, Position);
end if;
end Exclude;
procedure Delete (Container : in out Set; Key : Key_Type) is
Position : Cursor := Find (Container, Key);
begin
Delete (Container, Position);
end Delete;
function Find (Container : Set; Key : Key_Type) return Cursor is
begin
if Is_Empty (Container) then
return null;
else
Unique (Container'Unrestricted_Access.all, False);
declare
Context : aliased Context_Type :=
(Left => Key'Unrestricted_Access);
begin
return Downcast (Hash_Tables.Find (
Downcast (Container.Super.Data).Table,
Hash (Key),
Context'Address,
Equivalent => Equivalent_Key'Access));
end;
end if;
end Find;
function Contains (Container : Set; Key : Key_Type) return Boolean is
begin
return Find (Container, Key) /= null;
end Contains;
procedure Update_Element_Preserving_Key (
Container : in out Set;
Position : Cursor;
Process : not null access procedure (
Element : in out Element_Type)) is
begin
Process (Reference_Preserving_Key (Container, Position).Element.all);
end Update_Element_Preserving_Key;
function Reference_Preserving_Key (
Container : aliased in out Set;
Position : Cursor)
return Reference_Type is
begin
Unique (Container, True);
-- diff
return (Element => Position.all.Element'Access); -- [gcc-6] .all
end Reference_Preserving_Key;
function Constant_Reference (Container : aliased Set; Key : Key_Type)
return Constant_Reference_Type is
begin
return Constant_Reference (Container, Find (Container, Key));
end Constant_Reference;
function Reference_Preserving_Key (
Container : aliased in out Set;
Key : Key_Type)
return Reference_Type is
begin
return Reference_Preserving_Key (Container, Find (Container, Key));
end Reference_Preserving_Key;
end Generic_Keys;
package body Streaming is
procedure Read (
Stream : not null access Streams.Root_Stream_Type'Class;
Item : out Set)
is
Length : Count_Type'Base;
begin
Count_Type'Base'Read (Stream, Length);
Clear (Item);
for I in 1 .. Length loop
declare
New_Item : Element_Type;
begin
Element_Type'Read (Stream, New_Item);
Include (Item, New_Item);
end;
end loop;
end Read;
procedure Write (
Stream : not null access Streams.Root_Stream_Type'Class;
Item : Set)
is
Length : constant Count_Type := Hashed_Sets.Length (Item);
begin
Count_Type'Write (Stream, Length);
if Length > 0 then
declare
Position : Cursor := First (Item);
begin
while Position /= null loop
Element_Type'Write (Stream, Position.Element);
Next (Position);
end loop;
end;
end if;
end Write;
end Streaming;
end Ada.Containers.Hashed_Sets;
| 31.793347 | 79 | 0.60338 |
fbeea1dd06944393b72bfad80790783d79e3e289 | 194,678 | adb | Ada | tools-src/gnu/gcc/gcc/ada/g-spipat.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 80 | 2015-01-02T10:14:04.000Z | 2021-06-07T06:29:49.000Z | tools-src/gnu/gcc/gcc/ada/g-spipat.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 9 | 2015-05-14T11:03:12.000Z | 2018-01-04T07:12:58.000Z | tools-src/gnu/gcc/gcc/ada/g-spipat.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- G N A T . S P I T B O L . P A T T E R N S --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1998-2001, Ada Core Technologies, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- 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 is maintained by Ada Core Technologies Inc (http://www.gnat.com). --
-- --
------------------------------------------------------------------------------
-- Note: the data structures and general approach used in this implementation
-- are derived from the original MINIMAL sources for SPITBOL. The code is not
-- a direct translation, but the approach is followed closely. In particular,
-- we use the one stack approach developed in the SPITBOL implementation.
with Ada.Exceptions; use Ada.Exceptions;
with Ada.Strings.Maps; use Ada.Strings.Maps;
with Ada.Strings.Unbounded.Aux; use Ada.Strings.Unbounded.Aux;
with GNAT.Debug_Utilities; use GNAT.Debug_Utilities;
with System; use System;
with Unchecked_Conversion;
with Unchecked_Deallocation;
package body GNAT.Spitbol.Patterns is
------------------------
-- Internal Debugging --
------------------------
Internal_Debug : constant Boolean := False;
-- Set this flag to True to activate some built-in debugging traceback
-- These are all lines output with PutD and Put_LineD.
procedure New_LineD;
pragma Inline (New_LineD);
-- Output new blank line with New_Line if Internal_Debug is True
procedure PutD (Str : String);
pragma Inline (PutD);
-- Output string with Put if Internal_Debug is True
procedure Put_LineD (Str : String);
pragma Inline (Put_LineD);
-- Output string with Put_Line if Internal_Debug is True
-----------------------------
-- Local Type Declarations --
-----------------------------
subtype String_Ptr is Ada.Strings.Unbounded.String_Access;
subtype File_Ptr is Ada.Text_IO.File_Access;
function To_PE_Ptr is new Unchecked_Conversion (Address, PE_Ptr);
function To_Address is new Unchecked_Conversion (PE_Ptr, Address);
-- Used only for debugging output purposes
subtype AFC is Ada.Finalization.Controlled;
N : constant PE_Ptr := null;
-- Shorthand used to initialize Copy fields to null
type Character_Ptr is access all Character;
type Natural_Ptr is access all Natural;
type Pattern_Ptr is access all Pattern;
--------------------------------------------------
-- Description of Algorithm and Data Structures --
--------------------------------------------------
-- A pattern structure is represented as a linked graph of nodes
-- with the following structure:
-- +------------------------------------+
-- I Pcode I
-- +------------------------------------+
-- I Index I
-- +------------------------------------+
-- I Pthen I
-- +------------------------------------+
-- I parameter(s) I
-- +------------------------------------+
-- Pcode is a code value indicating the type of the patterm node. This
-- code is used both as the discriminant value for the record, and as
-- the case index in the main match routine that branches to the proper
-- match code for the given element.
-- Index is a serial index number. The use of these serial index
-- numbers is described in a separate section.
-- Pthen is a pointer to the successor node, i.e the node to be matched
-- if the attempt to match the node succeeds. If this is the last node
-- of the pattern to be matched, then Pthen points to a dummy node
-- of kind PC_EOP (end of pattern), which initiales pattern exit.
-- The parameter or parameters are present for certain node types,
-- and the type varies with the pattern code.
type Pattern_Code is (
PC_Arb_Y,
PC_Assign,
PC_Bal,
PC_BreakX_X,
PC_Cancel,
PC_EOP,
PC_Fail,
PC_Fence,
PC_Fence_X,
PC_Fence_Y,
PC_R_Enter,
PC_R_Remove,
PC_R_Restore,
PC_Rest,
PC_Succeed,
PC_Unanchored,
PC_Alt,
PC_Arb_X,
PC_Arbno_S,
PC_Arbno_X,
PC_Rpat,
PC_Pred_Func,
PC_Assign_Imm,
PC_Assign_OnM,
PC_Any_VP,
PC_Break_VP,
PC_BreakX_VP,
PC_NotAny_VP,
PC_NSpan_VP,
PC_Span_VP,
PC_String_VP,
PC_Write_Imm,
PC_Write_OnM,
PC_Null,
PC_String,
PC_String_2,
PC_String_3,
PC_String_4,
PC_String_5,
PC_String_6,
PC_Setcur,
PC_Any_CH,
PC_Break_CH,
PC_BreakX_CH,
PC_Char,
PC_NotAny_CH,
PC_NSpan_CH,
PC_Span_CH,
PC_Any_CS,
PC_Break_CS,
PC_BreakX_CS,
PC_NotAny_CS,
PC_NSpan_CS,
PC_Span_CS,
PC_Arbno_Y,
PC_Len_Nat,
PC_Pos_Nat,
PC_RPos_Nat,
PC_RTab_Nat,
PC_Tab_Nat,
PC_Pos_NF,
PC_Len_NF,
PC_RPos_NF,
PC_RTab_NF,
PC_Tab_NF,
PC_Pos_NP,
PC_Len_NP,
PC_RPos_NP,
PC_RTab_NP,
PC_Tab_NP,
PC_Any_VF,
PC_Break_VF,
PC_BreakX_VF,
PC_NotAny_VF,
PC_NSpan_VF,
PC_Span_VF,
PC_String_VF);
type IndexT is range 0 .. +(2 **15 - 1);
type PE (Pcode : Pattern_Code) is record
Index : IndexT;
-- Serial index number of pattern element within pattern.
Pthen : PE_Ptr;
-- Successor element, to be matched after this one
case Pcode is
when PC_Arb_Y |
PC_Assign |
PC_Bal |
PC_BreakX_X |
PC_Cancel |
PC_EOP |
PC_Fail |
PC_Fence |
PC_Fence_X |
PC_Fence_Y |
PC_Null |
PC_R_Enter |
PC_R_Remove |
PC_R_Restore |
PC_Rest |
PC_Succeed |
PC_Unanchored => null;
when PC_Alt |
PC_Arb_X |
PC_Arbno_S |
PC_Arbno_X => Alt : PE_Ptr;
when PC_Rpat => PP : Pattern_Ptr;
when PC_Pred_Func => BF : Boolean_Func;
when PC_Assign_Imm |
PC_Assign_OnM |
PC_Any_VP |
PC_Break_VP |
PC_BreakX_VP |
PC_NotAny_VP |
PC_NSpan_VP |
PC_Span_VP |
PC_String_VP => VP : VString_Ptr;
when PC_Write_Imm |
PC_Write_OnM => FP : File_Ptr;
when PC_String => Str : String_Ptr;
when PC_String_2 => Str2 : String (1 .. 2);
when PC_String_3 => Str3 : String (1 .. 3);
when PC_String_4 => Str4 : String (1 .. 4);
when PC_String_5 => Str5 : String (1 .. 5);
when PC_String_6 => Str6 : String (1 .. 6);
when PC_Setcur => Var : Natural_Ptr;
when PC_Any_CH |
PC_Break_CH |
PC_BreakX_CH |
PC_Char |
PC_NotAny_CH |
PC_NSpan_CH |
PC_Span_CH => Char : Character;
when PC_Any_CS |
PC_Break_CS |
PC_BreakX_CS |
PC_NotAny_CS |
PC_NSpan_CS |
PC_Span_CS => CS : Character_Set;
when PC_Arbno_Y |
PC_Len_Nat |
PC_Pos_Nat |
PC_RPos_Nat |
PC_RTab_Nat |
PC_Tab_Nat => Nat : Natural;
when PC_Pos_NF |
PC_Len_NF |
PC_RPos_NF |
PC_RTab_NF |
PC_Tab_NF => NF : Natural_Func;
when PC_Pos_NP |
PC_Len_NP |
PC_RPos_NP |
PC_RTab_NP |
PC_Tab_NP => NP : Natural_Ptr;
when PC_Any_VF |
PC_Break_VF |
PC_BreakX_VF |
PC_NotAny_VF |
PC_NSpan_VF |
PC_Span_VF |
PC_String_VF => VF : VString_Func;
end case;
end record;
subtype PC_Has_Alt is Pattern_Code range PC_Alt .. PC_Arbno_X;
-- Range of pattern codes that has an Alt field. This is used in the
-- recursive traversals, since these links must be followed.
EOP_Element : aliased constant PE := (PC_EOP, 0, N);
-- This is the end of pattern element, and is thus the representation of
-- a null pattern. It has a zero index element since it is never placed
-- inside a pattern. Furthermore it does not need a successor, since it
-- marks the end of the pattern, so that no more successors are needed.
EOP : constant PE_Ptr := EOP_Element'Unrestricted_Access;
-- This is the end of pattern pointer, that is used in the Pthen pointer
-- of other nodes to signal end of pattern.
-- The following array is used to determine if a pattern used as an
-- argument for Arbno is eligible for treatment using the simple Arbno
-- structure (i.e. it is a pattern that is guaranteed to match at least
-- one character on success, and not to make any entries on the stack.
OK_For_Simple_Arbno :
array (Pattern_Code) of Boolean := (
PC_Any_CS |
PC_Any_CH |
PC_Any_VF |
PC_Any_VP |
PC_Char |
PC_Len_Nat |
PC_NotAny_CS |
PC_NotAny_CH |
PC_NotAny_VF |
PC_NotAny_VP |
PC_Span_CS |
PC_Span_CH |
PC_Span_VF |
PC_Span_VP |
PC_String |
PC_String_2 |
PC_String_3 |
PC_String_4 |
PC_String_5 |
PC_String_6 => True,
others => False);
-------------------------------
-- The Pattern History Stack --
-------------------------------
-- The pattern history stack is used for controlling backtracking when
-- a match fails. The idea is to stack entries that give a cursor value
-- to be restored, and a node to be reestablished as the current node to
-- attempt an appropriate rematch operation. The processing for a pattern
-- element that has rematch alternatives pushes an appropriate entry or
-- entry on to the stack, and the proceeds. If a match fails at any point,
-- the top element of the stack is popped off, resetting the cursor and
-- the match continues by accessing the node stored with this entry.
type Stack_Entry is record
Cursor : Integer;
-- Saved cursor value that is restored when this entry is popped
-- from the stack if a match attempt fails. Occasionally, this
-- field is used to store a history stack pointer instead of a
-- cursor. Such cases are noted in the documentation and the value
-- stored is negative since stack pointer values are always negative.
Node : PE_Ptr;
-- This pattern element reference is reestablished as the current
-- Node to be matched (which will attempt an appropriate rematch).
end record;
subtype Stack_Range is Integer range -Stack_Size .. -1;
type Stack_Type is array (Stack_Range) of Stack_Entry;
-- The type used for a history stack. The actual instance of the stack
-- is declared as a local variable in the Match routine, to properly
-- handle recursive calls to Match. All stack pointer values are negative
-- to distinguish them from normal cursor values.
-- Note: the pattern matching stack is used only to handle backtracking.
-- If no backtracking occurs, its entries are never accessed, and never
-- popped off, and in particular it is normal for a successful match
-- to terminate with entries on the stack that are simply discarded.
-- Note: in subsequent diagrams of the stack, we always place element
-- zero (the deepest element) at the top of the page, then build the
-- stack down on the page with the most recent (top of stack) element
-- being the bottom-most entry on the page.
-- Stack checking is handled by labeling every pattern with the maximum
-- number of stack entries that are required, so a single check at the
-- start of matching the pattern suffices. There are two exceptions.
-- First, the count does not include entries for recursive pattern
-- references. Such recursions must therefore perform a specific
-- stack check with respect to the number of stack entries required
-- by the recursive pattern that is accessed and the amount of stack
-- that remains unused.
-- Second, the count includes only one iteration of an Arbno pattern,
-- so a specific check must be made on subsequent iterations that there
-- is still enough stack space left. The Arbno node has a field that
-- records the number of stack entries required by its argument for
-- this purpose.
---------------------------------------------------
-- Use of Serial Index Field in Pattern Elements --
---------------------------------------------------
-- The serial index numbers for the pattern elements are assigned as
-- a pattern is consructed from its constituent elements. Note that there
-- is never any sharing of pattern elements between patterns (copies are
-- always made), so the serial index numbers are unique to a particular
-- pattern as referenced from the P field of a value of type Pattern.
-- The index numbers meet three separate invariants, which are used for
-- various purposes as described in this section.
-- First, the numbers uniquely identify the pattern elements within a
-- pattern. If Num is the number of elements in a given pattern, then
-- the serial index numbers for the elements of this pattern will range
-- from 1 .. Num, so that each element has a separate value.
-- The purpose of this assignment is to provide a convenient auxiliary
-- data structure mechanism during operations which must traverse a
-- pattern (e.g. copy and finalization processing). Once constructed
-- patterns are strictly read only. This is necessary to allow sharing
-- of patterns between tasks. This means that we cannot go marking the
-- pattern (e.g. with a visited bit). Instead we cosntuct a separate
-- vector that contains the necessary information indexed by the Index
-- values in the pattern elements. For this purpose the only requirement
-- is that they be uniquely assigned.
-- Second, the pattern element referenced directly, i.e. the leading
-- pattern element, is always the maximum numbered element and therefore
-- indicates the total number of elements in the pattern. More precisely,
-- the element referenced by the P field of a pattern value, or the
-- element returned by any of the internal pattern construction routines
-- in the body (that return a value of type PE_Ptr) always is this
-- maximum element,
-- The purpose of this requirement is to allow an immediate determination
-- of the number of pattern elements within a pattern. This is used to
-- properly size the vectors used to contain auxiliary information for
-- traversal as described above.
-- Third, as compound pattern structures are constructed, the way in which
-- constituent parts of the pattern are constructed is stylized. This is
-- an automatic consequence of the way that these compounjd structures
-- are constructed, and basically what we are doing is simply documenting
-- and specifying the natural result of the pattern construction. The
-- section describing compound pattern structures gives details of the
-- numbering of each compound pattern structure.
-- The purpose of specifying the stylized numbering structures for the
-- compound patterns is to help simplify the processing in the Image
-- function, since it eases the task of retrieving the original recursive
-- structure of the pattern from the flat graph structure of elements.
-- This use in the Image function is the only point at which the code
-- makes use of the stylized structures.
type Ref_Array is array (IndexT range <>) of PE_Ptr;
-- This type is used to build an array whose N'th entry references the
-- element in a pattern whose Index value is N. See Build_Ref_Array.
procedure Build_Ref_Array (E : PE_Ptr; RA : out Ref_Array);
-- Given a pattern element which is the leading element of a pattern
-- structure, and a Ref_Array with bounds 1 .. E.Index, fills in the
-- Ref_Array so that its N'th entry references the element of the
-- referenced pattern whose Index value is N.
-------------------------------
-- Recursive Pattern Matches --
-------------------------------
-- The pattern primitive (+P) where P is a Pattern_Ptr or Pattern_Func
-- causes a recursive pattern match. This cannot be handled by an actual
-- recursive call to the outer level Match routine, since this would not
-- allow for possible backtracking into the region matched by the inner
-- pattern. Indeed this is the classical clash between recursion and
-- backtracking, and a simple recursive stack structure does not suffice.
-- This section describes how this recursion and the possible associated
-- backtracking is handled. We still use a single stack, but we establish
-- the concept of nested regions on this stack, each of which has a stack
-- base value pointing to the deepest stack entry of the region. The base
-- value for the outer level is zero.
-- When a recursive match is established, two special stack entries are
-- made. The first entry is used to save the original node that starts
-- the recursive match. This is saved so that the successor field of
-- this node is accessible at the end of the match, but it is never
-- popped and executed.
-- The second entry corresponds to a standard new region action. A
-- PC_R_Remove node is stacked, whose cursor field is used to store
-- the outer stack base, and the stack base is reset to point to
-- this PC_R_Remove node. Then the recursive pattern is matched and
-- it can make history stack entries in the normal matter, so now
-- the stack looks like:
-- (stack entries made by outer level)
-- (Special entry, node is (+P) successor
-- cursor entry is not used)
-- (PC_R_Remove entry, "cursor" value is (negative) <-- Stack base
-- saved base value for the enclosing region)
-- (stack entries made by inner level)
-- If a subsequent failure occurs and pops the PC_R_Remove node, it
-- removes itself and the special entry immediately underneath it,
-- restores the stack base value for the enclosing region, and then
-- again signals failure to look for alternatives that were stacked
-- before the recursion was initiated.
-- Now we need to consider what happens if the inner pattern succeeds, as
-- signalled by accessing the special PC_EOP pattern primitive. First we
-- recognize the nested case by looking at the Base value. If this Base
-- value is Stack'First, then the entire match has succeeded, but if the
-- base value is greater than Stack'First, then we have successfully
-- matched an inner pattern, and processing continues at the outer level.
-- There are two cases. The simple case is when the inner pattern has made
-- no stack entries, as recognized by the fact that the current stack
-- pointer is equal to the current base value. In this case it is fine to
-- remove all trace of the recursion by restoring the outer base value and
-- using the special entry to find the appropriate successor node.
-- The more complex case arises when the inner match does make stack
-- entries. In this case, the PC_EOP processing stacks a special entry
-- whose cursor value saves the saved inner base value (the one that
-- references the corresponding PC_R_Remove value), and whose node
-- pointer references a PC_R_Restore node, so the stack looks like:
-- (stack entries made by outer level)
-- (Special entry, node is (+P) successor,
-- cursor entry is not used)
-- (PC_R_Remove entry, "cursor" value is (negative)
-- saved base value for the enclosing region)
-- (stack entries made by inner level)
-- (PC_Region_Replace entry, "cursor" value is (negative)
-- stack pointer value referencing the PC_R_Remove entry).
-- If the entire match succeeds, then these stack entries are, as usual,
-- ignored and abandoned. If on the other hand a subsequent failure
-- causes the PC_Region_Replace entry to be popped, it restores the
-- inner base value from its saved "cursor" value and then fails again.
-- Note that it is OK that the cursor is temporarily clobbered by this
-- pop, since the second failure will reestablish a proper cursor value.
---------------------------------
-- Compound Pattern Structures --
---------------------------------
-- This section discusses the compound structures used to represent
-- constructed patterns. It shows the graph structures of pattern
-- elements that are constructed, and in the case of patterns that
-- provide backtracking possibilities, describes how the history
-- stack is used to control the backtracking. Finally, it notes the
-- way in which the Index numbers are assigned to the structure.
-- In all diagrams, solid lines (built witth minus signs or vertical
-- bars, represent successor pointers (Pthen fields) with > or V used
-- to indicate the direction of the pointer. The initial node of the
-- structure is in the upper left of the diagram. A dotted line is an
-- alternative pointer from the element above it to the element below
-- it. See individual sections for details on how alternatives are used.
-------------------
-- Concatenation --
-------------------
-- In the pattern structures listed in this section, a line that looks
-- lile ----> with nothing to the right indicates an end of pattern
-- (EOP) pointer that represents the end of the match.
-- When a pattern concatenation (L & R) occurs, the resulting structure
-- is obtained by finding all such EOP pointers in L, and replacing
-- them to point to R. This is the most important flattening that
-- occurs in constructing a pattern, and it means that the pattern
-- matching circuitry does not have to keep track of the structure
-- of a pattern with respect to concatenation, since the appropriate
-- successor is always at hand.
-- Concatenation itself generates no additional possibilities for
-- backtracking, but the constituent patterns of the concatenated
-- structure will make stack entries as usual. The maximum amount
-- of stack required by the structure is thus simply the sum of the
-- maximums required by L and R.
-- The index numbering of a concatenation structure works by leaving
-- the numbering of the right hand pattern, R, unchanged and adjusting
-- the numbers in the left hand pattern, L up by the count of elements
-- in R. This ensures that the maximum numbered element is the leading
-- element as required (given that it was the leading element in L).
-----------------
-- Alternation --
-----------------
-- A pattern (L or R) constructs the structure:
-- +---+ +---+
-- | A |---->| L |---->
-- +---+ +---+
-- .
-- .
-- +---+
-- | R |---->
-- +---+
-- The A element here is a PC_Alt node, and the dotted line represents
-- the contents of the Alt field. When the PC_Alt element is matched,
-- it stacks a pointer to the leading element of R on the history stack
-- so that on subsequent failure, a match of R is attempted.
-- The A node is the higest numbered element in the pattern. The
-- original index numbers of R are unchanged, but the index numbers
-- of the L pattern are adjusted up by the count of elements in R.
-- Note that the difference between the index of the L leading element
-- the index of the R leading element (after building the alt structure)
-- indicates the number of nodes in L, and this is true even after the
-- structure is incorporated into some larger structure. For example,
-- if the A node has index 16, and L has index 15 and R has index
-- 5, then we know that L has 10 (15-5) elements in it.
-- Suppose that we now concatenate this structure to another pattern
-- with 9 elements in it. We will now have the A node with an index
-- of 25, L with an index of 24 and R with an index of 14. We still
-- know that L has 10 (24-14) elements in it, numbered 15-24, and
-- consequently the successor of the alternation structure has an
-- index with a value less than 15. This is used in Image to figure
-- out the original recursive structure of a pattern.
-- To clarify the interaction of the alternation and concatenation
-- structures, here is a more complex example of the structure built
-- for the pattern:
-- (V or W or X) (Y or Z)
-- where A,B,C,D,E are all single element patterns:
-- +---+ +---+ +---+ +---+
-- I A I---->I V I---+-->I A I---->I Y I---->
-- +---+ +---+ I +---+ +---+
-- . I .
-- . I .
-- +---+ +---+ I +---+
-- I A I---->I W I-->I I Z I---->
-- +---+ +---+ I +---+
-- . I
-- . I
-- +---+ I
-- I X I------------>+
-- +---+
-- The numbering of the nodes would be as follows:
-- +---+ +---+ +---+ +---+
-- I 8 I---->I 7 I---+-->I 3 I---->I 2 I---->
-- +---+ +---+ I +---+ +---+
-- . I .
-- . I .
-- +---+ +---+ I +---+
-- I 6 I---->I 5 I-->I I 1 I---->
-- +---+ +---+ I +---+
-- . I
-- . I
-- +---+ I
-- I 4 I------------>+
-- +---+
-- Note: The above structure actually corresponds to
-- (A or (B or C)) (D or E)
-- rather than
-- ((A or B) or C) (D or E)
-- which is the more natural interpretation, but in fact alternation
-- is associative, and the construction of an alternative changes the
-- left grouped pattern to the right grouped pattern in any case, so
-- that the Image function produces a more natural looking output.
---------
-- Arb --
---------
-- An Arb pattern builds the structure
-- +---+
-- | X |---->
-- +---+
-- .
-- .
-- +---+
-- | Y |---->
-- +---+
-- The X node is a PC_Arb_X node, which matches null, and stacks a
-- pointer to Y node, which is the PC_Arb_Y node that matches one
-- extra character and restacks itself.
-- The PC_Arb_X node is numbered 2, and the PC_Arb_Y node is 1.
-------------------------
-- Arbno (simple case) --
-------------------------
-- The simple form of Arbno can be used where the pattern always
-- matches at least one character if it succeeds, and it is known
-- not to make any history stack entries. In this case, Arbno (P)
-- can construct the following structure:
-- +-------------+
-- | ^
-- V |
-- +---+ |
-- | S |----> |
-- +---+ |
-- . |
-- . |
-- +---+ |
-- | P |---------->+
-- +---+
-- The S (PC_Arbno_S) node matches null stacking a pointer to the
-- pattern P. If a subsequent failure causes P to be matched and
-- this match succeeds, then node A gets restacked to try another
-- instance if needed by a subsequent failure.
-- The node numbering of the constituent pattern P is not affected.
-- The S node has a node number of P.Index + 1.
--------------------------
-- Arbno (complex case) --
--------------------------
-- A call to Arbno (P), where P can match null (or at least is not
-- known to require a non-null string) and/or P requires pattern stack
-- entries, constructs the following structure:
-- +--------------------------+
-- | ^
-- V |
-- +---+ |
-- | X |----> |
-- +---+ |
-- . |
-- . |
-- +---+ +---+ +---+ |
-- | E |---->| P |---->| Y |--->+
-- +---+ +---+ +---+
-- The node X (PC_Arbno_X) matches null, stacking a pointer to the
-- E-P-X structure used to match one Arbno instance.
-- Here E is the PC_R_Enter node which matches null and creates two
-- stack entries. The first is a special entry whose node field is
-- not used at all, and whose cursor field has the initial cursor.
-- The second entry corresponds to a standard new region action. A
-- PC_R_Remove node is stacked, whose cursor field is used to store
-- the outer stack base, and the stack base is reset to point to
-- this PC_R_Remove node. Then the pattern P is matched, and it can
-- make history stack entries in the normal manner, so now the stack
-- looks like:
-- (stack entries made before assign pattern)
-- (Special entry, node field not used,
-- used only to save initial cursor)
-- (PC_R_Remove entry, "cursor" value is (negative) <-- Stack Base
-- saved base value for the enclosing region)
-- (stack entries made by matching P)
-- If the match of P fails, then the PC_R_Remove entry is popped and
-- it removes both itself and the special entry underneath it,
-- restores the outer stack base, and signals failure.
-- If the match of P succeeds, then node Y, the PC_Arbno_Y node, pops
-- the inner region. There are two possibilities. If matching P left
-- no stack entries, then all traces of the inner region can be removed.
-- If there are stack entries, then we push an PC_Region_Replace stack
-- entry whose "cursor" value is the inner stack base value, and then
-- restore the outer stack base value, so the stack looks like:
-- (stack entries made before assign pattern)
-- (Special entry, node field not used,
-- used only to save initial cursor)
-- (PC_R_Remove entry, "cursor" value is (negative)
-- saved base value for the enclosing region)
-- (stack entries made by matching P)
-- (PC_Region_Replace entry, "cursor" value is (negative)
-- stack pointer value referencing the PC_R_Remove entry).
-- Now that we have matched another instance of the Arbno pattern,
-- we need to move to the successor. There are two cases. If the
-- Arbno pattern matched null, then there is no point in seeking
-- alternatives, since we would just match a whole bunch of nulls.
-- In this case we look through the alternative node, and move
-- directly to its successor (i.e. the successor of the Arbno
-- pattern). If on the other hand a non-null string was matched,
-- we simply follow the successor to the alternative node, which
-- sets up for another possible match of the Arbno pattern.
-- As noted in the section on stack checking, the stack count (and
-- hence the stack check) for a pattern includes only one iteration
-- of the Arbno pattern. To make sure that multiple iterations do not
-- overflow the stack, the Arbno node saves the stack count required
-- by a single iteration, and the Concat function increments this to
-- include stack entries required by any successor. The PC_Arbno_Y
-- node uses this count to ensure that sufficient stack remains
-- before proceeding after matching each new instance.
-- The node numbering of the constituent pattern P is not affected.
-- Where N is the number of nodes in P, the Y node is numbered N + 1,
-- the E node is N + 2, and the X node is N + 3.
----------------------
-- Assign Immediate --
----------------------
-- Immediate assignment (P * V) constructs the following structure
-- +---+ +---+ +---+
-- | E |---->| P |---->| A |---->
-- +---+ +---+ +---+
-- Here E is the PC_R_Enter node which matches null and creates two
-- stack entries. The first is a special entry whose node field is
-- not used at all, and whose cursor field has the initial cursor.
-- The second entry corresponds to a standard new region action. A
-- PC_R_Remove node is stacked, whose cursor field is used to store
-- the outer stack base, and the stack base is reset to point to
-- this PC_R_Remove node. Then the pattern P is matched, and it can
-- make history stack entries in the normal manner, so now the stack
-- looks like:
-- (stack entries made before assign pattern)
-- (Special entry, node field not used,
-- used only to save initial cursor)
-- (PC_R_Remove entry, "cursor" value is (negative) <-- Stack Base
-- saved base value for the enclosing region)
-- (stack entries made by matching P)
-- If the match of P fails, then the PC_R_Remove entry is popped
-- and it removes both itself and the special entry underneath it,
-- restores the outer stack base, and signals failure.
-- If the match of P succeeds, then node A, which is the actual
-- PC_Assign_Imm node, executes the assignment (using the stack
-- base to locate the entry with the saved starting cursor value),
-- and the pops the inner region. There are two possibilities, if
-- matching P left no stack entries, then all traces of the inner
-- region can be removed. If there are stack entries, then we push
-- an PC_Region_Replace stack entry whose "cursor" value is the
-- inner stack base value, and then restore the outer stack base
-- value, so the stack looks like:
-- (stack entries made before assign pattern)
-- (Special entry, node field not used,
-- used only to save initial cursor)
-- (PC_R_Remove entry, "cursor" value is (negative)
-- saved base value for the enclosing region)
-- (stack entries made by matching P)
-- (PC_Region_Replace entry, "cursor" value is the (negative)
-- stack pointer value referencing the PC_R_Remove entry).
-- If a subsequent failure occurs, the PC_Region_Replace node restores
-- the inner stack base value and signals failure to explore rematches
-- of the pattern P.
-- The node numbering of the constituent pattern P is not affected.
-- Where N is the number of nodes in P, the A node is numbered N + 1,
-- and the E node is N + 2.
---------------------
-- Assign On Match --
---------------------
-- The assign on match (**) pattern is quite similar to the assign
-- immediate pattern, except that the actual assignment has to be
-- delayed. The following structure is constructed:
-- +---+ +---+ +---+
-- | E |---->| P |---->| A |---->
-- +---+ +---+ +---+
-- The operation of this pattern is identical to that described above
-- for deferred assignment, up to the point where P has been matched.
-- The A node, which is the PC_Assign_OnM node first pushes a
-- PC_Assign node onto the history stack. This node saves the ending
-- cursor and acts as a flag for the final assignment, as further
-- described below.
-- It then stores a pointer to itself in the special entry node field.
-- This was otherwise unused, and is now used to retrive the address
-- of the variable to be assigned at the end of the pattern.
-- After that the inner region is terminated in the usual manner,
-- by stacking a PC_R_Restore entry as described for the assign
-- immediate case. Note that the optimization of completely
-- removing the inner region does not happen in this case, since
-- we have at least one stack entry (the PC_Assign one we just made).
-- The stack now looks like:
-- (stack entries made before assign pattern)
-- (Special entry, node points to copy of
-- the PC_Assign_OnM node, and the
-- cursor field saves the initial cursor).
-- (PC_R_Remove entry, "cursor" value is (negative)
-- saved base value for the enclosing region)
-- (stack entries made by matching P)
-- (PC_Assign entry, saves final cursor)
-- (PC_Region_Replace entry, "cursor" value is (negative)
-- stack pointer value referencing the PC_R_Remove entry).
-- If a subsequent failure causes the PC_Assign node to execute it
-- simply removes itself and propagates the failure.
-- If the match succeeds, then the history stack is scanned for
-- PC_Assign nodes, and the assignments are executed (examination
-- of the above diagram will show that all the necessary data is
-- at hand for the assignment).
-- To optimize the common case where no assign-on-match operations
-- are present, a global flag Assign_OnM is maintained which is
-- initialize to False, and gets set True as part of the execution
-- of the PC_Assign_OnM node. The scan of the history stack for
-- PC_Assign entries is done only if this flag is set.
-- The node numbering of the constituent pattern P is not affected.
-- Where N is the number of nodes in P, the A node is numbered N + 1,
-- and the E node is N + 2.
---------
-- Bal --
---------
-- Bal builds a single node:
-- +---+
-- | B |---->
-- +---+
-- The node B is the PC_Bal node which matches a parentheses balanced
-- string, starting at the current cursor position. It then updates
-- the cursor past this matched string, and stacks a pointer to itself
-- with this updated cursor value on the history stack, to extend the
-- matched string on a subequent failure.
-- Since this is a single node it is numbered 1 (the reason we include
-- it in the compound patterns section is that it backtracks).
------------
-- BreakX --
------------
-- BreakX builds the structure
-- +---+ +---+
-- | B |---->| A |---->
-- +---+ +---+
-- ^ .
-- | .
-- | +---+
-- +<------| X |
-- +---+
-- Here the B node is the BreakX_xx node that performs a normal Break
-- function. The A node is an alternative (PC_Alt) node that matches
-- null, but stacks a pointer to node X (the PC_BreakX_X node) which
-- extends the match one character (to eat up the previously detected
-- break character), and then rematches the break.
-- The B node is numbered 3, the alternative node is 1, and the X
-- node is 2.
-----------
-- Fence --
-----------
-- Fence builds a single node:
-- +---+
-- | F |---->
-- +---+
-- The element F, PC_Fence, matches null, and stacks a pointer to a
-- PC_Cancel element which will abort the match on a subsequent failure.
-- Since this is a single element it is numbered 1 (the reason we
-- include it in the compound patterns section is that it backtracks).
--------------------
-- Fence Function --
--------------------
-- A call to the Fence function builds the structure:
-- +---+ +---+ +---+
-- | E |---->| P |---->| X |---->
-- +---+ +---+ +---+
-- Here E is the PC_R_Enter node which matches null and creates two
-- stack entries. The first is a special entry which is not used at
-- all in the fence case (it is present merely for uniformity with
-- other cases of region enter operations).
-- The second entry corresponds to a standard new region action. A
-- PC_R_Remove node is stacked, whose cursor field is used to store
-- the outer stack base, and the stack base is reset to point to
-- this PC_R_Remove node. Then the pattern P is matched, and it can
-- make history stack entries in the normal manner, so now the stack
-- looks like:
-- (stack entries made before fence pattern)
-- (Special entry, not used at all)
-- (PC_R_Remove entry, "cursor" value is (negative) <-- Stack Base
-- saved base value for the enclosing region)
-- (stack entries made by matching P)
-- If the match of P fails, then the PC_R_Remove entry is popped
-- and it removes both itself and the special entry underneath it,
-- restores the outer stack base, and signals failure.
-- If the match of P succeeds, then node X, the PC_Fence_X node, gets
-- control. One might be tempted to think that at this point, the
-- history stack entries made by matching P can just be removed since
-- they certainly are not going to be used for rematching (that is
-- whole point of Fence after all!) However, this is wrong, because
-- it would result in the loss of possible assign-on-match entries
-- for deferred pattern assignments.
-- Instead what we do is to make a special entry whose node references
-- PC_Fence_Y, and whose cursor saves the inner stack base value, i.e.
-- the pointer to the PC_R_Remove entry. Then the outer stack base
-- pointer is restored, so the stack looks like:
-- (stack entries made before assign pattern)
-- (Special entry, not used at all)
-- (PC_R_Remove entry, "cursor" value is (negative)
-- saved base value for the enclosing region)
-- (stack entries made by matching P)
-- (PC_Fence_Y entry, "cursor" value is (negative) stack
-- pointer value referencing the PC_R_Remove entry).
-- If a subsequent failure occurs, then the PC_Fence_Y entry removes
-- the entire inner region, including all entries made by matching P,
-- and alternatives prior to the Fence pattern are sought.
-- The node numbering of the constituent pattern P is not affected.
-- Where N is the number of nodes in P, the X node is numbered N + 1,
-- and the E node is N + 2.
-------------
-- Succeed --
-------------
-- Succeed builds a single node:
-- +---+
-- | S |---->
-- +---+
-- The node S is the PC_Succeed node which matches null, and stacks
-- a pointer to itself on the history stack, so that a subsequent
-- failure repeats the same match.
-- Since this is a single node it is numbered 1 (the reason we include
-- it in the compound patterns section is that it backtracks).
---------------------
-- Write Immediate --
---------------------
-- The structure built for a write immediate operation (P * F, where
-- F is a file access value) is:
-- +---+ +---+ +---+
-- | E |---->| P |---->| W |---->
-- +---+ +---+ +---+
-- Here E is the PC_R_Enter node and W is the PC_Write_Imm node. The
-- handling is identical to that described above for Assign Immediate,
-- except that at the point where a successful match occurs, the matched
-- substring is written to the referenced file.
-- The node numbering of the constituent pattern P is not affected.
-- Where N is the number of nodes in P, the W node is numbered N + 1,
-- and the E node is N + 2.
--------------------
-- Write On Match --
--------------------
-- The structure built for a write on match operation (P ** F, where
-- F is a file access value) is:
-- +---+ +---+ +---+
-- | E |---->| P |---->| W |---->
-- +---+ +---+ +---+
-- Here E is the PC_R_Enter node and W is the PC_Write_OnM node. The
-- handling is identical to that described above for Assign On Match,
-- except that at the point where a successful match has completed,
-- the matched substring is written to the referenced file.
-- The node numbering of the constituent pattern P is not affected.
-- Where N is the number of nodes in P, the W node is numbered N + 1,
-- and the E node is N + 2.
-----------------------
-- Constant Patterns --
-----------------------
-- The following pattern elements are referenced only from the pattern
-- history stack. In each case the processing for the pattern element
-- results in pattern match abort, or futher failure, so there is no
-- need for a successor and no need for a node number
CP_Assign : aliased PE := (PC_Assign, 0, N);
CP_Cancel : aliased PE := (PC_Cancel, 0, N);
CP_Fence_Y : aliased PE := (PC_Fence_Y, 0, N);
CP_R_Remove : aliased PE := (PC_R_Remove, 0, N);
CP_R_Restore : aliased PE := (PC_R_Restore, 0, N);
-----------------------
-- Local Subprograms --
-----------------------
function Alternate (L, R : PE_Ptr) return PE_Ptr;
function "or" (L, R : PE_Ptr) return PE_Ptr renames Alternate;
-- Build pattern structure corresponding to the alternation of L, R.
-- (i.e. try to match L, and if that fails, try to match R).
function Arbno_Simple (P : PE_Ptr) return PE_Ptr;
-- Build simple Arbno pattern, P is a pattern that is guaranteed to
-- match at least one character if it succeeds and to require no
-- stack entries under all circumstances. The result returned is
-- a simple Arbno structure as previously described.
function Bracket (E, P, A : PE_Ptr) return PE_Ptr;
-- Given two single node pattern elements E and A, and a (possible
-- complex) pattern P, construct the concatenation E-->P-->A and
-- return a pointer to E. The concatenation does not affect the
-- node numbering in P. A has a number one higher than the maximum
-- number in P, and E has a number two higher than the maximum
-- number in P (see for example the Assign_Immediate structure to
-- understand a typical use of this function).
function BreakX_Make (B : PE_Ptr) return Pattern;
-- Given a pattern element for a Break patternx, returns the
-- corresponding BreakX compound pattern structure.
function Concat (L, R : PE_Ptr; Incr : Natural) return PE_Ptr;
-- Creates a pattern eelement that represents a concatenation of the
-- two given pattern elements (i.e. the pattern L followed by R).
-- The result returned is always the same as L, but the pattern
-- referenced by L is modified to have R as a successor. This
-- procedure does not copy L or R, so if a copy is required, it
-- is the responsibility of the caller. The Incr parameter is an
-- amount to be added to the Nat field of any P_Arbno_Y node that is
-- in the left operand, it represents the additional stack space
-- required by the right operand.
function "&" (L, R : PE_Ptr) return PE_Ptr;
pragma Inline ("&");
-- Equivalent to Concat (L, R, 0)
function C_To_PE (C : PChar) return PE_Ptr;
-- Given a character, constructs a pattern element that matches
-- the single character.
function Copy (P : PE_Ptr) return PE_Ptr;
-- Creates a copy of the pattern element referenced by the given
-- pattern element reference. This is a deep copy, which means that
-- it follows the Next and Alt pointers.
function Image (P : PE_Ptr) return String;
-- Returns the image of the address of the referenced pattern element.
-- This is equivalent to Image (To_Address (P));
function Is_In (C : Character; Str : String) return Boolean;
pragma Inline (Is_In);
-- Determines if the character C is in string Str.
procedure Logic_Error;
-- Called to raise Program_Error with an appropriate message if an
-- internal logic error is detected.
function Str_BF (A : Boolean_Func) return String;
function Str_FP (A : File_Ptr) return String;
function Str_NF (A : Natural_Func) return String;
function Str_NP (A : Natural_Ptr) return String;
function Str_PP (A : Pattern_Ptr) return String;
function Str_VF (A : VString_Func) return String;
function Str_VP (A : VString_Ptr) return String;
-- These are debugging routines, which return a representation of the
-- given access value (they are called only by Image and Dump)
procedure Set_Successor (Pat : PE_Ptr; Succ : PE_Ptr);
-- Adjusts all EOP pointers in Pat to point to Succ. No other changes
-- are made. In particular, Succ is unchanged, and no index numbers
-- are modified. Note that Pat may not be equal to EOP on entry.
function S_To_PE (Str : PString) return PE_Ptr;
-- Given a string, constructs a pattern element that matches the string
procedure Uninitialized_Pattern;
pragma No_Return (Uninitialized_Pattern);
-- Called to raise Program_Error with an appropriate error message if
-- an uninitialized pattern is used in any pattern construction or
-- pattern matching operation.
procedure XMatch
(Subject : String;
Pat_P : PE_Ptr;
Pat_S : Natural;
Start : out Natural;
Stop : out Natural);
-- This is the common pattern match routine. It is passed a string and
-- a pattern, and it indicates success or failure, and on success the
-- section of the string matched. It does not perform any assignments
-- to the subject string, so pattern replacement is for the caller.
--
-- Subject The subject string. The lower bound is always one. In the
-- Match procedures, it is fine to use strings whose lower bound
-- is not one, but we perform a one time conversion before the
-- call to XMatch, so that XMatch does not have to be bothered
-- with strange lower bounds.
--
-- Pat_P Points to initial pattern element of pattern to be matched
--
-- Pat_S Maximum required stack entries for pattern to be matched
--
-- Start If match is successful, starting index of matched section.
-- This value is always non-zero. A value of zero is used to
-- indicate a failed match.
--
-- Stop If match is successful, ending index of matched section.
-- This can be zero if we match the null string at the start,
-- in which case Start is set to zero, and Stop to one. If the
-- Match fails, then the contents of Stop is undefined.
procedure XMatchD
(Subject : String;
Pat_P : PE_Ptr;
Pat_S : Natural;
Start : out Natural;
Stop : out Natural);
-- Identical in all respects to XMatch, except that trace information is
-- output on Standard_Output during execution of the match. This is the
-- version that is called if the original Match call has Debug => True.
---------
-- "&" --
---------
function "&" (L : PString; R : Pattern) return Pattern is
begin
return (AFC with R.Stk, Concat (S_To_PE (L), Copy (R.P), R.Stk));
end "&";
function "&" (L : Pattern; R : PString) return Pattern is
begin
return (AFC with L.Stk, Concat (Copy (L.P), S_To_PE (R), 0));
end "&";
function "&" (L : PChar; R : Pattern) return Pattern is
begin
return (AFC with R.Stk, Concat (C_To_PE (L), Copy (R.P), R.Stk));
end "&";
function "&" (L : Pattern; R : PChar) return Pattern is
begin
return (AFC with L.Stk, Concat (Copy (L.P), C_To_PE (R), 0));
end "&";
function "&" (L : Pattern; R : Pattern) return Pattern is
begin
return (AFC with L.Stk + R.Stk, Concat (Copy (L.P), Copy (R.P), R.Stk));
end "&";
function "&" (L, R : PE_Ptr) return PE_Ptr is
begin
return Concat (L, R, 0);
end "&";
---------
-- "*" --
---------
-- Assign immediate
-- +---+ +---+ +---+
-- | E |---->| P |---->| A |---->
-- +---+ +---+ +---+
-- The node numbering of the constituent pattern P is not affected.
-- Where N is the number of nodes in P, the A node is numbered N + 1,
-- and the E node is N + 2.
function "*" (P : Pattern; Var : VString_Var) return Pattern is
Pat : constant PE_Ptr := Copy (P.P);
E : constant PE_Ptr := new PE'(PC_R_Enter, 0, EOP);
A : constant PE_Ptr :=
new PE'(PC_Assign_Imm, 0, EOP, Var'Unrestricted_Access);
begin
return (AFC with P.Stk + 3, Bracket (E, Pat, A));
end "*";
function "*" (P : PString; Var : VString_Var) return Pattern is
Pat : constant PE_Ptr := S_To_PE (P);
E : constant PE_Ptr := new PE'(PC_R_Enter, 0, EOP);
A : constant PE_Ptr :=
new PE'(PC_Assign_Imm, 0, EOP, Var'Unrestricted_Access);
begin
return (AFC with 3, Bracket (E, Pat, A));
end "*";
function "*" (P : PChar; Var : VString_Var) return Pattern is
Pat : constant PE_Ptr := C_To_PE (P);
E : constant PE_Ptr := new PE'(PC_R_Enter, 0, EOP);
A : constant PE_Ptr :=
new PE'(PC_Assign_Imm, 0, EOP, Var'Unrestricted_Access);
begin
return (AFC with 3, Bracket (E, Pat, A));
end "*";
-- Write immediate
-- +---+ +---+ +---+
-- | E |---->| P |---->| W |---->
-- +---+ +---+ +---+
-- The node numbering of the constituent pattern P is not affected.
-- Where N is the number of nodes in P, the W node is numbered N + 1,
-- and the E node is N + 2.
function "*" (P : Pattern; Fil : File_Access) return Pattern is
Pat : constant PE_Ptr := Copy (P.P);
E : constant PE_Ptr := new PE'(PC_R_Enter, 0, EOP);
W : constant PE_Ptr := new PE'(PC_Write_Imm, 0, EOP, Fil);
begin
return (AFC with 3, Bracket (E, Pat, W));
end "*";
function "*" (P : PString; Fil : File_Access) return Pattern is
Pat : constant PE_Ptr := S_To_PE (P);
E : constant PE_Ptr := new PE'(PC_R_Enter, 0, EOP);
W : constant PE_Ptr := new PE'(PC_Write_Imm, 0, EOP, Fil);
begin
return (AFC with 3, Bracket (E, Pat, W));
end "*";
function "*" (P : PChar; Fil : File_Access) return Pattern is
Pat : constant PE_Ptr := C_To_PE (P);
E : constant PE_Ptr := new PE'(PC_R_Enter, 0, EOP);
W : constant PE_Ptr := new PE'(PC_Write_Imm, 0, EOP, Fil);
begin
return (AFC with 3, Bracket (E, Pat, W));
end "*";
----------
-- "**" --
----------
-- Assign on match
-- +---+ +---+ +---+
-- | E |---->| P |---->| A |---->
-- +---+ +---+ +---+
-- The node numbering of the constituent pattern P is not affected.
-- Where N is the number of nodes in P, the A node is numbered N + 1,
-- and the E node is N + 2.
function "**" (P : Pattern; Var : VString_Var) return Pattern is
Pat : constant PE_Ptr := Copy (P.P);
E : constant PE_Ptr := new PE'(PC_R_Enter, 0, EOP);
A : constant PE_Ptr :=
new PE'(PC_Assign_OnM, 0, EOP, Var'Unrestricted_Access);
begin
return (AFC with P.Stk + 3, Bracket (E, Pat, A));
end "**";
function "**" (P : PString; Var : VString_Var) return Pattern is
Pat : constant PE_Ptr := S_To_PE (P);
E : constant PE_Ptr := new PE'(PC_R_Enter, 0, EOP);
A : constant PE_Ptr :=
new PE'(PC_Assign_OnM, 0, EOP, Var'Unrestricted_Access);
begin
return (AFC with 3, Bracket (E, Pat, A));
end "**";
function "**" (P : PChar; Var : VString_Var) return Pattern is
Pat : constant PE_Ptr := C_To_PE (P);
E : constant PE_Ptr := new PE'(PC_R_Enter, 0, EOP);
A : constant PE_Ptr :=
new PE'(PC_Assign_OnM, 0, EOP, Var'Unrestricted_Access);
begin
return (AFC with 3, Bracket (E, Pat, A));
end "**";
-- Write on match
-- +---+ +---+ +---+
-- | E |---->| P |---->| W |---->
-- +---+ +---+ +---+
-- The node numbering of the constituent pattern P is not affected.
-- Where N is the number of nodes in P, the W node is numbered N + 1,
-- and the E node is N + 2.
function "**" (P : Pattern; Fil : File_Access) return Pattern is
Pat : constant PE_Ptr := Copy (P.P);
E : constant PE_Ptr := new PE'(PC_R_Enter, 0, EOP);
W : constant PE_Ptr := new PE'(PC_Write_OnM, 0, EOP, Fil);
begin
return (AFC with P.Stk + 3, Bracket (E, Pat, W));
end "**";
function "**" (P : PString; Fil : File_Access) return Pattern is
Pat : constant PE_Ptr := S_To_PE (P);
E : constant PE_Ptr := new PE'(PC_R_Enter, 0, EOP);
W : constant PE_Ptr := new PE'(PC_Write_OnM, 0, EOP, Fil);
begin
return (AFC with 3, Bracket (E, Pat, W));
end "**";
function "**" (P : PChar; Fil : File_Access) return Pattern is
Pat : constant PE_Ptr := C_To_PE (P);
E : constant PE_Ptr := new PE'(PC_R_Enter, 0, EOP);
W : constant PE_Ptr := new PE'(PC_Write_OnM, 0, EOP, Fil);
begin
return (AFC with 3, Bracket (E, Pat, W));
end "**";
---------
-- "+" --
---------
function "+" (Str : VString_Var) return Pattern is
begin
return
(AFC with 0,
new PE'(PC_String_VP, 1, EOP, Str'Unrestricted_Access));
end "+";
function "+" (Str : VString_Func) return Pattern is
begin
return (AFC with 0, new PE'(PC_String_VF, 1, EOP, Str));
end "+";
function "+" (P : Pattern_Var) return Pattern is
begin
return
(AFC with 3,
new PE'(PC_Rpat, 1, EOP, P'Unrestricted_Access));
end "+";
function "+" (P : Boolean_Func) return Pattern is
begin
return (AFC with 3, new PE'(PC_Pred_Func, 1, EOP, P));
end "+";
----------
-- "or" --
----------
function "or" (L : PString; R : Pattern) return Pattern is
begin
return (AFC with R.Stk + 1, S_To_PE (L) or Copy (R.P));
end "or";
function "or" (L : Pattern; R : PString) return Pattern is
begin
return (AFC with L.Stk + 1, Copy (L.P) or S_To_PE (R));
end "or";
function "or" (L : PString; R : PString) return Pattern is
begin
return (AFC with 1, S_To_PE (L) or S_To_PE (R));
end "or";
function "or" (L : Pattern; R : Pattern) return Pattern is
begin
return (AFC with
Natural'Max (L.Stk, R.Stk) + 1, Copy (L.P) or Copy (R.P));
end "or";
function "or" (L : PChar; R : Pattern) return Pattern is
begin
return (AFC with 1, C_To_PE (L) or Copy (R.P));
end "or";
function "or" (L : Pattern; R : PChar) return Pattern is
begin
return (AFC with 1, Copy (L.P) or C_To_PE (R));
end "or";
function "or" (L : PChar; R : PChar) return Pattern is
begin
return (AFC with 1, C_To_PE (L) or C_To_PE (R));
end "or";
function "or" (L : PString; R : PChar) return Pattern is
begin
return (AFC with 1, S_To_PE (L) or C_To_PE (R));
end "or";
function "or" (L : PChar; R : PString) return Pattern is
begin
return (AFC with 1, C_To_PE (L) or S_To_PE (R));
end "or";
------------
-- Adjust --
------------
-- No two patterns share the same pattern elements, so the adjust
-- procedure for a Pattern assignment must do a deep copy of the
-- pattern element structure.
procedure Adjust (Object : in out Pattern) is
begin
Object.P := Copy (Object.P);
end Adjust;
---------------
-- Alternate --
---------------
function Alternate (L, R : PE_Ptr) return PE_Ptr is
begin
-- If the left pattern is null, then we just add the alternation
-- node with an index one greater than the right hand pattern.
if L = EOP then
return new PE'(PC_Alt, R.Index + 1, EOP, R);
-- If the left pattern is non-null, then build a reference vector
-- for its elements, and adjust their index values to acccomodate
-- the right hand elements. Then add the alternation node.
else
declare
Refs : Ref_Array (1 .. L.Index);
begin
Build_Ref_Array (L, Refs);
for J in Refs'Range loop
Refs (J).Index := Refs (J).Index + R.Index;
end loop;
end;
return new PE'(PC_Alt, L.Index + 1, L, R);
end if;
end Alternate;
---------
-- Any --
---------
function Any (Str : String) return Pattern is
begin
return (AFC with 0, new PE'(PC_Any_CS, 1, EOP, To_Set (Str)));
end Any;
function Any (Str : VString) return Pattern is
begin
return Any (S (Str));
end Any;
function Any (Str : Character) return Pattern is
begin
return (AFC with 0, new PE'(PC_Any_CH, 1, EOP, Str));
end Any;
function Any (Str : Character_Set) return Pattern is
begin
return (AFC with 0, new PE'(PC_Any_CS, 1, EOP, Str));
end Any;
function Any (Str : access VString) return Pattern is
begin
return (AFC with 0, new PE'(PC_Any_VP, 1, EOP, VString_Ptr (Str)));
end Any;
function Any (Str : VString_Func) return Pattern is
begin
return (AFC with 0, new PE'(PC_Any_VF, 1, EOP, Str));
end Any;
---------
-- Arb --
---------
-- +---+
-- | X |---->
-- +---+
-- .
-- .
-- +---+
-- | Y |---->
-- +---+
-- The PC_Arb_X element is numbered 2, and the PC_Arb_Y element is 1.
function Arb return Pattern is
Y : constant PE_Ptr := new PE'(PC_Arb_Y, 1, EOP);
X : constant PE_Ptr := new PE'(PC_Arb_X, 2, EOP, Y);
begin
return (AFC with 1, X);
end Arb;
-----------
-- Arbno --
-----------
function Arbno (P : PString) return Pattern is
begin
if P'Length = 0 then
return (AFC with 0, EOP);
else
return (AFC with 0, Arbno_Simple (S_To_PE (P)));
end if;
end Arbno;
function Arbno (P : PChar) return Pattern is
begin
return (AFC with 0, Arbno_Simple (C_To_PE (P)));
end Arbno;
function Arbno (P : Pattern) return Pattern is
Pat : constant PE_Ptr := Copy (P.P);
begin
if P.Stk = 0
and then OK_For_Simple_Arbno (Pat.Pcode)
then
return (AFC with 0, Arbno_Simple (Pat));
end if;
-- This is the complex case, either the pattern makes stack entries
-- or it is possible for the pattern to match the null string (more
-- accurately, we don't know that this is not the case).
-- +--------------------------+
-- | ^
-- V |
-- +---+ |
-- | X |----> |
-- +---+ |
-- . |
-- . |
-- +---+ +---+ +---+ |
-- | E |---->| P |---->| Y |--->+
-- +---+ +---+ +---+
-- The node numbering of the constituent pattern P is not affected.
-- Where N is the number of nodes in P, the Y node is numbered N + 1,
-- the E node is N + 2, and the X node is N + 3.
declare
E : constant PE_Ptr := new PE'(PC_R_Enter, 0, EOP);
X : constant PE_Ptr := new PE'(PC_Arbno_X, 0, EOP, E);
Y : constant PE_Ptr := new PE'(PC_Arbno_Y, 0, X, P.Stk + 3);
EPY : constant PE_Ptr := Bracket (E, Pat, Y);
begin
X.Alt := EPY;
X.Index := EPY.Index + 1;
return (AFC with P.Stk + 3, X);
end;
end Arbno;
------------------
-- Arbno_Simple --
------------------
-- +-------------+
-- | ^
-- V |
-- +---+ |
-- | S |----> |
-- +---+ |
-- . |
-- . |
-- +---+ |
-- | P |---------->+
-- +---+
-- The node numbering of the constituent pattern P is not affected.
-- The S node has a node number of P.Index + 1.
-- Note that we know that P cannot be EOP, because a null pattern
-- does not meet the requirements for simple Arbno.
function Arbno_Simple (P : PE_Ptr) return PE_Ptr is
S : constant PE_Ptr := new PE'(PC_Arbno_S, P.Index + 1, EOP, P);
begin
Set_Successor (P, S);
return S;
end Arbno_Simple;
---------
-- Bal --
---------
function Bal return Pattern is
begin
return (AFC with 1, new PE'(PC_Bal, 1, EOP));
end Bal;
-------------
-- Bracket --
-------------
function Bracket (E, P, A : PE_Ptr) return PE_Ptr is
begin
if P = EOP then
E.Pthen := A;
E.Index := 2;
A.Index := 1;
else
E.Pthen := P;
Set_Successor (P, A);
E.Index := P.Index + 2;
A.Index := P.Index + 1;
end if;
return E;
end Bracket;
-----------
-- Break --
-----------
function Break (Str : String) return Pattern is
begin
return (AFC with 0, new PE'(PC_Break_CS, 1, EOP, To_Set (Str)));
end Break;
function Break (Str : VString) return Pattern is
begin
return Break (S (Str));
end Break;
function Break (Str : Character) return Pattern is
begin
return (AFC with 0, new PE'(PC_Break_CH, 1, EOP, Str));
end Break;
function Break (Str : Character_Set) return Pattern is
begin
return (AFC with 0, new PE'(PC_Break_CS, 1, EOP, Str));
end Break;
function Break (Str : access VString) return Pattern is
begin
return (AFC with 0, new PE'(PC_Break_VP, 1, EOP, VString_Ptr (Str)));
end Break;
function Break (Str : VString_Func) return Pattern is
begin
return (AFC with 0, new PE'(PC_Break_VF, 1, EOP, Str));
end Break;
------------
-- BreakX --
------------
function BreakX (Str : String) return Pattern is
begin
return BreakX_Make (new PE'(PC_BreakX_CS, 3, N, To_Set (Str)));
end BreakX;
function BreakX (Str : VString) return Pattern is
begin
return BreakX (S (Str));
end BreakX;
function BreakX (Str : Character) return Pattern is
begin
return BreakX_Make (new PE'(PC_BreakX_CH, 3, N, Str));
end BreakX;
function BreakX (Str : Character_Set) return Pattern is
begin
return BreakX_Make (new PE'(PC_BreakX_CS, 3, N, Str));
end BreakX;
function BreakX (Str : access VString) return Pattern is
begin
return BreakX_Make (new PE'(PC_BreakX_VP, 3, N, VString_Ptr (Str)));
end BreakX;
function BreakX (Str : VString_Func) return Pattern is
begin
return BreakX_Make (new PE'(PC_BreakX_VF, 3, N, Str));
end BreakX;
-----------------
-- BreakX_Make --
-----------------
-- +---+ +---+
-- | B |---->| A |---->
-- +---+ +---+
-- ^ .
-- | .
-- | +---+
-- +<------| X |
-- +---+
-- The B node is numbered 3, the alternative node is 1, and the X
-- node is 2.
function BreakX_Make (B : PE_Ptr) return Pattern is
X : constant PE_Ptr := new PE'(PC_BreakX_X, 2, B);
A : constant PE_Ptr := new PE'(PC_Alt, 1, EOP, X);
begin
B.Pthen := A;
return (AFC with 2, B);
end BreakX_Make;
---------------------
-- Build_Ref_Array --
---------------------
procedure Build_Ref_Array (E : PE_Ptr; RA : out Ref_Array) is
procedure Record_PE (E : PE_Ptr);
-- Record given pattern element if not already recorded in RA,
-- and also record any referenced pattern elements recursively.
procedure Record_PE (E : PE_Ptr) is
begin
PutD (" Record_PE called with PE_Ptr = " & Image (E));
if E = EOP or else RA (E.Index) /= null then
Put_LineD (", nothing to do");
return;
else
Put_LineD (", recording" & IndexT'Image (E.Index));
RA (E.Index) := E;
Record_PE (E.Pthen);
if E.Pcode in PC_Has_Alt then
Record_PE (E.Alt);
end if;
end if;
end Record_PE;
-- Start of processing for Build_Ref_Array
begin
New_LineD;
Put_LineD ("Entering Build_Ref_Array");
Record_PE (E);
New_LineD;
end Build_Ref_Array;
-------------
-- C_To_PE --
-------------
function C_To_PE (C : PChar) return PE_Ptr is
begin
return new PE'(PC_Char, 1, EOP, C);
end C_To_PE;
------------
-- Cancel --
------------
function Cancel return Pattern is
begin
return (AFC with 0, new PE'(PC_Cancel, 1, EOP));
end Cancel;
------------
-- Concat --
------------
-- Concat needs to traverse the left operand performing the following
-- set of fixups:
-- a) Any successor pointers (Pthen fields) that are set to EOP are
-- reset to point to the second operand.
-- b) Any PC_Arbno_Y node has its stack count field incremented
-- by the parameter Incr provided for this purpose.
-- d) Num fields of all pattern elements in the left operand are
-- adjusted to include the elements of the right operand.
-- Note: we do not use Set_Successor in the processing for Concat, since
-- there is no point in doing two traversals, we may as well do everything
-- at the same time.
function Concat (L, R : PE_Ptr; Incr : Natural) return PE_Ptr is
begin
if L = EOP then
return R;
elsif R = EOP then
return L;
else
declare
Refs : Ref_Array (1 .. L.Index);
-- We build a reference array for L whose N'th element points to
-- the pattern element of L whose original Index value is N.
P : PE_Ptr;
begin
Build_Ref_Array (L, Refs);
for J in Refs'Range loop
P := Refs (J);
P.Index := P.Index + R.Index;
if P.Pcode = PC_Arbno_Y then
P.Nat := P.Nat + Incr;
end if;
if P.Pthen = EOP then
P.Pthen := R;
end if;
if P.Pcode in PC_Has_Alt and then P.Alt = EOP then
P.Alt := R;
end if;
end loop;
end;
return L;
end if;
end Concat;
----------
-- Copy --
----------
function Copy (P : PE_Ptr) return PE_Ptr is
begin
if P = null then
Uninitialized_Pattern;
else
declare
Refs : Ref_Array (1 .. P.Index);
-- References to elements in P, indexed by Index field
Copy : Ref_Array (1 .. P.Index);
-- Holds copies of elements of P, indexed by Index field.
E : PE_Ptr;
begin
Build_Ref_Array (P, Refs);
-- Now copy all nodes
for J in Refs'Range loop
Copy (J) := new PE'(Refs (J).all);
end loop;
-- Adjust all internal references
for J in Copy'Range loop
E := Copy (J);
-- Adjust successor pointer to point to copy
if E.Pthen /= EOP then
E.Pthen := Copy (E.Pthen.Index);
end if;
-- Adjust Alt pointer if there is one to point to copy
if E.Pcode in PC_Has_Alt and then E.Alt /= EOP then
E.Alt := Copy (E.Alt.Index);
end if;
-- Copy referenced string
if E.Pcode = PC_String then
E.Str := new String'(E.Str.all);
end if;
end loop;
return Copy (P.Index);
end;
end if;
end Copy;
----------
-- Dump --
----------
procedure Dump (P : Pattern) is
subtype Count is Ada.Text_IO.Count;
Scol : Count;
-- Used to keep track of column in dump output
Refs : Ref_Array (1 .. P.P.Index);
-- We build a reference array whose N'th element points to the
-- pattern element whose Index value is N.
Cols : Natural := 2;
-- Number of columns used for pattern numbers, minimum is 2
E : PE_Ptr;
procedure Write_Node_Id (E : PE_Ptr);
-- Writes out a string identifying the given pattern element.
procedure Write_Node_Id (E : PE_Ptr) is
begin
if E = EOP then
Put ("EOP");
for J in 4 .. Cols loop
Put (' ');
end loop;
else
declare
Str : String (1 .. Cols);
N : Natural := Natural (E.Index);
begin
Put ("#");
for J in reverse Str'Range loop
Str (J) := Character'Val (48 + N mod 10);
N := N / 10;
end loop;
Put (Str);
end;
end if;
end Write_Node_Id;
begin
New_Line;
Put ("Pattern Dump Output (pattern at " &
Image (P'Address) &
", S = " & Natural'Image (P.Stk) & ')');
Scol := Col;
New_Line;
while Col < Scol loop
Put ('-');
end loop;
New_Line;
-- If uninitialized pattern, dump line and we are done
if P.P = null then
Put_Line ("Uninitialized pattern value");
return;
end if;
-- If null pattern, just dump it and we are all done
if P.P = EOP then
Put_Line ("EOP (null pattern)");
return;
end if;
Build_Ref_Array (P.P, Refs);
-- Set number of columns required for node numbers
while 10 ** Cols - 1 < Integer (P.P.Index) loop
Cols := Cols + 1;
end loop;
-- Now dump the nodes in reverse sequence. We output them in reverse
-- sequence since this corresponds to the natural order used to
-- construct the patterns.
for J in reverse Refs'Range loop
E := Refs (J);
Write_Node_Id (E);
Set_Col (Count (Cols) + 4);
Put (Image (E));
Put (" ");
Put (Pattern_Code'Image (E.Pcode));
Put (" ");
Set_Col (21 + Count (Cols) + Address_Image_Length);
Write_Node_Id (E.Pthen);
Set_Col (24 + 2 * Count (Cols) + Address_Image_Length);
case E.Pcode is
when PC_Alt |
PC_Arb_X |
PC_Arbno_S |
PC_Arbno_X =>
Write_Node_Id (E.Alt);
when PC_Rpat =>
Put (Str_PP (E.PP));
when PC_Pred_Func =>
Put (Str_BF (E.BF));
when PC_Assign_Imm |
PC_Assign_OnM |
PC_Any_VP |
PC_Break_VP |
PC_BreakX_VP |
PC_NotAny_VP |
PC_NSpan_VP |
PC_Span_VP |
PC_String_VP =>
Put (Str_VP (E.VP));
when PC_Write_Imm |
PC_Write_OnM =>
Put (Str_FP (E.FP));
when PC_String =>
Put (Image (E.Str.all));
when PC_String_2 =>
Put (Image (E.Str2));
when PC_String_3 =>
Put (Image (E.Str3));
when PC_String_4 =>
Put (Image (E.Str4));
when PC_String_5 =>
Put (Image (E.Str5));
when PC_String_6 =>
Put (Image (E.Str6));
when PC_Setcur =>
Put (Str_NP (E.Var));
when PC_Any_CH |
PC_Break_CH |
PC_BreakX_CH |
PC_Char |
PC_NotAny_CH |
PC_NSpan_CH |
PC_Span_CH =>
Put (''' & E.Char & ''');
when PC_Any_CS |
PC_Break_CS |
PC_BreakX_CS |
PC_NotAny_CS |
PC_NSpan_CS |
PC_Span_CS =>
Put ('"' & To_Sequence (E.CS) & '"');
when PC_Arbno_Y |
PC_Len_Nat |
PC_Pos_Nat |
PC_RPos_Nat |
PC_RTab_Nat |
PC_Tab_Nat =>
Put (S (E.Nat));
when PC_Pos_NF |
PC_Len_NF |
PC_RPos_NF |
PC_RTab_NF |
PC_Tab_NF =>
Put (Str_NF (E.NF));
when PC_Pos_NP |
PC_Len_NP |
PC_RPos_NP |
PC_RTab_NP |
PC_Tab_NP =>
Put (Str_NP (E.NP));
when PC_Any_VF |
PC_Break_VF |
PC_BreakX_VF |
PC_NotAny_VF |
PC_NSpan_VF |
PC_Span_VF |
PC_String_VF =>
Put (Str_VF (E.VF));
when others => null;
end case;
New_Line;
end loop;
New_Line;
end Dump;
----------
-- Fail --
----------
function Fail return Pattern is
begin
return (AFC with 0, new PE'(PC_Fail, 1, EOP));
end Fail;
-----------
-- Fence --
-----------
-- Simple case
function Fence return Pattern is
begin
return (AFC with 1, new PE'(PC_Fence, 1, EOP));
end Fence;
-- Function case
-- +---+ +---+ +---+
-- | E |---->| P |---->| X |---->
-- +---+ +---+ +---+
-- The node numbering of the constituent pattern P is not affected.
-- Where N is the number of nodes in P, the X node is numbered N + 1,
-- and the E node is N + 2.
function Fence (P : Pattern) return Pattern is
Pat : constant PE_Ptr := Copy (P.P);
E : constant PE_Ptr := new PE'(PC_R_Enter, 0, EOP);
X : constant PE_Ptr := new PE'(PC_Fence_X, 0, EOP);
begin
return (AFC with P.Stk + 1, Bracket (E, Pat, X));
end Fence;
--------------
-- Finalize --
--------------
procedure Finalize (Object : in out Pattern) is
procedure Free is new Unchecked_Deallocation (PE, PE_Ptr);
procedure Free is new Unchecked_Deallocation (String, String_Ptr);
begin
-- Nothing to do if already freed
if Object.P = null then
return;
-- Otherwise we must free all elements
else
declare
Refs : Ref_Array (1 .. Object.P.Index);
-- References to elements in pattern to be finalized
begin
Build_Ref_Array (Object.P, Refs);
for J in Refs'Range loop
if Refs (J).Pcode = PC_String then
Free (Refs (J).Str);
end if;
Free (Refs (J));
end loop;
Object.P := null;
end;
end if;
end Finalize;
-----------
-- Image --
-----------
function Image (P : PE_Ptr) return String is
begin
return Image (To_Address (P));
end Image;
function Image (P : Pattern) return String is
begin
return S (Image (P));
end Image;
function Image (P : Pattern) return VString is
Kill_Ampersand : Boolean := False;
-- Set True to delete next & to be output to Result
Result : VString := Nul;
-- The result is accumulated here, using Append
Refs : Ref_Array (1 .. P.P.Index);
-- We build a reference array whose N'th element points to the
-- pattern element whose Index value is N.
procedure Delete_Ampersand;
-- Deletes the ampersand at the end of Result
procedure Image_Seq (E : PE_Ptr; Succ : PE_Ptr; Paren : Boolean);
-- E refers to a pattern structure whose successor is given by Succ.
-- This procedure appends to Result a representation of this pattern.
-- The Paren parameter indicates whether parentheses are required if
-- the output is more than one element.
procedure Image_One (E : in out PE_Ptr);
-- E refers to a pattern structure. This procedure appends to Result
-- a representation of the single simple or compound pattern structure
-- at the start of E and updates E to point to its successor.
----------------------
-- Delete_Ampersand --
----------------------
procedure Delete_Ampersand is
L : Natural := Length (Result);
begin
if L > 2 then
Delete (Result, L - 1, L);
end if;
end Delete_Ampersand;
---------------
-- Image_One --
---------------
procedure Image_One (E : in out PE_Ptr) is
ER : PE_Ptr := E.Pthen;
-- Successor set as result in E unless reset
begin
case E.Pcode is
when PC_Cancel =>
Append (Result, "Cancel");
when PC_Alt => Alt : declare
Elmts_In_L : constant IndexT := E.Pthen.Index - E.Alt.Index;
-- Number of elements in left pattern of alternation.
Lowest_In_L : constant IndexT := E.Index - Elmts_In_L;
-- Number of lowest index in elements of left pattern
E1 : PE_Ptr;
begin
-- The successor of the alternation node must have a lower
-- index than any node that is in the left pattern or a
-- higher index than the alternation node itself.
while ER /= EOP
and then ER.Index >= Lowest_In_L
and then ER.Index < E.Index
loop
ER := ER.Pthen;
end loop;
Append (Result, '(');
E1 := E;
loop
Image_Seq (E1.Pthen, ER, False);
Append (Result, " or ");
E1 := E1.Alt;
exit when E1.Pcode /= PC_Alt;
end loop;
Image_Seq (E1, ER, False);
Append (Result, ')');
end Alt;
when PC_Any_CS =>
Append (Result, "Any (" & Image (To_Sequence (E.CS)) & ')');
when PC_Any_VF =>
Append (Result, "Any (" & Str_VF (E.VF) & ')');
when PC_Any_VP =>
Append (Result, "Any (" & Str_VP (E.VP) & ')');
when PC_Arb_X =>
Append (Result, "Arb");
when PC_Arbno_S =>
Append (Result, "Arbno (");
Image_Seq (E.Alt, E, False);
Append (Result, ')');
when PC_Arbno_X =>
Append (Result, "Arbno (");
Image_Seq (E.Alt.Pthen, Refs (E.Index - 2), False);
Append (Result, ')');
when PC_Assign_Imm =>
Delete_Ampersand;
Append (Result, "* " & Str_VP (Refs (E.Index - 1).VP));
when PC_Assign_OnM =>
Delete_Ampersand;
Append (Result, "** " & Str_VP (Refs (E.Index - 1).VP));
when PC_Any_CH =>
Append (Result, "Any ('" & E.Char & "')");
when PC_Bal =>
Append (Result, "Bal");
when PC_Break_CH =>
Append (Result, "Break ('" & E.Char & "')");
when PC_Break_CS =>
Append (Result, "Break (" & Image (To_Sequence (E.CS)) & ')');
when PC_Break_VF =>
Append (Result, "Break (" & Str_VF (E.VF) & ')');
when PC_Break_VP =>
Append (Result, "Break (" & Str_VP (E.VP) & ')');
when PC_BreakX_CH =>
Append (Result, "BreakX ('" & E.Char & "')");
ER := ER.Pthen;
when PC_BreakX_CS =>
Append (Result, "BreakX (" & Image (To_Sequence (E.CS)) & ')');
ER := ER.Pthen;
when PC_BreakX_VF =>
Append (Result, "BreakX (" & Str_VF (E.VF) & ')');
ER := ER.Pthen;
when PC_BreakX_VP =>
Append (Result, "BreakX (" & Str_VP (E.VP) & ')');
ER := ER.Pthen;
when PC_Char =>
Append (Result, ''' & E.Char & ''');
when PC_Fail =>
Append (Result, "Fail");
when PC_Fence =>
Append (Result, "Fence");
when PC_Fence_X =>
Append (Result, "Fence (");
Image_Seq (E.Pthen, Refs (E.Index - 1), False);
Append (Result, ")");
ER := Refs (E.Index - 1).Pthen;
when PC_Len_Nat =>
Append (Result, "Len (" & E.Nat & ')');
when PC_Len_NF =>
Append (Result, "Len (" & Str_NF (E.NF) & ')');
when PC_Len_NP =>
Append (Result, "Len (" & Str_NP (E.NP) & ')');
when PC_NotAny_CH =>
Append (Result, "NotAny ('" & E.Char & "')");
when PC_NotAny_CS =>
Append (Result, "NotAny (" & Image (To_Sequence (E.CS)) & ')');
when PC_NotAny_VF =>
Append (Result, "NotAny (" & Str_VF (E.VF) & ')');
when PC_NotAny_VP =>
Append (Result, "NotAny (" & Str_VP (E.VP) & ')');
when PC_NSpan_CH =>
Append (Result, "NSpan ('" & E.Char & "')");
when PC_NSpan_CS =>
Append (Result, "NSpan (" & Image (To_Sequence (E.CS)) & ')');
when PC_NSpan_VF =>
Append (Result, "NSpan (" & Str_VF (E.VF) & ')');
when PC_NSpan_VP =>
Append (Result, "NSpan (" & Str_VP (E.VP) & ')');
when PC_Null =>
Append (Result, """""");
when PC_Pos_Nat =>
Append (Result, "Pos (" & E.Nat & ')');
when PC_Pos_NF =>
Append (Result, "Pos (" & Str_NF (E.NF) & ')');
when PC_Pos_NP =>
Append (Result, "Pos (" & Str_NP (E.NP) & ')');
when PC_R_Enter =>
Kill_Ampersand := True;
when PC_Rest =>
Append (Result, "Rest");
when PC_Rpat =>
Append (Result, "(+ " & Str_PP (E.PP) & ')');
when PC_Pred_Func =>
Append (Result, "(+ " & Str_BF (E.BF) & ')');
when PC_RPos_Nat =>
Append (Result, "RPos (" & E.Nat & ')');
when PC_RPos_NF =>
Append (Result, "RPos (" & Str_NF (E.NF) & ')');
when PC_RPos_NP =>
Append (Result, "RPos (" & Str_NP (E.NP) & ')');
when PC_RTab_Nat =>
Append (Result, "RTab (" & E.Nat & ')');
when PC_RTab_NF =>
Append (Result, "RTab (" & Str_NF (E.NF) & ')');
when PC_RTab_NP =>
Append (Result, "RTab (" & Str_NP (E.NP) & ')');
when PC_Setcur =>
Append (Result, "Setcur (" & Str_NP (E.Var) & ')');
when PC_Span_CH =>
Append (Result, "Span ('" & E.Char & "')");
when PC_Span_CS =>
Append (Result, "Span (" & Image (To_Sequence (E.CS)) & ')');
when PC_Span_VF =>
Append (Result, "Span (" & Str_VF (E.VF) & ')');
when PC_Span_VP =>
Append (Result, "Span (" & Str_VP (E.VP) & ')');
when PC_String =>
Append (Result, Image (E.Str.all));
when PC_String_2 =>
Append (Result, Image (E.Str2));
when PC_String_3 =>
Append (Result, Image (E.Str3));
when PC_String_4 =>
Append (Result, Image (E.Str4));
when PC_String_5 =>
Append (Result, Image (E.Str5));
when PC_String_6 =>
Append (Result, Image (E.Str6));
when PC_String_VF =>
Append (Result, "(+" & Str_VF (E.VF) & ')');
when PC_String_VP =>
Append (Result, "(+" & Str_VP (E.VP) & ')');
when PC_Succeed =>
Append (Result, "Succeed");
when PC_Tab_Nat =>
Append (Result, "Tab (" & E.Nat & ')');
when PC_Tab_NF =>
Append (Result, "Tab (" & Str_NF (E.NF) & ')');
when PC_Tab_NP =>
Append (Result, "Tab (" & Str_NP (E.NP) & ')');
when PC_Write_Imm =>
Append (Result, '(');
Image_Seq (E, Refs (E.Index - 1), True);
Append (Result, " * " & Str_FP (Refs (E.Index - 1).FP));
ER := Refs (E.Index - 1).Pthen;
when PC_Write_OnM =>
Append (Result, '(');
Image_Seq (E.Pthen, Refs (E.Index - 1), True);
Append (Result, " ** " & Str_FP (Refs (E.Index - 1).FP));
ER := Refs (E.Index - 1).Pthen;
-- Other pattern codes should not appear as leading elements
when PC_Arb_Y |
PC_Arbno_Y |
PC_Assign |
PC_BreakX_X |
PC_EOP |
PC_Fence_Y |
PC_R_Remove |
PC_R_Restore |
PC_Unanchored =>
Append (Result, "???");
end case;
E := ER;
end Image_One;
---------------
-- Image_Seq --
---------------
procedure Image_Seq (E : PE_Ptr; Succ : PE_Ptr; Paren : Boolean) is
E1 : PE_Ptr := E;
Mult : Boolean := False;
Indx : Natural := Length (Result);
begin
-- The image of EOP is "" (the null string)
if E = EOP then
Append (Result, """""");
-- Else generate appropriate concatenation sequence
else
loop
Image_One (E1);
exit when E1 = Succ;
exit when E1 = EOP;
Mult := True;
if Kill_Ampersand then
Kill_Ampersand := False;
else
Append (Result, " & ");
end if;
end loop;
end if;
if Mult and Paren then
Insert (Result, Indx + 1, "(");
Append (Result, ")");
end if;
end Image_Seq;
-- Start of processing for Image
begin
Build_Ref_Array (P.P, Refs);
Image_Seq (P.P, EOP, False);
return Result;
end Image;
-----------
-- Is_In --
-----------
function Is_In (C : Character; Str : String) return Boolean is
begin
for J in Str'Range loop
if Str (J) = C then
return True;
end if;
end loop;
return False;
end Is_In;
---------
-- Len --
---------
function Len (Count : Natural) return Pattern is
begin
-- Note, the following is not just an optimization, it is needed
-- to ensure that Arbno (Len (0)) does not generate an infinite
-- matching loop (since PC_Len_Nat is OK_For_Simple_Arbno).
if Count = 0 then
return (AFC with 0, new PE'(PC_Null, 1, EOP));
else
return (AFC with 0, new PE'(PC_Len_Nat, 1, EOP, Count));
end if;
end Len;
function Len (Count : Natural_Func) return Pattern is
begin
return (AFC with 0, new PE'(PC_Len_NF, 1, EOP, Count));
end Len;
function Len (Count : access Natural) return Pattern is
begin
return (AFC with 0, new PE'(PC_Len_NP, 1, EOP, Natural_Ptr (Count)));
end Len;
-----------------
-- Logic_Error --
-----------------
procedure Logic_Error is
begin
Raise_Exception
(Program_Error'Identity,
"Internal logic error in GNAT.Spitbol.Patterns");
end Logic_Error;
-----------
-- Match --
-----------
function Match
(Subject : VString;
Pat : Pattern)
return Boolean
is
Start, Stop : Natural;
begin
if Debug_Mode then
XMatchD (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
else
XMatch (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
end if;
return Start /= 0;
end Match;
function Match
(Subject : String;
Pat : Pattern)
return Boolean
is
Start, Stop : Natural;
subtype String1 is String (1 .. Subject'Length);
begin
if Debug_Mode then
XMatchD (String1 (Subject), Pat.P, Pat.Stk, Start, Stop);
else
XMatch (String1 (Subject), Pat.P, Pat.Stk, Start, Stop);
end if;
return Start /= 0;
end Match;
function Match
(Subject : VString_Var;
Pat : Pattern;
Replace : VString)
return Boolean
is
Start, Stop : Natural;
begin
if Debug_Mode then
XMatchD (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
else
XMatch (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
end if;
if Start = 0 then
return False;
else
Replace_Slice
(Subject'Unrestricted_Access.all,
Start, Stop, Get_String (Replace).all);
return True;
end if;
end Match;
function Match
(Subject : VString_Var;
Pat : Pattern;
Replace : String)
return Boolean
is
Start, Stop : Natural;
begin
if Debug_Mode then
XMatchD (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
else
XMatch (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
end if;
if Start = 0 then
return False;
else
Replace_Slice
(Subject'Unrestricted_Access.all, Start, Stop, Replace);
return True;
end if;
end Match;
procedure Match
(Subject : VString;
Pat : Pattern)
is
Start, Stop : Natural;
begin
if Debug_Mode then
XMatchD (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
else
XMatch (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
end if;
end Match;
procedure Match
(Subject : String;
Pat : Pattern)
is
Start, Stop : Natural;
subtype String1 is String (1 .. Subject'Length);
begin
if Debug_Mode then
XMatchD (String1 (Subject), Pat.P, Pat.Stk, Start, Stop);
else
XMatch (String1 (Subject), Pat.P, Pat.Stk, Start, Stop);
end if;
end Match;
procedure Match
(Subject : in out VString;
Pat : Pattern;
Replace : VString)
is
Start, Stop : Natural;
begin
if Debug_Mode then
XMatchD (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
else
XMatch (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
end if;
if Start /= 0 then
Replace_Slice (Subject, Start, Stop, Get_String (Replace).all);
end if;
end Match;
procedure Match
(Subject : in out VString;
Pat : Pattern;
Replace : String)
is
Start, Stop : Natural;
begin
if Debug_Mode then
XMatchD (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
else
XMatch (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
end if;
if Start /= 0 then
Replace_Slice (Subject, Start, Stop, Replace);
end if;
end Match;
function Match
(Subject : VString;
Pat : PString)
return Boolean
is
Pat_Len : constant Natural := Pat'Length;
Sub_Len : constant Natural := Length (Subject);
Sub_Str : constant String_Access := Get_String (Subject);
begin
if Anchored_Mode then
if Pat_Len > Sub_Len then
return False;
else
return Pat = Sub_Str.all (1 .. Pat_Len);
end if;
else
for J in 1 .. Sub_Len - Pat_Len + 1 loop
if Pat = Sub_Str.all (J .. J + (Pat_Len - 1)) then
return True;
end if;
end loop;
return False;
end if;
end Match;
function Match
(Subject : String;
Pat : PString)
return Boolean
is
Pat_Len : constant Natural := Pat'Length;
Sub_Len : constant Natural := Subject'Length;
SFirst : constant Natural := Subject'First;
begin
if Anchored_Mode then
if Pat_Len > Sub_Len then
return False;
else
return Pat = Subject (SFirst .. SFirst + Pat_Len - 1);
end if;
else
for J in SFirst .. SFirst + Sub_Len - Pat_Len loop
if Pat = Subject (J .. J + (Pat_Len - 1)) then
return True;
end if;
end loop;
return False;
end if;
end Match;
function Match
(Subject : VString_Var;
Pat : PString;
Replace : VString)
return Boolean
is
Start, Stop : Natural;
begin
if Debug_Mode then
XMatchD (Get_String (Subject).all, S_To_PE (Pat), 0, Start, Stop);
else
XMatch (Get_String (Subject).all, S_To_PE (Pat), 0, Start, Stop);
end if;
if Start = 0 then
return False;
else
Replace_Slice
(Subject'Unrestricted_Access.all,
Start, Stop, Get_String (Replace).all);
return True;
end if;
end Match;
function Match
(Subject : VString_Var;
Pat : PString;
Replace : String)
return Boolean
is
Start, Stop : Natural;
begin
if Debug_Mode then
XMatchD (Get_String (Subject).all, S_To_PE (Pat), 0, Start, Stop);
else
XMatch (Get_String (Subject).all, S_To_PE (Pat), 0, Start, Stop);
end if;
if Start = 0 then
return False;
else
Replace_Slice
(Subject'Unrestricted_Access.all, Start, Stop, Replace);
return True;
end if;
end Match;
procedure Match
(Subject : VString;
Pat : PString)
is
Start, Stop : Natural;
begin
if Debug_Mode then
XMatchD (Get_String (Subject).all, S_To_PE (Pat), 0, Start, Stop);
else
XMatch (Get_String (Subject).all, S_To_PE (Pat), 0, Start, Stop);
end if;
end Match;
procedure Match
(Subject : String;
Pat : PString)
is
Start, Stop : Natural;
subtype String1 is String (1 .. Subject'Length);
begin
if Debug_Mode then
XMatchD (String1 (Subject), S_To_PE (Pat), 0, Start, Stop);
else
XMatch (String1 (Subject), S_To_PE (Pat), 0, Start, Stop);
end if;
end Match;
procedure Match
(Subject : in out VString;
Pat : PString;
Replace : VString)
is
Start, Stop : Natural;
begin
if Debug_Mode then
XMatchD (Get_String (Subject).all, S_To_PE (Pat), 0, Start, Stop);
else
XMatch (Get_String (Subject).all, S_To_PE (Pat), 0, Start, Stop);
end if;
if Start /= 0 then
Replace_Slice (Subject, Start, Stop, Get_String (Replace).all);
end if;
end Match;
procedure Match
(Subject : in out VString;
Pat : PString;
Replace : String)
is
Start, Stop : Natural;
begin
if Debug_Mode then
XMatchD (Get_String (Subject).all, S_To_PE (Pat), 0, Start, Stop);
else
XMatch (Get_String (Subject).all, S_To_PE (Pat), 0, Start, Stop);
end if;
if Start /= 0 then
Replace_Slice (Subject, Start, Stop, Replace);
end if;
end Match;
function Match
(Subject : VString_Var;
Pat : Pattern;
Result : Match_Result_Var)
return Boolean
is
Start, Stop : Natural;
begin
if Debug_Mode then
XMatchD (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
else
XMatch (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
end if;
if Start = 0 then
Result'Unrestricted_Access.all.Var := null;
return False;
else
Result'Unrestricted_Access.all.Var := Subject'Unrestricted_Access;
Result'Unrestricted_Access.all.Start := Start;
Result'Unrestricted_Access.all.Stop := Stop;
return True;
end if;
end Match;
procedure Match
(Subject : in out VString;
Pat : Pattern;
Result : out Match_Result)
is
Start, Stop : Natural;
begin
if Debug_Mode then
XMatchD (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
else
XMatch (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
end if;
if Start = 0 then
Result.Var := null;
else
Result.Var := Subject'Unrestricted_Access;
Result.Start := Start;
Result.Stop := Stop;
end if;
end Match;
---------------
-- New_LineD --
---------------
procedure New_LineD is
begin
if Internal_Debug then
New_Line;
end if;
end New_LineD;
------------
-- NotAny --
------------
function NotAny (Str : String) return Pattern is
begin
return (AFC with 0, new PE'(PC_NotAny_CS, 1, EOP, To_Set (Str)));
end NotAny;
function NotAny (Str : VString) return Pattern is
begin
return NotAny (S (Str));
end NotAny;
function NotAny (Str : Character) return Pattern is
begin
return (AFC with 0, new PE'(PC_NotAny_CH, 1, EOP, Str));
end NotAny;
function NotAny (Str : Character_Set) return Pattern is
begin
return (AFC with 0, new PE'(PC_NotAny_CS, 1, EOP, Str));
end NotAny;
function NotAny (Str : access VString) return Pattern is
begin
return (AFC with 0, new PE'(PC_NotAny_VP, 1, EOP, VString_Ptr (Str)));
end NotAny;
function NotAny (Str : VString_Func) return Pattern is
begin
return (AFC with 0, new PE'(PC_NotAny_VF, 1, EOP, Str));
end NotAny;
-----------
-- NSpan --
-----------
function NSpan (Str : String) return Pattern is
begin
return (AFC with 0, new PE'(PC_NSpan_CS, 1, EOP, To_Set (Str)));
end NSpan;
function NSpan (Str : VString) return Pattern is
begin
return NSpan (S (Str));
end NSpan;
function NSpan (Str : Character) return Pattern is
begin
return (AFC with 0, new PE'(PC_NSpan_CH, 1, EOP, Str));
end NSpan;
function NSpan (Str : Character_Set) return Pattern is
begin
return (AFC with 0, new PE'(PC_NSpan_CS, 1, EOP, Str));
end NSpan;
function NSpan (Str : access VString) return Pattern is
begin
return (AFC with 0, new PE'(PC_NSpan_VP, 1, EOP, VString_Ptr (Str)));
end NSpan;
function NSpan (Str : VString_Func) return Pattern is
begin
return (AFC with 0, new PE'(PC_NSpan_VF, 1, EOP, Str));
end NSpan;
---------
-- Pos --
---------
function Pos (Count : Natural) return Pattern is
begin
return (AFC with 0, new PE'(PC_Pos_Nat, 1, EOP, Count));
end Pos;
function Pos (Count : Natural_Func) return Pattern is
begin
return (AFC with 0, new PE'(PC_Pos_NF, 1, EOP, Count));
end Pos;
function Pos (Count : access Natural) return Pattern is
begin
return (AFC with 0, new PE'(PC_Pos_NP, 1, EOP, Natural_Ptr (Count)));
end Pos;
----------
-- PutD --
----------
procedure PutD (Str : String) is
begin
if Internal_Debug then
Put (Str);
end if;
end PutD;
---------------
-- Put_LineD --
---------------
procedure Put_LineD (Str : String) is
begin
if Internal_Debug then
Put_Line (Str);
end if;
end Put_LineD;
-------------
-- Replace --
-------------
procedure Replace
(Result : in out Match_Result;
Replace : VString)
is
begin
if Result.Var /= null then
Replace_Slice
(Result.Var.all,
Result.Start,
Result.Stop,
Get_String (Replace).all);
Result.Var := null;
end if;
end Replace;
----------
-- Rest --
----------
function Rest return Pattern is
begin
return (AFC with 0, new PE'(PC_Rest, 1, EOP));
end Rest;
----------
-- Rpos --
----------
function Rpos (Count : Natural) return Pattern is
begin
return (AFC with 0, new PE'(PC_RPos_Nat, 1, EOP, Count));
end Rpos;
function Rpos (Count : Natural_Func) return Pattern is
begin
return (AFC with 0, new PE'(PC_RPos_NF, 1, EOP, Count));
end Rpos;
function Rpos (Count : access Natural) return Pattern is
begin
return (AFC with 0, new PE'(PC_RPos_NP, 1, EOP, Natural_Ptr (Count)));
end Rpos;
----------
-- Rtab --
----------
function Rtab (Count : Natural) return Pattern is
begin
return (AFC with 0, new PE'(PC_RTab_Nat, 1, EOP, Count));
end Rtab;
function Rtab (Count : Natural_Func) return Pattern is
begin
return (AFC with 0, new PE'(PC_RTab_NF, 1, EOP, Count));
end Rtab;
function Rtab (Count : access Natural) return Pattern is
begin
return (AFC with 0, new PE'(PC_RTab_NP, 1, EOP, Natural_Ptr (Count)));
end Rtab;
-------------
-- S_To_PE --
-------------
function S_To_PE (Str : PString) return PE_Ptr is
Len : constant Natural := Str'Length;
begin
case Len is
when 0 =>
return new PE'(PC_Null, 1, EOP);
when 1 =>
return new PE'(PC_Char, 1, EOP, Str (1));
when 2 =>
return new PE'(PC_String_2, 1, EOP, Str);
when 3 =>
return new PE'(PC_String_3, 1, EOP, Str);
when 4 =>
return new PE'(PC_String_4, 1, EOP, Str);
when 5 =>
return new PE'(PC_String_5, 1, EOP, Str);
when 6 =>
return new PE'(PC_String_6, 1, EOP, Str);
when others =>
return new PE'(PC_String, 1, EOP, new String'(Str));
end case;
end S_To_PE;
-------------------
-- Set_Successor --
-------------------
-- Note: this procedure is not used by the normal concatenation circuit,
-- since other fixups are required on the left operand in this case, and
-- they might as well be done all together.
procedure Set_Successor (Pat : PE_Ptr; Succ : PE_Ptr) is
begin
if Pat = null then
Uninitialized_Pattern;
elsif Pat = EOP then
Logic_Error;
else
declare
Refs : Ref_Array (1 .. Pat.Index);
-- We build a reference array for L whose N'th element points to
-- the pattern element of L whose original Index value is N.
P : PE_Ptr;
begin
Build_Ref_Array (Pat, Refs);
for J in Refs'Range loop
P := Refs (J);
if P.Pthen = EOP then
P.Pthen := Succ;
end if;
if P.Pcode in PC_Has_Alt and then P.Alt = EOP then
P.Alt := Succ;
end if;
end loop;
end;
end if;
end Set_Successor;
------------
-- Setcur --
------------
function Setcur (Var : access Natural) return Pattern is
begin
return (AFC with 0, new PE'(PC_Setcur, 1, EOP, Natural_Ptr (Var)));
end Setcur;
----------
-- Span --
----------
function Span (Str : String) return Pattern is
begin
return (AFC with 0, new PE'(PC_Span_CS, 1, EOP, To_Set (Str)));
end Span;
function Span (Str : VString) return Pattern is
begin
return Span (S (Str));
end Span;
function Span (Str : Character) return Pattern is
begin
return (AFC with 0, new PE'(PC_Span_CH, 1, EOP, Str));
end Span;
function Span (Str : Character_Set) return Pattern is
begin
return (AFC with 0, new PE'(PC_Span_CS, 1, EOP, Str));
end Span;
function Span (Str : access VString) return Pattern is
begin
return (AFC with 0, new PE'(PC_Span_VP, 1, EOP, VString_Ptr (Str)));
end Span;
function Span (Str : VString_Func) return Pattern is
begin
return (AFC with 0, new PE'(PC_Span_VF, 1, EOP, Str));
end Span;
------------
-- Str_BF --
------------
function Str_BF (A : Boolean_Func) return String is
function To_A is new Unchecked_Conversion (Boolean_Func, Address);
begin
return "BF(" & Image (To_A (A)) & ')';
end Str_BF;
------------
-- Str_FP --
------------
function Str_FP (A : File_Ptr) return String is
begin
return "FP(" & Image (A.all'Address) & ')';
end Str_FP;
------------
-- Str_NF --
------------
function Str_NF (A : Natural_Func) return String is
function To_A is new Unchecked_Conversion (Natural_Func, Address);
begin
return "NF(" & Image (To_A (A)) & ')';
end Str_NF;
------------
-- Str_NP --
------------
function Str_NP (A : Natural_Ptr) return String is
begin
return "NP(" & Image (A.all'Address) & ')';
end Str_NP;
------------
-- Str_PP --
------------
function Str_PP (A : Pattern_Ptr) return String is
begin
return "PP(" & Image (A.all'Address) & ')';
end Str_PP;
------------
-- Str_VF --
------------
function Str_VF (A : VString_Func) return String is
function To_A is new Unchecked_Conversion (VString_Func, Address);
begin
return "VF(" & Image (To_A (A)) & ')';
end Str_VF;
------------
-- Str_VP --
------------
function Str_VP (A : VString_Ptr) return String is
begin
return "VP(" & Image (A.all'Address) & ')';
end Str_VP;
-------------
-- Succeed --
-------------
function Succeed return Pattern is
begin
return (AFC with 1, new PE'(PC_Succeed, 1, EOP));
end Succeed;
---------
-- Tab --
---------
function Tab (Count : Natural) return Pattern is
begin
return (AFC with 0, new PE'(PC_Tab_Nat, 1, EOP, Count));
end Tab;
function Tab (Count : Natural_Func) return Pattern is
begin
return (AFC with 0, new PE'(PC_Tab_NF, 1, EOP, Count));
end Tab;
function Tab (Count : access Natural) return Pattern is
begin
return (AFC with 0, new PE'(PC_Tab_NP, 1, EOP, Natural_Ptr (Count)));
end Tab;
---------------------------
-- Uninitialized_Pattern --
---------------------------
procedure Uninitialized_Pattern is
begin
Raise_Exception
(Program_Error'Identity,
"uninitialized value of type GNAT.Spitbol.Patterns.Pattern");
end Uninitialized_Pattern;
------------
-- XMatch --
------------
procedure XMatch
(Subject : String;
Pat_P : PE_Ptr;
Pat_S : Natural;
Start : out Natural;
Stop : out Natural)
is
Node : PE_Ptr;
-- Pointer to current pattern node. Initialized from Pat_P, and then
-- updated as the match proceeds through its constituent elements.
Length : constant Natural := Subject'Length;
-- Length of string (= Subject'Last, since Subject'First is always 1)
Cursor : Integer := 0;
-- If the value is non-negative, then this value is the index showing
-- the current position of the match in the subject string. The next
-- character to be matched is at Subject (Cursor + 1). Note that since
-- our view of the subject string in XMatch always has a lower bound
-- of one, regardless of original bounds, that this definition exactly
-- corresponds to the cursor value as referenced by functions like Pos.
--
-- If the value is negative, then this is a saved stack pointer,
-- typically a base pointer of an inner or outer region. Cursor
-- temporarily holds such a value when it is popped from the stack
-- by Fail. In all cases, Cursor is reset to a proper non-negative
-- cursor value before the match proceeds (e.g. by propagating the
-- failure and popping a "real" cursor value from the stack.
PE_Unanchored : aliased PE := (PC_Unanchored, 0, Pat_P);
-- Dummy pattern element used in the unanchored case.
Stack : Stack_Type;
-- The pattern matching failure stack for this call to Match
Stack_Ptr : Stack_Range;
-- Current stack pointer. This points to the top element of the stack
-- that is currently in use. At the outer level this is the special
-- entry placed on the stack according to the anchor mode.
Stack_Init : constant Stack_Range := Stack'First + 1;
-- This is the initial value of the Stack_Ptr and Stack_Base. The
-- initial (Stack'First) element of the stack is not used so that
-- when we pop the last element off, Stack_Ptr is still in range.
Stack_Base : Stack_Range;
-- This value is the stack base value, i.e. the stack pointer for the
-- first history stack entry in the current stack region. See separate
-- section on handling of recursive pattern matches.
Assign_OnM : Boolean := False;
-- Set True if assign-on-match or write-on-match operations may be
-- present in the history stack, which must then be scanned on a
-- successful match.
procedure Pop_Region;
pragma Inline (Pop_Region);
-- Used at the end of processing of an inner region. if the inner
-- region left no stack entries, then all trace of it is removed.
-- Otherwise a PC_Restore_Region entry is pushed to ensure proper
-- handling of alternatives in the inner region.
procedure Push (Node : PE_Ptr);
pragma Inline (Push);
-- Make entry in pattern matching stack with current cursor valeu
procedure Push_Region;
pragma Inline (Push_Region);
-- This procedure makes a new region on the history stack. The
-- caller first establishes the special entry on the stack, but
-- does not push the stack pointer. Then this call stacks a
-- PC_Remove_Region node, on top of this entry, using the cursor
-- field of the PC_Remove_Region entry to save the outer level
-- stack base value, and resets the stack base to point to this
-- PC_Remove_Region node.
----------------
-- Pop_Region --
----------------
procedure Pop_Region is
begin
-- If nothing was pushed in the inner region, we can just get
-- rid of it entirely, leaving no traces that it was ever there
if Stack_Ptr = Stack_Base then
Stack_Ptr := Stack_Base - 2;
Stack_Base := Stack (Stack_Ptr + 2).Cursor;
-- If stuff was pushed in the inner region, then we have to
-- push a PC_R_Restore node so that we properly handle possible
-- rematches within the region.
else
Stack_Ptr := Stack_Ptr + 1;
Stack (Stack_Ptr).Cursor := Stack_Base;
Stack (Stack_Ptr).Node := CP_R_Restore'Access;
Stack_Base := Stack (Stack_Base).Cursor;
end if;
end Pop_Region;
----------
-- Push --
----------
procedure Push (Node : PE_Ptr) is
begin
Stack_Ptr := Stack_Ptr + 1;
Stack (Stack_Ptr).Cursor := Cursor;
Stack (Stack_Ptr).Node := Node;
end Push;
-----------------
-- Push_Region --
-----------------
procedure Push_Region is
begin
Stack_Ptr := Stack_Ptr + 2;
Stack (Stack_Ptr).Cursor := Stack_Base;
Stack (Stack_Ptr).Node := CP_R_Remove'Access;
Stack_Base := Stack_Ptr;
end Push_Region;
-- Start of processing for XMatch
begin
if Pat_P = null then
Uninitialized_Pattern;
end if;
-- Check we have enough stack for this pattern. This check deals with
-- every possibility except a match of a recursive pattern, where we
-- make a check at each recursion level.
if Pat_S >= Stack_Size - 1 then
raise Pattern_Stack_Overflow;
end if;
-- In anchored mode, the bottom entry on the stack is an abort entry
if Anchored_Mode then
Stack (Stack_Init).Node := CP_Cancel'Access;
Stack (Stack_Init).Cursor := 0;
-- In unanchored more, the bottom entry on the stack references
-- the special pattern element PE_Unanchored, whose Pthen field
-- points to the initial pattern element. The cursor value in this
-- entry is the number of anchor moves so far.
else
Stack (Stack_Init).Node := PE_Unanchored'Unchecked_Access;
Stack (Stack_Init).Cursor := 0;
end if;
Stack_Ptr := Stack_Init;
Stack_Base := Stack_Ptr;
Cursor := 0;
Node := Pat_P;
goto Match;
-----------------------------------------
-- Main Pattern Matching State Control --
-----------------------------------------
-- This is a state machine which uses gotos to change state. The
-- initial state is Match, to initiate the matching of the first
-- element, so the goto Match above starts the match. In the
-- following descriptions, we indicate the global values that
-- are relevant for the state transition.
-- Come here if entire match fails
<<Match_Fail>>
Start := 0;
Stop := 0;
return;
-- Come here if entire match succeeds
-- Cursor current position in subject string
<<Match_Succeed>>
Start := Stack (Stack_Init).Cursor + 1;
Stop := Cursor;
-- Scan history stack for deferred assignments or writes
if Assign_OnM then
for S in Stack_Init .. Stack_Ptr loop
if Stack (S).Node = CP_Assign'Access then
declare
Inner_Base : constant Stack_Range :=
Stack (S + 1).Cursor;
Special_Entry : constant Stack_Range :=
Inner_Base - 1;
Node_OnM : constant PE_Ptr :=
Stack (Special_Entry).Node;
Start : constant Natural :=
Stack (Special_Entry).Cursor + 1;
Stop : constant Natural := Stack (S).Cursor;
begin
if Node_OnM.Pcode = PC_Assign_OnM then
Set_String (Node_OnM.VP.all, Subject (Start .. Stop));
elsif Node_OnM.Pcode = PC_Write_OnM then
Put_Line (Node_OnM.FP.all, Subject (Start .. Stop));
else
Logic_Error;
end if;
end;
end if;
end loop;
end if;
return;
-- Come here if attempt to match current element fails
-- Stack_Base current stack base
-- Stack_Ptr current stack pointer
<<Fail>>
Cursor := Stack (Stack_Ptr).Cursor;
Node := Stack (Stack_Ptr).Node;
Stack_Ptr := Stack_Ptr - 1;
goto Match;
-- Come here if attempt to match current element succeeds
-- Cursor current position in subject string
-- Node pointer to node successfully matched
-- Stack_Base current stack base
-- Stack_Ptr current stack pointer
<<Succeed>>
Node := Node.Pthen;
-- Come here to match the next pattern element
-- Cursor current position in subject string
-- Node pointer to node to be matched
-- Stack_Base current stack base
-- Stack_Ptr current stack pointer
<<Match>>
--------------------------------------------------
-- Main Pattern Match Element Matching Routines --
--------------------------------------------------
-- Here is the case statement that processes the current node. The
-- processing for each element does one of five things:
-- goto Succeed to move to the successor
-- goto Match_Succeed if the entire match succeeds
-- goto Match_Fail if the entire match fails
-- goto Fail to signal failure of current match
-- Processing is NOT allowed to fall through
case Node.Pcode is
-- Cancel
when PC_Cancel =>
goto Match_Fail;
-- Alternation
when PC_Alt =>
Push (Node.Alt);
Node := Node.Pthen;
goto Match;
-- Any (one character case)
when PC_Any_CH =>
if Cursor < Length
and then Subject (Cursor + 1) = Node.Char
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
-- Any (character set case)
when PC_Any_CS =>
if Cursor < Length
and then Is_In (Subject (Cursor + 1), Node.CS)
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
-- Any (string function case)
when PC_Any_VF => declare
U : constant VString := Node.VF.all;
Str : constant String_Access := Get_String (U);
begin
if Cursor < Length
and then Is_In (Subject (Cursor + 1), Str.all)
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
end;
-- Any (string pointer case)
when PC_Any_VP => declare
Str : constant String_Access := Get_String (Node.VP.all);
begin
if Cursor < Length
and then Is_In (Subject (Cursor + 1), Str.all)
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
end;
-- Arb (initial match)
when PC_Arb_X =>
Push (Node.Alt);
Node := Node.Pthen;
goto Match;
-- Arb (extension)
when PC_Arb_Y =>
if Cursor < Length then
Cursor := Cursor + 1;
Push (Node);
goto Succeed;
else
goto Fail;
end if;
-- Arbno_S (simple Arbno initialize). This is the node that
-- initiates the match of a simple Arbno structure.
when PC_Arbno_S =>
Push (Node.Alt);
Node := Node.Pthen;
goto Match;
-- Arbno_X (Arbno initialize). This is the node that initiates
-- the match of a complex Arbno structure.
when PC_Arbno_X =>
Push (Node.Alt);
Node := Node.Pthen;
goto Match;
-- Arbno_Y (Arbno rematch). This is the node that is executed
-- following successful matching of one instance of a complex
-- Arbno pattern.
when PC_Arbno_Y => declare
Null_Match : Boolean := (Cursor = Stack (Stack_Base - 1).Cursor);
begin
Pop_Region;
-- If arbno extension matched null, then immediately fail
if Null_Match then
goto Fail;
end if;
-- Here we must do a stack check to make sure enough stack
-- is left. This check will happen once for each instance of
-- the Arbno pattern that is matched. The Nat field of a
-- PC_Arbno pattern contains the maximum stack entries needed
-- for the Arbno with one instance and the successor pattern
if Stack_Ptr + Node.Nat >= Stack'Last then
raise Pattern_Stack_Overflow;
end if;
goto Succeed;
end;
-- Assign. If this node is executed, it means the assign-on-match
-- or write-on-match operation will not happen after all, so we
-- is propagate the failure, removing the PC_Assign node.
when PC_Assign =>
goto Fail;
-- Assign immediate. This node performs the actual assignment.
when PC_Assign_Imm =>
Set_String
(Node.VP.all,
Subject (Stack (Stack_Base - 1).Cursor + 1 .. Cursor));
Pop_Region;
goto Succeed;
-- Assign on match. This node sets up for the eventual assignment
when PC_Assign_OnM =>
Stack (Stack_Base - 1).Node := Node;
Push (CP_Assign'Access);
Pop_Region;
Assign_OnM := True;
goto Succeed;
-- Bal
when PC_Bal =>
if Cursor >= Length or else Subject (Cursor + 1) = ')' then
goto Fail;
elsif Subject (Cursor + 1) = '(' then
declare
Paren_Count : Natural := 1;
begin
loop
Cursor := Cursor + 1;
if Cursor >= Length then
goto Fail;
elsif Subject (Cursor + 1) = '(' then
Paren_Count := Paren_Count + 1;
elsif Subject (Cursor + 1) = ')' then
Paren_Count := Paren_Count - 1;
exit when Paren_Count = 0;
end if;
end loop;
end;
end if;
Cursor := Cursor + 1;
Push (Node);
goto Succeed;
-- Break (one character case)
when PC_Break_CH =>
while Cursor < Length loop
if Subject (Cursor + 1) = Node.Char then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
-- Break (character set case)
when PC_Break_CS =>
while Cursor < Length loop
if Is_In (Subject (Cursor + 1), Node.CS) then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
-- Break (string function case)
when PC_Break_VF => declare
U : constant VString := Node.VF.all;
Str : constant String_Access := Get_String (U);
begin
while Cursor < Length loop
if Is_In (Subject (Cursor + 1), Str.all) then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
end;
-- Break (string pointer case)
when PC_Break_VP => declare
Str : String_Access := Get_String (Node.VP.all);
begin
while Cursor < Length loop
if Is_In (Subject (Cursor + 1), Str.all) then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
end;
-- BreakX (one character case)
when PC_BreakX_CH =>
while Cursor < Length loop
if Subject (Cursor + 1) = Node.Char then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
-- BreakX (character set case)
when PC_BreakX_CS =>
while Cursor < Length loop
if Is_In (Subject (Cursor + 1), Node.CS) then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
-- BreakX (string function case)
when PC_BreakX_VF => declare
U : constant VString := Node.VF.all;
Str : constant String_Access := Get_String (U);
begin
while Cursor < Length loop
if Is_In (Subject (Cursor + 1), Str.all) then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
end;
-- BreakX (string pointer case)
when PC_BreakX_VP => declare
Str : String_Access := Get_String (Node.VP.all);
begin
while Cursor < Length loop
if Is_In (Subject (Cursor + 1), Str.all) then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
end;
-- BreakX_X (BreakX extension). See section on "Compound Pattern
-- Structures". This node is the alternative that is stacked to
-- skip past the break character and extend the break.
when PC_BreakX_X =>
Cursor := Cursor + 1;
goto Succeed;
-- Character (one character string)
when PC_Char =>
if Cursor < Length
and then Subject (Cursor + 1) = Node.Char
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
-- End of Pattern
when PC_EOP =>
if Stack_Base = Stack_Init then
goto Match_Succeed;
-- End of recursive inner match. See separate section on
-- handing of recursive pattern matches for details.
else
Node := Stack (Stack_Base - 1).Node;
Pop_Region;
goto Match;
end if;
-- Fail
when PC_Fail =>
goto Fail;
-- Fence (built in pattern)
when PC_Fence =>
Push (CP_Cancel'Access);
goto Succeed;
-- Fence function node X. This is the node that gets control
-- after a successful match of the fenced pattern.
when PC_Fence_X =>
Stack_Ptr := Stack_Ptr + 1;
Stack (Stack_Ptr).Cursor := Stack_Base;
Stack (Stack_Ptr).Node := CP_Fence_Y'Access;
Stack_Base := Stack (Stack_Base).Cursor;
goto Succeed;
-- Fence function node Y. This is the node that gets control on
-- a failure that occurs after the fenced pattern has matched.
-- Note: the Cursor at this stage is actually the inner stack
-- base value. We don't reset this, but we do use it to strip
-- off all the entries made by the fenced pattern.
when PC_Fence_Y =>
Stack_Ptr := Cursor - 2;
goto Fail;
-- Len (integer case)
when PC_Len_Nat =>
if Cursor + Node.Nat > Length then
goto Fail;
else
Cursor := Cursor + Node.Nat;
goto Succeed;
end if;
-- Len (Integer function case)
when PC_Len_NF => declare
N : constant Natural := Node.NF.all;
begin
if Cursor + N > Length then
goto Fail;
else
Cursor := Cursor + N;
goto Succeed;
end if;
end;
-- Len (integer pointer case)
when PC_Len_NP =>
if Cursor + Node.NP.all > Length then
goto Fail;
else
Cursor := Cursor + Node.NP.all;
goto Succeed;
end if;
-- NotAny (one character case)
when PC_NotAny_CH =>
if Cursor < Length
and then Subject (Cursor + 1) /= Node.Char
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
-- NotAny (character set case)
when PC_NotAny_CS =>
if Cursor < Length
and then not Is_In (Subject (Cursor + 1), Node.CS)
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
-- NotAny (string function case)
when PC_NotAny_VF => declare
U : constant VString := Node.VF.all;
Str : constant String_Access := Get_String (U);
begin
if Cursor < Length
and then
not Is_In (Subject (Cursor + 1), Str.all)
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
end;
-- NotAny (string pointer case)
when PC_NotAny_VP => declare
Str : String_Access := Get_String (Node.VP.all);
begin
if Cursor < Length
and then
not Is_In (Subject (Cursor + 1), Str.all)
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
end;
-- NSpan (one character case)
when PC_NSpan_CH =>
while Cursor < Length
and then Subject (Cursor + 1) = Node.Char
loop
Cursor := Cursor + 1;
end loop;
goto Succeed;
-- NSpan (character set case)
when PC_NSpan_CS =>
while Cursor < Length
and then Is_In (Subject (Cursor + 1), Node.CS)
loop
Cursor := Cursor + 1;
end loop;
goto Succeed;
-- NSpan (string function case)
when PC_NSpan_VF => declare
U : constant VString := Node.VF.all;
Str : constant String_Access := Get_String (U);
begin
while Cursor < Length
and then Is_In (Subject (Cursor + 1), Str.all)
loop
Cursor := Cursor + 1;
end loop;
goto Succeed;
end;
-- NSpan (string pointer case)
when PC_NSpan_VP => declare
Str : String_Access := Get_String (Node.VP.all);
begin
while Cursor < Length
and then Is_In (Subject (Cursor + 1), Str.all)
loop
Cursor := Cursor + 1;
end loop;
goto Succeed;
end;
-- Null string
when PC_Null =>
goto Succeed;
-- Pos (integer case)
when PC_Pos_Nat =>
if Cursor = Node.Nat then
goto Succeed;
else
goto Fail;
end if;
-- Pos (Integer function case)
when PC_Pos_NF => declare
N : constant Natural := Node.NF.all;
begin
if Cursor = N then
goto Succeed;
else
goto Fail;
end if;
end;
-- Pos (integer pointer case)
when PC_Pos_NP =>
if Cursor = Node.NP.all then
goto Succeed;
else
goto Fail;
end if;
-- Predicate function
when PC_Pred_Func =>
if Node.BF.all then
goto Succeed;
else
goto Fail;
end if;
-- Region Enter. Initiate new pattern history stack region
when PC_R_Enter =>
Stack (Stack_Ptr + 1).Cursor := Cursor;
Push_Region;
goto Succeed;
-- Region Remove node. This is the node stacked by an R_Enter.
-- It removes the special format stack entry right underneath, and
-- then restores the outer level stack base and signals failure.
-- Note: the cursor value at this stage is actually the (negative)
-- stack base value for the outer level.
when PC_R_Remove =>
Stack_Base := Cursor;
Stack_Ptr := Stack_Ptr - 1;
goto Fail;
-- Region restore node. This is the node stacked at the end of an
-- inner level match. Its function is to restore the inner level
-- region, so that alternatives in this region can be sought.
-- Note: the Cursor at this stage is actually the negative of the
-- inner stack base value, which we use to restore the inner region.
when PC_R_Restore =>
Stack_Base := Cursor;
goto Fail;
-- Rest
when PC_Rest =>
Cursor := Length;
goto Succeed;
-- Initiate recursive match (pattern pointer case)
when PC_Rpat =>
Stack (Stack_Ptr + 1).Node := Node.Pthen;
Push_Region;
if Stack_Ptr + Node.PP.all.Stk >= Stack_Size then
raise Pattern_Stack_Overflow;
else
Node := Node.PP.all.P;
goto Match;
end if;
-- RPos (integer case)
when PC_RPos_Nat =>
if Cursor = (Length - Node.Nat) then
goto Succeed;
else
goto Fail;
end if;
-- RPos (integer function case)
when PC_RPos_NF => declare
N : constant Natural := Node.NF.all;
begin
if Length - Cursor = N then
goto Succeed;
else
goto Fail;
end if;
end;
-- RPos (integer pointer case)
when PC_RPos_NP =>
if Cursor = (Length - Node.NP.all) then
goto Succeed;
else
goto Fail;
end if;
-- RTab (integer case)
when PC_RTab_Nat =>
if Cursor <= (Length - Node.Nat) then
Cursor := Length - Node.Nat;
goto Succeed;
else
goto Fail;
end if;
-- RTab (integer function case)
when PC_RTab_NF => declare
N : constant Natural := Node.NF.all;
begin
if Length - Cursor >= N then
Cursor := Length - N;
goto Succeed;
else
goto Fail;
end if;
end;
-- RTab (integer pointer case)
when PC_RTab_NP =>
if Cursor <= (Length - Node.NP.all) then
Cursor := Length - Node.NP.all;
goto Succeed;
else
goto Fail;
end if;
-- Cursor assignment
when PC_Setcur =>
Node.Var.all := Cursor;
goto Succeed;
-- Span (one character case)
when PC_Span_CH => declare
P : Natural := Cursor;
begin
while P < Length
and then Subject (P + 1) = Node.Char
loop
P := P + 1;
end loop;
if P /= Cursor then
Cursor := P;
goto Succeed;
else
goto Fail;
end if;
end;
-- Span (character set case)
when PC_Span_CS => declare
P : Natural := Cursor;
begin
while P < Length
and then Is_In (Subject (P + 1), Node.CS)
loop
P := P + 1;
end loop;
if P /= Cursor then
Cursor := P;
goto Succeed;
else
goto Fail;
end if;
end;
-- Span (string function case)
when PC_Span_VF => declare
U : constant VString := Node.VF.all;
Str : constant String_Access := Get_String (U);
P : Natural := Cursor;
begin
while P < Length
and then Is_In (Subject (P + 1), Str.all)
loop
P := P + 1;
end loop;
if P /= Cursor then
Cursor := P;
goto Succeed;
else
goto Fail;
end if;
end;
-- Span (string pointer case)
when PC_Span_VP => declare
Str : String_Access := Get_String (Node.VP.all);
P : Natural := Cursor;
begin
while P < Length
and then Is_In (Subject (P + 1), Str.all)
loop
P := P + 1;
end loop;
if P /= Cursor then
Cursor := P;
goto Succeed;
else
goto Fail;
end if;
end;
-- String (two character case)
when PC_String_2 =>
if (Length - Cursor) >= 2
and then Subject (Cursor + 1 .. Cursor + 2) = Node.Str2
then
Cursor := Cursor + 2;
goto Succeed;
else
goto Fail;
end if;
-- String (three character case)
when PC_String_3 =>
if (Length - Cursor) >= 3
and then Subject (Cursor + 1 .. Cursor + 3) = Node.Str3
then
Cursor := Cursor + 3;
goto Succeed;
else
goto Fail;
end if;
-- String (four character case)
when PC_String_4 =>
if (Length - Cursor) >= 4
and then Subject (Cursor + 1 .. Cursor + 4) = Node.Str4
then
Cursor := Cursor + 4;
goto Succeed;
else
goto Fail;
end if;
-- String (five character case)
when PC_String_5 =>
if (Length - Cursor) >= 5
and then Subject (Cursor + 1 .. Cursor + 5) = Node.Str5
then
Cursor := Cursor + 5;
goto Succeed;
else
goto Fail;
end if;
-- String (six character case)
when PC_String_6 =>
if (Length - Cursor) >= 6
and then Subject (Cursor + 1 .. Cursor + 6) = Node.Str6
then
Cursor := Cursor + 6;
goto Succeed;
else
goto Fail;
end if;
-- String (case of more than six characters)
when PC_String => declare
Len : constant Natural := Node.Str'Length;
begin
if (Length - Cursor) >= Len
and then Node.Str.all = Subject (Cursor + 1 .. Cursor + Len)
then
Cursor := Cursor + Len;
goto Succeed;
else
goto Fail;
end if;
end;
-- String (function case)
when PC_String_VF => declare
U : constant VString := Node.VF.all;
Str : constant String_Access := Get_String (U);
Len : constant Natural := Str'Length;
begin
if (Length - Cursor) >= Len
and then Str.all = Subject (Cursor + 1 .. Cursor + Len)
then
Cursor := Cursor + Len;
goto Succeed;
else
goto Fail;
end if;
end;
-- String (pointer case)
when PC_String_VP => declare
S : String_Access := Get_String (Node.VP.all);
Len : constant Natural := S'Length;
begin
if (Length - Cursor) >= Len
and then S.all = Subject (Cursor + 1 .. Cursor + Len)
then
Cursor := Cursor + Len;
goto Succeed;
else
goto Fail;
end if;
end;
-- Succeed
when PC_Succeed =>
Push (Node);
goto Succeed;
-- Tab (integer case)
when PC_Tab_Nat =>
if Cursor <= Node.Nat then
Cursor := Node.Nat;
goto Succeed;
else
goto Fail;
end if;
-- Tab (integer function case)
when PC_Tab_NF => declare
N : constant Natural := Node.NF.all;
begin
if Cursor <= N then
Cursor := N;
goto Succeed;
else
goto Fail;
end if;
end;
-- Tab (integer pointer case)
when PC_Tab_NP =>
if Cursor <= Node.NP.all then
Cursor := Node.NP.all;
goto Succeed;
else
goto Fail;
end if;
-- Unanchored movement
when PC_Unanchored =>
-- All done if we tried every position
if Cursor > Length then
goto Match_Fail;
-- Otherwise extend the anchor point, and restack ourself
else
Cursor := Cursor + 1;
Push (Node);
goto Succeed;
end if;
-- Write immediate. This node performs the actual write
when PC_Write_Imm =>
Put_Line
(Node.FP.all,
Subject (Stack (Stack_Base - 1).Cursor + 1 .. Cursor));
Pop_Region;
goto Succeed;
-- Write on match. This node sets up for the eventual write
when PC_Write_OnM =>
Stack (Stack_Base - 1).Node := Node;
Push (CP_Assign'Access);
Pop_Region;
Assign_OnM := True;
goto Succeed;
end case;
-- We are NOT allowed to fall though this case statement, since every
-- match routine must end by executing a goto to the appropriate point
-- in the finite state machine model.
Logic_Error;
end XMatch;
-------------
-- XMatchD --
-------------
-- Maintenance note: There is a LOT of code duplication between XMatch
-- and XMatchD. This is quite intentional, the point is to avoid any
-- unnecessary debugging overhead in the XMatch case, but this does mean
-- that any changes to XMatchD must be mirrored in XMatch. In case of
-- any major changes, the proper approach is to delete XMatch, make the
-- changes to XMatchD, and then make a copy of XMatchD, removing all
-- calls to Dout, and all Put and Put_Line operations. This copy becomes
-- the new XMatch.
procedure XMatchD
(Subject : String;
Pat_P : PE_Ptr;
Pat_S : Natural;
Start : out Natural;
Stop : out Natural)
is
Node : PE_Ptr;
-- Pointer to current pattern node. Initialized from Pat_P, and then
-- updated as the match proceeds through its constituent elements.
Length : constant Natural := Subject'Length;
-- Length of string (= Subject'Last, since Subject'First is always 1)
Cursor : Integer := 0;
-- If the value is non-negative, then this value is the index showing
-- the current position of the match in the subject string. The next
-- character to be matched is at Subject (Cursor + 1). Note that since
-- our view of the subject string in XMatch always has a lower bound
-- of one, regardless of original bounds, that this definition exactly
-- corresponds to the cursor value as referenced by functions like Pos.
--
-- If the value is negative, then this is a saved stack pointer,
-- typically a base pointer of an inner or outer region. Cursor
-- temporarily holds such a value when it is popped from the stack
-- by Fail. In all cases, Cursor is reset to a proper non-negative
-- cursor value before the match proceeds (e.g. by propagating the
-- failure and popping a "real" cursor value from the stack.
PE_Unanchored : aliased PE := (PC_Unanchored, 0, Pat_P);
-- Dummy pattern element used in the unanchored case.
Region_Level : Natural := 0;
-- Keeps track of recursive region level. This is used only for
-- debugging, it is the number of saved history stack base values.
Stack : Stack_Type;
-- The pattern matching failure stack for this call to Match
Stack_Ptr : Stack_Range;
-- Current stack pointer. This points to the top element of the stack
-- that is currently in use. At the outer level this is the special
-- entry placed on the stack according to the anchor mode.
Stack_Init : constant Stack_Range := Stack'First + 1;
-- This is the initial value of the Stack_Ptr and Stack_Base. The
-- initial (Stack'First) element of the stack is not used so that
-- when we pop the last element off, Stack_Ptr is still in range.
Stack_Base : Stack_Range;
-- This value is the stack base value, i.e. the stack pointer for the
-- first history stack entry in the current stack region. See separate
-- section on handling of recursive pattern matches.
Assign_OnM : Boolean := False;
-- Set True if assign-on-match or write-on-match operations may be
-- present in the history stack, which must then be scanned on a
-- successful match.
procedure Dout (Str : String);
-- Output string to standard error with bars indicating region level.
procedure Dout (Str : String; A : Character);
-- Calls Dout with the string S ('A')
procedure Dout (Str : String; A : Character_Set);
-- Calls Dout with the string S ("A")
procedure Dout (Str : String; A : Natural);
-- Calls Dout with the string S (A)
procedure Dout (Str : String; A : String);
-- Calls Dout with the string S ("A")
function Img (P : PE_Ptr) return String;
-- Returns a string of the form #nnn where nnn is P.Index
procedure Pop_Region;
pragma Inline (Pop_Region);
-- Used at the end of processing of an inner region. if the inner
-- region left no stack entries, then all trace of it is removed.
-- Otherwise a PC_Restore_Region entry is pushed to ensure proper
-- handling of alternatives in the inner region.
procedure Push (Node : PE_Ptr);
pragma Inline (Push);
-- Make entry in pattern matching stack with current cursor valeu
procedure Push_Region;
pragma Inline (Push_Region);
-- This procedure makes a new region on the history stack. The
-- caller first establishes the special entry on the stack, but
-- does not push the stack pointer. Then this call stacks a
-- PC_Remove_Region node, on top of this entry, using the cursor
-- field of the PC_Remove_Region entry to save the outer level
-- stack base value, and resets the stack base to point to this
-- PC_Remove_Region node.
----------
-- Dout --
----------
procedure Dout (Str : String) is
begin
for J in 1 .. Region_Level loop
Put ("| ");
end loop;
Put_Line (Str);
end Dout;
procedure Dout (Str : String; A : Character) is
begin
Dout (Str & " ('" & A & "')");
end Dout;
procedure Dout (Str : String; A : Character_Set) is
begin
Dout (Str & " (" & Image (To_Sequence (A)) & ')');
end Dout;
procedure Dout (Str : String; A : Natural) is
begin
Dout (Str & " (" & A & ')');
end Dout;
procedure Dout (Str : String; A : String) is
begin
Dout (Str & " (" & Image (A) & ')');
end Dout;
---------
-- Img --
---------
function Img (P : PE_Ptr) return String is
begin
return "#" & Integer (P.Index) & " ";
end Img;
----------------
-- Pop_Region --
----------------
procedure Pop_Region is
begin
Region_Level := Region_Level - 1;
-- If nothing was pushed in the inner region, we can just get
-- rid of it entirely, leaving no traces that it was ever there
if Stack_Ptr = Stack_Base then
Stack_Ptr := Stack_Base - 2;
Stack_Base := Stack (Stack_Ptr + 2).Cursor;
-- If stuff was pushed in the inner region, then we have to
-- push a PC_R_Restore node so that we properly handle possible
-- rematches within the region.
else
Stack_Ptr := Stack_Ptr + 1;
Stack (Stack_Ptr).Cursor := Stack_Base;
Stack (Stack_Ptr).Node := CP_R_Restore'Access;
Stack_Base := Stack (Stack_Base).Cursor;
end if;
end Pop_Region;
----------
-- Push --
----------
procedure Push (Node : PE_Ptr) is
begin
Stack_Ptr := Stack_Ptr + 1;
Stack (Stack_Ptr).Cursor := Cursor;
Stack (Stack_Ptr).Node := Node;
end Push;
-----------------
-- Push_Region --
-----------------
procedure Push_Region is
begin
Region_Level := Region_Level + 1;
Stack_Ptr := Stack_Ptr + 2;
Stack (Stack_Ptr).Cursor := Stack_Base;
Stack (Stack_Ptr).Node := CP_R_Remove'Access;
Stack_Base := Stack_Ptr;
end Push_Region;
-- Start of processing for XMatchD
begin
New_Line;
Put_Line ("Initiating pattern match, subject = " & Image (Subject));
Put ("--------------------------------------");
for J in 1 .. Length loop
Put ('-');
end loop;
New_Line;
Put_Line ("subject length = " & Length);
if Pat_P = null then
Uninitialized_Pattern;
end if;
-- Check we have enough stack for this pattern. This check deals with
-- every possibility except a match of a recursive pattern, where we
-- make a check at each recursion level.
if Pat_S >= Stack_Size - 1 then
raise Pattern_Stack_Overflow;
end if;
-- In anchored mode, the bottom entry on the stack is an abort entry
if Anchored_Mode then
Stack (Stack_Init).Node := CP_Cancel'Access;
Stack (Stack_Init).Cursor := 0;
-- In unanchored more, the bottom entry on the stack references
-- the special pattern element PE_Unanchored, whose Pthen field
-- points to the initial pattern element. The cursor value in this
-- entry is the number of anchor moves so far.
else
Stack (Stack_Init).Node := PE_Unanchored'Unchecked_Access;
Stack (Stack_Init).Cursor := 0;
end if;
Stack_Ptr := Stack_Init;
Stack_Base := Stack_Ptr;
Cursor := 0;
Node := Pat_P;
goto Match;
-----------------------------------------
-- Main Pattern Matching State Control --
-----------------------------------------
-- This is a state machine which uses gotos to change state. The
-- initial state is Match, to initiate the matching of the first
-- element, so the goto Match above starts the match. In the
-- following descriptions, we indicate the global values that
-- are relevant for the state transition.
-- Come here if entire match fails
<<Match_Fail>>
Dout ("match fails");
New_Line;
Start := 0;
Stop := 0;
return;
-- Come here if entire match succeeds
-- Cursor current position in subject string
<<Match_Succeed>>
Dout ("match succeeds");
Start := Stack (Stack_Init).Cursor + 1;
Stop := Cursor;
Dout ("first matched character index = " & Start);
Dout ("last matched character index = " & Stop);
Dout ("matched substring = " & Image (Subject (Start .. Stop)));
-- Scan history stack for deferred assignments or writes
if Assign_OnM then
for S in Stack'First .. Stack_Ptr loop
if Stack (S).Node = CP_Assign'Access then
declare
Inner_Base : constant Stack_Range :=
Stack (S + 1).Cursor;
Special_Entry : constant Stack_Range :=
Inner_Base - 1;
Node_OnM : constant PE_Ptr :=
Stack (Special_Entry).Node;
Start : constant Natural :=
Stack (Special_Entry).Cursor + 1;
Stop : constant Natural := Stack (S).Cursor;
begin
if Node_OnM.Pcode = PC_Assign_OnM then
Set_String (Node_OnM.VP.all, Subject (Start .. Stop));
Dout
(Img (Stack (S).Node) &
"deferred assignment of " &
Image (Subject (Start .. Stop)));
elsif Node_OnM.Pcode = PC_Write_OnM then
Put_Line (Node_OnM.FP.all, Subject (Start .. Stop));
Dout
(Img (Stack (S).Node) &
"deferred write of " &
Image (Subject (Start .. Stop)));
else
Logic_Error;
end if;
end;
end if;
end loop;
end if;
New_Line;
return;
-- Come here if attempt to match current element fails
-- Stack_Base current stack base
-- Stack_Ptr current stack pointer
<<Fail>>
Cursor := Stack (Stack_Ptr).Cursor;
Node := Stack (Stack_Ptr).Node;
Stack_Ptr := Stack_Ptr - 1;
if Cursor >= 0 then
Dout ("failure, cursor reset to " & Cursor);
end if;
goto Match;
-- Come here if attempt to match current element succeeds
-- Cursor current position in subject string
-- Node pointer to node successfully matched
-- Stack_Base current stack base
-- Stack_Ptr current stack pointer
<<Succeed>>
Dout ("success, cursor = " & Cursor);
Node := Node.Pthen;
-- Come here to match the next pattern element
-- Cursor current position in subject string
-- Node pointer to node to be matched
-- Stack_Base current stack base
-- Stack_Ptr current stack pointer
<<Match>>
--------------------------------------------------
-- Main Pattern Match Element Matching Routines --
--------------------------------------------------
-- Here is the case statement that processes the current node. The
-- processing for each element does one of five things:
-- goto Succeed to move to the successor
-- goto Match_Succeed if the entire match succeeds
-- goto Match_Fail if the entire match fails
-- goto Fail to signal failure of current match
-- Processing is NOT allowed to fall through
case Node.Pcode is
-- Cancel
when PC_Cancel =>
Dout (Img (Node) & "matching Cancel");
goto Match_Fail;
-- Alternation
when PC_Alt =>
Dout
(Img (Node) & "setting up alternative " & Img (Node.Alt));
Push (Node.Alt);
Node := Node.Pthen;
goto Match;
-- Any (one character case)
when PC_Any_CH =>
Dout (Img (Node) & "matching Any", Node.Char);
if Cursor < Length
and then Subject (Cursor + 1) = Node.Char
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
-- Any (character set case)
when PC_Any_CS =>
Dout (Img (Node) & "matching Any", Node.CS);
if Cursor < Length
and then Is_In (Subject (Cursor + 1), Node.CS)
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
-- Any (string function case)
when PC_Any_VF => declare
U : constant VString := Node.VF.all;
Str : constant String_Access := Get_String (U);
begin
Dout (Img (Node) & "matching Any", Str.all);
if Cursor < Length
and then Is_In (Subject (Cursor + 1), Str.all)
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
end;
-- Any (string pointer case)
when PC_Any_VP => declare
Str : String_Access := Get_String (Node.VP.all);
begin
Dout (Img (Node) & "matching Any", Str.all);
if Cursor < Length
and then Is_In (Subject (Cursor + 1), Str.all)
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
end;
-- Arb (initial match)
when PC_Arb_X =>
Dout (Img (Node) & "matching Arb");
Push (Node.Alt);
Node := Node.Pthen;
goto Match;
-- Arb (extension)
when PC_Arb_Y =>
Dout (Img (Node) & "extending Arb");
if Cursor < Length then
Cursor := Cursor + 1;
Push (Node);
goto Succeed;
else
goto Fail;
end if;
-- Arbno_S (simple Arbno initialize). This is the node that
-- initiates the match of a simple Arbno structure.
when PC_Arbno_S =>
Dout (Img (Node) &
"setting up Arbno alternative " & Img (Node.Alt));
Push (Node.Alt);
Node := Node.Pthen;
goto Match;
-- Arbno_X (Arbno initialize). This is the node that initiates
-- the match of a complex Arbno structure.
when PC_Arbno_X =>
Dout (Img (Node) &
"setting up Arbno alternative " & Img (Node.Alt));
Push (Node.Alt);
Node := Node.Pthen;
goto Match;
-- Arbno_Y (Arbno rematch). This is the node that is executed
-- following successful matching of one instance of a complex
-- Arbno pattern.
when PC_Arbno_Y => declare
Null_Match : Boolean := (Cursor = Stack (Stack_Base - 1).Cursor);
begin
Dout (Img (Node) & "extending Arbno");
Pop_Region;
-- If arbno extension matched null, then immediately fail
if Null_Match then
Dout ("Arbno extension matched null, so fails");
goto Fail;
end if;
-- Here we must do a stack check to make sure enough stack
-- is left. This check will happen once for each instance of
-- the Arbno pattern that is matched. The Nat field of a
-- PC_Arbno pattern contains the maximum stack entries needed
-- for the Arbno with one instance and the successor pattern
if Stack_Ptr + Node.Nat >= Stack'Last then
raise Pattern_Stack_Overflow;
end if;
goto Succeed;
end;
-- Assign. If this node is executed, it means the assign-on-match
-- or write-on-match operation will not happen after all, so we
-- is propagate the failure, removing the PC_Assign node.
when PC_Assign =>
Dout (Img (Node) & "deferred assign/write cancelled");
goto Fail;
-- Assign immediate. This node performs the actual assignment.
when PC_Assign_Imm =>
Dout
(Img (Node) & "executing immediate assignment of " &
Image (Subject (Stack (Stack_Base - 1).Cursor + 1 .. Cursor)));
Set_String
(Node.VP.all,
Subject (Stack (Stack_Base - 1).Cursor + 1 .. Cursor));
Pop_Region;
goto Succeed;
-- Assign on match. This node sets up for the eventual assignment
when PC_Assign_OnM =>
Dout (Img (Node) & "registering deferred assignment");
Stack (Stack_Base - 1).Node := Node;
Push (CP_Assign'Access);
Pop_Region;
Assign_OnM := True;
goto Succeed;
-- Bal
when PC_Bal =>
Dout (Img (Node) & "matching or extending Bal");
if Cursor >= Length or else Subject (Cursor + 1) = ')' then
goto Fail;
elsif Subject (Cursor + 1) = '(' then
declare
Paren_Count : Natural := 1;
begin
loop
Cursor := Cursor + 1;
if Cursor >= Length then
goto Fail;
elsif Subject (Cursor + 1) = '(' then
Paren_Count := Paren_Count + 1;
elsif Subject (Cursor + 1) = ')' then
Paren_Count := Paren_Count - 1;
exit when Paren_Count = 0;
end if;
end loop;
end;
end if;
Cursor := Cursor + 1;
Push (Node);
goto Succeed;
-- Break (one character case)
when PC_Break_CH =>
Dout (Img (Node) & "matching Break", Node.Char);
while Cursor < Length loop
if Subject (Cursor + 1) = Node.Char then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
-- Break (character set case)
when PC_Break_CS =>
Dout (Img (Node) & "matching Break", Node.CS);
while Cursor < Length loop
if Is_In (Subject (Cursor + 1), Node.CS) then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
-- Break (string function case)
when PC_Break_VF => declare
U : constant VString := Node.VF.all;
Str : constant String_Access := Get_String (U);
begin
Dout (Img (Node) & "matching Break", Str.all);
while Cursor < Length loop
if Is_In (Subject (Cursor + 1), Str.all) then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
end;
-- Break (string pointer case)
when PC_Break_VP => declare
Str : String_Access := Get_String (Node.VP.all);
begin
Dout (Img (Node) & "matching Break", Str.all);
while Cursor < Length loop
if Is_In (Subject (Cursor + 1), Str.all) then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
end;
-- BreakX (one character case)
when PC_BreakX_CH =>
Dout (Img (Node) & "matching BreakX", Node.Char);
while Cursor < Length loop
if Subject (Cursor + 1) = Node.Char then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
-- BreakX (character set case)
when PC_BreakX_CS =>
Dout (Img (Node) & "matching BreakX", Node.CS);
while Cursor < Length loop
if Is_In (Subject (Cursor + 1), Node.CS) then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
-- BreakX (string function case)
when PC_BreakX_VF => declare
U : constant VString := Node.VF.all;
Str : constant String_Access := Get_String (U);
begin
Dout (Img (Node) & "matching BreakX", Str.all);
while Cursor < Length loop
if Is_In (Subject (Cursor + 1), Str.all) then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
end;
-- BreakX (string pointer case)
when PC_BreakX_VP => declare
Str : String_Access := Get_String (Node.VP.all);
begin
Dout (Img (Node) & "matching BreakX", Str.all);
while Cursor < Length loop
if Is_In (Subject (Cursor + 1), Str.all) then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
end;
-- BreakX_X (BreakX extension). See section on "Compound Pattern
-- Structures". This node is the alternative that is stacked
-- to skip past the break character and extend the break.
when PC_BreakX_X =>
Dout (Img (Node) & "extending BreakX");
Cursor := Cursor + 1;
goto Succeed;
-- Character (one character string)
when PC_Char =>
Dout (Img (Node) & "matching '" & Node.Char & ''');
if Cursor < Length
and then Subject (Cursor + 1) = Node.Char
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
-- End of Pattern
when PC_EOP =>
if Stack_Base = Stack_Init then
Dout ("end of pattern");
goto Match_Succeed;
-- End of recursive inner match. See separate section on
-- handing of recursive pattern matches for details.
else
Dout ("terminating recursive match");
Node := Stack (Stack_Base - 1).Node;
Pop_Region;
goto Match;
end if;
-- Fail
when PC_Fail =>
Dout (Img (Node) & "matching Fail");
goto Fail;
-- Fence (built in pattern)
when PC_Fence =>
Dout (Img (Node) & "matching Fence");
Push (CP_Cancel'Access);
goto Succeed;
-- Fence function node X. This is the node that gets control
-- after a successful match of the fenced pattern.
when PC_Fence_X =>
Dout (Img (Node) & "matching Fence function");
Stack_Ptr := Stack_Ptr + 1;
Stack (Stack_Ptr).Cursor := Stack_Base;
Stack (Stack_Ptr).Node := CP_Fence_Y'Access;
Stack_Base := Stack (Stack_Base).Cursor;
Region_Level := Region_Level - 1;
goto Succeed;
-- Fence function node Y. This is the node that gets control on
-- a failure that occurs after the fenced pattern has matched.
-- Note: the Cursor at this stage is actually the inner stack
-- base value. We don't reset this, but we do use it to strip
-- off all the entries made by the fenced pattern.
when PC_Fence_Y =>
Dout (Img (Node) & "pattern matched by Fence caused failure");
Stack_Ptr := Cursor - 2;
goto Fail;
-- Len (integer case)
when PC_Len_Nat =>
Dout (Img (Node) & "matching Len", Node.Nat);
if Cursor + Node.Nat > Length then
goto Fail;
else
Cursor := Cursor + Node.Nat;
goto Succeed;
end if;
-- Len (Integer function case)
when PC_Len_NF => declare
N : constant Natural := Node.NF.all;
begin
Dout (Img (Node) & "matching Len", N);
if Cursor + N > Length then
goto Fail;
else
Cursor := Cursor + N;
goto Succeed;
end if;
end;
-- Len (integer pointer case)
when PC_Len_NP =>
Dout (Img (Node) & "matching Len", Node.NP.all);
if Cursor + Node.NP.all > Length then
goto Fail;
else
Cursor := Cursor + Node.NP.all;
goto Succeed;
end if;
-- NotAny (one character case)
when PC_NotAny_CH =>
Dout (Img (Node) & "matching NotAny", Node.Char);
if Cursor < Length
and then Subject (Cursor + 1) /= Node.Char
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
-- NotAny (character set case)
when PC_NotAny_CS =>
Dout (Img (Node) & "matching NotAny", Node.CS);
if Cursor < Length
and then not Is_In (Subject (Cursor + 1), Node.CS)
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
-- NotAny (string function case)
when PC_NotAny_VF => declare
U : constant VString := Node.VF.all;
Str : constant String_Access := Get_String (U);
begin
Dout (Img (Node) & "matching NotAny", Str.all);
if Cursor < Length
and then
not Is_In (Subject (Cursor + 1), Str.all)
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
end;
-- NotAny (string pointer case)
when PC_NotAny_VP => declare
Str : String_Access := Get_String (Node.VP.all);
begin
Dout (Img (Node) & "matching NotAny", Str.all);
if Cursor < Length
and then
not Is_In (Subject (Cursor + 1), Str.all)
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
end;
-- NSpan (one character case)
when PC_NSpan_CH =>
Dout (Img (Node) & "matching NSpan", Node.Char);
while Cursor < Length
and then Subject (Cursor + 1) = Node.Char
loop
Cursor := Cursor + 1;
end loop;
goto Succeed;
-- NSpan (character set case)
when PC_NSpan_CS =>
Dout (Img (Node) & "matching NSpan", Node.CS);
while Cursor < Length
and then Is_In (Subject (Cursor + 1), Node.CS)
loop
Cursor := Cursor + 1;
end loop;
goto Succeed;
-- NSpan (string function case)
when PC_NSpan_VF => declare
U : constant VString := Node.VF.all;
Str : constant String_Access := Get_String (U);
begin
Dout (Img (Node) & "matching NSpan", Str.all);
while Cursor < Length
and then Is_In (Subject (Cursor + 1), Str.all)
loop
Cursor := Cursor + 1;
end loop;
goto Succeed;
end;
-- NSpan (string pointer case)
when PC_NSpan_VP => declare
Str : String_Access := Get_String (Node.VP.all);
begin
Dout (Img (Node) & "matching NSpan", Str.all);
while Cursor < Length
and then Is_In (Subject (Cursor + 1), Str.all)
loop
Cursor := Cursor + 1;
end loop;
goto Succeed;
end;
when PC_Null =>
Dout (Img (Node) & "matching null");
goto Succeed;
-- Pos (integer case)
when PC_Pos_Nat =>
Dout (Img (Node) & "matching Pos", Node.Nat);
if Cursor = Node.Nat then
goto Succeed;
else
goto Fail;
end if;
-- Pos (Integer function case)
when PC_Pos_NF => declare
N : constant Natural := Node.NF.all;
begin
Dout (Img (Node) & "matching Pos", N);
if Cursor = N then
goto Succeed;
else
goto Fail;
end if;
end;
-- Pos (integer pointer case)
when PC_Pos_NP =>
Dout (Img (Node) & "matching Pos", Node.NP.all);
if Cursor = Node.NP.all then
goto Succeed;
else
goto Fail;
end if;
-- Predicate function
when PC_Pred_Func =>
Dout (Img (Node) & "matching predicate function");
if Node.BF.all then
goto Succeed;
else
goto Fail;
end if;
-- Region Enter. Initiate new pattern history stack region
when PC_R_Enter =>
Dout (Img (Node) & "starting match of nested pattern");
Stack (Stack_Ptr + 1).Cursor := Cursor;
Push_Region;
goto Succeed;
-- Region Remove node. This is the node stacked by an R_Enter.
-- It removes the special format stack entry right underneath, and
-- then restores the outer level stack base and signals failure.
-- Note: the cursor value at this stage is actually the (negative)
-- stack base value for the outer level.
when PC_R_Remove =>
Dout ("failure, match of nested pattern terminated");
Stack_Base := Cursor;
Region_Level := Region_Level - 1;
Stack_Ptr := Stack_Ptr - 1;
goto Fail;
-- Region restore node. This is the node stacked at the end of an
-- inner level match. Its function is to restore the inner level
-- region, so that alternatives in this region can be sought.
-- Note: the Cursor at this stage is actually the negative of the
-- inner stack base value, which we use to restore the inner region.
when PC_R_Restore =>
Dout ("failure, search for alternatives in nested pattern");
Region_Level := Region_Level + 1;
Stack_Base := Cursor;
goto Fail;
-- Rest
when PC_Rest =>
Dout (Img (Node) & "matching Rest");
Cursor := Length;
goto Succeed;
-- Initiate recursive match (pattern pointer case)
when PC_Rpat =>
Stack (Stack_Ptr + 1).Node := Node.Pthen;
Push_Region;
Dout (Img (Node) & "initiating recursive match");
if Stack_Ptr + Node.PP.all.Stk >= Stack_Size then
raise Pattern_Stack_Overflow;
else
Node := Node.PP.all.P;
goto Match;
end if;
-- RPos (integer case)
when PC_RPos_Nat =>
Dout (Img (Node) & "matching RPos", Node.Nat);
if Cursor = (Length - Node.Nat) then
goto Succeed;
else
goto Fail;
end if;
-- RPos (integer function case)
when PC_RPos_NF => declare
N : constant Natural := Node.NF.all;
begin
Dout (Img (Node) & "matching RPos", N);
if Length - Cursor = N then
goto Succeed;
else
goto Fail;
end if;
end;
-- RPos (integer pointer case)
when PC_RPos_NP =>
Dout (Img (Node) & "matching RPos", Node.NP.all);
if Cursor = (Length - Node.NP.all) then
goto Succeed;
else
goto Fail;
end if;
-- RTab (integer case)
when PC_RTab_Nat =>
Dout (Img (Node) & "matching RTab", Node.Nat);
if Cursor <= (Length - Node.Nat) then
Cursor := Length - Node.Nat;
goto Succeed;
else
goto Fail;
end if;
-- RTab (integer function case)
when PC_RTab_NF => declare
N : constant Natural := Node.NF.all;
begin
Dout (Img (Node) & "matching RPos", N);
if Length - Cursor >= N then
Cursor := Length - N;
goto Succeed;
else
goto Fail;
end if;
end;
-- RTab (integer pointer case)
when PC_RTab_NP =>
Dout (Img (Node) & "matching RPos", Node.NP.all);
if Cursor <= (Length - Node.NP.all) then
Cursor := Length - Node.NP.all;
goto Succeed;
else
goto Fail;
end if;
-- Cursor assignment
when PC_Setcur =>
Dout (Img (Node) & "matching Setcur");
Node.Var.all := Cursor;
goto Succeed;
-- Span (one character case)
when PC_Span_CH => declare
P : Natural := Cursor;
begin
Dout (Img (Node) & "matching Span", Node.Char);
while P < Length
and then Subject (P + 1) = Node.Char
loop
P := P + 1;
end loop;
if P /= Cursor then
Cursor := P;
goto Succeed;
else
goto Fail;
end if;
end;
-- Span (character set case)
when PC_Span_CS => declare
P : Natural := Cursor;
begin
Dout (Img (Node) & "matching Span", Node.CS);
while P < Length
and then Is_In (Subject (P + 1), Node.CS)
loop
P := P + 1;
end loop;
if P /= Cursor then
Cursor := P;
goto Succeed;
else
goto Fail;
end if;
end;
-- Span (string function case)
when PC_Span_VF => declare
U : constant VString := Node.VF.all;
Str : constant String_Access := Get_String (U);
P : Natural := Cursor;
begin
Dout (Img (Node) & "matching Span", Str.all);
while P < Length
and then Is_In (Subject (P + 1), Str.all)
loop
P := P + 1;
end loop;
if P /= Cursor then
Cursor := P;
goto Succeed;
else
goto Fail;
end if;
end;
-- Span (string pointer case)
when PC_Span_VP => declare
Str : String_Access := Get_String (Node.VP.all);
P : Natural := Cursor;
begin
Dout (Img (Node) & "matching Span", Str.all);
while P < Length
and then Is_In (Subject (P + 1), Str.all)
loop
P := P + 1;
end loop;
if P /= Cursor then
Cursor := P;
goto Succeed;
else
goto Fail;
end if;
end;
-- String (two character case)
when PC_String_2 =>
Dout (Img (Node) & "matching " & Image (Node.Str2));
if (Length - Cursor) >= 2
and then Subject (Cursor + 1 .. Cursor + 2) = Node.Str2
then
Cursor := Cursor + 2;
goto Succeed;
else
goto Fail;
end if;
-- String (three character case)
when PC_String_3 =>
Dout (Img (Node) & "matching " & Image (Node.Str3));
if (Length - Cursor) >= 3
and then Subject (Cursor + 1 .. Cursor + 3) = Node.Str3
then
Cursor := Cursor + 3;
goto Succeed;
else
goto Fail;
end if;
-- String (four character case)
when PC_String_4 =>
Dout (Img (Node) & "matching " & Image (Node.Str4));
if (Length - Cursor) >= 4
and then Subject (Cursor + 1 .. Cursor + 4) = Node.Str4
then
Cursor := Cursor + 4;
goto Succeed;
else
goto Fail;
end if;
-- String (five character case)
when PC_String_5 =>
Dout (Img (Node) & "matching " & Image (Node.Str5));
if (Length - Cursor) >= 5
and then Subject (Cursor + 1 .. Cursor + 5) = Node.Str5
then
Cursor := Cursor + 5;
goto Succeed;
else
goto Fail;
end if;
-- String (six character case)
when PC_String_6 =>
Dout (Img (Node) & "matching " & Image (Node.Str6));
if (Length - Cursor) >= 6
and then Subject (Cursor + 1 .. Cursor + 6) = Node.Str6
then
Cursor := Cursor + 6;
goto Succeed;
else
goto Fail;
end if;
-- String (case of more than six characters)
when PC_String => declare
Len : constant Natural := Node.Str'Length;
begin
Dout (Img (Node) & "matching " & Image (Node.Str.all));
if (Length - Cursor) >= Len
and then Node.Str.all = Subject (Cursor + 1 .. Cursor + Len)
then
Cursor := Cursor + Len;
goto Succeed;
else
goto Fail;
end if;
end;
-- String (function case)
when PC_String_VF => declare
U : constant VString := Node.VF.all;
Str : constant String_Access := Get_String (U);
Len : constant Natural := Str'Length;
begin
Dout (Img (Node) & "matching " & Image (Str.all));
if (Length - Cursor) >= Len
and then Str.all = Subject (Cursor + 1 .. Cursor + Len)
then
Cursor := Cursor + Len;
goto Succeed;
else
goto Fail;
end if;
end;
-- String (vstring pointer case)
when PC_String_VP => declare
S : String_Access := Get_String (Node.VP.all);
Len : constant Natural :=
Ada.Strings.Unbounded.Length (Node.VP.all);
begin
Dout
(Img (Node) & "matching " & Image (S.all));
if (Length - Cursor) >= Len
and then S.all = Subject (Cursor + 1 .. Cursor + Len)
then
Cursor := Cursor + Len;
goto Succeed;
else
goto Fail;
end if;
end;
-- Succeed
when PC_Succeed =>
Dout (Img (Node) & "matching Succeed");
Push (Node);
goto Succeed;
-- Tab (integer case)
when PC_Tab_Nat =>
Dout (Img (Node) & "matching Tab", Node.Nat);
if Cursor <= Node.Nat then
Cursor := Node.Nat;
goto Succeed;
else
goto Fail;
end if;
-- Tab (integer function case)
when PC_Tab_NF => declare
N : constant Natural := Node.NF.all;
begin
Dout (Img (Node) & "matching Tab ", N);
if Cursor <= N then
Cursor := N;
goto Succeed;
else
goto Fail;
end if;
end;
-- Tab (integer pointer case)
when PC_Tab_NP =>
Dout (Img (Node) & "matching Tab ", Node.NP.all);
if Cursor <= Node.NP.all then
Cursor := Node.NP.all;
goto Succeed;
else
goto Fail;
end if;
-- Unanchored movement
when PC_Unanchored =>
Dout ("attempting to move anchor point");
-- All done if we tried every position
if Cursor > Length then
goto Match_Fail;
-- Otherwise extend the anchor point, and restack ourself
else
Cursor := Cursor + 1;
Push (Node);
goto Succeed;
end if;
-- Write immediate. This node performs the actual write
when PC_Write_Imm =>
Dout (Img (Node) & "executing immediate write of " &
Subject (Stack (Stack_Base - 1).Cursor + 1 .. Cursor));
Put_Line
(Node.FP.all,
Subject (Stack (Stack_Base - 1).Cursor + 1 .. Cursor));
Pop_Region;
goto Succeed;
-- Write on match. This node sets up for the eventual write
when PC_Write_OnM =>
Dout (Img (Node) & "registering deferred write");
Stack (Stack_Base - 1).Node := Node;
Push (CP_Assign'Access);
Pop_Region;
Assign_OnM := True;
goto Succeed;
end case;
-- We are NOT allowed to fall though this case statement, since every
-- match routine must end by executing a goto to the appropriate point
-- in the finite state machine model.
Logic_Error;
end XMatchD;
end GNAT.Spitbol.Patterns;
| 30.759678 | 79 | 0.521184 |
a1b85343f7d74a2473faeee52791d7cebc24a545 | 794 | ada | Ada | Task/Universal-Turing-machine/Ada/universal-turing-machine-3.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:38.000Z | 2018-11-09T22:08:38.000Z | Task/Universal-Turing-machine/Ada/universal-turing-machine-3.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | null | null | null | Task/Universal-Turing-machine/Ada/universal-turing-machine-3.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:40.000Z | 2018-11-09T22:08:40.000Z | with Ada.Text_IO, Turing;
procedure Simple_Incrementer is
type States is (Start, Stop);
type Symbols is (Blank, One);
package UTM is new Turing(States, Symbols);
use UTM;
Map: Symbol_Map := (One => '1', Blank => '_');
Rules: Rules_Type :=
(Start => (One => (Start, Right, One),
Blank => (Stop, Stay, One)));
Tape: Tape_Type := To_Tape("111", Map);
procedure Put_Tape(Tape: Tape_Type; Current: States) is
begin
Ada.Text_IO.Put_Line(To_String(Tape, Map) & " " & States'Image(Current));
Ada.Text_IO.Put_Line(Position_To_String(Tape));
end Put_Tape;
begin
Run(Tape, Rules, 20, null); -- don't print the configuration during running
Put_Tape(Tape, Stop); -- print the final configuration
end Simple_Incrementer;
| 28.357143 | 79 | 0.641058 |
06893baee863e5137d581fd18917e0e027230d6b | 2,677 | ads | Ada | ada_lists/src/iface_lists-dynamic.ads | gerr135/ada_gems | fc1b55e991766110581fcc340c8bc7c51ef7a49b | [
"BSD-2-Clause"
] | 6 | 2020-11-26T20:01:50.000Z | 2022-03-04T22:22:12.000Z | ada_lists/src/iface_lists-dynamic.ads | gerr135/ada_gems | fc1b55e991766110581fcc340c8bc7c51ef7a49b | [
"BSD-2-Clause"
] | null | null | null | ada_lists/src/iface_lists-dynamic.ads | gerr135/ada_gems | fc1b55e991766110581fcc340c8bc7c51ef7a49b | [
"BSD-2-Clause"
] | null | null | null | --
-- This implementation encapsulates Ada.Containers.Vectors.Vector as a record entry.
-- This is a common way to compose enveloping type, requiring glue code to implement all
-- declared methods. SImple to understand, but only explicitly declared methods are available.
--
-- Copyright (C) 2018 George SHapovalov <[email protected]>
--
-- 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 Ada.Containers.Vectors;
generic
type Element_Type is new Element_Interface with private;
package Iface_Lists.dynamic is
type List is new List_Interface with private;
overriding
function Element_Constant_Reference (Container : aliased in List; Position : Cursor) return Constant_Reference_Type;
overriding
function Element_Constant_Reference (Container : aliased in List; Index : Index_Type) return Constant_Reference_Type;
overriding
function Element_Reference (Container : aliased in out List; Position : Cursor) return Reference_Type;
overriding
function Element_Reference (Container : aliased in out List; Index : Index_Type) return Reference_Type;
overriding
function Iterate (Container : in List) return Iterator_Interface'Class;
---- Extras --
overriding
function Length (Container : aliased in out List) return Index_Base;
overriding
function First_Index(Container : aliased in out List) return Index_Type;
overriding
function Last_Index (Container : aliased in out List) return Index_Type;
-- new methods from ACV.Vector pool; should really be part of interface, here is only a demo of tying all together..
function To_Vector (Length : Index_Type) return List;
private
package ACV is new Ada.Containers.Vectors(Index_Type, Element_Type);
type List is new List_Interface with record
vec : ACV.Vector;
end record;
function Has_Element (L : List; Position : Index_Base) return Boolean;
-- here we also need to implement Reversible_Iterator interface
type Iterator is new Iterator_Interface with record
Container : List_Access;
Index : Index_Type'Base;
end record;
overriding
function First (Object : Iterator) return Cursor;
overriding
function Last (Object : Iterator) return Cursor;
overriding
function Next (Object : Iterator; Position : Cursor) return Cursor;
overriding
function Previous (Object : Iterator; Position : Cursor) return Cursor;
end Iface_Lists.dynamic;
| 32.646341 | 121 | 0.743369 |
577f70544601d89a4c97a6ba7e5b66353f966c42 | 5,535 | ads | Ada | src/implementation/cl_gl/cl-api-cl_gl.ads | flyx/OpenCLAda | a03a82842b11edda44c8a85f737f5111d1a522a4 | [
"0BSD"
] | 8 | 2015-02-10T20:04:25.000Z | 2021-06-25T07:46:31.000Z | src/implementation/cl_gl/cl-api-cl_gl.ads | flyx/OpenCLAda | a03a82842b11edda44c8a85f737f5111d1a522a4 | [
"0BSD"
] | 1 | 2015-09-10T00:01:55.000Z | 2015-09-10T10:42:23.000Z | src/implementation/cl_gl/cl-api-cl_gl.ads | flyx/OpenCLAda | a03a82842b11edda44c8a85f737f5111d1a522a4 | [
"0BSD"
] | 1 | 2017-02-13T23:07:06.000Z | 2017-02-13T23:07:06.000Z | --------------------------------------------------------------------------------
-- Copyright (c) 2013, Felix Krause <[email protected]>
--
-- Permission to use, copy, modify, and/or distribute this software for any
-- purpose with or without fee is hereby granted, provided that the above
-- copyright notice and this permission notice appear in all copies.
--
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
-- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
-- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
-- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
--------------------------------------------------------------------------------
with CL.Memory.CL_GL;
with CL.Enumerations.CL_GL;
with GL.Low_Level.Enums;
with GL.Objects.Textures;
with GL.Types;
package CL.API.CL_GL is
function Create_From_GL_Buffer (Context : System.Address;
Flags : Bitfield;
GL_Object : IFC.unsigned;
Error : Enumerations.Error_Ptr)
return System.Address;
pragma Import (Convention => StdCall, Entity => Create_From_GL_Buffer,
External_Name => "clCreateFromGLBuffer");
function Create_From_GL_Texture_2D (Context : System.Address;
Flags : Bitfield;
Image_Type : GL.Low_Level.Enums.Texture_Kind;
Mip_Level : GL.Objects.Textures.Mipmap_Level;
Source : GL.Types.UInt;
Error : Enumerations.Error_Ptr)
return System.Address;
pragma Import (Convention => StdCall, Entity => Create_From_GL_Texture_2D,
External_Name => "clCreateFromGLTexture2D");
function Create_From_GL_Texture_3D (Context : System.Address;
Flags : Bitfield;
Image_Type : GL.Low_Level.Enums.Texture_Kind;
Mip_Level : GL.Objects.Textures.Mipmap_Level;
Source : GL.Types.UInt;
Error : Enumerations.Error_Ptr)
return System.Address;
pragma Import (Convention => StdCall, Entity => Create_From_GL_Texture_3D,
External_Name => "clCreateFromGLTexture3D");
function Create_From_GL_Renderbuffer (Context : System.Address;
Flags : Bitfield;
Renderbuffer : GL.Low_Level.Enums.Renderbuffer_Kind;
Error : Enumerations.Error_Ptr)
return System.Address;
pragma Import (Convention => StdCall, Entity => Create_From_GL_Renderbuffer,
External_Name => "clCreateFromGLRenderbuffer");
function Get_GL_Object_Info (Mem_Object : System.Address;
Object_Type : access CL.Memory.CL_GL.Object_Kind;
Object_Name : access GL.Types.UInt)
return Enumerations.Error_Code;
pragma Import (Convention => StdCall, Entity => Get_GL_Object_Info,
External_Name => "clGetGLObjectInfo");
function Get_GL_Texture_Info (Mem_Object : System.Address;
Param_Name : Enumerations.CL_GL.GL_Texture_Info;
Num_Entries : Size;
Value : System.Address;
Return_Size : Size_Ptr)
return Enumerations.Error_Code;
pragma Import (Convention => StdCall, Entity => Get_GL_Texture_Info,
External_Name => "clGetGLTextureInfo");
function Enqueue_Acquire_GL_Objects (Command_Queue : System.Address;
Num_Objects : UInt;
Object_List : Address_Ptr;
Num_Events : UInt;
Event_List : Address_Ptr;
Event : Address_Ptr)
return Enumerations.Error_Code;
pragma Import (Convention => StdCall, Entity => Enqueue_Acquire_GL_Objects,
External_Name => "clEnqueueAcquireGLObjects");
function Enqueue_Release_GL_Objects (Command_Queue : System.Address;
Num_Objects : UInt;
Object_List : Address_Ptr;
Num_Events : UInt;
Event_List : Address_Ptr;
Event : Address_Ptr)
return Enumerations.Error_Code;
pragma Import (Convention => StdCall, Entity => Enqueue_Release_GL_Objects,
External_Name => "clEnqueueReleaseGLObjects");
end CL.API.CL_GL;
| 56.479592 | 93 | 0.51346 |
5741e998ab3004f926d2431e5d0682f4baeab775 | 2,726 | ads | Ada | llvm-gcc-4.2-2.9/gcc/ada/s-expint.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | 1 | 2016-04-09T02:58:13.000Z | 2016-04-09T02:58:13.000Z | llvm-gcc-4.2-2.9/gcc/ada/s-expint.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/s-expint.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . E X P I N T --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2005 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Integer exponentiation (checks on)
package System.Exp_Int is
pragma Pure;
function Exp_Integer
(Left : Integer;
Right : Natural)
return Integer;
end System.Exp_Int;
| 60.577778 | 78 | 0.426266 |
5999ef7990de684e80871029b12eda9d10b41c54 | 308 | ads | Ada | source/hash/a-szuzha.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 33 | 2015-04-04T09:19:36.000Z | 2021-11-10T05:33:34.000Z | source/hash/a-szuzha.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 8 | 2017-11-14T13:05:07.000Z | 2018-08-09T15:28:49.000Z | source/hash/a-szuzha.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 9 | 2015-02-03T17:09:53.000Z | 2021-11-12T01:16:05.000Z | pragma License (Unrestricted);
with Ada.Strings.Generic_Unbounded.Generic_Hash;
with Ada.Strings.Wide_Wide_Hash;
function Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Hash is
new Unbounded_Wide_Wide_Strings.Generic_Hash (Wide_Wide_Hash);
pragma Preelaborate (Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Hash);
| 44 | 69 | 0.863636 |
29f10e0613348437c6ec021672096ea876a0b71c | 8,426 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/s-tasini.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/ada/s-tasini.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/s-tasini.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . T A S K I N G . I N I T I A L I Z A T I O N --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2014, Free Software Foundation, Inc. --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
-- This package provides overall initialization of the tasking portion of the
-- RTS. This package must be elaborated before any tasking features are used.
package System.Tasking.Initialization is
procedure Remove_From_All_Tasks_List (T : Task_Id);
-- Remove T from All_Tasks_List. Call this function with RTS_Lock taken
procedure Finalize_Attributes (T : Task_Id);
-- Finalize all attributes from T. This is to be called just before the
-- ATCB is deallocated. It relies on the caller holding T.L write-lock
-- on entry.
---------------------------------
-- Tasking-Specific Soft Links --
---------------------------------
-------------------------
-- Abort Defer/Undefer --
-------------------------
-- Defer_Abort defers the effects of low-level abort and priority change
-- in the calling task until a matching Undefer_Abort call is executed.
-- Undefer_Abort DOES MORE than just undo the effects of one call to
-- Defer_Abort. It is the universal "polling point" for deferred
-- processing, including the following:
-- 1) base priority changes
-- 2) abort/ATC
-- Abort deferral MAY be nested (Self_ID.Deferral_Level is a count), but
-- to avoid waste and undetected errors, it generally SHOULD NOT be
-- nested. The symptom of over-deferring abort is that an exception may
-- fail to be raised, or an abort may fail to take place.
-- Therefore, there are two sets of the inlineable defer/undefer routines,
-- which are the ones to be used inside GNARL. One set allows nesting. The
-- other does not. People who maintain the GNARL should try to avoid using
-- the nested versions, or at least look very critically at the places
-- where they are used.
-- In general, any GNARL call that is potentially blocking, or whose
-- semantics require that it sometimes raise an exception, or that is
-- required to be an abort completion point, must be made with abort
-- Deferral_Level = 1.
-- In general, non-blocking GNARL calls, which may be made from inside a
-- protected action, are likely to need to allow nested abort deferral.
-- With some critical exceptions (which are supposed to be documented),
-- internal calls to the tasking runtime system assume abort is already
-- deferred, and do not modify the deferral level.
-- There is also a set of non-inlineable defer/undefer routines, for direct
-- call from the compiler. These are not inlineable because they may need
-- to be called via pointers ("soft links"). For the sake of efficiency,
-- the version with Self_ID as parameter should used wherever possible.
-- These are all nestable.
-- Non-nestable inline versions
procedure Defer_Abort (Self_ID : Task_Id);
pragma Inline (Defer_Abort);
procedure Undefer_Abort (Self_ID : Task_Id);
pragma Inline (Undefer_Abort);
-- Nestable inline versions
procedure Defer_Abort_Nestable (Self_ID : Task_Id);
pragma Inline (Defer_Abort_Nestable);
procedure Undefer_Abort_Nestable (Self_ID : Task_Id);
pragma Inline (Undefer_Abort_Nestable);
procedure Do_Pending_Action (Self_ID : Task_Id);
-- Only call with no locks, and when Self_ID.Pending_Action = True Perform
-- necessary pending actions (e.g. abort, priority change). This procedure
-- is usually called when needed as a result of calling Undefer_Abort,
-- although in the case of e.g. No_Abort restriction, it can be necessary
-- to force execution of pending actions.
function Check_Abort_Status return Integer;
-- Returns Boolean'Pos (True) iff abort signal should raise
-- Standard'Abort_Signal. Only used by IRIX currently.
--------------------------
-- Change Base Priority --
--------------------------
procedure Change_Base_Priority (T : Task_Id);
-- Change the base priority of T. Has to be called with the affected
-- task's ATCB write-locked. May temporarily release the lock.
----------------------
-- Task Lock/Unlock --
----------------------
procedure Task_Lock (Self_ID : Task_Id);
pragma Inline (Task_Lock);
procedure Task_Unlock (Self_ID : Task_Id);
pragma Inline (Task_Unlock);
-- These are versions of Lock_Task and Unlock_Task created for use
-- within the GNARL.
procedure Final_Task_Unlock (Self_ID : Task_Id);
-- This version is only for use in Terminate_Task, when the task is
-- relinquishing further rights to its own ATCB. There is a very
-- interesting potential race condition there, where the old task may run
-- concurrently with a new task that is allocated the old tasks (now
-- reused) ATCB. The critical thing here is to not make any reference to
-- the ATCB after the lock is released. See also comments on
-- Terminate_Task and Unlock.
procedure Wakeup_Entry_Caller
(Self_ID : Task_Id;
Entry_Call : Entry_Call_Link;
New_State : Entry_Call_State);
pragma Inline (Wakeup_Entry_Caller);
-- This is called at the end of service of an entry call, to abort the
-- caller if he is in an abortable part, and to wake up the caller if he
-- is on Entry_Caller_Sleep. Call it holding the lock of Entry_Call.Self.
--
-- Timed_Call or Simple_Call:
-- The caller is waiting on Entry_Caller_Sleep, in Wait_For_Completion,
-- or Wait_For_Completion_With_Timeout.
--
-- Conditional_Call:
-- The caller might be in Wait_For_Completion,
-- waiting for a rendezvous (possibly requeued without abort) to
-- complete.
--
-- Asynchronous_Call:
-- The caller may be executing in the abortable part an async. select,
-- or on a time delay, if Entry_Call.State >= Was_Abortable.
procedure Locked_Abort_To_Level
(Self_ID : Task_Id;
T : Task_Id;
L : ATC_Level);
pragma Inline (Locked_Abort_To_Level);
-- Abort a task to a specified ATC level. Call this only with T locked
end System.Tasking.Initialization;
| 47.072626 | 79 | 0.597674 |
29b5833e34002bde17bbd97e69d54681708e1cd6 | 5,485 | ads | Ada | src/GBA.BIOS.Extended_Interface.ads | 98devin/ada-gba-dev | 6ebca014b7537117144d878db8d13db49aa00cee | [
"Zlib"
] | 7 | 2021-04-08T02:32:54.000Z | 2022-02-14T01:21:43.000Z | src/GBA.BIOS.Extended_Interface.ads | 98devin/ada-gba-dev | 6ebca014b7537117144d878db8d13db49aa00cee | [
"Zlib"
] | 15 | 2021-04-09T20:13:33.000Z | 2021-12-22T01:03:59.000Z | src/GBA.BIOS.Extended_Interface.ads | 98devin/ada-gba-dev | 6ebca014b7537117144d878db8d13db49aa00cee | [
"Zlib"
] | 1 | 2021-06-12T07:48:05.000Z | 2021-06-12T07:48:05.000Z | -- Copyright (c) 2021 Devin Hill
-- zlib License -- see LICENSE for details.
with GBA.Interrupts;
use GBA.Interrupts;
with GBA.Numerics;
use GBA.Numerics;
with GBA.Memory;
use GBA.Memory;
with Interfaces;
use Interfaces;
with GBA.Display.Backgrounds;
use GBA.Display.Backgrounds;
with GBA.Display.Objects;
use GBA.Display.Objects;
with GBA.BIOS.Generic_Interface;
generic
with package Raw is new GBA.BIOS.Generic_Interface (<>);
package GBA.BIOS.Extended_Interface is
-- Reexport functionality from Raw interface --
-- Marked Inline_Always so that link-time optimization
-- takes place and reduces these to a pure `svc` instruction.
-- This eliminates the overhead of a function call to BIOS routines.
-- Unfortunately, due to the numeric code of the interrupts
-- being different in ARM and THUMB mode, we still need to have
-- two versions of this package. We share as much as possible by
-- making them instances of this same generic package.
procedure Soft_Reset renames Raw.Soft_Reset with Inline_Always;
procedure Hard_Reset renames Raw.Hard_Reset with Inline_Always;
procedure Halt renames Raw.Halt with Inline_Always;
procedure Stop renames Raw.Stop with Inline_Always;
procedure Register_RAM_Reset (Flags : Register_RAM_Reset_Flags)
renames Raw.Register_RAM_Reset with Inline_Always;
procedure Wait_For_Interrupt (New_Only : Boolean; Wait_For : Interrupt_Flags)
renames Raw.Wait_For_Interrupt with Inline_Always;
procedure Wait_For_VBlank
renames Raw.Wait_For_VBlank with Inline_Always;
function Div_Mod (N, D : Integer) return Long_Long_Integer
renames Raw.Div_Mod with Inline_Always;
function Div_Mod_Arm (D, N : Integer) return Long_Long_Integer
renames Raw.Div_Mod_Arm with Inline_Always;
function Sqrt (N : Unsigned_32) return Unsigned_16
renames Raw.Sqrt with Inline_Always;
function Arc_Tan (X, Y : Fixed_2_14) return Radians_16
renames Raw.Arc_Tan with Inline_Always;
procedure Cpu_Set (S, D : Address; Config : Cpu_Set_Config)
renames Raw.Cpu_Set with Inline_Always;
procedure Cpu_Fast_Set (S, D : Address; Config : Cpu_Set_Config)
renames Raw.Cpu_Fast_Set with Inline_Always;
function Bios_Checksum return Unsigned_32
renames Raw.Bios_Checksum with Inline_Always;
procedure Affine_Set_Ext (Parameters : Address; Transform : Address; Count : Integer)
renames Raw.Affine_Set_Ext with Inline_Always;
procedure Affine_Set (Parameters : Address; Transform : Address; Count, Stride : Integer)
renames Raw.Affine_Set with Inline_Always;
-- More convenient interfaces to Raw functions --
-- Most routines should be Inline_Always, and delegate to the underlying Raw routine.
-- Any functionality which needs to compose results from multiple BIOS calls
-- should be external to this package, and depend on it either by being generic,
-- or importing the Arm or Thumb instantiations as required.
procedure Register_RAM_Reset
( Clear_External_WRAM
, Clear_Internal_WRAM
, Clear_Palette
, Clear_VRAM
, Clear_OAM
, Reset_SIO_Registers
, Reset_Sound_Registers
, Reset_Other_Registers
: Boolean := False)
with Inline_Always;
procedure Wait_For_Interrupt (Wait_For : Interrupt_Flags)
with Inline_Always;
function Divide (Num, Denom : Integer) return Integer
with Pure_Function, Inline_Always;
function Remainder (Num, Denom : Integer) return Integer
with Pure_Function, Inline_Always;
procedure Div_Mod (Num, Denom : Integer; Quotient, Remainder : out Integer)
with Inline_Always;
procedure Cpu_Set
( Source, Dest : Address;
Unit_Count : Cpu_Set_Unit_Count;
Mode : Cpu_Set_Mode;
Unit_Size : Cpu_Set_Unit_Size )
with Inline_Always;
procedure Cpu_Fast_Set
( Source, Dest : Address;
Word_Count : Cpu_Set_Unit_Count;
Mode : Cpu_Set_Mode )
with Inline_Always;
--
-- Single-matrix affine transform computation
--
procedure Affine_Set
( Parameters : Affine_Parameters;
Transform : out Affine_Transform_Matrix )
with Inline_Always;
procedure Affine_Set
( Parameters : Affine_Parameters;
Transform : OBJ_Affine_Transform_Index )
with Inline_Always;
procedure Affine_Set_Ext
( Parameters : Affine_Parameters_Ext;
Transform : out BG_Transform_Info )
with Inline_Always;
--
-- Multiple-matrix affine transform computation
--
type OBJ_Affine_Parameter_Array is
array (OBJ_Affine_Transform_Index range <>) of Affine_Parameters;
procedure Affine_Set (Parameters : OBJ_Affine_Parameter_Array)
with Inline_Always;
type BG_Affine_Parameter_Ext_Array is
array (Affine_BG_ID range <>) of Affine_Parameters_Ext;
procedure Affine_Set_Ext (Parameters : BG_Affine_Parameter_Ext_Array)
with Inline_Always;
type Affine_Parameter_Array is
array (Natural range <>) of Affine_Parameters;
type Affine_Transform_Array is
array (Natural range <>) of Affine_Transform_Matrix;
procedure Affine_Set
( Parameters : Affine_Parameter_Array;
Transforms : out Affine_Transform_Array )
with Inline_Always;
type Affine_Parameter_Ext_Array is
array (Natural range <>) of Affine_Parameters_Ext;
procedure Affine_Set_Ext
( Parameters : Affine_Parameter_Ext_Array;
Transforms : out BG_Transform_Info_Array )
with Inline_Always;
end GBA.BIOS.Extended_Interface; | 29.648649 | 91 | 0.749863 |
1c2e5c1cf950aa3c86bd58f9137e7024c2e869ff | 2,474 | adb | Ada | chat_client_2.adb | cborao/Ada-P4-chat | 233f350bb99671d62e940911643d3904540a9dd3 | [
"MIT"
] | null | null | null | chat_client_2.adb | cborao/Ada-P4-chat | 233f350bb99671d62e940911643d3904540a9dd3 | [
"MIT"
] | null | null | null | chat_client_2.adb | cborao/Ada-P4-chat | 233f350bb99671d62e940911643d3904540a9dd3 | [
"MIT"
] | null | null | null |
--PRÁCTICA 4: CÉSAR BORAO MORATINOS (Chat_Client_2)
with Handlers;
with Ada.Text_IO;
with Chat_Messages;
with Lower_Layer_UDP;
with Ada.Command_Line;
with Ada.Strings.Unbounded;
procedure Chat_Client_2 is
package ATI renames Ada.Text_IO;
package CM renames Chat_Messages;
package LLU renames Lower_Layer_UDP;
package ACL renames Ada.Command_Line;
package ASU renames Ada.Strings.Unbounded;
use type CM.Message_Type;
Server_EP: LLU.End_Point_Type;
Port: Integer;
Nick: ASU.Unbounded_String;
Client_EP_Receive: LLU.End_Point_Type;
Client_EP_Handler: LLU.End_Point_Type;
Buffer_In: aliased LLU.Buffer_Type(1024);
Buffer_Out: aliased LLU.Buffer_Type(1024);
Mess: CM.Message_Type;
Expired: Boolean;
Accepted: Boolean;
Comment: ASU.Unbounded_String;
begin
--Binding
Port := Integer'Value(ACL.Argument(2));
Server_EP := LLU.Build(LLU.To_IP(ACL.Argument(1)),Port);
Nick := ASU.To_Unbounded_String(ACL.Argument(3));
LLU.Bind_Any(Client_EP_Receive);
LLU.Bind_Any(Client_EP_Handler, Handlers.Client_Handler'Access);
LLU.Reset(Buffer_In);
if ACL.Argument_Count = 3 then
if ASU.To_String(Nick) /= "server" then
--Init Message
CM.Init_Message(Server_EP,Client_EP_Receive,
Client_EP_Handler,Nick,Buffer_Out'Access);
LLU.Receive(Client_EP_Receive, Buffer_In'Access, 10.0, Expired);
if Expired then
ATI.Put_Line("Server unreachable");
else
--Server Reply
Mess := CM.Message_Type'Input(Buffer_In'Access);
Accepted := Boolean'Input(Buffer_In'Access);
LLU.Reset(Buffer_In);
if Accepted then
ATI.Put_Line("Mini-Chat v2.0: Welcome "
& ASU.To_String(Nick));
loop
ATI.Put(">> ");
Comment := ASU.To_Unbounded_String(ATI.Get_Line);
exit when ASU.To_String(Comment) = ".quit";
--Writer Message
CM.Writer_Message(Server_EP,Client_EP_Handler,
Nick,Comment,Buffer_Out'Access);
end loop;
--Logout Message
CM.Logout_Message(Server_EP,Client_EP_Handler,
Nick,Buffer_Out'Access);
else
ATI.Put_Line("Mini-Chat v2.0: IGNORED new user " &
ASU.To_String(Nick) & ", nick already used");
end if;
end if;
else
ATI.New_Line;
ATI.Put_Line("Nick 'server' not avaliable, try again");
ATI.New_Line;
end if;
else
ATI.New_Line;
ATI.Put_Line("Client Usage: [user] [Port] <nick>");
ATI.New_Line;
end if;
LLU.Finalize;
end Chat_Client_2;
| 24.989899 | 67 | 0.696443 |
2f70e9e8352e4e8e3fd7b2e95b1ba031335f81c2 | 3,946 | adb | Ada | tools-src/gnu/gcc/gcc/ada/a-diocst.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 80 | 2015-01-02T10:14:04.000Z | 2021-06-07T06:29:49.000Z | tools-src/gnu/gcc/gcc/ada/a-diocst.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 9 | 2015-05-14T11:03:12.000Z | 2018-01-04T07:12:58.000Z | tools-src/gnu/gcc/gcc/ada/a-diocst.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . D I R E C T _ I O . C _ S T R E A M S --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-1998 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Interfaces.C_Streams; use Interfaces.C_Streams;
with System.File_IO;
with System.File_Control_Block;
with System.Direct_IO;
with Unchecked_Conversion;
package body Ada.Direct_IO.C_Streams is
package FIO renames System.File_IO;
package FCB renames System.File_Control_Block;
package DIO renames System.Direct_IO;
subtype AP is FCB.AFCB_Ptr;
function To_FCB is new Unchecked_Conversion (File_Mode, FCB.File_Mode);
--------------
-- C_Stream --
--------------
function C_Stream (F : File_Type) return FILEs is
begin
FIO.Check_File_Open (AP (F));
return F.Stream;
end C_Stream;
----------
-- Open --
----------
procedure Open
(File : in out File_Type;
Mode : in File_Mode;
C_Stream : in FILEs;
Form : in String := "")
is
File_Control_Block : DIO.Direct_AFCB;
begin
FIO.Open (File_Ptr => AP (File),
Dummy_FCB => File_Control_Block,
Mode => To_FCB (Mode),
Name => "",
Form => Form,
Amethod => 'D',
Creat => False,
Text => False,
C_Stream => C_Stream);
File.Bytes := Bytes;
end Open;
end Ada.Direct_IO.C_Streams;
| 44.337079 | 78 | 0.448302 |
a15af839bd34022cb90068415fdb3d55f3cd5e84 | 1,275 | ads | Ada | software/hal/boards/components/FM25V0x/fm25v0x.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 12 | 2017-06-08T14:19:57.000Z | 2022-03-09T02:48:59.000Z | software/hal/boards/components/FM25V0x/fm25v0x.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 6 | 2017-06-08T13:13:50.000Z | 2020-05-15T09:32:43.000Z | software/hal/boards/components/FM25V0x/fm25v0x.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 3 | 2017-06-30T14:05:06.000Z | 2022-02-17T12:20:45.000Z | -- Institution: Technische Universität München
-- Department: Real-Time Computer Systems (RCS)
-- Project: StratoX
-- Authors: Martin Becker ([email protected])
with Ada.Real_Time; use Ada.Real_Time;
with HIL; use HIL;
-- @summary
-- SPI protocol to CYPRESS FM25v0x series (ferroelectric RAM, non-volatile)
generic
MEMSIZE_BYTES : Positive; -- FIXME: introduce datatype to constrain to 65kByte, beause we have 16bit addresses.
package FM25v0x with
SPARK_Mode
-- Abstract_State => State
is
--MEMSIZE_BYTES : constant := Memory_Size;
type Address is new Integer range 0 .. MEMSIZE_BYTES - 1;
procedure Init;
-- initialize the communication to the FRAM
procedure Self_Check (Status : out Boolean);
-- run a self-check.
-- @return true on success
-- @req Subsystem/Init/Selfcheck
procedure Read_Byte (addr : Address; byte : out HIL.Byte);
-- read a single byte
-- @req Subsystem/InvalidRequirement
procedure Write_Byte (addr : Address; byte : HIL.Byte);
-- with Pre => Is_Init;
-- write a single byte
private
Is_Init : Boolean := False;-- with Part_Of => State;
FM25v0x_STARTUP_TIME_MS : constant Time
:= Time_First + Milliseconds (1); -- datasheet: ~400 usec @3.3V
end FM25v0x;
| 30.357143 | 114 | 0.692549 |
416da2ef2bb50cf3a9e00e0d93149da4220216c6 | 7,884 | adb | Ada | awa/plugins/awa-comments/src/awa-comments-modules.adb | My-Colaborations/ada-awa | cc2dee291a14e4df0dbc9c10285bf284a7f1caa8 | [
"Apache-2.0"
] | 81 | 2015-01-18T23:02:30.000Z | 2022-03-19T17:34:57.000Z | awa/plugins/awa-comments/src/awa-comments-modules.adb | My-Colaborations/ada-awa | cc2dee291a14e4df0dbc9c10285bf284a7f1caa8 | [
"Apache-2.0"
] | 20 | 2015-12-09T19:26:19.000Z | 2022-03-23T14:32:43.000Z | awa/plugins/awa-comments/src/awa-comments-modules.adb | My-Colaborations/ada-awa | cc2dee291a14e4df0dbc9c10285bf284a7f1caa8 | [
"Apache-2.0"
] | 16 | 2015-06-29T02:44:06.000Z | 2021-09-23T18:47:50.000Z | -----------------------------------------------------------------------
-- awa-comments-module -- Comments module
-- Copyright (C) 2011, 2012, 2013, 2014 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.Calendar;
with Util.Log.Loggers;
with ADO.Sessions;
with ADO.Sessions.Entities;
with Security.Permissions;
with AWA.Users.Models;
with AWA.Permissions;
with AWA.Modules.Beans;
with AWA.Services.Contexts;
with AWA.Comments.Beans;
package body AWA.Comments.Modules is
Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("AWA.Comments.Module");
package Register is new AWA.Modules.Beans (Module => Comment_Module,
Module_Access => Comment_Module_Access);
-- ------------------------------
-- Initialize the comments module.
-- ------------------------------
overriding
procedure Initialize (Plugin : in out Comment_Module;
App : in AWA.Modules.Application_Access;
Props : in ASF.Applications.Config) is
begin
Log.Info ("Initializing the comments module");
-- Setup the resource bundles.
App.Register ("commentMsg", "comments");
-- Register the comment list bean.
Register.Register (Plugin => Plugin,
Name => "AWA.Comments.Beans.Comment_List_Bean",
Handler => AWA.Comments.Beans.Create_Comment_List_Bean'Access);
-- Register the comment bean.
Register.Register (Plugin => Plugin,
Name => "AWA.Comments.Beans.Comment_Bean",
Handler => AWA.Comments.Beans.Create_Comment_Bean'Access);
AWA.Modules.Module (Plugin).Initialize (App, Props);
end Initialize;
-- ------------------------------
-- Load the comment identified by the given identifier.
-- ------------------------------
procedure Load_Comment (Model : in Comment_Module;
Comment : in out AWA.Comments.Models.Comment_Ref'Class;
Id : in ADO.Identifier) is
pragma Unreferenced (Model);
Ctx : constant Services.Contexts.Service_Context_Access := AWA.Services.Contexts.Current;
DB : ADO.Sessions.Session := AWA.Services.Contexts.Get_Session (Ctx);
Found : Boolean;
begin
Comment.Load (DB, Id, Found);
end Load_Comment;
-- ------------------------------
-- Create a new comment for the associated database entity.
-- ------------------------------
procedure Create_Comment (Model : in Comment_Module;
Permission : in String;
Entity_Type : in String;
Comment : in out AWA.Comments.Models.Comment_Ref'Class) is
Ctx : constant Services.Contexts.Service_Context_Access := AWA.Services.Contexts.Current;
User : constant AWA.Users.Models.User_Ref := Ctx.Get_User;
DB : ADO.Sessions.Master_Session := AWA.Services.Contexts.Get_Master_Session (Ctx);
begin
Ctx.Start;
Log.Info ("Creating new comment for {0}", ADO.Identifier'Image (Comment.Get_Entity_Id));
-- Check that the user has the create permission on the given workspace.
AWA.Permissions.Check (Permission => Security.Permissions.Get_Permission_Index (Permission),
Entity => Comment.Get_Entity_Id);
Comment.Set_Entity_Type (ADO.Sessions.Entities.Find_Entity_Type (DB, Entity_Type));
Comment.Set_Author (User);
Comment.Set_Create_Date (Ada.Calendar.Clock);
Comment.Save (DB);
Comment_Lifecycle.Notify_Create (Model, Comment);
Ctx.Commit;
end Create_Comment;
-- ------------------------------
-- Update the comment represented by <tt>Comment</tt> if the current user has the
-- permission identified by <tt>Permission</tt>.
-- ------------------------------
procedure Update_Comment (Model : in Comment_Module;
Permission : in String;
Comment : in out AWA.Comments.Models.Comment_Ref'Class) is
Ctx : constant Services.Contexts.Service_Context_Access := AWA.Services.Contexts.Current;
DB : ADO.Sessions.Master_Session := AWA.Services.Contexts.Get_Master_Session (Ctx);
begin
if not Comment.Is_Inserted then
Log.Error ("The comment was not created");
raise Not_Found with "The comment was not inserted";
end if;
Ctx.Start;
Log.Info ("Updating the comment {0}", ADO.Identifier'Image (Comment.Get_Id));
-- Check that the user has the update permission on the given comment.
AWA.Permissions.Check (Permission => Security.Permissions.Get_Permission_Index (Permission),
Entity => Comment);
Comment_Lifecycle.Notify_Update (Model, Comment);
Comment.Save (DB);
Ctx.Commit;
end Update_Comment;
-- ------------------------------
-- Delete the comment represented by <tt>Comment</tt> if the current user has the
-- permission identified by <tt>Permission</tt>.
-- ------------------------------
procedure Delete_Comment (Model : in Comment_Module;
Permission : in String;
Comment : in out AWA.Comments.Models.Comment_Ref'Class) is
Ctx : constant Services.Contexts.Service_Context_Access := AWA.Services.Contexts.Current;
DB : ADO.Sessions.Master_Session := AWA.Services.Contexts.Get_Master_Session (Ctx);
begin
Ctx.Start;
-- Check that the user has the delete permission on the given answer.
AWA.Permissions.Check (Permission => Security.Permissions.Get_Permission_Index (Permission),
Entity => Comment);
Comment_Lifecycle.Notify_Delete (Model, Comment);
Comment.Delete (DB);
Ctx.Commit;
end Delete_Comment;
-- ------------------------------
-- Set the publication status of the comment represented by <tt>Comment</tt>
-- if the current user has the permission identified by <tt>Permission</tt>.
-- ------------------------------
procedure Publish_Comment (Model : in Comment_Module;
Permission : in String;
Id : in ADO.Identifier;
Status : in AWA.Comments.Models.Status_Type;
Comment : in out AWA.Comments.Models.Comment_Ref'Class) is
pragma Unreferenced (Model);
Ctx : constant Services.Contexts.Service_Context_Access := AWA.Services.Contexts.Current;
DB : ADO.Sessions.Master_Session := AWA.Services.Contexts.Get_Master_Session (Ctx);
begin
Ctx.Start;
-- Check that the user has the permission to publish for the given comment.
AWA.Permissions.Check (Permission => Security.Permissions.Get_Permission_Index (Permission),
Entity => Id);
Comment.Load (DB, Id);
Comment.Set_Status (Status);
Comment.Save (DB);
Ctx.Commit;
end Publish_Comment;
end AWA.Comments.Modules;
| 43.8 | 98 | 0.594242 |
59aa8a1476b18143aae637b94f51ba53c4ae6be1 | 16 | ada | Ada | model/mcada/templates/package/t.structure_end.ada | cortlandstarrett/mcada | d1a7a818f91459d53bd5b9354bc7d78e2c5d4518 | [
"Apache-2.0"
] | null | null | null | model/mcada/templates/package/t.structure_end.ada | cortlandstarrett/mcada | d1a7a818f91459d53bd5b9354bc7d78e2c5d4518 | [
"Apache-2.0"
] | null | null | null | model/mcada/templates/package/t.structure_end.ada | cortlandstarrett/mcada | d1a7a818f91459d53bd5b9354bc7d78e2c5d4518 | [
"Apache-2.0"
] | 1 | 2021-06-08T19:44:04.000Z | 2021-06-08T19:44:04.000Z | end record;
| 8 | 15 | 0.5625 |
2fed4a978dff57f3e2fe47af5fcb179ab0802587 | 2,469 | ads | Ada | ada/core/agar-init.ads | charlesdaniels/libagar | 099ce716e2ca01a7904b23f22610bf589295f5b5 | [
"BSD-2-Clause"
] | null | null | null | ada/core/agar-init.ads | charlesdaniels/libagar | 099ce716e2ca01a7904b23f22610bf589295f5b5 | [
"BSD-2-Clause"
] | null | null | null | ada/core/agar-init.ads | charlesdaniels/libagar | 099ce716e2ca01a7904b23f22610bf589295f5b5 | [
"BSD-2-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- AGAR CORE LIBRARY --
-- A G A R . I N I T --
-- S p e c --
------------------------------------------------------------------------------
with Interfaces.C;
with Interfaces.C.Strings;
package Agar.Init is
package C renames Interfaces.C;
package CS renames Interfaces.C.Strings;
type Agar_Version is limited record
Major : C.int;
Minor : C.int;
Patch : C.int;
end record
with Convention => C;
type Agar_Version_Access is access all Agar_Version with Convention => C;
type Atexit_Func_Access is access procedure with Convention => C;
--
-- Get the Agar version number.
--
procedure Get_Version
(Major : out Natural;
Minor : out Natural;
Patch : out Natural);
--
-- Initialize the Agar-Core library.
--
function Init_Core
(Program_Name : in String;
Verbose : in Boolean := False;
Create_Directory : in Boolean := False;
Software_Timers : in Boolean := False) return Boolean;
function Init_Core
(Verbose : in Boolean := False;
Create_Directory : in Boolean := False;
Software_Timers : in Boolean := False) return Boolean;
--
-- Set an exit callback routine.
--
procedure At_Exit (Callback : Atexit_Func_Access);
--
-- Release all resources and exit application.
--
procedure Quit
with Import, Convention => C, Link_Name => "AG_Quit";
--
-- Release all resources allocated by Agar-Core.
--
procedure Destroy
with Import, Convention => C, Link_Name => "AG_Destroy";
private
use type C.int;
use type C.unsigned;
procedure AG_GetVersion (Version : Agar_Version_Access)
with Import, Convention => C, Link_Name => "AG_GetVersion";
AG_VERBOSE : constant := 16#01#; -- Verbose() to console
AG_CREATE_DATADIR : constant := 16#02#; -- Check and create data dir
AG_SOFT_TIMERS : constant := 16#04#; -- Force software timing wheel
function AG_InitCore
(Progname : in CS.chars_ptr;
Flags : in C.unsigned) return C.int
with Import, Convention => C, Link_Name => "AG_InitCore";
procedure AG_AtExitFunc (Func : in Atexit_Func_Access)
with Import, Convention => C, Link_Name => "AG_AtExitFunc";
end Agar.Init;
| 29.746988 | 78 | 0.571486 |
0be3c05d2b1f1a6461288a3f760a4cec62a5bcfc | 2,885 | adb | Ada | ada/generate/generate.adb | pramsey/snowball | 3f8581bf8ac7163dfa42211e878dbd80044eaae8 | [
"BSD-3-Clause"
] | 547 | 2015-01-07T09:34:31.000Z | 2022-03-31T10:13:41.000Z | ada/generate/generate.adb | pramsey/snowball | 3f8581bf8ac7163dfa42211e878dbd80044eaae8 | [
"BSD-3-Clause"
] | 132 | 2015-01-03T23:14:44.000Z | 2022-03-23T09:06:04.000Z | ada/generate/generate.adb | pramsey/snowball | 3f8581bf8ac7163dfa42211e878dbd80044eaae8 | [
"BSD-3-Clause"
] | 170 | 2015-01-07T08:24:59.000Z | 2022-03-28T03:43:13.000Z | with Ada.Characters.Handling;
with Ada.Text_IO;
with Ada.Command_Line;
with Ada.Containers.Indefinite_Vectors;
procedure Generate is
use Ada.Characters.Handling;
use Ada.Text_IO;
package String_Vectors is new Ada.Containers.Indefinite_Vectors
(Element_Type => String,
Index_Type => Positive);
Languages : String_Vectors.Vector;
function Capitalize (S : in String) return String is
(To_Upper (S (S'First)) & S (S'First + 1 .. S'Last));
procedure Write_Spec is
File : File_Type;
I : Natural := 0;
begin
Create (File, Out_File, "stemmer-factory.ads");
Put_Line (File, "package Stemmer.Factory with SPARK_Mode is");
New_Line (File);
Put (File, " type Language_Type is (");
for Lang of Languages loop
Put (File, "L_" & To_Upper (Lang));
I := I + 1;
if I < Natural (Languages.Length) then
Put_Line (File, ",");
Put (File, " ");
end if;
end loop;
Put_Line (File, ");");
New_Line (File);
Put_Line (File, " function Stem (Language : in Language_Type;");
Put_Line (File, " Word : in String) return String;");
New_Line (File);
Put_Line (File, "end Stemmer.Factory;");
Close (File);
end Write_Spec;
procedure Write_Body is
File : File_Type;
begin
Create (File, Out_File, "stemmer-factory.adb");
for Lang of Languages loop
Put_Line (File, "with Stemmer." & Capitalize (Lang) & ";");
end loop;
Put_Line (File, "package body Stemmer.Factory with SPARK_Mode is");
New_Line (File);
Put_Line (File, " function Stem (Language : in Language_Type;");
Put_Line (File, " Word : in String) return String is");
Put_Line (File, " Result : Boolean := False;");
Put_Line (File, " begin");
Put_Line (File, " case Language is");
for Lang of Languages loop
Put_Line (File, " when L_" & To_Upper (Lang) & " =>");
Put_Line (File, " declare");
Put_Line (File, " C : Stemmer." & Capitalize (Lang) & ".Context_Type;");
Put_Line (File, " begin");
Put_Line (File, " C.Stem_Word (Word, Result);");
Put_Line (File, " return Get_Result (C);");
Put_Line (File, " end;");
New_Line (File);
end loop;
Put_Line (File, " end case;");
Put_Line (File, " end Stem;");
New_Line (File);
Put_Line (File, "end Stemmer.Factory;");
Close (File);
end Write_Body;
Count : constant Natural := Ada.Command_Line.Argument_Count;
begin
for I in 1 .. Count loop
Languages.Append (To_Lower (Ada.Command_Line.Argument (I)));
end loop;
Write_Spec;
Write_Body;
end Generate;
| 34.345238 | 92 | 0.566378 |
41562568974dc53a3b905a5ea5def492509fde90 | 2,957 | adb | Ada | day05/src/day.adb | jwarwick/aoc_2020 | b88e5a69f7ce035c4bc0a2474e0e0cdbb7b43377 | [
"MIT"
] | 3 | 2020-12-26T23:44:33.000Z | 2021-12-06T16:00:54.000Z | day05/src/day.adb | jwarwick/aoc_2020 | b88e5a69f7ce035c4bc0a2474e0e0cdbb7b43377 | [
"MIT"
] | null | null | null | day05/src/day.adb | jwarwick/aoc_2020 | b88e5a69f7ce035c4bc0a2474e0e0cdbb7b43377 | [
"MIT"
] | null | null | null | -- AoC 2020, Day 5
with Ada.Text_IO;
package body Day is
package TIO renames Ada.Text_IO;
function parse_line(line : in String) return Boarding_Pass is
curr : Boarding_Pass;
begin
declare
low : Row_Type := Row_Type'first;
high : Row_Type := Row_Type'last;
tmp : Float;
begin
for idx in 0..6 loop
tmp := (Float(high)-Float(low))/2.0;
if line(line'first + idx) = 'B' then
low := low + Row_Type(Float'Floor(tmp)) + 1;
curr.Row := low;
elsif line(line'first + idx) = 'F' then
high := high - Row_Type(Float'Floor(tmp)) - 1;
curr.Row := high;
else
TIO.put_line("Don't know that value: " & line(line'first + idx));
return curr;
end if;
end loop;
end;
declare
low : Seat_Type := Seat_Type'first;
high : Seat_Type := Seat_Type'last;
tmp : Float;
begin
for idx in 7..9 loop
tmp := (Float(high)-Float(low))/2.0;
if line(line'first + idx) = 'R' then
low := low + Seat_Type(Float'Floor(tmp)) + 1;
curr.Seat := low;
elsif line(line'first + idx) = 'L' then
high := high - Seat_Type(Float'Floor(tmp)) - 1;
curr.Seat := high;
else
TIO.put_line("Don't know that value: " & line(line'first + idx));
return curr;
end if;
end loop;
end;
return curr;
end parse_line;
function load_batch(filename : in String) return Boarding_Pass_Vectors.Vector is
file : TIO.File_Type;
output : Boarding_Pass_Vectors.Vector;
begin
TIO.open(File => file, Mode => TIO.In_File, Name => filename);
while not TIO.end_of_file(file) loop
declare
curr : constant Boarding_Pass := parse_line(TIO.get_line(file));
begin
output.append(curr);
end;
end loop;
TIO.close(file);
return output;
end load_batch;
function seat_id(pass : in Boarding_Pass) return Natural is
begin
return (Natural(pass.row) * 8) + Natural(pass.seat);
end seat_id;
function highest_id(passes : in Boarding_Pass_Vectors.Vector) return Natural is
max : Natural := 0;
curr : Natural := 0;
begin
for p of passes loop
curr := seat_id(p);
if curr > max then
max := curr;
end if;
end loop;
return max;
end highest_id;
package ID_Vectors is new Ada.Containers.Vectors
(Index_Type => Natural,
Element_Type => Natural);
package ID_Sorter is new ID_Vectors.Generic_Sorting;
function missing_id(passes : in Boarding_Pass_Vectors.Vector) return Natural is
ids : ID_Vectors.Vector;
last : Natural;
begin
for p of passes loop
ids.append(seat_id(p));
end loop;
ID_Sorter.sort(ids);
last := ids(ids.first_index) - 1;
for id of ids loop
if id /= (last + 1) then
return id-1;
end if;
last := id;
end loop;
return 0;
end missing_id;
end Day;
| 26.168142 | 82 | 0.596551 |
29fe923a562fb6a0934932517612236ac2100045 | 29,821 | adb | Ada | src/gpr_tools-gprinfo.adb | persan/gprTools | 0a67ea3179a1a5802ca45014ed00c044a945e5a1 | [
"BSD-3-Clause"
] | 2 | 2015-05-15T16:03:26.000Z | 2018-12-26T19:32:41.000Z | src/gpr_tools-gprinfo.adb | persan/gprTools | 0a67ea3179a1a5802ca45014ed00c044a945e5a1 | [
"BSD-3-Clause"
] | null | null | null | src/gpr_tools-gprinfo.adb | persan/gprTools | 0a67ea3179a1a5802ca45014ed00c044a945e5a1 | [
"BSD-3-Clause"
] | null | null | null | pragma Ada_2012;
with Ada.Command_Line;
with Ada.Containers.Vectors;
with Ada.Directories;
with Ada.Strings.Fixed.Equal_Case_Insensitive;
with Ada.Strings.Unbounded;
with GNAT.Command_Line;
with GNAT.Exception_Traces;
with GNAT.IO; use GNAT.IO;
with GNAT.OS_Lib;
with GNAT.Regexp;
with GNAT.Regpat;
with GNAT.Spitbol.Table_Boolean;
with GNAT.String_Split;
with GNAT.Strings;
with GNAT.Traceback.Symbolic;
with GNAT.Traceback;
with GNATCOLL.Arg_Lists;
with GNATCOLL.Projects;
with GNATCOLL.Templates;
with GNATCOLL.VFS;
with Ada.Containers.Indefinite_Ordered_Sets;
with GNAT.Directory_Operations;
with GPR.Opt;
with GNAT.Case_Util;
procedure GPR_Tools.Gprinfo is
use Ada.Containers;
use Ada.Directories;
use Ada.Strings.Fixed;
use GNAT.Command_Line;
use GNAT.Regpat;
use GNAT.Spitbol.Table_Boolean;
use GNAT.Strings;
use GNATCOLL.Arg_Lists;
use GNATCOLL.Projects;
use GNATCOLL.Templates;
use GNATCOLL.VFS;
type Command_Kind is (Do_Echo, Do_Exec);
type Command_Type is record
Kind : Command_Kind := Do_Echo;
Cmd : GNAT.Strings.String_Access;
end record;
GPR_PROJECT_PATH_ORIG : constant GNAT.Strings.String_Access := GNAT.OS_Lib.Getenv ("GPR_PROJECT_PATH");
package Command_Vectors is new Ada.Containers.Vectors (Natural, Command_Type);
package String_Vectors is new Ada.Containers.Vectors (Natural, GNAT.Strings.String_Access);
package String_Sets is new Ada.Containers.Indefinite_Ordered_Sets (Element_Type => String);
GPR_PROJECT_PATH_LOCAL : String_Vectors.Vector;
GPR_PROJECT_PATH_SUBPROCESS : String_Vectors.Vector;
BaseName : Boolean := False;
Commands : Command_Vectors.Vector;
Cwd : Boolean := False;
DirName : Boolean := False;
Direct_Imports : Boolean := False;
Displayed_Folders : GNAT.Spitbol.Table_Boolean.Table (512);
Env : Project_Environment_Access;
Exclude_Externally_Built : Boolean := True;
Exclude_No_Source : Boolean := True;
Exclude_Patterns : String_Vectors.Vector;
Exclude_RTS : Boolean := True;
Exec_Dir : Boolean := False;
GNAT_Version : GNAT.Strings.String_Access;
Gnatls : GNAT.Strings.String_Access := new String'("gnatls");
Help : Boolean := False;
Is_Aggregate : Boolean := False;
Languages : Boolean := False;
Library_Dir : Boolean := False;
Missing : Boolean := False;
Missing_Fail : Boolean := False;
No_Duplicates : Boolean := False;
Object_Dir : Boolean := False;
Proj : Project_Tree;
Project_File : GNAT.Strings.String_Access;
Recursive : Boolean := False;
Rts_Root : GNAT.Strings.String_Access;
Show_Version : Boolean := False;
Source_Dirs : Boolean := False;
Source_Dirs_I : Boolean := False;
Source_Files : Boolean := False;
Verbose : Boolean := False;
Exit_Status : Ada.Command_Line.Exit_Status := Ada.Command_Line.Success;
Reverse_Order : Boolean := False;
Execute_Commands : Boolean := False;
Max_Iterations : Positive := 1;
Default_Max_Iterations : constant := 16;
Attribute : GNAT.Strings.String_Access;
Query_Languages : GNAT.Strings.String_Access;
Reload_Project_After_Warnings : Boolean := True;
function Image (Item : String_Vectors.Vector) return String is
Ret : Ada.Strings.Unbounded.Unbounded_String;
begin
for I of Item loop
if Ada.Strings.Unbounded.Length (Ret) /= 0 then
Ada.Strings.Unbounded.Append (Ret, GNAT.OS_Lib.Path_Separator);
end if;
Ada.Strings.Unbounded.Append (Ret, I.all);
end loop;
return Ada.Strings.Unbounded.To_String (Ret);
end Image;
procedure Output (Full_Name : String;
Base_Name : String;
Dir_Name : String;
Name : String;
Continue : out Boolean) is
Subst : GNATCOLL.Templates.Substitution_Array
:= ((new String'("full_name"), new String'(Full_Name)),
(new String'("base_name"), new String'(Base_Name)),
(new String'("dir_name"), new String'(Dir_Name)),
(new String'("name"), new String'(Name)));
Args : GNAT.OS_Lib.Argument_List_Access;
Cmd : GNAT.OS_Lib.String_Access;
begin
Continue := True;
if No_Duplicates then
if not Present (Displayed_Folders, Dir_Name) then
Set (Displayed_Folders, Dir_Name, True);
else
return;
end if;
end if;
if Exclude_RTS and then Ada.Strings.Fixed.Index (Dir_Name, Rts_Root.all) = Dir_Name'First then
return;
end if;
for Exclude_Pattern of Exclude_Patterns loop
if GNAT.Regexp.Match (Full_Name, GNAT.Regexp.Compile (Exclude_Pattern.all)) then
return;
end if;
end loop;
for C of Commands loop
declare
Command : GNATCOLL.Arg_Lists.Arg_List;
Commands_Template : GNATCOLL.Arg_Lists.Arg_List;
use type Ada.Command_Line.Exit_Status;
begin
Commands_Template := GNATCOLL.Arg_Lists.Parse_String (C.Cmd.all, Separate_Args);
for I in 0 .. Args_Length (Commands_Template) loop
Append_Argument (C => Command,
Argument => Substitute (Str => Nth_Arg (Commands_Template, I),
Substrings => Subst),
Mode => One_Arg);
end loop;
case C.Kind is
when Do_Echo =>
GNAT.IO.Put_Line (GNATCOLL.Arg_Lists.To_Display_String (Command));
when Do_Exec =>
if Cwd then
if Verbose then
GNAT.IO.Put_Line ("<cwd> " & Dir_Name);
end if;
Ada.Directories.Set_Directory (Dir_Name);
end if;
if Verbose then
GNAT.IO.Put_Line ("<exec> " & GNATCOLL.Arg_Lists.To_Display_String (Command));
end if;
Args := new GNAT.OS_Lib.Argument_List'(GNATCOLL.Arg_Lists.To_List (Command, False));
Cmd := GNAT.OS_Lib.Locate_Exec_On_Path (GNATCOLL.Arg_Lists.Get_Command (Command));
Exit_Status := Ada.Command_Line.Exit_Status (GNAT.OS_Lib.Spawn (Cmd.all, Args.all));
if Exit_Status /= 0 then
Continue := False;
end if;
Free (Cmd);
Free (Args);
end case;
end;
end loop;
GNATCOLL.Templates.Free (Subst);
end Output;
procedure Locate_Proj is
Found : Boolean := False;
procedure Process (Directory_Entry : Directory_Entry_Type) is
begin
if not Found then
Project_File := new String'(Full_Name (Directory_Entry));
Found := True;
end if;
end Process;
begin
declare
Name : constant String := Get_Argument (True);
begin
if Name'Length /= 0 then
Project_File := new String'(Full_Name (Name));
return;
end if;
end;
Search (".", "*.gpr", Process => Process'Access);
end Locate_Proj;
procedure Print_Attribute (P : Project_Type; Attribute : String) is
Matcher : constant Pattern_Matcher := Compile ("((\w+)\.|)(\w+)(\((\w+)\)|)");
Matches : Match_Array (1 .. Paren_Count (Matcher));
Pkg_IX : constant := 2;
Attr_IX : constant := 3;
IX_IX : constant := 5;
function Get (S : String; Slice : Match_Location) return String is
begin
if Slice = No_Match then
return "";
else
return S (Slice.First .. Slice.Last);
end if;
end Get;
begin
Match (Matcher, Attribute, Matches);
if Matches (Attr_IX) /= No_Match then
declare
Attr_L : constant String_List_Access := P.Attribute_Value
(Attribute => Build (Get (Attribute, Matches (Pkg_IX)), Get (Attribute, Matches (Attr_IX))),
Index => Get (Attribute, Matches (IX_IX)));
First : Boolean := True;
begin
for I of Attr_L.all loop
if not First then
GNAT.IO.Put (" ");
end if;
GNAT.IO.Put (I.all);
First := False;
end loop;
GNAT.IO.New_Line;
end;
end if;
end Print_Attribute;
procedure Display (P : Project_Type) is
begin
if Exclude_Externally_Built and then Equal_Case_Insensitive (P.Attribute_Value (Build ("", "externally_built")), "true") then
return;
elsif Exclude_No_Source and then P.Direct_Sources_Count = 0 then
return;
elsif Languages then
for I of P.Languages loop
declare
Lang : String := I.all;
begin
GNAT.Case_Util.To_Mixed (Lang);
GNAT.IO.Put_Line (Lang);
end;
end loop;
elsif Attribute /= null then
Print_Attribute (P, Attribute.all);
elsif Source_Dirs or Source_Dirs_I then
for I of P.Source_Dirs (Recursive) loop
GNAT.IO.Put_Line ((if Source_Dirs_I then "-I " else "") & (+Full_Name (I)));
end loop;
elsif Source_Files then
for I of GNATCOLL.VFS.File_Array_Access'(P.Source_Files (Recursive)).all loop
GNAT.IO.Put_Line (+Full_Name (I));
end loop;
elsif Object_Dir then
for I of P.Object_Path (Recursive) loop
GNAT.IO.Put_Line (+Full_Name (I));
end loop;
elsif Exec_Dir then
GNAT.IO.Put_Line (+Full_Name (P.Executables_Directory));
elsif Library_Dir then
GNAT.IO.Put_Line (+Full_Name (P.Library_Directory));
elsif Recursive or Direct_Imports then
declare
Iter : Project_Iterator;
Continue : Boolean;
begin
if Reverse_Order then
Iter := P.Start_Reversed (Recursive, Direct_Imports);
else
Iter := P.Start (Recursive, Direct_Imports);
end if;
loop
exit when Current (Iter) = No_Project;
if DirName then
declare
Name : constant String := +Dir_Name (Current (Iter).Project_Path);
begin
if No_Duplicates and then not Present (Displayed_Folders, Name) then
GNAT.IO.Put_Line (Name);
Set (Displayed_Folders, Name, True);
end if;
end;
elsif BaseName then
GNAT.IO.Put_Line (+Base_Name (Current (Iter).Project_Path));
elsif Commands.Length /= 0 then
Output (Full_Name => +Full_Name (Current (Iter).Project_Path),
Base_Name => +Base_Name (Current (Iter).Project_Path),
Dir_Name => +Dir_Name (Current (Iter).Project_Path),
Name => Current (Iter).Name,
Continue => Continue);
else
if Query_Languages = null then
GNAT.IO.Put_Line (+Full_Name (Current (Iter).Project_Path));
else
for I of Current (Iter).Languages loop
if Ada.Strings.Fixed.Equal_Case_Insensitive (I.all, Query_Languages.all) then
GNAT.IO.Put_Line (+Full_Name (Current (Iter).Project_Path));
end if;
end loop;
end if;
end if;
Next (Iter);
end loop;
end;
elsif Is_Aggregate and Query_Languages /= null then
for I of P.Languages loop
if Ada.Strings.Fixed.Equal_Case_Insensitive (I.all, Query_Languages.all) then
GNAT.IO.Put_Line (+Full_Name (P.Project_Path));
end if;
end loop;
end if;
end Display;
procedure Handle_Error_Report (Msg : String) is
Matcher : constant GNAT.Regpat.Pattern_Matcher := Compile ("^((\w+\.gpr):\d+:\d+: (unknown project file:|imported project file) ""(.+)"")");
Matches : GNAT.Regpat.Match_Array (1 .. GNAT.Regpat.Paren_Count (Matcher));
Continue : Boolean;
begin
Match (Matcher, Msg, Matches);
if Matches (3) /= No_Match then
if Missing_Fail then
Exit_Status := Ada.Command_Line.Failure;
end if;
if Commands.Length /= 0 then
Output (Full_Name => Msg (Matches (4).First .. Matches (4).Last),
Base_Name => Msg (Matches (2).First .. Matches (2).Last),
Dir_Name => Msg (Matches (4).First .. Matches (4).Last),
Name => Msg (Matches (4).First .. Matches (4).Last),
Continue => Continue);
else
GNAT.IO.Put_Line (Msg (Matches (4).First .. Matches (4).Last));
end if;
end if;
end Handle_Error_Report;
procedure Handle_Error_Report_Suppress_Warnings (Msg : String) is
Matcher : constant GNAT.Regpat.Pattern_Matcher := Compile ("^(\w+)\.gpr:\d+:\d+: warning: object directory ""(.+)"" not found");
Matches : GNAT.Regpat.Match_Array (1 .. GNAT.Regpat.Paren_Count (Matcher));
begin
Match (Matcher, Msg, Matches);
if Matches (2) /= No_Match then
Reload_Project_After_Warnings := True;
else
GNAT.IO.Put_Line (Msg);
end if;
end Handle_Error_Report_Suppress_Warnings;
-- -------------------------------------------------------------------------
-- -------------------------------------------------------------------------
procedure Print_Help is
use ASCII;
begin
Put_Line ("Displays various aspects of .gpr-project files. " & ASCII.LF &
"could also excute commands on the resulting project set." & ASCII.LF &
"The usage usage is multiple:" & ASCII.LF &
" * Extract aspects of a single project file to be used in scripts." & ASCII.LF &
" * Iterate over project-trees." & LF &
" * Find missing projects in a project tree.");
Put_Line ("-P=proj Use Project File proj");
Put_Line ("-aP=dir Add directory dir to project search path (not propageted to subproceses).");
Put_Line ("-Ap=dir Add directory dir to project search path (only propageted to subproceses).");
Put_Line ("-AP=dir Add directory dir to project search path global.");
Put_Line ("--dirname Show directorynames of projects.");
Put_Line ("--basename Show basenames of projects.");
Put_Line ("-m --missing Show missing projects substitution is %name is the missing file and %base_name is the importing file.");
Put_Line ("-M --Missing Show missing projects substitution same as in ""-m"" (exit with error if not complete).");
Put_Line ("-x{num} Repeats load of missing projects max ""num"" times (default is" & Default_Max_Iterations'Img & ") does only apply on ""-exec"".");
Put_Line ("--exec-dir Print exec dir.");
Put_Line ("--object-dir Print object dir.");
Put_Line ("--source-dirs Print source dirs.");
Put_Line ("--source-dirs-include Print source dirs with ""-I "" before each entry.");
Put_Line ("--source-files Print source files.");
Put_Line ("--imports Print direct imports.");
Put_Line ("--library-dir Print library dir.");
Put_Line ("--languages Print project languages.");
Put_Line ("--contains-lang=lang Print projects containing languages lang (implies recursive)");
Put_Line ("--gnatls={gnatls} Use as gnatls default=>'" & Gnatls.all & "' .");
Put_Line ("-r --recursive Show recursive on all projects in tree in buildorder.");
Put_Line ("--reverse Show recursive on all projects in tree in reverse buildorder.");
Put_Line ("--echo=""command line"" Echo the argument with substitution %full_name %base_Name %dir_name %name.");
Put_Line ("--exec=""command line"" Execute the argument with substitution %full_name %base_Name %dir_name %name.");
Put_Line ("--cwd Change dir to projects enclosing dir before executing command.");
Put_Line ("--rts Include projects from runtimes.");
Put_Line ("--externally-built Include externally built procjects.");
Put_Line ("--empty-sources Include projects that dont have source files.");
Put_Line ("--no-duplicates Don't duplicate folders when showing dirnames.");
Put_Line ("--exclude-pattern=regexp Exclude project paths matching regexp.");
Put_Line ("--attribute={pkg.}attr{(ix)} Prints the attribute attr.");
Put_Line ("-Xnm=val Specify an external reference for Project Files.");
Put_Line ("-v --version Print version and then exit.");
Put_Line ("--verbose Be verbose.");
Put_Line ("--exceptions Trace all exceptions.");
Put_Line ("-? -h --help Display this text.");
end Print_Help;
procedure Parse_Command_Line is
Opt : Character;
begin
loop
Opt := Getopt ("P= " &
"AP= " &
"aP= " &
"-dirname " &
"-basename " &
"m -missing " &
"M -Missing " &
"-exec-dir " &
"-object-dir " &
"-source-dirs " &
"-source-dirs-include " &
"-source-files " &
"-imports " &
"-library-dir " &
"-languages " &
"-contains-lang= " &
"-gnatls= " &
"x? " &
"X! " &
"r -recursive " &
"-reverse " &
"-echo= " &
"-exec= " &
"-cwd " &
"-rts " &
"-externally-built " &
"-empty-sources " &
"-no-duplicates " &
"-exclude-pattern " &
"v -verbose " &
"-version " &
"-attribute= " &
"-exceptions " &
"? h -help");
case Opt is
when ASCII.NUL => exit;
when 'P' =>
Project_File := new String'(Parameter);
when 'a' =>
if Full_Switch = "aP" then
GPR_PROJECT_PATH_LOCAL.Append (new String'(Parameter));
else
raise Program_Error with "invalid switch => '" & Full_Switch & "'";
end if;
when 'A' =>
if Full_Switch = "Ap" then
GPR_PROJECT_PATH_SUBPROCESS.Append (new String'(Parameter));
elsif Full_Switch = "AP" then
GPR_PROJECT_PATH_LOCAL.Append (new String'(Parameter));
GPR_PROJECT_PATH_SUBPROCESS.Append (new String'(Parameter));
else
raise Program_Error with "invalid switch => '" & Full_Switch & "'";
end if;
when 'm' =>
Missing := True;
when 'M' =>
Missing_Fail := True;
when 'r' =>
Recursive := True;
when 'v' =>
Show_Version := True;
when 'x' =>
if Parameter'Length = 0 then
Max_Iterations := Default_Max_Iterations;
else
Max_Iterations := Integer'Value (Parameter);
end if;
when 'X' =>
declare
S : GNAT.String_Split.Slice_Set; use GNAT.String_Split;
begin
Create (S, Parameter, "=");
if Slice_Count (S) = 2 then
Change_Environment (Env.all, Slice (S, 1), Slice (S, 2));
else
Put_Line ("Invalid argument for ""-X"" """ & Parameter & """.");
Help := True;
end if;
end;
when '?' | 'h' =>
Help := True;
when '-' =>
if Full_Switch = "-dirname" then
DirName := True;
elsif Full_Switch = "-basename" then
BaseName := True;
elsif Full_Switch = "-missing" then
Missing := True;
elsif Full_Switch = "-Missing" then
Missing := True;
Missing_Fail := True;
elsif Full_Switch = "-object-dir" then
Object_Dir := True;
elsif Full_Switch = "-object-dir" then
Object_Dir := True;
elsif Full_Switch = "-source-dirs" then
Source_Dirs := True;
elsif Full_Switch = "-source-dirs-include" then
Source_Dirs_I := True;
elsif Full_Switch = "-source-files" then
Source_Files := True;
elsif Full_Switch = "-imports" then
Direct_Imports := True;
elsif Full_Switch = "-exec-dir" then
Exec_Dir := True;
elsif Full_Switch = "-library-dir" then
Library_Dir := True;
elsif Full_Switch = "-languages" then
Languages := True;
elsif Full_Switch = "-contains-lang" then
Query_Languages := new String'(Parameter);
Recursive := True;
elsif Full_Switch = "-gnatls" then
Gnatls := new String'(Parameter);
elsif Full_Switch = "-reverse" then
Recursive := True;
Reverse_Order := True;
elsif Full_Switch = "-recursive" then
Recursive := True;
elsif Full_Switch = "-cwd" then
Cwd := True;
elsif Full_Switch = "-echo" then
Commands.Append ((Do_Echo, new String'(Parameter)));
elsif Full_Switch = "-exec" then
Commands.Append ((Do_Exec, new String'(Parameter)));
Execute_Commands := True;
elsif Full_Switch = "-rts" then
Exclude_RTS := False;
elsif Full_Switch = "-externally-built" then
Exclude_Externally_Built := False;
elsif Full_Switch = "-empty-sources" then
Exclude_No_Source := False;
elsif Full_Switch = "-exclude-pattern" then
Exclude_Patterns.Append (new String'(Parameter));
elsif Full_Switch = "-no-duplicates" then
No_Duplicates := True;
elsif Full_Switch = "-version" then
Show_Version := True;
elsif Full_Switch = "-verbose" then
Verbose := True;
elsif Full_Switch = "-attribute" then
Attribute := new String'(Parameter);
elsif Full_Switch = "-exceptions" then
GNAT.Exception_Traces.Set_Trace_Decorator (GNAT.Traceback.Symbolic.Symbolic_Traceback'Access);
GNAT.Exception_Traces.Trace_On (GNAT.Exception_Traces.Every_Raise);
elsif Full_Switch = "-help" then
Help := True;
else
raise Program_Error with "invalid switch => '" & Full_Switch & "'";
end if;
when others =>
raise Program_Error with "invalid switch => '" & Full_Switch & "'";
end case;
end loop;
exception
when GNAT.Command_Line.Invalid_Switch =>
GNAT.IO.Put_Line ("Invalid switch: " & Full_Switch);
Print_Help;
raise;
end Parse_Command_Line;
begin
Initialize (Env);
Parse_Command_Line;
if Help then
Print_Help;
return;
elsif Show_Version then
GNAT.IO.Put_Line (VERSION);
return;
end if;
if Direct_Imports then
Recursive := True;
end if;
-- ============
-- Set up paths
-- ============
if GPR_PROJECT_PATH_ORIG /= null and then GPR_PROJECT_PATH_ORIG.all /= "" then
declare
S : GNAT.String_Split.Slice_Set;
begin
GNAT.String_Split.Create (S, GPR_PROJECT_PATH_ORIG.all, GNAT.OS_Lib.Path_Separator & "", GNAT.String_Split.Multiple);
for I in 1 .. GNAT.String_Split.Slice_Count (S) loop
GPR_PROJECT_PATH_SUBPROCESS.Append (new String'(GNAT.String_Split.Slice (S, I)));
GPR_PROJECT_PATH_LOCAL.Append (new String'(GNAT.String_Split.Slice (S, I)));
end loop;
end;
end if;
declare
Realgnatls : GNAT.Strings.String_Access;
begin
Realgnatls := GNAT.OS_Lib.Locate_Exec_On_Path (Gnatls.all);
Rts_Root := new String'(Containing_Directory (Containing_Directory (Realgnatls.all)));
Free (Realgnatls);
end;
Env.Set_Path_From_Gnatls (Gnatls.all, GNAT_Version, GNAT.IO.Put_Line'Access);
-- ======================
-- Locate the root-project
-- ======================
if Project_File = null then
Locate_Proj;
elsif Project_File.all = "" then
Free (Project_File);
Locate_Proj;
end if;
if not Exists (Name => Project_File.all) then
if Exists (Name => Project_File.all & ".gpr") then
Project_File := new String'(Project_File.all & ".gpr");
end if;
end if;
-- ================
-- Do the real work
-- ================
if GPR_PROJECT_PATH_LOCAL.Length /= 0 then
GNAT.OS_Lib.Setenv ("GPR_PROJECT_PATH", Image (GPR_PROJECT_PATH_LOCAL));
end if;
if Missing or Missing_Fail then
Load_Loop : for I in 1 .. (if Execute_Commands then Max_Iterations else 1) loop
begin
Proj.Load (Create (Filesystem_String (Project_File.all)), Env,
Errors => Handle_Error_Report'Unrestricted_Access,
Recompute_View => False);
exit Load_Loop;
exception
when others =>
null;
end;
end loop Load_Loop;
else
GPR.Opt.Create_Dirs := GPR.Opt.Create_All_Dirs;
null;
GPR.Opt.Unchecked_Shared_Lib_Imports := True;
GPR.Opt.Full_Path_Name_For_Brief_Errors := True;
Proj.Load (Create (Filesystem_String (Project_File.all)), Env, Errors => Handle_Error_Report_Suppress_Warnings'Unrestricted_Access);
if Reload_Project_After_Warnings then
Proj.Load (Create (Filesystem_String (Project_File.all)), Env, Errors => Handle_Error_Report_Suppress_Warnings'Unrestricted_Access);
end if;
if GPR_PROJECT_PATH_SUBPROCESS.Length /= 0 then
GNAT.OS_Lib.Setenv ("GPR_PROJECT_PATH", Image (GPR_PROJECT_PATH_SUBPROCESS));
end if;
if Proj.Root_Project.Is_Aggregate_Project or Proj.Root_Project.Is_Aggregate_Library then
Recursive := False;
Is_Aggregate := True;
declare
Projects : String_Sets.Set;
procedure Process (Directory_Entry : Directory_Entry_Type) is
P : constant Project_Type := Project_From_Path (Proj, Create_From_UTF8 (Ada.Directories.Full_Name (Directory_Entry)));
Iter : Project_Iterator;
begin
Projects.Include (P.Name);
Iter := P.Start (True, False, True);
while Current (Iter) /= No_Project loop
Projects.Include (Current (Iter).Name);
Next (Iter);
end loop;
end Process;
Project_Files : constant GNAT.Strings.String_List_Access := Proj.Root_Project.Attribute_Value (Build ("", "Project_Files"));
begin
Locate_All_Projects : for I of Project_Files.all loop
Ada.Directories.Search (GNAT.Directory_Operations.Dir_Name (I.all),
GNAT.Directory_Operations.Base_Name (I.all),
(False, True, False),
Process'Access);
end loop Locate_All_Projects;
for I of Projects loop
Display (Proj.Project_From_Name (I));
end loop;
end;
else
Display (Proj.Root_Project);
end if;
end if;
Ada.Command_Line.Set_Exit_Status (Exit_Status);
exception
when others =>
Ada.Command_Line.Set_Exit_Status (Ada.Command_Line.Failure);
end GPR_Tools.Gprinfo;
| 41.418056 | 176 | 0.536032 |
1dfb9902054cda0df80cfe2d6ab10f3a541a903f | 11,656 | ads | Ada | source/sql/sqlite3/matreshka-internals-sql_drivers-sqlite3.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/sql/sqlite3/matreshka-internals-sql_drivers-sqlite3.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/sql/sqlite3/matreshka-internals-sql_drivers-sqlite3.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- SQL Database Access --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2013, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This package is low level bindings to SQLite3 library.
------------------------------------------------------------------------------
with Interfaces.C;
with Matreshka.Internals.Strings.C;
with Matreshka.Internals.Utf16;
package Matreshka.Internals.SQL_Drivers.SQLite3 is
pragma Preelaborate;
----------------
-- Data types --
----------------
type sqlite3 is limited private;
type sqlite3_Access is access all sqlite3;
pragma Convention (C, sqlite3_Access);
type sqlite3_stmt is limited private;
type sqlite3_stmt_Access is access all sqlite3_stmt;
pragma Convention (C, sqlite3_stmt_Access);
type Utf16_Code_Unit_Access_Destructor is
access procedure
(Text : Matreshka.Internals.Strings.C.Utf16_Code_Unit_Access);
pragma Convention (C, Utf16_Code_Unit_Access_Destructor);
---------------
-- Constants --
---------------
SQLITE_OK : constant := 0; -- Successful result
--#define SQLITE_ERROR 1 /* SQL error or missing database */
--#define SQLITE_INTERNAL 2 /* Internal logic error in SQLite */
--#define SQLITE_PERM 3 /* Access permission denied */
--#define SQLITE_ABORT 4 /* Callback routine requested an abort */
--#define SQLITE_BUSY 5 /* The database file is locked */
--#define SQLITE_LOCKED 6 /* A table in the database is locked */
--#define SQLITE_NOMEM 7 /* A malloc() failed */
--#define SQLITE_READONLY 8 /* Attempt to write a readonly database */
--#define SQLITE_INTERRUPT 9 /* Operation terminated by sqlite3_interrupt()*/
--#define SQLITE_IOERR 10 /* Some kind of disk I/O error occurred */
--#define SQLITE_CORRUPT 11 /* The database disk image is malformed */
--#define SQLITE_NOTFOUND 12 /* Unknown opcode in sqlite3_file_control() */
--#define SQLITE_FULL 13 /* Insertion failed because database is full */
--#define SQLITE_CANTOPEN 14 /* Unable to open the database file */
--#define SQLITE_PROTOCOL 15 /* Database lock protocol error */
--#define SQLITE_EMPTY 16 /* Database is empty */
--#define SQLITE_SCHEMA 17 /* The database schema changed */
--#define SQLITE_TOOBIG 18 /* String or BLOB exceeds size limit */
--#define SQLITE_CONSTRAINT 19 /* Abort due to constraint violation */
--#define SQLITE_MISMATCH 20 /* Data type mismatch */
--#define SQLITE_MISUSE 21 /* Library used incorrectly */
--#define SQLITE_NOLFS 22 /* Uses OS features not supported on host */
--#define SQLITE_AUTH 23 /* Authorization denied */
--#define SQLITE_FORMAT 24 /* Auxiliary database format error */
--#define SQLITE_RANGE 25 /* 2nd parameter to sqlite3_bind out of range */
--#define SQLITE_NOTADB 26 /* File opened that is not a database file */
SQLITE_ROW : constant := 100; -- sqlite3_step() has another row
-- ready
SQLITE_DONE : constant := 101; -- sqlite3_step() has finished
-- executing
SQLITE_CONFIG_SINGLETHREAD : constant := 1; -- nil
SQLITE_CONFIG_MULTITHREAD : constant := 2; -- nil
SQLITE_CONFIG_SERIALIZED : constant := 3; -- nil
--#define SQLITE_CONFIG_MALLOC 4 /* sqlite3_mem_methods* */
--#define SQLITE_CONFIG_GETMALLOC 5 /* sqlite3_mem_methods* */
--#define SQLITE_CONFIG_SCRATCH 6 /* void*, int sz, int N */
--#define SQLITE_CONFIG_PAGECACHE 7 /* void*, int sz, int N */
--#define SQLITE_CONFIG_HEAP 8 /* void*, int nByte, int min */
--#define SQLITE_CONFIG_MEMSTATUS 9 /* boolean */
--#define SQLITE_CONFIG_MUTEX 10 /* sqlite3_mutex_methods* */
--#define SQLITE_CONFIG_GETMUTEX 11 /* sqlite3_mutex_methods* */
--/* previously SQLITE_CONFIG_CHUNKALLOC 12 which is now unused. */
--#define SQLITE_CONFIG_LOOKASIDE 13 /* int int */
--#define SQLITE_CONFIG_PCACHE 14 /* sqlite3_pcache_methods* */
--#define SQLITE_CONFIG_GETPCACHE 15 /* sqlite3_pcache_methods* */
--#define SQLITE_CONFIG_LOG 16 /* xFunc, void* */
SQLITE_INTEGER : constant := 1;
SQLITE_FLOAT : constant := 2;
SQLITE_TEXT : constant := 3;
SQLITE_BLOB : constant := 4;
SQLITE_NULL : constant := 5;
---------------
-- Functions --
---------------
function sqlite3_bind_double
(Handle : sqlite3_stmt_Access;
Index : Interfaces.C.int;
Value : Interfaces.C.double) return Interfaces.C.int;
pragma Import (C, sqlite3_bind_double);
function sqlite3_bind_int64
(Handle : sqlite3_stmt_Access;
Index : Interfaces.C.int;
Value : Interfaces.Integer_64) return Interfaces.C.int;
pragma Import (C, sqlite3_bind_int64);
function sqlite3_bind_null
(Handle : sqlite3_stmt_Access;
Index : Interfaces.C.int) return Interfaces.C.int;
pragma Import (C, sqlite3_bind_null);
function sqlite3_bind_parameter_count
(Handle : sqlite3_stmt_Access) return Interfaces.C.int;
pragma Import (C, sqlite3_bind_parameter_count);
function sqlite3_bind_parameter_index
(Handle : sqlite3_stmt_Access;
Name : Interfaces.C.char_array) return Interfaces.C.int;
pragma Import (C, sqlite3_bind_parameter_index);
function sqlite3_bind_text16
(Handle : sqlite3_stmt_Access;
Index : Interfaces.C.int;
Text : Matreshka.Internals.Strings.C.Utf16_Code_Unit_Access;
nBytes : Interfaces.C.int;
Destructor : Utf16_Code_Unit_Access_Destructor) return Interfaces.C.int;
pragma Import (C, sqlite3_bind_text16);
function sqlite3_close (Handle : sqlite3_Access) return Interfaces.C.int;
pragma Import (C, sqlite3_close);
function sqlite3_column_bytes16
(Handle : sqlite3_stmt_Access;
iCol : Interfaces.C.int) return Interfaces.C.int;
pragma Import (C, sqlite3_column_bytes16);
function sqlite3_column_double
(Handle : sqlite3_stmt_Access;
iCol : Interfaces.C.int) return Interfaces.C.double;
pragma Import (C, sqlite3_column_double);
function sqlite3_column_int64
(Handle : sqlite3_stmt_Access;
iCol : Interfaces.C.int) return Interfaces.Integer_64;
pragma Import (C, sqlite3_column_int64);
function sqlite3_column_text16
(Handle : sqlite3_stmt_Access;
iCol : Interfaces.C.int)
return Matreshka.Internals.Strings.C.Utf16_Code_Unit_Access;
pragma Import (C, sqlite3_column_text16);
function sqlite3_column_type
(Handle : sqlite3_stmt_Access;
iCol : Interfaces.C.int) return Interfaces.C.int;
pragma Import (C, sqlite3_column_type);
function sqlite3_config (Option : Interfaces.C.int) return Interfaces.C.int;
pragma Import (C, sqlite3_config);
function sqlite3_errmsg16
(db : sqlite3_Access)
return Matreshka.Internals.Strings.C.Utf16_Code_Unit_Access;
pragma Import (C, sqlite3_errmsg16);
function sqlite3_finalize
(Handle : sqlite3_stmt_Access) return Interfaces.C.int;
pragma Import (C, sqlite3_finalize);
function sqlite3_last_insert_rowid
(Handle : sqlite3_Access) return Interfaces.Integer_64;
pragma Import (C, sqlite3_last_insert_rowid);
function sqlite3_open16
(File_Name : Matreshka.Internals.Utf16.Utf16_String;
-- Handle : out sqlite3_Access) return Interfaces.C.int;
Handle : not null access sqlite3_Access) return Interfaces.C.int;
pragma Import (C, sqlite3_open16);
function sqlite3_prepare16_v2
(db : sqlite3_Access;
zSql : Matreshka.Internals.Utf16.Utf16_String;
nByte : Interfaces.C.int;
-- ppStmt : out sqlite3_stmt_Access;
-- pzTail : out Utf16_Code_Unit_Access) return Interfaces.C.int;
ppStmt : not null access sqlite3_stmt_Access;
pzTail :
not null access Matreshka.Internals.Strings.C.Utf16_Code_Unit_Access)
return Interfaces.C.int;
pragma Import (C, sqlite3_prepare16_v2);
function sqlite3_reset
(pStmt : sqlite3_stmt_Access) return Interfaces.C.int;
pragma Import (C, sqlite3_reset);
function sqlite3_step
(Handle : sqlite3_stmt_Access) return Interfaces.C.int;
pragma Import (C, sqlite3_step);
private
type sqlite3 is limited null record;
type sqlite3_stmt is limited null record;
end Matreshka.Internals.SQL_Drivers.SQLite3;
| 46.624 | 82 | 0.597718 |
2901ae2884074cabc376c37b1608d4cfee323ac5 | 1,363 | ads | Ada | src/bb-gui-controller.ads | jorge-real/Ball-On-Beam | 68362a677190a2ee2b6ccbc10ef073147b23d331 | [
"CC0-1.0"
] | 4 | 2021-02-12T19:52:11.000Z | 2021-08-04T22:43:26.000Z | src/bb-gui-controller.ads | jorge-real/Ball-On-Beam | 68362a677190a2ee2b6ccbc10ef073147b23d331 | [
"CC0-1.0"
] | null | null | null | src/bb-gui-controller.ads | jorge-real/Ball-On-Beam | 68362a677190a2ee2b6ccbc10ef073147b23d331 | [
"CC0-1.0"
] | null | null | null | ------------------------------------------------------------
-- B B . G U I . C O N T R O L L E R --
-- --
-- Spec --
-- --
-- "Controller" package of Ball on Beam simulator GUI. -- --
-- --
-- Author: Jorge Real --
-- Universitat Politecnica de Valencia --
-- July, 2020 - Version 1 --
-- February, 2021 - Version 2 --
-- --
-- This is free software in the ample sense: --
-- you can use it freely, provided you preserve --
-- this comment at the header of source files --
-- and you clearly indicate the changes made to --
-- the original file, if any. --
------------------------------------------------------------
with Gnoga.Gui.Window;
package BB.GUI.Controller is
procedure Create_GUI
(Main_Window : in out Gnoga.Gui.Window.Window_Type'Class);
end BB.GUI.Controller;
| 48.678571 | 118 | 0.314747 |
31b91854a086b63abe987ddb414160f4a36d8757 | 2,331 | ads | Ada | tools/scitools/conf/understand/ada/ada05/s-fore.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | 1 | 2020-01-20T21:26:46.000Z | 2020-01-20T21:26:46.000Z | tools/scitools/conf/understand/ada/ada05/s-fore.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada05/s-fore.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . F O R E --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2005 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
--
--
--
--
--
--
--
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains the routine used for the 'Fore attribute
package System.Fore is
pragma Pure;
function Fore (Lo, Hi : Long_Long_Float) return Natural;
-- Compute Fore attribute value for a fixed-point type. The parameters
-- are the low and high bounds values, converted to Long_Long_Float.
end System.Fore;
| 52.977273 | 78 | 0.414414 |
576378b0bd25c420ea14a26448707ca51382b726 | 566 | adb | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/modify_a_constant.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/modify_a_constant.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/modify_a_constant.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- { dg-do compile }
with text_io; use text_io;
procedure modify_a_constant is
type Outer;
type Inner (Outer_Ref : access Outer) is limited null record;
type Outer is limited record
Inner_Field : Inner (Outer_Ref => Outer'Access);
Integer_Field : Integer;
end record;
X : constant Outer := (Inner_Field => <>, Integer_Field => 123);
begin
Put_Line (Integer'image (X.Integer_Field));
X.Inner_Field.Outer_Ref.Integer_Field := 0;
Put_Line (Integer'image (X.Integer_Field));
end Modify_A_Constant;
| 28.3 | 68 | 0.662544 |
4189292df25750eaf0dcb00678abbc25a72d5191 | 833 | adb | Ada | Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/ptype_field/pck.adb | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/ptype_field/pck.adb | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/ptype_field/pck.adb | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | -- Copyright 2008-2017 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package body Pck is
procedure Do_Nothing (C : in out Circle) is
begin
null;
end Do_Nothing;
end Pck;
| 34.708333 | 73 | 0.726291 |
413bf1751de4f594324b46fdd6656bb2cfe5b6ed | 865 | adb | Ada | contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/aliased_array/foo.adb | TheSledgeHammer/2.11BSD | fe61f0b9aaa273783cd027c7b5ec77e95ead2153 | [
"BSD-3-Clause"
] | 3 | 2021-05-04T17:09:06.000Z | 2021-10-04T07:19:26.000Z | contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/aliased_array/foo.adb | TheSledgeHammer/2.11BSD | fe61f0b9aaa273783cd027c7b5ec77e95ead2153 | [
"BSD-3-Clause"
] | null | null | null | contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/aliased_array/foo.adb | TheSledgeHammer/2.11BSD | fe61f0b9aaa273783cd027c7b5ec77e95ead2153 | [
"BSD-3-Clause"
] | null | null | null | -- Copyright 2012-2020 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with Pck; use Pck;
procedure Foo is
BT : aliased Bounded := New_Bounded (Low => 1, High => 3);
begin
Do_Nothing (BT'Address); -- STOP
end Foo;
| 37.608696 | 73 | 0.722543 |
2f4068be66c2f058d8262a794b596db851248825 | 7,676 | adb | Ada | awa/plugins/awa-sysadmin/src/model/awa-sysadmin-models.adb | twdroeger/ada-awa | 77b824773747aecb912c37b1b7b59ea414679b80 | [
"Apache-2.0"
] | null | null | null | awa/plugins/awa-sysadmin/src/model/awa-sysadmin-models.adb | twdroeger/ada-awa | 77b824773747aecb912c37b1b7b59ea414679b80 | [
"Apache-2.0"
] | null | null | null | awa/plugins/awa-sysadmin/src/model/awa-sysadmin-models.adb | twdroeger/ada-awa | 77b824773747aecb912c37b1b7b59ea414679b80 | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- AWA.Sysadmin.Models -- AWA.Sysadmin.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) 2019 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.Unchecked_Deallocation;
with Util.Beans.Objects.Time;
with ASF.Events.Faces.Actions;
package body AWA.Sysadmin.Models is
use type ADO.Objects.Object_Record_Access;
use type ADO.Objects.Object_Ref;
pragma Warnings (Off, "formal parameter * is not referenced");
-- ------------------------------
-- Get the bean attribute identified by the name.
-- ------------------------------
overriding
function Get_Value (From : in User_Info;
Name : in String) return Util.Beans.Objects.Object is
begin
if Name = "id" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Id));
elsif Name = "name" then
return Util.Beans.Objects.To_Object (From.Name);
elsif Name = "title" then
return Util.Beans.Objects.To_Object (From.Title);
elsif Name = "is_public" then
return Util.Beans.Objects.To_Object (From.Is_Public);
elsif Name = "last_version" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Last_Version));
elsif Name = "read_count" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Read_Count));
elsif Name = "create_date" then
return Util.Beans.Objects.Time.To_Object (From.Create_Date);
elsif Name = "author" then
return Util.Beans.Objects.To_Object (From.Author);
end if;
return Util.Beans.Objects.Null_Object;
end Get_Value;
-- ------------------------------
-- Set the value identified by the name
-- ------------------------------
overriding
procedure Set_Value (Item : in out User_Info;
Name : in String;
Value : in Util.Beans.Objects.Object) is
begin
if Name = "id" then
Item.Id := ADO.Identifier (Util.Beans.Objects.To_Long_Long_Integer (Value));
elsif Name = "name" then
Item.Name := Util.Beans.Objects.To_Unbounded_String (Value);
elsif Name = "title" then
Item.Title := Util.Beans.Objects.To_Unbounded_String (Value);
elsif Name = "is_public" then
Item.Is_Public := Util.Beans.Objects.To_Boolean (Value);
elsif Name = "last_version" then
Item.Last_Version := Util.Beans.Objects.To_Integer (Value);
elsif Name = "read_count" then
Item.Read_Count := Util.Beans.Objects.To_Integer (Value);
elsif Name = "create_date" then
Item.Create_Date := Util.Beans.Objects.Time.To_Time (Value);
elsif Name = "author" then
Item.Author := Util.Beans.Objects.To_Unbounded_String (Value);
end if;
end Set_Value;
-- --------------------
-- Run the query controlled by <b>Context</b> and append the list in <b>Object</b>.
-- --------------------
procedure List (Object : in out User_Info_List_Bean'Class;
Session : in out ADO.Sessions.Session'Class;
Context : in out ADO.Queries.Context'Class) is
begin
List (Object.List, Session, Context);
end List;
-- --------------------
-- The information about a wiki page.
-- --------------------
procedure List (Object : in out User_Info_Vector;
Session : in out ADO.Sessions.Session'Class;
Context : in out ADO.Queries.Context'Class) is
procedure Read (Into : in out User_Info);
Stmt : ADO.Statements.Query_Statement
:= Session.Create_Statement (Context);
Pos : Positive := 1;
procedure Read (Into : in out User_Info) is
begin
Into.Id := Stmt.Get_Identifier (0);
Into.Name := Stmt.Get_Unbounded_String (1);
Into.Title := Stmt.Get_Unbounded_String (2);
Into.Is_Public := Stmt.Get_Boolean (3);
Into.Last_Version := Stmt.Get_Integer (4);
Into.Read_Count := Stmt.Get_Integer (5);
Into.Create_Date := Stmt.Get_Time (6);
Into.Author := Stmt.Get_Unbounded_String (7);
end Read;
begin
Stmt.Execute;
User_Info_Vectors.Clear (Object);
while Stmt.Has_Elements loop
Object.Insert_Space (Before => Pos);
Object.Update_Element (Index => Pos, Process => Read'Access);
Pos := Pos + 1;
Stmt.Next;
end loop;
end List;
procedure Op_Authenticate (Bean : in out Authenticate_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String);
procedure Op_Authenticate (Bean : in out Authenticate_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is
begin
Authenticate_Bean'Class (Bean).Authenticate (Outcome);
end Op_Authenticate;
package Binding_Authenticate_Bean_1 is
new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Authenticate_Bean,
Method => Op_Authenticate,
Name => "authenticate");
Binding_Authenticate_Bean_Array : aliased constant Util.Beans.Methods.Method_Binding_Array
:= (1 => Binding_Authenticate_Bean_1.Proxy'Access
);
-- ------------------------------
-- This bean provides some methods that can be used in a Method_Expression.
-- ------------------------------
overriding
function Get_Method_Bindings (From : in Authenticate_Bean)
return Util.Beans.Methods.Method_Binding_Array_Access is
pragma Unreferenced (From);
begin
return Binding_Authenticate_Bean_Array'Access;
end Get_Method_Bindings;
-- ------------------------------
-- Get the bean attribute identified by the name.
-- ------------------------------
overriding
function Get_Value (From : in Authenticate_Bean;
Name : in String) return Util.Beans.Objects.Object is
begin
if Name = "password" then
return Util.Beans.Objects.To_Object (From.Password);
end if;
return Util.Beans.Objects.Null_Object;
end Get_Value;
-- ------------------------------
-- Set the value identified by the name
-- ------------------------------
overriding
procedure Set_Value (Item : in out Authenticate_Bean;
Name : in String;
Value : in Util.Beans.Objects.Object) is
begin
if Name = "password" then
Item.Password := Util.Beans.Objects.To_Unbounded_String (Value);
end if;
end Set_Value;
end AWA.Sysadmin.Models;
| 40.4 | 93 | 0.584158 |
29cd8565a51d3560f7c188b483ee8a530eb81eb8 | 793 | ads | Ada | resources/scripts/scrape/yahoo.ads | shahriarr-sec/Amass | cba7aa618cde1e2cbb3df673801065011918ce7f | [
"Apache-2.0"
] | 1 | 2021-02-04T22:55:20.000Z | 2021-02-04T22:55:20.000Z | resources/scripts/scrape/yahoo.ads | shahriarr-sec/Amass | cba7aa618cde1e2cbb3df673801065011918ce7f | [
"Apache-2.0"
] | null | null | null | resources/scripts/scrape/yahoo.ads | shahriarr-sec/Amass | cba7aa618cde1e2cbb3df673801065011918ce7f | [
"Apache-2.0"
] | null | null | null | -- 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 url = require("url")
name = "Yahoo"
type = "scrape"
function start()
setratelimit(1)
end
function vertical(ctx, domain)
for i=0,10 do
local ok = scrape(ctx, {['url']=buildurl(domain, i)})
if not ok then
break
end
checkratelimit()
end
end
function buildurl(domain, pagenum)
local next = tostring((pagenum * 10) + 1)
local query = "site:" .. domain .. " -domain:www." .. domain
local params = {
p=query,
b=next,
pz="10",
bct="0",
xargs="0",
}
return "https://search.yahoo.com/search?" .. url.build_query_string(params)
end
| 21.432432 | 97 | 0.598991 |
50ad451fc36416694fe3526299fddfbf7b791e2e | 12,201 | ads | Ada | tools/scitools/conf/understand/ada/ada12/s-interr.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | 1 | 2020-01-20T21:26:46.000Z | 2020-01-20T21:26:46.000Z | tools/scitools/conf/understand/ada/ada12/s-interr.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada12/s-interr.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . I N T E R R U P T S --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2011, Free Software Foundation, Inc. --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
-- Note: the compiler generates direct calls to this interface, via Rtsfind.
-- Any changes to this interface may require corresponding compiler changes.
-- This package encapsulates the implementation of interrupt or signal
-- handlers. It is logically an extension of the body of Ada.Interrupts. It
-- is made a child of System to allow visibility of various runtime system
-- internal data and operations.
-- See System.Interrupt_Management for core interrupt/signal interfaces
-- These two packages are separated to allow System.Interrupt_Management to be
-- used without requiring the whole tasking implementation to be linked and
-- elaborated.
with System.Tasking;
with System.Tasking.Protected_Objects.Entries;
with System.OS_Interface;
package System.Interrupts is
pragma Elaborate_Body;
-- Comment needed on why this is here ???
-------------------------
-- Constants and types --
-------------------------
Default_Interrupt_Priority : constant System.Interrupt_Priority :=
System.Interrupt_Priority'Last;
-- Default value used when a pragma Interrupt_Handler or Attach_Handler is
-- specified without an Interrupt_Priority pragma, see D.3(10).
type Ada_Interrupt_ID is range 0 .. System.OS_Interface.Max_Interrupt;
-- Avoid inheritance by Ada.Interrupts.Interrupt_ID of unwanted operations
type Interrupt_ID is range 0 .. System.OS_Interface.Max_Interrupt;
subtype System_Interrupt_Id is Interrupt_ID;
-- This synonym is introduced so that the type is accessible through
-- rtsfind, otherwise the name clashes with its homonym in Ada.Interrupts.
type Parameterless_Handler is access protected procedure;
----------------------
-- General services --
----------------------
-- Attempt to attach a Handler to an Interrupt to which an Entry is
-- already bound will raise a Program_Error.
function Is_Reserved (Interrupt : Interrupt_ID) return Boolean;
function Is_Entry_Attached (Interrupt : Interrupt_ID) return Boolean;
function Is_Handler_Attached (Interrupt : Interrupt_ID) return Boolean;
function Current_Handler
(Interrupt : Interrupt_ID) return Parameterless_Handler;
-- Calling the following procedures with New_Handler = null and Static =
-- true means that we want to modify the current handler regardless of the
-- previous handler's binding status. (i.e. we do not care whether it is a
-- dynamic or static handler)
procedure Attach_Handler
(New_Handler : Parameterless_Handler;
Interrupt : Interrupt_ID;
Static : Boolean := False);
procedure Exchange_Handler
(Old_Handler : out Parameterless_Handler;
New_Handler : Parameterless_Handler;
Interrupt : Interrupt_ID;
Static : Boolean := False);
procedure Detach_Handler
(Interrupt : Interrupt_ID;
Static : Boolean := False);
function Reference
(Interrupt : Interrupt_ID) return System.Address;
--------------------------------
-- Interrupt Entries Services --
--------------------------------
-- Routines needed for Interrupt Entries
procedure Bind_Interrupt_To_Entry
(T : System.Tasking.Task_Id;
E : System.Tasking.Task_Entry_Index;
Int_Ref : System.Address);
-- Bind the given interrupt to the given entry. If the interrupt is
-- already bound to another entry, Program_Error will be raised.
procedure Detach_Interrupt_Entries (T : System.Tasking.Task_Id);
-- This procedure detaches all the Interrupt Entries bound to a task
------------------------------
-- POSIX.5 Signals Services --
------------------------------
-- Routines needed for POSIX dot5 POSIX_Signals
procedure Block_Interrupt (Interrupt : Interrupt_ID);
-- Block the Interrupt on the process level
procedure Unblock_Interrupt (Interrupt : Interrupt_ID);
function Unblocked_By
(Interrupt : Interrupt_ID) return System.Tasking.Task_Id;
-- It returns the ID of the last Task which Unblocked this Interrupt.
-- It returns Null_Task if no tasks have ever requested the Unblocking
-- operation or the Interrupt is currently Blocked.
function Is_Blocked (Interrupt : Interrupt_ID) return Boolean;
-- Comment needed ???
procedure Ignore_Interrupt (Interrupt : Interrupt_ID);
-- Set the sigaction for the interrupt to SIG_IGN
procedure Unignore_Interrupt (Interrupt : Interrupt_ID);
-- Comment needed ???
function Is_Ignored (Interrupt : Interrupt_ID) return Boolean;
-- Comment needed ???
-- Note : Direct calls to sigaction, sigprocmask, thr_sigsetmask or any
-- other low-level interface that changes the signal action or signal mask
-- needs a careful thought.
-- One may achieve the effect of system calls first making RTS blocked (by
-- calling Block_Interrupt) for the signal under consideration. This will
-- make all the tasks in RTS blocked for the Interrupt.
----------------------
-- Protection Types --
----------------------
-- Routines and types needed to implement Interrupt_Handler and
-- Attach_Handler.
-- There are two kinds of protected objects that deal with interrupts:
-- (1) Only Interrupt_Handler pragmas are used. We need to be able to tell
-- if an Interrupt_Handler applies to a given procedure, so
-- Register_Interrupt_Handler has to be called for all the potential
-- handlers, it should be done by calling Register_Interrupt_Handler with
-- the handler code address. On finalization, which can happen only has
-- part of library level finalization since PO with Interrupt_Handler
-- pragmas can only be declared at library level, nothing special needs to
-- be done since the default handlers have been restored as part of task
-- completion which is done just before global finalization.
-- Dynamic_Interrupt_Protection should be used in this case.
-- (2) Attach_Handler pragmas are used, and possibly Interrupt_Handler
-- pragma. We need to attach the handlers to the given interrupts when the
-- object is elaborated. This should be done by constructing an array of
-- pairs (interrupt, handler) from the pragmas and calling Install_Handlers
-- with it (types to be used are New_Handler_Item and New_Handler_Array).
-- On finalization, we need to restore the handlers that were installed
-- before the elaboration of the PO, so we need to store these previous
-- handlers. This is also done by Install_Handlers, the room for these
-- informations is provided by adding a discriminant which is the number
-- of Attach_Handler pragmas and an array of this size in the protection
-- type, Static_Interrupt_Protection.
procedure Register_Interrupt_Handler
(Handler_Addr : System.Address);
-- This routine should be called by the compiler to allow the handler be
-- used as an Interrupt Handler. That means call this procedure for each
-- pragma Interrupt_Handler providing the address of the handler (not
-- including the pointer to the actual PO, this way this routine is called
-- only once for each type definition of PO).
type Static_Handler_Index is range 0 .. Integer'Last;
subtype Positive_Static_Handler_Index is
Static_Handler_Index range 1 .. Static_Handler_Index'Last;
-- Comment needed ???
type Previous_Handler_Item is record
Interrupt : Interrupt_ID;
Handler : Parameterless_Handler;
Static : Boolean;
end record;
-- Contains all the information needed to restore a previous handler
type Previous_Handler_Array is array
(Positive_Static_Handler_Index range <>) of Previous_Handler_Item;
type New_Handler_Item is record
Interrupt : Interrupt_ID;
Handler : Parameterless_Handler;
end record;
-- Contains all the information from an Attach_Handler pragma
type New_Handler_Array is
array (Positive_Static_Handler_Index range <>) of New_Handler_Item;
-- Comment needed ???
-- Case (1)
type Dynamic_Interrupt_Protection is new
Tasking.Protected_Objects.Entries.Protection_Entries with null record;
-- ??? Finalize is not overloaded since we currently have no
-- way to detach the handlers during library level finalization.
function Has_Interrupt_Or_Attach_Handler
(Object : access Dynamic_Interrupt_Protection) return Boolean;
-- Returns True
-- Case (2)
type Static_Interrupt_Protection
(Num_Entries : Tasking.Protected_Objects.Protected_Entry_Index;
Num_Attach_Handler : Static_Handler_Index)
is new
Tasking.Protected_Objects.Entries.Protection_Entries (Num_Entries) with
record
Previous_Handlers : Previous_Handler_Array (1 .. Num_Attach_Handler);
end record;
function Has_Interrupt_Or_Attach_Handler
(Object : access Static_Interrupt_Protection) return Boolean;
-- Returns True
overriding
procedure Finalize (Object : in out Static_Interrupt_Protection);
-- Restore previous handlers as required by C.3.1(12) then call
-- Finalize (Protection).
procedure Install_Handlers
(Object : access Static_Interrupt_Protection;
New_Handlers : New_Handler_Array);
-- Store the old handlers in Object.Previous_Handlers and install
-- the new static handlers.
procedure Install_Restricted_Handlers (Handlers : New_Handler_Array);
-- Install the static Handlers for the given interrupts and do not store
-- previously installed handlers. This procedure is used when the Ravenscar
-- restrictions are in place since in that case there are only
-- library-level protected handlers that will be installed at
-- initialization and never be replaced.
end System.Interrupts;
| 43.888489 | 79 | 0.636095 |
1da3ae32c3e2b2b85d0e1844b5f6845ae19d5b27 | 30,755 | ads | Ada | src/dw1000-registers.ads | SALLYPEMDAS/DW1000 | ce2906596e479c83ce64673e8e7cf03856c45523 | [
"MIT"
] | 9 | 2016-07-06T21:26:41.000Z | 2020-11-22T11:21:58.000Z | src/dw1000-registers.ads | hao122065175/DW1000 | ce2906596e479c83ce64673e8e7cf03856c45523 | [
"MIT"
] | 1 | 2018-06-19T15:20:41.000Z | 2018-06-19T21:14:31.000Z | src/dw1000-registers.ads | hao122065175/DW1000 | ce2906596e479c83ce64673e8e7cf03856c45523 | [
"MIT"
] | 4 | 2018-07-18T03:35:25.000Z | 2020-11-22T11:21:59.000Z | -------------------------------------------------------------------------------
-- Copyright (c) 2016 Daniel King
--
-- 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 DW1000.Generic_RO_Register_Driver;
with DW1000.Generic_WO_Register_Driver;
with DW1000.Generic_RW_Register_Driver;
with DW1000.Register_Types;
with DW1000.Types;
pragma Elaborate_All (DW1000.Generic_RO_Register_Driver);
pragma Elaborate_All (DW1000.Generic_WO_Register_Driver);
pragma Elaborate_All (DW1000.Generic_RW_Register_Driver);
-- This package defines register driver instances for each of the DW1000
-- device registers to allow for typed reading and writing each register
-- (or sub-register).
--
-- Each register is typed, using the corresponding type defined in the package
-- DW1000.Register_Types. These types allow for easy manipulation for the
-- register's fields.
--
-- Below is an example of modifying the receive and transmit channels from
-- the CHAN_CTRL register (package names omitted for clarity):
-- declare
-- Reg : CHAN_CTRL_Type;
-- begin
-- CHAN_CTRL.Read(Reg);
-- Reg.RX_CHAN := 5;
-- Reg.TX_CHAN := 5;
-- CHAN_CTRL.Write(Reg);
-- end;
package DW1000.Registers
with SPARK_Mode => On
is
----------------------------------------------------------------------------
-- Register IDs
DEV_ID_Reg_ID : constant Types.Bits_6 := 16#00#;
EUI_Reg_ID : constant Types.Bits_6 := 16#01#;
PANADR_Reg_ID : constant Types.Bits_6 := 16#03#;
SYS_CFG_Reg_ID : constant Types.Bits_6 := 16#04#;
SYS_TIME_Reg_ID : constant Types.Bits_6 := 16#06#;
TX_FCTRL_Reg_ID : constant Types.Bits_6 := 16#08#;
TX_BUFFER_Reg_ID : constant Types.Bits_6 := 16#09#;
DX_TIME_Reg_ID : constant Types.Bits_6 := 16#0A#;
RX_FWTO_Reg_ID : constant Types.Bits_6 := 16#0C#;
SYS_CTRL_Reg_ID : constant Types.Bits_6 := 16#0D#;
SYS_MASK_Reg_ID : constant Types.Bits_6 := 16#0E#;
SYS_STATUS_Reg_ID : constant Types.Bits_6 := 16#0F#;
RX_FINFO_Reg_ID : constant Types.Bits_6 := 16#10#;
RX_BUFFER_Reg_ID : constant Types.Bits_6 := 16#11#;
RX_FQUAL_Reg_ID : constant Types.Bits_6 := 16#12#;
RX_TTCKI_Reg_ID : constant Types.Bits_6 := 16#13#;
RX_TTCKO_Reg_ID : constant Types.Bits_6 := 16#14#;
RX_TIME_Reg_ID : constant Types.Bits_6 := 16#15#;
TX_TIME_Reg_ID : constant Types.Bits_6 := 16#17#;
TX_ANTD_Reg_ID : constant Types.Bits_6 := 16#18#;
SYS_STATE_Reg_ID : constant Types.Bits_6 := 16#19#;
ACK_RESP_T_Reg_ID : constant Types.Bits_6 := 16#1A#;
RX_SNIFF_Reg_ID : constant Types.Bits_6 := 16#1D#;
TX_POWER_Reg_ID : constant Types.Bits_6 := 16#1E#;
CHAN_CTRL_Reg_ID : constant Types.Bits_6 := 16#1F#;
USR_SFD_Reg_ID : constant Types.Bits_6 := 16#21#;
AGC_CTRL_Reg_ID : constant Types.Bits_6 := 16#23#;
EXT_SYNC_Reg_ID : constant Types.Bits_6 := 16#24#;
ACC_MEM_Reg_ID : constant Types.Bits_6 := 16#25#;
GPIO_CTRL_Reg_ID : constant Types.Bits_6 := 16#26#;
DRX_CONF_Reg_ID : constant Types.Bits_6 := 16#27#;
RF_CONF_Reg_ID : constant Types.Bits_6 := 16#28#;
TX_CAL_Reg_ID : constant Types.Bits_6 := 16#2A#;
FS_CTRL_Reg_ID : constant Types.Bits_6 := 16#2B#;
AON_Reg_ID : constant Types.Bits_6 := 16#2C#;
OTP_IF_Reg_ID : constant Types.Bits_6 := 16#2D#;
LDE_CTRL_Reg_ID : constant Types.Bits_6 := 16#2E#;
DIG_DIAG_Reg_ID : constant Types.Bits_6 := 16#2F#;
PMSC_Reg_ID : constant Types.Bits_6 := 16#36#;
----------------------------------------------------------------------------
-- Sub-Register IDs
AGC_CTRL1_Sub_Reg_ID : constant Types.Bits_15 := 16#02#;
AGC_TUNE1_Sub_Reg_ID : constant Types.Bits_15 := 16#04#;
AGC_TUNE2_Sub_Reg_ID : constant Types.Bits_15 := 16#0C#;
AGC_TUNE3_Sub_Reg_ID : constant Types.Bits_15 := 16#12#;
AGC_STAT1_Sub_Reg_ID : constant Types.Bits_15 := 16#1E#;
EC_CTRL_Sub_Reg_ID : constant Types.Bits_15 := 16#00#;
EC_RXTC_Sub_Reg_ID : constant Types.Bits_15 := 16#04#;
EC_GOLP_Sub_Reg_ID : constant Types.Bits_15 := 16#08#;
GPIO_MODE_Sub_Reg_ID : constant Types.Bits_15 := 16#00#;
GPIO_DIR_Sub_Reg_ID : constant Types.Bits_15 := 16#08#;
GPIO_DOUT_Sub_Reg_ID : constant Types.Bits_15 := 16#0C#;
GPIO_IRQE_Sub_Reg_ID : constant Types.Bits_15 := 16#10#;
GPIO_ISEN_Sub_Reg_ID : constant Types.Bits_15 := 16#14#;
GPIO_IMODE_Sub_Reg_ID : constant Types.Bits_15 := 16#18#;
GPIO_IBES_Sub_Reg_ID : constant Types.Bits_15 := 16#1C#;
GPIO_ICLR_Sub_Reg_ID : constant Types.Bits_15 := 16#20#;
GPIO_IDBE_Sub_Reg_ID : constant Types.Bits_15 := 16#24#;
GPIO_RAW_Sub_Reg_ID : constant Types.Bits_15 := 16#28#;
DRX_TUNE0b_Sub_Reg_ID : constant Types.Bits_15 := 16#02#;
DRX_TUNE1a_Sub_Reg_ID : constant Types.Bits_15 := 16#04#;
DRX_TUNE1b_Sub_Reg_ID : constant Types.Bits_15 := 16#06#;
DRX_TUNE2_Sub_Reg_ID : constant Types.Bits_15 := 16#08#;
DRX_SFDTOC_Sub_Reg_ID : constant Types.Bits_15 := 16#20#;
DRX_PRETOC_Sub_Reg_ID : constant Types.Bits_15 := 16#24#;
DRX_TUNE4H_Sub_Reg_ID : constant Types.Bits_15 := 16#26#;
RXPACC_NOSAT_Sub_Reg_ID : constant Types.Bits_15 := 16#2C#;
RF_CONF_Sub_Reg_ID : constant Types.Bits_15 := 16#00#;
RF_RXCTRLH_Sub_Reg_ID : constant Types.Bits_15 := 16#0B#;
RF_TXCTRL_Sub_Reg_ID : constant Types.Bits_15 := 16#0C#;
RF_STATUS_Sub_Reg_ID : constant Types.Bits_15 := 16#2C#;
LDOTUNE_Sub_Reg_ID : constant Types.Bits_15 := 16#30#;
TC_SARC_Sub_Reg_ID : constant Types.Bits_15 := 16#00#;
TC_SARL_Sub_Reg_ID : constant Types.Bits_15 := 16#03#;
TC_SARW_Sub_Reg_ID : constant Types.Bits_15 := 16#06#;
TC_PG_CTRL_Sub_Reg_ID : constant Types.Bits_15 := 16#08#;
TC_PG_STATUS_Sub_Reg_ID : constant Types.Bits_15 := 16#09#;
TC_PGDELAY_Sub_Reg_ID : constant Types.Bits_15 := 16#0B#;
TC_PGTEST_Sub_Reg_ID : constant Types.Bits_15 := 16#0C#;
FS_PLLCFG_Sub_Reg_ID : constant Types.Bits_15 := 16#07#;
FS_PLLTUNE_Sub_Reg_ID : constant Types.Bits_15 := 16#0B#;
FS_XTALT_Sub_Reg_ID : constant Types.Bits_15 := 16#0E#;
AON_WCFG_Sub_Reg_ID : constant Types.Bits_15 := 16#00#;
AON_CTRL_Sub_Reg_ID : constant Types.Bits_15 := 16#02#;
AON_RDAT_Sub_Reg_ID : constant Types.Bits_15 := 16#03#;
AON_ADDR_Sub_Reg_ID : constant Types.Bits_15 := 16#04#;
AON_CFG0_Sub_Reg_ID : constant Types.Bits_15 := 16#06#;
AON_CFG1_Sub_Reg_ID : constant Types.Bits_15 := 16#0A#;
OTP_WDAT_Sub_Reg_ID : constant Types.Bits_15 := 16#00#;
OTP_ADDR_Sub_Reg_ID : constant Types.Bits_15 := 16#04#;
OTP_CTRL_Sub_Reg_ID : constant Types.Bits_15 := 16#06#;
OTP_STAT_Sub_Reg_ID : constant Types.Bits_15 := 16#08#;
OTP_RDAT_Sub_Reg_ID : constant Types.Bits_15 := 16#0A#;
OTP_SRDAT_Sub_Reg_ID : constant Types.Bits_15 := 16#0E#;
OTP_SF_Sub_Reg_ID : constant Types.Bits_15 := 16#12#;
LDE_THRESH_Sub_Reg_ID : constant Types.Bits_15 := 16#0000#;
LDE_CFG1_Sub_Reg_ID : constant Types.Bits_15 := 16#0806#;
LDE_PPINDX_Sub_Reg_ID : constant Types.Bits_15 := 16#1000#;
LDE_PPAMPL_Sub_Reg_ID : constant Types.Bits_15 := 16#1002#;
LDE_RXANTD_Sub_Reg_ID : constant Types.Bits_15 := 16#1804#;
LDE_CFG2_Sub_Reg_ID : constant Types.Bits_15 := 16#1806#;
LDE_REPC_Sub_Reg_ID : constant Types.Bits_15 := 16#2804#;
EVC_CTRL_Sub_Reg_ID : constant Types.Bits_15 := 16#00#;
EVC_PHE_Sub_Reg_ID : constant Types.Bits_15 := 16#04#;
EVC_RSE_Sub_Reg_ID : constant Types.Bits_15 := 16#06#;
EVC_FCG_Sub_Reg_ID : constant Types.Bits_15 := 16#08#;
EVC_FCE_Sub_Reg_ID : constant Types.Bits_15 := 16#0A#;
EVC_FFR_Sub_Reg_ID : constant Types.Bits_15 := 16#0C#;
EVC_OVR_Sub_Reg_ID : constant Types.Bits_15 := 16#0E#;
EVC_STO_Sub_Reg_ID : constant Types.Bits_15 := 16#10#;
EVC_PTO_Sub_Reg_ID : constant Types.Bits_15 := 16#12#;
EVC_FWTO_Sub_Reg_ID : constant Types.Bits_15 := 16#14#;
EVC_TXFS_Sub_Reg_ID : constant Types.Bits_15 := 16#16#;
EVC_HPW_Sub_Reg_ID : constant Types.Bits_15 := 16#18#;
EVC_TPW_Sub_Reg_ID : constant Types.Bits_15 := 16#1A#;
DIAG_TMC_Sub_Reg_ID : constant Types.Bits_15 := 16#24#;
PMSC_CTRL0_Sub_Reg_ID : constant Types.Bits_15 := 16#00#;
PMSC_CTRL1_Sub_Reg_ID : constant Types.Bits_15 := 16#04#;
PMSC_SNOZT_Sub_Reg_ID : constant Types.Bits_15 := 16#0C#;
PMSC_TXFSEQ_Sub_Reg_ID : constant Types.Bits_15 := 16#26#;
PMSC_LEDC_Sub_Reg_ID : constant Types.Bits_15 := 16#28#;
----------------------------------------------------------------------------
-- Register Definitions
package DEV_ID is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.DEV_ID_Type,
Register_ID => DEV_ID_Reg_ID);
package EUI is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.EUI_Type,
Register_ID => EUI_Reg_ID);
package PANADR is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.PANADR_Type,
Register_ID => PANADR_Reg_ID);
package SYS_CFG is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.SYS_CFG_Type,
Register_ID => SYS_CFG_Reg_ID);
package SYS_TIME is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.SYS_TIME_Type,
Register_ID => SYS_TIME_Reg_ID);
package TX_FCTRL is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.TX_FCTRL_Type,
Register_ID => TX_FCTRL_Reg_ID);
package TX_BUFFER is new DW1000.Generic_WO_Register_Driver
(Register_Type => DW1000.Register_Types.TX_BUFFER_Type,
Register_ID => TX_BUFFER_Reg_ID);
package DX_TIME is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.DX_TIME_Type,
Register_ID => DX_TIME_Reg_ID);
package RX_FWTO is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.RX_FWTO_Type,
Register_ID => RX_FWTO_Reg_ID);
package SYS_CTRL is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.SYS_CTRL_Type,
Register_ID => SYS_CTRL_Reg_ID);
package SYS_MASK is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.SYS_MASK_Type,
Register_ID => SYS_MASK_Reg_ID);
package SYS_STATUS is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.SYS_STATUS_Type,
Register_ID => SYS_STATUS_Reg_ID);
package RX_FINFO is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.RX_FINFO_Type,
Register_ID => RX_FINFO_Reg_ID);
package RX_BUFFER is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.RX_BUFFER_Type,
Register_ID => RX_BUFFER_Reg_ID);
package RX_FQUAL is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.RX_FQUAL_Type,
Register_ID => RX_FQUAL_Reg_ID);
package RX_TTCKI is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.RX_TTCKI_Type,
Register_ID => RX_TTCKI_Reg_ID);
package RX_TTCKO is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.RX_TTCKO_Type,
Register_ID => RX_TTCKO_Reg_ID);
package RX_TIME is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.RX_TIME_Type,
Register_ID => RX_TIME_Reg_ID);
package TX_TIME is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.TX_TIME_Type,
Register_ID => TX_TIME_Reg_ID);
package TX_ANTD is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.TX_ANTD_Type,
Register_ID => TX_ANTD_Reg_ID);
package SYS_STATE is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.SYS_STATUS_Type,
Register_ID => SYS_STATE_Reg_ID);
package ACK_RESP_T is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.ACK_RESP_T_Type,
Register_ID => ACK_RESP_T_Reg_ID);
package RX_SNIFF is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.RX_SNIFF_Type,
Register_ID => RX_SNIFF_Reg_ID);
package TX_POWER is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.TX_POWER_Type,
Register_ID => TX_POWER_Reg_ID);
package CHAN_CTRL is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.CHAN_CTRL_Type,
Register_ID => CHAN_CTRL_Reg_ID);
package USR_SFD is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.USR_SFD_Type,
Register_ID => USR_SFD_Reg_ID);
package AGC_CTRL1 is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.AGC_CTRL1_Type,
Register_ID => AGC_CTRL_Reg_ID,
Sub_Register => AGC_CTRL1_Sub_Reg_ID);
package AGC_TUNE1 is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.AGC_TUNE1_Type,
Register_ID => AGC_CTRL_Reg_ID,
Sub_Register => AGC_CTRL1_Sub_Reg_ID);
package AGC_TUNE2 is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.AGC_TUNE2_Type,
Register_ID => AGC_CTRL_Reg_ID,
Sub_Register => AGC_TUNE2_Sub_Reg_ID);
package AGC_TUNE3 is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.AGC_TUNE3_Type,
Register_ID => AGC_CTRL_Reg_ID,
Sub_Register => AGC_TUNE3_Sub_Reg_ID);
package AGC_STAT1 is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.AGC_STAT1_Type,
Register_ID => AGC_CTRL_Reg_ID,
Sub_Register => AGC_STAT1_Sub_Reg_ID);
package EC_CTRL is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.EC_CTRL_Type,
Register_ID => EXT_SYNC_Reg_ID,
Sub_Register => EC_CTRL_Sub_Reg_ID);
package EC_RXTC is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.EC_RXTC_Type,
Register_ID => EXT_SYNC_Reg_ID,
Sub_Register => EC_RXTC_Sub_Reg_ID);
package EC_GOLP is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.EC_GOLP_Type,
Register_ID => EXT_SYNC_Reg_ID,
Sub_Register => EC_GOLP_Sub_Reg_ID);
package ACC_MEM is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.ACC_MEM_Type,
Register_ID => ACC_MEM_Reg_ID);
package GPIO_MODE is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.GPIO_MODE_Type,
Register_ID => GPIO_CTRL_Reg_ID,
Sub_Register => GPIO_MODE_Sub_Reg_ID);
package GPIO_DIR is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.GPIO_DIR_Type,
Register_ID => GPIO_CTRL_Reg_ID,
Sub_Register => GPIO_DIR_Sub_Reg_ID);
package GPIO_DOUT is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.GPIO_DOUT_Type,
Register_ID => GPIO_CTRL_Reg_ID,
Sub_Register => GPIO_DOUT_Sub_Reg_ID);
package GPIO_IRQE is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.GPIO_IRQE_Type,
Register_ID => GPIO_CTRL_Reg_ID,
Sub_Register => GPIO_IRQE_Sub_Reg_ID);
package GPIO_ISEN is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.GPIO_ISEN_Type,
Register_ID => GPIO_CTRL_Reg_ID,
Sub_Register => GPIO_ISEN_Sub_Reg_ID);
package GPIO_IMODE is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.GPIO_IMODE_Type,
Register_ID => GPIO_CTRL_Reg_ID,
Sub_Register => GPIO_IMODE_Sub_Reg_ID);
package GPIO_IBES is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.GPIO_IBES_Type,
Register_ID => GPIO_CTRL_Reg_ID,
Sub_Register => GPIO_IBES_Sub_Reg_ID);
package GPIO_ICLR is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.GPIO_ICLR_Type,
Register_ID => GPIO_CTRL_Reg_ID,
Sub_Register => GPIO_ICLR_Sub_Reg_ID);
package GPIO_IDBE is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.GPIO_IDBE_Type,
Register_ID => GPIO_CTRL_Reg_ID,
Sub_Register => GPIO_IDBE_Sub_Reg_ID);
package GPIO_RAW is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.GPIO_RAW_Type,
Register_ID => GPIO_CTRL_Reg_ID,
Sub_Register => GPIO_RAW_Sub_Reg_ID);
package DRX_TUNE0b is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.DRX_TUNE0b_Type,
Register_ID => DRX_CONF_Reg_ID,
Sub_Register => DRX_TUNE0b_Sub_Reg_ID);
package DRX_TUNE1a is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.DRX_TUNE1a_Type,
Register_ID => DRX_CONF_Reg_ID,
Sub_Register => DRX_TUNE1a_Sub_Reg_ID);
package DRX_TUNE1b is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.DRX_TUNE1b_Type,
Register_ID => DRX_CONF_Reg_ID,
Sub_Register => DRX_TUNE1b_Sub_Reg_ID);
package DRX_TUNE2 is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.DRX_TUNE2_Type,
Register_ID => DRX_CONF_Reg_ID,
Sub_Register => DRX_TUNE2_Sub_Reg_ID);
package DRX_SFDTOC is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.DRX_SFDTOC_Type,
Register_ID => DRX_CONF_Reg_ID,
Sub_Register => DRX_SFDTOC_Sub_Reg_ID);
package DRX_PRETOC is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.DRX_PRETOC_Type,
Register_ID => DRX_CONF_Reg_ID,
Sub_Register => DRX_PRETOC_Sub_Reg_ID);
package DRX_TUNE4H is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.DRX_TUNE4H_Type,
Register_ID => DRX_CONF_Reg_ID,
Sub_Register => DRX_TUNE4H_Sub_Reg_ID);
package RXPACC_NOSAT is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.RXPACC_NOSAT_Type,
Register_ID => DRX_CONF_Reg_ID,
Sub_Register => RXPACC_NOSAT_Sub_Reg_ID);
package RF_CONF is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.RF_CONF_Type,
Register_ID => RF_CONF_Reg_ID,
Sub_Register => RF_CONF_Sub_Reg_ID);
package RF_RXCTRLH is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.RF_RXCTRLH_Type,
Register_ID => RF_CONF_Reg_ID,
Sub_Register => RF_RXCTRLH_Sub_Reg_ID);
package RF_TXCTRL is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.RF_TXCTRL_Type,
Register_ID => RF_CONF_Reg_ID,
Sub_Register => RF_TXCTRL_Sub_Reg_ID);
package RF_STATUS is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.RF_STATUS_Type,
Register_ID => RF_CONF_Reg_ID,
Sub_Register => RF_STATUS_Sub_Reg_ID);
package LDOTUNE is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.LDOTUNE_Type,
Register_ID => RF_CONF_Reg_ID,
Sub_Register => LDOTUNE_Sub_Reg_ID);
package TC_SARC is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.TC_SARC_Type,
Register_ID => TX_CAL_Reg_ID,
Sub_Register => TC_SARC_Sub_Reg_ID);
package TC_SARL is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.TC_SARL_Type,
Register_ID => TX_CAL_Reg_ID,
Sub_Register => TC_SARL_Sub_Reg_ID);
package TC_SARW is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.TC_SARW_Type,
Register_ID => TX_CAL_Reg_ID,
Sub_Register => TC_SARW_Sub_Reg_ID);
package TC_PG_CTRL is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.TC_PG_CTRL_Type,
Register_ID => TX_CAL_Reg_ID,
Sub_Register => TC_PG_CTRL_Sub_Reg_ID);
package TC_PG_STATUS is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.TC_PG_STATUS_Type,
Register_ID => TX_CAL_Reg_ID,
Sub_Register => TC_PG_STATUS_Sub_Reg_ID);
package TC_PGDELAY is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.TC_PGDELAY_Type,
Register_ID => TX_CAL_Reg_ID,
Sub_Register => TC_PGDELAY_Sub_Reg_ID);
package TC_PGTEST is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.TC_PGTEST_Type,
Register_ID => TX_CAL_Reg_ID,
Sub_Register => TC_PGTEST_Sub_Reg_ID);
package FS_PLLCFG is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.FS_PLLCFG_Type,
Register_ID => FS_CTRL_Reg_ID,
Sub_Register => FS_PLLCFG_Sub_Reg_ID);
package FS_PLLTUNE is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.FS_PLLTUNE_Type,
Register_ID => FS_CTRL_Reg_ID,
Sub_Register => FS_PLLTUNE_Sub_Reg_ID);
package FS_XTALT is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.FS_XTALT_Type,
Register_ID => FS_CTRL_Reg_ID,
Sub_Register => FS_XTALT_Sub_Reg_ID);
package AON_WCFG is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.AON_WCFG_Type,
Register_ID => AON_Reg_ID,
Sub_Register => AON_WCFG_Sub_Reg_ID);
package AON_CTRL is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.AON_CTRL_Type,
Register_ID => AON_Reg_ID,
Sub_Register => AON_CTRL_Sub_Reg_ID);
package AON_RDAT is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.AON_RDAT_Type,
Register_ID => AON_Reg_ID,
Sub_Register => AON_RDAT_Sub_Reg_ID);
package AON_ADDR is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.AON_ADDR_Type,
Register_ID => AON_Reg_ID,
Sub_Register => AON_ADDR_Sub_Reg_ID);
package AON_CFG0 is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.AON_CFG0_Type,
Register_ID => AON_Reg_ID,
Sub_Register => AON_CFG0_Sub_Reg_ID);
package AON_CFG1 is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.AON_CFG1_Type,
Register_ID => AON_Reg_ID,
Sub_Register => AON_CFG1_Sub_Reg_ID);
package OTP_WDAT is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.OTP_WDAT_Type,
Register_ID => OTP_IF_Reg_ID,
Sub_Register => OTP_WDAT_Sub_Reg_ID);
package OTP_ADDR is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.OTP_ADDR_Type,
Register_ID => OTP_IF_Reg_ID,
Sub_Register => OTP_ADDR_Sub_Reg_ID);
package OTP_CTRL is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.OTP_CTRL_Type,
Register_ID => OTP_IF_Reg_ID,
Sub_Register => OTP_CTRL_Sub_Reg_ID);
package OTP_STAT is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.OTP_STAT_Type,
Register_ID => OTP_IF_Reg_ID,
Sub_Register => OTP_STAT_Sub_Reg_ID);
package OTP_RDAT is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.OTP_RDAT_Type,
Register_ID => OTP_IF_Reg_ID,
Sub_Register => OTP_RDAT_Sub_Reg_ID);
package OTP_SRDAT is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.OTP_SRDAT_Type,
Register_ID => OTP_IF_Reg_ID,
Sub_Register => OTP_SRDAT_Sub_Reg_ID);
package OTP_SF is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.OTP_SF_Type,
Register_ID => OTP_IF_Reg_ID,
Sub_Register => OTP_SF_Sub_Reg_ID);
package LDE_THRESH is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.LDE_THRESH_Type,
Register_ID => LDE_CTRL_Reg_ID,
Sub_Register => LDE_THRESH_Sub_Reg_ID);
package LDE_CFG1 is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.LDE_CFG1_Type,
Register_ID => LDE_CTRL_Reg_ID,
Sub_Register => LDE_CFG1_Sub_Reg_ID);
package LDE_PPINDX is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.LDE_PPINDX_Type,
Register_ID => LDE_CTRL_Reg_ID,
Sub_Register => LDE_PPINDX_Sub_Reg_ID);
package LDE_PPAMPL is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.LDE_PPAMPL_Type,
Register_ID => LDE_CTRL_Reg_ID,
Sub_Register => LDE_PPAMPL_Sub_Reg_ID);
package LDE_RXANTD is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.LDE_RXANTD_Type,
Register_ID => LDE_CTRL_Reg_ID,
Sub_Register => LDE_RXANTD_Sub_Reg_ID);
package LDE_CFG2 is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.LDE_CFG2_Type,
Register_ID => LDE_CTRL_Reg_ID,
Sub_Register => LDE_CFG2_Sub_Reg_ID);
package LDE_REPC is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.LDE_REPC_Type,
Register_ID => LDE_CTRL_Reg_ID,
Sub_Register => LDE_REPC_Sub_Reg_ID);
package EVC_CTRL is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.EVC_CTRL_Type,
Register_ID => DIG_DIAG_Reg_ID,
Sub_Register => EVC_CTRL_Sub_Reg_ID);
package EVC_PHE is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.EVC_PHE_Type,
Register_ID => DIG_DIAG_Reg_ID,
Sub_Register => EVC_PHE_Sub_Reg_ID);
package EVC_RSE is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.EVC_RSE_Type,
Register_ID => DIG_DIAG_Reg_ID,
Sub_Register => EVC_RSE_Sub_Reg_ID);
package EVC_FCG is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.EVC_FCG_Type,
Register_ID => DIG_DIAG_Reg_ID,
Sub_Register => EVC_FCG_Sub_Reg_ID);
package EVC_FCE is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.EVC_FCE_Type,
Register_ID => DIG_DIAG_Reg_ID,
Sub_Register => EVC_FCE_Sub_Reg_ID);
package EVC_FFR is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.EVC_FFR_Type,
Register_ID => DIG_DIAG_Reg_ID,
Sub_Register => EVC_FFR_Sub_Reg_ID);
package EVC_OVR is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.EVC_OVR_Type,
Register_ID => DIG_DIAG_Reg_ID,
Sub_Register => EVC_OVR_Sub_Reg_ID);
package EVC_STO is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.EVC_STO_Type,
Register_ID => DIG_DIAG_Reg_ID,
Sub_Register => EVC_STO_Sub_Reg_ID);
package EVC_PTO is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.EVC_PTO_Type,
Register_ID => DIG_DIAG_Reg_ID,
Sub_Register => EVC_PTO_Sub_Reg_ID);
package EVC_FWTO is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.EVC_FWTO_Type,
Register_ID => DIG_DIAG_Reg_ID,
Sub_Register => EVC_FWTO_Sub_Reg_ID);
package EVC_TXFS is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.EVC_TXFS_Type,
Register_ID => DIG_DIAG_Reg_ID,
Sub_Register => EVC_TXFS_Sub_Reg_ID);
package EVC_HPW is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.EVC_HPW_Type,
Register_ID => DIG_DIAG_Reg_ID,
Sub_Register => EVC_HPW_Sub_Reg_ID);
package EVC_TPW is new DW1000.Generic_RO_Register_Driver
(Register_Type => DW1000.Register_Types.EVC_TPW_Type,
Register_ID => DIG_DIAG_Reg_ID,
Sub_Register => EVC_TPW_Sub_Reg_ID);
package DIAG_TMC is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.DIAG_TMC_Type,
Register_ID => DIG_DIAG_Reg_ID,
Sub_Register => DIAG_TMC_Sub_Reg_ID);
package PMSC_CTRL0 is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.PMSC_CTRL0_Type,
Register_ID => PMSC_Reg_ID,
Sub_Register => PMSC_CTRL0_Sub_Reg_ID);
package PMSC_CTRL1 is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.PMSC_CTRL1_Type,
Register_ID => PMSC_Reg_ID,
Sub_Register => PMSC_CTRL1_Sub_Reg_ID);
package PMSC_SNOZT is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.PMSC_SNOZT_Type,
Register_ID => PMSC_Reg_ID,
Sub_Register => PMSC_SNOZT_Sub_Reg_ID);
package PMSC_TXFSEQ is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.PMSC_TXFSEQ_Type,
Register_ID => PMSC_Reg_ID,
Sub_Register => PMSC_TXFSEQ_Sub_Reg_ID);
package PMSC_LEDC is new DW1000.Generic_RW_Register_Driver
(Register_Type => DW1000.Register_Types.PMSC_LEDC_Type,
Register_ID => PMSC_Reg_ID,
Sub_Register => PMSC_LEDC_Sub_Reg_ID);
end DW1000.Registers;
| 43.748222 | 79 | 0.730288 |
579307a5f6670b048d1ba93d4d0c6cd557df43b9 | 1,459 | ads | Ada | tools/scitools/conf/understand/ada/ada12/a-strhas.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | 1 | 2020-01-20T21:26:46.000Z | 2020-01-20T21:26:46.000Z | tools/scitools/conf/understand/ada/ada12/a-strhas.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada12/a-strhas.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- A D A . S T R I N G S . H A S H --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
pragma Compiler_Unit;
with Ada.Containers;
function Ada.Strings.Hash (Key : String) return Containers.Hash_Type;
-- Note: this hash function has predictable collisions and is subject to
-- equivalent substring attacks. It is not suitable for construction of a
-- hash table keyed on possibly malicious user input.
pragma Pure (Ada.Strings.Hash);
| 56.115385 | 78 | 0.378341 |
572aa8aa62b5f3df23ffc888f8544a2c4740cc60 | 8,054 | adb | Ada | Ada95/samples/sample-header_handler.adb | neverware-mirrors/ncurses | 931939e0d2765af13962820e59cb6629df3ee638 | [
"X11"
] | 269 | 2015-03-01T21:34:42.000Z | 2022-03-30T23:07:18.000Z | Ada95/samples/sample-header_handler.adb | neverware-mirrors/ncurses | 931939e0d2765af13962820e59cb6629df3ee638 | [
"X11"
] | 3 | 2020-10-09T15:00:37.000Z | 2020-10-09T15:05:19.000Z | Ada95/samples/sample-header_handler.adb | neverware-mirrors/ncurses | 931939e0d2765af13962820e59cb6629df3ee638 | [
"X11"
] | 97 | 2016-04-25T06:22:54.000Z | 2022-03-30T23:07:19.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding Samples --
-- --
-- Sample.Header_Handler --
-- --
-- B O D Y --
-- --
------------------------------------------------------------------------------
-- Copyright 2020 Thomas E. Dickey --
-- Copyright 1998-2011,2014 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.21 $
-- $Date: 2020/02/02 23:34:34 $
-- Binding Version 01.00
------------------------------------------------------------------------------
with Ada.Calendar; use Ada.Calendar;
with Terminal_Interface.Curses.Text_IO.Integer_IO;
with Sample.Manifest; use Sample.Manifest;
pragma Elaborate_All (Terminal_Interface.Curses.Text_Io.Integer_IO);
-- This package handles the painting of the header line of the screen.
--
package body Sample.Header_Handler is
package Int_IO is new
Terminal_Interface.Curses.Text_IO.Integer_IO (Integer);
use Int_IO;
Header_Window : Window := Null_Window;
Display_Hour : Integer := -1; -- hour last displayed
Display_Min : Integer := -1; -- minute last displayed
Display_Day : Integer := -1; -- day last displayed
Display_Month : Integer := -1; -- month last displayed
-- This is the routine handed over to the curses library to be called
-- as initialization routine when ripping of the header lines from
-- the screen. This routine must follow C conventions.
function Init_Header_Window (Win : Window;
Columns : Column_Count) return Integer;
pragma Convention (C, Init_Header_Window);
procedure Internal_Update_Header_Window (Do_Update : Boolean);
-- The initialization must be called before Init_Screen. It steals two
-- lines from the top of the screen.
procedure Init_Header_Handler
is
begin
Rip_Off_Lines (2, Init_Header_Window'Access);
end Init_Header_Handler;
procedure N_Out (N : Integer);
-- Emit a two digit number and ensure that a leading zero is generated if
-- necessary.
procedure N_Out (N : Integer)
is
begin
if N < 10 then
Add (Header_Window, '0');
Put (Header_Window, N, 1);
else
Put (Header_Window, N, 2);
end if;
end N_Out;
-- Paint the header window. The input parameter is a flag indicating
-- whether or not the screen should be updated physically after painting.
procedure Internal_Update_Header_Window (Do_Update : Boolean)
is
type Month_Name_Array is
array (Month_Number'First .. Month_Number'Last) of String (1 .. 9);
Month_Names : constant Month_Name_Array :=
("January ",
"February ",
"March ",
"April ",
"May ",
"June ",
"July ",
"August ",
"September",
"October ",
"November ",
"December ");
Now : constant Time := Clock;
Sec : constant Integer := Integer (Seconds (Now));
Hour : constant Integer := Sec / 3600;
Minute : constant Integer := (Sec - Hour * 3600) / 60;
Mon : constant Month_Number := Month (Now);
D : constant Day_Number := Day (Now);
begin
if Header_Window /= Null_Window then
if Minute /= Display_Min
or else Hour /= Display_Hour
or else Display_Day /= D
or else Display_Month /= Mon
then
Move_Cursor (Header_Window, 0, 0);
N_Out (D); Add (Header_Window, '.');
Add (Header_Window, Month_Names (Mon));
Move_Cursor (Header_Window, 1, 0);
N_Out (Hour); Add (Header_Window, ':');
N_Out (Minute);
Display_Min := Minute;
Display_Hour := Hour;
Display_Month := Mon;
Display_Day := D;
Refresh_Without_Update (Header_Window);
if Do_Update then
Update_Screen;
end if;
end if;
end if;
end Internal_Update_Header_Window;
-- This routine is called in the keyboard input timeout handler. So it will
-- periodically update the header line of the screen.
procedure Update_Header_Window
is
begin
Internal_Update_Header_Window (True);
end Update_Header_Window;
function Init_Header_Window (Win : Window;
Columns : Column_Count) return Integer
is
Title : constant String := "Ada 95 ncurses Binding Sample";
Pos : Column_Position;
begin
Header_Window := Win;
if Win /= Null_Window then
if Has_Colors then
Set_Background (Win => Win,
Ch => (Ch => ' ',
Color => Header_Color,
Attr => Normal_Video));
Set_Character_Attributes (Win => Win,
Attr => Normal_Video,
Color => Header_Color);
Erase (Win);
end if;
Leave_Cursor_After_Update (Win, True);
Pos := Columns - Column_Position (Title'Length);
Add (Win, 0, Pos / 2, Title);
-- In this phase we must not allow a physical update, because
-- ncurses is not properly initialized at this point.
Internal_Update_Header_Window (False);
return 0;
else
return -1;
end if;
end Init_Header_Window;
end Sample.Header_Handler;
| 43.069519 | 79 | 0.517134 |
29d2d329ae9182f12021d9937f071e4909e74864 | 3,005 | ads | Ada | middleware/src/command_line/command_line-filesystem-cat.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 192 | 2016-06-01T18:32:04.000Z | 2022-03-26T22:52:31.000Z | middleware/src/command_line/command_line-filesystem-cat.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 239 | 2016-05-26T20:02:01.000Z | 2022-03-31T09:46:56.000Z | middleware/src/command_line/command_line-filesystem-cat.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 142 | 2016-06-05T08:12:20.000Z | 2022-03-24T17:37:17.000Z | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2017, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
package Command_Line.Filesystem.Cat is
type Cat_Cmd is new Command with private;
overriding
function Name (This : Cat_Cmd) return String
is ("cat");
overriding
procedure Execute (This : in out Cat_Cmd;
Args : in out Arguments'Class;
Put : Put_Procedure;
Put_Line : Put_Line_Procedure);
overriding
procedure Help (This : in out Cat_Cmd;
Put : Put_Procedure;
Put_Line : Put_Line_Procedure);
private
type Cat_Cmd is new Command with null record;
end Command_Line.Filesystem.Cat;
| 55.648148 | 78 | 0.52213 |
57c75518efaa49c45122802cea6a1d1bbc5a982d | 1,946 | adb | Ada | Source/compiler.adb | bkold/RISC-CPU-Assembler | 4a984ed02e516652f60b3e94eed13208a1b88d59 | [
"MIT"
] | null | null | null | Source/compiler.adb | bkold/RISC-CPU-Assembler | 4a984ed02e516652f60b3e94eed13208a1b88d59 | [
"MIT"
] | null | null | null | Source/compiler.adb | bkold/RISC-CPU-Assembler | 4a984ed02e516652f60b3e94eed13208a1b88d59 | [
"MIT"
] | null | null | null | with Ada.Text_IO;
with Assemble_Functions;
with Ada.Directories;
with GNAT.Command_Line;
with Ada.Strings.Bounded;
use GNAT.Command_Line;
use Ada.Text_IO;
--main function controls reading and writing
--assemble package handles each line
procedure Compiler is
package SB is new Ada.Strings.Bounded.Generic_Bounded_Length(Max => 50);
Mode : Integer := 0;
Source_File : File_Type;
Output_File : File_Type;
Error_Flag : Boolean := True;
Output_File_Name : SB.Bounded_String;
Input_File_Name : SB.Bounded_String;
begin
loop
case Getopt ("a d o:") is
when 'a' =>
if Mode = 0 then
Mode:=2;
else
Put_Line("Conflicting agument : '-a'");
return;
end if;
when 'd' =>
if Mode = 0 then
Mode:=1;
else
Put_Line("Conflicting agument : '-d'");
return;
end if;
when 'o' =>
Output_File_Name := SB.To_Bounded_String(Parameter);
when others =>
exit;
end case;
end loop;
Input_File_Name := SB.To_Bounded_String(Get_Argument);
if SB.Length(Input_File_Name) = 0 then
Put_Line("No file name given");
return;
end if;
--open files
Open(Source_File, In_File, SB.To_String(Input_File_Name));
Create(File=>Output_File, Name=>"~Out.s");
if Mode = 0 or else Mode = 2 then
Error_Flag := Assemble_Functions.Build(Source_File, Output_File);
elsif Mode = 1 then
Put_Line("Disassemble is not supported yet");
end if;
Close(Source_File);
Close(Output_File);
if Error_Flag = False then
if SB.Length(Output_File_Name) > 0 then
if Ada.Directories.Exists(SB.To_String(Output_File_Name)) then
Ada.Directories.Delete_File(SB.To_String(Output_File_Name));
end if;
Ada.Directories.Rename("~Out.s", SB.To_String(Output_File_Name));
else
if Ada.Directories.Exists("Out.s") then
Ada.Directories.Delete_File("Out.s");
end if;
Ada.Directories.Rename("~Out.s", "Out.s");
end if;
else
Ada.Directories.Delete_File("~Out.s");
end if;
end Compiler;
| 24.325 | 73 | 0.697328 |
0b0cb5fa71713baacebac505cab27038ee792b29 | 484 | ads | Ada | cfg/export.ads | boyan-velinov/multiapps-cli-plugin | 1e55d7098fa7b50deebd446f99dc456bee4ceee7 | [
"Apache-2.0"
] | null | null | null | cfg/export.ads | boyan-velinov/multiapps-cli-plugin | 1e55d7098fa7b50deebd446f99dc456bee4ceee7 | [
"Apache-2.0"
] | null | null | null | cfg/export.ads | boyan-velinov/multiapps-cli-plugin | 1e55d7098fa7b50deebd446f99dc456bee4ceee7 | [
"Apache-2.0"
] | null | null | null | artifacts builderVersion:"1.1", {
version "${buildBaseVersion}", {
group "${groupId}", {
artifact "${artifactId}", {
file "${genroot}/out/mta_plugin_linux_amd64", classifier: "linux", extension: "bin"
file "${genroot}/out/mta_plugin_darwin_amd64", classifier: "darwin", extension: "bin"
file "${genroot}/out/mta_plugin_windows_amd64.exe", classifier: "windows", extension: "exe"
}
}
}
}
| 37.230769 | 107 | 0.570248 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.