CombinedText stringlengths 4 3.42M |
|---|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . V E R S I O N _ C O N T R O 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.Unsigned_Types; use System.Unsigned_Types;
package body System.Version_Control is
------------------------
-- Get_Version_String --
------------------------
function Get_Version_String
(V : System.Unsigned_Types.Unsigned)
return Version_String
is
S : Version_String;
D : Unsigned := V;
H : constant array (Unsigned range 0 .. 15) of Character :=
"0123456789abcdef";
begin
for J in reverse 1 .. 8 loop
S (J) := H (D mod 16);
D := D / 16;
end loop;
return S;
end Get_Version_String;
end System.Version_Control;
|
------------------------------------------------------------------------------
-- --
-- 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-2015, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
-- This is a HPUX 11.0 (Native THREADS) version of this package
-- This package encapsulates all direct interfaces to OS services that are
-- needed by the tasking run-time (libgnarl).
-- 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 Ada.Unchecked_Conversion;
with Interfaces.C;
package System.OS_Interface is
pragma Preelaborate;
pragma Linker_Options ("-lpthread");
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;
ETIMEDOUT : constant := 238;
-------------
-- Signals --
-------------
Max_Interrupt : constant := 44;
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
SIGVTALRM : constant := 20; -- virtual timer alarm
SIGPROF : constant := 21; -- profiling timer alarm
SIGIO : constant := 22; -- asynchronous I/O
SIGPOLL : constant := 22; -- pollable event occurred
SIGWINCH : constant := 23; -- window size change
SIGSTOP : constant := 24; -- stop (cannot be caught or ignored)
SIGTSTP : constant := 25; -- user stop requested from tty
SIGCONT : constant := 26; -- stopped process has been continued
SIGTTIN : constant := 27; -- background tty read attempted
SIGTTOU : constant := 28; -- background tty write attempted
SIGURG : constant := 29; -- urgent condition on IO channel
SIGLOST : constant := 30; -- remote lock lost (NFS)
SIGDIL : constant := 32; -- DIL signal
SIGXCPU : constant := 33; -- CPU time limit exceeded (setrlimit)
SIGXFSZ : constant := 34; -- file size limit exceeded (setrlimit)
SIGCANCEL : constant := 35; -- used for pthread cancellation.
SIGGFAULT : constant := 36; -- Graphics framebuffer fault
SIGADAABORT : constant := SIGABRT;
-- Note: on other targets, we usually use SIGABRT, but on HPUX, it
-- appears that SIGABRT can't be used in sigwait(), so we use SIGTERM.
-- Do we use SIGTERM or SIGABRT???
type Signal_Set is array (Natural range <>) of Signal;
Unmasked : constant Signal_Set :=
(SIGABRT, SIGPIPE, SIGBUS, SIGTRAP, SIGTTIN, SIGTTOU, SIGTSTP, SIGPROF,
SIGALRM, SIGVTALRM, SIGIO, SIGCHLD);
Reserved : constant Signal_Set := (SIGKILL, SIGSTOP);
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 struct_sigaction is record
sa_handler : System.Address;
sa_mask : sigset_t;
sa_flags : int;
end record;
pragma Convention (C, struct_sigaction);
type struct_sigaction_ptr is access all struct_sigaction;
SA_SIGINFO : constant := 16#10#;
SA_ONSTACK : constant := 16#01#;
SIG_BLOCK : constant := 0;
SIG_UNBLOCK : constant := 1;
SIG_SETMASK : constant := 2;
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 --
----------
Time_Slice_Supported : constant Boolean := True;
-- Indicates whether time slicing is supported
type timespec is private;
type clockid_t is new int;
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_timezone is record
tz_minuteswest : int;
tz_dsttime : int;
end record;
pragma Convention (C, struct_timezone);
type struct_timezone_ptr is access all struct_timezone;
-------------------------
-- Priority Scheduling --
-------------------------
SCHED_FIFO : constant := 0;
SCHED_RR : constant := 1;
SCHED_OTHER : constant := 2;
function To_Target_Priority
(Prio : System.Any_Priority) return Interfaces.C.int;
-- Maps System.Any_Priority to a POSIX priority
-------------
-- 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");
---------
-- LWP --
---------
function lwp_self return System.Address;
pragma Import (C, lwp_self, "_lwp_self");
-------------
-- Threads --
-------------
type Thread_Body is access
function (arg : System.Address) return System.Address;
pragma Convention (C, Thread_Body);
function Thread_Body_Access is new
Ada.Unchecked_Conversion (System.Address, Thread_Body);
type pthread_t is private;
subtype Thread_Id is pthread_t;
type pthread_mutex_t is limited private;
type pthread_cond_t is limited private;
type pthread_attr_t is limited private;
type pthread_mutexattr_t is limited private;
type pthread_condattr_t is limited private;
type pthread_key_t is private;
PTHREAD_CREATE_DETACHED : constant := 16#de#;
PTHREAD_SCOPE_PROCESS : constant := 2;
PTHREAD_SCOPE_SYSTEM : constant := 1;
-- Read/Write lock not supported on HPUX. To add support both types
-- pthread_rwlock_t and pthread_rwlockattr_t must properly be defined
-- with the associated routines pthread_rwlock_[init/destroy] and
-- pthread_rwlock_[rdlock/wrlock/unlock].
subtype pthread_rwlock_t is pthread_mutex_t;
subtype pthread_rwlockattr_t is pthread_mutexattr_t;
-----------
-- Stack --
-----------
type stack_t is record
ss_sp : System.Address;
ss_flags : int;
ss_size : size_t;
end record;
pragma Convention (C, stack_t);
function sigaltstack
(ss : not null access stack_t;
oss : access stack_t) return int;
pragma Import (C, sigaltstack, "sigaltstack");
Alternate_Stack : aliased System.Address;
pragma Import (C, Alternate_Stack, "__gnat_alternate_stack");
-- The alternate signal stack for stack overflows
Alternate_Stack_Size : constant := 128 * 1024;
-- This must be in keeping with init.c:__gnat_alternate_stack
Stack_Base_Available : constant Boolean := False;
-- Indicates whether the stack base is available on this target
function Get_Stack_Base (thread : pthread_t) return Address;
pragma Inline (Get_Stack_Base);
-- Returns the stack base of the specified thread. Only call this function
-- when Stack_Base_Available is True.
function Get_Page_Size return int;
pragma Import (C, Get_Page_Size, "getpagesize");
-- Returns the size of a page
PROT_NONE : constant := 0;
PROT_READ : constant := 1;
PROT_WRITE : constant := 2;
PROT_EXEC : constant := 4;
PROT_ALL : constant := PROT_READ + PROT_WRITE + PROT_EXEC;
PROT_ON : constant := PROT_READ;
PROT_OFF : constant := PROT_ALL;
function mprotect (addr : Address; len : size_t; prot : int) return int;
pragma Import (C, mprotect);
---------------------------------------
-- Nonstandard Thread Initialization --
---------------------------------------
procedure pthread_init;
pragma Inline (pthread_init);
-- This is a dummy procedure to share some GNULLI files
-------------------------
-- POSIX.1c Section 3 --
-------------------------
function sigwait
(set : access sigset_t;
sig : access Signal) return int;
pragma Import (C, sigwait, "sigwait");
function pthread_kill
(thread : pthread_t;
sig : Signal) return int;
pragma Import (C, pthread_kill, "pthread_kill");
function pthread_sigmask
(how : int;
set : access sigset_t;
oset : access sigset_t) return int;
pragma Import (C, pthread_sigmask, "pthread_sigmask");
--------------------------
-- POSIX.1c Section 11 --
--------------------------
function pthread_mutexattr_init
(attr : access pthread_mutexattr_t) return int;
pragma Import (C, pthread_mutexattr_init, "pthread_mutexattr_init");
function pthread_mutexattr_destroy
(attr : access pthread_mutexattr_t) return int;
pragma Import (C, pthread_mutexattr_destroy, "pthread_mutexattr_destroy");
function pthread_mutex_init
(mutex : access pthread_mutex_t;
attr : access pthread_mutexattr_t) return int;
pragma Import (C, pthread_mutex_init, "pthread_mutex_init");
function pthread_mutex_destroy (mutex : access pthread_mutex_t) return int;
pragma Import (C, pthread_mutex_destroy, "pthread_mutex_destroy");
function pthread_mutex_lock (mutex : access pthread_mutex_t) return int;
pragma Import (C, pthread_mutex_lock, "pthread_mutex_lock");
function pthread_mutex_unlock (mutex : access pthread_mutex_t) return int;
pragma Import (C, pthread_mutex_unlock, "pthread_mutex_unlock");
function pthread_condattr_init
(attr : access pthread_condattr_t) return int;
pragma Import (C, pthread_condattr_init, "pthread_condattr_init");
function pthread_condattr_destroy
(attr : access pthread_condattr_t) return int;
pragma Import (C, pthread_condattr_destroy, "pthread_condattr_destroy");
function pthread_cond_init
(cond : access pthread_cond_t;
attr : access pthread_condattr_t) return int;
pragma Import (C, pthread_cond_init, "pthread_cond_init");
function pthread_cond_destroy (cond : access pthread_cond_t) return int;
pragma Import (C, pthread_cond_destroy, "pthread_cond_destroy");
function pthread_cond_signal (cond : access pthread_cond_t) return int;
pragma Import (C, pthread_cond_signal, "pthread_cond_signal");
function pthread_cond_wait
(cond : access pthread_cond_t;
mutex : access pthread_mutex_t) return int;
pragma Import (C, pthread_cond_wait, "pthread_cond_wait");
function pthread_cond_timedwait
(cond : access pthread_cond_t;
mutex : access pthread_mutex_t;
abstime : access timespec) return int;
pragma Import (C, pthread_cond_timedwait, "pthread_cond_timedwait");
Relative_Timed_Wait : constant Boolean := False;
-- pthread_cond_timedwait requires an absolute delay time
--------------------------
-- POSIX.1c Section 13 --
--------------------------
PTHREAD_PRIO_NONE : constant := 16#100#;
PTHREAD_PRIO_PROTECT : constant := 16#200#;
PTHREAD_PRIO_INHERIT : constant := 16#400#;
function pthread_mutexattr_setprotocol
(attr : access pthread_mutexattr_t;
protocol : int) return int;
pragma Import (C, pthread_mutexattr_setprotocol);
function pthread_mutexattr_setprioceiling
(attr : access pthread_mutexattr_t;
prioceiling : int) return int;
pragma Import (C, pthread_mutexattr_setprioceiling);
type Array_7_Int is array (0 .. 6) of int;
type struct_sched_param is record
sched_priority : int;
sched_reserved : Array_7_Int;
end record;
function pthread_setschedparam
(thread : pthread_t;
policy : int;
param : access struct_sched_param)
return int;
pragma Import (C, pthread_setschedparam, "pthread_setschedparam");
function pthread_attr_setscope
(attr : access pthread_attr_t;
contentionscope : int) return int;
pragma Import (C, pthread_attr_setscope, "pthread_attr_setscope");
function pthread_attr_setinheritsched
(attr : access pthread_attr_t;
inheritsched : int) return int;
pragma Import (C, pthread_attr_setinheritsched);
function pthread_attr_setschedpolicy
(attr : access pthread_attr_t;
policy : int) return int;
pragma Import (C, pthread_attr_setschedpolicy);
function sched_yield return int;
pragma Import (C, sched_yield, "sched_yield");
--------------------------
-- P1003.1c Section 16 --
--------------------------
function pthread_attr_init
(attributes : access pthread_attr_t) return int;
pragma Import (C, pthread_attr_init, "__pthread_attr_init_system");
function pthread_attr_destroy
(attributes : access pthread_attr_t) return int;
pragma Import (C, pthread_attr_destroy, "pthread_attr_destroy");
function pthread_attr_setdetachstate
(attr : access pthread_attr_t;
detachstate : int) return int;
pragma Import (C, pthread_attr_setdetachstate);
function pthread_attr_setstacksize
(attr : access pthread_attr_t;
stacksize : size_t) return int;
pragma Import (C, pthread_attr_setstacksize, "pthread_attr_setstacksize");
function pthread_create
(thread : access pthread_t;
attributes : access pthread_attr_t;
start_routine : Thread_Body;
arg : System.Address) return int;
pragma Import (C, pthread_create, "__pthread_create_system");
procedure pthread_exit (status : System.Address);
pragma Import (C, pthread_exit, "pthread_exit");
function pthread_self return pthread_t;
pragma Import (C, pthread_self, "pthread_self");
--------------------------
-- POSIX.1c Section 17 --
--------------------------
function pthread_setspecific
(key : pthread_key_t;
value : System.Address) return int;
pragma Import (C, pthread_setspecific, "pthread_setspecific");
function pthread_getspecific (key : pthread_key_t) return System.Address;
pragma Import (C, pthread_getspecific, "pthread_getspecific");
type destructor_pointer is access procedure (arg : System.Address);
pragma Convention (C, destructor_pointer);
function pthread_key_create
(key : access pthread_key_t;
destructor : destructor_pointer) return int;
pragma Import (C, pthread_key_create, "pthread_key_create");
private
type unsigned_int_array_8 is array (0 .. 7) of unsigned;
type sigset_t is record
sigset : unsigned_int_array_8;
end record;
pragma Convention (C_Pass_By_Copy, sigset_t);
type pid_t is new int;
type time_t is new long;
type timespec is record
tv_sec : time_t;
tv_nsec : long;
end record;
pragma Convention (C, timespec);
type pthread_attr_t is new int;
type pthread_condattr_t is new int;
type pthread_mutexattr_t is new int;
type pthread_t is new int;
type short_array is array (Natural range <>) of short;
type int_array is array (Natural range <>) of int;
type pthread_mutex_t is record
m_short : short_array (0 .. 1);
m_int : int;
m_int1 : int_array (0 .. 3);
m_pad : int;
m_ptr : int;
-- actually m_ptr is a void*, and on 32 bit ABI, m_pad is added so that
-- this field takes 64 bits. On 64 bit ABI, m_pad is gone, and m_ptr is
-- a 64 bit void*. Assume int'Size = 32.
m_int2 : int_array (0 .. 1);
m_int3 : int_array (0 .. 3);
m_short2 : short_array (0 .. 1);
m_int4 : int_array (0 .. 4);
m_int5 : int_array (0 .. 1);
end record;
for pthread_mutex_t'Alignment use System.Address'Alignment;
pragma Convention (C, pthread_mutex_t);
type pthread_cond_t is record
c_short : short_array (0 .. 1);
c_int : int;
c_int1 : int_array (0 .. 3);
m_pad : int;
m_ptr : int; -- see comment in pthread_mutex_t
c_int2 : int_array (0 .. 1);
c_int3 : int_array (0 .. 1);
c_int4 : int_array (0 .. 1);
end record;
for pthread_cond_t'Alignment use System.Address'Alignment;
pragma Convention (C, pthread_cond_t);
type pthread_key_t is new int;
end System.OS_Interface;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T . A L T I V E C . L O W _ L E V E L _ I N T E R F A C E --
-- --
-- S p e c --
-- --
-- Copyright (C) 2004-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 unit provides entities to be used internally by the units common to
-- both bindings (Hard or Soft), and relevant to the interfacing with the
-- underlying Low Level support.
with GNAT.Altivec.Vector_Types; use GNAT.Altivec.Vector_Types;
with GNAT.Altivec.Low_Level_Vectors; use GNAT.Altivec.Low_Level_Vectors;
with Ada.Unchecked_Conversion;
package GNAT.Altivec.Low_Level_Interface is
-----------------------------------------
-- Conversions between low level types --
-----------------------------------------
function To_LL_VBC is new Ada.Unchecked_Conversion (LL_VBC, LL_VBC);
function To_LL_VBC is new Ada.Unchecked_Conversion (LL_VUC, LL_VBC);
function To_LL_VBC is new Ada.Unchecked_Conversion (LL_VSC, LL_VBC);
function To_LL_VBC is new Ada.Unchecked_Conversion (LL_VBS, LL_VBC);
function To_LL_VBC is new Ada.Unchecked_Conversion (LL_VUS, LL_VBC);
function To_LL_VBC is new Ada.Unchecked_Conversion (LL_VSS, LL_VBC);
function To_LL_VBC is new Ada.Unchecked_Conversion (LL_VBI, LL_VBC);
function To_LL_VBC is new Ada.Unchecked_Conversion (LL_VUI, LL_VBC);
function To_LL_VBC is new Ada.Unchecked_Conversion (LL_VSI, LL_VBC);
function To_LL_VBC is new Ada.Unchecked_Conversion (LL_VF, LL_VBC);
function To_LL_VBC is new Ada.Unchecked_Conversion (LL_VP, LL_VBC);
function To_LL_VUC is new Ada.Unchecked_Conversion (LL_VBC, LL_VUC);
function To_LL_VUC is new Ada.Unchecked_Conversion (LL_VUC, LL_VUC);
function To_LL_VUC is new Ada.Unchecked_Conversion (LL_VSC, LL_VUC);
function To_LL_VUC is new Ada.Unchecked_Conversion (LL_VBS, LL_VUC);
function To_LL_VUC is new Ada.Unchecked_Conversion (LL_VUS, LL_VUC);
function To_LL_VUC is new Ada.Unchecked_Conversion (LL_VSS, LL_VUC);
function To_LL_VUC is new Ada.Unchecked_Conversion (LL_VBI, LL_VUC);
function To_LL_VUC is new Ada.Unchecked_Conversion (LL_VUI, LL_VUC);
function To_LL_VUC is new Ada.Unchecked_Conversion (LL_VSI, LL_VUC);
function To_LL_VUC is new Ada.Unchecked_Conversion (LL_VF, LL_VUC);
function To_LL_VUC is new Ada.Unchecked_Conversion (LL_VP, LL_VUC);
function To_LL_VSC is new Ada.Unchecked_Conversion (LL_VBC, LL_VSC);
function To_LL_VSC is new Ada.Unchecked_Conversion (LL_VUC, LL_VSC);
function To_LL_VSC is new Ada.Unchecked_Conversion (LL_VSC, LL_VSC);
function To_LL_VSC is new Ada.Unchecked_Conversion (LL_VBS, LL_VSC);
function To_LL_VSC is new Ada.Unchecked_Conversion (LL_VUS, LL_VSC);
function To_LL_VSC is new Ada.Unchecked_Conversion (LL_VSS, LL_VSC);
function To_LL_VSC is new Ada.Unchecked_Conversion (LL_VBI, LL_VSC);
function To_LL_VSC is new Ada.Unchecked_Conversion (LL_VUI, LL_VSC);
function To_LL_VSC is new Ada.Unchecked_Conversion (LL_VSI, LL_VSC);
function To_LL_VSC is new Ada.Unchecked_Conversion (LL_VF, LL_VSC);
function To_LL_VSC is new Ada.Unchecked_Conversion (LL_VP, LL_VSC);
function To_LL_VBS is new Ada.Unchecked_Conversion (LL_VBC, LL_VBS);
function To_LL_VBS is new Ada.Unchecked_Conversion (LL_VUC, LL_VBS);
function To_LL_VBS is new Ada.Unchecked_Conversion (LL_VSC, LL_VBS);
function To_LL_VBS is new Ada.Unchecked_Conversion (LL_VBS, LL_VBS);
function To_LL_VBS is new Ada.Unchecked_Conversion (LL_VUS, LL_VBS);
function To_LL_VBS is new Ada.Unchecked_Conversion (LL_VSS, LL_VBS);
function To_LL_VBS is new Ada.Unchecked_Conversion (LL_VBI, LL_VBS);
function To_LL_VBS is new Ada.Unchecked_Conversion (LL_VUI, LL_VBS);
function To_LL_VBS is new Ada.Unchecked_Conversion (LL_VSI, LL_VBS);
function To_LL_VBS is new Ada.Unchecked_Conversion (LL_VF, LL_VBS);
function To_LL_VBS is new Ada.Unchecked_Conversion (LL_VP, LL_VBS);
function To_LL_VUS is new Ada.Unchecked_Conversion (LL_VBC, LL_VUS);
function To_LL_VUS is new Ada.Unchecked_Conversion (LL_VUC, LL_VUS);
function To_LL_VUS is new Ada.Unchecked_Conversion (LL_VSC, LL_VUS);
function To_LL_VUS is new Ada.Unchecked_Conversion (LL_VBS, LL_VUS);
function To_LL_VUS is new Ada.Unchecked_Conversion (LL_VUS, LL_VUS);
function To_LL_VUS is new Ada.Unchecked_Conversion (LL_VSS, LL_VUS);
function To_LL_VUS is new Ada.Unchecked_Conversion (LL_VBI, LL_VUS);
function To_LL_VUS is new Ada.Unchecked_Conversion (LL_VUI, LL_VUS);
function To_LL_VUS is new Ada.Unchecked_Conversion (LL_VSI, LL_VUS);
function To_LL_VUS is new Ada.Unchecked_Conversion (LL_VF, LL_VUS);
function To_LL_VUS is new Ada.Unchecked_Conversion (LL_VP, LL_VUS);
function To_LL_VSS is new Ada.Unchecked_Conversion (LL_VBC, LL_VSS);
function To_LL_VSS is new Ada.Unchecked_Conversion (LL_VUC, LL_VSS);
function To_LL_VSS is new Ada.Unchecked_Conversion (LL_VSC, LL_VSS);
function To_LL_VSS is new Ada.Unchecked_Conversion (LL_VBS, LL_VSS);
function To_LL_VSS is new Ada.Unchecked_Conversion (LL_VUS, LL_VSS);
function To_LL_VSS is new Ada.Unchecked_Conversion (LL_VSS, LL_VSS);
function To_LL_VSS is new Ada.Unchecked_Conversion (LL_VBI, LL_VSS);
function To_LL_VSS is new Ada.Unchecked_Conversion (LL_VUI, LL_VSS);
function To_LL_VSS is new Ada.Unchecked_Conversion (LL_VSI, LL_VSS);
function To_LL_VSS is new Ada.Unchecked_Conversion (LL_VF, LL_VSS);
function To_LL_VSS is new Ada.Unchecked_Conversion (LL_VP, LL_VSS);
function To_LL_VBI is new Ada.Unchecked_Conversion (LL_VBC, LL_VBI);
function To_LL_VBI is new Ada.Unchecked_Conversion (LL_VUC, LL_VBI);
function To_LL_VBI is new Ada.Unchecked_Conversion (LL_VSC, LL_VBI);
function To_LL_VBI is new Ada.Unchecked_Conversion (LL_VBS, LL_VBI);
function To_LL_VBI is new Ada.Unchecked_Conversion (LL_VUS, LL_VBI);
function To_LL_VBI is new Ada.Unchecked_Conversion (LL_VSS, LL_VBI);
function To_LL_VBI is new Ada.Unchecked_Conversion (LL_VBI, LL_VBI);
function To_LL_VBI is new Ada.Unchecked_Conversion (LL_VUI, LL_VBI);
function To_LL_VBI is new Ada.Unchecked_Conversion (LL_VSI, LL_VBI);
function To_LL_VBI is new Ada.Unchecked_Conversion (LL_VF, LL_VBI);
function To_LL_VBI is new Ada.Unchecked_Conversion (LL_VP, LL_VBI);
function To_LL_VUI is new Ada.Unchecked_Conversion (LL_VBC, LL_VUI);
function To_LL_VUI is new Ada.Unchecked_Conversion (LL_VUC, LL_VUI);
function To_LL_VUI is new Ada.Unchecked_Conversion (LL_VSC, LL_VUI);
function To_LL_VUI is new Ada.Unchecked_Conversion (LL_VBS, LL_VUI);
function To_LL_VUI is new Ada.Unchecked_Conversion (LL_VUS, LL_VUI);
function To_LL_VUI is new Ada.Unchecked_Conversion (LL_VSS, LL_VUI);
function To_LL_VUI is new Ada.Unchecked_Conversion (LL_VBI, LL_VUI);
function To_LL_VUI is new Ada.Unchecked_Conversion (LL_VUI, LL_VUI);
function To_LL_VUI is new Ada.Unchecked_Conversion (LL_VSI, LL_VUI);
function To_LL_VUI is new Ada.Unchecked_Conversion (LL_VF, LL_VUI);
function To_LL_VUI is new Ada.Unchecked_Conversion (LL_VP, LL_VUI);
function To_LL_VSI is new Ada.Unchecked_Conversion (LL_VBC, LL_VSI);
function To_LL_VSI is new Ada.Unchecked_Conversion (LL_VUC, LL_VSI);
function To_LL_VSI is new Ada.Unchecked_Conversion (LL_VSC, LL_VSI);
function To_LL_VSI is new Ada.Unchecked_Conversion (LL_VBS, LL_VSI);
function To_LL_VSI is new Ada.Unchecked_Conversion (LL_VUS, LL_VSI);
function To_LL_VSI is new Ada.Unchecked_Conversion (LL_VSS, LL_VSI);
function To_LL_VSI is new Ada.Unchecked_Conversion (LL_VBI, LL_VSI);
function To_LL_VSI is new Ada.Unchecked_Conversion (LL_VUI, LL_VSI);
function To_LL_VSI is new Ada.Unchecked_Conversion (LL_VSI, LL_VSI);
function To_LL_VSI is new Ada.Unchecked_Conversion (LL_VF, LL_VSI);
function To_LL_VSI is new Ada.Unchecked_Conversion (LL_VP, LL_VSI);
function To_LL_VF is new Ada.Unchecked_Conversion (LL_VBC, LL_VF);
function To_LL_VF is new Ada.Unchecked_Conversion (LL_VUC, LL_VF);
function To_LL_VF is new Ada.Unchecked_Conversion (LL_VSC, LL_VF);
function To_LL_VF is new Ada.Unchecked_Conversion (LL_VBS, LL_VF);
function To_LL_VF is new Ada.Unchecked_Conversion (LL_VUS, LL_VF);
function To_LL_VF is new Ada.Unchecked_Conversion (LL_VSS, LL_VF);
function To_LL_VF is new Ada.Unchecked_Conversion (LL_VBI, LL_VF);
function To_LL_VF is new Ada.Unchecked_Conversion (LL_VUI, LL_VF);
function To_LL_VF is new Ada.Unchecked_Conversion (LL_VSI, LL_VF);
function To_LL_VF is new Ada.Unchecked_Conversion (LL_VF, LL_VF);
function To_LL_VF is new Ada.Unchecked_Conversion (LL_VP, LL_VF);
function To_LL_VP is new Ada.Unchecked_Conversion (LL_VBC, LL_VP);
function To_LL_VP is new Ada.Unchecked_Conversion (LL_VUC, LL_VP);
function To_LL_VP is new Ada.Unchecked_Conversion (LL_VSC, LL_VP);
function To_LL_VP is new Ada.Unchecked_Conversion (LL_VBS, LL_VP);
function To_LL_VP is new Ada.Unchecked_Conversion (LL_VUS, LL_VP);
function To_LL_VP is new Ada.Unchecked_Conversion (LL_VSS, LL_VP);
function To_LL_VP is new Ada.Unchecked_Conversion (LL_VBI, LL_VP);
function To_LL_VP is new Ada.Unchecked_Conversion (LL_VUI, LL_VP);
function To_LL_VP is new Ada.Unchecked_Conversion (LL_VSI, LL_VP);
function To_LL_VP is new Ada.Unchecked_Conversion (LL_VF, LL_VP);
function To_LL_VP is new Ada.Unchecked_Conversion (LL_VP, LL_VP);
----------------------------------------------
-- Conversions Between Pointer/Access Types --
----------------------------------------------
function To_PTR is
new Ada.Unchecked_Conversion (vector_unsigned_char_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (vector_signed_char_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (vector_bool_char_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (vector_unsigned_short_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (vector_signed_short_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (vector_bool_short_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (vector_unsigned_int_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (vector_signed_int_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (vector_bool_int_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (vector_float_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (vector_pixel_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (const_vector_bool_char_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (const_vector_signed_char_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (const_vector_unsigned_char_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (const_vector_bool_short_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (const_vector_signed_short_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (const_vector_unsigned_short_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (const_vector_bool_int_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (const_vector_signed_int_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (const_vector_unsigned_int_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (const_vector_float_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (const_vector_pixel_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (c_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (signed_char_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (unsigned_char_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (short_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (signed_short_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (unsigned_short_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (int_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (signed_int_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (unsigned_int_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (long_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (signed_long_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (unsigned_long_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (float_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (const_signed_char_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (const_unsigned_char_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (const_short_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (const_signed_short_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (const_unsigned_short_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (const_int_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (const_signed_int_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (const_unsigned_int_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (const_long_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (const_signed_long_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (const_unsigned_long_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (const_float_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (constv_char_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (constv_signed_char_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (constv_unsigned_char_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (constv_short_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (constv_signed_short_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (constv_unsigned_short_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (constv_int_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (constv_signed_int_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (constv_unsigned_int_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (constv_long_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (constv_signed_long_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (constv_unsigned_long_ptr, c_ptr);
function To_PTR is
new Ada.Unchecked_Conversion (constv_float_ptr, c_ptr);
end GNAT.Altivec.Low_Level_Interface;
|
package body Subtractive_Generator is
procedure Initialize (Generator : in out State; Seed : Natural) is
S : Number_Array (0 .. 1);
I : Natural := 0;
J : Natural := 1;
begin
S (0) := Seed;
S (1) := 1;
Generator.R (54) := S (0);
Generator.R (33) := S (1);
for N in 2 .. Generator.R'Last loop
S (I) := (S (I) - S (J)) mod 10 ** 9;
Generator.R ((34 * N - 1) mod 55) := S (I);
I := (I + 1) mod 2;
J := (J + 1) mod 2;
end loop;
Generator.Last := 54;
for I in 1 .. 165 loop
Subtractive_Generator.Next (Generator => Generator, N => J);
end loop;
end Initialize;
procedure Next (Generator : in out State; N : out Natural) is
begin
Generator.Last := (Generator.Last + 1) mod 55;
Generator.R (Generator.Last) :=
(Generator.R (Generator.Last)
- Generator.R ((Generator.Last - 24) mod 55)) mod 10 ** 9;
N := Generator.R (Generator.Last);
end Next;
end Subtractive_Generator;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . I M G _ L L U --
-- --
-- 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 routines for supporting the Image attribute for
-- unsigned (modular) integer types larger than Size Unsigned'Size, and also
-- for conversion operations required in Text_IO.Modular_IO for such types.
with System.Unsigned_Types;
package System.Img_LLU is
pragma Pure;
function Image_Long_Long_Unsigned
(V : System.Unsigned_Types.Long_Long_Unsigned)
return String;
-- Computes Long_Long_Unsigned'Image (V) and returns the result.
procedure Set_Image_Long_Long_Unsigned
(V : System.Unsigned_Types.Long_Long_Unsigned;
S : out String;
P : in out Natural);
-- Sets the image of V starting at S (P + 1) with no leading spaces (i.e.
-- Text_IO format where Width = 0), starting at S (P + 1), updating P
-- to point to the last character stored. The caller promises that the
-- buffer is large enough and no check is made for this (Constraint_Error
-- will not be necessarily raised if this is violated since it is perfectly
-- valid to compile this unit with checks off).
end System.Img_LLU;
|
------------------------------------------------------------------------------
-- --
-- GNU ADA RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . O S _ P R I M I T I V E S --
-- --
-- S p e c --
-- --
-- $Revision$
-- --
-- Copyright (C) 1998-2001 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, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package provides low level primitives used to implement clock and
-- delays in non tasking applications on Alpha/VMS
-- The choice of the real clock/delay implementation (depending on whether
-- tasking is involved or not) is done via soft links (see s-tasoli.ads)
-- NEVER add any dependency to tasking packages here
package System.OS_Primitives is
subtype OS_Time is Long_Integer;
-- System time on VMS is used for performance reasons.
-- Note that OS_Time is *not* the same as Ada.Calendar.Time, the
-- difference being that relative OS_Time is negative, but relative
-- Calendar.Time is positive.
-- See Ada.Calendar.Delays for more information on VMS Time.
Max_Sensible_Delay : constant Duration := 183 * 24 * 60 * 60.0;
-- Max of half a year delay, needed to prevent exceptions for large
-- delay values. It seems unlikely that any test will notice this
-- restriction, except in the case of applications setting the clock at
-- at run time (see s-tastim.adb). Also note that a larger value might
-- cause problems (e.g overflow, or more likely OS limitation in the
-- primitives used).
function OS_Clock return OS_Time;
-- Returns "absolute" time, represented as an offset
-- relative to "the Epoch", which is Nov 17, 1858 on VMS.
function Clock return Duration;
pragma Inline (Clock);
-- Returns "absolute" time, represented as an offset
-- relative to "the Epoch", which is Jan 1, 1970 on unixes.
-- This implementation is affected by system's clock changes.
function Monotonic_Clock return Duration;
pragma Inline (Monotonic_Clock);
-- Returns "absolute" time, represented as an offset
-- relative to "the Epoch", which is Jan 1, 1970.
-- This clock implementation is immune to the system's clock changes.
Relative : constant := 0;
Absolute_Calendar : constant := 1;
Absolute_RT : constant := 2;
-- Values for Mode call below. Note that the compiler (exp_ch9.adb)
-- relies on these values. So any change here must be reflected in
-- corresponding changes in the compiler.
procedure Timed_Delay (Time : Duration; Mode : Integer);
-- Implements the semantics of the delay statement when no tasking is
-- used in the application.
--
-- Mode is one of the three values above
--
-- Time is a relative or absolute duration value, depending on Mode.
--
-- Note that currently Ada.Real_Time always uses the tasking run time, so
-- this procedure should never be called with Mode set to Absolute_RT.
-- This may change in future or bare board implementations.
function To_Duration (T : OS_Time; Mode : Integer) return Duration;
-- Convert VMS system time to Duration
-- Mode is one of the three values above
function To_OS_Time (D : Duration; Mode : Integer) return OS_Time;
-- Convert Duration to VMS system time
-- Mode is one of the three values above
end System.OS_Primitives;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUNTIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 4 7 --
-- --
-- S p e c --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-1999 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-4707, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Handling of packed arrays with Component_Size = 47
package System.Pack_47 is
pragma Preelaborate (Pack_47);
Bits : constant := 47;
type Bits_47 is mod 2 ** Bits;
for Bits_47'Size use Bits;
function Get_47 (Arr : System.Address; N : Natural) return Bits_47;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned.
procedure Set_47 (Arr : System.Address; N : Natural; E : Bits_47);
-- 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_47;
|
--
-- Copyright (C) 2017, AdaCore
--
-- This spec has been automatically generated from STM32F7x9.svd
-- This is a version for the STM32F7x9 MCU
package Ada.Interrupts.Names is
-- All identifiers in this unit are implementation defined
pragma Implementation_Defined;
----------------
-- Interrupts --
----------------
-- System tick
Sys_Tick_Interrupt : constant Interrupt_ID := -1;
-- Window Watchdog interrupt
WWDG_Interrupt : constant Interrupt_ID := 0;
-- Tamper and TimeStamp interrupts through the EXTI line
TAMP_STAMP_Interrupt : constant Interrupt_ID := 2;
-- RTC Tamper or TimeStamp /CSS on LSE through EXTI line 19 interrupts
RTC_WKUP_Interrupt : constant Interrupt_ID := 3;
-- Flash global interrupt
FLASH_Interrupt : constant Interrupt_ID := 4;
-- RCC global interrupt
RCC_Interrupt : constant Interrupt_ID := 5;
-- EXTI Line0 interrupt
EXTI0_Interrupt : constant Interrupt_ID := 6;
-- EXTI Line1 interrupt
EXTI1_Interrupt : constant Interrupt_ID := 7;
-- EXTI Line2 interrupt
EXTI2_Interrupt : constant Interrupt_ID := 8;
-- EXTI Line3 interrupt
EXTI3_Interrupt : constant Interrupt_ID := 9;
-- EXTI Line4 interrupt
EXTI4_Interrupt : constant Interrupt_ID := 10;
-- DMA1 Stream0 global interrupt
DMA1_Stream0_Interrupt : constant Interrupt_ID := 11;
-- DMA1 Stream1 global interrupt
DMA1_Stream1_Interrupt : constant Interrupt_ID := 12;
-- DMA1 Stream2 global interrupt
DMA1_Stream2_Interrupt : constant Interrupt_ID := 13;
-- DMA1 Stream3 global interrupt
DMA1_Stream3_Interrupt : constant Interrupt_ID := 14;
-- DMA1 Stream4 global interrupt
DMA1_Stream4_Interrupt : constant Interrupt_ID := 15;
-- DMA1 Stream5 global interrupt
DMA1_Stream5_Interrupt : constant Interrupt_ID := 16;
-- DMA1 Stream6 global interrupt
DMA1_Stream6_Interrupt : constant Interrupt_ID := 17;
-- ADC1 global interrupt
ADC_Interrupt : constant Interrupt_ID := 18;
-- CAN1 TX interrupts
CAN1_TX_Interrupt : constant Interrupt_ID := 19;
-- CAN1 RX0 interrupts
CAN1_RX0_Interrupt : constant Interrupt_ID := 20;
-- CAN1 RX1 interrupts
CAN1_RX1_Interrupt : constant Interrupt_ID := 21;
-- CAN1 SCE interrupt
CAN1_SCE_Interrupt : constant Interrupt_ID := 22;
-- EXTI Line[9:5] interrupts
EXTI9_5_Interrupt : constant Interrupt_ID := 23;
-- TIM1 Break interrupt and TIM9 global interrupt
TIM1_BRK_TIM9_Interrupt : constant Interrupt_ID := 24;
-- TIM1 Update interrupt and TIM10 global interrupt
TIM1_UP_TIM10_Interrupt : constant Interrupt_ID := 25;
-- TIM1 Trigger and Commutation interrupts and TIM11 global interrupt
TIM1_TRG_COM_TIM11_Interrupt : constant Interrupt_ID := 26;
-- TIM1 Capture Compare interrupt
TIM1_CC_Interrupt : constant Interrupt_ID := 27;
-- TIM2 global interrupt
TIM2_Interrupt : constant Interrupt_ID := 28;
-- TIM3 global interrupt
TIM3_Interrupt : constant Interrupt_ID := 29;
-- TIM4 global interrupt
TIM4_Interrupt : constant Interrupt_ID := 30;
-- I2C1 event interrupt
I2C1_EV_Interrupt : constant Interrupt_ID := 31;
-- I2C1 error interrupt
I2C1_ER_Interrupt : constant Interrupt_ID := 32;
-- I2C2 event interrupt
I2C2_EV_Interrupt : constant Interrupt_ID := 33;
-- I2C2 error interrupt
I2C2_ER_Interrupt : constant Interrupt_ID := 34;
-- SPI1 global interrupt
SPI1_Interrupt : constant Interrupt_ID := 35;
-- SPI2 global interrupt
SPI2_Interrupt : constant Interrupt_ID := 36;
-- USART1 global interrupt
USART1_Interrupt : constant Interrupt_ID := 37;
-- USART2 global interrupt
USART2_Interrupt : constant Interrupt_ID := 38;
-- USART3 global interrupt
USART3_Interrupt : constant Interrupt_ID := 39;
-- EXTI Line[15:10] interrupts
EXTI15_10_Interrupt : constant Interrupt_ID := 40;
-- RTC alarms through EXTI line 18 interrupts
RTC_ALARM_Interrupt : constant Interrupt_ID := 41;
-- USB On-The-Go FS Wakeup through EXTI line interrupt
OTG_FS_WKUP_Interrupt : constant Interrupt_ID := 42;
-- TIM8 Break interrupt and TIM12 global interrupt
TIM8_BRK_TIM12_Interrupt : constant Interrupt_ID := 43;
-- TIM8 Update interrupt and TIM13 global interrupt
TIM8_UP_TIM13_Interrupt : constant Interrupt_ID := 44;
-- TIM8 Trigger and Commutation interrupts and TIM14 global interrupt
TIM8_TRG_COM_TIM14_Interrupt : constant Interrupt_ID := 45;
-- TIM8 Capture Compare interrupt
TIM8_CC_Interrupt : constant Interrupt_ID := 46;
-- DMA1 Stream7 global interrupt
DMA1_Stream7_Interrupt : constant Interrupt_ID := 47;
-- FMC global interrupt
FMC_Interrupt : constant Interrupt_ID := 48;
-- SDMMC1 global interrupt
SDMMC1_Interrupt : constant Interrupt_ID := 49;
-- TIM5 global interrupt
TIM5_Interrupt : constant Interrupt_ID := 50;
-- SPI3 global interrupt
SPI3_Interrupt : constant Interrupt_ID := 51;
-- UART4 global interrupt
UART4_Interrupt : constant Interrupt_ID := 52;
-- UART5 global interrupt
UART5_Interrupt : constant Interrupt_ID := 53;
-- TIM6 global interrupt, DAC1 and DAC2 underrun error interrupt
TIM6_DAC_Interrupt : constant Interrupt_ID := 54;
-- TIM7 global interrupt
TIM7_Interrupt : constant Interrupt_ID := 55;
-- DMA2 Stream0 global interrupt
DMA2_Stream0_Interrupt : constant Interrupt_ID := 56;
-- DMA2 Stream1 global interrupt
DMA2_Stream1_Interrupt : constant Interrupt_ID := 57;
-- DMA2 Stream2 global interrupt
DMA2_Stream2_Interrupt : constant Interrupt_ID := 58;
-- DMA2 Stream3 global interrupt
DMA2_Stream3_Interrupt : constant Interrupt_ID := 59;
-- DMA2 Stream4 global interrupt
DMA2_Stream4_Interrupt : constant Interrupt_ID := 60;
-- Ethernet global interrupt
ETH_Interrupt : constant Interrupt_ID := 61;
-- Ethernet global interrupt
ETH_WKUP_Interrupt : constant Interrupt_ID := 62;
-- CAN2 TX interrupts
CAN2_TX_Interrupt : constant Interrupt_ID := 63;
-- CAN2 RX0 interrupts
CAN2_RX0_Interrupt : constant Interrupt_ID := 64;
-- CAN2 RX1 interrupts
CAN2_RX1_Interrupt : constant Interrupt_ID := 65;
-- CAN2 SCE interrupt
CAN2_SCE_Interrupt : constant Interrupt_ID := 66;
-- USB On The Go FS global interrupt
OTG_FS_Interrupt : constant Interrupt_ID := 67;
-- DMA2 Stream5 global interrupt
DMA2_Stream5_Interrupt : constant Interrupt_ID := 68;
-- DMA2 Stream6 global interrupt
DMA2_Stream6_Interrupt : constant Interrupt_ID := 69;
-- DMA2 Stream7 global interrupt
DMA2_Stream7_Interrupt : constant Interrupt_ID := 70;
-- USART6 global interrupt
USART6_Interrupt : constant Interrupt_ID := 71;
-- I2C3 event interrupt
I2C3_EV_Interrupt : constant Interrupt_ID := 72;
-- I2C3 error interrupt
I2C3_ER_Interrupt : constant Interrupt_ID := 73;
-- USB On The Go HS End Point 1 Out global interrupt
OTG_HS_EP1_OUT_Interrupt : constant Interrupt_ID := 74;
-- USB On The Go HS End Point 1 In global interrupt
OTG_HS_EP1_IN_Interrupt : constant Interrupt_ID := 75;
-- USB On The Go HS Wakeup through EXTI interrupt
OTG_HS_WKUP_Interrupt : constant Interrupt_ID := 76;
-- USB On The Go HS global interrupt
OTG_HS_Interrupt : constant Interrupt_ID := 77;
-- DCMI global interrupt
DCMI_Interrupt : constant Interrupt_ID := 78;
-- Hash and Rng global interrupt
HASH_RNG_Interrupt : constant Interrupt_ID := 80;
-- FPU global interrupt
FPU_Interrupt : constant Interrupt_ID := 81;
-- UART7 global interrupt
UART7_Interrupt : constant Interrupt_ID := 82;
-- UART 8 global interrupt
UART8_Interrupt : constant Interrupt_ID := 83;
-- SPI 4 global interrupt
SPI4_Interrupt : constant Interrupt_ID := 84;
-- SPI 5 global interrupt
SPI5_Interrupt : constant Interrupt_ID := 85;
-- SPI 6 global interrupt
SPI6_Interrupt : constant Interrupt_ID := 86;
-- SAI1 global interrupt
SAI1_Interrupt : constant Interrupt_ID := 87;
-- LTDC global interrupt
LTDC_Interrupt : constant Interrupt_ID := 88;
-- LTDC Error global interrupt
LTDC_ER_Interrupt : constant Interrupt_ID := 89;
-- DMA2D global interrupt
DMA2D_Interrupt : constant Interrupt_ID := 90;
-- SAI2 global interrupt
SAI2_Interrupt : constant Interrupt_ID := 91;
-- QUADSPI global interrupt
QUADSPI_Interrupt : constant Interrupt_ID := 92;
-- LPTIM1 global interrupt
LPTIM1_Interrupt : constant Interrupt_ID := 93;
-- CEC global interrupt
CEC_Interrupt : constant Interrupt_ID := 94;
-- I2C4 event interrupt
I2C4_EV_Interrupt : constant Interrupt_ID := 95;
-- I2C4 error interrupt
I2C4_ER_Interrupt : constant Interrupt_ID := 96;
-- SPDIF_RX global interrupt
SPDIF_RX_Interrupt : constant Interrupt_ID := 97;
-- DSI global interrupt
DSI_Interrupt : constant Interrupt_ID := 98;
-- DFSDM1 Filter 0 global interrupt
DFSDM1_FLT0_Interrupt : constant Interrupt_ID := 99;
-- DFSDM1 Filter 1 global interrupt
DFSDM1_FLT1_Interrupt : constant Interrupt_ID := 100;
-- DFSDM1 Filter 2 global interrupt
DFSDM1_FLT2_Interrupt : constant Interrupt_ID := 101;
-- DFSDM1 Filter 3 global interrupt
DFSDM1_FLT3_Interrupt : constant Interrupt_ID := 102;
-- SDMMC2 global interrupt
SDMMC2_Interrupt : constant Interrupt_ID := 103;
-- CAN3 TX interrupt
CAN3_TX_Interrupt : constant Interrupt_ID := 104;
-- CAN3 RX0 interrupt
CAN3_RX0_Interrupt : constant Interrupt_ID := 105;
-- CAN3 RX1 interrupt
CAN3_RX1_Interrupt : constant Interrupt_ID := 106;
-- CAN3 SCE interrupt
CAN3_SCE_Interrupt : constant Interrupt_ID := 107;
-- JPEG global interrupt
JPEG_Interrupt : constant Interrupt_ID := 108;
-- MDIO slave global interrupt
MDIOS_Interrupt : constant Interrupt_ID := 109;
end Ada.Interrupts.Names;
|
-----------------------------------------------------------------------
-- Ada Labs --
-- --
-- Copyright (C) 2008-2009, AdaCore --
-- --
-- Labs is free software; you can redistribute it and/or modify it --
-- under the terms of the GNU General Public License as published by --
-- the Free Software Foundation; either version 2 of the License, or --
-- (at your option) any later version. --
-- --
-- This program is distributed in the hope that it will be useful, --
-- but WITHOUT ANY WARRANTY; without even the implied warranty of --
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU --
-- General Public License for more details. You should have received --
-- a copy of the GNU General Public License along with this program; --
-- if not, write to the Free Software Foundation, Inc., 59 Temple --
-- Place - Suite 330, Boston, MA 02111-1307, USA. --
-----------------------------------------------------------------------
with Libm_Single; use Libm_Single;
package Ada_Libm is
function Ada_Cos (X : Float) return Float
is
(Cos (X));
pragma Export (C, Ada_Cos, "ada_cos");
function Ada_Sin (X : Float) return Float
is
(Sin (X));
pragma Export (C, Ada_Sin, "ada_sin");
end Ada_Libm;
|
pragma Ada_2005;
pragma Style_Checks (Off);
pragma Warnings (Off);
with Interfaces.C; use Interfaces.C;
with glib;
with glib.Values;
with System;
with GStreamer.GST_Low_Level.gstreamer_0_10_gst_base_gstbasetransform_h;
with GStreamer.GST_Low_Level.gstreamer_0_10_gst_audio_gstringbuffer_h;
with glib;
limited with GStreamer.GST_Low_Level.gstreamer_0_10_gst_gstcaps_h;
package GStreamer.GST_Low_Level.gstreamer_0_10_gst_audio_gstaudiofilter_h is
-- unsupported macro: GST_TYPE_AUDIO_FILTER (gst_audio_filter_get_type())
-- arg-macro: function GST_AUDIO_FILTER (obj)
-- return G_TYPE_CHECK_INSTANCE_CAST((obj),GST_TYPE_AUDIO_FILTER,GstAudioFilter);
-- arg-macro: function GST_AUDIO_FILTER_CAST (obj)
-- return (GstAudioFilter *) (obj);
-- arg-macro: function GST_AUDIO_FILTER_CLASS (klass)
-- return G_TYPE_CHECK_CLASS_CAST((klass),GST_TYPE_AUDIO_FILTER,GstAudioFilterClass);
-- arg-macro: function GST_AUDIO_FILTER_CLASS_CAST (klass)
-- return (GstAudioFilterClass *) (klass);
-- arg-macro: function GST_IS_AUDIO_FILTER (obj)
-- return G_TYPE_CHECK_INSTANCE_TYPE((obj),GST_TYPE_AUDIO_FILTER);
-- arg-macro: function GST_IS_AUDIO_FILTER_CLASS (klass)
-- return G_TYPE_CHECK_CLASS_TYPE((klass),GST_TYPE_AUDIO_FILTER);
-- GStreamer
-- * Copyright (C) <1999> Erik Walthinsen <omega@cse.ogi.edu>
-- *
-- * 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 2 of the License, or (at your option) any later version.
-- *
-- * This library is distributed in the hope that it will be useful,
-- * but WITHOUT ANY WARRANTY; without even the implied warranty of
-- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
-- * Library General Public License for more details.
-- *
-- * You should have received a copy of the GNU Library General Public
-- * License along with this library; if not, write to the
-- * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
-- * Boston, MA 02111-1307, USA.
--
type GstAudioFilter;
type u_GstAudioFilter_u_gst_reserved_array is array (0 .. 3) of System.Address;
--subtype GstAudioFilter is u_GstAudioFilter; -- gst/audio/gstaudiofilter.h:30
type GstAudioFilterClass;
type u_GstAudioFilterClass_u_gst_reserved_array is array (0 .. 3) of System.Address;
--subtype GstAudioFilterClass is u_GstAudioFilterClass; -- gst/audio/gstaudiofilter.h:31
--*
-- * GstAudioFilter:
-- *
-- * Base class for audio filters with the same format for input and output.
-- *
-- * Since: 0.10.12
--
type GstAudioFilter is record
basetransform : aliased GStreamer.GST_Low_Level.gstreamer_0_10_gst_base_gstbasetransform_h.GstBaseTransform; -- gst/audio/gstaudiofilter.h:56
format : aliased GStreamer.GST_Low_Level.gstreamer_0_10_gst_audio_gstringbuffer_h.GstRingBufferSpec; -- gst/audio/gstaudiofilter.h:59
u_gst_reserved : u_GstAudioFilter_u_gst_reserved_array; -- gst/audio/gstaudiofilter.h:62
end record;
pragma Convention (C_Pass_By_Copy, GstAudioFilter); -- gst/audio/gstaudiofilter.h:55
--< protected >
-- currently configured format
--< private >
--*
-- * GstAudioFilterClass:
-- * @basetransformclass: parent class
-- * @setup: virtual function called whenever the format changes
-- *
-- * In addition to the @setup virtual function, you should also override the
-- * GstBaseTransform::transform and/or GstBaseTransform::transform_ip virtual
-- * function.
-- *
-- * Since: 0.10.12
--
type GstAudioFilterClass is record
basetransformclass : aliased GStreamer.GST_Low_Level.gstreamer_0_10_gst_base_gstbasetransform_h.GstBaseTransformClass; -- gst/audio/gstaudiofilter.h:78
setup : access function (arg1 : access GstAudioFilter; arg2 : access GStreamer.GST_Low_Level.gstreamer_0_10_gst_audio_gstringbuffer_h.GstRingBufferSpec) return GLIB.gboolean; -- gst/audio/gstaudiofilter.h:81
u_gst_reserved : u_GstAudioFilterClass_u_gst_reserved_array; -- gst/audio/gstaudiofilter.h:84
end record;
pragma Convention (C_Pass_By_Copy, GstAudioFilterClass); -- gst/audio/gstaudiofilter.h:77
-- virtual function, called whenever the format changes
--< private >
function gst_audio_filter_get_type return GLIB.GType; -- gst/audio/gstaudiofilter.h:87
pragma Import (C, gst_audio_filter_get_type, "gst_audio_filter_get_type");
procedure gst_audio_filter_class_add_pad_templates (klass : access GstAudioFilterClass; allowed_caps : access constant GStreamer.GST_Low_Level.gstreamer_0_10_gst_gstcaps_h.GstCaps); -- gst/audio/gstaudiofilter.h:89
pragma Import (C, gst_audio_filter_class_add_pad_templates, "gst_audio_filter_class_add_pad_templates");
end GStreamer.GST_Low_Level.gstreamer_0_10_gst_audio_gstaudiofilter_h;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2009, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
private with Matreshka.Internals.Locales;
package League.Strings.Cursors is
pragma Preelaborate;
private
type Abstract_Tailored_Cursor is abstract new Abstract_Cursor with record
Locale : Matreshka.Internals.Locales.Locale_Data_Access;
end record;
procedure Set_Locale (Self : in out Abstract_Tailored_Cursor'Class);
-- Set current locale.
overriding procedure Finalize (Self : in out Abstract_Tailored_Cursor);
end League.Strings.Cursors;
|
with Support.Clock; use Support.Clock;
with Support.CmdLine; use Support.CmdLine;
with Support.Strings; use Support.Strings;
with BSSNBase.ADM_BSSN; use BSSNBase.ADM_BSSN;
with BSSNBase.Coords; use BSSNBase.Coords;
with BSSNBase.Constraints; use BSSNBase.Constraints;
-- for creation of directories if needed
with Ada.Directories;
package body BSSNBase.Text_IO is
data_directory : String := read_command_arg ('D',"data/");
results_directory : String := read_command_arg ('O',"results/");
-- returns 'xx', 'xy' etc. these are the values of type symmetric
-- used when printing indices of symmetric matrices
function str (source : in symmetric) return string is
begin
return lower_case (source'Image);
end str;
procedure write_results (sample_index_list : GridIndexList;
sample_index_num : Integer;
file_name : String)
is
num_data_max : constant := 15;
txt : File_Type;
num_dimen : constant := 3;
num_rows : Integer;
num_cols : Integer;
num_vars : Integer;
the_date : String := get_date;
ijk : Array (1 .. 3) of Integer;
ijk_max : Array (1 .. 3) of Integer;
ijk_min : Array (1 .. 3) of Integer;
xyz : Array (1 .. 3) of Real;
xyz_max : Array (1 .. 3) of Real;
xyz_min : Array (1 .. 3) of Real;
data : Array (1 .. num_data_max) of Real;
data_max : Array (1 .. num_data_max) of Real;
data_min : Array (1 .. num_data_max) of Real;
procedure check_NaN (a : Integer) is
begin
if data (a) /= data (a) then
raise Data_Error with "NaN detected in data ("&str(a,0)&") "&
"at (x,y,z) = ("&
str(xyz(1))&","&
str(xyz(2))&","&
str(xyz(3))&")";
end if;
end check_NaN;
procedure get_data (a : Integer)
is
point : GridPoint;
i, j, k : Integer;
x, y, z : Real;
gab : MetricPointArray;
Kab : ExtcurvPointArray;
begin
point := grid_point_list (sample_index_list (a));
i := point.i;
j := point.j;
k := point.k;
x := point.x;
y := point.y;
z := point.z;
-- save selected data
ijk := (i, j, k);
xyz := (x, y, z);
-- ADM data
gab := adm_gab (gBar(i,j,k), phi(i,j,k));
Kab := adm_Kab (ABar(i,j,k), gBar(i,j,k), phi(i,j,k), trK(i,j,k));
data ( 1) := gab (xx);
data ( 2) := gab (yy);
data ( 3) := gab (zz);
data ( 4) := Kab (xx);
data ( 5) := Kab (yy);
data ( 6) := Kab (zz);
data ( 7) := Ham (i,j,k);
data ( 8) := Mom (i,j,k)(1);
data ( 9) := Mom (i,j,k)(2);
data (10) := Mom (i,j,k)(3);
data (11) := get_detg (i,j,k);
data (12) := get_trABar (i,j,k);
num_vars := 12; -- number of phyical data in each row
-- BSSN data
-- data ( 1) := gBar (i,j,k)(xx);
-- data ( 2) := gBar (i,j,k)(yy);
-- data ( 3) := gBar (i,j,k)(zz);
-- data ( 4) := ABar (i,j,k)(xx);
-- data ( 5) := ABar (i,j,k)(yy);
-- data ( 6) := ABar (i,j,k)(zz);
-- data ( 7) := Ham (i,j,k);
-- data ( 8) := Mom (i,j,k)(1);
-- data ( 9) := Mom (i,j,k)(2);
-- data (10) := Mom (i,j,k)(3);
-- data (11) := get_detg (i,j,k);
-- data (12) := get_trABar (i,j,k);
--
-- num_vars := 12; -- number of phyical data in each row
end get_data;
begin
if sample_index_num = 0 then
return;
end if;
-- First pass : get min/max for the data -----------------------------------
ijk_max := (others => -666666);
ijk_min := (others => +666666);
xyz_max := (others => -666.6e66);
xyz_min := (others => +666.6e66);
data_max := (others => -666.6e66);
data_min := (others => +666.6e66);
for a in 1 .. sample_index_num loop
get_data (a);
for b in 1 .. num_vars loop
check_NaN (b);
end loop;
for b in 1 .. 3 loop
ijk_max (b) := max ( ijk_max (b), ijk (b) );
ijk_min (b) := min ( ijk_min (b), ijk (b) );
end loop;
for b in 1 .. 3 loop
xyz_max (b) := max ( xyz_max (b), xyz (b) );
xyz_min (b) := min ( xyz_min (b), xyz (b) );
end loop;
for b in 1 .. num_vars loop
data_max (b) := max ( data_max (b), data (b) );
data_min (b) := min ( data_min (b), data (b) );
end loop;
end loop;
-- Second pass : save the data ---------------------------------------------
Create (txt, Out_File, cut(file_name));
Put_Line (txt, "# 7 more lines before the data");
-- dimensions of the grid, number of vars, time & date
num_cols := 3 + 3 + num_vars; -- number of columns in body of data
num_rows := sample_index_num; -- number of rows in body of data
Put_Line (txt, "# " & str (num_rows, 0) & " rows of data");
Put_Line (txt, "# " & str (num_cols, 0) & " columns of data");
Put_Line (txt, "# " & str (the_time, 15) & " cauchy time");
Put_Line (txt, "# " & (the_date) & " today's date");
-- max and min values for each variable
Put (txt,"# ");
for i in 1 .. 3 loop
Put (txt, str(ijk_max(i),3) & spc (1));
end loop;
for i in 1 .. 3 loop
Put (txt, str(xyz_max(i),10) & spc (1));
end loop;
for i in 1 .. num_vars loop
Put (txt, str(data_max(i),15) & spc (1));
end loop;
Put_Line (txt," : max");
Put (txt,"# ");
for i in 1 .. 3 loop
Put (txt, str(ijk_min(i),3) & spc (1));
end loop;
for i in 1 .. 3 loop
Put (txt, str(xyz_min(i),10) & spc (1));
end loop;
for i in 1 .. num_vars loop
Put (txt, str(data_min(i),15) & spc (1));
end loop;
Put_Line (txt," : min");
-- the data names
Put (txt,"# ");
Put (txt, centre ("i",4,1));
Put (txt, centre ("j",4,1));
Put (txt, centre ("k",4,1));
Put (txt, centre ("x",11));
Put (txt, centre ("y",11));
Put (txt, centre ("z",11));
Put (txt, centre ("gxx",16));
Put (txt, centre ("gyy",16));
Put (txt, centre ("gzz",16));
Put (txt, centre ("Kxx",16));
Put (txt, centre ("Kyy",16));
Put (txt, centre ("Kzz",16));
Put (txt, centre ("Ham",16));
Put (txt, centre ("Mom(x)",16));
Put (txt, centre ("Mom(y)",16));
Put (txt, centre ("Mom(z)",16));
Put (txt, centre ("detg",16));
Put (txt, centre ("trABar",16));
New_Line (txt);
-- Put (txt,"# ");
-- Put (txt, centre ("i",4,1));
-- Put (txt, centre ("j",4,1));
-- Put (txt, centre ("k",4,1));
-- Put (txt, centre ("x",11));
-- Put (txt, centre ("y",11));
-- Put (txt, centre ("z",11));
-- Put (txt, centre ("gBarxx",16));
-- Put (txt, centre ("gBaryy",16));
-- Put (txt, centre ("gBarzz",16));
-- Put (txt, centre ("ABarxx",16));
-- Put (txt, centre ("ABaryy",16));
-- Put (txt, centre ("ABarzz",16));
-- Put (txt, centre ("Ham",16));
-- Put (txt, centre ("Mom(x)",16));
-- Put (txt, centre ("Mom(y)",16));
-- Put (txt, centre ("Mom(z)",16));
-- Put (txt, centre ("detg",16));
-- Put (txt, centre ("trABar",16));
-- New_Line (txt);
-- the data on the grid
for a in 1 .. num_rows loop
get_data (a);
Put (txt, spc (2));
for b in 1 .. 3 loop
Put (txt, str (ijk (b), 3) & spc (1));
end loop;
for b in 1 .. 3 loop
Put (txt, str (xyz (b), 10) & spc (1));
end loop;
for b in 1 .. num_vars loop
Put (txt, str (data (b), 15) & spc (1));
end loop;
New_Line (txt);
end loop;
Close (txt);
end write_results;
procedure write_results is
num_loop_str : String := fill_str (num_loop, 5, '0');
begin
set_constraints;
Ada.Directories.create_path (results_directory & "/xy/");
Ada.Directories.create_path (results_directory & "/xz/");
Ada.Directories.create_path (results_directory & "/yz/");
write_results (xy_index_list, xy_index_num, results_directory & "/xy/" & num_loop_str & ".txt");
write_results (xz_index_list, xz_index_num, results_directory & "/xz/" & num_loop_str & ".txt");
write_results (yz_index_list, yz_index_num, results_directory & "/yz/" & num_loop_str & ".txt");
end write_results;
procedure write_history (point : GridPoint;
file_name : String)
is
txt : File_Type;
i, j, k : Integer;
x, y, z : Real;
gab : MetricPointArray;
Kab : ExtcurvPointArray;
begin
i := sample_point.i;
j := sample_point.j;
k := sample_point.k;
x := sample_point.x;
y := sample_point.y;
z := sample_point.z;
begin
Open (txt, Append_File, file_name);
exception when Name_Error =>
Create (txt, Out_File, file_name);
Put_Line (txt, "# 4 more lines before the data");
Put_Line (txt, "# 13 columns of data");
Put_Line (txt,"# (" & str (i,0) & ", " &
str (j,0) & ", " &
str (k,0) & ") = grid indices of target");
Put_Line (txt,"# (" & str (x,10) & ", " &
str (y,10) & ", " &
str (z,10) & ") = grid coords of target");
Put_Line (txt, "# " &
centre ("Time",10) &
centre ("gxx",11) &
centre ("gyy",11) &
centre ("gzz",11) &
centre ("Kxx",11) &
centre ("Kyy",11) &
centre ("Kzz",11) &
centre ("Ham",11) &
centre ("Mom(x)",11) &
centre ("Mom(y)",11) &
centre ("Mom(z)",11) &
centre ("detg",11) &
centre ("trABar",11));
end;
-- ADM data
gab := adm_gab (gBar(i,j,k), phi(i,j,k));
Kab := adm_Kab (ABar(i,j,k), gBar(i,j,k), phi(i,j,k), trK(i,j,k));
Put (txt, spc (1) & str (the_time));
Put (txt, spc (1) & str (gab (xx)));
Put (txt, spc (1) & str (gab (yy)));
Put (txt, spc (1) & str (gab (zz)));
Put (txt, spc (1) & str (Kab (xx)));
Put (txt, spc (1) & str (Kab (yy)));
Put (txt, spc (1) & str (Kab (zz)));
Put (txt, spc (1) & str (Ham (i,j,k)));
Put (txt, spc (1) & str (Mom (i,j,k)(1)));
Put (txt, spc (1) & str (Mom (i,j,k)(2)));
Put (txt, spc (1) & str (Mom (i,j,k)(3)));
Put (txt, spc (1) & str (get_detg (i,j,k)));
Put (txt, spc (1) & str (get_trABar (i,j,k)));
New_Line (txt);
Close (txt);
end write_history;
procedure write_history is
begin
write_history (sample_point,results_directory & "/history.txt");
end write_history;
procedure write_summary
is
i, j, k : Integer;
gab : MetricPointArray;
Kab : ExtcurvPointArray;
begin
i := sample_point.i;
j := sample_point.j;
k := sample_point.k;
set_constraints;
gab := adm_gab (gBar(i,j,k), phi(i,j,k));
Kab := adm_Kab (ABar(i,j,k), gBar(i,j,k), phi(i,j,k), trK(i,j,k));
Put (spc (1) & str (num_loop,4));
Put (spc (1) & str (the_time,10));
Put (spc (1) & str (time_step,10));
Put (spc (1) & str (gab (xx),10));
Put (spc (1) & str (gab (zz),10));
Put (spc (1) & str (Kab (xx),10));
Put (spc (1) & str (Kab (zz),10));
Put (spc (1) & str (Ham (i,j,k),10));
New_Line;
end write_summary;
summary_dashes : String (1..83) := (others => '-');
procedure write_summary_header is
begin
Put_Line (summary_dashes);
Put (" ");
Put (centre("loop",5));
Put (centre("time",11));
Put (centre("step",11));
Put (centre("gxx",11));
Put (centre("gzz",11));
Put (centre("Kxx",11));
Put (centre("Kzz",11));
Put (centre("Ham.",11));
New_Line;
Put_Line (summary_dashes);
end write_summary_header;
procedure write_summary_trailer is
begin
Put_Line (summary_dashes);
end write_summary_trailer;
procedure create_text_io_lists is
a : Integer := 0;
num_xy : Integer := 0;
num_xz : Integer := 0;
num_yz : Integer := 0;
x, y, z : Real;
begin
a := 0;
num_xy := 0;
num_xz := 0;
num_yz := 0;
for i in 1 .. num_x loop
for j in 1 .. num_y loop
for k in 1 .. num_y loop
x := x_coord (i);
y := y_coord (j);
z := z_coord (k);
a := a + 1;
-- xy plane
if abs (z) < dz/2.0 then
num_xy := num_xy + 1;
xy_index_list (num_xy) := a;
end if;
-- xz plane
if abs (y) < dy/2.0 then
num_xz := num_xz + 1;
xz_index_list (num_xz) := a;
end if;
-- yz plane
if abs (x) < dx/2.0 then
num_yz := num_yz + 1;
yz_index_list (num_yz) := a;
end if;
-- the sample point = the origin, used in write_history
if abs (x) < dx/2.0 and
abs (y) < dy/2.0 and
abs (z) < dz/2.0 then
sample_point := (i,j,k,0.0,0.0,0.0);
end if;
end loop;
end loop;
end loop;
xy_index_num := num_xy;
xz_index_num := num_xz;
yz_index_num := num_yz;
end create_text_io_lists;
end BSSNBase.Text_IO;
|
-- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2017 onox <denkpadje@gmail.com>
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
package body Orka.glTF.Scenes is
function Create_Nodes (Nodes : Types.JSON_Value) return Natural_Vectors.Vector is
Result : Natural_Vectors.Vector;
begin
for Node of Nodes loop
Result.Append (Natural (Long_Integer'(Node.Value)));
end loop;
return Result;
end Create_Nodes;
function Get_Matrix (Matrix : Types.JSON_Value) return Transforms.Matrix4
with Pre => Matrix.Length = 16;
function Get_Matrix (Matrix : Types.JSON_Value) return Transforms.Matrix4 is
Result : Transforms.Matrix4;
begin
for I in Index_Homogeneous loop
for J in Index_Homogeneous loop
declare
Column : constant Natural := Index_Homogeneous'Pos (I) * 4;
Row : constant Natural := Index_Homogeneous'Pos (J);
begin
Result (I) (J) := Matrix.Get (Column + Row + 1).Value;
end;
end loop;
end loop;
return Result;
end Get_Matrix;
function Get_Vector3 (Vector : Types.JSON_Value) return Transforms.Vector4
with Pre => Vector.Length = 3;
function Get_Vector4 (Vector : Types.JSON_Value) return Transforms.Vector4
with Pre => Vector.Length = 4;
function Get_Vector3 (Vector : Types.JSON_Value) return Transforms.Vector4 is
((Vector.Get (1).Value, Vector.Get (2).Value, Vector.Get (3).Value, 0.0));
function Get_Vector4 (Vector : Types.JSON_Value) return Transforms.Vector4 is
((Vector.Get (1).Value, Vector.Get (2).Value, Vector.Get (3).Value, Vector.Get (4).Value));
function Create_Node (Object : Types.JSON_Value) return Node is
Transform : constant Transform_Kind
:= (if Object.Contains ("matrix") then Matrix else TRS);
begin
return Result : Node (Transform) do
Result.Name := Name_Strings.To_Bounded_String (Object.Get ("name").Value);
Result.Children.Append (Create_Nodes (Object.Get_Array_Or_Empty ("children")));
Result.Mesh := Natural_Optional (Long_Integer'(Object.Get ("mesh", Undefined).Value));
case Transform is
when Matrix =>
Result.Matrix := Get_Matrix (Object.Get ("matrix"));
when TRS =>
if Object.Contains ("translation") then
Result.Translation := Get_Vector3 (Object.Get ("translation"));
end if;
if Object.Contains ("rotation") then
Result.Rotation := Get_Vector4 (Object.Get ("rotation"));
pragma Assert (for all E of Result.Rotation => E in -1.0 .. 1.0);
end if;
if Object.Contains ("scale") then
Result.Scale := Get_Vector3 (Object.Get ("scale"));
end if;
end case;
end return;
end Create_Node;
function Get_Nodes
(Nodes : Types.JSON_Value) return Node_Vectors.Vector
is
Result : Node_Vectors.Vector (Capacity => Nodes.Length);
begin
for Node of Nodes loop
Result.Append (Create_Node (Node));
end loop;
return Result;
end Get_Nodes;
function Create_Scene
(Object : Types.JSON_Value) return Scene is
begin
return Result : Scene do
Result.Name := Name_Strings.To_Bounded_String (Object.Get ("name").Value);
Result.Nodes.Append (Create_Nodes (Object.Get ("nodes")));
end return;
end Create_Scene;
function Get_Scenes
(Scenes : Types.JSON_Value) return Scene_Vectors.Vector
is
Result : Scene_Vectors.Vector (Capacity => Scenes.Length);
begin
for Scene of Scenes loop
Result.Append (Create_Scene (Scene));
end loop;
return Result;
end Get_Scenes;
end Orka.glTF.Scenes;
|
with Node_List_Parsers;
with Line_Arrays;
procedure Prova_Parser is
type Class is (Wp, Tsk, Deliv);
package My_Parser is new Node_List_Parsers (Class);
use My_Parser;
Eol : constant Character := Character'Val (10);
X : constant String := "" & Eol
& "" & Eol
& "" & Eol
& " [ Wp ]" & Eol
& "name : zorro" & Eol
& "label : pluto " & Eol
& "Viva la pappa col pomodoro" & Eol
& "" & Eol
& "" & Eol
& "[task]" & Eol
& "begin:12" & Eol;
Names : My_Parser.Name_Maps.Map;
begin
Names.Insert (Key => +"task",
New_Item => Tsk);
declare
Result : constant Node_List := Parse (Line_Arrays.Split (X), Names);
begin
Dump (Result);
end;
end Prova_Parser;
|
-- generated parser support file.
-- command line: wisitoken-bnf-generate.exe --generate LR1 Ada_Emacs re2c PROCESS text_rep ada.wy
--
-- Copyright (C) 2013 - 2019 Free Software Foundation, Inc.
-- This program is free software; you can redistribute it and/or
-- modify it under the terms of the GNU General Public License as
-- published by the Free Software Foundation; either version 3, or (at
-- your option) any later version.
--
-- This software is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
-- General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>.
with WisiToken.Syntax_Trees;
with WisiToken.Lexer;
with WisiToken.Semantic_Checks;
package Ada_Process_Actions is
Descriptor : aliased WisiToken.Descriptor :=
(First_Terminal => 3,
Last_Terminal => 108,
First_Nonterminal => 109,
Last_Nonterminal => 333,
EOI_ID => 108,
Accept_ID => 109,
Case_Insensitive => True,
New_Line_ID => 1,
String_1_ID => 107,
String_2_ID => 106,
Image =>
(new String'("WHITESPACE"),
new String'("NEW_LINE"),
new String'("COMMENT"),
new String'("ABS"),
new String'("ACCEPT"),
new String'("ABORT"),
new String'("ABSTRACT"),
new String'("ACCESS"),
new String'("ALIASED"),
new String'("ALL"),
new String'("AND"),
new String'("ARRAY"),
new String'("AT"),
new String'("BEGIN"),
new String'("BODY"),
new String'("CASE"),
new String'("CONSTANT"),
new String'("DECLARE"),
new String'("DELAY"),
new String'("DELTA"),
new String'("DIGITS"),
new String'("DO"),
new String'("ELSE"),
new String'("ELSIF"),
new String'("END"),
new String'("ENTRY"),
new String'("EXCEPTION"),
new String'("EXIT"),
new String'("FOR"),
new String'("FUNCTION"),
new String'("GENERIC"),
new String'("GOTO"),
new String'("IF"),
new String'("IN"),
new String'("INTERFACE"),
new String'("IS"),
new String'("LIMITED"),
new String'("LOOP"),
new String'("MOD"),
new String'("NEW"),
new String'("NOT"),
new String'("NULL"),
new String'("OF"),
new String'("OR"),
new String'("OTHERS"),
new String'("OUT"),
new String'("OVERRIDING"),
new String'("PACKAGE"),
new String'("PRAGMA"),
new String'("PRIVATE"),
new String'("PROCEDURE"),
new String'("PROTECTED"),
new String'("RAISE"),
new String'("RANGE"),
new String'("RECORD"),
new String'("REM"),
new String'("RENAMES"),
new String'("REQUEUE"),
new String'("RETURN"),
new String'("REVERSE"),
new String'("SEPARATE"),
new String'("SELECT"),
new String'("SOME"),
new String'("SUBTYPE"),
new String'("SYNCHRONIZED"),
new String'("TAGGED"),
new String'("TASK"),
new String'("TERMINATE"),
new String'("THEN"),
new String'("TYPE"),
new String'("UNTIL"),
new String'("USE"),
new String'("WHEN"),
new String'("WHILE"),
new String'("WITH"),
new String'("XOR"),
new String'("LEFT_PAREN"),
new String'("RIGHT_PAREN"),
new String'("AMPERSAND"),
new String'("AT_SIGN"),
new String'("BAR"),
new String'("BOX"),
new String'("COLON"),
new String'("COLON_EQUAL"),
new String'("COMMA"),
new String'("DOT"),
new String'("DOT_DOT"),
new String'("EQUAL"),
new String'("EQUAL_GREATER"),
new String'("GREATER"),
new String'("GREATER_EQUAL"),
new String'("GREATER_GREATER"),
new String'("LESS"),
new String'("LESS_EQUAL"),
new String'("LESS_LESS"),
new String'("MINUS"),
new String'("PLUS"),
new String'("SEMICOLON"),
new String'("SLASH"),
new String'("SLASH_EQUAL"),
new String'("STAR"),
new String'("STAR_STAR"),
new String'("TICK_1"),
new String'("TICK_2"),
new String'("NUMERIC_LITERAL"),
new String'("IDENTIFIER"),
new String'("STRING_LITERAL"),
new String'("CHARACTER_LITERAL"),
new String'("Wisi_EOI"),
new String'("wisitoken_accept"),
new String'("abstract_limited_synchronized_opt"),
new String'("abstract_limited_opt"),
new String'("abstract_tagged_limited_opt"),
new String'("abstract_subprogram_declaration"),
new String'("accept_statement"),
new String'("access_definition"),
new String'("actual_parameter_part"),
new String'("actual_parameter_part_opt"),
new String'("aggregate"),
new String'("aliased_opt"),
new String'("and_interface_list_opt"),
new String'("array_type_definition"),
new String'("aspect_clause"),
new String'("aspect_specification_opt"),
new String'("assignment_statement"),
new String'("association_opt"),
new String'("association_list"),
new String'("asynchronous_select"),
new String'("at_clause"),
new String'("attribute_reference"),
new String'("attribute_designator"),
new String'("binary_adding_operator"),
new String'("block_label"),
new String'("block_label_opt"),
new String'("block_statement"),
new String'("body_g"),
new String'("body_stub"),
new String'("case_expression"),
new String'("case_expression_alternative"),
new String'("case_expression_alternative_list"),
new String'("case_statement"),
new String'("case_statement_alternative"),
new String'("case_statement_alternative_list"),
new String'("compilation_unit"),
new String'("compilation_unit_list"),
new String'("component_clause"),
new String'("component_clause_list"),
new String'("component_declaration"),
new String'("component_definition"),
new String'("component_item"),
new String'("component_list"),
new String'("component_list_opt"),
new String'("compound_statement"),
new String'("conditional_entry_call"),
new String'("conditional_quantified_expression"),
new String'("constant_opt"),
new String'("constraint"),
new String'("constraint_opt"),
new String'("declaration"),
new String'("declarations"),
new String'("declarative_part_opt"),
new String'("delay_alternative"),
new String'("delay_statement"),
new String'("derived_type_definition"),
new String'("direct_name"),
new String'("direct_name_opt"),
new String'("discrete_choice"),
new String'("discrete_choice_list"),
new String'("discrete_subtype_definition"),
new String'("discrete_subtype_definition_list"),
new String'("discriminant_part_opt"),
new String'("discriminant_specification_opt"),
new String'("discriminant_specification_list"),
new String'("elsif_expression_item"),
new String'("elsif_expression_list"),
new String'("elsif_statement_item"),
new String'("elsif_statement_list"),
new String'("entry_body"),
new String'("entry_body_formal_part"),
new String'("entry_call_alternative"),
new String'("entry_declaration"),
new String'("enumeration_literal"),
new String'("enumeration_literal_list"),
new String'("enumeration_representation_clause"),
new String'("enumeration_type_definition"),
new String'("exception_choice"),
new String'("exception_choice_list"),
new String'("exception_declaration"),
new String'("exception_handler"),
new String'("exception_handler_list"),
new String'("exception_handler_list_opt"),
new String'("exit_statement"),
new String'("expression"),
new String'("expression_opt"),
new String'("expression_function_declaration"),
new String'("extended_return_object_declaration"),
new String'("extended_return_object_declaration_opt"),
new String'("extended_return_statement"),
new String'("factor"),
new String'("formal_object_declaration"),
new String'("formal_part"),
new String'("formal_subprogram_declaration"),
new String'("formal_type_declaration"),
new String'("formal_type_definition"),
new String'("formal_derived_type_definition"),
new String'("formal_package_declaration"),
new String'("formal_package_actual_part"),
new String'("full_type_declaration"),
new String'("function_specification"),
new String'("general_access_modifier_opt"),
new String'("generic_declaration"),
new String'("generic_formal_part"),
new String'("generic_formal_parameter_declarations"),
new String'("generic_formal_parameter_declaration"),
new String'("generic_instantiation"),
new String'("generic_package_declaration"),
new String'("generic_renaming_declaration"),
new String'("generic_subprogram_declaration"),
new String'("goto_label"),
new String'("handled_sequence_of_statements"),
new String'("identifier_list"),
new String'("identifier_opt"),
new String'("if_expression"),
new String'("if_statement"),
new String'("incomplete_type_declaration"),
new String'("index_constraint"),
new String'("index_subtype_definition"),
new String'("index_subtype_definition_list"),
new String'("interface_list"),
new String'("interface_type_definition"),
new String'("iteration_scheme"),
new String'("iterator_specification"),
new String'("iterator_specification_opt"),
new String'("loop_statement"),
new String'("membership_choice_list"),
new String'("membership_choice"),
new String'("mod_clause_opt"),
new String'("mode_opt"),
new String'("multiplying_operator"),
new String'("name_list"),
new String'("name"),
new String'("name_opt"),
new String'("null_exclusion_opt"),
new String'("null_exclusion_opt_name_type"),
new String'("null_procedure_declaration"),
new String'("object_declaration"),
new String'("object_renaming_declaration"),
new String'("overriding_indicator_opt"),
new String'("package_body"),
new String'("package_body_stub"),
new String'("package_declaration"),
new String'("package_renaming_declaration"),
new String'("package_specification"),
new String'("parameter_and_result_profile"),
new String'("parameter_profile_opt"),
new String'("parameter_specification"),
new String'("parameter_specification_list"),
new String'("paren_expression"),
new String'("pragma_g"),
new String'("primary"),
new String'("private_extension_declaration"),
new String'("private_type_declaration"),
new String'("procedure_call_statement"),
new String'("procedure_specification"),
new String'("proper_body"),
new String'("protected_body"),
new String'("protected_body_stub"),
new String'("protected_definition"),
new String'("protected_operation_item"),
new String'("protected_operation_item_list"),
new String'("protected_operation_item_list_opt"),
new String'("protected_opt"),
new String'("protected_type_declaration"),
new String'("qualified_expression"),
new String'("quantified_expression"),
new String'("quantifier"),
new String'("raise_expression"),
new String'("raise_statement"),
new String'("range_g"),
new String'("range_list"),
new String'("real_range_specification_opt"),
new String'("record_definition"),
new String'("record_representation_clause"),
new String'("relation_and_list"),
new String'("relation_and_then_list"),
new String'("relation_or_list"),
new String'("relation_or_else_list"),
new String'("relation_xor_list"),
new String'("relation"),
new String'("relational_operator"),
new String'("renaming_declaration"),
new String'("requeue_statement"),
new String'("result_profile"),
new String'("return_subtype_indication"),
new String'("selected_component"),
new String'("selective_accept"),
new String'("select_alternative"),
new String'("select_alternative_list"),
new String'("select_alternative_list_opt"),
new String'("select_statement"),
new String'("sequence_of_statements"),
new String'("sequence_of_statements_opt"),
new String'("simple_expression"),
new String'("simple_return_statement"),
new String'("simple_statement"),
new String'("single_protected_declaration"),
new String'("single_task_declaration"),
new String'("statement"),
new String'("subprogram_body"),
new String'("subprogram_body_stub"),
new String'("subprogram_declaration"),
new String'("subprogram_default"),
new String'("subprogram_renaming_declaration"),
new String'("subprogram_specification"),
new String'("subtype_declaration"),
new String'("subtype_indication"),
new String'("subunit"),
new String'("task_body"),
new String'("task_body_stub"),
new String'("task_definition"),
new String'("task_type_declaration"),
new String'("term"),
new String'("term_list"),
new String'("tick"),
new String'("timed_entry_call"),
new String'("triggering_alternative"),
new String'("type_declaration"),
new String'("type_definition"),
new String'("variant_part"),
new String'("variant_list"),
new String'("variant"),
new String'("unary_adding_operator"),
new String'("use_clause"),
new String'("with_clause")),
Terminal_Image_Width => 17,
Image_Width => 38,
Last_Lookahead => 108);
type Token_Enum_ID is
(WHITESPACE_ID,
NEW_LINE_ID,
COMMENT_ID,
ABS_ID,
ACCEPT_ID,
ABORT_ID,
ABSTRACT_ID,
ACCESS_ID,
ALIASED_ID,
ALL_ID,
AND_ID,
ARRAY_ID,
AT_ID,
BEGIN_ID,
BODY_ID,
CASE_ID,
CONSTANT_ID,
DECLARE_ID,
DELAY_ID,
DELTA_ID,
DIGITS_ID,
DO_ID,
ELSE_ID,
ELSIF_ID,
END_ID,
ENTRY_ID,
EXCEPTION_ID,
EXIT_ID,
FOR_ID,
FUNCTION_ID,
GENERIC_ID,
GOTO_ID,
IF_ID,
IN_ID,
INTERFACE_ID,
IS_ID,
LIMITED_ID,
LOOP_ID,
MOD_ID,
NEW_ID,
NOT_ID,
NULL_ID,
OF_ID,
OR_ID,
OTHERS_ID,
OUT_ID,
OVERRIDING_ID,
PACKAGE_ID,
PRAGMA_ID,
PRIVATE_ID,
PROCEDURE_ID,
PROTECTED_ID,
RAISE_ID,
RANGE_ID,
RECORD_ID,
REM_ID,
RENAMES_ID,
REQUEUE_ID,
RETURN_ID,
REVERSE_ID,
SEPARATE_ID,
SELECT_ID,
SOME_ID,
SUBTYPE_ID,
SYNCHRONIZED_ID,
TAGGED_ID,
TASK_ID,
TERMINATE_ID,
THEN_ID,
TYPE_ID,
UNTIL_ID,
USE_ID,
WHEN_ID,
WHILE_ID,
WITH_ID,
XOR_ID,
LEFT_PAREN_ID,
RIGHT_PAREN_ID,
AMPERSAND_ID,
AT_SIGN_ID,
BAR_ID,
BOX_ID,
COLON_ID,
COLON_EQUAL_ID,
COMMA_ID,
DOT_ID,
DOT_DOT_ID,
EQUAL_ID,
EQUAL_GREATER_ID,
GREATER_ID,
GREATER_EQUAL_ID,
GREATER_GREATER_ID,
LESS_ID,
LESS_EQUAL_ID,
LESS_LESS_ID,
MINUS_ID,
PLUS_ID,
SEMICOLON_ID,
SLASH_ID,
SLASH_EQUAL_ID,
STAR_ID,
STAR_STAR_ID,
TICK_1_ID,
TICK_2_ID,
NUMERIC_LITERAL_ID,
IDENTIFIER_ID,
STRING_LITERAL_ID,
CHARACTER_LITERAL_ID,
Wisi_EOI_ID,
wisitoken_accept_ID,
abstract_limited_synchronized_opt_ID,
abstract_limited_opt_ID,
abstract_tagged_limited_opt_ID,
abstract_subprogram_declaration_ID,
accept_statement_ID,
access_definition_ID,
actual_parameter_part_ID,
actual_parameter_part_opt_ID,
aggregate_ID,
aliased_opt_ID,
and_interface_list_opt_ID,
array_type_definition_ID,
aspect_clause_ID,
aspect_specification_opt_ID,
assignment_statement_ID,
association_opt_ID,
association_list_ID,
asynchronous_select_ID,
at_clause_ID,
attribute_reference_ID,
attribute_designator_ID,
binary_adding_operator_ID,
block_label_ID,
block_label_opt_ID,
block_statement_ID,
body_g_ID,
body_stub_ID,
case_expression_ID,
case_expression_alternative_ID,
case_expression_alternative_list_ID,
case_statement_ID,
case_statement_alternative_ID,
case_statement_alternative_list_ID,
compilation_unit_ID,
compilation_unit_list_ID,
component_clause_ID,
component_clause_list_ID,
component_declaration_ID,
component_definition_ID,
component_item_ID,
component_list_ID,
component_list_opt_ID,
compound_statement_ID,
conditional_entry_call_ID,
conditional_quantified_expression_ID,
constant_opt_ID,
constraint_ID,
constraint_opt_ID,
declaration_ID,
declarations_ID,
declarative_part_opt_ID,
delay_alternative_ID,
delay_statement_ID,
derived_type_definition_ID,
direct_name_ID,
direct_name_opt_ID,
discrete_choice_ID,
discrete_choice_list_ID,
discrete_subtype_definition_ID,
discrete_subtype_definition_list_ID,
discriminant_part_opt_ID,
discriminant_specification_opt_ID,
discriminant_specification_list_ID,
elsif_expression_item_ID,
elsif_expression_list_ID,
elsif_statement_item_ID,
elsif_statement_list_ID,
entry_body_ID,
entry_body_formal_part_ID,
entry_call_alternative_ID,
entry_declaration_ID,
enumeration_literal_ID,
enumeration_literal_list_ID,
enumeration_representation_clause_ID,
enumeration_type_definition_ID,
exception_choice_ID,
exception_choice_list_ID,
exception_declaration_ID,
exception_handler_ID,
exception_handler_list_ID,
exception_handler_list_opt_ID,
exit_statement_ID,
expression_ID,
expression_opt_ID,
expression_function_declaration_ID,
extended_return_object_declaration_ID,
extended_return_object_declaration_opt_ID,
extended_return_statement_ID,
factor_ID,
formal_object_declaration_ID,
formal_part_ID,
formal_subprogram_declaration_ID,
formal_type_declaration_ID,
formal_type_definition_ID,
formal_derived_type_definition_ID,
formal_package_declaration_ID,
formal_package_actual_part_ID,
full_type_declaration_ID,
function_specification_ID,
general_access_modifier_opt_ID,
generic_declaration_ID,
generic_formal_part_ID,
generic_formal_parameter_declarations_ID,
generic_formal_parameter_declaration_ID,
generic_instantiation_ID,
generic_package_declaration_ID,
generic_renaming_declaration_ID,
generic_subprogram_declaration_ID,
goto_label_ID,
handled_sequence_of_statements_ID,
identifier_list_ID,
identifier_opt_ID,
if_expression_ID,
if_statement_ID,
incomplete_type_declaration_ID,
index_constraint_ID,
index_subtype_definition_ID,
index_subtype_definition_list_ID,
interface_list_ID,
interface_type_definition_ID,
iteration_scheme_ID,
iterator_specification_ID,
iterator_specification_opt_ID,
loop_statement_ID,
membership_choice_list_ID,
membership_choice_ID,
mod_clause_opt_ID,
mode_opt_ID,
multiplying_operator_ID,
name_list_ID,
name_ID,
name_opt_ID,
null_exclusion_opt_ID,
null_exclusion_opt_name_type_ID,
null_procedure_declaration_ID,
object_declaration_ID,
object_renaming_declaration_ID,
overriding_indicator_opt_ID,
package_body_ID,
package_body_stub_ID,
package_declaration_ID,
package_renaming_declaration_ID,
package_specification_ID,
parameter_and_result_profile_ID,
parameter_profile_opt_ID,
parameter_specification_ID,
parameter_specification_list_ID,
paren_expression_ID,
pragma_g_ID,
primary_ID,
private_extension_declaration_ID,
private_type_declaration_ID,
procedure_call_statement_ID,
procedure_specification_ID,
proper_body_ID,
protected_body_ID,
protected_body_stub_ID,
protected_definition_ID,
protected_operation_item_ID,
protected_operation_item_list_ID,
protected_operation_item_list_opt_ID,
protected_opt_ID,
protected_type_declaration_ID,
qualified_expression_ID,
quantified_expression_ID,
quantifier_ID,
raise_expression_ID,
raise_statement_ID,
range_g_ID,
range_list_ID,
real_range_specification_opt_ID,
record_definition_ID,
record_representation_clause_ID,
relation_and_list_ID,
relation_and_then_list_ID,
relation_or_list_ID,
relation_or_else_list_ID,
relation_xor_list_ID,
relation_ID,
relational_operator_ID,
renaming_declaration_ID,
requeue_statement_ID,
result_profile_ID,
return_subtype_indication_ID,
selected_component_ID,
selective_accept_ID,
select_alternative_ID,
select_alternative_list_ID,
select_alternative_list_opt_ID,
select_statement_ID,
sequence_of_statements_ID,
sequence_of_statements_opt_ID,
simple_expression_ID,
simple_return_statement_ID,
simple_statement_ID,
single_protected_declaration_ID,
single_task_declaration_ID,
statement_ID,
subprogram_body_ID,
subprogram_body_stub_ID,
subprogram_declaration_ID,
subprogram_default_ID,
subprogram_renaming_declaration_ID,
subprogram_specification_ID,
subtype_declaration_ID,
subtype_indication_ID,
subunit_ID,
task_body_ID,
task_body_stub_ID,
task_definition_ID,
task_type_declaration_ID,
term_ID,
term_list_ID,
tick_ID,
timed_entry_call_ID,
triggering_alternative_ID,
type_declaration_ID,
type_definition_ID,
variant_part_ID,
variant_list_ID,
variant_ID,
unary_adding_operator_ID,
use_clause_ID,
with_clause_ID);
type Token_Enum_ID_Array is array (Positive range <>) of Token_Enum_ID;
use all type WisiToken.Token_ID;
function "+" (Item : in Token_Enum_ID) return WisiToken.Token_ID
is (WisiToken.Token_ID'First + Token_Enum_ID'Pos (Item));
function To_Token_Enum (Item : in WisiToken.Token_ID) return Token_Enum_ID
is (Token_Enum_ID'Val (Item - WisiToken.Token_ID'First));
function "-" (Item : in WisiToken.Token_ID) return Token_Enum_ID renames To_Token_Enum;
procedure abstract_subprogram_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure accept_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure accept_statement_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure access_definition_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure access_definition_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure access_definition_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure actual_parameter_part_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure actual_parameter_part_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure aggregate_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure aggregate_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure aggregate_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure aggregate_4
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure aggregate_5
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure array_type_definition_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure array_type_definition_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure aspect_clause_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure aspect_specification_opt_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure assignment_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure association_opt_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure association_opt_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure association_opt_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure association_opt_4
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure association_opt_5
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure asynchronous_select_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure at_clause_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure block_label_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure block_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure block_statement_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure case_expression_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure case_expression_alternative_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure case_expression_alternative_list_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure case_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure case_statement_alternative_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure case_statement_alternative_list_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure compilation_unit_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure compilation_unit_list_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure compilation_unit_list_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure component_clause_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure component_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure component_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure component_list_4
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure conditional_entry_call_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure declaration_9
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure delay_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure delay_statement_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure derived_type_definition_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure derived_type_definition_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure discriminant_part_opt_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure elsif_expression_item_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure elsif_expression_list_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure elsif_statement_item_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure elsif_statement_list_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure entry_body_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure entry_body_formal_part_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure entry_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure entry_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure enumeration_representation_clause_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure enumeration_type_definition_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure exception_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure exception_handler_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure exception_handler_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure exception_handler_list_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure exit_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure exit_statement_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure expression_function_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure extended_return_object_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure extended_return_object_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure extended_return_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure extended_return_statement_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure formal_object_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure formal_object_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure formal_object_declaration_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure formal_object_declaration_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure formal_part_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure formal_subprogram_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure formal_subprogram_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure formal_subprogram_declaration_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure formal_subprogram_declaration_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure formal_type_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure formal_type_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure formal_type_declaration_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure formal_derived_type_definition_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure formal_derived_type_definition_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure formal_package_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure full_type_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure function_specification_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure generic_formal_part_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure generic_formal_part_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure generic_instantiation_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure generic_instantiation_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure generic_instantiation_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure generic_package_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure generic_renaming_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure generic_renaming_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure generic_renaming_declaration_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure generic_subprogram_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure goto_label_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure handled_sequence_of_statements_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure identifier_list_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure identifier_list_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure if_expression_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure if_expression_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure if_expression_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure if_expression_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure if_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure if_statement_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure if_statement_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure if_statement_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure incomplete_type_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure incomplete_type_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure index_constraint_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure interface_list_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure interface_list_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure iteration_scheme_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure iteration_scheme_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure iterator_specification_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure iterator_specification_5
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure loop_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure loop_statement_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure name_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure name_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure name_5
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure null_exclusion_opt_name_type_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure null_exclusion_opt_name_type_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure null_exclusion_opt_name_type_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure null_exclusion_opt_name_type_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure null_procedure_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure object_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure object_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure object_declaration_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure object_declaration_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure object_declaration_4
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure object_declaration_5
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure object_renaming_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure object_renaming_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure object_renaming_declaration_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure overriding_indicator_opt_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure overriding_indicator_opt_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure package_body_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure package_body_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure package_body_stub_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure package_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure package_renaming_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure package_specification_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure package_specification_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure parameter_and_result_profile_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure parameter_specification_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure parameter_specification_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure parameter_specification_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure parameter_specification_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure paren_expression_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure pragma_g_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure pragma_g_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure pragma_g_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure primary_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure primary_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure primary_4
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure private_extension_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure private_type_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure procedure_call_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure procedure_specification_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure protected_body_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure protected_body_stub_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure protected_definition_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure protected_definition_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure protected_type_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure protected_type_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure qualified_expression_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure quantified_expression_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure raise_expression_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure raise_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure raise_statement_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure raise_statement_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure range_g_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure record_definition_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure record_representation_clause_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure requeue_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure requeue_statement_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure result_profile_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure result_profile_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure selected_component_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure selected_component_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure selected_component_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure selected_component_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure selective_accept_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure selective_accept_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure select_alternative_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure select_alternative_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure select_alternative_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure select_alternative_4
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure select_alternative_list_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure select_alternative_list_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure simple_return_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure simple_statement_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure simple_statement_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure simple_statement_8
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure single_protected_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure single_protected_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure single_task_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure single_task_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure single_task_declaration_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure subprogram_body_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure subprogram_body_stub_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure subprogram_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure subprogram_default_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure subprogram_renaming_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure subtype_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure subtype_indication_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure subtype_indication_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure subtype_indication_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure subtype_indication_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure subunit_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure task_body_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure task_body_stub_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure task_definition_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure task_definition_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure task_type_declaration_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure task_type_declaration_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure task_type_declaration_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure timed_entry_call_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure variant_part_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure variant_list_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure variant_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure use_clause_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure use_clause_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure use_clause_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure with_clause_0
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure with_clause_1
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure with_clause_2
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
procedure with_clause_3
(User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
Tree : in out WisiToken.Syntax_Trees.Tree;
Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array);
function accept_statement_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function block_label_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function block_label_opt_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function block_statement_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function block_statement_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function compilation_unit_list_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function entry_body_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function function_specification_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function identifier_opt_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function loop_statement_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function loop_statement_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function name_2_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function name_5_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function name_7_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function name_opt_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function package_body_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function package_body_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function package_specification_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function package_specification_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function procedure_specification_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function protected_body_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function protected_definition_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function protected_definition_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function protected_type_declaration_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function protected_type_declaration_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function selected_component_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function selected_component_2_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function single_protected_declaration_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function single_protected_declaration_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function single_task_declaration_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function single_task_declaration_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function subprogram_body_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function subprogram_specification_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function subprogram_specification_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function task_body_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function task_type_declaration_0_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
function task_type_declaration_1_check
(Lexer : access constant WisiToken.Lexer.Instance'Class;
Nonterm : in out WisiToken.Recover_Token;
Tokens : in WisiToken.Recover_Token_Array;
Recover_Active : in Boolean)
return WisiToken.Semantic_Checks.Check_Status;
Partial_Parse_Active : Boolean := False;
Partial_Parse_Byte_Goal : WisiToken.Buffer_Pos := WisiToken.Buffer_Pos'Last;
end Ada_Process_Actions;
|
pragma Style_Checks (Off);
with CSS.Analysis.Parser.Lexer_dfa; use CSS.Analysis.Parser.Lexer_dfa;
package body CSS.Analysis.Parser.Lexer_dfa is
-- Warning: This file is automatically generated by AFLEX.
-- It is useless to modify it. Change the ".Y" & ".L" files instead.
-- Nov 2002. Fixed insufficient buffer size bug causing
-- damage to comments at about the 1000-th character
function YYText return String is
J : Integer := yytext_ptr;
begin
while J <= yy_ch_buf'Last and then yy_ch_buf (J) /= ASCII.NUL loop
J := J + 1;
end loop;
declare
subtype Sliding_Type is String (1 .. J - yytext_ptr);
begin
return Sliding_Type (yy_ch_buf (yytext_ptr .. J - 1));
end;
end YYText;
-- Returns the length of the matched text
function YYLength return Integer is
begin
return yy_cp - yy_bp;
end YYLength;
-- Done after the current pattern has been matched and before the
-- corresponding action - sets up yytext
procedure YY_DO_BEFORE_ACTION is
begin
yytext_ptr := yy_bp;
yy_hold_char := yy_ch_buf (yy_cp);
yy_ch_buf (yy_cp) := ASCII.NUL;
yy_c_buf_p := yy_cp;
end YY_DO_BEFORE_ACTION;
end CSS.Analysis.Parser.Lexer_dfa;
|
-- Copyright 2008-2015 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package Pck is
My_Global_Variable : Integer := 1;
Exported_Capitalized : Integer := 2;
pragma Export (C, Exported_Capitalized, "Exported_Capitalized");
Local_Identical_One : Integer := 4;
Local_Identical_Two : Integer := 8;
External_Identical_One : Integer := 19;
package Inner is
Inside_Variable : Integer := 3;
end Inner;
procedure Proc (I : Integer);
end Pck;
|
-- Copyright 2008-2015 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package body Pck is
procedure Do_Nothing (Val : in out Integer) is
begin
null;
end Do_Nothing;
end Pck;
|
-- SPDX-FileCopyrightText: 2019 Max Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
with Program.Elements.Defining_Identifiers;
with Program.Lexical_Elements;
with Program.Elements.Expressions;
with Program.Elements.Aspect_Specifications;
with Program.Elements.Exception_Renaming_Declarations;
with Program.Element_Visitors;
package Program.Nodes.Exception_Renaming_Declarations is
pragma Preelaborate;
type Exception_Renaming_Declaration is
new Program.Nodes.Node
and Program.Elements.Exception_Renaming_Declarations
.Exception_Renaming_Declaration
and Program.Elements.Exception_Renaming_Declarations
.Exception_Renaming_Declaration_Text
with private;
function Create
(Names : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Vector_Access;
Colon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Exception_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Renames_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Renamed_Exception : not null Program.Elements.Expressions
.Expression_Access;
With_Token : Program.Lexical_Elements.Lexical_Element_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Semicolon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access)
return Exception_Renaming_Declaration;
type Implicit_Exception_Renaming_Declaration is
new Program.Nodes.Node
and Program.Elements.Exception_Renaming_Declarations
.Exception_Renaming_Declaration
with private;
function Create
(Names : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Vector_Access;
Renamed_Exception : not null Program.Elements.Expressions
.Expression_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_Exception_Renaming_Declaration
with Pre =>
Is_Part_Of_Implicit or Is_Part_Of_Inherited or Is_Part_Of_Instance;
private
type Base_Exception_Renaming_Declaration is
abstract new Program.Nodes.Node
and Program.Elements.Exception_Renaming_Declarations
.Exception_Renaming_Declaration
with record
Names : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Vector_Access;
Renamed_Exception : not null Program.Elements.Expressions
.Expression_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
end record;
procedure Initialize
(Self : in out Base_Exception_Renaming_Declaration'Class);
overriding procedure Visit
(Self : not null access Base_Exception_Renaming_Declaration;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class);
overriding function Names
(Self : Base_Exception_Renaming_Declaration)
return not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Vector_Access;
overriding function Renamed_Exception
(Self : Base_Exception_Renaming_Declaration)
return not null Program.Elements.Expressions.Expression_Access;
overriding function Aspects
(Self : Base_Exception_Renaming_Declaration)
return Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
overriding function Is_Exception_Renaming_Declaration
(Self : Base_Exception_Renaming_Declaration)
return Boolean;
overriding function Is_Declaration
(Self : Base_Exception_Renaming_Declaration)
return Boolean;
type Exception_Renaming_Declaration is
new Base_Exception_Renaming_Declaration
and Program.Elements.Exception_Renaming_Declarations
.Exception_Renaming_Declaration_Text
with record
Colon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Exception_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Renames_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
With_Token : Program.Lexical_Elements.Lexical_Element_Access;
Semicolon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
end record;
overriding function To_Exception_Renaming_Declaration_Text
(Self : in out Exception_Renaming_Declaration)
return Program.Elements.Exception_Renaming_Declarations
.Exception_Renaming_Declaration_Text_Access;
overriding function Colon_Token
(Self : Exception_Renaming_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function Exception_Token
(Self : Exception_Renaming_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function Renames_Token
(Self : Exception_Renaming_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function With_Token
(Self : Exception_Renaming_Declaration)
return Program.Lexical_Elements.Lexical_Element_Access;
overriding function Semicolon_Token
(Self : Exception_Renaming_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access;
type Implicit_Exception_Renaming_Declaration is
new Base_Exception_Renaming_Declaration
with record
Is_Part_Of_Implicit : Boolean;
Is_Part_Of_Inherited : Boolean;
Is_Part_Of_Instance : Boolean;
end record;
overriding function To_Exception_Renaming_Declaration_Text
(Self : in out Implicit_Exception_Renaming_Declaration)
return Program.Elements.Exception_Renaming_Declarations
.Exception_Renaming_Declaration_Text_Access;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Exception_Renaming_Declaration)
return Boolean;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Exception_Renaming_Declaration)
return Boolean;
overriding function Is_Part_Of_Instance
(Self : Implicit_Exception_Renaming_Declaration)
return Boolean;
end Program.Nodes.Exception_Renaming_Declarations;
|
------------------------------------------------------------------------------
-- host.adb
--
-- Implementation of the host.
------------------------------------------------------------------------------
with Chopsticks, Cooks, Reporter;
use Chopsticks, Cooks, Reporter;
package body Host is
task body Norman_Bates is
-- Here is a variable to keep track of the number of empty seats.
-- Initially all seats are empty, so the number of empty seats is
-- the actual number of seats we have, which is equal to the number
-- of chopsticks, i.e. the number of elements in Chopstick_Array.
Number_Of_Empty_Seats: Natural := Chopstick_Array'Length;
-- Here is a variable to keep track of the number of living philosophers.
-- Initially all philosophers are alive, so the number of living
-- philosophers is equal to the number of total philosophers, which
-- is the same as the number of initially empty seats.
Number_Of_Living_Philosophers: Natural := Number_Of_Empty_Seats;
begin
Report ("The host is coming to life");
-- Loop around, doing host things:
loop
select
accept Leave do
Number_Of_Empty_Seats := Number_Of_Empty_Seats + 1;
end Leave;
or
when (Number_Of_Empty_Seats >= 2) =>
accept Enter do
Number_Of_Empty_Seats := Number_Of_Empty_Seats - 1;
end Enter;
or
accept Death_Announcement;
Number_Of_Living_Philosophers := Number_Of_Living_Philosophers - 1;
exit when Number_Of_Living_Philosophers = 0;
end select;
end loop;
-- Fire all the cooks:
for I in Cook_Array'Range loop
Cook_Array(I).Pink_Slip;
end loop;
end Norman_Bates;
end Host;
|
------------------------------------------------------------------------------
-- Copyright (c) 2014-2016, Natacha Porté --
-- --
-- Permission to use, copy, modify, and distribute this software for any --
-- purpose with or without fee is hereby granted, provided that the above --
-- copyright notice and this permission notice appear in all copies. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES --
-- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF --
-- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR --
-- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES --
-- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN --
-- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF --
-- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. --
------------------------------------------------------------------------------
with Ada.Command_Line;
with Ada.Text_IO;
with AWS.Config;
with AWS.Server;
with Syslog.Guess.App_Name;
with Syslog.Guess.Hostname;
with Syslog.Transport.Send_Task;
with Syslog.Transport.UDP;
with Simple_Webapps.Append_Servers;
procedure Append_Server is
WS : AWS.Server.HTTP;
Handler : Simple_Webapps.Append_Servers.Handler;
Debug : constant Boolean := Ada.Command_Line.Argument_Count >= 2;
begin
if Debug then
Simple_Webapps.Append_Servers.Log := Ada.Text_IO.Put_Line'Access;
else
Syslog.Guess.App_Name;
Syslog.Guess.Hostname;
Syslog.Transport.UDP.Connect ("127.0.0.1");
Syslog.Transport.Send_Task.Set_Backend (Syslog.Transport.UDP.Transport);
Syslog.Set_Transport (Syslog.Transport.Send_Task.Transport);
Syslog.Set_Default_Facility (Syslog.Facilities.Daemon);
Syslog.Set_Default_Severity (Syslog.Severities.Notice);
Simple_Webapps.Append_Servers.Log := Syslog.Log'Access;
end if;
if Ada.Command_Line.Argument_Count >= 1 then
Handler.Reset (Ada.Command_Line.Argument (1));
else
Handler.Reset ("append.sx");
end if;
AWS.Server.Start (WS, Handler, AWS.Config.Get_Current);
if Debug then
Ada.Text_IO.Put_Line ("Websever started");
AWS.Server.Wait (AWS.Server.Q_Key_Pressed);
else
AWS.Server.Wait;
end if;
AWS.Server.Shutdown (WS);
end Append_Server;
|
with Ada.Containers.Vectors;
with WPs;
with Partners;
package Projects is
use type WPs.WP_Type;
use type Partners.Partner_Type;
package WP_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => WPs.WP_Type);
package Partner_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => Partners.Partner_Type);
type Project_Type is
record
Partner_List : Partner_Vectors.Vector;
WP_List : WP_Vectors.Vector;
end record;
end Projects;
|
------------------------------------------------------------------------------
-- G E L A A S I S --
-- ASIS implementation for Gela project, a portable Ada compiler --
-- http://gela.ada-ru.org --
-- - - - - - - - - - - - - - - - --
-- Read copyright and license at the end of this file --
------------------------------------------------------------------------------
-- $Revision: 209 $ $Date: 2013-11-30 21:03:24 +0200 (Сб., 30 нояб. 2013) $
with Ada.Strings.Unbounded;
package Gramar_Items is
-------------
-- Wrapper --
-------------
type Wrapper is private;
function Node_Name (Object : Wrapper) return String;
function Parent (Object : Wrapper) return Wrapper;
function Item_Index (Object : Wrapper) return Natural;
function Object_Name (Object : Wrapper) return String;
function User_Attr_Name (Object : Wrapper) return String;
function Top (Object : Wrapper) return Boolean;
function Position (Object : Wrapper) return String;
function Wrapper_Index (Object : Wrapper) return Natural;
----------
-- Item --
----------
type Item is abstract tagged limited private;
type Item_Ptr is access all Item'Class;
function Item_Name (Object : Item) return String is abstract;
function Node_Name (Object : Item) return String;
function User_Attr (Object : Item) return String;
function Choise (Object : Item) return String;
function Parent (Object : Item) return Wrapper;
function Create_Node (Object : Item) return String;
function Trait_Name (Object : Item) return String;
function Value (Object : Item) return String;
--------------
-- Sequence --
--------------
type Sequence is private;
function Count (Item : Sequence) return Natural;
function Get_Item
(Object : Sequence;
Index : Positive)
return Item_Ptr;
function Pass_Through (Item : Sequence) return Boolean;
function Node_Name (Item : Sequence) return String;
function Infix (Item : Sequence) return String;
function True_Node (Item : Sequence) return String;
function False_Node (Item : Sequence) return String;
function Find_First_Reference (Item : Sequence) return Natural;
function Find_First_List (Item : Sequence) return Natural;
function Choise_Item_Index (Item : Sequence) return Natural;
function Rule_Name (Seq : Sequence) return String;
function Is_Item_And_List (Seq : Sequence) return Boolean;
function Item_Of_List_Index (Seq : Sequence) return Natural;
function List_For_Item_Index (Seq : Sequence) return Natural;
function Wrap_Count (Item : Sequence) return Natural;
function Get_Wrapper
(Seq : Sequence;
Index : Positive) return Wrapper;
----------
-- Rule --
----------
type Rule is private;
function Name (Item : Rule) return String;
function Count (Item : Rule) return Natural;
function Get_Alternative
(Item : Rule;
Index : Positive)
return Sequence;
function Node_Name (Item : Rule) return String;
---------------
-- Reference --
---------------
type Reference is new Item with private;
function Name (Item : Reference) return String;
function Is_Token (Item : Reference) return Boolean;
function Item_Name (Object : Reference) return String;
function Node_Name (Object : Reference) return String;
----------
-- Body --
----------
type Option is new Item with private;
function Items
(Item : Option;
Index : Positive := 1) return Sequence;
function Count (Item : Option) return Natural;
function Separate_Option (Item : Option) return Boolean;
function Inline_Option (Item : Option) return Boolean;
function Item_Name (Object : Option) return String;
function Node_Name (Object : Option) return String;
function Alternative_Node_Name (Item : Option) return String;
----------
-- List --
----------
type List is new Item with private;
function Items (Item : List) return Sequence;
function Item_Name (Object : List) return String;
function Node_Name (Object : List) return String;
function List_Item_Node_Name (Object : List) return String;
-------------
-- Keyword --
-------------
type Keyword is new Item with private;
function Item_Name (Object : Keyword) return String;
function Text (Item : Keyword) return String;
---------------
-- Delimiter --
---------------
type Delimiter is new Item with private;
function Item_Name (Object : Delimiter) return String;
function Text (Item : Delimiter) return String;
procedure Read_File (Name : String);
function Rule_Count return Natural;
function Get_Rule (Index : Positive) return Rule;
function Get_Rule (Name : String) return Rule;
Not_Found : exception;
function To_String (X : Natural) return String;
private
use Ada.Strings.Unbounded;
type Rule_Node;
type Rule is access all Rule_Node'Class;
type Sequence_Node;
type Sequence is access all Sequence_Node'Class;
type Item is abstract tagged limited record
Next : Item_Ptr;
Parent : Sequence;
Instance : Positive := 1;
end record;
procedure Set_Sequence
(Object : in out Item;
Child : in Sequence);
type Reference is new Item with record
Name : Unbounded_String;
Is_Token : Boolean := False;
end record;
type Option_Node;
type Option_Node_Ptr is access all Option_Node;
type Option is new Item with record
Node : Option_Node_Ptr;
end record;
procedure Set_Sequence
(Object : in out Option;
Child : in Sequence);
type List is new Item with record
Items : Sequence;
end record;
procedure Set_Sequence
(Object : in out List;
Child : in Sequence);
type Keyword is new Item with record
Text : Unbounded_String;
end record;
type Delimiter is new Item with record
Text : Unbounded_String;
end record;
type Wrapper is record
Node_Name : Unbounded_String;
Attr_Name : Unbounded_String;
Object_Name : Unbounded_String;
Position : Unbounded_String;
Parent : Natural;
Item_Index : Natural;
Seq : Sequence;
Index : Natural;
end record;
end Gramar_Items;
------------------------------------------------------------------------------
-- Copyright (c) 2006, Maxim Reznik
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
--
-- * Redistributions of source code must retain the above copyright notice,
-- this list of conditions and the following disclaimer.
-- * Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
-- * Neither the name of the Maxim Reznik, IE nor the names of its
-- contributors may be used to endorse or promote products derived from
-- this software without specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
-- LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
-- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-- POSSIBILITY OF SUCH DAMAGE.
------------------------------------------------------------------------------
|
-- Copyright 2017 Jeff Foley. All rights reserved.
-- Use of this source code is governed by Apache 2 LICENSE that can be found in the LICENSE file.
local json = require("json")
name = "Chaos"
type = "api"
function start()
setratelimit(10)
end
function check()
local c
local cfg = datasrc_config()
if cfg ~= nil then
c = cfg.credentials
end
if (c ~= nil and c.key ~= nil and c.key ~= "") then
return true
end
return false
end
function vertical(ctx, domain)
if check() then
apiquery(ctx, domain)
end
end
function apiquery(ctx, domain)
local c
local cfg = datasrc_config()
if cfg ~= nil then
c = cfg.credentials
end
local resp
local vurl = apiurl(domain)
-- Check if the response data is in the graph database
if (cfg.ttl ~= nil and cfg.ttl > 0) then
resp = obtain_response(domain, cfg.ttl)
end
if (resp == nil or resp == "") then
local err
resp, err = request({
url=vurl,
headers={['Authorization']=c["key"]},
})
if (err ~= nil and err ~= "") then
return
end
if (cfg.ttl ~= nil and cfg.ttl > 0) then
cache_response(domain, resp)
end
end
local d = json.decode(resp)
if (d == nil or #(d.subdomains) == 0) then
return
end
for i, sub in pairs(d.subdomains) do
newname(ctx, sub .. "." .. d.domain)
end
end
function apiurl(domain)
return "https://dns.projectdiscovery.io/dns/" .. domain .. "/subdomains"
end
|
-------------------------------------------------------------------------------
-- This file is part of libsparkcrypto.
--
-- Copyright (C) 2010, Alexander Senier
-- Copyright (C) 2010, secunet Security Networks AG
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
--
-- * Redistributions of source code must retain the above copyright notice,
-- this list of conditions and the following disclaimer.
--
-- * Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
--
-- * Neither the name of the nor the names of its contributors may be used
-- to endorse or promote products derived from this software without
-- specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS
-- BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
-- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-- POSSIBILITY OF SUCH DAMAGE.
-------------------------------------------------------------------------------
with LSC.Internal.Types;
with LSC.Internal.RIPEMD160;
with LSC.Internal.HMAC_RIPEMD160;
with LSC.Internal.SHA1;
with LSC.Internal.HMAC_SHA1;
with LSC.Internal.SHA256;
with LSC.Internal.HMAC_SHA256;
with LSC.Internal.SHA512;
with LSC.Internal.HMAC_SHA384;
with LSC.Internal.HMAC_SHA512;
with AUnit.Assertions; use AUnit.Assertions;
with Util; use Util;
with Interfaces;
use type LSC.Internal.Types.Word32_Array_Type;
use type LSC.Internal.Types.Word64_Array_Type;
use type Interfaces.Unsigned_64;
use type LSC.Internal.SHA256.Message_Index;
use type LSC.Internal.SHA512.Message_Index;
pragma Style_Checks ("-s");
pragma Warnings (Off, "formal parameter ""T"" is not referenced");
package body LSC_Internal_Test_HMAC
is
-- RIPEMD160 Test Vectors (RFC 2286, 2.)
procedure Test_RIPEMD160_Auth_1 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.Types.Word64 range 1 .. 1;
subtype Message_Type is LSC.Internal.RIPEMD160.Message_Type (Message_Index);
Key : LSC.Internal.RIPEMD160.Block_Type;
Message : Message_Type;
begin
Key := LSC.Internal.RIPEMD160.Block_Type'
(M (16#0b0b0b0b#), M (16#0b0b0b0b#), M (16#0b0b0b0b#),
M (16#0b0b0b0b#), M (16#0b0b0b0b#), others => 0);
-- "Hi There"
Message := Message_Type'(1 => LSC.Internal.RIPEMD160.Block_Type'
(M (16#48692054#), M (16#68657265#), others => 0));
Assert
(LSC.Internal.HMAC_RIPEMD160.Authenticate (Key, Message, 64) =
LSC.Internal.RIPEMD160.Hash_Type'
(M (16#24cb4bd6#), M (16#7d20fc1a#), M (16#5d2ed773#),
M (16#2dcc3937#), M (16#7f0a5668#)),
"Invalid HMAC");
end Test_RIPEMD160_Auth_1;
---------------------------------------------------------------------------
procedure Test_RIPEMD160_Auth_2 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.Types.Word64 range 1 .. 1;
subtype Message_Type is LSC.Internal.RIPEMD160.Message_Type (Message_Index);
Key : LSC.Internal.RIPEMD160.Block_Type;
Message : Message_Type;
begin
-- "Jefe"
Key := LSC.Internal.RIPEMD160.Block_Type'
(M (16#4a656665#), others => 0);
-- "what do ya want "
-- "for nothing?"
Message := Message_Type'(1 => LSC.Internal.RIPEMD160.Block_Type'
(M (16#77686174#), M (16#20646f20#), M (16#79612077#), M (16#616e7420#),
M (16#666f7220#), M (16#6e6f7468#), M (16#696e673f#), others => 0));
Assert
(LSC.Internal.HMAC_RIPEMD160.Authenticate (Key, Message, 224) =
LSC.Internal.RIPEMD160.Hash_Type'
(M (16#dda6c021#), M (16#3a485a9e#), M (16#24f47420#),
M (16#64a7f033#), M (16#b43c4069#)),
"Invalid HMAC");
end Test_RIPEMD160_Auth_2;
---------------------------------------------------------------------------
procedure Test_RIPEMD160_Auth_3 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.Types.Word64 range 1 .. 1;
subtype Message_Type is LSC.Internal.RIPEMD160.Message_Type (Message_Index);
Key : LSC.Internal.RIPEMD160.Block_Type;
Message : Message_Type;
begin
-- 20 times 16#aa#
Key := LSC.Internal.RIPEMD160.Block_Type'
(M (16#aaaaaaaa#), M (16#aaaaaaaa#), M (16#aaaaaaaa#),
M (16#aaaaaaaa#), M (16#aaaaaaaa#), others => 0);
-- 50 times 16#dd#
Message := Message_Type'(1 => LSC.Internal.RIPEMD160.Block_Type'
(M (16#dddddddd#), M (16#dddddddd#), M (16#dddddddd#),
M (16#dddddddd#), M (16#dddddddd#), M (16#dddddddd#),
M (16#dddddddd#), M (16#dddddddd#), M (16#dddddddd#),
M (16#dddddddd#), M (16#dddddddd#), M (16#dddddddd#),
M (16#dddd0000#), others => 0));
Assert
(LSC.Internal.HMAC_RIPEMD160.Authenticate (Key, Message, 400) =
LSC.Internal.RIPEMD160.Hash_Type'
(M (16#b0b10536#), M (16#0de75996#), M (16#0ab4f352#),
M (16#98e116e2#), M (16#95d8e7c1#)),
"Invalid HMAC");
end Test_RIPEMD160_Auth_3;
---------------------------------------------------------------------------
procedure Test_RIPEMD160_Auth_4 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.Types.Word64 range 1 .. 1;
subtype Message_Type is LSC.Internal.RIPEMD160.Message_Type (Message_Index);
Key : LSC.Internal.RIPEMD160.Block_Type;
Message : Message_Type;
begin
Key := LSC.Internal.RIPEMD160.Block_Type'
(M (16#01020304#), M (16#05060708#), M (16#090a0b0c#),
M (16#0d0e0f10#), M (16#11121314#), M (16#15161718#),
M (16#19000000#), others => 0);
-- 50 times 16#cd#
Message := Message_Type'(1 => LSC.Internal.RIPEMD160.Block_Type'
(M (16#cdcdcdcd#), M (16#cdcdcdcd#), M (16#cdcdcdcd#),
M (16#cdcdcdcd#), M (16#cdcdcdcd#), M (16#cdcdcdcd#),
M (16#cdcdcdcd#), M (16#cdcdcdcd#), M (16#cdcdcdcd#),
M (16#cdcdcdcd#), M (16#cdcdcdcd#), M (16#cdcdcdcd#),
M (16#cdcd0000#), others => 0));
Assert
(LSC.Internal.HMAC_RIPEMD160.Authenticate (Key, Message, 400) =
LSC.Internal.RIPEMD160.Hash_Type'
(M (16#d5ca862f#), M (16#4d21d5e6#), M (16#10e18b4c#),
M (16#f1beb97a#), M (16#4365ecf4#)),
"Invalid HMAC");
end Test_RIPEMD160_Auth_4;
---------------------------------------------------------------------------
procedure Test_RIPEMD160_Multi_1 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.Types.Word64 range 1 .. 4;
subtype Message_Type is LSC.Internal.RIPEMD160.Message_Type (Message_Index);
Key : LSC.Internal.RIPEMD160.Block_Type;
Message : Message_Type;
begin
-- hmac_rmd160-key-1.dat
Key := LSC.Internal.RIPEMD160.Block_Type'(
M (16#eede4910#), M (16#ebbc6f5c#), M (16#13f5971b#), M (16#5466e1a6#),
M (16#5b10e6d1#), M (16#f8c28abd#), M (16#77b061f0#), M (16#ac52cd4c#),
M (16#77b9782d#), M (16#ddec2f46#), M (16#bcf2ab2b#), M (16#61713fc4#),
M (16#2311c948#), M (16#41538d30#), M (16#6cb18b1f#), M (16#19a48dc5#)
);
-- hmac_rmd160-message-1.dat
Message := Message_Type'(
LSC.Internal.RIPEMD160.Block_Type'(
M (16#7ac96141#), M (16#3578af90#), M (16#342cbbf4#), M (16#b3c969cd#),
M (16#5cc9ae0b#), M (16#6897d4b7#), M (16#611fb575#), M (16#ac5e772b#),
M (16#95c35b19#), M (16#6ba0b47c#), M (16#4f890b07#), M (16#ceaa2938#),
M (16#4d4a1b3e#), M (16#87b29344#), M (16#b4be72bc#), M (16#a89f215f#)),
LSC.Internal.RIPEMD160.Block_Type'(
M (16#074816cd#), M (16#dbaf41db#), M (16#163c5429#), M (16#d161b3a0#),
M (16#0df99630#), M (16#e3e14ad2#), M (16#b78d1632#), M (16#2e203dfd#),
M (16#f5c3dc40#), M (16#c5ded149#), M (16#7b5f13c3#), M (16#74e4877d#),
M (16#33a7056a#), M (16#e5ce2e63#), M (16#24242f05#), M (16#e6608f12#)),
LSC.Internal.RIPEMD160.Block_Type'(
M (16#d49f4944#), M (16#e92d9d12#), M (16#0bdbdc9a#), M (16#66d9addf#),
M (16#e070afdc#), M (16#45e785a8#), M (16#fbe7d19f#), M (16#613ec8ae#),
M (16#caa2b668#), M (16#e9c16996#), M (16#07328ab7#), M (16#7bc64bf0#),
M (16#c31f2d9a#), M (16#39325c03#), M (16#0c7dc101#), M (16#55217a05#)),
LSC.Internal.RIPEMD160.Block_Type'(
M (16#1ef4027e#), M (16#b6df5137#), M (16#4bc3915f#), M (16#417e78d3#),
M (16#82d63ed8#), M (16#2350c1c3#), M (16#f424e6fe#), M (16#66c16737#),
M (16#7630d2cc#), M (16#436f532d#), M (16#3c5d4716#), M (16#0e94a05f#),
M (16#1941214e#), M (16#857fa0e9#), M (16#0e0e6855#), M (16#3afd24bc#))
);
-- hmac_rmd160-hash-1.dat
Assert
(LSC.Internal.HMAC_RIPEMD160.Authenticate (Key, Message, 2048) =
LSC.Internal.RIPEMD160.Hash_Type'(
M (16#34c25afc#), M (16#15a81bf8#), M (16#e48c2dce#), M (16#a1063014#), M (16#f49df262#)),
"Invalid HMAC");
end Test_RIPEMD160_Multi_1;
---------------------------------------------------------------------------
procedure Test_RIPEMD160_Multi_2 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.Types.Word64 range 1 .. 5;
subtype Message_Type is LSC.Internal.RIPEMD160.Message_Type (Message_Index);
Key : LSC.Internal.RIPEMD160.Block_Type;
Message : Message_Type;
begin
-- hmac_rmd160-key-2.dat
Key := LSC.Internal.RIPEMD160.Block_Type'(
M (16#743c9034#), M (16#2c3a5238#), M (16#8644ea5c#), M (16#3f32e614#),
M (16#f13e2e3f#), M (16#926810b0#), M (16#2dc2f006#), M (16#94c2cc93#),
M (16#683bf052#), M (16#f738ad4d#), M (16#a9602089#), M (16#2e18dcdc#),
M (16#03b04969#), M (16#6b9b0d1a#), M (16#5ce0dea4#), M (16#0f1b4e37#)
);
-- hmac_rmd160-message-2.dat
Message := Message_Type'(
LSC.Internal.RIPEMD160.Block_Type'(
M (16#ffe452a1#), M (16#0731bc87#), M (16#ac159b32#), M (16#5375a1a7#),
M (16#05d2111d#), M (16#bf223453#), M (16#017fdc94#), M (16#8ce6e07d#),
M (16#b736d511#), M (16#b3e01d21#), M (16#251776ed#), M (16#02930c5e#),
M (16#96ef4c81#), M (16#c39826e9#), M (16#60f867e6#), M (16#5afb8b45#)),
LSC.Internal.RIPEMD160.Block_Type'(
M (16#4b6d4e48#), M (16#e55e9054#), M (16#935397fd#), M (16#d0fbbf89#),
M (16#7ed6daba#), M (16#a7fc214a#), M (16#e4f1c189#), M (16#03c433bc#),
M (16#f20c5b77#), M (16#2a8f56a4#), M (16#ca9e272b#), M (16#fe75f074#),
M (16#dd39ab22#), M (16#9d944afd#), M (16#31b978e0#), M (16#4a6f6d42#)),
LSC.Internal.RIPEMD160.Block_Type'(
M (16#7cfc8649#), M (16#93b6ac91#), M (16#d8b683f7#), M (16#fad79a16#),
M (16#2d419e85#), M (16#4e689a11#), M (16#9d607cc0#), M (16#2566375c#),
M (16#e09ddd31#), M (16#2f050280#), M (16#ea5f5430#), M (16#cc3714d4#),
M (16#9f069a44#), M (16#d7a2586d#), M (16#b16fce42#), M (16#fbc44cb6#)),
LSC.Internal.RIPEMD160.Block_Type'(
M (16#cf071d0b#), M (16#c1ce2727#), M (16#c44d8690#), M (16#60a75590#),
M (16#d6036c1f#), M (16#c11bed8a#), M (16#537db307#), M (16#f05294ef#),
M (16#c04807b0#), M (16#22f5b0a9#), M (16#dbb4bf72#), M (16#75483e79#),
M (16#0d26bbb3#), M (16#ff7120ef#), M (16#224211e9#), M (16#686c8225#)),
LSC.Internal.RIPEMD160.Block_Type'(
M (16#dabc5b28#), M (16#7ce93ba1#), M (16#d67b9456#), M (16#91a651a3#),
M (16#c3fe81ff#), M (16#db0334e6#), M (16#9863e388#), M (16#0ab3f5e0#),
M (16#a90b747b#), M (16#724387d8#), M (16#8abd6511#), M (16#c689e47f#),
M (16#c521396b#), M (16#9e21ed74#), others => 0)
);
-- hmac_rmd160-hash-2.dat
Assert
(LSC.Internal.HMAC_RIPEMD160.Authenticate (Key, Message, 2048 + 448) =
LSC.Internal.RIPEMD160.Hash_Type'(
M (16#8d6bf378#), M (16#22d7812d#), M (16#acc4aa1a#), M (16#86e280a0#), M (16#e43bbd38#)),
"Invalid HMAC");
end Test_RIPEMD160_Multi_2;
---------------------------------------------------------------------------
-- SHA1 Test Vectors (RFC 2202, 3.)
procedure Test_SHA1_Auth_1 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.Types.Word64 range 1 .. 1;
subtype Message_Type is LSC.Internal.SHA1.Message_Type (Message_Index);
Key : LSC.Internal.SHA1.Block_Type;
Message : Message_Type;
begin
Key := LSC.Internal.SHA1.Block_Type'
(M (16#0b0b0b0b#), M (16#0b0b0b0b#), M (16#0b0b0b0b#), M (16#0b0b0b0b#),
M (16#0b0b0b0b#), others => 0);
-- "Hi There"
Message := Message_Type'
(1 => LSC.Internal.SHA1.Block_Type'
(M (16#48692054#), M (16#68657265#), others => 0));
Assert
(LSC.Internal.HMAC_SHA1.Authenticate (Key, Message, 64) =
LSC.Internal.SHA1.Hash_Type'
(M (16#b6173186#), M (16#55057264#), M (16#e28bc0b6#),
M (16#fb378c8e#), M (16#f146be00#)),
"Invalid HMAC");
end Test_SHA1_Auth_1;
---------------------------------------------------------------------------
procedure Test_SHA1_Auth_2 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.Types.Word64 range 1 .. 1;
subtype Message_Type is LSC.Internal.SHA1.Message_Type (Message_Index);
Key : LSC.Internal.SHA1.Block_Type;
Message : Message_Type;
begin
-- "Jefe"
Key := LSC.Internal.SHA1.Block_Type'(M (16#4a656665#), others => 0);
-- "what do ya want for nothing?"
Message := Message_Type'
(1 => LSC.Internal.SHA1.Block_Type'
(M (16#77686174#), M (16#20646f20#), M (16#79612077#), M (16#616e7420#),
M (16#666f7220#), M (16#6e6f7468#), M (16#696e673f#), others => 0));
Assert
(LSC.Internal.HMAC_SHA1.Authenticate (Key, Message, 224) =
LSC.Internal.SHA1.Hash_Type'
(M (16#effcdf6a#), M (16#e5eb2fa2#), M (16#d27416d5#),
M (16#f184df9c#), M (16#259a7c79#)),
"Invalid HMAC");
end Test_SHA1_Auth_2;
---------------------------------------------------------------------------
procedure Test_SHA1_Auth_3 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.Types.Word64 range 1 .. 1;
subtype Message_Type is LSC.Internal.SHA1.Message_Type (Message_Index);
Key : LSC.Internal.SHA1.Block_Type;
Message : Message_Type;
begin
-- 20 times 16#aa#
Key := LSC.Internal.SHA1.Block_Type'
(M (16#aaaaaaaa#), M (16#aaaaaaaa#), M (16#aaaaaaaa#), M (16#aaaaaaaa#),
M (16#aaaaaaaa#), others => 0);
-- 50 times 16#dd#
Message := Message_Type'
(1 => LSC.Internal.SHA1.Block_Type'
(M (16#dddddddd#), M (16#dddddddd#), M (16#dddddddd#), M (16#dddddddd#),
M (16#dddddddd#), M (16#dddddddd#), M (16#dddddddd#), M (16#dddddddd#),
M (16#dddddddd#), M (16#dddddddd#), M (16#dddddddd#), M (16#dddddddd#),
M (16#dddd0000#), others => 0));
Assert
(LSC.Internal.HMAC_SHA1.Authenticate (Key, Message, 400) =
LSC.Internal.SHA1.Hash_Type'
(M (16#125d7342#), M (16#b9ac11cd#), M (16#91a39af4#),
M (16#8aa17b4f#), M (16#63f175d3#)),
"Invalid Hash");
end Test_SHA1_Auth_3;
---------------------------------------------------------------------------
procedure Test_SHA1_Auth_4 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.Types.Word64 range 1 .. 1;
subtype Message_Type is LSC.Internal.SHA1.Message_Type (Message_Index);
Key : LSC.Internal.SHA1.Block_Type;
Message : Message_Type;
begin
-- 0x0102030405060708090a0b0c0d0e0f10111213141516171819
Key := LSC.Internal.SHA1.Block_Type'
(M (16#01020304#), M (16#05060708#), M (16#090a0b0c#), M (16#0d0e0f10#),
M (16#11121314#), M (16#15161718#), M (16#19000000#), others => 0);
-- 50 times 16#cd#
Message := Message_Type'
(1 => LSC.Internal.SHA1.Block_Type'
(M (16#cdcdcdcd#), M (16#cdcdcdcd#), M (16#cdcdcdcd#), M (16#cdcdcdcd#),
M (16#cdcdcdcd#), M (16#cdcdcdcd#), M (16#cdcdcdcd#), M (16#cdcdcdcd#),
M (16#cdcdcdcd#), M (16#cdcdcdcd#), M (16#cdcdcdcd#), M (16#cdcdcdcd#),
M (16#cdcd0000#), others => 0));
Assert
(LSC.Internal.HMAC_SHA1.Authenticate (Key, Message, 400) =
LSC.Internal.SHA1.Hash_Type'
(M (16#4c9007f4#), M (16#026250c6#), M (16#bc8414f9#),
M (16#bf50c86c#), M (16#2d7235da#)),
"Invalid HMAC");
end Test_SHA1_Auth_4;
---------------------------------------------------------------------------
procedure Test_SHA1_Auth_5 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.Types.Word64 range 1 .. 1;
subtype Message_Type is LSC.Internal.SHA1.Message_Type (Message_Index);
Key : LSC.Internal.SHA1.Block_Type;
Message : Message_Type;
begin
-- 0x0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c
Key := LSC.Internal.SHA1.Block_Type'
(M (16#0c0c0c0c#), M (16#0c0c0c0c#), M (16#0c0c0c0c#), M (16#0c0c0c0c#),
M (16#0c0c0c0c#), others => 0);
-- "Test With Truncation"
Message := Message_Type'
(1 => LSC.Internal.SHA1.Block_Type'
(M (16#54657374#), M (16#20576974#), M (16#68205472#), M (16#756e6361#),
M (16#74696f6e#), others => 0));
Assert
(LSC.Internal.HMAC_SHA1.Authenticate (Key, Message, 160) =
LSC.Internal.SHA1.Hash_Type'
(M (16#4c1a0342#), M (16#4b55e07f#), M (16#e7f27be1#),
M (16#d58bb932#), M (16#4a9a5a04#)),
"Invalid HMAC");
end Test_SHA1_Auth_5;
---------------------------------------------------------------------------
procedure Test_SHA1_Multi_1 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.Types.Word64 range 1 .. 4;
subtype Message_Type is LSC.Internal.SHA1.Message_Type (Message_Index);
Key : LSC.Internal.SHA1.Block_Type;
Message : Message_Type;
begin
-- hmac_sha1-key-1.dat
Key := LSC.Internal.SHA1.Block_Type'
(M (16#07a55659#), M (16#e5e382f2#), M (16#a12610e0#), M (16#8926b665#),
M (16#43122a4e#), M (16#c2dc3c09#), M (16#8261de1f#), M (16#3f2ae412#),
M (16#7e19048e#), M (16#7cee69bc#), M (16#43f8283e#), M (16#86b48781#),
M (16#ca18e81c#), M (16#422f70e3#), M (16#52062553#), M (16#ff11c406#));
-- hmac_sha1-message-1.dat
Message := Message_Type'
(LSC.Internal.SHA1.Block_Type'
(M (16#b88457a3#), M (16#9d9346c9#), M (16#9698c202#), M (16#c45572f7#),
M (16#4ccff08d#), M (16#c311f906#), M (16#c8dbfa88#), M (16#57f2220b#),
M (16#70d29fb8#), M (16#689ca8c1#), M (16#7a907974#), M (16#c7c09dcf#),
M (16#15357d16#), M (16#36103db1#), M (16#0618739c#), M (16#cddcd890#)),
LSC.Internal.SHA1.Block_Type'
(M (16#6946c864#), M (16#b3bae1f4#), M (16#60d1e64f#), M (16#ee07a9c7#),
M (16#119e06ed#), M (16#d5ff9753#), M (16#b237b06a#), M (16#4ecc8000#),
M (16#430389cc#), M (16#0114af02#), M (16#2ed4714e#), M (16#5ba051de#),
M (16#c852b7aa#), M (16#5799d4d0#), M (16#52121b4e#), M (16#67325a2f#)),
LSC.Internal.SHA1.Block_Type'
(M (16#7bb838f5#), M (16#2f3cbff1#), M (16#ae723f2d#), M (16#35abc721#),
M (16#74503c67#), M (16#9be8d95c#), M (16#60a7308f#), M (16#b21a0347#),
M (16#e099d848#), M (16#15a46a22#), M (16#a78112d1#), M (16#c5cbc2a4#),
M (16#376934e0#), M (16#337c8770#), M (16#24a440e3#), M (16#5e3a7349#)),
LSC.Internal.SHA1.Block_Type'
(M (16#a6232f33#), M (16#48130619#), M (16#30aba014#), M (16#c6400194#),
M (16#1546e5ab#), M (16#50d98fe5#), M (16#3700f966#), M (16#982eaf6a#),
M (16#65ef70de#), M (16#6b5f9d6c#), M (16#ec8c7a7e#), M (16#ff37f2ec#),
M (16#5cafcc39#), M (16#646132f3#), M (16#240e4811#), M (16#7f4db108#))
);
-- hmac_sha1-hash-1.dat
Assert
(LSC.Internal.HMAC_SHA1.Authenticate (Key, Message, 2048) =
LSC.Internal.SHA1.Hash_Type'(M (16#ec3b225b#), M (16#f28c53dc#),
M (16#e8bd8722#), M (16#f325d5b1#), M (16#691114c7#)),
"Invalid HMAC");
end Test_SHA1_Multi_1;
---------------------------------------------------------------------------
procedure Test_SHA1_Multi_2 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.Types.Word64 range 1 .. 5;
subtype Message_Type is LSC.Internal.SHA1.Message_Type (Message_Index);
Key : LSC.Internal.SHA1.Block_Type;
Message : Message_Type;
begin
-- hmac_sha1-key-2.dat
Key := LSC.Internal.SHA1.Block_Type'
(M (16#f05821b9#), M (16#94ab6613#), M (16#f7c5773f#), M (16#b2a2184f#),
M (16#9659daf3#), M (16#856a4a69#), M (16#245ba5f9#), M (16#7431d93f#),
M (16#697a494d#), M (16#8da7131b#), M (16#1a995683#), M (16#4b4592d0#),
M (16#c10b076b#), M (16#989278bc#), M (16#91fe184c#), M (16#84046614#));
-- hmac_sha1-message-2.dat
Message := Message_Type'
(LSC.Internal.SHA1.Block_Type'
(M (16#503ab855#), M (16#d8a04186#), M (16#484637e5#), M (16#38dd715f#),
M (16#ca6026bd#), M (16#a01a90d4#), M (16#3ac281e4#), M (16#cf626d63#),
M (16#cc6c49f0#), M (16#397cdc76#), M (16#db96736f#), M (16#4e0fd1e7#),
M (16#24b765e7#), M (16#83d7bd3b#), M (16#f20ebc24#), M (16#8e1c0eef#)),
LSC.Internal.SHA1.Block_Type'
(M (16#cc9b450e#), M (16#481ed2f3#), M (16#13c26f80#), M (16#57ae2910#),
M (16#b316e6ae#), M (16#580250b6#), M (16#57857881#), M (16#eb7e25e4#),
M (16#b7e64116#), M (16#ad0bb1d5#), M (16#b720b390#), M (16#8f1e47a1#),
M (16#65461c23#), M (16#46e282c8#), M (16#b4948e3e#), M (16#6c70c980#)),
LSC.Internal.SHA1.Block_Type'
(M (16#f7464750#), M (16#d18db4c2#), M (16#9a7db515#), M (16#e6212696#),
M (16#bf47e1e5#), M (16#3d1b5887#), M (16#82610dd8#), M (16#39e60cbf#),
M (16#efe360f8#), M (16#374b922d#), M (16#cae8bcee#), M (16#8eb7db21#),
M (16#cb13bccd#), M (16#d98284ec#), M (16#95896c3b#), M (16#30173471#)),
LSC.Internal.SHA1.Block_Type'
(M (16#64aa3093#), M (16#cacca160#), M (16#543e4b66#), M (16#f2dda6a2#),
M (16#4ed9d501#), M (16#5f60f27f#), M (16#7e966bb3#), M (16#df799512#),
M (16#cb379c89#), M (16#225e92b7#), M (16#54fc317e#), M (16#c6ee8ebe#),
M (16#ac522ea6#), M (16#2e89fa10#), M (16#40008689#), M (16#a375735f#)),
LSC.Internal.SHA1.Block_Type'
(M (16#c9c7e5e0#), M (16#1ec278ff#), M (16#d86271e4#), M (16#1ec69d9a#),
M (16#b94945db#), M (16#0efb7362#), M (16#2a6c72a6#), M (16#3e5f3880#),
M (16#7df8aa81#), M (16#c7393cc8#), M (16#4077af9a#), M (16#01c0adc4#),
M (16#3543e821#), M (16#f1dbd0a1#), others => 0)
);
-- hmac_sha1-hash-2.dat
Assert
(LSC.Internal.HMAC_SHA1.Authenticate (Key, Message, 2048 + 448) =
LSC.Internal.SHA1.Hash_Type'(M (16#f87e3f76#), M (16#92b5f83c#),
M (16#8f2f20bf#), M (16#8027d87e#), M (16#8b4cf783#)),
"Invalid HMAC");
end Test_SHA1_Multi_2;
---------------------------------------------------------------------------
procedure Test_SHA256_Prf_1 (T : in out Test_Cases.Test_Case'Class)
is
HMAC_Ctx : LSC.Internal.HMAC_SHA256.Context_Type;
Key : LSC.Internal.SHA256.Block_Type;
Block : LSC.Internal.SHA256.Block_Type;
PRF_HMAC_SHA_256 : LSC.Internal.SHA256.SHA256_Hash_Type;
begin
Key := LSC.Internal.SHA256.Block_Type'
(M (16#0b0b0b0b#), M (16#0b0b0b0b#), M (16#0b0b0b0b#),
M (16#0b0b0b0b#), M (16#0b0b0b0b#), others => 0);
-- "Hi There"
Block := LSC.Internal.SHA256.Block_Type'(M (16#48692054#),
M (16#68657265#),
others => 0);
HMAC_Ctx := LSC.Internal.HMAC_SHA256.Context_Init (Key);
LSC.Internal.HMAC_SHA256.Context_Finalize (HMAC_Ctx, Block, 64);
PRF_HMAC_SHA_256 := LSC.Internal.HMAC_SHA256.Get_Prf (HMAC_Ctx);
Assert
(PRF_HMAC_SHA_256 = LSC.Internal.SHA256.SHA256_Hash_Type'
(M (16#b0344c61#),
M (16#d8db3853#),
M (16#5ca8afce#),
M (16#af0bf12b#),
M (16#881dc200#),
M (16#c9833da7#),
M (16#26e9376c#),
M (16#2e32cff7#)),
"Invalid PRF");
end Test_SHA256_Prf_1;
---------------------------------------------------------------------------
procedure Test_SHA256_Prf_2 (T : in out Test_Cases.Test_Case'Class)
is
HMAC_Ctx : LSC.Internal.HMAC_SHA256.Context_Type;
Key : LSC.Internal.SHA256.Block_Type;
Block : LSC.Internal.SHA256.Block_Type;
PRF_HMAC_SHA_256 : LSC.Internal.SHA256.SHA256_Hash_Type;
begin
-- "Jefe"
Key := LSC.Internal.SHA256.Block_Type'
(M (16#4a656665#), others => 0);
-- "what do ya want "
-- "for nothing?"
Block := LSC.Internal.SHA256.Block_Type'
(M (16#77686174#), M (16#20646f20#), M (16#79612077#), M (16#616e7420#),
M (16#666f7220#), M (16#6e6f7468#), M (16#696e673f#), others => 0);
HMAC_Ctx := LSC.Internal.HMAC_SHA256.Context_Init (Key);
LSC.Internal.HMAC_SHA256.Context_Finalize (HMAC_Ctx, Block, 224);
PRF_HMAC_SHA_256 := LSC.Internal.HMAC_SHA256.Get_Prf (HMAC_Ctx);
Assert
(PRF_HMAC_SHA_256 =
LSC.Internal.SHA256.SHA256_Hash_Type'(M (16#5bdcc146#),
M (16#bf60754e#),
M (16#6a042426#),
M (16#089575c7#),
M (16#5a003f08#),
M (16#9d273983#),
M (16#9dec58b9#),
M (16#64ec3843#)),
"Invalid HMAC");
end Test_SHA256_Prf_2;
---------------------------------------------------------------------------
procedure Test_SHA256_Prf_3 (T : in out Test_Cases.Test_Case'Class)
is
HMAC_Ctx : LSC.Internal.HMAC_SHA256.Context_Type;
Key : LSC.Internal.SHA256.Block_Type;
Block : LSC.Internal.SHA256.Block_Type;
PRF_HMAC_SHA_256 : LSC.Internal.SHA256.SHA256_Hash_Type;
begin
-- 20 times 16#aa#
Key := LSC.Internal.SHA256.Block_Type'
(M (16#aaaaaaaa#), M (16#aaaaaaaa#), M (16#aaaaaaaa#),
M (16#aaaaaaaa#), M (16#aaaaaaaa#), others => 0);
-- 50 times 16#dd#
Block := LSC.Internal.SHA256.Block_Type'
(M (16#dddddddd#), M (16#dddddddd#), M (16#dddddddd#),
M (16#dddddddd#), M (16#dddddddd#), M (16#dddddddd#),
M (16#dddddddd#), M (16#dddddddd#), M (16#dddddddd#),
M (16#dddddddd#), M (16#dddddddd#), M (16#dddddddd#),
M (16#dddd0000#), others => 0);
HMAC_Ctx := LSC.Internal.HMAC_SHA256.Context_Init (Key);
LSC.Internal.HMAC_SHA256.Context_Finalize (HMAC_Ctx, Block, 400);
PRF_HMAC_SHA_256 := LSC.Internal.HMAC_SHA256.Get_Prf (HMAC_Ctx);
Assert
(PRF_HMAC_SHA_256 =
LSC.Internal.SHA256.SHA256_Hash_Type'(M (16#773ea91e#),
M (16#36800e46#),
M (16#854db8eb#),
M (16#d09181a7#),
M (16#2959098b#),
M (16#3ef8c122#),
M (16#d9635514#),
M (16#ced565fe#)),
"Invalid HMAC");
end Test_SHA256_Prf_3;
---------------------------------------------------------------------------
procedure Test_SHA256_Prf_4 (T : in out Test_Cases.Test_Case'Class)
is
HMAC_Ctx : LSC.Internal.HMAC_SHA256.Context_Type;
Key : LSC.Internal.SHA256.Block_Type;
Block : LSC.Internal.SHA256.Block_Type;
PRF_HMAC_SHA_256 : LSC.Internal.SHA256.SHA256_Hash_Type;
begin
-- 25 bytes
Key := LSC.Internal.SHA256.Block_Type'(M (16#01020304#),
M (16#05060708#),
M (16#090a0b0c#),
M (16#0d0e0f10#),
M (16#11121314#),
M (16#15161718#),
M (16#19000000#),
others => 0);
-- 50 times 16#dd#
Block := LSC.Internal.SHA256.Block_Type'(M (16#cdcdcdcd#),
M (16#cdcdcdcd#),
M (16#cdcdcdcd#),
M (16#cdcdcdcd#),
M (16#cdcdcdcd#),
M (16#cdcdcdcd#),
M (16#cdcdcdcd#),
M (16#cdcdcdcd#),
M (16#cdcdcdcd#),
M (16#cdcdcdcd#),
M (16#cdcdcdcd#),
M (16#cdcdcdcd#),
M (16#cdcd0000#),
others => 0);
HMAC_Ctx := LSC.Internal.HMAC_SHA256.Context_Init (Key);
LSC.Internal.HMAC_SHA256.Context_Finalize (HMAC_Ctx, Block, 400);
PRF_HMAC_SHA_256 := LSC.Internal.HMAC_SHA256.Get_Prf (HMAC_Ctx);
Assert
(PRF_HMAC_SHA_256 =
LSC.Internal.SHA256.SHA256_Hash_Type'(M (16#82558a38#),
M (16#9a443c0e#),
M (16#a4cc8198#),
M (16#99f2083a#),
M (16#85f0faa3#),
M (16#e578f807#),
M (16#7a2e3ff4#),
M (16#6729665b#)),
"Invalid HMAC");
end Test_SHA256_Prf_4;
---------------------------------------------------------------------------
procedure Test_SHA256_Auth_1 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.SHA256.Message_Index range 1 .. 1;
subtype Message_Type is LSC.Internal.SHA256.Message_Type (Message_Index);
Key : LSC.Internal.SHA256.Block_Type;
Message : Message_Type;
begin
-- 32 bytes
Key := LSC.Internal.SHA256.Block_Type'(M (16#0b0b0b0b#),
M (16#0b0b0b0b#),
M (16#0b0b0b0b#),
M (16#0b0b0b0b#),
M (16#0b0b0b0b#),
M (16#0b0b0b0b#),
M (16#0b0b0b0b#),
M (16#0b0b0b0b#),
others => 0);
-- "Hi There"
Message := Message_Type'(1 => LSC.Internal.SHA256.Block_Type'
(M (16#48692054#), M (16#68657265#), others => 0));
Assert
(LSC.Internal.HMAC_SHA256.Authenticate (Key, Message, 64) =
LSC.Internal.HMAC_SHA256.Auth_Type'(M (16#198a607e#),
M (16#b44bfbc6#),
M (16#9903a0f1#),
M (16#cf2bbdc5#)),
"Invalid HMAC");
end Test_SHA256_Auth_1;
---------------------------------------------------------------------------
procedure Test_SHA256_Auth_2 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.SHA256.Message_Index range 1 .. 1;
subtype Message_Type is LSC.Internal.SHA256.Message_Type (Message_Index);
Key : LSC.Internal.SHA256.Block_Type;
Message : Message_Type;
begin
-- "JefeJefeJefeJefe"
-- "JefeJefeJefeJefe"
Key := LSC.Internal.SHA256.Block_Type'(M (16#4a656665#),
M (16#4a656665#),
M (16#4a656665#),
M (16#4a656665#),
M (16#4a656665#),
M (16#4a656665#),
M (16#4a656665#),
M (16#4a656665#),
others => 0);
-- "what do ya want "
-- "for nothing?"
Message := Message_Type'(1 => LSC.Internal.SHA256.Block_Type'
(M (16#77686174#),
M (16#20646f20#),
M (16#79612077#),
M (16#616e7420#),
M (16#666f7220#),
M (16#6e6f7468#),
M (16#696e673f#),
others => 0));
Assert
(LSC.Internal.HMAC_SHA256.Authenticate (Key, Message, 224) =
LSC.Internal.HMAC_SHA256.Auth_Type'(M (16#167f9285#),
M (16#88c5cc2e#),
M (16#ef8e3093#),
M (16#caa0e87c#)),
"Invalid HMAC");
end Test_SHA256_Auth_2;
---------------------------------------------------------------------------
procedure Test_SHA256_Auth_3 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.SHA256.Message_Index range 1 .. 1;
subtype Message_Type is LSC.Internal.SHA256.Message_Type (Message_Index);
Key : LSC.Internal.SHA256.Block_Type;
Message : Message_Type;
begin
-- 32 times 16#aa#
Key := LSC.Internal.SHA256.Block_Type'(M (16#aaaaaaaa#),
M (16#aaaaaaaa#),
M (16#aaaaaaaa#),
M (16#aaaaaaaa#),
M (16#aaaaaaaa#),
M (16#aaaaaaaa#),
M (16#aaaaaaaa#),
M (16#aaaaaaaa#),
others => 0);
-- 50 times 16#dd#
Message := Message_Type'(1 => LSC.Internal.SHA256.Block_Type'
(M (16#dddddddd#),
M (16#dddddddd#),
M (16#dddddddd#),
M (16#dddddddd#),
M (16#dddddddd#),
M (16#dddddddd#),
M (16#dddddddd#),
M (16#dddddddd#),
M (16#dddddddd#),
M (16#dddddddd#),
M (16#dddddddd#),
M (16#dddddddd#),
M (16#dddd0000#),
others => 0));
Assert
(LSC.Internal.HMAC_SHA256.Authenticate (Key, Message, 400) =
LSC.Internal.HMAC_SHA256.Auth_Type'(M (16#cdcb1220#),
M (16#d1ecccea#),
M (16#91e53aba#),
M (16#3092f962#)),
"Invalid HMAC");
end Test_SHA256_Auth_3;
---------------------------------------------------------------------------
procedure Test_SHA256_Auth_4 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.SHA256.Message_Index range 1 .. 1;
subtype Message_Type is LSC.Internal.SHA256.Message_Type (Message_Index);
Key : LSC.Internal.SHA256.Block_Type;
Message : Message_Type;
begin
-- 32 byte
Key := LSC.Internal.SHA256.Block_Type'(M (16#01020304#),
M (16#05060708#),
M (16#090a0b0c#),
M (16#0d0e0f10#),
M (16#11121314#),
M (16#15161718#),
M (16#191a1b1c#),
M (16#1d1e1f20#),
others => 0);
-- 50 times 16#cd#
Message := Message_Type'(1 => LSC.Internal.SHA256.Block_Type'
(M (16#cdcdcdcd#),
M (16#cdcdcdcd#),
M (16#cdcdcdcd#),
M (16#cdcdcdcd#),
M (16#cdcdcdcd#),
M (16#cdcdcdcd#),
M (16#cdcdcdcd#),
M (16#cdcdcdcd#),
M (16#cdcdcdcd#),
M (16#cdcdcdcd#),
M (16#cdcdcdcd#),
M (16#cdcdcdcd#),
M (16#cdcd0000#),
others => 0));
Assert
(LSC.Internal.HMAC_SHA256.Authenticate (Key, Message, 400) =
LSC.Internal.HMAC_SHA256.Auth_Type'(M (16#372efcf9#),
M (16#b40b35c2#),
M (16#115b1346#),
M (16#903d2ef4#)),
"Invalid HMAC");
end Test_SHA256_Auth_4;
---------------------------------------------------------------------------
procedure Test_SHA256_Multi_1 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.SHA256.Message_Index range 1 .. 4;
subtype Message_Type is LSC.Internal.SHA256.Message_Type (Message_Index);
Key : LSC.Internal.SHA256.Block_Type;
Message : Message_Type;
begin
-- hmac_sha256-key-1.dat
Key := LSC.Internal.SHA256.Block_Type'(
M (16#e94f399e#), M (16#6451ce39#), M (16#7b49d580#), M (16#bafdf532#),
M (16#ee24aa25#), M (16#6b0721bf#), M (16#c7f67939#), M (16#903fc021#),
M (16#ca3c517c#), M (16#1ce00fa3#), M (16#ed0a5ff2#), M (16#a2c32049#),
M (16#d3452f2b#), M (16#cdba563a#), M (16#3edf4f0d#), M (16#6bd26dad#)
);
-- hmac_sha256-message-1.dat
Message := Message_Type'(
LSC.Internal.SHA256.Block_Type'(
M (16#1d68a3cd#), M (16#6b07a7e3#), M (16#3ce93a05#), M (16#f89defe5#),
M (16#0142fe91#), M (16#8508e319#), M (16#b283d17c#), M (16#1423afc0#),
M (16#86508665#), M (16#b34c6d13#), M (16#777da272#), M (16#d202d291#),
M (16#91c89d4b#), M (16#f2852209#), M (16#a4241e91#), M (16#2e4c9b6e#)),
LSC.Internal.SHA256.Block_Type'(
M (16#8342da56#), M (16#5fa7bbb0#), M (16#0e5541f7#), M (16#11ac4f01#),
M (16#69bd4113#), M (16#a51388fc#), M (16#f57aac73#), M (16#95d774eb#),
M (16#07eb51e1#), M (16#526efaa3#), M (16#c589f223#), M (16#89adaf4d#),
M (16#48d01d42#), M (16#99a16171#), M (16#7a84a41c#), M (16#5cabe95b#)),
LSC.Internal.SHA256.Block_Type'(
M (16#d056a140#), M (16#25e4da39#), M (16#54251a17#), M (16#288bbf71#),
M (16#7040f900#), M (16#e6b3eeb9#), M (16#b4c7337e#), M (16#59c946c0#),
M (16#d72b53b2#), M (16#04e16a4a#), M (16#bb00aa33#), M (16#fc674d6a#),
M (16#cdb821d9#), M (16#b1d2a1ca#), M (16#0d286937#), M (16#81ef2acf#)),
LSC.Internal.SHA256.Block_Type'(
M (16#e908e006#), M (16#815853a2#), M (16#d6100b5d#), M (16#a81ce416#),
M (16#d98ba37d#), M (16#36e3c68b#), M (16#52cf0c1c#), M (16#aa9805b9#),
M (16#3b7e68b7#), M (16#2c56511d#), M (16#711336b8#), M (16#eb1fe87f#),
M (16#88b5870c#), M (16#697807fd#), M (16#dd1d1028#), M (16#87d5777f#))
);
-- hmac_sha256-hash-1.dat
Assert
(LSC.Internal.HMAC_SHA256.Authenticate (Key, Message, 2048) =
LSC.Internal.HMAC_SHA256.Auth_Type'(
M (16#15667870#), M (16#c4957c0f#), M (16#46de0f26#), M (16#c19804ae#)),
"Invalid HMAC");
end Test_SHA256_Multi_1;
---------------------------------------------------------------------------
procedure Test_SHA256_Multi_2 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.SHA256.Message_Index range 1 .. 5;
subtype Message_Type is LSC.Internal.SHA256.Message_Type (Message_Index);
Key : LSC.Internal.SHA256.Block_Type;
Message : Message_Type;
begin
-- hmac_sha256-key-2.dat
Key := LSC.Internal.SHA256.Block_Type'(
M (16#f9bce67a#), M (16#4d76ff6d#), M (16#d14b0371#), M (16#7b63696c#),
M (16#563ff8ee#), M (16#1825343e#), M (16#3732b7ff#), M (16#d881d8c1#),
M (16#f5e75c76#), M (16#0fab3418#), M (16#8281a08b#), M (16#dbdf6264#),
M (16#27566d34#), M (16#a61c20cf#), M (16#41db3611#), M (16#4d8d63f9#)
);
-- hmac_sha256-message-2.dat
Message := Message_Type'(
LSC.Internal.SHA256.Block_Type'(
M (16#05b4583b#), M (16#e4dabc55#), M (16#2d3ec9bb#), M (16#d9a36cfc#),
M (16#ec9cd70a#), M (16#c28326e3#), M (16#55fa0488#), M (16#963c2dae#),
M (16#c8046861#), M (16#27944daa#), M (16#7c9935a3#), M (16#7a15387e#),
M (16#724669bd#), M (16#3ee51c80#), M (16#f01dd16e#), M (16#d6eaae5d#)),
LSC.Internal.SHA256.Block_Type'(
M (16#031d4365#), M (16#aecd1468#), M (16#623ecfef#), M (16#8bc48e96#),
M (16#d14fd471#), M (16#adec193a#), M (16#2d803593#), M (16#876083a6#),
M (16#771684e6#), M (16#022d917e#), M (16#b96c6472#), M (16#5e3d3c25#),
M (16#cbf3b94b#), M (16#290f30dd#), M (16#ae3be915#), M (16#bbf215fa#)),
LSC.Internal.SHA256.Block_Type'(
M (16#a362659b#), M (16#7ba390a6#), M (16#fe4ccb96#), M (16#3d7a9efa#),
M (16#634edd9a#), M (16#e977235b#), M (16#b061da25#), M (16#871d5ec4#),
M (16#96591090#), M (16#03e8d9bd#), M (16#b8b570b2#), M (16#8a55eea2#),
M (16#41654ead#), M (16#a305eca9#), M (16#27183dc4#), M (16#0fccbeac#)),
LSC.Internal.SHA256.Block_Type'(
M (16#9d99311c#), M (16#c8cee41e#), M (16#e165b132#), M (16#d0907f42#),
M (16#ba829b85#), M (16#6ac8cc7b#), M (16#32c158ed#), M (16#8ae5efbd#),
M (16#c8c47c0a#), M (16#11f6e3de#), M (16#ca9425d1#), M (16#d560ff15#),
M (16#42724497#), M (16#07ded7a7#), M (16#87721d7c#), M (16#ab2cb568#)),
LSC.Internal.SHA256.Block_Type'(
M (16#29ac3372#), M (16#bbae6449#), M (16#8e48ce3d#), M (16#2f18bca7#),
M (16#8b019337#), M (16#dad8763d#), M (16#dcef1b86#), M (16#e8e729c7#),
M (16#f4966f48#), M (16#2537e29a#), M (16#6861c3b6#), M (16#1b8ad2a7#),
M (16#2d07d0fd#), M (16#db70f339#), others => 0)
);
-- hmac_sha256-hash-2.dat
Assert
(LSC.Internal.HMAC_SHA256.Authenticate (Key, Message, 2048 + 448) =
LSC.Internal.HMAC_SHA256.Auth_Type'(
M (16#a3735482#), M (16#3897bec4#), M (16#a017cefc#), M (16#608852a6#)),
"Invalid HMAC");
end Test_SHA256_Multi_2;
---------------------------------------------------------------------------
procedure Test_SHA384_Prf_1 (T : in out Test_Cases.Test_Case'Class)
is
HMAC_Ctx : LSC.Internal.HMAC_SHA384.Context_Type;
Key : LSC.Internal.SHA512.Block_Type;
Block : LSC.Internal.SHA512.Block_Type;
PRF_HMAC_SHA_384 : LSC.Internal.SHA512.SHA384_Hash_Type;
begin
Key := LSC.Internal.SHA512.Block_Type'
(N (16#0b0b0b0b0b0b0b0b#), N (16#0b0b0b0b0b0b0b0b#),
N (16#0b0b0b0b00000000#), others => 0);
-- "Hi There"
Block := LSC.Internal.SHA512.Block_Type'
(N (16#4869205468657265#), others => 0);
HMAC_Ctx := LSC.Internal.HMAC_SHA384.Context_Init (Key);
LSC.Internal.HMAC_SHA384.Context_Finalize (HMAC_Ctx, Block, 64);
PRF_HMAC_SHA_384 := LSC.Internal.HMAC_SHA384.Get_Prf (HMAC_Ctx);
Assert
(PRF_HMAC_SHA_384 =
LSC.Internal.SHA512.SHA384_Hash_Type'
(N (16#afd03944d8489562#), N (16#6b0825f4ab46907f#),
N (16#15f9dadbe4101ec6#), N (16#82aa034c7cebc59c#),
N (16#faea9ea9076ede7f#), N (16#4af152e8b2fa9cb6#)),
"Invalid PRF");
end Test_SHA384_Prf_1;
---------------------------------------------------------------------------
procedure Test_SHA384_Prf_2 (T : in out Test_Cases.Test_Case'Class)
is
HMAC_Ctx : LSC.Internal.HMAC_SHA384.Context_Type;
Key : LSC.Internal.SHA512.Block_Type;
Block : LSC.Internal.SHA512.Block_Type;
PRF_HMAC_SHA_384 : LSC.Internal.SHA512.SHA384_Hash_Type;
begin
-- "Jefe"
Key := LSC.Internal.SHA512.Block_Type'
(N (16#4a65666500000000#), others => 0);
-- "what do ya want "
-- "for nothing?"
Block := LSC.Internal.SHA512.Block_Type'
(N (16#7768617420646f20#), N (16#79612077616e7420#),
N (16#666f72206e6f7468#), N (16#696e673f00000000#),
others => 0);
HMAC_Ctx := LSC.Internal.HMAC_SHA384.Context_Init (Key);
LSC.Internal.HMAC_SHA384.Context_Finalize (HMAC_Ctx, Block, 224);
PRF_HMAC_SHA_384 := LSC.Internal.HMAC_SHA384.Get_Prf (HMAC_Ctx);
Assert
(PRF_HMAC_SHA_384 =
LSC.Internal.SHA512.SHA384_Hash_Type'
(N (16#af45d2e376484031#), N (16#617f78d2b58a6b1b#), N (16#9c7ef464f5a01b47#),
N (16#e42ec3736322445e#), N (16#8e2240ca5e69e2c7#), N (16#8b3239ecfab21649#)),
"Invalid PRF");
end Test_SHA384_Prf_2;
---------------------------------------------------------------------------
procedure Test_SHA384_Prf_3 (T : in out Test_Cases.Test_Case'Class)
is
HMAC_Ctx : LSC.Internal.HMAC_SHA384.Context_Type;
Key : LSC.Internal.SHA512.Block_Type;
Block : LSC.Internal.SHA512.Block_Type;
PRF_HMAC_SHA_384 : LSC.Internal.SHA512.SHA384_Hash_Type;
begin
-- 20 times 16#aa#
Key := LSC.Internal.SHA512.Block_Type'
(N (16#aaaaaaaaaaaaaaaa#), N (16#aaaaaaaaaaaaaaaa#),
N (16#aaaaaaaa00000000#), others => 0);
-- 50 times 16#dd#
Block := LSC.Internal.SHA512.Block_Type'
(N (16#dddddddddddddddd#), N (16#dddddddddddddddd#), N (16#dddddddddddddddd#),
N (16#dddddddddddddddd#), N (16#dddddddddddddddd#), N (16#dddddddddddddddd#),
N (16#dddd000000000000#), others => 0);
HMAC_Ctx := LSC.Internal.HMAC_SHA384.Context_Init (Key);
LSC.Internal.HMAC_SHA384.Context_Finalize (HMAC_Ctx, Block, 400);
PRF_HMAC_SHA_384 := LSC.Internal.HMAC_SHA384.Get_Prf (HMAC_Ctx);
Assert
(PRF_HMAC_SHA_384 =
LSC.Internal.SHA512.SHA384_Hash_Type'
(N (16#88062608d3e6ad8a#), N (16#0aa2ace014c8a86f#), N (16#0aa635d947ac9feb#),
N (16#e83ef4e55966144b#), N (16#2a5ab39dc13814b9#), N (16#4e3ab6e101a34f27#)),
"Invalid PRF");
end Test_SHA384_Prf_3;
---------------------------------------------------------------------------
procedure Test_SHA384_Prf_4 (T : in out Test_Cases.Test_Case'Class)
is
HMAC_Ctx : LSC.Internal.HMAC_SHA384.Context_Type;
Key : LSC.Internal.SHA512.Block_Type;
Block : LSC.Internal.SHA512.Block_Type;
PRF_HMAC_SHA_384 : LSC.Internal.SHA512.SHA384_Hash_Type;
begin
-- 25 bytes
Key := LSC.Internal.SHA512.Block_Type'
(N (16#0102030405060708#), N (16#090a0b0c0d0e0f10#), N (16#1112131415161718#),
N (16#1900000000000000#), others => 0);
-- 50 times 16#dd#
Block := LSC.Internal.SHA512.Block_Type'
(N (16#cdcdcdcdcdcdcdcd#), N (16#cdcdcdcdcdcdcdcd#), N (16#cdcdcdcdcdcdcdcd#),
N (16#cdcdcdcdcdcdcdcd#), N (16#cdcdcdcdcdcdcdcd#), N (16#cdcdcdcdcdcdcdcd#),
N (16#cdcd000000000000#), others => 0);
HMAC_Ctx := LSC.Internal.HMAC_SHA384.Context_Init (Key);
LSC.Internal.HMAC_SHA384.Context_Finalize (HMAC_Ctx, Block, 400);
PRF_HMAC_SHA_384 := LSC.Internal.HMAC_SHA384.Get_Prf (HMAC_Ctx);
Assert
(PRF_HMAC_SHA_384 =
LSC.Internal.SHA512.SHA384_Hash_Type'
(N (16#3e8a69b7783c2585#), N (16#1933ab6290af6ca7#), N (16#7a9981480850009c#),
N (16#c5577c6e1f573b4e#), N (16#6801dd23c4a7d679#), N (16#ccf8a386c674cffb#)),
"Invalid PRF");
end Test_SHA384_Prf_4;
---------------------------------------------------------------------------
procedure Test_SHA384_Auth_1 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.SHA512.Message_Index range 1 .. 1;
subtype Message_Type is LSC.Internal.SHA512.Message_Type (Message_Index);
Key : LSC.Internal.SHA512.Block_Type;
Message : Message_Type;
begin
-- 48 bytes
Key := LSC.Internal.SHA512.Block_Type'
(N (16#0b0b0b0b0b0b0b0b#), N (16#0b0b0b0b0b0b0b0b#), N (16#0b0b0b0b0b0b0b0b#),
N (16#0b0b0b0b0b0b0b0b#), N (16#0b0b0b0b0b0b0b0b#), N (16#0b0b0b0b0b0b0b0b#),
others => 0);
-- "Hi There"
Message := Message_Type'(1 => LSC.Internal.SHA512.Block_Type'
(N (16#4869205468657265#), others => 0));
Assert
(LSC.Internal.HMAC_SHA384.Authenticate (Key, Message, 64) =
LSC.Internal.HMAC_SHA384.Auth_Type'
(N (16#b6a8d5636f5c6a72#), N (16#24f9977dcf7ee6c7#), N (16#fb6d0c48cbdee973#)),
"Invalid HMAC");
end Test_SHA384_Auth_1;
---------------------------------------------------------------------------
procedure Test_SHA384_Auth_2 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.SHA512.Message_Index range 1 .. 1;
subtype Message_Type is LSC.Internal.SHA512.Message_Type (Message_Index);
Key : LSC.Internal.SHA512.Block_Type;
Message : Message_Type;
begin
-- "JefeJefeJefeJefe"
-- "JefeJefeJefeJefe"
-- "JefeJefeJefeJefe"
-- "JefeJefeJefeJefe"
Key := LSC.Internal.SHA512.Block_Type'
(N (16#4a6566654a656665#), N (16#4a6566654a656665#), N (16#4a6566654a656665#),
N (16#4a6566654a656665#), N (16#4a6566654a656665#), N (16#4a6566654a656665#),
others => 0);
-- "what do ya want "
-- "for nothing?"
Message := Message_Type'(1 => LSC.Internal.SHA512.Block_Type'
(N (16#7768617420646f20#), N (16#79612077616e7420#), N (16#666f72206e6f7468#),
N (16#696e673f00000000#), others => 0));
Assert
(LSC.Internal.HMAC_SHA384.Authenticate (Key, Message, 224) =
LSC.Internal.HMAC_SHA384.Auth_Type'
(N (16#2c7353974f1842fd#), N (16#66d53c452ca42122#), N (16#b28c0b594cfb184d#)),
"Invalid HMAC");
end Test_SHA384_Auth_2;
---------------------------------------------------------------------------
procedure Test_SHA384_Auth_3 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.SHA512.Message_Index range 1 .. 1;
subtype Message_Type is LSC.Internal.SHA512.Message_Type (Message_Index);
Key : LSC.Internal.SHA512.Block_Type;
Message : Message_Type;
begin
-- 48 times 16#aa#
Key := LSC.Internal.SHA512.Block_Type'
(N (16#aaaaaaaaaaaaaaaa#), N (16#aaaaaaaaaaaaaaaa#), N (16#aaaaaaaaaaaaaaaa#),
N (16#aaaaaaaaaaaaaaaa#), N (16#aaaaaaaaaaaaaaaa#), N (16#aaaaaaaaaaaaaaaa#),
others => 0);
-- 50 times 16#dd#
Message := Message_Type'(1 => LSC.Internal.SHA512.Block_Type'
(N (16#dddddddddddddddd#), N (16#dddddddddddddddd#), N (16#dddddddddddddddd#),
N (16#dddddddddddddddd#), N (16#dddddddddddddddd#), N (16#dddddddddddddddd#),
N (16#dddd000000000000#), others => 0));
Assert
(LSC.Internal.HMAC_SHA384.Authenticate (Key, Message, 400) =
LSC.Internal.HMAC_SHA384.Auth_Type'
(N (16#809f439be0027432#), N (16#1d4a538652164b53#), N (16#554a508184a0c316#)),
"Invalid HMAC");
end Test_SHA384_Auth_3;
---------------------------------------------------------------------------
procedure Test_SHA384_Auth_4 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.SHA512.Message_Index range 1 .. 1;
subtype Message_Type is LSC.Internal.SHA512.Message_Type (Message_Index);
Key : LSC.Internal.SHA512.Block_Type;
Message : Message_Type;
begin
Key := LSC.Internal.SHA512.Block_Type'
(N (16#0102030405060708#), N (16#090a0b0c0d0e0f10#), N (16#1112131415161718#),
N (16#191a1b1c1d1e1f20#), N (16#0a0b0c0d0e0f1011#), N (16#1213141516171819#),
others => 0);
-- 50 times 16#dd#
Message := Message_Type'(1 => LSC.Internal.SHA512.Block_Type'
(N (16#cdcdcdcdcdcdcdcd#), N (16#cdcdcdcdcdcdcdcd#), N (16#cdcdcdcdcdcdcdcd#),
N (16#cdcdcdcdcdcdcdcd#), N (16#cdcdcdcdcdcdcdcd#), N (16#cdcdcdcdcdcdcdcd#),
N (16#cdcd000000000000#), others => 0));
Assert
(LSC.Internal.HMAC_SHA384.Authenticate (Key, Message, 400) =
LSC.Internal.HMAC_SHA384.Auth_Type'
(N (16#5b540085c6e63580#), N (16#96532b2493609ed1#), N (16#cb298f774f87bb5c#)),
"Invalid HMAC");
end Test_SHA384_Auth_4;
---------------------------------------------------------------------------
procedure Test_SHA384_Multi_1 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.SHA512.Message_Index range 1 .. 2;
subtype Message_Type is LSC.Internal.SHA512.Message_Type (Message_Index);
Key : LSC.Internal.SHA512.Block_Type;
Message : Message_Type;
begin
-- Hexdump of HMAC_SHA384-key-1.dat
Key := LSC.Internal.SHA512.Block_Type'(
N (16#2cad6b4b0b01b5b4#), N (16#a4de252f2b594736#), N (16#68e85fdc40de1d25#), N (16#c25d4ecc2a7dfec4#),
N (16#53334b6ee5b4a4fb#), N (16#33cf52a70f23a351#), N (16#e7e124dc78b56c76#), N (16#18c14c301ef0452a#),
N (16#29b8cdb0821d774a#), N (16#d0e55480530bd091#), N (16#0f92dcb33037cded#), N (16#d8fabd1bcd519cba#),
N (16#8dc8cd68bbd33d5e#), N (16#2e22a320d6a71a60#), N (16#ba16964831e0e8e6#), N (16#b5527d657d6a9daa#)
);
-- Hexdump of HMAC_SHA384-message-1.dat
Message := Message_Type'(
LSC.Internal.SHA512.Block_Type'(
N (16#c7e3ae3df95ca9a8#), N (16#13242d4052700304#), N (16#fc8dab7c4bffff62#), N (16#de0b364b87a1f8c7#),
N (16#5e9b3f6b31f552ec#), N (16#f8a53724b01ff176#), N (16#eb9922a221b0003a#), N (16#682dca9fdfa49e59#),
N (16#b652f8c834c89936#), N (16#486df5779f720734#), N (16#77e912b3568cd483#), N (16#7059267c1d013521#),
N (16#b6c763924fea7e17#), N (16#58591d2a1781fcac#), N (16#072e963f2a02e23a#), N (16#831344b9c9ddc17e#)),
LSC.Internal.SHA512.Block_Type'(
N (16#68d70a8125e29904#), N (16#00aa442072ea6d52#), N (16#f890ce20e7fff07a#), N (16#ffb79d3c294fba57#),
N (16#1546abc37b2071ca#), N (16#cffd731e25232350#), N (16#635e8e8a3693a8f2#), N (16#d13ec3505e6912d5#),
N (16#c8855484eb251327#), N (16#2c42eaa8afa3d8ea#), N (16#82546d44da4e8553#), N (16#6844ec16107925a7#),
N (16#8d3449f3c6cbff01#), N (16#b304d133a118c1d7#), N (16#2e0b4f754b38fa9e#), N (16#0a082fd37ca98c56#))
);
-- Hexdump of HMAC_SHA384-hash-1.dat
Assert
(LSC.Internal.HMAC_SHA384.Authenticate (Key, Message, 2048) =
LSC.Internal.HMAC_SHA384.Auth_Type'(
N (16#89869091210b3653#), N (16#21f60d6409b9ab5e#), N (16#fd8eea749f22dce3#)),
"Invalid HMAC");
end Test_SHA384_Multi_1;
---------------------------------------------------------------------------
procedure Test_SHA384_Multi_2 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.SHA512.Message_Index range 1 .. 3;
subtype Message_Type is LSC.Internal.SHA512.Message_Type (Message_Index);
Key : LSC.Internal.SHA512.Block_Type;
Message : Message_Type;
begin
-- Hexdump of HMAC_SHA384-key-2.dat
Key := LSC.Internal.SHA512.Block_Type'(
N (16#2466663d3e7bedcd#), N (16#e4c229484312440f#), N (16#954849019d214069#), N (16#759fdd03f6af0f1b#),
N (16#4c6c4a0b78380f75#), N (16#12802b15ed72cf2d#), N (16#b82984e56921b813#), N (16#ffbc70abcf9aaa27#),
N (16#042d2484d803ca23#), N (16#65830c9094ac5f3e#), N (16#fe810d7c628cd67d#), N (16#2e0acc568cd94862#),
N (16#d45e471822988e27#), N (16#9d51cc4502a919bc#), N (16#3038d2e9c3336935#), N (16#eafcb8c2a0ac3878#)
);
-- Hexdump of HMAC_SHA384-message-2.dat
Message := Message_Type'(
LSC.Internal.SHA512.Block_Type'(
N (16#225832edcff4d97b#), N (16#6d6d9329fe9f7eff#), N (16#f3311f03f6168ca7#), N (16#493eadbafb66bff2#),
N (16#9c106683539a0193#), N (16#88444e2f7be708b3#), N (16#eb736e77d15339e8#), N (16#978839ef2d4afc9d#),
N (16#1b2eb2501b9a0f8b#), N (16#41ed05fb650f52a2#), N (16#c8440f9f214ce15e#), N (16#07f811255328e5f6#),
N (16#c7bcedaf34271920#), N (16#ab24105256cace3e#), N (16#aca191607991c49a#), N (16#bce83199afee2786#)),
LSC.Internal.SHA512.Block_Type'(
N (16#70b6f46c918f88df#), N (16#5f2a3ddcaef7cc29#), N (16#0134f34d30012e18#), N (16#bab3ac55fe992b34#),
N (16#763d72beb784ea0e#), N (16#51fea85641166183#), N (16#f2c8d745c128e374#), N (16#4d85f98ce6500504#),
N (16#6e4e29023d97146e#), N (16#491c2f043406fde8#), N (16#8e387a86ab56ada2#), N (16#46a28e21298790b6#),
N (16#d6dc2d1b8f582696#), N (16#e9eda4cc3779af1d#), N (16#310a961c1619328d#), N (16#d44f8da9f1d547e1#)),
LSC.Internal.SHA512.Block_Type'(
N (16#41e7558b1f771b63#), N (16#73ca7b8ea99afefa#), N (16#1423e9fb847a0f57#), N (16#1a848c52b9424d2e#),
N (16#b9effba7b7063973#), N (16#f56bf7b52116cb7f#), N (16#3974bb7d3bc0be6a#), others => 0)
);
-- Compare with hexdump of HMAC_SHA384-hash-2.dat
Assert
(LSC.Internal.HMAC_SHA384.Authenticate (Key, Message, 2048 + 448) =
LSC.Internal.HMAC_SHA384.Auth_Type'(
N (16#144cd21ae50bfb0f#), N (16#ed473b88e7b33470#), N (16#5c59fecda5f978c8#)),
"Invalid HMAC");
end Test_SHA384_Multi_2;
---------------------------------------------------------------------------
-- SHA512 PRF Test Vectors (RFC 4868, 2.7.1.)
procedure Test_SHA512_Prf_1 (T : in out Test_Cases.Test_Case'Class)
is
HMAC_Ctx : LSC.Internal.HMAC_SHA512.Context_Type;
Key : LSC.Internal.SHA512.Block_Type;
Block : LSC.Internal.SHA512.Block_Type;
PRF_HMAC_SHA_512 : LSC.Internal.SHA512.SHA512_Hash_Type;
begin
Key := LSC.Internal.SHA512.Block_Type'
(N (16#0b0b0b0b0b0b0b0b#), N (16#0b0b0b0b0b0b0b0b#),
N (16#0b0b0b0b00000000#), others => 0);
-- "Hi There"
Block := LSC.Internal.SHA512.Block_Type'
(N (16#4869205468657265#), others => 0);
HMAC_Ctx := LSC.Internal.HMAC_SHA512.Context_Init (Key);
LSC.Internal.HMAC_SHA512.Context_Finalize (HMAC_Ctx, Block, 64);
PRF_HMAC_SHA_512 := LSC.Internal.HMAC_SHA512.Get_Prf (HMAC_Ctx);
Assert
(PRF_HMAC_SHA_512 =
LSC.Internal.SHA512.SHA512_Hash_Type'
(N (16#87aa7cdea5ef619d#), N (16#4ff0b4241a1d6cb0#), N (16#2379f4e2ce4ec278#),
N (16#7ad0b30545e17cde#), N (16#daa833b7d6b8a702#), N (16#038b274eaea3f4e4#),
N (16#be9d914eeb61f170#), N (16#2e696c203a126854#)),
"Invalid PRF");
end Test_SHA512_Prf_1;
---------------------------------------------------------------------------
procedure Test_SHA512_Prf_2 (T : in out Test_Cases.Test_Case'Class)
is
HMAC_Ctx : LSC.Internal.HMAC_SHA512.Context_Type;
Key : LSC.Internal.SHA512.Block_Type;
Block : LSC.Internal.SHA512.Block_Type;
PRF_HMAC_SHA_512 : LSC.Internal.SHA512.SHA512_Hash_Type;
begin
-- "Jefe"
Key := LSC.Internal.SHA512.Block_Type'
(0 => N (16#4a65666500000000#), others => 0);
-- "what do ya want "
-- "for nothing?"
Block := LSC.Internal.SHA512.Block_Type'
(N (16#7768617420646f20#), N (16#79612077616e7420#), N (16#666f72206e6f7468#),
N (16#696e673f00000000#), others => 0);
HMAC_Ctx := LSC.Internal.HMAC_SHA512.Context_Init (Key);
LSC.Internal.HMAC_SHA512.Context_Finalize (HMAC_Ctx, Block, 224);
PRF_HMAC_SHA_512 := LSC.Internal.HMAC_SHA512.Get_Prf (HMAC_Ctx);
Assert
(PRF_HMAC_SHA_512 =
LSC.Internal.SHA512.SHA512_Hash_Type'
(N (16#164b7a7bfcf819e2#), N (16#e395fbe73b56e0a3#), N (16#87bd64222e831fd6#),
N (16#10270cd7ea250554#), N (16#9758bf75c05a994a#), N (16#6d034f65f8f0e6fd#),
N (16#caeab1a34d4a6b4b#), N (16#636e070a38bce737#)),
"Invalid PRF");
end Test_SHA512_Prf_2;
---------------------------------------------------------------------------
procedure Test_SHA512_Prf_3 (T : in out Test_Cases.Test_Case'Class)
is
HMAC_Ctx : LSC.Internal.HMAC_SHA512.Context_Type;
Key : LSC.Internal.SHA512.Block_Type;
Block : LSC.Internal.SHA512.Block_Type;
PRF_HMAC_SHA_512 : LSC.Internal.SHA512.SHA512_Hash_Type;
begin
-- 20 times 16#aa#
Key := LSC.Internal.SHA512.Block_Type'
(N (16#aaaaaaaaaaaaaaaa#), N (16#aaaaaaaaaaaaaaaa#), N (16#aaaaaaaa00000000#),
others => 0);
-- 50 times 16#dd#
Block := LSC.Internal.SHA512.Block_Type'
(N (16#dddddddddddddddd#), N (16#dddddddddddddddd#), N (16#dddddddddddddddd#),
N (16#dddddddddddddddd#), N (16#dddddddddddddddd#), N (16#dddddddddddddddd#),
N (16#dddd000000000000#), others => 0);
HMAC_Ctx := LSC.Internal.HMAC_SHA512.Context_Init (Key);
LSC.Internal.HMAC_SHA512.Context_Finalize (HMAC_Ctx, Block, 400);
PRF_HMAC_SHA_512 := LSC.Internal.HMAC_SHA512.Get_Prf (HMAC_Ctx);
Assert
(PRF_HMAC_SHA_512 =
LSC.Internal.SHA512.SHA512_Hash_Type'
(N (16#fa73b0089d56a284#), N (16#efb0f0756c890be9#), N (16#b1b5dbdd8ee81a36#),
N (16#55f83e33b2279d39#), N (16#bf3e848279a722c8#), N (16#06b485a47e67c807#),
N (16#b946a337bee89426#), N (16#74278859e13292fb#)),
"Invalid PRF");
end Test_SHA512_Prf_3;
---------------------------------------------------------------------------
procedure Test_SHA512_Prf_4 (T : in out Test_Cases.Test_Case'Class)
is
HMAC_Ctx : LSC.Internal.HMAC_SHA512.Context_Type;
Key : LSC.Internal.SHA512.Block_Type;
Block : LSC.Internal.SHA512.Block_Type;
PRF_HMAC_SHA_512 : LSC.Internal.SHA512.SHA512_Hash_Type;
begin
-- 25 bytes
Key := LSC.Internal.SHA512.Block_Type'
(N (16#0102030405060708#), N (16#090a0b0c0d0e0f10#), N (16#1112131415161718#),
N (16#1900000000000000#), others => 0);
-- 50 times 16#cd#
Block := LSC.Internal.SHA512.Block_Type'
(N (16#cdcdcdcdcdcdcdcd#), N (16#cdcdcdcdcdcdcdcd#), N (16#cdcdcdcdcdcdcdcd#),
N (16#cdcdcdcdcdcdcdcd#), N (16#cdcdcdcdcdcdcdcd#), N (16#cdcdcdcdcdcdcdcd#),
N (16#cdcd000000000000#), others => 0);
HMAC_Ctx := LSC.Internal.HMAC_SHA512.Context_Init (Key);
LSC.Internal.HMAC_SHA512.Context_Finalize (HMAC_Ctx, Block, 400);
PRF_HMAC_SHA_512 := LSC.Internal.HMAC_SHA512.Get_Prf (HMAC_Ctx);
Assert
(PRF_HMAC_SHA_512 =
LSC.Internal.SHA512.SHA512_Hash_Type'
(N (16#b0ba465637458c69#), N (16#90e5a8c5f61d4af7#), N (16#e576d97ff94b872d#),
N (16#e76f8050361ee3db#), N (16#a91ca5c11aa25eb4#), N (16#d679275cc5788063#),
N (16#a5f19741120c4f2d#), N (16#e2adebeb10a298dd#)),
"Invalid PRF");
end Test_SHA512_Prf_4;
---------------------------------------------------------------------------
procedure Test_SHA512_Auth_1 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.SHA512.Message_Index range 1 .. 1;
subtype Message_Type is LSC.Internal.SHA512.Message_Type (Message_Index);
Key : LSC.Internal.SHA512.Block_Type;
Message : Message_Type;
begin
-- 64 bytes
Key := LSC.Internal.SHA512.Block_Type'
(N (16#0b0b0b0b0b0b0b0b#), N (16#0b0b0b0b0b0b0b0b#), N (16#0b0b0b0b0b0b0b0b#),
N (16#0b0b0b0b0b0b0b0b#), N (16#0b0b0b0b0b0b0b0b#), N (16#0b0b0b0b0b0b0b0b#),
N (16#0b0b0b0b0b0b0b0b#), N (16#0b0b0b0b0b0b0b0b#), others => 0);
-- "Hi There"
Message := Message_Type'(1 => LSC.Internal.SHA512.Block_Type'(N (16#4869205468657265#), others => 0));
Assert
(LSC.Internal.HMAC_SHA512.Authenticate (Key, Message, 64) =
LSC.Internal.HMAC_SHA512.Auth_Type'
(N (16#637edc6e01dce7e6#), N (16#742a99451aae82df#), N (16#23da3e92439e590e#),
N (16#43e761b33e910fb8#)),
"Invalid HMAC");
end Test_SHA512_Auth_1;
---------------------------------------------------------------------------
procedure Test_SHA512_Auth_2 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.SHA512.Message_Index range 1 .. 1;
subtype Message_Type is LSC.Internal.SHA512.Message_Type (Message_Index);
Key : LSC.Internal.SHA512.Block_Type;
Message : Message_Type;
begin
-- "JefeJefeJefeJefe"
-- "JefeJefeJefeJefe"
-- "JefeJefeJefeJefe"
-- "JefeJefeJefeJefe"
Key := LSC.Internal.SHA512.Block_Type'
(N (16#4a6566654a656665#), N (16#4a6566654a656665#), N (16#4a6566654a656665#),
N (16#4a6566654a656665#), N (16#4a6566654a656665#), N (16#4a6566654a656665#),
N (16#4a6566654a656665#), N (16#4a6566654a656665#), others => 0);
-- "what do ya want "
-- "for nothing?"
Message := Message_Type'(1 => LSC.Internal.SHA512.Block_Type'
(N (16#7768617420646f20#), N (16#79612077616e7420#), N (16#666f72206e6f7468#),
N (16#696e673f00000000#), others => 0));
Assert
(LSC.Internal.HMAC_SHA512.Authenticate (Key, Message, 224) =
LSC.Internal.HMAC_SHA512.Auth_Type'
(N (16#cb370917ae8a7ce2#), N (16#8cfd1d8f4705d614#), N (16#1c173b2a9362c15d#),
N (16#f235dfb251b15454#)),
"Invalid HMAC");
end Test_SHA512_Auth_2;
---------------------------------------------------------------------------
procedure Test_SHA512_Auth_3 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.SHA512.Message_Index range 1 .. 1;
subtype Message_Type is LSC.Internal.SHA512.Message_Type (Message_Index);
Key : LSC.Internal.SHA512.Block_Type;
Message : Message_Type;
begin
-- 64 times 16#aa#
Key := LSC.Internal.SHA512.Block_Type'
(N (16#aaaaaaaaaaaaaaaa#), N (16#aaaaaaaaaaaaaaaa#), N (16#aaaaaaaaaaaaaaaa#),
N (16#aaaaaaaaaaaaaaaa#), N (16#aaaaaaaaaaaaaaaa#), N (16#aaaaaaaaaaaaaaaa#),
N (16#aaaaaaaaaaaaaaaa#), N (16#aaaaaaaaaaaaaaaa#), others => 0);
-- 50 times 16#dd#
Message := Message_Type'(1 => LSC.Internal.SHA512.Block_Type'
(N (16#dddddddddddddddd#), N (16#dddddddddddddddd#), N (16#dddddddddddddddd#),
N (16#dddddddddddddddd#), N (16#dddddddddddddddd#), N (16#dddddddddddddddd#),
N (16#dddd000000000000#), others => 0));
Assert
(LSC.Internal.HMAC_SHA512.Authenticate (Key, Message, 400) =
LSC.Internal.HMAC_SHA512.Auth_Type'
(N (16#2ee7acd783624ca9#), N (16#398710f3ee05ae41#), N (16#b9f9b0510c87e49e#),
N (16#586cc9bf961733d8#)),
"Invalid HMAC");
end Test_SHA512_Auth_3;
---------------------------------------------------------------------------
procedure Test_SHA512_Auth_4 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.SHA512.Message_Index range 1 .. 1;
subtype Message_Type is LSC.Internal.SHA512.Message_Type (Message_Index);
Key : LSC.Internal.SHA512.Block_Type;
Message : Message_Type;
begin
-- 64 bytes
-- NB: The test vector in RCF 4868 seem to be bogus! Though stating
-- this to be a 64 bytes key, 80 bytes are presented. However,
-- leaving out the first 16 bytes of the bogus key results in
-- the presented MAC.
Key := LSC.Internal.SHA512.Block_Type'
( -- N (16#0a0b0c0d0e0f1011#), N (16#1213141516171819#),
N (16#0102030405060708#), N (16#090a0b0c0d0e0f10#), N (16#1112131415161718#),
N (16#191a1b1c1d1e1f20#), N (16#2122232425262728#), N (16#292a2b2c2d2e2f30#),
N (16#3132333435363738#), N (16#393a3b3c3d3e3f40#), others => 0);
-- 50 times 16#dd#
Message := Message_Type'(1 => LSC.Internal.SHA512.Block_Type'
(N (16#cdcdcdcdcdcdcdcd#), N (16#cdcdcdcdcdcdcdcd#), N (16#cdcdcdcdcdcdcdcd#),
N (16#cdcdcdcdcdcdcdcd#), N (16#cdcdcdcdcdcdcdcd#), N (16#cdcdcdcdcdcdcdcd#),
N (16#cdcd000000000000#), others => 0));
Assert
(LSC.Internal.HMAC_SHA512.Authenticate (Key, Message, 400) =
LSC.Internal.HMAC_SHA512.Auth_Type'
(N (16#5e6688e5a3daec82#), N (16#6ca32eaea224eff5#), N (16#e700628947470e13#),
N (16#ad01302561bab108#)),
"Invalid HMAC");
end Test_SHA512_Auth_4;
---------------------------------------------------------------------------
procedure Test_SHA512_Multi_1 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.SHA512.Message_Index range 1 .. 12;
subtype Message_Type is LSC.Internal.SHA512.Message_Type (Message_Index);
Key : LSC.Internal.SHA512.Block_Type;
Message : Message_Type;
begin
-- Hexdump of key.dat
Key := LSC.Internal.SHA512.Block_Type'(
N (16#2577888a5d567bf2#), N (16#01507064342a1670#), N (16#287ff1ea2ecabf96#), N (16#1542002cac690b68#),
N (16#b647126442106e6f#), N (16#13eeffc56b4c8145#), N (16#6018bccffc00013d#), N (16#6d793f222e51d1a1#),
others => 0
);
-- Hexdump of message.dat
Message := Message_Type'(
LSC.Internal.SHA512.Block_Type'(
N (16#ab52393074a225f3#), N (16#9e432a58f6e977b2#), N (16#300df239a618518b#), N (16#44658572f2172571#),
N (16#ed255db96276107d#), N (16#51ffe2d224398e6c#), N (16#7a5f28ba944234ca#), N (16#5cda9e919906d5db#),
N (16#1e68ffb46c4502ce#), N (16#681b244934461c0e#), N (16#1f6f46215a687437#), N (16#6af97fc972980ed2#),
N (16#37da280ca151a62e#), N (16#76e1061d9e66853b#), N (16#4cc431b1914bb77b#), N (16#9b0e872f70f5a6da#)),
LSC.Internal.SHA512.Block_Type'(
N (16#280fff785f74b695#), N (16#8723a46af87be8de#), N (16#a58295d9096e1d4d#), N (16#6de4955f179584b9#),
N (16#d12c2197019f99cd#), N (16#f67a9ab6bb73e3e0#), N (16#952a99e77f97e389#), N (16#4944a6186960d1e2#),
N (16#3945955700b078d5#), N (16#21f5eaa1e8fa3791#), N (16#61c5365d9b171afa#), N (16#6959a0a4ac566c8b#),
N (16#f1b255ac75303a77#), N (16#02166e025c1b39d2#), N (16#9d172035de6c4bc0#), N (16#6a6d97b1f459f4e9#)),
LSC.Internal.SHA512.Block_Type'(
N (16#ddfb8d14678d2a56#), N (16#f3bf4ac6f70c913c#), N (16#c420c90214aea24a#), N (16#6f4e5ed1353ef80c#),
N (16#39d45af77f92333a#), N (16#ee5cd1ff4266203d#), N (16#beaacf3b2400d092#), N (16#92fe1686f94d9905#),
N (16#ba54a4f4c4e15fe2#), N (16#f61822552b9636f9#), N (16#ade3a60d895c6f99#), N (16#cdafd8c314b80b52#),
N (16#f3f60ee9bc532185#), N (16#9ac0b0af2cb2064c#), N (16#d4592461e4149a38#), N (16#87db711d6780b9a3#)),
LSC.Internal.SHA512.Block_Type'(
N (16#a89663fb54e7af26#), N (16#35281105c9c11702#), N (16#fd66c7a66bdfd487#), N (16#64feb3305d99f2d8#),
N (16#84f9f8df9cbc3ac2#), N (16#e1a05a67eefa2715#), N (16#c5a0a400e7b08951#), N (16#c6881b94a8e2e19c#),
N (16#73a1210f9d8fcae6#), N (16#eaee91d6c355c7c5#), N (16#0af0f7c9c2a9a8b7#), N (16#d2bbd2021e005870#),
N (16#80906028c4a857ab#), N (16#bc0193203ca904ce#), N (16#780496b634da331a#), N (16#94cb8f7ef900ea35#)),
LSC.Internal.SHA512.Block_Type'(
N (16#4c6ea0b588ba5a3b#), N (16#f5308bcbdaf41f69#), N (16#7879c816da391ec7#), N (16#18183bccca912d13#),
N (16#2eb014b30ef8fb31#), N (16#9b3fece27dc8087b#), N (16#b9d0d874b03ad882#), N (16#46c840958d259c8c#),
N (16#f7b86c7eff93d87e#), N (16#07a439d6e87bf8be#), N (16#885bfb0070d0f7e7#), N (16#5c81dd103552275b#),
N (16#1113bf54d87e7945#), N (16#2a84246d2d0edf99#), N (16#34d99bfe79fadd79#), N (16#d2a883c2d1e3a6b7#)),
LSC.Internal.SHA512.Block_Type'(
N (16#b6efeb711954eeaf#), N (16#5b257ae378d44add#), N (16#00337d3e3e4e3fc6#), N (16#096fa66cc9385a96#),
N (16#684240906b088744#), N (16#3525643b8fbfb874#), N (16#93d035d083b14f75#), N (16#0de86e83870cb487#),
N (16#09b07dd08a1144c6#), N (16#95dc3e748e66d261#), N (16#a5f13b1ec903b475#), N (16#ff8a9c98671eab2e#),
N (16#ea97255a3299b203#), N (16#421b44e9053c081c#), N (16#506565a5adf13767#), N (16#1c9ae758c435518c#)),
LSC.Internal.SHA512.Block_Type'(
N (16#d5c3482a45658905#), N (16#dfae0e6e94cc646f#), N (16#11c36c6187f78bd0#), N (16#635c86d782b11e84#),
N (16#9c1ae165732b92cb#), N (16#1b45a1d981d62057#), N (16#fcf247d8950ee240#), N (16#cf559512489df8a8#),
N (16#5c840eedbc0f5d67#), N (16#0c5a63ec4b11553c#), N (16#bf289c06f83df6f7#), N (16#02f5e058d1dd9cdb#),
N (16#696c3c041621d2ee#), N (16#6bc8dee7876c3e98#), N (16#3a77599403f3e08f#), N (16#21324fcb2d26cbd9#)),
LSC.Internal.SHA512.Block_Type'(
N (16#80aa24c723ea9063#), N (16#d9c0b48219dca5b9#), N (16#8201966dbd3820f9#), N (16#8ac84c52996019b5#),
N (16#2ca4061e2eb8bea3#), N (16#8df523b70a99c5c7#), N (16#5f158e0d9abd58f3#), N (16#e0ba3b57f978d073#),
N (16#08def6f29fde7ea9#), N (16#27e610db52819093#), N (16#7a49ce664eba82d6#), N (16#06a123b78fe958c9#),
N (16#f9da05acf8e1ac6b#), N (16#5dbb990a59c14f32#), N (16#81a1516e381ad030#), N (16#94a0f83a55671922#)),
LSC.Internal.SHA512.Block_Type'(
N (16#363705d530942cee#), N (16#5437b2d1c82e3f9e#), N (16#4d7d212e205897fb#), N (16#1054c868ee54242a#),
N (16#11fa648d61e51532#), N (16#6e84e935d1501fa2#), N (16#9bd183c72634af64#), N (16#c00811f08c54f089#),
N (16#d974b54634244cbe#), N (16#f4e3ec1ecf613c4d#), N (16#00e7f5964f309cde#), N (16#79eec10ffe95ddcb#),
N (16#e674cb032d076161#), N (16#1bdd8d74f1d15380#), N (16#2b4c1a6bb54cf881#), N (16#1229c73ab0f8ff3d#)),
LSC.Internal.SHA512.Block_Type'(
N (16#20f2d3ceab7612f3#), N (16#0775082bf3789777#), N (16#ad9c987e3bde871d#), N (16#933cae9355261d4c#),
N (16#30f51fa7fde7c0b8#), N (16#fa8339acfb41a410#), N (16#e91b3ae4c9f79673#), N (16#f662297f88006fb3#),
N (16#8dec35294af146fa#), N (16#3eee676346eb829a#), N (16#4a87448f9bb9055b#), N (16#67905373649fe386#),
N (16#aabb9100a44c9da5#), N (16#ee42636675d58d7a#), N (16#9d568b65b76de7e4#), N (16#8b2c622cbfce55fb#)),
LSC.Internal.SHA512.Block_Type'(
N (16#a33f71994974e81c#), N (16#b08d987b2e0dffd5#), N (16#a2effbe4a4b9ff87#), N (16#e65e6b3be44bbada#),
N (16#dfacfe9e697aaf93#), N (16#12ebc6e5e00db862#), N (16#16831a85e41bbce0#), N (16#4f15d06d60007d84#),
N (16#c4cab768ae890ef9#), N (16#0c4f25ec47f99c49#), N (16#50b4ab73f086e65e#), N (16#46f20022fd99fc66#),
N (16#45c922af1a0ecf47#), N (16#cf1feb451e43cab0#), N (16#1f31a235d4c7ec89#), N (16#580538b645dd6d5b#)),
LSC.Internal.SHA512.Block_Type'(
N (16#046308d4f812f66d#), N (16#73eb9b6611570e2c#), N (16#0fadd394f4921f5e#), N (16#9468553cabfe6154#),
N (16#e962e1b4fe9dc931#), N (16#6908fae29f3d749f#), N (16#26452b105084ef42#), N (16#4b0d8027feb7f5d3#),
N (16#f56a39e873f7dfa4#), N (16#afe5a389c3739e78#), N (16#8293199341348a57#), N (16#00355cc900000000#),
others => 0)
);
-- Compare with hexdump of hash.dat
Assert
(LSC.Internal.HMAC_SHA512.Authenticate (Key, Message, 12_000) =
LSC.Internal.HMAC_SHA512.Auth_Type'(
N (16#24b3907ac82497a4#), N (16#d7e0db7c317b93a7#), N (16#f2c35ce153913d86#), N (16#608068d30ce4ef0a#)),
"Invalid HMAC");
end Test_SHA512_Multi_1;
---------------------------------------------------------------------------
-- Multiple message blocks, block aligned. This test was generated using
-- dd, the genhmac command line tool (based on OpenSSL) and xxd:
--
-- $ dd if=/dev/urandom bs=1 count=128 of=HMAC_SHA512-KEY-2.dat
-- $ dd if=/dev/urandom bs=1 count=640 of=HMAC_SHA512-MESSAGE-2.dat
-- $ ./out/genhmac \
-- HMAC_SHA512-KEY-2.dat \
-- HMAC_SHA512-MESSAGE-2.dat \
-- HMAC_SHA512-HASH-2.dat
-- $ xxd -c32 -g8 HMAC_SHA512-KEY-2.dat
-- $ xxd -c32 -g8 HMAC_SHA512-MESSAGE-2.dat
-- $ xxd -c32 -g8 HMAC_SHA512-HASH-2.dat
procedure Test_SHA512_Multi_2 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.SHA512.Message_Index range 1 .. 7;
subtype Message_Type is LSC.Internal.SHA512.Message_Type (Message_Index);
Key : LSC.Internal.SHA512.Block_Type;
Message : Message_Type;
begin
-- Hexdump of HMAC_SHA512-KEY-2.dat
Key := LSC.Internal.SHA512.Block_Type'(
N (16#e3a86aea63f58fac#), N (16#a858ef8a994605e4#), N (16#e8da8502cf68ca6b#), N (16#dba3651502c3fd38#),
N (16#9f360e30f13b4658#), N (16#522d6584e290197e#), N (16#8938f191c9bf6467#), N (16#7220a5df9da19d85#),
N (16#fbfe98bbe1acb251#), N (16#2f0bb1957c8e5cc9#), N (16#872a2687d13ef45f#), N (16#3346616d0cf7eed0#),
N (16#bdf8c89926a895aa#), N (16#591415eb888342f5#), N (16#10547d8796a606e5#), N (16#543edfda43c9b8f7#)
);
-- Hexdump of HMAC_SHA512-MESSAGE-2.dat
Message := Message_Type'(
LSC.Internal.SHA512.Block_Type'(
N (16#18da28d1fd3f10b6#), N (16#547fd81ae9e64dc0#), N (16#1cd015147e8d92e9#), N (16#9ceec40b8279c4df#),
N (16#69964480f23e6630#), N (16#b735e934879e7264#), N (16#a16f36b520565543#), N (16#0f965fbf99ea62ce#),
N (16#c3bf473481537028#), N (16#6d8a3014dc3bf8dc#), N (16#1c4484168ec39393#), N (16#7f89f6f1c0107484#),
N (16#cd1d23d75d1f8b8e#), N (16#4622dc6c8ada84b9#), N (16#267b341999f75146#), N (16#896721a3d977d6bc#)),
LSC.Internal.SHA512.Block_Type'(
N (16#eb91ced1c0574314#), N (16#ea03bb202fb7064d#), N (16#75108edcc8b4790f#), N (16#59a5ecf6c9524198#),
N (16#e5b47305fce4e4aa#), N (16#f91f8315bffdaa45#), N (16#463287010beea839#), N (16#203056994db783e6#),
N (16#9ad1bc202f4a7b77#), N (16#f7f33e3a9af3d096#), N (16#5718eca50e70198a#), N (16#493b35dfd0b7d04f#),
N (16#a50195ab13130324#), N (16#ee875c16be090345#), N (16#d5e43684fcd678b7#), N (16#77401f45d85b63c3#)),
LSC.Internal.SHA512.Block_Type'(
N (16#c02b855d3bd13445#), N (16#14740c3cdf873d2d#), N (16#f811a72883b6a0a3#), N (16#58771622c1cc5c07#),
N (16#223f0ccfec5f90a8#), N (16#50d1d552a7d8f178#), N (16#88024175e377e21e#), N (16#c78eaf843f81baab#),
N (16#c62d5a390b760849#), N (16#62aa63307c0959e6#), N (16#abc001d49773a782#), N (16#4147840acb1bd02e#),
N (16#784b5aa724d9b218#), N (16#cf5d53115f4acd2c#), N (16#88a42a14af3b2f77#), N (16#43b9f144e044f6f4#)),
LSC.Internal.SHA512.Block_Type'(
N (16#5e79ce696409e5f1#), N (16#9d61a5af2412ae08#), N (16#3ef6d62fd3af2fbb#), N (16#e8328d99517e6aaf#),
N (16#5fba0969fa2cd91e#), N (16#c9f58450f3fa2378#), N (16#cf5bafc2ae702d23#), N (16#9028b457ff93bef3#),
N (16#0985b6f4f0387ff7#), N (16#c04bf5d9a67d9216#), N (16#2d8c32f5805f5125#), N (16#c5db4a90600b7a20#),
N (16#ac51ec5414fd9394#), N (16#07d05d456ea3d04b#), N (16#de50ee63274ad6d6#), N (16#74d24549bb0b95a5#)),
LSC.Internal.SHA512.Block_Type'(
N (16#7c11d824625f1080#), N (16#b46895271e8547f1#), N (16#440df9c275bc4578#), N (16#979905e940683d18#),
N (16#87d089c49b91fdfc#), N (16#a31cffc297d3e156#), N (16#d06360c9695a2914#), N (16#aa10cfe1c90ff89e#),
N (16#9a75f63eed5fdca7#), N (16#a11bee9a01246a17#), N (16#76aba38f962a1cf7#), N (16#e1df2e5834d8b4c5#),
N (16#23dcdae23ce5de10#), N (16#a23ea0978a51ea7b#), N (16#76df2b1631741fe4#), N (16#510dc8cc08dcabf2#)),
others => LSC.Internal.SHA512.Block_Type'(others => 0)
);
-- Compare with hexdump of HMAC_SHA512-HASH-2.dat
Assert
(LSC.Internal.HMAC_SHA512.Authenticate (Key, Message, 5120) =
LSC.Internal.HMAC_SHA512.Auth_Type'(
N (16#412015d264458463#), N (16#0c23f0685dce9e06#), N (16#d790cd4af47e70b7#), N (16#4809daea24ebdcd4#)),
"Invalid HMAC");
end Test_SHA512_Multi_2;
---------------------------------------------------------------------------
procedure Test_SHA512_Multi_3 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.SHA512.Message_Index range 1 .. 11;
subtype Message_Type is LSC.Internal.SHA512.Message_Type (Message_Index);
Key : LSC.Internal.SHA512.Block_Type;
Message : Message_Type;
begin
Key := LSC.Internal.SHA512.Block_Type'(
N (16#f1bcc392d8719db7#), N (16#e2e3203e0ebd53b2#), N (16#147de675accd7087#), N (16#1950385efcda6037#),
N (16#d3f6a21d97768626#), N (16#7274ff83def9538a#), N (16#9ccc7d7bfa48f464#), N (16#ec2d522d05e62c8b#),
N (16#0000000000000000#), N (16#0000000000000000#), N (16#0000000000000000#), N (16#0000000000000000#),
N (16#0000000000000000#), N (16#0000000000000000#), N (16#0000000000000000#), N (16#0000000000000000#)
);
Message := Message_Type'(
LSC.Internal.SHA512.Block_Type'(
N (16#f92a476300000005#), N (16#4242424242424242#), N (16#4242424242424242#), N (16#5ff43fd476a405d4#),
N (16#d4938bbfaa6b5910#), N (16#232828fe4048276a#), N (16#0f92b99bac0a36e9#), N (16#5e410224a875a63a#),
N (16#e032760b769970e0#), N (16#334776bf31223842#), N (16#c70c5e58a3ad72ad#), N (16#a007112a8378e6c9#),
N (16#64964368933b7cca#), N (16#32080e54cd38e9fd#), N (16#4f863df05078ea29#), others => 0),
others => LSC.Internal.SHA512.Block_Type'(others => 0)
);
Assert
(LSC.Internal.HMAC_SHA512.Authenticate (Key, Message, 16#3c0#) =
LSC.Internal.HMAC_SHA512.Auth_Type'(
N (16#dc3081d890ce1209#), N (16#ca7c0618f35c7da8#), N (16#6ca43d462ce7a92e#), N (16#157e2b8865381a6f#)),
"Invalid HMAC");
end Test_SHA512_Multi_3;
---------------------------------------------------------------------------
procedure Test_SHA512_Multi_4 (T : in out Test_Cases.Test_Case'Class)
is
subtype Message_Index is LSC.Internal.SHA512.Message_Index range 1 .. 11;
subtype Message_Type is LSC.Internal.SHA512.Message_Type (Message_Index);
Key : LSC.Internal.SHA512.Block_Type;
Message : Message_Type;
begin
Key := LSC.Internal.SHA512.Block_Type'(
N (16#f1bcc392d8719db7#), N (16#e2e3203e0ebd53b2#), N (16#147de675accd7087#), N (16#1950385efcda6037#),
N (16#d3f6a21d97768626#), N (16#7274ff83def9538a#), N (16#9ccc7d7bfa48f464#), N (16#ec2d522d05e62c8b#),
N (16#0000000000000000#), N (16#0000000000000000#), N (16#0000000000000000#), N (16#0000000000000000#),
N (16#0000000000000000#), N (16#0000000000000000#), N (16#0000000000000000#), N (16#0000000000000000#)
);
Message := Message_Type'(
LSC.Internal.SHA512.Block_Type'(
N (16#f92a476300000005#), N (16#4242424242424242#), N (16#4242424242424242#), N (16#5ff43fd476a405d4#),
N (16#d4938bbfaa6b5910#), N (16#232828fe4048276a#), N (16#0f92b99bac0a36e9#), N (16#5e410224a875a63a#),
N (16#e032760b769970e0#), N (16#334776bf31223842#), N (16#c70c5e58a3ad72ad#), N (16#a007112a8378e6c9#),
N (16#64964368933b7cca#), N (16#32080e54cd38e9fd#), N (16#4f863df05078ea29#), N (16#dc3081d890ce1209#)),
LSC.Internal.SHA512.Block_Type'(
N (16#ca7c0618f35c7da8#), N (16#6ca43d462ce7a92e#), N (16#157e2b8865381a6f#), others => 0),
others => LSC.Internal.SHA512.Block_Type'(others => 0)
);
-- Note that we hash only part of the message (leaving out the last 4 64-bit values).
-- This should result in the same authentication value as MULTI-3!
Assert
(LSC.Internal.HMAC_SHA512.Authenticate (Key, Message, 16#3c0#) =
LSC.Internal.HMAC_SHA512.Auth_Type'(
N (16#dc3081d890ce1209#), N (16#ca7c0618f35c7da8#), N (16#6ca43d462ce7a92e#), N (16#157e2b8865381a6f#)),
"Invalid HMAC");
end Test_SHA512_Multi_4;
---------------------------------------------------------------------------
procedure Register_Tests (T : in out Test_Case) is
use AUnit.Test_Cases.Registration;
begin
Register_Routine (T, Test_RIPEMD160_Auth_1'Access, "RIPEMD160 (AUTH-1)");
Register_Routine (T, Test_RIPEMD160_Auth_2'Access, "RIPEMD160 (AUTH-2)");
Register_Routine (T, Test_RIPEMD160_Auth_3'Access, "RIPEMD160 (AUTH-3)");
Register_Routine (T, Test_RIPEMD160_Auth_4'Access, "RIPEMD160 (AUTH-4)");
Register_Routine (T, Test_RIPEMD160_Multi_1'Access, "RIPEMD160 (MULTI-1)");
Register_Routine (T, Test_RIPEMD160_Multi_2'Access, "RIPEMD160 (MULTI-2)");
Register_Routine (T, Test_SHA1_Auth_1'Access, "SHA1 (AUTH-1)");
Register_Routine (T, Test_SHA1_Auth_2'Access, "SHA1 (AUTH-2)");
Register_Routine (T, Test_SHA1_Auth_3'Access, "SHA1 (AUTH-3)");
Register_Routine (T, Test_SHA1_Auth_4'Access, "SHA1 (AUTH-4)");
Register_Routine (T, Test_SHA1_Auth_5'Access, "SHA1 (AUTH-5)");
Register_Routine (T, Test_SHA1_Multi_1'Access, "SHA1 (MULTI-1)");
Register_Routine (T, Test_SHA1_Multi_2'Access, "SHA1 (MULTI-2)");
Register_Routine (T, Test_SHA256_Prf_1'Access, "SHA256 (PRF-1)");
Register_Routine (T, Test_SHA256_Prf_2'Access, "SHA256 (PRF-2)");
Register_Routine (T, Test_SHA256_Prf_3'Access, "SHA256 (PRF-3)");
Register_Routine (T, Test_SHA256_Prf_4'Access, "SHA256 (PRF-4)");
Register_Routine (T, Test_SHA256_Auth_1'Access, "SHA256 (AUTH-1)");
Register_Routine (T, Test_SHA256_Auth_2'Access, "SHA256 (AUTH-2)");
Register_Routine (T, Test_SHA256_Auth_3'Access, "SHA256 (AUTH-3)");
Register_Routine (T, Test_SHA256_Auth_4'Access, "SHA256 (AUTH-4)");
Register_Routine (T, Test_SHA256_Multi_1'Access, "SHA256 (MULTI-1)");
Register_Routine (T, Test_SHA256_Multi_2'Access, "SHA256 (MULTI-2)");
Register_Routine (T, Test_SHA384_Prf_1'Access, "SHA384 (PRF-1)");
Register_Routine (T, Test_SHA384_Prf_2'Access, "SHA384 (PRF-2)");
Register_Routine (T, Test_SHA384_Prf_3'Access, "SHA384 (PRF-3)");
Register_Routine (T, Test_SHA384_Prf_4'Access, "SHA384 (PRF-4)");
Register_Routine (T, Test_SHA384_Auth_1'Access, "SHA384 (AUTH-1)");
Register_Routine (T, Test_SHA384_Auth_2'Access, "SHA384 (AUTH-2)");
Register_Routine (T, Test_SHA384_Auth_3'Access, "SHA384 (AUTH-3)");
Register_Routine (T, Test_SHA384_Auth_4'Access, "SHA384 (AUTH-4)");
Register_Routine (T, Test_SHA384_Multi_1'Access, "SHA384 (MULTI-1)");
Register_Routine (T, Test_SHA384_Multi_2'Access, "SHA384 (MULTI-2)");
Register_Routine (T, Test_SHA512_Prf_1'Access, "SHA512 (PRF-1)");
Register_Routine (T, Test_SHA512_Prf_2'Access, "SHA512 (PRF-2)");
Register_Routine (T, Test_SHA512_Prf_3'Access, "SHA512 (PRF-3)");
Register_Routine (T, Test_SHA512_Prf_4'Access, "SHA512 (PRF-4)");
Register_Routine (T, Test_SHA512_Auth_1'Access, "SHA512 (AUTH-1)");
Register_Routine (T, Test_SHA512_Auth_2'Access, "SHA512 (AUTH-2)");
Register_Routine (T, Test_SHA512_Auth_3'Access, "SHA512 (AUTH-3)");
Register_Routine (T, Test_SHA512_Auth_4'Access, "SHA512 (AUTH-4)");
Register_Routine (T, Test_SHA512_Multi_1'Access, "SHA512 (MULTI-1)");
Register_Routine (T, Test_SHA512_Multi_2'Access, "SHA512 (MULTI-2)");
Register_Routine (T, Test_SHA512_Multi_3'Access, "SHA512 (MULTI-3)");
Register_Routine (T, Test_SHA512_Multi_4'Access, "SHA512 (MULTI-4)");
end Register_Tests;
---------------------------------------------------------------------------
function Name (T : Test_Case) return Test_String is
begin
return Format ("HMAC");
end Name;
end LSC_Internal_Test_HMAC;
|
------------------------------------------------------------------------------
-- G E L A A S I S --
-- ASIS implementation for Gela project, a portable Ada compiler --
-- http://gela.ada-ru.org --
-- - - - - - - - - - - - - - - - --
-- Read copyright and license at the end of this file --
------------------------------------------------------------------------------
-- $Revision: 209 $ $Date: 2013-11-30 21:03:24 +0200 (Сб., 30 нояб. 2013) $
function Regular_Expressions.Create
(Source : String) return Expression;
------------------------------------------------------------------------------
-- Copyright (c) 2006-2013, Maxim Reznik
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
--
-- * Redistributions of source code must retain the above copyright notice,
-- this list of conditions and the following disclaimer.
-- * Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
-- * Neither the name of the Maxim Reznik, IE nor the names of its
-- contributors may be used to endorse or promote products derived from
-- this software without specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
-- LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
-- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-- POSSIBILITY OF SUCH DAMAGE.
------------------------------------------------------------------------------
|
-- C61010A.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- CHECK THAT AN IN OR IN OUT FORMAL PARAMETER CAN BE DECLARED WITH A
-- LIMITED PRIVATE TYPE OR A LIMITED COMPOSITE TYPE.
-- DAS 1/22/81
-- JRK 1/20/84 TOTALLY REVISED.
WITH REPORT; USE REPORT;
PROCEDURE C61010A IS
PACKAGE PKG IS
TYPE ITYPE IS LIMITED PRIVATE;
PROCEDURE LOOK_IN_I (X : IN ITYPE; V : INTEGER; M : STRING);
PROCEDURE LOOK_INOUT_I (X : IN OUT ITYPE; V : INTEGER;
M : STRING);
PROCEDURE SET_I (X : IN OUT ITYPE; V : INTEGER);
SUBTYPE INT_0_20 IS INTEGER RANGE 0 .. 20;
TYPE VRTYPE (C : INT_0_20 := 20) IS LIMITED PRIVATE;
PROCEDURE LOOK_IN_VR (X : IN VRTYPE; C : INTEGER; I : INTEGER;
S : STRING; M : STRING);
PROCEDURE LOOK_INOUT_VR (X : IN OUT VRTYPE; C : INTEGER;
I : INTEGER; S : STRING;
M : STRING);
PROCEDURE SET_VR (X : IN OUT VRTYPE; C : INTEGER; I : INTEGER;
S : STRING);
PRIVATE
TYPE ITYPE IS NEW INTEGER RANGE 0 .. 99;
TYPE VRTYPE (C : INT_0_20 := 20) IS
RECORD
I : INTEGER;
S : STRING (1 .. C);
END RECORD;
END PKG;
USE PKG;
I1 : ITYPE;
TYPE ATYPE IS ARRAY (1 .. 3) OF ITYPE;
A1 : ATYPE;
VR1 : VRTYPE;
D : CONSTANT INT_0_20 := 10;
TYPE RTYPE IS
RECORD
J : ITYPE;
R : VRTYPE (D);
END RECORD;
R1 : RTYPE;
PACKAGE BODY PKG IS
PROCEDURE LOOK_IN_I (X : IN ITYPE; V : INTEGER; M : STRING) IS
BEGIN
IF INTEGER (X) /= V THEN
FAILED ("WRONG SCALAR VALUE - " & M);
END IF;
END LOOK_IN_I;
PROCEDURE LOOK_INOUT_I (X : IN OUT ITYPE; V : INTEGER;
M : STRING) IS
BEGIN
IF INTEGER (X) /= V THEN
FAILED ("WRONG SCALAR VALUE - " & M);
END IF;
END LOOK_INOUT_I;
PROCEDURE SET_I (X : IN OUT ITYPE; V : INTEGER) IS
BEGIN
X := ITYPE (IDENT_INT (V));
END SET_I;
PROCEDURE LOOK_IN_VR (X : IN VRTYPE; C : INTEGER; I : INTEGER;
S : STRING; M : STRING) IS
BEGIN
IF (X.C /= C OR X.I /= I) OR ELSE X.S /= S THEN
FAILED ("WRONG COMPOSITE VALUE - " & M);
END IF;
END LOOK_IN_VR;
PROCEDURE LOOK_INOUT_VR (X : IN OUT VRTYPE; C : INTEGER;
I : INTEGER; S : STRING;
M : STRING) IS
BEGIN
IF (X.C /= C OR X.I /= I) OR ELSE X.S /= S THEN
FAILED ("WRONG COMPOSITE VALUE - " & M);
END IF;
END LOOK_INOUT_VR;
PROCEDURE SET_VR (X : IN OUT VRTYPE; C : INTEGER; I : INTEGER;
S : STRING) IS
BEGIN
X := (IDENT_INT(C), IDENT_INT(I), IDENT_STR(S));
END SET_VR;
BEGIN
I1 := ITYPE (IDENT_INT(2));
FOR I IN A1'RANGE LOOP
A1 (I) := ITYPE (3 + IDENT_INT(I));
END LOOP;
VR1 := (IDENT_INT(5), IDENT_INT(4), IDENT_STR("01234"));
R1.J := ITYPE (IDENT_INT(6));
R1.R := (IDENT_INT(D), IDENT_INT(19),
IDENT_STR("ABCDEFGHIJ"));
END PKG;
PROCEDURE CHECK_IN_I (X : IN ITYPE; V : INTEGER; M : STRING) IS
BEGIN
LOOK_IN_I (X, V, M);
END CHECK_IN_I;
PROCEDURE CHECK_INOUT_I (X : IN OUT ITYPE; OV : INTEGER;
NV : INTEGER; M : STRING) IS
BEGIN
LOOK_INOUT_I (X, OV, M & " - A");
SET_I (X, NV);
LOOK_INOUT_I (X, NV, M & " - B");
LOOK_IN_I (X, NV, M & " - C");
END CHECK_INOUT_I;
PROCEDURE CHECK_IN_A (X : IN ATYPE; V : INTEGER; M : STRING) IS
BEGIN
FOR I IN X'RANGE LOOP
LOOK_IN_I (X(I), V+I, M & " -" & INTEGER'IMAGE (I));
END LOOP;
END CHECK_IN_A;
PROCEDURE CHECK_INOUT_A (X : IN OUT ATYPE; OV : INTEGER;
NV : INTEGER; M : STRING) IS
BEGIN
FOR I IN X'RANGE LOOP
LOOK_INOUT_I (X(I), OV+I, M & " - A" &
INTEGER'IMAGE (I));
SET_I (X(I), NV+I);
LOOK_INOUT_I (X(I), NV+I, M & " - B" &
INTEGER'IMAGE (I));
LOOK_IN_I (X(I), NV+I, M & " - C" & INTEGER'IMAGE (I));
END LOOP;
END CHECK_INOUT_A;
PROCEDURE CHECK_IN_VR (X : IN VRTYPE; C : INTEGER; I : INTEGER;
S : STRING; M : STRING) IS
BEGIN
LOOK_IN_VR (X, C, I, S, M);
END CHECK_IN_VR;
PROCEDURE CHECK_INOUT_VR (X : IN OUT VRTYPE;
OC : INTEGER; OI : INTEGER; OS : STRING;
NC : INTEGER; NI : INTEGER; NS : STRING;
M : STRING) IS
BEGIN
LOOK_INOUT_VR (X, OC, OI, OS, M & " - A");
SET_VR (X, NC, NI, NS);
LOOK_INOUT_VR (X, NC, NI, NS, M & " - B");
LOOK_IN_VR (X, NC, NI, NS, M & " - C");
END CHECK_INOUT_VR;
PROCEDURE CHECK_IN_R (X : IN RTYPE; J : INTEGER; C : INTEGER;
I : INTEGER; S : STRING; M : STRING) IS
BEGIN
LOOK_IN_I (X.J, J, M & " - A");
LOOK_IN_VR (X.R, C, I, S, M & " - B");
END CHECK_IN_R;
PROCEDURE CHECK_INOUT_R (X : IN OUT RTYPE; OJ : INTEGER;
OC : INTEGER; OI : INTEGER; OS : STRING;
NJ : INTEGER;
NC : INTEGER; NI : INTEGER; NS : STRING;
M : STRING) IS
BEGIN
LOOK_INOUT_I (X.J, OJ, M & " - A");
LOOK_INOUT_VR (X.R, OC, OI, OS, M & " - B");
SET_I (X.J, NJ);
SET_VR (X.R, NC, NI, NS);
LOOK_INOUT_I (X.J, NJ, M & " - C");
LOOK_INOUT_VR (X.R, NC, NI, NS, M & " - D");
LOOK_IN_I (X.J, NJ, M & " - E");
LOOK_IN_VR (X.R, NC, NI, NS, M & " - F");
END CHECK_INOUT_R;
BEGIN
TEST ("C61010A", "CHECK THAT LIMITED PRIVATE/COMPOSITE TYPES " &
"CAN BE USED AS IN OR IN OUT FORMAL PARAMETERS");
CHECK_IN_I (I1, 2, "IN I");
CHECK_INOUT_I (I1, 2, 5, "INOUT I");
CHECK_IN_A (A1, 3, "IN A");
CHECK_INOUT_A (A1, 3, 17, "INOUT A");
CHECK_IN_VR (VR1, 5, 4, "01234", "IN VR");
CHECK_INOUT_VR (VR1, 5, 4, "01234", 10, 11, "9876543210",
"INOUT VR");
CHECK_IN_R (R1, 6, D, 19, "ABCDEFGHIJ", "IN R");
CHECK_INOUT_R (R1, 6, D, 19, "ABCDEFGHIJ", 13, D, 5, "ZYXWVUTSRQ",
"INOUT R");
RESULT;
END C61010A;
|
-- Copyright 2010, 2011 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package body Pck is
function Bar return Rec is
begin
return (X => 42, S => "ABCDEFGH");
end Bar;
procedure Do_Nothing (A : System.Address) is
begin
null;
end Do_Nothing;
end Pck;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUNTIME COMPONENTS --
-- --
-- S Y S T E M . I M G _ W I U --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992,1993,1994,1995 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.Unsigned_Types; use System.Unsigned_Types;
package body System.Img_WIU is
-----------------------------
-- Set_Image_Width_Integer --
-----------------------------
procedure Set_Image_Width_Integer
(V : Integer;
W : Integer;
S : out String;
P : in out Natural)
is
Start : Natural;
begin
-- Positive case can just use the unsigned circuit directly
if V >= 0 then
Set_Image_Width_Unsigned (Unsigned (V), W, S, P);
-- Negative case has to set a minus sign. Note also that we have to be
-- careful not to generate overflow with the largest negative number.
else
P := P + 1;
S (P) := ' ';
Start := P;
declare
pragma Suppress (Overflow_Check);
pragma Suppress (Range_Check);
begin
Set_Image_Width_Unsigned (Unsigned (-V), W - 1, S, P);
end;
-- Set minus sign in last leading blank location. Because of the
-- code above, there must be at least one such location.
while S (Start + 1) = ' ' loop
Start := Start + 1;
end loop;
S (Start) := '-';
end if;
end Set_Image_Width_Integer;
------------------------------
-- Set_Image_Width_Unsigned --
------------------------------
procedure Set_Image_Width_Unsigned
(V : Unsigned;
W : Integer;
S : out String;
P : in out Natural)
is
Start : constant Natural := P;
F, T : Natural;
procedure Set_Digits (T : Unsigned);
-- Set digits of absolute value of T
procedure Set_Digits (T : Unsigned) is
begin
if T >= 10 then
Set_Digits (T / 10);
P := P + 1;
S (P) := Character'Val (T mod 10 + Character'Pos ('0'));
else
P := P + 1;
S (P) := Character'Val (T + Character'Pos ('0'));
end if;
end Set_Digits;
-- Start of processing for Set_Image_Width_Unsigned
begin
Set_Digits (V);
-- Add leading spaces if required by width parameter
if P - Start < W then
F := P;
P := P + (W - (P - Start));
T := P;
while F > Start loop
S (T) := S (F);
T := T - 1;
F := F - 1;
end loop;
for J in Start + 1 .. T loop
S (J) := ' ';
end loop;
end if;
end Set_Image_Width_Unsigned;
end System.Img_WIU;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . V A L _ R E A L --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2021, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains routines for scanning real values for use in
-- Text_IO.Float_IO and the Value attribute.
generic
type Num is digits <>;
Maxpow : Positive;
Powten_Address : System.Address;
type Uns is mod <>;
package System.Val_Real is
pragma Preelaborate;
function Scan_Real
(Str : String;
Ptr : not null access Integer;
Max : Integer) return Num;
-- This function scans the string starting at Str (Ptr.all) for a valid
-- real literal according to the syntax described in (RM 3.5(43)). The
-- substring scanned extends no further than Str (Max). There are three
-- cases for the return:
--
-- If a valid real is found after scanning past any initial spaces, then
-- Ptr.all is updated past the last character of the real (but trailing
-- spaces are not scanned out).
--
-- If no valid real is found, then Ptr.all points either to an initial
-- non-blank character, or to Max + 1 if the field is all spaces and the
-- exception Constraint_Error is raised.
--
-- If a syntactically valid real is scanned, but the value is out of
-- range, or, in the based case, the base value is out of range or there
-- is an out of range digit, then Ptr.all points past the real literal,
-- and Constraint_Error is raised.
--
-- Note: these rules correspond to the requirements for leaving the
-- pointer positioned in Text_Io.Get
--
-- Note: if Str is null, i.e. if Max is less than Ptr, then this is a
-- special case of an all-blank string, and Ptr is unchanged, and hence
-- is greater than Max as required in this case.
--
-- Note: this routine should not be called with Str'Last = Positive'Last.
-- If this occurs Program_Error is raised with a message noting that this
-- case is not supported. Most such cases are eliminated by the caller.
function Value_Real (Str : String) return Num;
-- Used in computing X'Value (Str) where X is a floating-point type or an
-- ordinary fixed-point type. Str is the string argument of the attribute.
-- Constraint_Error is raised if the string is malformed, or if the value
-- out of range of Num.
end System.Val_Real;
|
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="11">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>set_assign_val</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>dest</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>dest</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>4</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>data1</name>
<fileName></fileName>
<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>30</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>tmp</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_4">
<Value>
<Obj>
<type>1</type>
<id>4</id>
<name>src</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>src</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</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="_5">
<Value>
<Obj>
<type>0</type>
<id>5</id>
<name>src_read</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>src</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>20</item>
<item>21</item>
</oprand_edges>
<opcode>read</opcode>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>6</id>
<name>tmp_read</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>22</item>
<item>23</item>
</oprand_edges>
<opcode>read</opcode>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>7</id>
<name>data1_read</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>30</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>25</item>
<item>26</item>
</oprand_edges>
<opcode>read</opcode>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name>tmp_cast_cast</name>
<fileName></fileName>
<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>33</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>sext_cast</name>
<fileName></fileName>
<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>33</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>sum</name>
<fileName></fileName>
<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>33</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>29</item>
<item>30</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>sum_cast</name>
<fileName></fileName>
<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>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>dest_addr</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>32</item>
<item>33</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name>dest_addr_req</name>
<fileName>C:/Users/sskalick/Xilinx/hash/hash/src/main.cpp</fileName>
<fileDirectory>c:/Users/sskalick/Xilinx/hash/hash/SDDebug/_sds/vhls</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>assign_val</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>c:/Users/sskalick/Xilinx/hash/hash/SDDebug/_sds/vhls</first>
<second class_id="12" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="13" tracking_level="0" version="0">
<first class_id="14" tracking_level="0" version="0">
<first>C:/Users/sskalick/Xilinx/hash/hash/src/main.cpp</first>
<second>assign_val</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>35</item>
<item>36</item>
<item>38</item>
</oprand_edges>
<opcode>writereq</opcode>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name></name>
<fileName>C:/Users/sskalick/Xilinx/hash/hash/src/main.cpp</fileName>
<fileDirectory>c:/Users/sskalick/Xilinx/hash/hash/SDDebug/_sds/vhls</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>assign_val</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>c:/Users/sskalick/Xilinx/hash/hash/SDDebug/_sds/vhls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Users/sskalick/Xilinx/hash/hash/src/main.cpp</first>
<second>assign_val</second>
</first>
<second>24</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>40</item>
<item>41</item>
<item>42</item>
<item>44</item>
<item>65</item>
</oprand_edges>
<opcode>write</opcode>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>dest_addr_resp</name>
<fileName>C:/Users/sskalick/Xilinx/hash/hash/src/main.cpp</fileName>
<fileDirectory>c:/Users/sskalick/Xilinx/hash/hash/SDDebug/_sds/vhls</fileDirectory>
<lineNumber>24</lineNumber>
<contextFuncName>assign_val</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>c:/Users/sskalick/Xilinx/hash/hash/SDDebug/_sds/vhls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Users/sskalick/Xilinx/hash/hash/src/main.cpp</first>
<second>assign_val</second>
</first>
<second>24</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>46</item>
<item>47</item>
<item>64</item>
</oprand_edges>
<opcode>writeresp</opcode>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name></name>
<fileName>C:/Users/sskalick/Xilinx/hash/hash/src/main.cpp</fileName>
<fileDirectory>c:/Users/sskalick/Xilinx/hash/hash/SDDebug/_sds/vhls</fileDirectory>
<lineNumber>25</lineNumber>
<contextFuncName>assign_val</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>c:/Users/sskalick/Xilinx/hash/hash/SDDebug/_sds/vhls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Users/sskalick/Xilinx/hash/hash/src/main.cpp</first>
<second>assign_val</second>
</first>
<second>25</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_17">
<Value>
<Obj>
<type>2</type>
<id>37</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_18">
<Value>
<Obj>
<type>2</type>
<id>43</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>15</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="_19">
<Obj>
<type>3</type>
<id>18</id>
<name>set_assign_val</name>
<fileName></fileName>
<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>5</item>
<item>6</item>
<item>7</item>
<item>8</item>
<item>9</item>
<item>10</item>
<item>11</item>
<item>12</item>
<item>14</item>
<item>15</item>
<item>16</item>
<item>17</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>18</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_20">
<id>21</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>5</sink_obj>
</item>
<item class_id_reference="20" object_id="_21">
<id>23</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>6</sink_obj>
</item>
<item class_id_reference="20" object_id="_22">
<id>26</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>7</sink_obj>
</item>
<item class_id_reference="20" object_id="_23">
<id>27</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_24">
<id>28</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_25">
<id>29</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_26">
<id>30</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_27">
<id>31</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_28">
<id>32</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_29">
<id>33</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_30">
<id>36</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_31">
<id>38</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_32">
<id>41</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_33">
<id>42</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_34">
<id>44</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_35">
<id>47</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_36">
<id>64</id>
<edge_type>4</edge_type>
<source_obj>15</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_37">
<id>65</id>
<edge_type>4</edge_type>
<source_obj>14</source_obj>
<sink_obj>15</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="_38">
<mId>1</mId>
<mTag>set_assign_val</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>18</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>7</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_39">
<states class_id="25" tracking_level="0" version="0">
<count>8</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_40">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_41">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_42">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_43">
<id>8</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_44">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_45">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_46">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_47">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_48">
<id>2</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_49">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_50">
<id>3</id>
<operations>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_51">
<id>5</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_52">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_53">
<id>4</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_54">
<id>16</id>
<stage>5</stage>
<latency>5</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_55">
<id>5</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_56">
<id>16</id>
<stage>4</stage>
<latency>5</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_57">
<id>6</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_58">
<id>16</id>
<stage>3</stage>
<latency>5</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_59">
<id>7</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_60">
<id>16</id>
<stage>2</stage>
<latency>5</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_61">
<id>8</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_62">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_63">
<id>16</id>
<stage>1</stage>
<latency>5</latency>
</item>
<item class_id_reference="28" object_id="_64">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_65">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>8</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="_66">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>9</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="_67">
<inState>3</inState>
<outState>4</outState>
<condition>
<id>10</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="_68">
<inState>4</inState>
<outState>5</outState>
<condition>
<id>11</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="_69">
<inState>5</inState>
<outState>6</outState>
<condition>
<id>12</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="_70">
<inState>6</inState>
<outState>7</outState>
<condition>
<id>13</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="_71">
<inState>7</inState>
<outState>8</outState>
<condition>
<id>14</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="-1"></res>
<node_label_latency class_id="35" tracking_level="0" version="0">
<count>12</count>
<item_version>0</item_version>
<item class_id="36" tracking_level="0" version="0">
<first>5</first>
<second class_id="37" tracking_level="0" version="0">
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>6</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>7</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>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>10</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>14</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>3</first>
<second>4</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="38" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="39" tracking_level="0" version="0">
<first>18</first>
<second class_id="40" tracking_level="0" version="0">
<first>0</first>
<second>7</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="41" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</regions>
<dp_fu_nodes class_id="42" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="43" tracking_level="0" version="0">
<first>32</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>6</item>
</second>
</item>
<item>
<first>38</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</second>
</item>
<item>
<first>44</first>
<second>
<count>7</count>
<item_version>0</item_version>
<item>14</item>
<item>15</item>
<item>16</item>
<item>16</item>
<item>16</item>
<item>16</item>
<item>16</item>
</second>
</item>
<item>
<first>51</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>5</item>
</second>
</item>
<item>
<first>62</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>66</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>70</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>76</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>80</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="45" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="46" tracking_level="0" version="0">
<first>dest_addr_fu_80</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>sext_cast_fu_66</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>sum_cast_fu_76</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>sum_fu_70</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>tmp_cast_cast_fu_62</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>4</count>
<item_version>0</item_version>
<item>
<first>data1_read_read_fu_38</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</second>
</item>
<item>
<first>grp_writeresp_fu_44</first>
<second>
<count>7</count>
<item_version>0</item_version>
<item>14</item>
<item>15</item>
<item>16</item>
<item>16</item>
<item>16</item>
<item>16</item>
<item>16</item>
</second>
</item>
<item>
<first>src_read_read_fu_51</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>5</item>
</second>
</item>
<item>
<first>tmp_read_read_fu_32</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>6</item>
</second>
</item>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="47" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>1</count>
<item_version>0</item_version>
<item>
<first>86</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>1</count>
<item_version>0</item_version>
<item>
<first>dest_addr_reg_86</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="48" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="49" tracking_level="0" version="0">
<first>data1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</second>
</item>
</second>
</item>
<item>
<first>dest</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>src</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>5</item>
</second>
</item>
</second>
</item>
<item>
<first>tmp</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>6</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="50" 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>
|
with J_String_Pkg, Text_IO, Ada.Integer_Text_IO;
use J_String_Pkg, Text_IO, Ada.Integer_Text_IO;
procedure spec is
Str : String := "test";
Js : J_String := Create(Str);
Js1 : J_String := Create("test");
Js2 : J_String := Create("tes");
numberOfTests : Natural := 46;
numberOfpassedTests : Natural := 0;
procedure passed(Func : String) is
begin
Put_Line(Func & " - passed");
numberOfpassedTests := numberOfpassedTests + 1;
end passed;
begin
if Value_Of(Create("asd")) = "asd" then
passed("Create");
end if;
if Value_Of(Js) = "test" then
passed("Value_Of");
end if;
if Char_At(Js, 1) = 't' then
passed("Char_At");
end if;
if Compare_To(Js, Js1) then
passed("Compare_To");
end if;
if Compare_To(Js, Js2) = false then
passed("Compare_To");
end if;
if Value_Of(Concat(Js1, Js2)) = "testtes" then
passed("Concat");
end if;
if Contains(Js1, "es") then
passed("Contains");
end if;
if Contains(Js2, "os") = false then
passed("Contains");
end if;
if Ends_With(Js1, 't') then
passed("Ends_With");
end if;
if Ends_With(Js1, 'a') = false then
passed("Ends_With");
end if;
if Ends_With(Js1, "st") then
passed("Ends_With");
end if;
if Ends_With(Js1, "at") = false then
passed("Ends_With");
end if;
if Js = Js1 then
passed("=");
end if;
if Js1 /= Js2 then
passed("=");
end if;
if Index_Of(Js1, 's') = 3 then
passed("Index_Of");
end if;
if Index_Of(Js1, 't') = 1 then
passed("Index_Of");
end if;
if Index_Of(Js1, 'x') = -1 then
passed("Index_Of");
end if;
if Index_Of(Js1, 'e', 5) = -1 then
passed("Index_Of");
end if;
if Index_Of(Js1, "est") = 2 then
passed("Index_Of");
end if;
if Index_Of(Js1, "tes") = 1 then
passed("Index_Of");
end if;
if Index_Of(Js1, "testt") = -1 then
passed("Index_Of");
end if;
if Index_Of(Js1, "os") = -1 then
passed("Index_Of");
end if;
if Is_Empty(Create("")) then
passed("Is_Empty");
end if;
if Is_Empty(Create("a")) = false then
passed("Is_Empty");
end if;
if Last_Index_Of(Create("abca"), 'a') = 4 then
passed("Last_Index_Of");
end if;
if Last_Index_Of(Create("abca"), 'x') = -1 then
passed("Last_Index_Of");
end if;
if Last_Index_Of(Create("abca"), 'a', 3) = 1 then
passed("Last_Index_Of");
end if;
if Last_Index_Of(Create("abca"), 'c', 2) = -1 then
passed("Last_Index_Of");
end if;
if Last_Index_Of(Create("abc"), 'c', 4) = -1 then
passed("Last_Index_Of");
end if;
if Length(Create("abc")) = 3 then
passed("Length");
end if;
if Length(Create("a")) = 1 then
passed("Length");
end if;
if Length(Create("")) = 0 then
passed("Length");
end if;
if Value_Of(Replace(Create("abc"), 'b', 'x')) = "axc" then
passed("Replace");
end if;
if Value_Of(Replace(Create("abca"), 'a', 'x')) = "xbcx" then
passed("Replace");
end if;
if Starts_With(Create("abc"), 'a') then
passed("Starts_With");
end if;
if Starts_With(Create("bc"), 'a') = false then
passed("Starts_With");
end if;
if Starts_With(Create("a"), 'a') then
passed("Starts_With");
end if;
if Starts_With(Create("b"), 'a') = false then
passed("Starts_With");
end if;
if Starts_With(Create("abc"), "ab") then
passed("Starts_With");
end if;
if Starts_With(Create("abc"), "ba") = false then
passed("Starts_With");
end if;
if Starts_With(Create("abc"), "abc") then
passed("Starts_With");
end if;
if Starts_With(Create("abc"), "abcd") = false then
passed("Starts_With");
end if;
if Value_Of(Substring(Create("abc"), 1)) = "abc" then
passed("Substring");
end if;
if Value_Of(Substring(Create("abc"), 2)) = "bc" then
passed("Substring");
end if;
if Value_Of(Substring(Create("abc"), 1, 2)) = "ab" then
passed("Substring");
end if;
if Value_Of(Substring(Create("abc"), 1, 1)) = "a" then
passed("Substring");
end if;
Put_Line("===============");
Put(numberOfpassedTests, 0);
Put(" / ");
Put(numberOfTests, 0);
Put(" passed");
end spec;
|
-- Copyright (c) 2020-2021 Bartek thindil Jasicki <thindil@laeran.pl>
--
-- 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 Ada.Characters.Handling; use Ada.Characters.Handling;
with Ada.Characters.Latin_1; use Ada.Characters.Latin_1;
with Ada.Containers.Generic_Array_Sort;
with Ada.Strings; use Ada.Strings;
with Ada.Strings.Fixed; use Ada.Strings.Fixed;
with Interfaces.C; use Interfaces.C;
with Interfaces.C.Strings; use Interfaces.C.Strings;
with CArgv; use CArgv;
with Tcl; use Tcl;
with Tcl.Ada; use Tcl.Ada;
with Tcl.Tk.Ada; use Tcl.Tk.Ada;
with Tcl.Tk.Ada.Grid;
with Tcl.Tk.Ada.Widgets; use Tcl.Tk.Ada.Widgets;
with Tcl.Tk.Ada.Widgets.Canvas; use Tcl.Tk.Ada.Widgets.Canvas;
with Tcl.Tk.Ada.Widgets.Menu; use Tcl.Tk.Ada.Widgets.Menu;
with Tcl.Tk.Ada.Widgets.Toplevel.MainWindow;
use Tcl.Tk.Ada.Widgets.Toplevel.MainWindow;
with Tcl.Tk.Ada.Widgets.TtkButton; use Tcl.Tk.Ada.Widgets.TtkButton;
with Tcl.Tk.Ada.Widgets.TtkButton.TtkRadioButton;
use Tcl.Tk.Ada.Widgets.TtkButton.TtkRadioButton;
with Tcl.Tk.Ada.Widgets.TtkEntry.TtkComboBox;
use Tcl.Tk.Ada.Widgets.TtkEntry.TtkComboBox;
with Tcl.Tk.Ada.Widgets.TtkFrame; use Tcl.Tk.Ada.Widgets.TtkFrame;
with Tcl.Tk.Ada.Widgets.TtkLabel; use Tcl.Tk.Ada.Widgets.TtkLabel;
with Tcl.Tk.Ada.Widgets.TtkProgressBar; use Tcl.Tk.Ada.Widgets.TtkProgressBar;
with Tcl.Tk.Ada.Widgets.TtkScale; use Tcl.Tk.Ada.Widgets.TtkScale;
with Tcl.Tk.Ada.Widgets.TtkScrollbar; use Tcl.Tk.Ada.Widgets.TtkScrollbar;
with Tcl.Tk.Ada.Winfo; use Tcl.Tk.Ada.Winfo;
with Tcl.Tklib.Ada.Autoscroll; use Tcl.Tklib.Ada.Autoscroll;
with Tcl.Tklib.Ada.Tooltip; use Tcl.Tklib.Ada.Tooltip;
with Bases.Trade; use Bases.Trade;
with Config; use Config;
with CoreUI; use CoreUI;
with Dialogs; use Dialogs;
with Maps; use Maps;
with Maps.UI; use Maps.UI;
with Ships.Crew; use Ships.Crew;
with Table; use Table;
with Utils.UI; use Utils.UI;
package body Bases.RecruitUI is
-- ****iv* RecruitUI/RecruitUI.RecruitTable
-- FUNCTION
-- Table with info about the available recruits
-- SOURCE
RecruitTable: Table_Widget (6);
-- ****
-- ****iv* RecruitUI/RecruitUI.Modules_Indexes
-- FUNCTION
-- Indexes of the available recruits in base
-- SOURCE
Recruits_Indexes: Positive_Container.Vector;
-- ****
-- ****if* RecruitUI/RecruitUI.Get_Highest_Attribute
-- FUNCTION
-- Get the highest attribute's name of the selected recruit
-- PARAMETERS
-- BaseIndex - The index of the base in which the recruit's attributes
-- will be check
-- MemberIndex - The index of the recruit which attributes will be check
-- RESULT
-- The name of the attribute with the highest level of the selected recruit
-- HISTORY
-- 6.5 - Added
-- SOURCE
function Get_Highest_Attribute
(BaseIndex, MemberIndex: Positive) return Unbounded_String is
-- ****
use Tiny_String;
HighestLevel, HighestIndex: Positive := 1;
begin
Get_Highest_Attribute_Level_Loop :
for I in Sky_Bases(BaseIndex).Recruits(MemberIndex).Attributes'Range loop
if Sky_Bases(BaseIndex).Recruits(MemberIndex).Attributes(I).Level >
HighestLevel then
HighestLevel :=
Sky_Bases(BaseIndex).Recruits(MemberIndex).Attributes(I).Level;
HighestIndex := I;
end if;
end loop Get_Highest_Attribute_Level_Loop;
return
To_Unbounded_String
(To_String
(AttributesData_Container.Element(Attributes_List, HighestIndex)
.Name));
end Get_Highest_Attribute;
-- ****if* RecruitUI/RecruitUI.Get_Highest_Skill
-- FUNCTION
-- Get the highest skill's name of the selected recruit
-- PARAMETERS
-- BaseIndex - The index of the base in which the recruit's skills will
-- be check
-- MemberIndex - The index of the recruit which skills will be check
-- RESULT
-- The name of the skill with the highest level of the selected recruit
-- HISTORY
-- 6.5 - Added
-- SOURCE
function Get_Highest_Skill
(BaseIndex, MemberIndex: Positive) return Unbounded_String is
-- ****
use Tiny_String;
HighestLevel, HighestIndex: Positive := 1;
begin
Get_Highest_Skill_Level_Loop :
for Skill of Sky_Bases(BaseIndex).Recruits(MemberIndex).Skills loop
if Skill.Level > HighestLevel then
HighestLevel := Skill.Level;
HighestIndex := Skill.Index;
end if;
end loop Get_Highest_Skill_Level_Loop;
return
To_Unbounded_String
(To_String
(SkillsData_Container.Element(Skills_List, HighestIndex).Name));
end Get_Highest_Skill;
-- ****o* RecruitUI/RecruitUI.Show_Recruit_Command
-- FUNCTION
-- Show the selected base available recruits
-- PARAMETERS
-- ClientData - Custom data send to the command. Unused
-- Interp - Tcl interpreter in which command was executed.
-- Argc - Number of arguments passed to the command.
-- Argv - Values of arguments passed to the command.
-- RESULT
-- This function always return TCL_OK
-- COMMANDS
-- ShowRecruit
-- SOURCE
function Show_Recruit_Command
(ClientData: Integer; Interp: Tcl.Tcl_Interp; Argc: Interfaces.C.int;
Argv: CArgv.Chars_Ptr_Ptr) return Interfaces.C.int with
Convention => C;
-- ****
function Show_Recruit_Command
(ClientData: Integer; Interp: Tcl.Tcl_Interp; Argc: Interfaces.C.int;
Argv: CArgv.Chars_Ptr_Ptr) return Interfaces.C.int is
pragma Unreferenced(ClientData);
RecruitFrame: Ttk_Frame :=
Get_Widget(Main_Paned & ".recruitframe", Interp);
BaseIndex: constant Positive :=
SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).BaseIndex;
Page: constant Positive :=
(if Argc = 2 then Positive'Value(CArgv.Arg(Argv, 1)) else 1);
Start_Row: constant Positive :=
((Page - 1) * Game_Settings.Lists_Limit) + 1;
Current_Row: Positive := 1;
begin
if Winfo_Get(RecruitFrame, "exists") = "0" then
RecruitFrame := Create(Widget_Image(RecruitFrame));
RecruitTable :=
CreateTable
(Parent => Widget_Image(RecruitFrame),
Headers =>
(To_Unbounded_String("Name"), To_Unbounded_String("Gender"),
To_Unbounded_String("Faction"),
To_Unbounded_String("Base cost"),
To_Unbounded_String("Highest stat"),
To_Unbounded_String("Highest skill")),
Command => "SortRecruits",
Tooltip => "Press mouse button to sort the recruits.");
Bind
(RecruitFrame, "<Configure>",
"{ResizeCanvas " & RecruitTable.Canvas & " %w %h}");
elsif Winfo_Get(RecruitFrame, "ismapped") = "1" and
(Argc = 1 or Sky_Bases(BaseIndex).Recruits.Length = 0) then
Tcl.Tk.Ada.Grid.Grid_Remove(Close_Button);
Entry_Configure(GameMenu, "Help", "-command {ShowHelp general}");
ShowSkyMap(True);
return TCL_OK;
end if;
Entry_Configure(GameMenu, "Help", "-command {ShowHelp crew}");
Tcl.Tk.Ada.Grid.Grid(Close_Button, "-row 0 -column 1");
if Recruits_Indexes.Length /= Sky_Bases(BaseIndex).Recruits.Length then
Recruits_Indexes.Clear;
for I in Sky_Bases(BaseIndex).Recruits.Iterate loop
Recruits_Indexes.Append(Recruit_Container.To_Index(I));
end loop;
end if;
ClearTable(RecruitTable);
Load_Recruits_Loop :
for I of Recruits_Indexes loop
if Current_Row < Start_Row then
Current_Row := Current_Row + 1;
goto End_Of_Loop;
end if;
AddButton
(RecruitTable, To_String(Sky_Bases(BaseIndex).Recruits(I).Name),
"Show available options for recruit",
"ShowRecruitMenu" & Positive'Image(I), 1);
AddButton
(RecruitTable,
(if Sky_Bases(BaseIndex).Recruits(I).Gender = 'F' then "Female"
else "Male"),
"Show available options for recruit",
"ShowRecruitMenu" & Positive'Image(I), 2);
AddButton
(RecruitTable,
To_String
(Factions_List(Sky_Bases(BaseIndex).Recruits(I).Faction).Name),
"Show available options for recruit",
"ShowRecruitMenu" & Positive'Image(I), 3);
AddButton
(RecruitTable,
Positive'Image(Sky_Bases(BaseIndex).Recruits(I).Price),
"Show available options for recruit",
"ShowRecruitMenu" & Positive'Image(I), 4);
AddButton
(RecruitTable, To_String(Get_Highest_Attribute(BaseIndex, I)),
"Show available options for recruit",
"ShowRecruitMenu" & Positive'Image(I), 5);
AddButton
(RecruitTable, To_String(Get_Highest_Skill(BaseIndex, I)),
"Show available options for recruit",
"ShowRecruitMenu" & Positive'Image(I), 6, True);
exit Load_Recruits_Loop when RecruitTable.Row =
Game_Settings.Lists_Limit + 1;
<<End_Of_Loop>>
end loop Load_Recruits_Loop;
if Page > 1 then
if RecruitTable.Row < Game_Settings.Lists_Limit + 1 then
AddPagination
(RecruitTable, "ShowRecruit" & Positive'Image(Page - 1), "");
else
AddPagination
(RecruitTable, "ShowRecruit" & Positive'Image(Page - 1),
"ShowRecruit" & Positive'Image(Page + 1));
end if;
elsif RecruitTable.Row = Game_Settings.Lists_Limit + 1 then
AddPagination
(RecruitTable, "", "ShowRecruit" & Positive'Image(Page + 1));
end if;
UpdateTable(RecruitTable);
configure
(RecruitTable.Canvas,
"-scrollregion [list " & BBox(RecruitTable.Canvas, "all") & "]");
Show_Screen("recruitframe");
return TCL_OK;
end Show_Recruit_Command;
-- ****iv* RecruitUI/RecruitUI.RecruitIndex
-- FUNCTION
-- The index of currently selected recruit
-- SOURCE
RecruitIndex: Positive;
-- ****
-- ****o* RecruitUI/RecruitUI.Show_Recruit_Menu_Command
-- FUNCTION
-- Show menu with actions for the selected recruit
-- PARAMETERS
-- ClientData - Custom data send to the command. Unused
-- Interp - Tcl interpreter in which command was executed.
-- Argc - Number of arguments passed to the command. Unused
-- Argv - Values of arguments passed to the command.
-- RESULT
-- This function always return TCL_OK
-- COMMANDS
-- ShowRecruitMenu recruitindex
-- RecruitIndex is a index of the recruit which menu will be shown
-- SOURCE
function Show_Recruit_Menu_Command
(ClientData: Integer; Interp: Tcl.Tcl_Interp; Argc: Interfaces.C.int;
Argv: CArgv.Chars_Ptr_Ptr) return Interfaces.C.int with
Convention => C;
-- ****
function Show_Recruit_Menu_Command
(ClientData: Integer; Interp: Tcl.Tcl_Interp; Argc: Interfaces.C.int;
Argv: CArgv.Chars_Ptr_Ptr) return Interfaces.C.int is
pragma Unreferenced(ClientData, Argc);
RecruitMenu: Tk_Menu := Get_Widget(".recruitmenu", Interp);
begin
RecruitIndex := Positive'Value(CArgv.Arg(Argv, 1));
if Winfo_Get(RecruitMenu, "exists") = "0" then
RecruitMenu := Create(".recruitmenu", "-tearoff false");
end if;
Delete(RecruitMenu, "0", "end");
Menu.Add
(RecruitMenu, "command",
"-label {Show recruit details} -command {ShowRecruitInfo}");
Menu.Add
(RecruitMenu, "command",
"-label {Start negotiations} -command {Negotiate}");
Tk_Popup
(RecruitMenu, Winfo_Get(Get_Main_Window(Interp), "pointerx"),
Winfo_Get(Get_Main_Window(Interp), "pointery"));
return TCL_OK;
end Show_Recruit_Menu_Command;
-- ****o* RecruitUI/RecruitUI.Show_Recruit_Info_Command
-- FUNCTION
-- Show information about the selected recruit
-- PARAMETERS
-- ClientData - Custom data send to the command. Unused
-- Interp - Tcl interpreter in which command was executed.
-- Argc - Number of arguments passed to the command. Unused
-- Argv - Values of arguments passed to the command. Unused
-- RESULT
-- This function always return TCL_OK
-- COMMANDS
-- ShowRecruitInfoCommand
-- SOURCE
function Show_Recruit_Info_Command
(ClientData: Integer; Interp: Tcl.Tcl_Interp; Argc: Interfaces.C.int;
Argv: CArgv.Chars_Ptr_Ptr) return Interfaces.C.int with
Convention => C;
-- ****
function Show_Recruit_Info_Command
(ClientData: Integer; Interp: Tcl.Tcl_Interp; Argc: Interfaces.C.int;
Argv: CArgv.Chars_Ptr_Ptr) return Interfaces.C.int is
pragma Unreferenced(ClientData, Argc, Argv);
use Tiny_String;
RecruitInfo: Unbounded_String;
BaseIndex: constant Positive :=
SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).BaseIndex;
Recruit: constant Recruit_Data :=
Sky_Bases(BaseIndex).Recruits(RecruitIndex);
RecruitDialog: constant Ttk_Frame :=
Create_Dialog(".recruitdialog", To_String(Recruit.Name));
YScroll: constant Ttk_Scrollbar :=
Create
(RecruitDialog & ".yscroll",
"-orient vertical -command [list " & RecruitDialog &
".canvas yview]");
RecruitCanvas: constant Tk_Canvas :=
Create
(RecruitDialog & ".canvas",
"-yscrollcommand [list " & YScroll & " set]");
CloseButton, InfoButton, Button: Ttk_Button;
Height, NewHeight: Positive := 1;
Width, NewWidth: Positive := 1;
ProgressBar: Ttk_ProgressBar;
TabButton: Ttk_RadioButton;
Frame: Ttk_Frame := Create(RecruitDialog & ".buttonbox");
RecruitLabel: Ttk_Label;
ProgressFrame: Ttk_Frame;
TabNames: constant array(1 .. 4) of Unbounded_String :=
(To_Unbounded_String("General"), To_Unbounded_String("Attributes"),
To_Unbounded_String("Skills"), To_Unbounded_String("Inventory"));
begin
Tcl_SetVar(Interp, "newtab", To_Lower(To_String(TabNames(1))));
for I in TabNames'Range loop
TabButton :=
Create
(Frame & "." & To_Lower(To_String(TabNames(I))),
" -text " & To_String(TabNames(I)) &
" -style Radio.Toolbutton -value " &
To_Lower(To_String(TabNames(I))) &
" -variable newtab -command ShowRecruitTab");
Tcl.Tk.Ada.Grid.Grid
(TabButton, "-column" & Natural'Image(I - 1) & " -row 0");
Bind
(TabButton, "<Escape>",
"{" & RecruitDialog & ".buttonbox2.button invoke;break}");
end loop;
Height := Positive'Value(Winfo_Get(TabButton, "reqheight"));
Bind
(TabButton, "<Tab>",
"{focus " & RecruitDialog & ".buttonbox2.hirebutton;break}");
Tcl.Tk.Ada.Grid.Grid(Frame, "-pady {5 0} -columnspan 2");
Tcl.Tk.Ada.Grid.Grid(RecruitCanvas, "-sticky nwes -pady 5 -padx 5");
Tcl.Tk.Ada.Grid.Grid
(YScroll, " -sticky ns -pady 5 -padx {0 5} -row 1 -column 1");
Frame := Create(RecruitDialog & ".buttonbox2");
Button :=
Create
(RecruitDialog & ".buttonbox2.hirebutton",
"-text Negotiate -command {CloseDialog " & RecruitDialog &
";Negotiate}");
Tcl.Tk.Ada.Grid.Grid(Button);
CloseButton :=
Create
(RecruitDialog & ".buttonbox2.button",
"-text Close -command {CloseDialog " & RecruitDialog & "}");
Tcl.Tk.Ada.Grid.Grid(CloseButton, "-row 0 -column 1");
Tcl.Tk.Ada.Grid.Grid(Frame, "-pady {0 5}");
Focus(CloseButton);
Autoscroll(YScroll);
-- General info about the selected recruit
Frame := Create(RecruitCanvas & ".general");
if not Factions_List(Recruit.Faction).Flags.Contains
(To_Unbounded_String("nogender")) then
RecruitInfo :=
(if Recruit.Gender = 'M' then To_Unbounded_String("Gender: Male")
else To_Unbounded_String("Gender: Female"));
end if;
Append
(RecruitInfo,
LF & "Faction: " & Factions_List(Recruit.Faction).Name & LF &
"Home base: " & Sky_Bases(Recruit.Home_Base).Name);
RecruitLabel :=
Create
(Frame & ".label",
"-text {" & To_String(RecruitInfo) & "} -wraplength 400");
Tcl.Tk.Ada.Grid.Grid(RecruitLabel, "-sticky w");
Height := Height + Positive'Value(Winfo_Get(RecruitLabel, "reqheight"));
Width := Positive'Value(Winfo_Get(RecruitLabel, "reqwidth"));
Tcl.Tk.Ada.Grid.Grid(Frame);
-- Statistics of the selected recruit
Frame := Create(RecruitCanvas & ".attributes");
Show_Recruit_Stats_Loop :
for I in Recruit.Attributes'Range loop
ProgressFrame :=
Create(Frame & ".statinfo" & Trim(Positive'Image(I), Left));
RecruitLabel :=
Create
(ProgressFrame & ".label",
"-text {" &
To_String
(AttributesData_Container.Element(Attributes_List, I).Name) &
": " & GetAttributeLevelName(Recruit.Attributes(I).Level) & "}");
Tcl.Tk.Ada.Grid.Grid(RecruitLabel);
InfoButton :=
Create
(ProgressFrame & ".button",
"-text ""[format %c 0xf05a]"" -style Header.Toolbutton -command {ShowCrewStatsInfo" &
Positive'Image(I) & " .recruitdialog}");
Tcl.Tklib.Ada.Tooltip.Add
(InfoButton,
"Show detailed information about the selected attribute.");
Tcl.Tk.Ada.Grid.Grid(InfoButton, "-column 1 -row 0");
NewHeight :=
NewHeight + Positive'Value(Winfo_Get(InfoButton, "reqheight"));
Tcl.Tk.Ada.Grid.Grid(ProgressFrame);
ProgressBar :=
Create
(Frame & ".level" & Trim(Positive'Image(I), Left),
"-value" & Positive'Image(Recruit.Attributes(I).Level * 2) &
" -length 200");
Tcl.Tklib.Ada.Tooltip.Add
(ProgressBar, "The current level of the attribute.");
Tcl.Tk.Ada.Grid.Grid(ProgressBar);
NewHeight :=
NewHeight + Positive'Value(Winfo_Get(ProgressBar, "reqheight"));
end loop Show_Recruit_Stats_Loop;
if NewHeight > Height then
Height := NewHeight;
end if;
-- Skills of the selected recruit
Frame := Create(RecruitCanvas & ".skills");
NewHeight := 1;
Show_Recruit_Skills_Loop :
for I in Recruit.Skills.Iterate loop
ProgressFrame :=
Create
(Frame & ".skillinfo" &
Trim(Positive'Image(Skills_Container.To_Index(I)), Left));
RecruitLabel :=
Create
(ProgressFrame & ".label" &
Trim(Positive'Image(Skills_Container.To_Index(I)), Left),
"-text {" &
To_String
(SkillsData_Container.Element
(Skills_List, Recruit.Skills(I).Index)
.Name) &
": " & GetSkillLevelName(Recruit.Skills(I).Level) & "}");
Tcl.Tk.Ada.Grid.Grid(RecruitLabel);
declare
ToolQuality: Positive := 100;
begin
Tool_Quality_Loop :
for Quality of SkillsData_Container.Element
(Skills_List, Skills_Container.To_Index(I))
.Tools_Quality loop
if Recruit.Skills(I).Level <= Quality.Level then
ToolQuality := Quality.Quality;
exit Tool_Quality_Loop;
end if;
end loop Tool_Quality_Loop;
InfoButton :=
Create
(ProgressFrame & ".button",
"-text ""[format %c 0xf05a]"" -style Header.Toolbutton -command {ShowCrewSkillInfo" &
Positive'Image(Recruit.Skills(I).Index) &
Positive'Image(ToolQuality) & " .recruitdialog}");
end;
Tcl.Tklib.Ada.Tooltip.Add
(InfoButton, "Show detailed information about the selected skill.");
Tcl.Tk.Ada.Grid.Grid(InfoButton, "-column 1 -row 0");
NewHeight :=
NewHeight + Positive'Value(Winfo_Get(InfoButton, "reqheight"));
Tcl.Tk.Ada.Grid.Grid(ProgressFrame);
ProgressBar :=
Create
(Frame & ".level" &
Trim(Positive'Image(Skills_Container.To_Index(I)), Left),
"-value" & Positive'Image(Recruit.Skills(I).Level) &
" -length 200");
Tcl.Tklib.Ada.Tooltip.Add
(ProgressBar, "The current level of the skill.");
Tcl.Tk.Ada.Grid.Grid(ProgressBar);
NewHeight :=
NewHeight + Positive'Value(Winfo_Get(ProgressBar, "reqheight"));
end loop Show_Recruit_Skills_Loop;
if NewHeight > Height then
Height := NewHeight;
end if;
-- Equipment of the selected recruit
Frame := Create(RecruitCanvas & ".inventory");
NewHeight := 1;
RecruitInfo := Null_Unbounded_String;
Show_Recruit_Equipment_Loop :
for Item of Recruit.Inventory loop
Append(RecruitInfo, Items_List(Item).Name & LF);
end loop Show_Recruit_Equipment_Loop;
RecruitLabel :=
Create
(Frame & ".label",
"-text {" & To_String(RecruitInfo) & "} -wraplength 400");
Tcl.Tk.Ada.Grid.Grid(RecruitLabel, "-sticky w");
NewHeight := Positive'Value(Winfo_Get(RecruitLabel, "reqheight"));
if NewHeight > Height then
Height := NewHeight;
end if;
NewWidth := Positive'Value(Winfo_Get(RecruitLabel, "reqwidth"));
if NewWidth > Width then
Width := NewWidth;
end if;
if Height > 500 then
Height := 500;
end if;
if Width < 350 then
Width := 350;
end if;
Frame := Get_Widget(RecruitCanvas & ".general");
declare
XPos: constant Natural :=
(Positive'Value(Winfo_Get(RecruitCanvas, "reqwidth")) -
Positive'Value(Winfo_Get(Frame, "reqwidth"))) /
4;
begin
Canvas_Create
(RecruitCanvas, "window",
Trim(Natural'Image(XPos), Left) & " 0 -anchor nw -window " &
Frame & " -tag info");
end;
Tcl_Eval(Interp, "update");
configure
(RecruitCanvas,
"-scrollregion [list " & BBox(RecruitCanvas, "all") & "] -width" &
Positive'Image(Width) & " -height" & Positive'Image(Height));
Bind
(CloseButton, "<Tab>",
"{focus " & RecruitDialog & ".buttonbox.general;break}");
Bind(RecruitDialog, "<Escape>", "{" & CloseButton & " invoke;break}");
Bind(CloseButton, "<Escape>", "{" & CloseButton & " invoke;break}");
Show_Dialog(Dialog => RecruitDialog, Relative_Y => 0.2);
return TCL_OK;
end Show_Recruit_Info_Command;
-- ****o* RecruitUI/RecruitUI.Negotiate_Hire_Command
-- FUNCTION
-- Show information about the selected recruit
-- PARAMETERS
-- ClientData - Custom data send to the command. Unused
-- Interp - Tcl interpreter in which command was executed.
-- Argc - Number of arguments passed to the command. Unused
-- Argv - Values of arguments passed to the command. Unused
-- RESULT
-- This function always return TCL_OK
-- COMMANDS
-- NegotiateHire
-- SOURCE
function Negotiate_Hire_Command
(ClientData: Integer; Interp: Tcl.Tcl_Interp; Argc: Interfaces.C.int;
Argv: CArgv.Chars_Ptr_Ptr) return Interfaces.C.int with
Convention => C;
-- ****
function Negotiate_Hire_Command
(ClientData: Integer; Interp: Tcl.Tcl_Interp; Argc: Interfaces.C.int;
Argv: CArgv.Chars_Ptr_Ptr) return Interfaces.C.int is
pragma Unreferenced(ClientData, Argc, Argv);
DialogName: constant String := ".negotiatedialog";
MoneyIndex2: constant Natural :=
FindItem(Player_Ship.Cargo, Money_Index);
BaseIndex: constant Positive :=
SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).BaseIndex;
Recruit: constant Recruit_Data :=
Sky_Bases(BaseIndex).Recruits(RecruitIndex);
Cost: Integer;
Scale: Ttk_Scale := Get_Widget(DialogName & ".daily", Interp);
DailyPayment: constant Natural :=
Natural(Float'Value(cget(Scale, "-value")));
ContractBox: constant Ttk_ComboBox :=
Get_Widget(DialogName & ".contract", Interp);
ContractLength: constant Natural := Natural'Value(Current(ContractBox));
TradePayment: Natural;
Label: Ttk_Label := Get_Widget(DialogName & ".cost", Interp);
HireButton: constant Ttk_Button :=
Get_Widget(DialogName & ".buttonbox.hirebutton", Interp);
begin
Scale.Name := New_String(DialogName & ".percent");
TradePayment := Natural(Float'Value(cget(Scale, "-value")));
Cost :=
Recruit.Price - ((DailyPayment - Recruit.Payment) * 50) -
(TradePayment * 5_000);
Cost :=
(case ContractLength is
when 1 => Cost - Integer(Float(Recruit.Price) * 0.1),
when 2 => Cost - Integer(Float(Recruit.Price) * 0.5),
when 3 => Cost - Integer(Float(Recruit.Price) * 0.75),
when 4 => Cost - Integer(Float(Recruit.Price) * 0.9),
when others => Cost);
if Cost < 1 then
Cost := 1;
end if;
Count_Price(Cost, FindMember(Talk));
configure
(Label,
"-text {Hire for" & Natural'Image(Cost) & " " &
To_String(Money_Name) & "}");
Label.Name := New_String(DialogName & ".dailylbl");
configure
(Label, "-text {Daily payment:" & Natural'Image(DailyPayment) & "}");
Label.Name := New_String(DialogName & ".percentlbl");
configure
(Label,
"-text {Percent of profit from trades: " &
Natural'Image(TradePayment) & "}");
if MoneyIndex2 > 0
and then Player_Ship.Cargo(MoneyIndex2).Amount < Cost then
configure(HireButton, "-state disabled");
else
configure(HireButton, "-state !disabled");
end if;
return TCL_OK;
end Negotiate_Hire_Command;
-- ****o* RecruitUI/RecruitUI.Hire_Command
-- FUNCTION
-- Hire the selected recruit
-- PARAMETERS
-- ClientData - Custom data send to the command.
-- Interp - Tcl interpreter in which command was executed.
-- Argc - Number of arguments passed to the command. Unused
-- Argv - Values of arguments passed to the command. Unused
-- RESULT
-- This function always return TCL_OK
-- COMMANDS
-- Hire
-- SOURCE
function Hire_Command
(ClientData: Integer; Interp: Tcl.Tcl_Interp; Argc: Interfaces.C.int;
Argv: CArgv.Chars_Ptr_Ptr) return Interfaces.C.int with
Convention => C;
-- ****
function Hire_Command
(ClientData: Integer; Interp: Tcl.Tcl_Interp; Argc: Interfaces.C.int;
Argv: CArgv.Chars_Ptr_Ptr) return Interfaces.C.int is
pragma Unreferenced(Argc, Argv);
DialogName: constant String := ".negotiatedialog";
Cost, ContractLength2: Integer;
BaseIndex: constant Positive :=
SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).BaseIndex;
Recruit: constant Recruit_Data :=
Sky_Bases(BaseIndex).Recruits(RecruitIndex);
Scale: Ttk_Scale := Get_Widget(DialogName & ".daily", Interp);
DailyPayment: constant Natural :=
Natural(Float'Value(cget(Scale, "-value")));
ContractBox: constant Ttk_ComboBox :=
Get_Widget(DialogName & ".contract", Interp);
ContractLength: constant Natural := Natural'Value(Current(ContractBox));
TradePayment: Natural;
begin
Scale.Name := New_String(DialogName & ".percent");
TradePayment := Natural(Float'Value(cget(Scale, "-value")));
Cost :=
Recruit.Price - ((DailyPayment - Recruit.Payment) * 50) -
(TradePayment * 5_000);
case ContractLength is
when 1 =>
Cost := Cost - Integer(Float(Recruit.Price) * 0.1);
ContractLength2 := 100;
when 2 =>
Cost := Cost - Integer(Float(Recruit.Price) * 0.5);
ContractLength2 := 30;
when 3 =>
Cost := Cost - Integer(Float(Recruit.Price) * 0.75);
ContractLength2 := 20;
when 4 =>
Cost := Cost - Integer(Float(Recruit.Price) * 0.9);
ContractLength2 := 10;
when others =>
ContractLength2 := -1;
end case;
if Cost < 1 then
Cost := 1;
end if;
HireRecruit
(RecruitIndex, Cost, DailyPayment, TradePayment, ContractLength2);
Update_Messages;
Tcl_Eval(Interp, "CloseDialog " & DialogName);
return
Show_Recruit_Command
(ClientData, Interp, 2, CArgv.Empty & "ShowRecruit" & "1");
end Hire_Command;
-- ****o* RecruitUI/RecruitUI.Show_Recruit_Tab_Command
-- FUNCTION
-- Show the selected information about the selected recruit
-- PARAMETERS
-- ClientData - Custom data send to the command. Unused
-- Interp - Tcl interpreter in which command was executed.
-- Argc - Number of arguments passed to the command. Unused
-- Argv - Values of arguments passed to the command. Unused
-- RESULT
-- This function always return TCL_OK
-- COMMANDS
-- ShowMemberTab
-- SOURCE
function Show_Recruit_Tab_Command
(ClientData: Integer; Interp: Tcl.Tcl_Interp; Argc: Interfaces.C.int;
Argv: CArgv.Chars_Ptr_Ptr) return Interfaces.C.int with
Convention => C;
-- ****
function Show_Recruit_Tab_Command
(ClientData: Integer; Interp: Tcl.Tcl_Interp; Argc: Interfaces.C.int;
Argv: CArgv.Chars_Ptr_Ptr) return Interfaces.C.int is
pragma Unreferenced(ClientData, Argc, Argv);
RecruitCanvas: constant Tk_Canvas :=
Get_Widget(".recruitdialog.canvas", Interp);
Frame: constant Ttk_Frame :=
Get_Widget(RecruitCanvas & "." & Tcl_GetVar(Interp, "newtab"));
XPos: constant Natural :=
(Positive'Value(Winfo_Get(RecruitCanvas, "reqwidth")) -
Positive'Value(Winfo_Get(Frame, "reqwidth"))) /
2;
begin
Delete(RecruitCanvas, "info");
Canvas_Create
(RecruitCanvas, "window",
Trim(Positive'Image(XPos), Left) & " 0 -anchor nw -window " & Frame &
" -tag info");
Tcl_Eval(Interp, "update");
configure
(RecruitCanvas,
"-scrollregion [list " & BBox(RecruitCanvas, "all") & "]");
return TCL_OK;
end Show_Recruit_Tab_Command;
-- ****o* RecruitUI/RecruitUI.Negotiate_Command
-- FUNCTION
-- Show negotation UI to the player
-- PARAMETERS
-- ClientData - Custom data send to the command. Unused
-- Interp - Tcl interpreter in which command was executed. Unused
-- Argc - Number of arguments passed to the command. Unused
-- Argv - Values of arguments passed to the command. Unused
-- RESULT
-- This function always return TCL_OK
-- COMMANDS
-- Negotiate
-- SOURCE
function Negotiate_Command
(ClientData: Integer; Interp: Tcl.Tcl_Interp; Argc: Interfaces.C.int;
Argv: CArgv.Chars_Ptr_Ptr) return Interfaces.C.int with
Convention => C;
-- ****
function Negotiate_Command
(ClientData: Integer; Interp: Tcl.Tcl_Interp; Argc: Interfaces.C.int;
Argv: CArgv.Chars_Ptr_Ptr) return Interfaces.C.int is
pragma Unreferenced(ClientData, Interp, Argc, Argv);
BaseIndex: constant Positive :=
SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).BaseIndex;
Recruit: constant Recruit_Data :=
Sky_Bases(BaseIndex).Recruits(RecruitIndex);
NegotiateDialog: constant Ttk_Frame :=
Create_Dialog
(".negotiatedialog", "Negotiate with " & To_String(Recruit.Name));
CloseButton, HireButton: Ttk_Button;
Frame: constant Ttk_Frame := Create(NegotiateDialog & ".buttonbox");
Label: Ttk_Label;
Scale: Ttk_Scale;
ContractBox: constant Ttk_ComboBox :=
Create
(NegotiateDialog & ".contract",
"-state readonly -values [list {Pernament} {100 days} {30 days} {20 days} {10 days}]");
MoneyIndex2: constant Natural :=
FindItem(Player_Ship.Cargo, Money_Index);
Cost: Positive;
begin
Label :=
Create
(NegotiateDialog & ".dailylbl",
"-text {Daily payment:" & Natural'Image(Recruit.Payment) & "}");
Tcl.Tk.Ada.Grid.Grid(Label, "-pady {5 0}");
Scale :=
Create
(NegotiateDialog & ".daily",
"-from 0 -command NegotiateHire -length 250");
Tcl.Tk.Ada.Grid.Grid(Scale);
configure
(Scale,
"-to" & Natural'Image(Recruit.Payment * 2) & " -value" &
Natural'Image(Recruit.Payment));
Label :=
Create
(NegotiateDialog & ".percentlbl",
"-text {Percent of profit from trades: 0}");
Tcl.Tk.Ada.Grid.Grid(Label, "-padx 5");
Scale :=
Create
(NegotiateDialog & ".percent",
"-from 0 -to 10 -command NegotiateHire -length 250");
Tcl.Tk.Ada.Grid.Grid(Scale);
configure(Scale, "-value 0");
Label :=
Create(NegotiateDialog & ".contractlbl", "-text {Contract time:}");
Tcl.Tk.Ada.Grid.Grid(Label);
Tcl.Tk.Ada.Grid.Grid(ContractBox);
Bind(ContractBox, "<<ComboboxSelected>>", "{NegotiateHire}");
Current(ContractBox, "0");
HireButton :=
Create
(NegotiateDialog & ".buttonbox.hirebutton",
"-text Hire -command {Hire}");
Label := Create(NegotiateDialog & ".money");
Tcl.Tk.Ada.Grid.Grid(Label);
Cost := Recruit.Price;
Count_Price(Cost, FindMember(Talk));
if MoneyIndex2 > 0 then
configure
(Label,
"-text {You have" &
Natural'Image(Player_Ship.Cargo(MoneyIndex2).Amount) & " " &
To_String(Money_Name) & ".}");
if Player_Ship.Cargo(MoneyIndex2).Amount < Cost then
configure(HireButton, "-state disabled");
else
configure(HireButton, "-state !disabled");
end if;
else
configure
(Label, "-text {You don't have enough money to recruit anyone}");
configure(HireButton, "-state disabled");
end if;
Label := Create(NegotiateDialog & ".cost");
Tcl.Tk.Ada.Grid.Grid(Label);
configure
(Label,
"-text {Hire for" & Positive'Image(Cost) & " " &
To_String(Money_Name) & "}");
Tcl.Tk.Ada.Grid.Grid(HireButton);
CloseButton :=
Create
(NegotiateDialog & ".buttonbox.button",
"-text Close -command {CloseDialog " & NegotiateDialog & "}");
Tcl.Tk.Ada.Grid.Grid(CloseButton, "-row 0 -column 1");
Tcl.Tk.Ada.Grid.Grid(Frame, "-pady {0 5}");
Focus(CloseButton);
Bind(CloseButton, "<Tab>", "{focus " & HireButton & ";break}");
Bind(HireButton, "<Tab>", "{focus " & CloseButton & ";break}");
Bind(NegotiateDialog, "<Escape>", "{" & CloseButton & " invoke;break}");
Bind(CloseButton, "<Escape>", "{" & CloseButton & " invoke;break}");
Show_Dialog(Dialog => NegotiateDialog, Relative_Y => 0.2);
return TCL_OK;
end Negotiate_Command;
-- ****it* RecruitUI/RecruitUI.Recruits_Sort_Orders
-- FUNCTION
-- Sorting orders for the list of available recruits in base
-- OPTIONS
-- NAMEASC - Sort recruits by name ascending
-- NAMEDESC - Sort recruits by name descending
-- GENDERASC - Sort recruits by gender ascending
-- GENDERDESC - Sort recruits by gender descending
-- FACTIONASC - Sort recruits by faction ascending
-- FACTIONDESC - Sort recruits by faction descending
-- PRICEASC - Sort recruits by price ascending
-- PRICEDESC - Sort recruits by price descending
-- ATTRIBUTEASC - Sort recruits by attribute ascending
-- ATTRIBUTEDESC - Sort recruits by attribute descending
-- SKILLASC - Sort recruits by skill ascending
-- SKILLDESC - Sort recruits by skill descending
-- NONE - No sorting recruits (default)
-- HISTORY
-- 6.4 - Added
-- SOURCE
type Recruits_Sort_Orders is
(NAMEASC, NAMEDESC, GENDERASC, GENDERDESC, FACTIONDESC, FACTIONASC,
PRICEASC, PRICEDESC, ATTRIBUTEASC, ATTRIBUTEDESC, SKILLASC, SKILLDESC,
NONE) with
Default_Value => NONE;
-- ****
-- ****id* RecruitUI/RecruitUI.Default_Recruits_Sort_Order
-- FUNCTION
-- Default sorting order for the available recruits in base
-- HISTORY
-- 6.4 - Added
-- SOURCE
Default_Recruits_Sort_Order: constant Recruits_Sort_Orders := NONE;
-- ****
-- ****iv* RecruitUI/RecruitUI.Recruits_Sort_Order
-- FUNCTION
-- The current sorting order for the available recruits in base
-- HISTORY
-- 6.4 - Added
-- SOURCE
Recruits_Sort_Order: Recruits_Sort_Orders := Default_Recruits_Sort_Order;
-- ****
-- ****o* RecruitUI/RecruitUI.Sort_Recruits_Command
-- FUNCTION
-- Sort the list of available recruits in base
-- PARAMETERS
-- ClientData - Custom data send to the command.
-- Interp - Tcl interpreter in which command was executed.
-- Argc - Number of arguments passed to the command. Unused
-- Argv - Values of arguments passed to the command.
-- RESULT
-- This function always return TCL_OK
-- COMMANDS
-- SortRecruits x
-- X is X axis coordinate where the player clicked the mouse button
-- SOURCE
function Sort_Recruits_Command
(ClientData: Integer; Interp: Tcl.Tcl_Interp; Argc: Interfaces.C.int;
Argv: CArgv.Chars_Ptr_Ptr) return Interfaces.C.int with
Convention => C;
-- ****
function Sort_Recruits_Command
(ClientData: Integer; Interp: Tcl.Tcl_Interp; Argc: Interfaces.C.int;
Argv: CArgv.Chars_Ptr_Ptr) return Interfaces.C.int is
pragma Unreferenced(Argc);
Column: constant Positive :=
Get_Column_Number(RecruitTable, Natural'Value(CArgv.Arg(Argv, 1)));
type Local_Module_Data is record
Name: Unbounded_String;
Gender: Character;
Faction: Unbounded_String;
Price: Positive;
Attribute: Unbounded_String;
Skill: Unbounded_String;
Id: Positive;
end record;
type Recruits_Array is array(Positive range <>) of Local_Module_Data;
BaseIndex: constant Positive :=
SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).BaseIndex;
Local_Recruits: Recruits_Array
(1 .. Positive(Sky_Bases(BaseIndex).Recruits.Length));
function "<"(Left, Right: Local_Module_Data) return Boolean is
begin
if Recruits_Sort_Order = NAMEASC and then Left.Name < Right.Name then
return True;
end if;
if Recruits_Sort_Order = NAMEDESC and then Left.Name > Right.Name then
return True;
end if;
if Recruits_Sort_Order = GENDERASC
and then Left.Gender < Right.Gender then
return True;
end if;
if Recruits_Sort_Order = GENDERDESC
and then Left.Gender > Right.Gender then
return True;
end if;
if Recruits_Sort_Order = FACTIONASC
and then Left.Faction < Right.Faction then
return True;
end if;
if Recruits_Sort_Order = FACTIONDESC
and then Left.Faction > Right.Faction then
return True;
end if;
if Recruits_Sort_Order = PRICEASC
and then Left.Price < Right.Price then
return True;
end if;
if Recruits_Sort_Order = PRICEDESC
and then Left.Price > Right.Price then
return True;
end if;
if Recruits_Sort_Order = ATTRIBUTEASC
and then Left.Attribute < Right.Attribute then
return True;
end if;
if Recruits_Sort_Order = ATTRIBUTEDESC
and then Left.Attribute > Right.Attribute then
return True;
end if;
if Recruits_Sort_Order = SKILLASC
and then Left.Skill < Right.Skill then
return True;
end if;
if Recruits_Sort_Order = SKILLDESC
and then Left.Skill > Right.Skill then
return True;
end if;
return False;
end "<";
procedure Sort_Recruits is new Ada.Containers.Generic_Array_Sort
(Index_Type => Positive, Element_Type => Local_Module_Data,
Array_Type => Recruits_Array);
begin
case Column is
when 1 =>
if Recruits_Sort_Order = NAMEASC then
Recruits_Sort_Order := NAMEDESC;
else
Recruits_Sort_Order := NAMEASC;
end if;
when 2 =>
if Recruits_Sort_Order = GENDERASC then
Recruits_Sort_Order := GENDERDESC;
else
Recruits_Sort_Order := GENDERASC;
end if;
when 3 =>
if Recruits_Sort_Order = FACTIONASC then
Recruits_Sort_Order := FACTIONDESC;
else
Recruits_Sort_Order := FACTIONASC;
end if;
when 4 =>
if Recruits_Sort_Order = PRICEASC then
Recruits_Sort_Order := PRICEDESC;
else
Recruits_Sort_Order := PRICEASC;
end if;
when 5 =>
if Recruits_Sort_Order = ATTRIBUTEASC then
Recruits_Sort_Order := ATTRIBUTEDESC;
else
Recruits_Sort_Order := ATTRIBUTEASC;
end if;
when 6 =>
if Recruits_Sort_Order = SKILLASC then
Recruits_Sort_Order := SKILLDESC;
else
Recruits_Sort_Order := SKILLASC;
end if;
when others =>
null;
end case;
if Recruits_Sort_Order = NONE then
return TCL_OK;
end if;
for I in Sky_Bases(BaseIndex).Recruits.Iterate loop
Local_Recruits(Recruit_Container.To_Index(I)) :=
(Name => Sky_Bases(BaseIndex).Recruits(I).Name,
Gender => Sky_Bases(BaseIndex).Recruits(I).Gender,
Faction => Sky_Bases(BaseIndex).Recruits(I).Faction,
Price => Sky_Bases(BaseIndex).Recruits(I).Price,
Attribute =>
Get_Highest_Attribute(BaseIndex, Recruit_Container.To_Index(I)),
Skill =>
Get_Highest_Skill(BaseIndex, Recruit_Container.To_Index(I)),
Id => Recruit_Container.To_Index(I));
end loop;
Sort_Recruits(Local_Recruits);
Recruits_Indexes.Clear;
for Recruit of Local_Recruits loop
Recruits_Indexes.Append(Recruit.Id);
end loop;
return
Show_Recruit_Command
(ClientData, Interp, 2, CArgv.Empty & "ShowRecruits" & "1");
end Sort_Recruits_Command;
procedure AddCommands is
begin
Add_Command("ShowRecruit", Show_Recruit_Command'Access);
Add_Command("ShowRecruitMenu", Show_Recruit_Menu_Command'Access);
Add_Command("ShowRecruitInfo", Show_Recruit_Info_Command'Access);
Add_Command("NegotiateHire", Negotiate_Hire_Command'Access);
Add_Command("Hire", Hire_Command'Access);
Add_Command("ShowRecruitTab", Show_Recruit_Tab_Command'Access);
Add_Command("Negotiate", Negotiate_Command'Access);
Add_Command("SortRecruits", Sort_Recruits_Command'Access);
end AddCommands;
end Bases.RecruitUI;
|
with Ada.Exception_Identification.From_Here;
with System.Zero_Terminated_Strings;
with C.errno;
with C.fcntl;
with C.stdio; -- rename(2)
with C.sys.sendfile;
with C.unistd;
package body System.Native_Directories.Copying is
use Ada.Exception_Identification.From_Here;
use type Ada.Exception_Identification.Exception_Id;
use type C.signed_int;
use type C.unsigned_short; -- mode_t in FreeBSD
use type C.unsigned_int; -- open flag, and mode_t in Linux
use type C.signed_long; -- 64bit ssize_t
use type C.size_t;
-- implementation
procedure Copy_File (
Source_Name : String;
Target_Name : String;
Overwrite : Boolean := True)
is
Exception_Id : Ada.Exception_Identification.Exception_Id :=
Ada.Exception_Identification.Null_Id;
C_Source_Name : C.char_array (
0 ..
Source_Name'Length * Zero_Terminated_Strings.Expanding);
Source : C.signed_int;
C_Target_Name : C.char_array (
0 ..
Target_Name'Length * Zero_Terminated_Strings.Expanding);
Target : C.signed_int;
Flag : C.unsigned_int;
Data : aliased C.sys.stat.struct_stat;
Written : C.sys.types.ssize_t;
begin
Zero_Terminated_Strings.To_C (Source_Name, C_Source_Name (0)'Access);
Zero_Terminated_Strings.To_C (Target_Name, C_Target_Name (0)'Access);
Source := C.fcntl.open (C_Source_Name (0)'Access, C.fcntl.O_RDONLY);
if Source < 0 then
Exception_Id := Named_IO_Exception_Id (C.errno.errno);
else
if C.sys.stat.fstat (Source, Data'Access) < 0 then
Exception_Id := IO_Exception_Id (C.errno.errno);
else
Flag := C.fcntl.O_WRONLY or C.fcntl.O_CREAT or C.fcntl.O_EXLOCK;
if not Overwrite then
Flag := Flag or C.fcntl.O_EXCL;
end if;
Target := C.fcntl.open (
C_Target_Name (0)'Access,
C.signed_int (Flag),
Data.st_mode);
if Target < 0 then
Exception_Id := Named_IO_Exception_Id (C.errno.errno);
else
if C.unistd.ftruncate (Target, Data.st_size) < 0 then
null;
end if;
Written := C.sys.sendfile.sendfile (
Target,
Source,
null,
C.size_t (Data.st_size));
if Written < C.sys.types.ssize_t (Data.st_size) then
Exception_Id := Device_Error'Identity;
end if;
-- close target
if C.unistd.close (Target) < 0
and then Exception_Id = Ada.Exception_Identification.Null_Id
then
Exception_Id := IO_Exception_Id (C.errno.errno);
end if;
end if;
end if;
-- close source
if C.unistd.close (Source) < 0
and then Exception_Id = Ada.Exception_Identification.Null_Id
then
Exception_Id := IO_Exception_Id (C.errno.errno);
end if;
end if;
-- raising
if Exception_Id /= Ada.Exception_Identification.Null_Id then
Raise_Exception (Exception_Id);
end if;
end Copy_File;
procedure Replace_File (
Source_Name : String;
Target_Name : String)
is
C_Source_Name : C.char_array (
0 ..
Source_Name'Length * Zero_Terminated_Strings.Expanding);
C_Target_Name : C.char_array (
0 ..
Target_Name'Length * Zero_Terminated_Strings.Expanding);
Target_Info : aliased C.sys.stat.struct_stat;
Error : Boolean;
begin
Zero_Terminated_Strings.To_C (Source_Name, C_Source_Name (0)'Access);
Zero_Terminated_Strings.To_C (Target_Name, C_Target_Name (0)'Access);
-- if the target is already existing,
-- copy attributes from the target to the source.
Error := False;
if C.sys.stat.lstat (C_Target_Name (0)'Access, Target_Info'Access) = 0
and then (Target_Info.st_mode and C.sys.stat.S_IFMT) /=
C.sys.stat.S_IFLNK -- Linux does not have lchmod
then
Error := C.sys.stat.chmod (
C_Source_Name (0)'Access,
Target_Info.st_mode and C.sys.stat.ALLPERMS) < 0;
end if;
if not Error then
-- overwrite the target with the source.
Error := C.stdio.rename (
C_Source_Name (0)'Access,
C_Target_Name (0)'Access) < 0;
end if;
if Error then
Raise_Exception (Named_IO_Exception_Id (C.errno.errno));
end if;
end Replace_File;
end System.Native_Directories.Copying;
|
-- { dg-do compile }
-- { dg-options "-flto" { target lto } }
package body Lto18 is
procedure Proc (Driver : Rec) is
R : Path;
begin
for I in Driver.Step'Range loop
R := Get (Driver, 1, Driver.Step (I));
R := Get (Driver, 2, Driver.Step (I));
R := Get (Driver, 3, Driver.Step (I));
end loop;
end;
end Lto18;
|
-- kvflyweights.ads
-- A package for ensuring resources are not duplicated in a manner similar
-- to the C++ Boost flyweight classes.
-- Copyright (c) 2016, James Humphry
--
-- Permission to use, copy, modify, and/or distribute this software for any
-- purpose with or without fee is hereby granted, provided that the above
-- copyright notice and this permission notice appear in all copies.
--
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
-- REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
-- AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
-- INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
-- LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE
-- OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
-- PERFORMANCE OF THIS SOFTWARE.
package KVFlyweights is
KVFlyweights_Error : exception;
end KVFlyweights;
|
-----------------------------------------------------------------------
-- servlet-filters -- Servlet Filters
-- Copyright (C) 2010, 2015 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Servlet.Requests;
with Servlet.Responses;
with Servlet.Core;
-- The <b>Servlet.Filters</b> package defines the servlet filter
-- interface described in Java Servlet Specification, JSR 315, 6. Filtering.
--
package Servlet.Filters is
-- ------------------------------
-- Filter interface
-- ------------------------------
-- The <b>Filter</b> interface defines one mandatory procedure through
-- which the request/response pair are passed.
--
-- The <b>Filter</b> instance must be registered in the <b>Servlet_Registry</b>
-- by using the <b>Add_Filter</b> procedure. The same filter instance is used
-- to process multiple requests possibly at the same time.
type Filter is limited interface;
type Filter_Access is access all Filter'Class;
type Filter_List is array (Natural range <>) of Filter_Access;
type Filter_List_Access is access all Filter_List;
-- The Do_Filter method of the Filter is called by the container each time
-- a request/response pair is passed through the chain due to a client request
-- for a resource at the end of the chain. The Filter_Chain passed in to this
-- method allows the Filter to pass on the request and response to the next
-- entity in the chain.
--
-- A typical implementation of this method would follow the following pattern:
-- 1. Examine the request
-- 2. Optionally wrap the request object with a custom implementation to
-- filter content or headers for input filtering
-- 3. Optionally wrap the response object with a custom implementation to
-- filter content or headers for output filtering
-- 4. Either invoke the next entity in the chain using the FilterChain
-- object (chain.Do_Filter()),
-- or, not pass on the request/response pair to the next entity in the
-- filter chain to block the request processing
-- 5. Directly set headers on the response after invocation of the next
-- entity in the filter chain.
procedure Do_Filter (F : in Filter;
Request : in out Requests.Request'Class;
Response : in out Responses.Response'Class;
Chain : in out Servlet.Core.Filter_Chain) is abstract;
-- Called by the servlet container to indicate to a filter that the filter
-- instance is being placed into service.
procedure Initialize (Server : in out Filter;
Config : in Servlet.Core.Filter_Config) is null;
end Servlet.Filters;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- P R J . S T R T --
-- --
-- S p e c --
-- --
-- Copyright (C) 2001-2014, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING3. If not, go to --
-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package implements parsing of string expressions in project files
with Prj.Tree; use Prj.Tree;
private package Prj.Strt is
procedure Parse_String_Type_List
(In_Tree : Project_Node_Tree_Ref;
First_String : out Project_Node_Id;
Flags : Processing_Flags);
-- Get the list of literal strings that are allowed for a typed string.
-- On entry, the current token is the first literal string following
-- a left parenthesis in a string type declaration such as:
-- type Toto is ("string_1", "string_2", "string_3");
--
-- On exit, the current token is the right parenthesis. The parameter
-- First_String is a node that contained the first literal string of the
-- string type, linked with the following literal strings.
--
-- Report an error if
-- - a literal string is not found at the beginning of the list
-- or after a comma
-- - two literal strings in the list are equal
procedure Start_New_Case_Construction
(In_Tree : Project_Node_Tree_Ref;
String_Type : Project_Node_Id);
-- This procedure is called at the beginning of a case construction. The
-- parameter String_Type is the node for the string type of the case label
-- variable. The different literal strings of the string type are stored
-- into a table to be checked against the labels of the case construction.
procedure End_Case_Construction
(Check_All_Labels : Boolean;
Case_Location : Source_Ptr;
Flags : Processing_Flags;
String_Type : Boolean);
-- This procedure is called at the end of a case construction to remove
-- the case labels and to restore the previous state. In particular, in the
-- case of nested case constructions, the case labels of the enclosing case
-- construction are restored. If When_Others is False and we are not in
-- quiet output, a warning is emitted for each value of the case variable
-- string type that has not been specified.
procedure Parse_Choice_List
(In_Tree : Project_Node_Tree_Ref;
First_Choice : out Project_Node_Id;
Flags : Processing_Flags;
String_Type : Boolean := True);
-- Get the label for a choice list.
-- Report an error if
-- - a case label is not a literal string
-- - a case label is not in the typed string list
-- - the same case label is repeated in the same case construction
procedure Parse_Expression
(In_Tree : Project_Node_Tree_Ref;
Expression : out Project_Node_Id;
Current_Project : Project_Node_Id;
Current_Package : Project_Node_Id;
Optional_Index : Boolean;
Flags : Processing_Flags);
-- Parse a simple string expression or a string list expression
--
-- Current_Project is the node of the project file being parsed
--
-- Current_Package is the node of the package being parsed, or Empty_Node
-- when we are at the project level (not in a package). On exit, Expression
-- is the node of the expression that has been parsed.
procedure Parse_Variable_Reference
(In_Tree : Project_Node_Tree_Ref;
Variable : out Project_Node_Id;
Current_Project : Project_Node_Id;
Current_Package : Project_Node_Id;
Flags : Processing_Flags);
-- Parse variable or attribute reference. Used internally (in expressions)
-- and for case variables (in Prj.Dect). Current_Package is the node of the
-- package being parsed, or Empty_Node when we are at the project level
-- (not in a package). On exit, Variable is the node of the variable or
-- attribute reference. A variable reference is made of one to three simple
-- names. An attribute reference is made of one or two simple names,
-- followed by an apostrophe, followed by the attribute simple name.
end Prj.Strt;
|
procedure Main is
type Bubble_Array is array (Integer range <>) of Integer;
procedure Bubble_Sort (Arr : in out Bubble_Array) is
Temp : Integer;
begin
for I in reverse Arr'Range loop
for J in Arr'First .. I loop
if Arr(I) < Arr(J) then
Temp := Arr(J);
Arr(J) := Arr(I);
Arr(I) := Temp;
end if;
end loop;
end loop;
end Bubble_Sort;
Arr : Bubble_Array := (7, 3, 5, 5, 11);
begin
Bubble_Sort(Arr);
end Main;
|
Pragma Ada_2012;
Pragma Wide_Character_Encoding( UTF8 );
with
Risi_Script.Types.Patterns,
Risi_Script.Types.Identifier,
Risi_Script.Types.Identifier.Scope,
Risi_Script.Types.Implementation;
Package Risi_Script.Interfaces is
Use Risi_Script.Types.Patterns;
Type Stack_Interface is Interface;
Function Match(Object : Stack_Interface;
Pattern : Three_Quarter_Pattern
) return Boolean is (True);
Function Match(Object : Stack_Interface;
Pattern : Half_Pattern
) return Boolean is (True);
Package ID Renames Risi_Script.Types.Identifier;
Package IM Renames Risi_Script.Types.Implementation;
Package Scope Renames ID.Scope;
-- The VM type declares the interface for a virtual=machine's
-- implementation.
--
-- NOTE: MRE is a delicious Managed Runtime Environment.
Type VM is synchronized interface;
-- Creates a variable in the MRE.
Procedure Create_Variable( MRE : in out VM;
Value : IM.Representation;
Name : ID.Identifier:= "Evaluated";
Context : Scope.Scope:= Scope.Global
) is abstract;
-- Returns the internal representation of the indicated variable.
Function Retrieve_Variable( MRE : in out VM;
Name : ID.Identifier:= "Evaluated";
Context : Scope.Scope:= Scope.Global
) return IM.Representation is abstract;
Procedure Push_Parameter ( MRE : in out VM;
Value : IM.Representation
) is abstract;
Function Pop_Parameter ( MRE : in out VM
) return IM.Representation is abstract;
Function Peek_Parameter ( MRE : in out VM;
Location: Positive
) return IM.Representation is abstract;
End Risi_Script.Interfaces;
|
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
package Loga is
type Logger is tagged private;
type Colors is (Normal, Red, Green, Yellow, Blue, Magenta, Cyan);
function New_Logger (Name : String;
Color : Colors := Normal) return Logger;
procedure Log (Self : Logger; Message : String);
function Get_Color (Self : Logger) return Colors;
private
Colors_As_Integer : array (Colors) of Natural := (Normal => 0,
Red => 31,
Green => 32,
Yellow => 33,
Blue => 34,
Magenta => 35,
Cyan => 36);
type Logger is tagged record
Name : Unbounded_String;
Color : Colors;
Disabled : Boolean := True;
end record;
end Loga;
|
-- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2016 onox <denkpadje@gmail.com>
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
with AUnit.Assertions;
with AUnit.Test_Caller;
with Orka.SIMD.SSE.Singles.Swizzle;
package body Test_SIMD_SSE_Swizzle is
use Orka;
use Orka.SIMD;
use Orka.SIMD.SSE.Singles;
use Orka.SIMD.SSE.Singles.Swizzle;
use AUnit.Assertions;
package Caller is new AUnit.Test_Caller (Test);
Test_Suite : aliased AUnit.Test_Suites.Test_Suite;
function Suite return AUnit.Test_Suites.Access_Test_Suite is
Name : constant String := "(SIMD - SSE - Swizzle) ";
begin
Test_Suite.Add_Test (Caller.Create
(Name & "Test Shuffle function", Test_Shuffle'Access));
Test_Suite.Add_Test (Caller.Create
(Name & "Test Transpose function", Test_Transpose_Function'Access));
Test_Suite.Add_Test (Caller.Create
(Name & "Test Transpose procedure", Test_Transpose_Procedure'Access));
return Test_Suite'Access;
end Suite;
procedure Test_Shuffle (Object : in out Test) is
Elements : constant m128 := (1.0, 2.0, 3.0, 4.0);
Mask_0_0_0_0 : constant Unsigned_32 := 0 or 0 * 4 or 0 * 16 or 0 * 64;
Mask_2_2_2_2 : constant Unsigned_32 := 2 or 2 * 4 or 2 * 16 or 2 * 64;
Mask_1_0_3_2 : constant Unsigned_32 := 1 or 0 * 4 or 3 * 16 or 2 * 64;
Mask_2_3_0_1 : constant Unsigned_32 := 2 or 3 * 4 or 0 * 16 or 1 * 64;
Expected : constant array (Positive range <>) of m128
:= ((1.0, 1.0, 1.0, 1.0),
(3.0, 3.0, 3.0, 3.0),
(2.0, 1.0, 4.0, 3.0),
(3.0, 4.0, 1.0, 2.0));
Results : array (Positive range Expected'Range) of m128;
begin
Results (1) := Shuffle (Elements, Elements, Mask_0_0_0_0);
Results (2) := Shuffle (Elements, Elements, Mask_2_2_2_2);
Results (3) := Shuffle (Elements, Elements, Mask_1_0_3_2);
Results (4) := Shuffle (Elements, Elements, Mask_2_3_0_1);
for I in Expected'Range loop
for J in Index_Homogeneous loop
declare
Message : constant String := "Unexpected Single at " & Index_Homogeneous'Image (J);
begin
Assert (Expected (I) (J) = Results (I) (J), Message);
end;
end loop;
end loop;
end Test_Shuffle;
procedure Test_Transpose_Function (Object : in out Test) is
subtype IH is Index_Homogeneous;
Elements : constant m128_Array
:= ((1.0, 2.0, 3.0, 4.0),
(5.0, 6.0, 7.0, 8.0),
(9.0, 10.0, 11.0, 12.0),
(13.0, 14.0, 15.0, 16.0));
Expected : constant m128_Array
:= ((1.0, 5.0, 9.0, 13.0),
(2.0, 6.0, 10.0, 14.0),
(3.0, 7.0, 11.0, 15.0),
(4.0, 8.0, 12.0, 16.0));
Result : constant m128_Array := Transpose (Elements);
begin
for I in Result'Range loop
for J in Index_Homogeneous loop
Assert (Expected (I) (J) = Result (I) (J),
"Unexpected Single at " & I'Image & ", " & J'Image);
end loop;
end loop;
end Test_Transpose_Function;
procedure Test_Transpose_Procedure (Object : in out Test) is
subtype IH is Index_Homogeneous;
Elements : m128_Array
:= ((1.0, 2.0, 3.0, 4.0),
(5.0, 6.0, 7.0, 8.0),
(9.0, 10.0, 11.0, 12.0),
(13.0, 14.0, 15.0, 16.0));
Expected : constant m128_Array
:= ((1.0, 5.0, 9.0, 13.0),
(2.0, 6.0, 10.0, 14.0),
(3.0, 7.0, 11.0, 15.0),
(4.0, 8.0, 12.0, 16.0));
begin
Transpose (Elements);
for I in Elements'Range loop
for J in Index_Homogeneous loop
Assert (Expected (I) (J) = Elements (I) (J),
"Unexpected Single at " & I'Image & ", " & J'Image);
end loop;
end loop;
end Test_Transpose_Procedure;
end Test_SIMD_SSE_Swizzle;
|
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Program.Elements.Declarations;
with Program.Lexical_Elements;
with Program.Elements.Defining_Identifiers;
with Program.Elements.Known_Discriminant_Parts;
with Program.Elements.Aspect_Specifications;
with Program.Elements.Expressions;
with Program.Elements.Task_Definitions;
package Program.Elements.Task_Type_Declarations is
pragma Pure (Program.Elements.Task_Type_Declarations);
type Task_Type_Declaration is
limited interface and Program.Elements.Declarations.Declaration;
type Task_Type_Declaration_Access is access all Task_Type_Declaration'Class
with Storage_Size => 0;
not overriding function Name
(Self : Task_Type_Declaration)
return not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access is abstract;
not overriding function Discriminant_Part
(Self : Task_Type_Declaration)
return Program.Elements.Known_Discriminant_Parts
.Known_Discriminant_Part_Access is abstract;
not overriding function Aspects
(Self : Task_Type_Declaration)
return Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access is abstract;
not overriding function Progenitors
(Self : Task_Type_Declaration)
return Program.Elements.Expressions.Expression_Vector_Access is abstract;
not overriding function Definition
(Self : Task_Type_Declaration)
return not null Program.Elements.Task_Definitions.Task_Definition_Access
is abstract;
type Task_Type_Declaration_Text is limited interface;
type Task_Type_Declaration_Text_Access is
access all Task_Type_Declaration_Text'Class with Storage_Size => 0;
not overriding function To_Task_Type_Declaration_Text
(Self : aliased in out Task_Type_Declaration)
return Task_Type_Declaration_Text_Access is abstract;
not overriding function Task_Token
(Self : Task_Type_Declaration_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function Type_Token
(Self : Task_Type_Declaration_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function With_Token
(Self : Task_Type_Declaration_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function Is_Token
(Self : Task_Type_Declaration_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function New_Token
(Self : Task_Type_Declaration_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function With_Token_2
(Self : Task_Type_Declaration_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function Semicolon_Token
(Self : Task_Type_Declaration_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
end Program.Elements.Task_Type_Declarations;
|
-- TODO: Figure-out the memory management issues... is it
-- possible to use only standard Ada facilities, or is an
-- additional GC unavoidable?
package Tarmi is
type Datum_R is abstract tagged null record;
type Datum is not null access constant Datum_R'Class;
type Pair_R is new Datum_R with
record
First : Datum;
Second : Datum;
end record;
type Pair is not null access constant Pair_R;
subtype String_Type is Standard.String;
Nil : constant Datum;
Ignore : constant Datum;
Not_Implemented : exception; -- TODO: remove when development done
private
type Singleton is new Datum_R with null record;
Nil_Obj : aliased constant Singleton := (null record);
Nil : constant Datum := Nil_Obj'Access;
Ignore_Obj : aliased constant Singleton := (null record);
Ignore : constant Datum := Ignore_Obj'Access;
end Tarmi;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012-2015, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
pragma Restrictions (No_Elaboration_Code);
-- GNAT: enforce generation of preinitialized data section instead of
-- generation of elaboration code.
package Matreshka.Internals.Unicode.Ucd.Core_010E is
pragma Preelaborate;
Group_010E : aliased constant Core_Second_Stage
:= (16#60# .. 16#7E# => -- 010E60 .. 010E7E
(Other_Number, Neutral,
Other, Other, Other, Alphabetic,
(Grapheme_Base => True,
others => False)),
others =>
(Unassigned, Neutral,
Other, Other, Other, Unknown,
(others => False)));
end Matreshka.Internals.Unicode.Ucd.Core_010E;
|
with impact.d3.Containers;
with impact.d3.Shape.convex;
with Interfaces.C;
package impact.d3.shape_Hull
--
-- The impact.d3.shape_Hull class takes a impact.d3.Shape.convex, builds a simplified convex hull using impact.d3.convex_Hull and provides triangle indices and vertices.
--
-- It can be useful for to simplify a complex convex object and for visualization of a non-polyhedral convex object.
--
-- It approximates the convex hull using the supporting vertex of 42 directions.
--
is
type Item is tagged private;
--- Forge
--
function to_shape_Hull (shape : in impact.d3.Shape.convex.view) return Item;
procedure destruct (Self : in out Item);
--- Attributes
--
function buildHull (Self : access Item; margin : in math.Real) return Boolean;
function numTriangles (Self : in Item) return Natural;
function numVertices (Self : in Item) return Natural;
function numIndices (Self : in Item) return Natural;
function getVertexPointer (Self : in Item) return access math.Vector_3;
function getIndexPointer (Self : in Item) return access Interfaces.C.Unsigned;
private
type access_vector_3_array is access Vector_3_array;
type access_Unsigneds is access Containers.Unsigneds;
type Item is tagged
record
m_vertices : access_vector_3_array;
m_indices : access_Unsigneds;
m_numIndices : Natural;
m_shape : impact.d3.Shape.convex.view;
end record;
end impact.d3.shape_Hull;
|
-- Copyright 2015-2020 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with System;
package Pck is
type Table is array (Positive range <>) of Integer;
type Object (N : Integer) is record
Data : Table (1 .. N);
end record;
type Small is new Integer range 0 .. 255;
for Small'Size use 8;
type Small_Table is array (Positive range <>) of Small;
pragma Pack (Small_Table);
type Small_Object (N : Integer) is record
Data : Table (1 .. N);
end record;
procedure Do_Nothing (A : System.Address);
end Pck;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . E X C E P T I O N S . L A S T _ C H A N C E _ H A N D L E R --
-- --
-- B o d y --
-- --
-- Copyright (C) 2012-2021, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Default last chance handler for no propagation runtimes
with Ada.Unchecked_Conversion;
with System.Machine_Reset;
with GNAT.IO; use GNAT.IO;
-- We rely on GNAT packages for the output. Usually, Ada predefined units
-- cannot depends on GNAT units, as the user could use the GNAT hierarchy.
-- However, this implementation of Last_Chance_Handler is a default one, that
-- could be redefined by the user.
procedure Ada.Exceptions.Last_Chance_Handler
(Msg : System.Address; Line : Integer)
is
procedure Put (Str : System.Address);
-- Put for a nul-terminated string (a C string)
---------
-- Put --
---------
procedure Put (Str : System.Address) is
type C_String_Ptr is access String (1 .. Positive'Last);
function To_C_String_Ptr is new Ada.Unchecked_Conversion
(System.Address, C_String_Ptr);
Msg_Str : constant C_String_Ptr := To_C_String_Ptr (Str);
begin
for J in Msg_Str'Range loop
exit when Msg_Str (J) = Character'Val (0);
Put (Msg_Str (J));
end loop;
end Put;
begin
Put_Line ("In last chance handler");
if Line /= 0 then
Put ("Predefined exception raised at ");
Put (Msg);
Put (':');
Put (Line);
else
Put ("User defined exception, message: ");
Put (Msg);
end if;
New_Line;
-- Stop the program
System.Machine_Reset.Stop;
end Ada.Exceptions.Last_Chance_Handler;
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- A D A . C O N T A I N E R S . B O U N D E D _ V E C T O R S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2004-2020, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
with Ada.Iterator_Interfaces;
with Ada.Containers.Helpers;
private with Ada.Streams;
private with Ada.Finalization;
private with Ada.Strings.Text_Output;
generic
type Index_Type is range <>;
type Element_Type is private;
with function "=" (Left, Right : Element_Type) return Boolean is <>;
package Ada.Containers.Bounded_Vectors is
pragma Annotate (CodePeer, Skip_Analysis);
pragma Pure;
pragma Remote_Types;
subtype Extended_Index is Index_Type'Base
range Index_Type'First - 1 ..
Index_Type'Min (Index_Type'Base'Last - 1, Index_Type'Last) + 1;
No_Index : constant Extended_Index := Extended_Index'First;
type Vector (Capacity : Count_Type) is tagged private with
Constant_Indexing => Constant_Reference,
Variable_Indexing => Reference,
Default_Iterator => Iterate,
Iterator_Element => Element_Type,
Aggregate => (Empty => Empty,
Add_Unnamed => Append_One,
New_Indexed => New_Vector,
Assign_Indexed => Replace_Element);
pragma Preelaborable_Initialization (Vector);
type Cursor is private;
pragma Preelaborable_Initialization (Cursor);
Empty_Vector : constant Vector;
No_Element : constant Cursor;
function Has_Element (Position : Cursor) return Boolean;
package Vector_Iterator_Interfaces is new
Ada.Iterator_Interfaces (Cursor, Has_Element);
function Empty (Capacity : Count_Type := 10) return Vector;
overriding function "=" (Left, Right : Vector) return Boolean;
function New_Vector (First, Last : Index_Type) return Vector
with Pre => First = Index_Type'First;
-- Ada_2020 aggregate operation.
function To_Vector (Length : Count_Type) return Vector;
function To_Vector
(New_Item : Element_Type;
Length : Count_Type) return Vector;
function "&" (Left, Right : Vector) return Vector;
function "&" (Left : Vector; Right : Element_Type) return Vector;
function "&" (Left : Element_Type; Right : Vector) return Vector;
function "&" (Left, Right : Element_Type) return Vector;
function Capacity (Container : Vector) return Count_Type;
procedure Reserve_Capacity
(Container : in out Vector;
Capacity : Count_Type);
function Length (Container : Vector) return Count_Type;
procedure Set_Length
(Container : in out Vector;
Length : Count_Type);
function Is_Empty (Container : Vector) return Boolean;
procedure Clear (Container : in out Vector);
function To_Cursor
(Container : Vector;
Index : Extended_Index) return Cursor;
function To_Index (Position : Cursor) return Extended_Index;
function Element
(Container : Vector;
Index : Index_Type) return Element_Type;
function Element (Position : Cursor) return Element_Type;
procedure Replace_Element
(Container : in out Vector;
Index : Index_Type;
New_Item : Element_Type);
procedure Replace_Element
(Container : in out Vector;
Position : Cursor;
New_Item : Element_Type);
procedure Query_Element
(Container : Vector;
Index : Index_Type;
Process : not null access procedure (Element : Element_Type));
procedure Query_Element
(Position : Cursor;
Process : not null access procedure (Element : Element_Type));
procedure Update_Element
(Container : in out Vector;
Index : Index_Type;
Process : not null access procedure (Element : in out Element_Type));
procedure Update_Element
(Container : in out Vector;
Position : Cursor;
Process : not null access procedure (Element : in out Element_Type));
type Constant_Reference_Type
(Element : not null access constant Element_Type) is
private
with
Implicit_Dereference => Element;
type Reference_Type (Element : not null access Element_Type) is private
with
Implicit_Dereference => Element;
function Constant_Reference
(Container : aliased Vector;
Position : Cursor) return Constant_Reference_Type;
function Reference
(Container : aliased in out Vector;
Position : Cursor) return Reference_Type;
function Constant_Reference
(Container : aliased Vector;
Index : Index_Type) return Constant_Reference_Type;
function Reference
(Container : aliased in out Vector;
Index : Index_Type) return Reference_Type;
procedure Assign (Target : in out Vector; Source : Vector);
function Copy (Source : Vector; Capacity : Count_Type := 0) return Vector;
procedure Move (Target : in out Vector; Source : in out Vector);
procedure Insert
(Container : in out Vector;
Before : Extended_Index;
New_Item : Vector);
procedure Insert
(Container : in out Vector;
Before : Cursor;
New_Item : Vector);
procedure Insert
(Container : in out Vector;
Before : Cursor;
New_Item : Vector;
Position : out Cursor);
procedure Insert
(Container : in out Vector;
Before : Extended_Index;
New_Item : Element_Type;
Count : Count_Type := 1);
procedure Insert
(Container : in out Vector;
Before : Cursor;
New_Item : Element_Type;
Count : Count_Type := 1);
procedure Insert
(Container : in out Vector;
Before : Cursor;
New_Item : Element_Type;
Position : out Cursor;
Count : Count_Type := 1);
procedure Insert
(Container : in out Vector;
Before : Extended_Index;
Count : Count_Type := 1);
procedure Insert
(Container : in out Vector;
Before : Cursor;
Position : out Cursor;
Count : Count_Type := 1);
procedure Prepend
(Container : in out Vector;
New_Item : Vector);
procedure Prepend
(Container : in out Vector;
New_Item : Element_Type;
Count : Count_Type := 1);
procedure Append
(Container : in out Vector;
New_Item : Vector);
procedure Append
(Container : in out Vector;
New_Item : Element_Type;
Count : Count_Type := 1);
procedure Append_One (Container : in out Vector;
New_Item : Element_Type);
-- Ada_2020 aggregate operation.
procedure Insert_Space
(Container : in out Vector;
Before : Extended_Index;
Count : Count_Type := 1);
procedure Insert_Space
(Container : in out Vector;
Before : Cursor;
Position : out Cursor;
Count : Count_Type := 1);
procedure Delete
(Container : in out Vector;
Index : Extended_Index;
Count : Count_Type := 1);
procedure Delete
(Container : in out Vector;
Position : in out Cursor;
Count : Count_Type := 1);
procedure Delete_First
(Container : in out Vector;
Count : Count_Type := 1);
procedure Delete_Last
(Container : in out Vector;
Count : Count_Type := 1);
procedure Reverse_Elements (Container : in out Vector);
procedure Swap (Container : in out Vector; I, J : Index_Type);
procedure Swap (Container : in out Vector; I, J : Cursor);
function First_Index (Container : Vector) return Index_Type;
function First (Container : Vector) return Cursor;
function First_Element (Container : Vector) return Element_Type;
function Last_Index (Container : Vector) return Extended_Index;
function Last (Container : Vector) return Cursor;
function Last_Element (Container : Vector) return Element_Type;
function Next (Position : Cursor) return Cursor;
procedure Next (Position : in out Cursor);
function Previous (Position : Cursor) return Cursor;
procedure Previous (Position : in out Cursor);
function Find_Index
(Container : Vector;
Item : Element_Type;
Index : Index_Type := Index_Type'First) return Extended_Index;
function Find
(Container : Vector;
Item : Element_Type;
Position : Cursor := No_Element) return Cursor;
function Reverse_Find_Index
(Container : Vector;
Item : Element_Type;
Index : Index_Type := Index_Type'Last) return Extended_Index;
function Reverse_Find
(Container : Vector;
Item : Element_Type;
Position : Cursor := No_Element) return Cursor;
function Contains
(Container : Vector;
Item : Element_Type) return Boolean;
procedure Iterate
(Container : Vector;
Process : not null access procedure (Position : Cursor));
procedure Reverse_Iterate
(Container : Vector;
Process : not null access procedure (Position : Cursor));
function Iterate
(Container : Vector)
return Vector_Iterator_Interfaces.Reversible_Iterator'Class;
function Iterate
(Container : Vector;
Start : Cursor)
return Vector_Iterator_Interfaces.Reversible_Iterator'class;
generic
with function "<" (Left, Right : Element_Type) return Boolean is <>;
package Generic_Sorting is
function Is_Sorted (Container : Vector) return Boolean;
procedure Sort (Container : in out Vector);
procedure Merge (Target : in out Vector; Source : in out Vector);
end Generic_Sorting;
private
pragma Inline (First_Index);
pragma Inline (Last_Index);
pragma Inline (Element);
pragma Inline (First_Element);
pragma Inline (Last_Element);
pragma Inline (Query_Element);
pragma Inline (Update_Element);
pragma Inline (Replace_Element);
pragma Inline (Is_Empty);
pragma Inline (Contains);
pragma Inline (Next);
pragma Inline (Previous);
use Ada.Containers.Helpers;
package Implementation is new Generic_Implementation;
use Implementation;
use Ada.Streams;
use Ada.Finalization;
type Elements_Array is array (Count_Type range <>) of aliased Element_Type;
function "=" (L, R : Elements_Array) return Boolean is abstract;
type Vector (Capacity : Count_Type) is tagged record
Elements : Elements_Array (1 .. Capacity);
Last : Extended_Index := No_Index;
TC : aliased Tamper_Counts;
end record with Put_Image => Put_Image;
procedure Put_Image
(S : in out Ada.Strings.Text_Output.Sink'Class; V : Vector);
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Container : Vector);
for Vector'Write use Write;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Container : out Vector);
for Vector'Read use Read;
type Vector_Access is access all Vector;
for Vector_Access'Storage_Size use 0;
type Cursor is record
Container : Vector_Access;
Index : Index_Type := Index_Type'First;
end record;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Position : Cursor);
for Cursor'Write use Write;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Position : out Cursor);
for Cursor'Read use Read;
subtype Reference_Control_Type is Implementation.Reference_Control_Type;
-- It is necessary to rename this here, so that the compiler can find it
type Constant_Reference_Type
(Element : not null access constant Element_Type) is
record
Control : Reference_Control_Type :=
raise Program_Error with "uninitialized reference";
-- The RM says, "The default initialization of an object of
-- type Constant_Reference_Type or Reference_Type propagates
-- Program_Error."
end record;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Constant_Reference_Type);
for Constant_Reference_Type'Read use Read;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Constant_Reference_Type);
for Constant_Reference_Type'Write use Write;
type Reference_Type (Element : not null access Element_Type) is record
Control : Reference_Control_Type :=
raise Program_Error with "uninitialized reference";
-- The RM says, "The default initialization of an object of
-- type Constant_Reference_Type or Reference_Type propagates
-- Program_Error."
end record;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Reference_Type);
for Reference_Type'Read use Read;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Reference_Type);
for Reference_Type'Write use Write;
-- Three operations are used to optimize in the expansion of "for ... of"
-- loops: the Next(Cursor) procedure in the visible part, and the following
-- Pseudo_Reference and Get_Element_Access functions. See Exp_Ch5 for
-- details.
function Pseudo_Reference
(Container : aliased Vector'Class) return Reference_Control_Type;
pragma Inline (Pseudo_Reference);
-- Creates an object of type Reference_Control_Type pointing to the
-- container, and increments the Lock. Finalization of this object will
-- decrement the Lock.
type Element_Access is access all Element_Type with
Storage_Size => 0;
function Get_Element_Access
(Position : Cursor) return not null Element_Access;
-- Returns a pointer to the element designated by Position.
Empty_Vector : constant Vector := (Capacity => 0, others => <>);
No_Element : constant Cursor := Cursor'(null, Index_Type'First);
type Iterator is new Limited_Controlled and
Vector_Iterator_Interfaces.Reversible_Iterator with
record
Container : Vector_Access;
Index : Index_Type'Base;
end record
with Disable_Controlled => not T_Check;
overriding procedure Finalize (Object : in out Iterator);
overriding function First (Object : Iterator) return Cursor;
overriding function Last (Object : Iterator) return Cursor;
overriding function Next
(Object : Iterator;
Position : Cursor) return Cursor;
overriding function Previous
(Object : Iterator;
Position : Cursor) return Cursor;
end Ada.Containers.Bounded_Vectors;
|
-- This file is generated by SWIG. Please do not modify by hand.
--
with Interfaces;
with Interfaces.C;
with Interfaces.C.Pointers;
package xcb.xcb_change_keyboard_control_value_list_t is
-- Item
--
type Item is record
key_click_percent : aliased Interfaces.Integer_32;
bell_percent : aliased Interfaces.Integer_32;
bell_pitch : aliased Interfaces.Integer_32;
bell_duration : aliased Interfaces.Integer_32;
led : aliased Interfaces.Unsigned_32;
led_mode : aliased Interfaces.Unsigned_32;
key : aliased xcb.xcb_keycode32_t;
auto_repeat_mode : aliased Interfaces.Unsigned_32;
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb
.xcb_change_keyboard_control_value_list_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_change_keyboard_control_value_list_t.Item,
Element_Array => xcb.xcb_change_keyboard_control_value_list_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_change_keyboard_control_value_list_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_change_keyboard_control_value_list_t.Pointer,
Element_Array =>
xcb.xcb_change_keyboard_control_value_list_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_change_keyboard_control_value_list_t;
|
package body agar.gui.widget.radio is
use type c.int;
package cbinds is
function allocate
(parent : widget_access_t;
flags : flags_t;
items : agar.core.types.void_ptr_t) return radio_access_t;
pragma import (c, allocate, "AG_RadioNew");
function add_item
(radio : radio_access_t;
text : cs.chars_ptr) return c.int;
pragma import (c, add_item, "AG_RadioAddItemS");
function add_item_hotkey
(radio : radio_access_t;
key : c.int;
text : cs.chars_ptr) return c.int;
pragma import (c, add_item_hotkey, "AG_RadioAddItemHKS");
end cbinds;
function allocate
(parent : widget_access_t;
flags : flags_t) return radio_access_t is
begin
return cbinds.allocate
(parent => parent,
flags => flags,
items => agar.core.types.null_ptr);
end allocate;
function add_item
(radio : radio_access_t;
text : string) return boolean
is
c_txt : aliased c.char_array := c.to_c (text);
begin
return cbinds.add_item
(radio => radio,
text => cs.to_chars_ptr (c_txt'unchecked_access)) = 0;
end add_item;
function add_item_hotkey
(radio : radio_access_t;
key : c.int;
text : string) return boolean
is
c_txt : aliased c.char_array := c.to_c (text);
begin
return cbinds.add_item_hotkey
(radio => radio,
key => key,
text => cs.to_chars_ptr (c_txt'unchecked_access)) = 0;
end add_item_hotkey;
function widget (radio : radio_access_t) return widget_access_t is
begin
return radio.widget'access;
end widget;
end agar.gui.widget.radio;
|
-- This file is generated by SWIG. Please do not modify by hand.
--
with Interfaces;
with Interfaces.C;
with Interfaces.C.Pointers;
package xcb.xcb_query_colors_request_t is
-- Item
--
type Item is record
major_opcode : aliased Interfaces.Unsigned_8;
pad0 : aliased Interfaces.Unsigned_8;
length : aliased Interfaces.Unsigned_16;
cmap : aliased xcb.xcb_colormap_t;
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C.size_t range <>) of aliased xcb.xcb_query_colors_request_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_query_colors_request_t.Item,
Element_Array => xcb.xcb_query_colors_request_t.Item_Array,
Default_Terminator => (others => <>));
subtype Pointer is C_Pointers.Pointer;
-- Pointer_Array
--
type Pointer_Array is
array
(Interfaces.C.size_t range <>) of aliased xcb.xcb_query_colors_request_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_query_colors_request_t.Pointer,
Element_Array => xcb.xcb_query_colors_request_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_query_colors_request_t;
|
-----------------------------------------------------------------------
-- util-properties-basic -- Basic types properties
-- Copyright (C) 2001, 2002, 2003, 2006, 2008, 2009, 2010, 2018 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Properties.Discrete;
package Util.Properties.Basic is
pragma Elaborate_Body;
-- Get/Set boolean properties.
package Boolean_Property is new Util.Properties.Discrete (Boolean);
-- Get/Set integer properties.
package Integer_Property is new Util.Properties.Discrete (Integer);
end Util.Properties.Basic;
|
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="17">
<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>ad2dma</name>
<module_structure>Sequential</module_structure>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>16</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>ad</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName>RAM</coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1702129263</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>200</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>da</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName>RAM</coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>17</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>200</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>inputs_V_data_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>inputs</originalName>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_4">
<Value>
<Obj>
<type>1</type>
<id>4</id>
<name>inputs_V_keep_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>inputs</originalName>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_5">
<Value>
<Obj>
<type>1</type>
<id>5</id>
<name>inputs_V_strb_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>inputs</originalName>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1702129263</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_6">
<Value>
<Obj>
<type>1</type>
<id>6</id>
<name>inputs_V_user_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>inputs</originalName>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_7">
<Value>
<Obj>
<type>1</type>
<id>7</id>
<name>inputs_V_last_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>inputs</originalName>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_8">
<Value>
<Obj>
<type>1</type>
<id>8</id>
<name>inputs_V_id_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>inputs</originalName>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>6553705</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_9">
<Value>
<Obj>
<type>1</type>
<id>9</id>
<name>inputs_V_dest_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>inputs</originalName>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>115088738</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_10">
<Value>
<Obj>
<type>1</type>
<id>10</id>
<name>outs_V_data_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>outs</originalName>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>572548452</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_11">
<Value>
<Obj>
<type>1</type>
<id>11</id>
<name>outs_V_keep_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>outs</originalName>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1936942450</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<direction>1</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_12">
<Value>
<Obj>
<type>1</type>
<id>12</id>
<name>outs_V_strb_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>outs</originalName>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>837233896</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<direction>1</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_13">
<Value>
<Obj>
<type>1</type>
<id>13</id>
<name>outs_V_user_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>outs</originalName>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4212404048</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>1</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_14">
<Value>
<Obj>
<type>1</type>
<id>14</id>
<name>outs_V_last_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>outs</originalName>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>1</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_15">
<Value>
<Obj>
<type>1</type>
<id>15</id>
<name>outs_V_id_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>outs</originalName>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4016680032</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>1</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_16">
<Value>
<Obj>
<type>1</type>
<id>16</id>
<name>outs_V_dest_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>outs</originalName>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>1</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>24</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>i</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>i_write_ln11</name>
<fileName>src/vitis_ip/urllc-vitis-top.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>11</lineNumber>
<contextFuncName>ad2dma</contextFuncName>
<contextNormFuncName>ad2dma</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>G:\Chiro\Programs\urllc-demo-pynq</first>
<second class_id="12" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="13" tracking_level="0" version="0">
<first class_id="14" tracking_level="0" version="0">
<first>src/vitis_ip/urllc-vitis-top.cpp</first>
<second>ad2dma</second>
</first>
<second>11</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>73</item>
<item>74</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.29</m_delay>
<m_topoIndex>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>br_ln11</name>
<fileName>src/vitis_ip/urllc-vitis-top.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>11</lineNumber>
<contextFuncName>ad2dma</contextFuncName>
<contextNormFuncName>ad2dma</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\Chiro\Programs\urllc-demo-pynq</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/vitis_ip/urllc-vitis-top.cpp</first>
<second>ad2dma</second>
</first>
<second>11</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>3</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>i_1</name>
<fileName>src/vitis_ip/urllc-vitis-top.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>11</lineNumber>
<contextFuncName>ad2dma</contextFuncName>
<contextNormFuncName>ad2dma</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\Chiro\Programs\urllc-demo-pynq</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/vitis_ip/urllc-vitis-top.cpp</first>
<second>ad2dma</second>
</first>
<second>11</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>76</item>
<item>297</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>icmp_ln11</name>
<fileName>src/vitis_ip/urllc-vitis-top.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>11</lineNumber>
<contextFuncName>ad2dma</contextFuncName>
<contextNormFuncName>ad2dma</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\Chiro\Programs\urllc-demo-pynq</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/vitis_ip/urllc-vitis-top.cpp</first>
<second>ad2dma</second>
</first>
<second>11</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>icmp_ln11_fu_164_p2</rtlName>
<control>auto</control>
<opType>icmp</opType>
<implIndex>auto</implIndex>
<coreName>Cmp</coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>9</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>77</item>
<item>79</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.31</m_delay>
<m_topoIndex>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name>add_ln11</name>
<fileName>src/vitis_ip/urllc-vitis-top.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>11</lineNumber>
<contextFuncName>ad2dma</contextFuncName>
<contextNormFuncName>ad2dma</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\Chiro\Programs\urllc-demo-pynq</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/vitis_ip/urllc-vitis-top.cpp</first>
<second>ad2dma</second>
</first>
<second>11</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>add_ln11_fu_170_p2</rtlName>
<control>auto</control>
<opType>add</opType>
<implIndex>fabric</implIndex>
<coreName>Adder</coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>80</item>
<item>82</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.30</m_delay>
<m_topoIndex>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name>br_ln11</name>
<fileName>src/vitis_ip/urllc-vitis-top.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>11</lineNumber>
<contextFuncName>ad2dma</contextFuncName>
<contextNormFuncName>ad2dma</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\Chiro\Programs\urllc-demo-pynq</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/vitis_ip/urllc-vitis-top.cpp</first>
<second>ad2dma</second>
</first>
<second>11</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>83</item>
<item>84</item>
<item>85</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>7</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>i_cast</name>
<fileName>src/vitis_ip/urllc-vitis-top.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>11</lineNumber>
<contextFuncName>ad2dma</contextFuncName>
<contextNormFuncName>ad2dma</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\Chiro\Programs\urllc-demo-pynq</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/vitis_ip/urllc-vitis-top.cpp</first>
<second>ad2dma</second>
</first>
<second>11</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>i_cast_fu_176_p1</rtlName>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>86</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>8</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name>empty_10</name>
<fileName>C:/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot\ap_axi_sdata.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>283</lineNumber>
<contextFuncName>read</contextFuncName>
<contextNormFuncName>read</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\Chiro\Programs\urllc-demo-pynq</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot\ap_axi_sdata.h</first>
<second>read</second>
</first>
<second>283</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control>auto</control>
<opType>adapter</opType>
<implIndex>axi4stream</implIndex>
<coreName>axis</coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>115</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>44</bitwidth>
</Value>
<oprand_edges>
<count>8</count>
<item_version>0</item_version>
<item>88</item>
<item>89</item>
<item>90</item>
<item>91</item>
<item>92</item>
<item>93</item>
<item>94</item>
<item>95</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>9</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>tmp</name>
<fileName>C:/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot\ap_axi_sdata.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>283</lineNumber>
<contextFuncName>read</contextFuncName>
<contextNormFuncName>read</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\Chiro\Programs\urllc-demo-pynq</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot\ap_axi_sdata.h</first>
<second>read</second>
</first>
<second>283</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp</originalName>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>96</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>10</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>54</id>
<name>tmp_1</name>
<fileName>C:/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot\ap_axi_sdata.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>283</lineNumber>
<contextFuncName>read</contextFuncName>
<contextNormFuncName>read</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\Chiro\Programs\urllc-demo-pynq</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot\ap_axi_sdata.h</first>
<second>read</second>
</first>
<second>283</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp</originalName>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>97</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>11</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>tmp_2</name>
<fileName>C:/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot\ap_axi_sdata.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>283</lineNumber>
<contextFuncName>read</contextFuncName>
<contextNormFuncName>read</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\Chiro\Programs\urllc-demo-pynq</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot\ap_axi_sdata.h</first>
<second>read</second>
</first>
<second>283</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp</originalName>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>98</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>12</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name>tmp_3</name>
<fileName>C:/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot\ap_axi_sdata.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>283</lineNumber>
<contextFuncName>read</contextFuncName>
<contextNormFuncName>read</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\Chiro\Programs\urllc-demo-pynq</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot\ap_axi_sdata.h</first>
<second>read</second>
</first>
<second>283</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp</originalName>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>2164457128</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>99</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>13</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name>tmp_4</name>
<fileName>C:/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot\ap_axi_sdata.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>283</lineNumber>
<contextFuncName>read</contextFuncName>
<contextNormFuncName>read</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\Chiro\Programs\urllc-demo-pynq</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot\ap_axi_sdata.h</first>
<second>read</second>
</first>
<second>283</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp</originalName>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>100</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>14</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name>tmp_5</name>
<fileName>C:/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot\ap_axi_sdata.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>283</lineNumber>
<contextFuncName>read</contextFuncName>
<contextNormFuncName>read</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\Chiro\Programs\urllc-demo-pynq</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot\ap_axi_sdata.h</first>
<second>read</second>
</first>
<second>283</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp</originalName>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4277552432</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>101</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>15</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>59</id>
<name>tmp_6</name>
<fileName>C:/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot\ap_axi_sdata.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>283</lineNumber>
<contextFuncName>read</contextFuncName>
<contextNormFuncName>read</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\Chiro\Programs\urllc-demo-pynq</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot\ap_axi_sdata.h</first>
<second>read</second>
</first>
<second>283</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp</originalName>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>2160226288</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>102</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>16</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name>da_addr</name>
<fileName>src/vitis_ip/urllc-vitis-top.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>15</lineNumber>
<contextFuncName>ad2dma</contextFuncName>
<contextNormFuncName>ad2dma</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\Chiro\Programs\urllc-demo-pynq</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/vitis_ip/urllc-vitis-top.cpp</first>
<second>ad2dma</second>
</first>
<second>15</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>2160273728</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>103</item>
<item>105</item>
<item>106</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>17</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>61</id>
<name>da_addr_write_ln15</name>
<fileName>src/vitis_ip/urllc-vitis-top.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>15</lineNumber>
<contextFuncName>ad2dma</contextFuncName>
<contextNormFuncName>ad2dma</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\Chiro\Programs\urllc-demo-pynq</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/vitis_ip/urllc-vitis-top.cpp</first>
<second>ad2dma</second>
</first>
<second>15</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control>auto</control>
<opType>ram</opType>
<implIndex>auto</implIndex>
<coreName>RAM</coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>82</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>107</item>
<item>108</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.77</m_delay>
<m_topoIndex>18</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>62</id>
<name>ad_addr</name>
<fileName>src/vitis_ip/urllc-vitis-top.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>16</lineNumber>
<contextFuncName>ad2dma</contextFuncName>
<contextNormFuncName>ad2dma</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\Chiro\Programs\urllc-demo-pynq</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/vitis_ip/urllc-vitis-top.cpp</first>
<second>ad2dma</second>
</first>
<second>16</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>2159614560</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>109</item>
<item>110</item>
<item>111</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>19</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>63</id>
<name>t_data_V</name>
<fileName>src/vitis_ip/urllc-vitis-top.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>16</lineNumber>
<contextFuncName>ad2dma</contextFuncName>
<contextNormFuncName>ad2dma</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\Chiro\Programs\urllc-demo-pynq</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/vitis_ip/urllc-vitis-top.cpp</first>
<second>ad2dma</second>
</first>
<second>16</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>t.data.V</originalName>
<rtlName/>
<control>auto</control>
<opType>ram</opType>
<implIndex>auto</implIndex>
<coreName>RAM</coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>82</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>112</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.77</m_delay>
<m_topoIndex>20</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>64</id>
<name>outs_V_data_V_write_ln304</name>
<fileName>C:/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot\ap_axi_sdata.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>304</lineNumber>
<contextFuncName>write</contextFuncName>
<contextNormFuncName>write</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\Chiro\Programs\urllc-demo-pynq</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot\ap_axi_sdata.h</first>
<second>write</second>
</first>
<second>304</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control>auto</control>
<opType>adapter</opType>
<implIndex>axi4stream</implIndex>
<coreName>axis</coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>115</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>15</count>
<item_version>0</item_version>
<item>114</item>
<item>115</item>
<item>116</item>
<item>117</item>
<item>118</item>
<item>119</item>
<item>120</item>
<item>121</item>
<item>122</item>
<item>123</item>
<item>124</item>
<item>125</item>
<item>126</item>
<item>127</item>
<item>128</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>22</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>65</id>
<name>i_write_ln11</name>
<fileName>src/vitis_ip/urllc-vitis-top.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>11</lineNumber>
<contextFuncName>ad2dma</contextFuncName>
<contextNormFuncName>ad2dma</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\Chiro\Programs\urllc-demo-pynq</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/vitis_ip/urllc-vitis-top.cpp</first>
<second>ad2dma</second>
</first>
<second>11</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>2159606400</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>129</item>
<item>130</item>
<item>298</item>
<item>299</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.29</m_delay>
<m_topoIndex>21</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>66</id>
<name>br_ln0</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>2159694720</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>131</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>24</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>68</id>
<name>_ln19</name>
<fileName>src/vitis_ip/urllc-vitis-top.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>19</lineNumber>
<contextFuncName>ad2dma</contextFuncName>
<contextNormFuncName>ad2dma</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\Chiro\Programs\urllc-demo-pynq</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/vitis_ip/urllc-vitis-top.cpp</first>
<second>ad2dma</second>
</first>
<second>19</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>45</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>23</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_41">
<Value>
<Obj>
<type>2</type>
<id>70</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>2003791467</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_42">
<Value>
<Obj>
<type>2</type>
<id>72</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1680154734</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_43">
<Value>
<Obj>
<type>2</type>
<id>78</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>544698226</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<const_type>0</const_type>
<content>200</content>
</item>
<item class_id_reference="16" object_id="_44">
<Value>
<Obj>
<type>2</type>
<id>81</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>6759712</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_45">
<Value>
<Obj>
<type>2</type>
<id>104</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>543517794</coreId>
<rtlModuleName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_46">
<Obj>
<type>3</type>
<id>42</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName/>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>17</item>
<item>40</item>
<item>41</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_47">
<Obj>
<type>3</type>
<id>49</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>2164386928</coreId>
<rtlModuleName/>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>43</item>
<item>45</item>
<item>47</item>
<item>48</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_48">
<Obj>
<type>3</type>
<id>67</id>
<name>.split</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName/>
</Obj>
<node_objs>
<count>16</count>
<item_version>0</item_version>
<item>50</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>60</item>
<item>61</item>
<item>62</item>
<item>63</item>
<item>64</item>
<item>65</item>
<item>66</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_49">
<Obj>
<type>3</type>
<id>69</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName/>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>60</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_50">
<id>71</id>
<edge_type>1</edge_type>
<source_obj>70</source_obj>
<sink_obj>17</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_51">
<id>73</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_52">
<id>74</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_53">
<id>75</id>
<edge_type>2</edge_type>
<source_obj>49</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_54">
<id>76</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_55">
<id>77</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_56">
<id>79</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_57">
<id>80</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_58">
<id>82</id>
<edge_type>1</edge_type>
<source_obj>81</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_59">
<id>83</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_60">
<id>84</id>
<edge_type>2</edge_type>
<source_obj>67</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_61">
<id>85</id>
<edge_type>2</edge_type>
<source_obj>69</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_62">
<id>86</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_63">
<id>89</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_64">
<id>90</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_65">
<id>91</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_66">
<id>92</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_67">
<id>93</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_68">
<id>94</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_69">
<id>95</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_70">
<id>96</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_71">
<id>97</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_72">
<id>98</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_73">
<id>99</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_74">
<id>100</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_75">
<id>101</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_76">
<id>102</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>59</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_77">
<id>103</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_78">
<id>105</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_79">
<id>106</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_80">
<id>107</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_81">
<id>108</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_82">
<id>109</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>62</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_83">
<id>110</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>62</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_84">
<id>111</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>62</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_85">
<id>112</id>
<edge_type>1</edge_type>
<source_obj>62</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_86">
<id>115</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_87">
<id>116</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_88">
<id>117</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_89">
<id>118</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_90">
<id>119</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_91">
<id>120</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_92">
<id>121</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_93">
<id>122</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_94">
<id>123</id>
<edge_type>1</edge_type>
<source_obj>54</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_95">
<id>124</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_96">
<id>125</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_97">
<id>126</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_98">
<id>127</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_99">
<id>128</id>
<edge_type>1</edge_type>
<source_obj>59</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_100">
<id>129</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_101">
<id>130</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_102">
<id>131</id>
<edge_type>2</edge_type>
<source_obj>49</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_103">
<id>293</id>
<edge_type>2</edge_type>
<source_obj>42</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_104">
<id>294</id>
<edge_type>2</edge_type>
<source_obj>49</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_105">
<id>295</id>
<edge_type>2</edge_type>
<source_obj>49</source_obj>
<sink_obj>67</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_106">
<id>296</id>
<edge_type>2</edge_type>
<source_obj>67</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_107">
<id>297</id>
<edge_type>4</edge_type>
<source_obj>40</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_108">
<id>298</id>
<edge_type>4</edge_type>
<source_obj>40</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_109">
<id>299</id>
<edge_type>4</edge_type>
<source_obj>43</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</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="_110">
<mId>1</mId>
<mTag>ad2dma</mTag>
<mNormTag>ad2dma</mNormTag>
<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>203</mMinLatency>
<mMaxLatency>203</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_111">
<mId>2</mId>
<mTag>Entry</mTag>
<mNormTag>Entry</mNormTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_112">
<mId>3</mId>
<mTag>VITIS_LOOP_11_1</mTag>
<mNormTag>VITIS_LOOP_11_1</mNormTag>
<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>49</item>
<item>67</item>
</basic_blocks>
<mII>1</mII>
<mDepth>3</mDepth>
<mMinTripCount>200</mMinTripCount>
<mMaxTripCount>200</mMaxTripCount>
<mMinLatency>201</mMinLatency>
<mMaxLatency>201</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_113">
<mId>4</mId>
<mTag>Return</mTag>
<mNormTag>Return</mNormTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>69</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_114">
<states class_id="25" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_115">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>45</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_116">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_117">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_118">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_119">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_120">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_121">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_122">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_123">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_124">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_125">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_126">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_127">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_128">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_129">
<id>30</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_130">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_131">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_132">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_133">
<id>34</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_134">
<id>35</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_135">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_136">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_137">
<id>38</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_138">
<id>39</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_139">
<id>40</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_140">
<id>41</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_141">
<id>43</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_142">
<id>44</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_143">
<id>45</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_144">
<id>46</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_145">
<id>47</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_146">
<id>48</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_147">
<id>50</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_148">
<id>52</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_149">
<id>53</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_150">
<id>54</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_151">
<id>55</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_152">
<id>56</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_153">
<id>57</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_154">
<id>58</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_155">
<id>59</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_156">
<id>60</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_157">
<id>61</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_158">
<id>62</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_159">
<id>63</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_160">
<id>65</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_161">
<id>2</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_162">
<id>63</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_163">
<id>64</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_164">
<id>68</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_165">
<id>3</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_166">
<id>51</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_167">
<id>64</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_168">
<id>66</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_169">
<inState>2</inState>
<outState>3</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>-1</id>
<sop class_id="32" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_170">
<inState>1</inState>
<outState>2</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="34" tracking_level="1" version="0" object_id="_171">
<dp_component_resource class_id="35" tracking_level="0" version="0">
<count>16</count>
<item_version>0</item_version>
<item class_id="36" tracking_level="0" version="0">
<first>control_s_axi_U (control_s_axi)</first>
<second class_id="37" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>BRAM</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>36</second>
</item>
<item>
<first>LUT</first>
<second>40</second>
</item>
</second>
</item>
<item>
<first>flow_control_loop_pipe_U (ad2dma_flow_control_loop_pipe)</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>regslice_both_inputs_V_data_V_U (ad2dma_regslice_both)</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>regslice_both_inputs_V_dest_V_U (ad2dma_regslice_both)</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>regslice_both_inputs_V_id_V_U (ad2dma_regslice_both)</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>regslice_both_inputs_V_keep_V_U (ad2dma_regslice_both)</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>regslice_both_inputs_V_last_V_U (ad2dma_regslice_both)</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>regslice_both_inputs_V_strb_V_U (ad2dma_regslice_both)</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>regslice_both_inputs_V_user_V_U (ad2dma_regslice_both)</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>regslice_both_outs_V_data_V_U (ad2dma_regslice_both)</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>regslice_both_outs_V_dest_V_U (ad2dma_regslice_both)</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>regslice_both_outs_V_id_V_U (ad2dma_regslice_both)</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>regslice_both_outs_V_keep_V_U (ad2dma_regslice_both)</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>regslice_both_outs_V_last_V_U (ad2dma_regslice_both)</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>regslice_both_outs_V_strb_V_U (ad2dma_regslice_both)</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>regslice_both_outs_V_user_V_U (ad2dma_regslice_both)</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
</dp_component_resource>
<dp_expression_resource>
<count>7</count>
<item_version>0</item_version>
<item>
<first>add_ln11_fu_170_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>8</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>8</second>
</item>
</second>
</item>
<item>
<first>ap_block_pp0_stage0_01001 ( or ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_block_state1_pp0_stage0_iter0 ( and ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_block_state2_pp0_stage0_iter1 ( or ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_condition_191 ( and ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_pp0 ( xor ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>2</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>icmp_ln11_fu_164_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>8</second>
</item>
<item>
<first>(1P1)</first>
<second>7</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>4</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_done_int</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter1</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>ap_sig_allocacmp_i_1</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>8</second>
</item>
<item>
<first>(2Count)</first>
<second>16</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>i_fu_82</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>8</second>
</item>
<item>
<first>(2Count)</first>
<second>16</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>inputs_TDATA_blk_n</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>outs_TDATA_blk_n</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
</dp_multiplexer_resource>
<dp_register_resource>
<count>12</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>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_done_reg</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter1</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter2</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_loop_exit_ready_pp0_iter1_reg</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>i_fu_82</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_1_reg_227</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>tmp_2_reg_232</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>tmp_3_reg_237</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>tmp_4_reg_242</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>tmp_5_reg_247</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>tmp_6_reg_252</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>
</dp_register_resource>
<dp_dsp_resource>
<count>16</count>
<item_version>0</item_version>
<item>
<first>control_s_axi_U</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>flow_control_loop_pipe_U</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>regslice_both_inputs_V_data_V_U</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>regslice_both_inputs_V_dest_V_U</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>regslice_both_inputs_V_id_V_U</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>regslice_both_inputs_V_keep_V_U</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>regslice_both_inputs_V_last_V_U</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>regslice_both_inputs_V_strb_V_U</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>regslice_both_inputs_V_user_V_U</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>regslice_both_outs_V_data_V_U</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>regslice_both_outs_V_dest_V_U</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>regslice_both_outs_V_id_V_U</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>regslice_both_outs_V_keep_V_U</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>regslice_both_outs_V_last_V_U</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>regslice_both_outs_V_strb_V_U</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>regslice_both_outs_V_user_V_U</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
</dp_dsp_resource>
<dp_component_map class_id="39" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_map>
<dp_expression_map>
<count>2</count>
<item_version>0</item_version>
<item class_id="40" tracking_level="0" version="0">
<first>add_ln11_fu_170_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>icmp_ln11_fu_164_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</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="41" tracking_level="0" version="0">
<count>24</count>
<item_version>0</item_version>
<item class_id="42" tracking_level="0" version="0">
<first>17</first>
<second class_id="43" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>62</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>63</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>65</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>66</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="44" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="45" tracking_level="0" version="0">
<first>42</first>
<second class_id="46" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>67</first>
<second>
<first>1</first>
<second>3</second>
</second>
</item>
<item>
<first>69</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="47" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="48" tracking_level="1" version="0" object_id="_172">
<region_name>VITIS_LOOP_11_1</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>49</item>
<item>67</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>
<mDBIIViolationVec class_id="49" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</mDBIIViolationVec>
</item>
</regions>
<dp_fu_nodes class_id="50" tracking_level="0" version="0">
<count>20</count>
<item_version>0</item_version>
<item class_id="51" tracking_level="0" version="0">
<first>82</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>86</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>104</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>64</item>
<item>64</item>
</second>
</item>
<item>
<first>129</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>136</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>142</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>149</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>63</item>
<item>63</item>
</second>
</item>
<item>
<first>156</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>161</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>164</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>170</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>176</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>182</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>187</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>191</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>195</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>199</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>203</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>207</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>211</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="53" tracking_level="0" version="0">
<count>13</count>
<item_version>0</item_version>
<item class_id="54" tracking_level="0" version="0">
<first>ad_addr_gep_fu_142</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>add_ln11_fu_170</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>da_addr_gep_fu_129</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>i_cast_fu_176</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>i_fu_82</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>icmp_ln11_fu_164</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>tmp_1_fu_187</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>tmp_2_fu_191</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>tmp_3_fu_195</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>tmp_4_fu_199</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>tmp_5_fu_203</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>tmp_6_fu_207</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>tmp_fu_182</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</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>5</count>
<item_version>0</item_version>
<item>
<first>empty_10_read_fu_86</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>grp_write_fu_104</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>64</item>
<item>64</item>
</second>
</item>
<item>
<first>i_1_load_fu_161</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>store_ln11_store_fu_156</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>store_ln11_store_fu_211</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="55" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="56" tracking_level="0" version="0">
<first class_id="57" tracking_level="0" version="0">
<first>ad</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>63</item>
<item>63</item>
</second>
</item>
<item>
<first>
<first>da</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>10</count>
<item_version>0</item_version>
<item>
<first>216</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>223</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>227</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>232</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>237</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>242</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>247</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>252</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>257</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>262</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>10</count>
<item_version>0</item_version>
<item>
<first>ad_addr_reg_257</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>i_reg_216</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>icmp_ln11_reg_223</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>t_data_V_reg_262</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>tmp_1_reg_227</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>tmp_2_reg_232</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>tmp_3_reg_237</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>tmp_4_reg_242</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>tmp_5_reg_247</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>tmp_6_reg_252</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="58" tracking_level="0" version="0">
<count>16</count>
<item_version>0</item_version>
<item class_id="59" tracking_level="0" version="0">
<first>ad(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>63</item>
<item>63</item>
</second>
</item>
</second>
</item>
<item>
<first>da(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>61</item>
</second>
</item>
</second>
</item>
<item>
<first>inputs_V_data_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
</second>
</item>
<item>
<first>inputs_V_dest_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
</second>
</item>
<item>
<first>inputs_V_id_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
</second>
</item>
<item>
<first>inputs_V_keep_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
</second>
</item>
<item>
<first>inputs_V_last_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
</second>
</item>
<item>
<first>inputs_V_strb_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
</second>
</item>
<item>
<first>inputs_V_user_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
</second>
</item>
<item>
<first>outs_V_data_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
</second>
</item>
<item>
<first>outs_V_dest_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
</second>
</item>
<item>
<first>outs_V_id_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
</second>
</item>
<item>
<first>outs_V_keep_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
</second>
</item>
<item>
<first>outs_V_last_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
</second>
</item>
<item>
<first>outs_V_strb_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
</second>
</item>
<item>
<first>outs_V_user_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core>
<count>2</count>
<item_version>0</item_version>
<item>
<first>1</first>
<second>
<first>27</first>
<second>136</second>
</second>
</item>
<item>
<first>2</first>
<second>
<first>27</first>
<second>136</second>
</second>
</item>
</port2core>
<node2core>
<count>6</count>
<item_version>0</item_version>
<item>
<first>45</first>
<second>
<first>45</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>8</first>
<second>4</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>888</first>
<second>111</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>27</first>
<second>136</second>
</second>
</item>
<item>
<first>63</first>
<second>
<first>27</first>
<second>136</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>888</first>
<second>111</second>
</second>
</item>
</node2core>
</syndb>
</boost_serialization>
|
--===========================================================================
--
-- This application provides an embedded dashboard controller offering:
-- - UART Interface
-- - LED Area
-- - 5x7 Matrix Display with two displays as one logical unit
--
--===========================================================================
--
-- Copyright 2021 (C) Holger Rodriguez
--
-- SPDX-License-Identifier: BSD-3-Clause
--
with RP.Device;
with ItsyBitsy;
with Initializer;
with Transport.Serial;
with Evaluate.LEDs;
with Evaluate.Matrices;
with Execute;
with Execute.LEDs;
with Execute.Matrices;
procedure Edc is
--------------------------------------------------------------------------
-- Processes a request for the LED area
-- * gets the serial command request
-- * checks the input for correctness
-- * if OK, then executes the command given
--------------------------------------------------------------------------
procedure Process_LED (Instruction : Evaluate.LEDs.LED_Instruction);
procedure Process_LED (Instruction : Evaluate.LEDs.LED_Instruction) is
Error : Execute.LED_Errors;
Action : Execute.LED_Actions;
begin
Error := Evaluate.LEDs.Check_Input (Instruction);
case Error is
when Execute.OK =>
ItsyBitsy.LED.Clear;
Action := Evaluate.LEDs.Evaluate (Instruction);
Execute.LEDs.Execute (Action);
when others =>
ItsyBitsy.LED.Set;
end case;
end Process_LED;
--------------------------------------------------------------------------
-- Processes a request for the Matrix area
-- * gets the serial command request
-- * checks the input for correctness
-- * if OK, then executes the command given
--------------------------------------------------------------------------
procedure Process_Matrix (Instruction
: Evaluate.Matrices.Matrix_Instruction);
procedure Process_Matrix (Instruction
: Evaluate.Matrices.Matrix_Instruction) is
Error : Execute.Matrix_Errors;
Action : Execute.Matrix_Command;
use Execute;
begin
Error := Evaluate.Matrices.Check_Input (Instruction);
case Error is
when Execute.M_OK =>
ItsyBitsy.LED.Clear;
Action := Evaluate.Matrices.Evaluate (Instruction => Instruction);
Execute.Matrices.Execute (Action);
when others =>
ItsyBitsy.LED.Set;
end case;
end Process_Matrix;
procedure Show_Patterns_After_Reset;
procedure Show_Patterns_After_Reset is
Word_Pattern_0000 : constant Execute.Matrix_Command
:= (Block => Execute.Block_0,
Command => Execute.Word_0,
Value => "00000000"
);
Word_Pattern_000F : constant Execute.Matrix_Command
:= (Block => Execute.Block_0,
Command => Execute.Word_0,
Value => "000F0000"
);
Word_Pattern_00F0 : constant Execute.Matrix_Command
:= (Block => Execute.Block_0,
Command => Execute.Word_0,
Value => "00F00000"
);
Word_Pattern_0F00 : constant Execute.Matrix_Command
:= (Block => Execute.Block_0,
Command => Execute.Word_0,
Value => "0F000000"
);
Word_Pattern_F000 : constant Execute.Matrix_Command
:= (Block => Execute.Block_0,
Command => Execute.Word_0,
Value => "F0000000"
);
Word_Pattern_FFFF : constant Execute.Matrix_Command
:= (Block => Execute.Block_0,
Command => Execute.Word_0,
Value => "FFFF0000"
);
Double_Word_Pattern_00000000 : constant Execute.Matrix_Command
:= (Block => Execute.Block_1,
Command => Execute.Double_Word_0,
Value => "00000000"
);
Double_Word_Pattern_0000000F : constant Execute.Matrix_Command
:= (Block => Execute.Block_1,
Command => Execute.Double_Word_0,
Value => "0000000F"
);
Double_Word_Pattern_000000F0 : constant Execute.Matrix_Command
:= (Block => Execute.Block_1,
Command => Execute.Double_Word_0,
Value => "000000F0"
);
Double_Word_Pattern_00000F00 : constant Execute.Matrix_Command
:= (Block => Execute.Block_1,
Command => Execute.Double_Word_0,
Value => "00000F00"
);
Double_Word_Pattern_0000F000 : constant Execute.Matrix_Command
:= (Block => Execute.Block_1,
Command => Execute.Double_Word_0,
Value => "0000F000"
);
Double_Word_Pattern_000F0000 : constant Execute.Matrix_Command
:= (Block => Execute.Block_1,
Command => Execute.Double_Word_0,
Value => "000F0000"
);
Double_Word_Pattern_00F00000 : constant Execute.Matrix_Command
:= (Block => Execute.Block_1,
Command => Execute.Double_Word_0,
Value => "00F00000"
);
Double_Word_Pattern_0F000000 : constant Execute.Matrix_Command
:= (Block => Execute.Block_1,
Command => Execute.Double_Word_0,
Value => "0F000000"
);
Double_Word_Pattern_F0000000 : constant Execute.Matrix_Command
:= (Block => Execute.Block_1,
Command => Execute.Double_Word_0,
Value => "F0000000"
);
TIME_BETWEEN_PATTERN : constant Integer := 100;
begin
-----------------------------------------------------------------------
-- Pattern with LEDs ON
Execute.LEDs.Execute (Cmd => Execute.Red_On);
Execute.LEDs.Execute (Cmd => Execute.Amber_On);
Execute.LEDs.Execute (Cmd => Execute.Green_On);
Execute.LEDs.Execute (Cmd => Execute.White_On);
Execute.LEDs.Execute (Cmd => Execute.Blue_On);
RP.Device.Timer.Delay_Milliseconds (TIME_BETWEEN_PATTERN);
-----------------------------------------------------------------------
-- Pattern with Matrix Word
Execute.Matrices.Execute (Cmd => Word_Pattern_0000);
RP.Device.Timer.Delay_Milliseconds (TIME_BETWEEN_PATTERN);
Execute.Matrices.Execute (Cmd => Word_Pattern_000F);
RP.Device.Timer.Delay_Milliseconds (TIME_BETWEEN_PATTERN);
Execute.Matrices.Execute (Cmd => Word_Pattern_00F0);
RP.Device.Timer.Delay_Milliseconds (TIME_BETWEEN_PATTERN);
Execute.Matrices.Execute (Cmd => Word_Pattern_0F00);
RP.Device.Timer.Delay_Milliseconds (TIME_BETWEEN_PATTERN);
Execute.Matrices.Execute (Cmd => Word_Pattern_F000);
RP.Device.Timer.Delay_Milliseconds (TIME_BETWEEN_PATTERN);
-----------------------------------------------------------------------
-- Pattern with Matrix Double Word
Execute.Matrices.Execute (Cmd => Double_Word_Pattern_00000000);
RP.Device.Timer.Delay_Milliseconds (TIME_BETWEEN_PATTERN);
Execute.Matrices.Execute (Cmd => Double_Word_Pattern_0000000F);
RP.Device.Timer.Delay_Milliseconds (TIME_BETWEEN_PATTERN);
Execute.Matrices.Execute (Cmd => Double_Word_Pattern_000000F0);
RP.Device.Timer.Delay_Milliseconds (TIME_BETWEEN_PATTERN);
Execute.Matrices.Execute (Cmd => Double_Word_Pattern_00000F00);
RP.Device.Timer.Delay_Milliseconds (TIME_BETWEEN_PATTERN);
Execute.Matrices.Execute (Cmd => Double_Word_Pattern_0000F000);
RP.Device.Timer.Delay_Milliseconds (TIME_BETWEEN_PATTERN);
Execute.Matrices.Execute (Cmd => Double_Word_Pattern_000F0000);
RP.Device.Timer.Delay_Milliseconds (TIME_BETWEEN_PATTERN);
Execute.Matrices.Execute (Cmd => Double_Word_Pattern_00F00000);
RP.Device.Timer.Delay_Milliseconds (TIME_BETWEEN_PATTERN);
Execute.Matrices.Execute (Cmd => Double_Word_Pattern_0F000000);
RP.Device.Timer.Delay_Milliseconds (TIME_BETWEEN_PATTERN);
Execute.Matrices.Execute (Cmd => Double_Word_Pattern_F0000000);
RP.Device.Timer.Delay_Milliseconds (TIME_BETWEEN_PATTERN);
-----------------------------------------------------------------------
-- Pattern with Matrix Word
Execute.Matrices.Execute (Cmd => Word_Pattern_0000);
RP.Device.Timer.Delay_Milliseconds (TIME_BETWEEN_PATTERN);
-----------------------------------------------------------------------
-- Pattern with Matrix Double Word
Execute.Matrices.Execute (Cmd => Double_Word_Pattern_00000000);
RP.Device.Timer.Delay_Milliseconds (TIME_BETWEEN_PATTERN);
-----------------------------------------------------------------------
-- Pattern with LEDs OFF
Execute.LEDs.Execute (Cmd => Execute.Red_Off);
Execute.LEDs.Execute (Cmd => Execute.Amber_Off);
Execute.LEDs.Execute (Cmd => Execute.Green_Off);
Execute.LEDs.Execute (Cmd => Execute.White_Off);
Execute.LEDs.Execute (Cmd => Execute.Blue_Off);
end Show_Patterns_After_Reset;
Area_Selector : Transport.Area_Selector;
LED_Instruction : Evaluate.LEDs.LED_Instruction;
Matrix_Instruction : Evaluate.Matrices.Matrix_Instruction;
begin
Initializer.Initialize_All;
Show_Patterns_After_Reset;
loop
-- Check for Serial Channel input
Area_Selector := Transport.Serial.Get_Area_Selector;
case Area_Selector is
when Transport.Led =>
-- something arrived on serial, handle it
LED_Instruction := Transport.Serial.Get_LED_Instruction;
Process_LED (LED_Instruction);
when Transport.Matrix =>
-- something arrived on serial, handle it
Matrix_Instruction := Transport.Serial.Get_Matrix_Instruction;
Process_Matrix (Matrix_Instruction);
when Transport.None =>
null;
end case;
end loop;
end Edc;
--===========================================================================
--
-- MAJOR TITLE HERE
--
--===========================================================================
--------------------------------------------------------------------------
-- Minor Title Here
--------------------------------------------------------------------------
---------------------
-- Subsection Header
---------------------
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Generic_Collections;
package AMF.Standard_Profile_L2.Files.Collections is
pragma Preelaborate;
package Standard_Profile_L2_File_Collections is
new AMF.Generic_Collections
(Standard_Profile_L2_File,
Standard_Profile_L2_File_Access);
type Set_Of_Standard_Profile_L2_File is
new Standard_Profile_L2_File_Collections.Set with null record;
Empty_Set_Of_Standard_Profile_L2_File : constant Set_Of_Standard_Profile_L2_File;
type Ordered_Set_Of_Standard_Profile_L2_File is
new Standard_Profile_L2_File_Collections.Ordered_Set with null record;
Empty_Ordered_Set_Of_Standard_Profile_L2_File : constant Ordered_Set_Of_Standard_Profile_L2_File;
type Bag_Of_Standard_Profile_L2_File is
new Standard_Profile_L2_File_Collections.Bag with null record;
Empty_Bag_Of_Standard_Profile_L2_File : constant Bag_Of_Standard_Profile_L2_File;
type Sequence_Of_Standard_Profile_L2_File is
new Standard_Profile_L2_File_Collections.Sequence with null record;
Empty_Sequence_Of_Standard_Profile_L2_File : constant Sequence_Of_Standard_Profile_L2_File;
private
Empty_Set_Of_Standard_Profile_L2_File : constant Set_Of_Standard_Profile_L2_File
:= (Standard_Profile_L2_File_Collections.Set with null record);
Empty_Ordered_Set_Of_Standard_Profile_L2_File : constant Ordered_Set_Of_Standard_Profile_L2_File
:= (Standard_Profile_L2_File_Collections.Ordered_Set with null record);
Empty_Bag_Of_Standard_Profile_L2_File : constant Bag_Of_Standard_Profile_L2_File
:= (Standard_Profile_L2_File_Collections.Bag with null record);
Empty_Sequence_Of_Standard_Profile_L2_File : constant Sequence_Of_Standard_Profile_L2_File
:= (Standard_Profile_L2_File_Collections.Sequence with null record);
end AMF.Standard_Profile_L2.Files.Collections;
|
generic
type Swap_Type is private; -- Generic parameter
procedure Generic_Swap(Left : in out Swap_Type; Right : in out Swap_Type);
procedure Generic_Swap(Left : in out Swap_Type; Right : in out Swap_Type) is
Temp : Swap_Type := Left;
begin
Left := Right;
Right := Temp;
end Generic_Swap;
|
-----------------------------------------------------------------------
-- ASF tests - ASF Tests Framework
-- Copyright (C) 2011, 2012, 2013 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with GNAT.Regpat;
with Ada.Strings.Unbounded;
with Util.Files;
with ASF.Streams;
with ASF.Servlets.Faces;
with ASF.Servlets.Files;
with ASF.Servlets.Ajax;
with ASF.Servlets.Measures;
with ASF.Responses;
with ASF.Responses.Tools;
with ASF.Filters.Dump;
package body ASF.Tests is
use Ada.Strings.Unbounded;
use Util.Tests;
CONTEXT_PATH : constant String := "/asfunit";
Server : access ASF.Server.Container;
App : ASF.Applications.Main.Application_Access := null;
Faces : aliased ASF.Servlets.Faces.Faces_Servlet;
Files : aliased ASF.Servlets.Files.File_Servlet;
Ajax : aliased ASF.Servlets.Ajax.Ajax_Servlet;
Dump : aliased ASF.Filters.Dump.Dump_Filter;
Measures : aliased ASF.Servlets.Measures.Measure_Servlet;
-- Save the response headers and content in a file
procedure Save_Response (Name : in String;
Response : in out ASF.Responses.Mockup.Response);
-- ------------------------------
-- Initialize the awa test framework mockup.
-- ------------------------------
procedure Initialize (Props : in Util.Properties.Manager;
Application : in ASF.Applications.Main.Application_Access := null;
Factory : in out ASF.Applications.Main.Application_Factory'Class) is
use type ASF.Applications.Main.Application_Access;
C : ASF.Applications.Config;
begin
if Application /= null then
App := Application;
else
App := new ASF.Applications.Main.Application;
end if;
Server := new ASF.Server.Container;
Server.Register_Application (CONTEXT_PATH, App.all'Access);
C.Copy (Props);
App.Initialize (C, Factory);
App.Register ("layoutMsg", "layout");
App.Set_Global ("contextPath", CONTEXT_PATH);
-- Register the servlets and filters
App.Add_Servlet (Name => "faces", Server => Faces'Access);
App.Add_Servlet (Name => "files", Server => Files'Access);
App.Add_Servlet (Name => "ajax", Server => Ajax'Access);
App.Add_Servlet (Name => "measures", Server => Measures'Access);
App.Add_Filter (Name => "dump", Filter => Dump'Access);
App.Add_Filter (Name => "measures", Filter => Measures'Access);
-- Define servlet mappings
App.Add_Mapping (Name => "faces", Pattern => "*.html");
App.Add_Mapping (Name => "files", Pattern => "*.css");
App.Add_Mapping (Name => "files", Pattern => "*.js");
App.Add_Mapping (Name => "files", Pattern => "*.properties");
App.Add_Mapping (Name => "files", Pattern => "*.xhtml");
App.Add_Mapping (Name => "ajax", Pattern => "/ajax/*");
App.Add_Mapping (Name => "measures", Pattern => "stats.xml");
App.Add_Filter_Mapping (Name => "measures", Pattern => "*");
App.Add_Filter_Mapping (Name => "measures", Pattern => "/ajax/*");
App.Add_Filter_Mapping (Name => "measures", Pattern => "*.html");
App.Add_Filter_Mapping (Name => "measures", Pattern => "*.xhtml");
App.Add_Filter_Mapping (Name => "dump", Pattern => "*.html");
App.Add_Filter_Mapping (Name => "dump", Pattern => "*.css");
App.Add_Filter_Mapping (Name => "dump", Pattern => "/ajax/*");
end Initialize;
-- ------------------------------
-- Get the server
-- ------------------------------
function Get_Server return access ASF.Server.Container is
begin
return Server;
end Get_Server;
-- ------------------------------
-- Get the test application.
-- ------------------------------
function Get_Application return ASF.Applications.Main.Application_Access is
begin
return App;
end Get_Application;
-- ------------------------------
-- Save the response headers and content in a file
-- ------------------------------
procedure Save_Response (Name : in String;
Response : in out ASF.Responses.Mockup.Response) is
use ASF.Responses;
Info : constant String := Tools.To_String (Reply => Response,
Html => False,
Print_Headers => True);
Result_Path : constant String := Util.Tests.Get_Test_Path ("regtests/result");
Content : Unbounded_String;
Stream : ASF.Streams.Print_Stream := Response.Get_Output_Stream;
begin
Response.Read_Content (Content);
Stream.Write (Content);
Insert (Content, 1, Info);
Util.Files.Write_File (Result_Path & "/" & Name, Content);
end Save_Response;
-- ------------------------------
-- Simulate a raw request. The URI and method must have been set on the Request object.
-- ------------------------------
procedure Do_Req (Request : in out ASF.Requests.Mockup.Request;
Response : in out ASF.Responses.Mockup.Response) is
begin
-- For the purpose of writing tests, clear the buffer before invoking the service.
Response.Clear;
Server.Service (Request => Request,
Response => Response);
end Do_Req;
-- ------------------------------
-- Simulate a GET request on the given URI with the request parameters.
-- Get the result in the response object.
-- ------------------------------
procedure Do_Get (Request : in out ASF.Requests.Mockup.Request;
Response : in out ASF.Responses.Mockup.Response;
URI : in String;
Save : in String := "") is
begin
Request.Set_Method (Method => "GET");
Request.Set_Request_URI (URI => CONTEXT_PATH & URI);
Request.Set_Protocol (Protocol => "HTTP/1.1");
Do_Req (Request, Response);
if Save'Length > 0 then
Save_Response (Save, Response);
end if;
end Do_Get;
-- ------------------------------
-- Simulate a POST request on the given URI with the request parameters.
-- Get the result in the response object.
-- ------------------------------
procedure Do_Post (Request : in out ASF.Requests.Mockup.Request;
Response : in out ASF.Responses.Mockup.Response;
URI : in String;
Save : in String := "") is
begin
Request.Set_Method (Method => "POST");
Request.Set_Request_URI (URI => CONTEXT_PATH & URI);
Request.Set_Protocol (Protocol => "HTTP/1.1");
Do_Req (Request, Response);
if Save'Length > 0 then
Save_Response (Save, Response);
end if;
end Do_Post;
-- ------------------------------
-- Check that the response body contains the string
-- ------------------------------
procedure Assert_Contains (T : in Util.Tests.Test'Class;
Value : in String;
Reply : in out ASF.Responses.Mockup.Response;
Message : in String := "Test failed";
Source : String := GNAT.Source_Info.File;
Line : Natural := GNAT.Source_Info.Line) is
Stream : ASF.Streams.Print_Stream := Reply.Get_Output_Stream;
Content : Unbounded_String;
begin
Reply.Read_Content (Content);
Stream.Write (Content);
Assert_Equals (T, ASF.Responses.SC_OK, Reply.Get_Status, "Invalid response", Source, Line);
T.Assert (Condition => Index (Content, Value) > 0,
Message => Message & ": value '" & Value & "' not found",
Source => Source,
Line => Line);
end Assert_Contains;
-- ------------------------------
-- Check that the response body matches the regular expression
-- ------------------------------
procedure Assert_Matches (T : in Util.Tests.Test'Class;
Pattern : in String;
Reply : in out ASF.Responses.Mockup.Response;
Message : in String := "Test failed";
Status : in Natural := ASF.Responses.SC_OK;
Source : String := GNAT.Source_Info.File;
Line : Natural := GNAT.Source_Info.Line) is
use GNAT.Regpat;
Stream : ASF.Streams.Print_Stream := Reply.Get_Output_Stream;
Content : Unbounded_String;
Regexp : constant Pattern_Matcher := Compile (Expression => Pattern,
Flags => Multiple_Lines);
begin
Reply.Read_Content (Content);
Stream.Write (Content);
Assert_Equals (T, Status, Reply.Get_Status, "Invalid response", Source, Line);
T.Assert (Condition => Match (Regexp, To_String (Content)),
Message => Message & ": does not match '" & Pattern & "'",
Source => Source,
Line => Line);
end Assert_Matches;
-- ------------------------------
-- Check that the response body is a redirect to the given URI.
-- ------------------------------
procedure Assert_Redirect (T : in Util.Tests.Test'Class;
Value : in String;
Reply : in out ASF.Responses.Mockup.Response;
Message : in String := "Test failed";
Source : String := GNAT.Source_Info.File;
Line : Natural := GNAT.Source_Info.Line) is
begin
Assert_Equals (T, ASF.Responses.SC_MOVED_TEMPORARILY, Reply.Get_Status,
"Invalid response", Source, Line);
Util.Tests.Assert_Equals (T, Value, Reply.Get_Header ("Location"),
Message & ": missing Location",
Source, Line);
end Assert_Redirect;
end ASF.Tests;
|
package AFRL.CMASI.MissionCommand.SPARK_Boundary with SPARK_Mode is
pragma Annotate (GNATprove, Terminating, SPARK_Boundary);
function Get_VehicleID
(Command : MissionCommand) return Int64
with Global => null;
end AFRL.CMASI.MissionCommand.SPARK_Boundary;
|
-- This is a comment.
with Ada.Text_IO;
with Ada.Integer_Text_IO;
procedure FizzBuzz is
begin
for i in 1 .. 100 loop
if (i mod 3 = 0 and i mod 5 = 0) then
Ada.Text_IO.Put_Line("FizzBuzz");
elsif (i mod 3 = 0) then
Ada.Text_IO.Put_Line("Fizz");
elsif (i mod 5 = 0) then
Ada.Text_IO.Put_Line("Buzz");
else
Ada.Integer_Text_IO.Put(i, 0);
Ada.Text_IO.Put_Line("");
end if;
end loop;
end
FizzBuzz;
|
with Deferred_Constant;
procedure Subprogram_Unit is
J : constant Integer := Deferred_Constant.I;
begin
null;
end Subprogram_Unit;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- C O M P E R R --
-- --
-- S p e c --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-2002 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains the routine called when a fatal internal compiler
-- error is detected. Calls to this routines cause termination of the
-- current compilation with appropriate error output.
package Comperr is
procedure Compiler_Abort
(X : String;
Code : Integer := 0);
-- Signals an internal compiler error. Never returns control. Depending
-- on processing may end up raising Unrecoverable_Error, or exiting
-- directly. The message output is a "bug box" containing the
-- string passed as an argument. The node in Current_Error_Node is used
-- to provide the location where the error should be signalled. The
-- message includes the node id, and the code parameter if it is positive.
-- Note that this is only used at the outer level (to handle constraint
-- errors or assert errors etc.) In the normal logic of the compiler we
-- always use pragma Assert to check for errors, and if necessary an
-- explicit abort is achieved by pragma Assert (False). Code is positive
-- for a gigi abort (giving the gigi abort code), zero for a front
-- end exception (with possible message stored in TSD.Current_Excep,
-- and negative (an unused value) for a GCC abort.
------------------------------
-- Use of gnat_bug.box File --
------------------------------
-- When comperr generates the "bug box". The first two lines contain
-- information on the version number, type of abort, and source location.
-- Normally the remaining text is of the following form:
-- Please submit bug a report, see http://gcc.gnu.org/bugs.html.
-- Include the entire contents of this bug box in the report.
-- Include the exact gcc or gnatmake command that you entered.
-- Also include sources listed below in gnatchop format
-- concatenated together with no headers between files.
-- However, an alternative mechanism exists for easily substituting
-- different text for this message. Compiler_Abort checks for the
-- existence of the file "gnat_bug.box" in the current source path.
-- Most typically this file, if present, will be in the directory
-- containing the run-time sources.
-- If this file is present, then it is a plain ASCII file, whose
-- contents replace the above quoted paragraphs. The lines in this
-- file should be 72 characters or less to avoid misformatting the
-- right boundary of the box. Note that the file does not contain
-- the vertical bar characters or any leading spaces in lines.
end Comperr;
|
------------------------------------------------------------------------------
-- --
-- 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) 1997-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 is the VxWorks version
-- 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.
package body System.OS_Interface is
use type Interfaces.C.int;
Low_Priority : constant := 255;
-- VxWorks native (default) lowest scheduling priority
-----------------
-- To_Duration --
-----------------
function To_Duration (TS : timespec) return Duration is
begin
return Duration (TS.ts_sec) + Duration (TS.ts_nsec) / 10#1#E9;
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 is negative 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'(ts_sec => S,
ts_nsec => long (Long_Long_Integer (F * 10#1#E9)));
end To_Timespec;
-------------------------
-- To_VxWorks_Priority --
-------------------------
function To_VxWorks_Priority (Priority : int) return int is
begin
return Low_Priority - Priority;
end To_VxWorks_Priority;
--------------------
-- To_Clock_Ticks --
--------------------
-- ??? - For now, we'll always get the system clock rate since it is
-- allowed to be changed during run-time in VxWorks. A better method would
-- be to provide an operation to set it that so we can always know its
-- value.
-- Another thing we should probably allow for is a resultant tick count
-- greater than int'Last. This should probably be a procedure with two
-- output parameters, one in the range 0 .. int'Last, and another
-- representing the overflow count.
function To_Clock_Ticks (D : Duration) return int is
Ticks : Long_Long_Integer;
Rate_Duration : Duration;
Ticks_Duration : Duration;
begin
if D < 0.0 then
return ERROR;
end if;
-- Ensure that the duration can be converted to ticks
-- at the current clock tick rate without overflowing.
Rate_Duration := Duration (sysClkRateGet);
if D > (Duration'Last / Rate_Duration) then
Ticks := Long_Long_Integer (int'Last);
else
Ticks_Duration := D * Rate_Duration;
Ticks := Long_Long_Integer (Ticks_Duration);
if Ticks_Duration > Duration (Ticks) then
Ticks := Ticks + 1;
end if;
if Ticks > Long_Long_Integer (int'Last) then
Ticks := Long_Long_Integer (int'Last);
end if;
end if;
return int (Ticks);
end To_Clock_Ticks;
-----------------------------
-- Binary_Semaphore_Create --
-----------------------------
function Binary_Semaphore_Create return Binary_Semaphore_Id is
begin
return Binary_Semaphore_Id (semBCreate (SEM_Q_FIFO, SEM_EMPTY));
end Binary_Semaphore_Create;
-----------------------------
-- Binary_Semaphore_Delete --
-----------------------------
function Binary_Semaphore_Delete (ID : Binary_Semaphore_Id) return int is
begin
return semDelete (SEM_ID (ID));
end Binary_Semaphore_Delete;
-----------------------------
-- Binary_Semaphore_Obtain --
-----------------------------
function Binary_Semaphore_Obtain (ID : Binary_Semaphore_Id) return int is
begin
return semTake (SEM_ID (ID), WAIT_FOREVER);
end Binary_Semaphore_Obtain;
------------------------------
-- Binary_Semaphore_Release --
------------------------------
function Binary_Semaphore_Release (ID : Binary_Semaphore_Id) return int is
begin
return semGive (SEM_ID (ID));
end Binary_Semaphore_Release;
----------------------------
-- Binary_Semaphore_Flush --
----------------------------
function Binary_Semaphore_Flush (ID : Binary_Semaphore_Id) return int is
begin
return semFlush (SEM_ID (ID));
end Binary_Semaphore_Flush;
----------
-- kill --
----------
function kill (pid : t_id; sig : Signal) return int is
begin
return System.VxWorks.Ext.kill (pid, int (sig));
end kill;
-----------------------
-- Interrupt_Connect --
-----------------------
function Interrupt_Connect
(Vector : Interrupt_Vector;
Handler : Interrupt_Handler;
Parameter : System.Address := System.Null_Address) return int is
begin
return
System.VxWorks.Ext.Interrupt_Connect
(System.VxWorks.Ext.Interrupt_Vector (Vector),
System.VxWorks.Ext.Interrupt_Handler (Handler),
Parameter);
end Interrupt_Connect;
-----------------------
-- Interrupt_Context --
-----------------------
function Interrupt_Context return int is
begin
return System.VxWorks.Ext.Interrupt_Context;
end Interrupt_Context;
--------------------------------
-- Interrupt_Number_To_Vector --
--------------------------------
function Interrupt_Number_To_Vector
(intNum : int) return Interrupt_Vector
is
begin
return Interrupt_Vector
(System.VxWorks.Ext.Interrupt_Number_To_Vector (intNum));
end Interrupt_Number_To_Vector;
-----------------
-- Current_CPU --
-----------------
function Current_CPU return Multiprocessors.CPU is
begin
-- ??? Should use vxworks multiprocessor interface
return Multiprocessors.CPU'First;
end Current_CPU;
end System.OS_Interface;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . V A L _ L L U --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2006, 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 System.Unsigned_Types; use System.Unsigned_Types;
with System.Val_Util; use System.Val_Util;
package body System.Val_LLU is
---------------------------------
-- Scan_Raw_Long_Long_Unsigned --
---------------------------------
function Scan_Raw_Long_Long_Unsigned
(Str : String;
Ptr : access Integer;
Max : Integer) return Long_Long_Unsigned
is
P : Integer;
-- Local copy of the pointer
Uval : Long_Long_Unsigned;
-- Accumulated unsigned integer result
Expon : Integer;
-- Exponent value
Overflow : Boolean := False;
-- Set True if overflow is detected at any point
Base_Char : Character;
-- Base character (# or :) in based case
Base : Long_Long_Unsigned := 10;
-- Base value (reset in based case)
Digit : Long_Long_Unsigned;
-- Digit value
begin
P := Ptr.all;
Uval := Character'Pos (Str (P)) - Character'Pos ('0');
P := P + 1;
-- Scan out digits of what is either the number or the base.
-- In either case, we are definitely scanning out in base 10.
declare
Umax : constant := (Long_Long_Unsigned'Last - 9) / 10;
-- Max value which cannot overflow on accumulating next digit
Umax10 : constant := Long_Long_Unsigned'Last / 10;
-- Numbers bigger than Umax10 overflow if multiplied by 10
begin
-- Loop through decimal digits
loop
exit when P > Max;
Digit := Character'Pos (Str (P)) - Character'Pos ('0');
-- Non-digit encountered
if Digit > 9 then
if Str (P) = '_' then
Scan_Underscore (Str, P, Ptr, Max, False);
else
exit;
end if;
-- Accumulate result, checking for overflow
else
if Uval <= Umax then
Uval := 10 * Uval + Digit;
elsif Uval > Umax10 then
Overflow := True;
else
Uval := 10 * Uval + Digit;
if Uval < Umax10 then
Overflow := True;
end if;
end if;
P := P + 1;
end if;
end loop;
end;
Ptr.all := P;
-- Deal with based case
if P < Max and then (Str (P) = ':' or else Str (P) = '#') then
Base_Char := Str (P);
P := P + 1;
Base := Uval;
Uval := 0;
-- Check base value. Overflow is set True if we find a bad base, or
-- a digit that is out of range of the base. That way, we scan out
-- the numeral that is still syntactically correct, though illegal.
-- We use a safe base of 16 for this scan, to avoid zero divide.
if Base not in 2 .. 16 then
Overflow := True;
Base := 16;
end if;
-- Scan out based integer
declare
Umax : constant Long_Long_Unsigned :=
(Long_Long_Unsigned'Last - Base + 1) / Base;
-- Max value which cannot overflow on accumulating next digit
UmaxB : constant Long_Long_Unsigned :=
Long_Long_Unsigned'Last / Base;
-- Numbers bigger than UmaxB overflow if multiplied by base
begin
-- Loop to scan out based integer value
loop
-- We require a digit at this stage
if Str (P) in '0' .. '9' then
Digit := Character'Pos (Str (P)) - Character'Pos ('0');
elsif Str (P) in 'A' .. 'F' then
Digit :=
Character'Pos (Str (P)) - (Character'Pos ('A') - 10);
elsif Str (P) in 'a' .. 'f' then
Digit :=
Character'Pos (Str (P)) - (Character'Pos ('a') - 10);
-- If we don't have a digit, then this is not a based number
-- after all, so we use the value we scanned out as the base
-- (now in Base), and the pointer to the base character was
-- already stored in Ptr.all.
else
Uval := Base;
exit;
end if;
-- If digit is too large, just signal overflow and continue.
-- The idea here is to keep scanning as long as the input is
-- syntactically valid, even if we have detected overflow
if Digit >= Base then
Overflow := True;
-- Here we accumulate the value, checking overflow
elsif Uval <= Umax then
Uval := Base * Uval + Digit;
elsif Uval > UmaxB then
Overflow := True;
else
Uval := Base * Uval + Digit;
if Uval < UmaxB then
Overflow := True;
end if;
end if;
-- If at end of string with no base char, not a based number
-- but we signal Constraint_Error and set the pointer past
-- the end of the field, since this is what the ACVC tests
-- seem to require, see CE3704N, line 204.
P := P + 1;
if P > Max then
Ptr.all := P;
raise Constraint_Error;
end if;
-- If terminating base character, we are done with loop
if Str (P) = Base_Char then
Ptr.all := P + 1;
exit;
-- Deal with underscore
elsif Str (P) = '_' then
Scan_Underscore (Str, P, Ptr, Max, True);
end if;
end loop;
end;
end if;
-- Come here with scanned unsigned value in Uval. The only remaining
-- required step is to deal with exponent if one is present.
Expon := Scan_Exponent (Str, Ptr, Max);
if Expon /= 0 and then Uval /= 0 then
-- For non-zero value, scale by exponent value. No need to do this
-- efficiently, since use of exponent in integer literals is rare,
-- and in any case the exponent cannot be very large.
declare
UmaxB : constant Long_Long_Unsigned :=
Long_Long_Unsigned'Last / Base;
-- Numbers bigger than UmaxB overflow if multiplied by base
begin
for J in 1 .. Expon loop
if Uval > UmaxB then
Overflow := True;
exit;
end if;
Uval := Uval * Base;
end loop;
end;
end if;
-- Return result, dealing with sign and overflow
if Overflow then
raise Constraint_Error;
else
return Uval;
end if;
end Scan_Raw_Long_Long_Unsigned;
-----------------------------
-- Scan_Long_Long_Unsigned --
-----------------------------
function Scan_Long_Long_Unsigned
(Str : String;
Ptr : access Integer;
Max : Integer) return Long_Long_Unsigned
is
Start : Positive;
-- Save location of first non-blank character
begin
Scan_Plus_Sign (Str, Ptr, Max, Start);
if Str (Ptr.all) not in '0' .. '9' then
Ptr.all := Start;
raise Constraint_Error;
end if;
return Scan_Raw_Long_Long_Unsigned (Str, Ptr, Max);
end Scan_Long_Long_Unsigned;
------------------------------
-- Value_Long_Long_Unsigned --
------------------------------
function Value_Long_Long_Unsigned
(Str : String) return Long_Long_Unsigned
is
V : Long_Long_Unsigned;
P : aliased Integer := Str'First;
begin
V := Scan_Long_Long_Unsigned (Str, P'Access, Str'Last);
Scan_Trailing_Blanks (Str, P);
return V;
end Value_Long_Long_Unsigned;
end System.Val_LLU;
|
-------------------------------------------------------------------------------
-- Copyright 2021, The Trendy Terminal Developers (see AUTHORS file)
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
-- http://www.apache.org/licenses/LICENSE-2.0
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-------------------------------------------------------------------------------
with Ada.Strings.Unbounded;
-- Trendy Terminal defines a known environment in which to perform input/output.
-- Failure to meet these requirements results in an failed initialization.
--
-- The requirements:
-- 1. UTF-8
-- 2. VT100 terminal escape sequences.
--
-- The base package provides platform-specific environment setup, and the basic
-- read/write commands on top of which to build functionality.
package Trendy_Terminal.Platform is
package ASU renames Ada.Strings.Unbounded;
-- Initializes and captures the original settings for the terminal so they can
-- be restored when the system is shutdown.
function Init return Boolean;
-- Restores the system to the conditions prior to calling `Init`.
procedure Shutdown;
type Input_Setting is (Echo, Line_Input, Signals_As_Input);
type Output_Setting is (Escape_Sequences);
procedure Set (Setting : Input_Setting; Enabled : Boolean);
procedure Set (Setting : Output_Setting; Enabled : Boolean);
-- These are platform-specific terminal read/write functions to avoid
-- messing with Ada standard library internals such as current column.
-- This avoids spurious formatting and other implementation quirks of
-- those libraries.
procedure Put (C : Character);
procedure Put (S : String);
function Get_Input return String;
function End_Of_Line return String;
procedure Print_Configuration;
end Trendy_Terminal.Platform;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . S T R I N G S . M A P S --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Ada.Characters.Latin_1;
package Ada.Strings.Maps is
pragma Pure;
-- In accordance with Ada 2005 AI-362
--------------------------------
-- Character Set Declarations --
--------------------------------
type Character_Set is private;
pragma Preelaborable_Initialization (Character_Set);
-- Representation for a set of character values:
Null_Set : constant Character_Set;
---------------------------
-- Constructors for Sets --
---------------------------
type Character_Range is record
Low : Character;
High : Character;
end record;
-- Represents Character range Low .. High
type Character_Ranges is array (Positive range <>) of Character_Range;
function To_Set (Ranges : Character_Ranges) return Character_Set;
function To_Set (Span : Character_Range) return Character_Set;
function To_Ranges (Set : Character_Set) return Character_Ranges;
----------------------------------
-- Operations on Character Sets --
----------------------------------
function "=" (Left, Right : Character_Set) return Boolean;
function "not" (Right : Character_Set) return Character_Set;
function "and" (Left, Right : Character_Set) return Character_Set;
function "or" (Left, Right : Character_Set) return Character_Set;
function "xor" (Left, Right : Character_Set) return Character_Set;
function "-" (Left, Right : Character_Set) return Character_Set;
function Is_In
(Element : Character;
Set : Character_Set) return Boolean;
function Is_Subset
(Elements : Character_Set;
Set : Character_Set) return Boolean;
function "<="
(Left : Character_Set;
Right : Character_Set) return Boolean
renames Is_Subset;
subtype Character_Sequence is String;
-- Alternative representation for a set of character values
function To_Set (Sequence : Character_Sequence) return Character_Set;
function To_Set (Singleton : Character) return Character_Set;
function To_Sequence (Set : Character_Set) return Character_Sequence;
------------------------------------
-- Character Mapping Declarations --
------------------------------------
type Character_Mapping is private;
pragma Preelaborable_Initialization (Character_Mapping);
-- Representation for a character to character mapping:
function Value
(Map : Character_Mapping;
Element : Character) return Character;
Identity : constant Character_Mapping;
----------------------------
-- Operations on Mappings --
----------------------------
function To_Mapping
(From, To : Character_Sequence) return Character_Mapping;
function To_Domain
(Map : Character_Mapping) return Character_Sequence;
function To_Range
(Map : Character_Mapping) return Character_Sequence;
type Character_Mapping_Function is
access function (From : Character) return Character;
private
pragma Inline (Is_In);
pragma Inline (Value);
type Character_Set_Internal is array (Character) of Boolean;
pragma Pack (Character_Set_Internal);
type Character_Set is new Character_Set_Internal;
-- Note: the reason for this level of derivation is to make sure
-- that the predefined logical operations on this type remain
-- accessible. The operations on Character_Set are overridden by
-- the defined operations in the spec, but the operations defined
-- on Character_Set_Internal remain visible.
Null_Set : constant Character_Set := (others => False);
type Character_Mapping is array (Character) of Character;
package L renames Ada.Characters.Latin_1;
Identity : constant Character_Mapping :=
(L.NUL & -- NUL 0
L.SOH & -- SOH 1
L.STX & -- STX 2
L.ETX & -- ETX 3
L.EOT & -- EOT 4
L.ENQ & -- ENQ 5
L.ACK & -- ACK 6
L.BEL & -- BEL 7
L.BS & -- BS 8
L.HT & -- HT 9
L.LF & -- LF 10
L.VT & -- VT 11
L.FF & -- FF 12
L.CR & -- CR 13
L.SO & -- SO 14
L.SI & -- SI 15
L.DLE & -- DLE 16
L.DC1 & -- DC1 17
L.DC2 & -- DC2 18
L.DC3 & -- DC3 19
L.DC4 & -- DC4 20
L.NAK & -- NAK 21
L.SYN & -- SYN 22
L.ETB & -- ETB 23
L.CAN & -- CAN 24
L.EM & -- EM 25
L.SUB & -- SUB 26
L.ESC & -- ESC 27
L.FS & -- FS 28
L.GS & -- GS 29
L.RS & -- RS 30
L.US & -- US 31
L.Space & -- ' ' 32
L.Exclamation & -- '!' 33
L.Quotation & -- '"' 34
L.Number_Sign & -- '#' 35
L.Dollar_Sign & -- '$' 36
L.Percent_Sign & -- '%' 37
L.Ampersand & -- '&' 38
L.Apostrophe & -- ''' 39
L.Left_Parenthesis & -- '(' 40
L.Right_Parenthesis & -- ')' 41
L.Asterisk & -- '*' 42
L.Plus_Sign & -- '+' 43
L.Comma & -- ',' 44
L.Hyphen & -- '-' 45
L.Full_Stop & -- '.' 46
L.Solidus & -- '/' 47
'0' & -- '0' 48
'1' & -- '1' 49
'2' & -- '2' 50
'3' & -- '3' 51
'4' & -- '4' 52
'5' & -- '5' 53
'6' & -- '6' 54
'7' & -- '7' 55
'8' & -- '8' 56
'9' & -- '9' 57
L.Colon & -- ':' 58
L.Semicolon & -- ';' 59
L.Less_Than_Sign & -- '<' 60
L.Equals_Sign & -- '=' 61
L.Greater_Than_Sign & -- '>' 62
L.Question & -- '?' 63
L.Commercial_At & -- '@' 64
'A' & -- 'A' 65
'B' & -- 'B' 66
'C' & -- 'C' 67
'D' & -- 'D' 68
'E' & -- 'E' 69
'F' & -- 'F' 70
'G' & -- 'G' 71
'H' & -- 'H' 72
'I' & -- 'I' 73
'J' & -- 'J' 74
'K' & -- 'K' 75
'L' & -- 'L' 76
'M' & -- 'M' 77
'N' & -- 'N' 78
'O' & -- 'O' 79
'P' & -- 'P' 80
'Q' & -- 'Q' 81
'R' & -- 'R' 82
'S' & -- 'S' 83
'T' & -- 'T' 84
'U' & -- 'U' 85
'V' & -- 'V' 86
'W' & -- 'W' 87
'X' & -- 'X' 88
'Y' & -- 'Y' 89
'Z' & -- 'Z' 90
L.Left_Square_Bracket & -- '[' 91
L.Reverse_Solidus & -- '\' 92
L.Right_Square_Bracket & -- ']' 93
L.Circumflex & -- '^' 94
L.Low_Line & -- '_' 95
L.Grave & -- '`' 96
L.LC_A & -- 'a' 97
L.LC_B & -- 'b' 98
L.LC_C & -- 'c' 99
L.LC_D & -- 'd' 100
L.LC_E & -- 'e' 101
L.LC_F & -- 'f' 102
L.LC_G & -- 'g' 103
L.LC_H & -- 'h' 104
L.LC_I & -- 'i' 105
L.LC_J & -- 'j' 106
L.LC_K & -- 'k' 107
L.LC_L & -- 'l' 108
L.LC_M & -- 'm' 109
L.LC_N & -- 'n' 110
L.LC_O & -- 'o' 111
L.LC_P & -- 'p' 112
L.LC_Q & -- 'q' 113
L.LC_R & -- 'r' 114
L.LC_S & -- 's' 115
L.LC_T & -- 't' 116
L.LC_U & -- 'u' 117
L.LC_V & -- 'v' 118
L.LC_W & -- 'w' 119
L.LC_X & -- 'x' 120
L.LC_Y & -- 'y' 121
L.LC_Z & -- 'z' 122
L.Left_Curly_Bracket & -- '{' 123
L.Vertical_Line & -- '|' 124
L.Right_Curly_Bracket & -- '}' 125
L.Tilde & -- '~' 126
L.DEL & -- DEL 127
L.Reserved_128 & -- Reserved_128 128
L.Reserved_129 & -- Reserved_129 129
L.BPH & -- BPH 130
L.NBH & -- NBH 131
L.Reserved_132 & -- Reserved_132 132
L.NEL & -- NEL 133
L.SSA & -- SSA 134
L.ESA & -- ESA 135
L.HTS & -- HTS 136
L.HTJ & -- HTJ 137
L.VTS & -- VTS 138
L.PLD & -- PLD 139
L.PLU & -- PLU 140
L.RI & -- RI 141
L.SS2 & -- SS2 142
L.SS3 & -- SS3 143
L.DCS & -- DCS 144
L.PU1 & -- PU1 145
L.PU2 & -- PU2 146
L.STS & -- STS 147
L.CCH & -- CCH 148
L.MW & -- MW 149
L.SPA & -- SPA 150
L.EPA & -- EPA 151
L.SOS & -- SOS 152
L.Reserved_153 & -- Reserved_153 153
L.SCI & -- SCI 154
L.CSI & -- CSI 155
L.ST & -- ST 156
L.OSC & -- OSC 157
L.PM & -- PM 158
L.APC & -- APC 159
L.No_Break_Space & -- No_Break_Space 160
L.Inverted_Exclamation & -- Inverted_Exclamation 161
L.Cent_Sign & -- Cent_Sign 162
L.Pound_Sign & -- Pound_Sign 163
L.Currency_Sign & -- Currency_Sign 164
L.Yen_Sign & -- Yen_Sign 165
L.Broken_Bar & -- Broken_Bar 166
L.Section_Sign & -- Section_Sign 167
L.Diaeresis & -- Diaeresis 168
L.Copyright_Sign & -- Copyright_Sign 169
L.Feminine_Ordinal_Indicator & -- Feminine_Ordinal_Indicator 170
L.Left_Angle_Quotation & -- Left_Angle_Quotation 171
L.Not_Sign & -- Not_Sign 172
L.Soft_Hyphen & -- Soft_Hyphen 173
L.Registered_Trade_Mark_Sign & -- Registered_Trade_Mark_Sign 174
L.Macron & -- Macron 175
L.Degree_Sign & -- Degree_Sign 176
L.Plus_Minus_Sign & -- Plus_Minus_Sign 177
L.Superscript_Two & -- Superscript_Two 178
L.Superscript_Three & -- Superscript_Three 179
L.Acute & -- Acute 180
L.Micro_Sign & -- Micro_Sign 181
L.Pilcrow_Sign & -- Pilcrow_Sign 182
L.Middle_Dot & -- Middle_Dot 183
L.Cedilla & -- Cedilla 184
L.Superscript_One & -- Superscript_One 185
L.Masculine_Ordinal_Indicator & -- Masculine_Ordinal_Indicator 186
L.Right_Angle_Quotation & -- Right_Angle_Quotation 187
L.Fraction_One_Quarter & -- Fraction_One_Quarter 188
L.Fraction_One_Half & -- Fraction_One_Half 189
L.Fraction_Three_Quarters & -- Fraction_Three_Quarters 190
L.Inverted_Question & -- Inverted_Question 191
L.UC_A_Grave & -- UC_A_Grave 192
L.UC_A_Acute & -- UC_A_Acute 193
L.UC_A_Circumflex & -- UC_A_Circumflex 194
L.UC_A_Tilde & -- UC_A_Tilde 195
L.UC_A_Diaeresis & -- UC_A_Diaeresis 196
L.UC_A_Ring & -- UC_A_Ring 197
L.UC_AE_Diphthong & -- UC_AE_Diphthong 198
L.UC_C_Cedilla & -- UC_C_Cedilla 199
L.UC_E_Grave & -- UC_E_Grave 200
L.UC_E_Acute & -- UC_E_Acute 201
L.UC_E_Circumflex & -- UC_E_Circumflex 202
L.UC_E_Diaeresis & -- UC_E_Diaeresis 203
L.UC_I_Grave & -- UC_I_Grave 204
L.UC_I_Acute & -- UC_I_Acute 205
L.UC_I_Circumflex & -- UC_I_Circumflex 206
L.UC_I_Diaeresis & -- UC_I_Diaeresis 207
L.UC_Icelandic_Eth & -- UC_Icelandic_Eth 208
L.UC_N_Tilde & -- UC_N_Tilde 209
L.UC_O_Grave & -- UC_O_Grave 210
L.UC_O_Acute & -- UC_O_Acute 211
L.UC_O_Circumflex & -- UC_O_Circumflex 212
L.UC_O_Tilde & -- UC_O_Tilde 213
L.UC_O_Diaeresis & -- UC_O_Diaeresis 214
L.Multiplication_Sign & -- Multiplication_Sign 215
L.UC_O_Oblique_Stroke & -- UC_O_Oblique_Stroke 216
L.UC_U_Grave & -- UC_U_Grave 217
L.UC_U_Acute & -- UC_U_Acute 218
L.UC_U_Circumflex & -- UC_U_Circumflex 219
L.UC_U_Diaeresis & -- UC_U_Diaeresis 220
L.UC_Y_Acute & -- UC_Y_Acute 221
L.UC_Icelandic_Thorn & -- UC_Icelandic_Thorn 222
L.LC_German_Sharp_S & -- LC_German_Sharp_S 223
L.LC_A_Grave & -- LC_A_Grave 224
L.LC_A_Acute & -- LC_A_Acute 225
L.LC_A_Circumflex & -- LC_A_Circumflex 226
L.LC_A_Tilde & -- LC_A_Tilde 227
L.LC_A_Diaeresis & -- LC_A_Diaeresis 228
L.LC_A_Ring & -- LC_A_Ring 229
L.LC_AE_Diphthong & -- LC_AE_Diphthong 230
L.LC_C_Cedilla & -- LC_C_Cedilla 231
L.LC_E_Grave & -- LC_E_Grave 232
L.LC_E_Acute & -- LC_E_Acute 233
L.LC_E_Circumflex & -- LC_E_Circumflex 234
L.LC_E_Diaeresis & -- LC_E_Diaeresis 235
L.LC_I_Grave & -- LC_I_Grave 236
L.LC_I_Acute & -- LC_I_Acute 237
L.LC_I_Circumflex & -- LC_I_Circumflex 238
L.LC_I_Diaeresis & -- LC_I_Diaeresis 239
L.LC_Icelandic_Eth & -- LC_Icelandic_Eth 240
L.LC_N_Tilde & -- LC_N_Tilde 241
L.LC_O_Grave & -- LC_O_Grave 242
L.LC_O_Acute & -- LC_O_Acute 243
L.LC_O_Circumflex & -- LC_O_Circumflex 244
L.LC_O_Tilde & -- LC_O_Tilde 245
L.LC_O_Diaeresis & -- LC_O_Diaeresis 246
L.Division_Sign & -- Division_Sign 247
L.LC_O_Oblique_Stroke & -- LC_O_Oblique_Stroke 248
L.LC_U_Grave & -- LC_U_Grave 249
L.LC_U_Acute & -- LC_U_Acute 250
L.LC_U_Circumflex & -- LC_U_Circumflex 251
L.LC_U_Diaeresis & -- LC_U_Diaeresis 252
L.LC_Y_Acute & -- LC_Y_Acute 253
L.LC_Icelandic_Thorn & -- LC_Icelandic_Thorn 254
L.LC_Y_Diaeresis); -- LC_Y_Diaeresis 255
end Ada.Strings.Maps;
|
-- Copyright 2017-2021 Bartek thindil Jasicki
--
-- This file is part of Steam Sky.
--
-- Steam Sky 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.
--
-- Steam Sky 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 Steam Sky. If not, see <http://www.gnu.org/licenses/>.
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with Ada.Containers.Vectors; use Ada.Containers;
with DOM.Readers; use DOM.Readers;
-- ****h* Goals/Goals
-- FUNCTION
-- Provide code for manipulate goals
-- SOURCE
package Goals is
-- ****
-- ****t* Goals/Goals.GoalTypes
-- FUNCTION
-- Types of goals
-- SOURCE
type GoalTypes is
(RANDOM, REPUTATION, DESTROY, DISCOVER, VISIT, CRAFT, MISSION, KILL) with
Default_Value => RANDOM;
-- ****
-- ****s* Goals/Goals.Goal_Data
-- FUNCTION
-- Data structure for each goal
-- PARAMETERS
-- Index - Index of goal
-- GType - Type of goal
-- Amount - Amount of targets needed for finish goal
-- TargetIndex - Index of target needed for finish goal. If empty, mean all targets selected type (bases, ships, etc)
-- Multiplier - Multiplier for points awarded for finish this goal
-- SOURCE
type Goal_Data is record
Index: Unbounded_String;
GType: GoalTypes;
Amount: Natural;
TargetIndex: Unbounded_String;
Multiplier: Positive;
end record;
-- ****
-- ****t* Goals/Goals.Goals_Container
-- FUNCTION
-- Used to store goals data
-- SOURCE
package Goals_Container is new Vectors(Positive, Goal_Data);
-- ****
-- ****v* Goals/Goals.Goals_List
-- FUNCTION
-- List of player goals available in game
-- SOURCE
Goals_List: Goals_Container.Vector;
-- ****
-- ****v* Goals/Goals.CurrentGoal
-- FUNCTION
-- Player current goal
-- SOURCE
CurrentGoal: Goal_Data;
-- ****
-- ****f* Goals/Goals.LoadGoals
-- FUNCTION
-- Load player goals from files
-- FUNCTION
-- Reader - XML Reader from which goals data will be read
-- SOURCE
procedure LoadGoals(Reader: Tree_Reader);
-- ****
-- ****f* Goals/Goals.GoalText
-- FUNCTION
-- Get info about selected goal
-- PARAMETERS
-- Index - Index of goal from which we take info. If 0 then get info for
-- current goal
-- RESULT
-- Info about selected goal
-- SOURCE
function GoalText(Index: Goals_Container.Extended_Index) return String with
Pre => Index <= Goals_List.Last_Index,
Post => GoalText'Result'Length > 0,
Test_Case => (Name => "Test_GoalText", Mode => Nominal);
-- ****
-- ****f* Goals/Goals.ClearCurrentGoal
-- FUNCTION
-- Reset current goal
-- SOURCE
procedure ClearCurrentGoal with
Post => CurrentGoal.Index = Null_Unbounded_String,
Test_Case => (Name => "Test_ClearCurrentGoal", Mode => Nominal);
-- ****
-- ****f* Goals/Goals.UpdateGoal
-- FUNCTION
-- Update current goal
-- PARAMETERS
-- GType - Type of goal to check
-- TargetIndex - Index of target to check
-- Amount - Amount for goal to modify if both checks are valid
-- SOURCE
procedure UpdateGoal
(GType: GoalTypes; TargetIndex: Unbounded_String;
Amount: Positive := 1) with
Test_Case => (Name => "Test_UpdateGoal", Mode => Robustness);
-- ****
end Goals;
|
with GESTE;
with GESTE_Config;
package Render is
procedure Push_Pixels (Buffer : GESTE.Output_Buffer);
procedure Set_Drawing_Area (Area : GESTE.Pix_Rect);
procedure Set_Screen_Offset (Pt : GESTE.Pix_Point);
procedure Render_All (Background : GESTE_Config.Output_Color);
procedure Render_Dirty (Background : GESTE_Config.Output_Color);
function Dark_Cyan return GESTE_Config.Output_Color;
function Black return GESTE_Config.Output_Color;
end Render;
|
package body Count_Subprogram is
procedure P2A (x, y : Integer) is null;
procedure P2B (x : Integer; y : Integer) is null;
procedure P4A (k, l, m, n : Integer) is null;
procedure P4B (k : Integer; l : Integer; m : Integer; n : Integer) is null;
procedure P3A (x, y, z : Integer) is null;
procedure P3B (x, y : Integer; z : Integer) is null;
procedure P3C (x : Integer; y, z : Integer) is null;
procedure P3D (x : Integer; y : Integer; z : Integer) is null;
procedure P3G
(x : Integer := 0; y : Integer := 1; z : Integer := 2) is null;
procedure P3H (x, y, z : Integer := 0) is null;
-- STYLE_CHECK
-- gnatyI: 'check mode IN keywords.'
-- Mode in (the default mode) is not allowed to be given explicitly.
-- in out is fine, but not in on its own.
pragma Style_Checks (Off);
procedure P3I (x, y, z : in Integer) is null;
pragma Style_Checks (On);
procedure P3J (x, y, z : in out Integer) is null;
procedure P3K (x, y, z : out Integer) is null;
-- Formal parameter is not referenced
-- 1. pragma Unreferenced (x, y, z); can't be placed in the right scope
-- 2. aspect is only associated with last parameter
-- see https://gt3-prod-1.adacore.com/#/tickets/V401-014
pragma Extensions_Allowed (On);
procedure P3N (x : Element_T with Unreferenced;
y : Element_T with Unreferenced;
z : Element_T with Unreferenced)
is null;
pragma Extensions_Allowed (Off);
-- Formal parameter is not referenced
-- pragma Unreferenced (x, y, z); can't be placed in the right scope
pragma Extensions_Allowed (On);
procedure P3O (x : Element_T with Unreferenced;
y : Element_T with Unreferenced;
z : Element_T with Unreferenced)
is null;
pragma Extensions_Allowed (Off);
procedure S1 (Call_Back : access procedure (x, y, z : Integer)) is null;
procedure S2
(Call_Back : access procedure
(x : Integer; y : Integer; z : Integer)) is null;
function F3C (x, y, z : Integer) return Integer is (x + y + z);
function F3D (x : Integer; y : Integer; z : Integer) return Integer is
(x + y + z);
end Count_Subprogram;
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2017-2018, Fabien Chouteau --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
private package AGATE.SysCalls is
type Syscall_ID is (Yield, Clock, Delay_Until, Sem_Signal, Sem_Wait,
Shutdown, Mutex_Wait_Lock, Mutex_Try_Lock,
Mutex_Release, Print);
function Call (ID : Syscall_ID;
Arg1, Arg2, Arg3 : Word := 0)
return UInt64;
procedure Call (ID : Syscall_ID;
Arg1, Arg2, Arg3 : Word := 0);
type Syscall_Handler is access
function (Arg1, Arg2, Arg3 : Word) return UInt64;
function Registred (ID : Syscall_ID) return Boolean;
-- Return True if a handler is registered for the given syscall
procedure Register (ID : Syscall_ID;
Handler : not null Syscall_Handler)
with Pre => not Registred (ID);
-- Register a handler for the given syscall
end AGATE.SysCalls;
|
pragma Ada_2005;
pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
with SDL_SDL_stdinc_h;
with System;
with Interfaces.C.Strings;
limited with SDL_SDL_rwops_h;
package SDL_SDL_audio_h is
AUDIO_U8 : constant := 16#0008#; -- ../include/SDL/SDL_audio.h:100
AUDIO_S8 : constant := 16#8008#; -- ../include/SDL/SDL_audio.h:101
AUDIO_U16LSB : constant := 16#0010#; -- ../include/SDL/SDL_audio.h:102
AUDIO_S16LSB : constant := 16#8010#; -- ../include/SDL/SDL_audio.h:103
AUDIO_U16MSB : constant := 16#1010#; -- ../include/SDL/SDL_audio.h:104
AUDIO_S16MSB : constant := 16#9010#; -- ../include/SDL/SDL_audio.h:105
-- unsupported macro: AUDIO_U16 AUDIO_U16LSB
-- unsupported macro: AUDIO_S16 AUDIO_S16LSB
-- unsupported macro: AUDIO_U16SYS AUDIO_U16LSB
-- unsupported macro: AUDIO_S16SYS AUDIO_S16LSB
-- arg-macro: procedure SDL_LoadWAV (file, spec, audSDL_LoadWAV_RW(SDL_RWFromFile(file, "rb"),1, spec,audio_buf,audio_len)
-- SDL_LoadWAV_RW(SDL_RWFromFile(file, "rb"),1, spec,audio_buf,audio_len)
SDL_MIX_MAXVOLUME : constant := 128; -- ../include/SDL/SDL_audio.h:250
type SDL_AudioSpec is record
freq : aliased int; -- ../include/SDL/SDL_audio.h:75
format : aliased SDL_SDL_stdinc_h.Uint16; -- ../include/SDL/SDL_audio.h:76
channels : aliased SDL_SDL_stdinc_h.Uint8; -- ../include/SDL/SDL_audio.h:77
silence : aliased SDL_SDL_stdinc_h.Uint8; -- ../include/SDL/SDL_audio.h:78
samples : aliased SDL_SDL_stdinc_h.Uint16; -- ../include/SDL/SDL_audio.h:79
padding : aliased SDL_SDL_stdinc_h.Uint16; -- ../include/SDL/SDL_audio.h:80
size : aliased SDL_SDL_stdinc_h.Uint32; -- ../include/SDL/SDL_audio.h:81
callback : access procedure
(arg1 : System.Address;
arg2 : access SDL_SDL_stdinc_h.Uint8;
arg3 : int); -- ../include/SDL/SDL_audio.h:91
userdata : System.Address; -- ../include/SDL/SDL_audio.h:92
end record;
pragma Convention (C_Pass_By_Copy, SDL_AudioSpec); -- ../include/SDL/SDL_audio.h:74
type SDL_AudioCVT_filters_array is array (0 .. 9) of access procedure (arg1 : System.Address; arg2 : SDL_SDL_stdinc_h.Uint16);
type SDL_AudioCVT is record
needed : aliased int; -- ../include/SDL/SDL_audio.h:127
src_format : aliased SDL_SDL_stdinc_h.Uint16; -- ../include/SDL/SDL_audio.h:128
dst_format : aliased SDL_SDL_stdinc_h.Uint16; -- ../include/SDL/SDL_audio.h:129
rate_incr : aliased double; -- ../include/SDL/SDL_audio.h:130
buf : access SDL_SDL_stdinc_h.Uint8; -- ../include/SDL/SDL_audio.h:131
len : aliased int; -- ../include/SDL/SDL_audio.h:132
len_cvt : aliased int; -- ../include/SDL/SDL_audio.h:133
len_mult : aliased int; -- ../include/SDL/SDL_audio.h:134
len_ratio : aliased double; -- ../include/SDL/SDL_audio.h:135
filters : aliased SDL_AudioCVT_filters_array; -- ../include/SDL/SDL_audio.h:136
filter_index : aliased int; -- ../include/SDL/SDL_audio.h:137
end record;
pragma Convention (C_Pass_By_Copy, SDL_AudioCVT); -- ../include/SDL/SDL_audio.h:126
function SDL_AudioInit (driver_name : Interfaces.C.Strings.chars_ptr) return int; -- ../include/SDL/SDL_audio.h:150
pragma Import (C, SDL_AudioInit, "SDL_AudioInit");
procedure SDL_AudioQuit; -- ../include/SDL/SDL_audio.h:151
pragma Import (C, SDL_AudioQuit, "SDL_AudioQuit");
function SDL_AudioDriverName (namebuf : Interfaces.C.Strings.chars_ptr; maxlen : int) return Interfaces.C.Strings.chars_ptr; -- ../include/SDL/SDL_audio.h:159
pragma Import (C, SDL_AudioDriverName, "SDL_AudioDriverName");
function SDL_OpenAudio (desired : access SDL_AudioSpec; obtained : access SDL_AudioSpec) return int; -- ../include/SDL/SDL_audio.h:178
pragma Import (C, SDL_OpenAudio, "SDL_OpenAudio");
type SDL_audiostatus is
(SDL_AUDIO_STOPPED,
SDL_AUDIO_PLAYING,
SDL_AUDIO_PAUSED);
pragma Convention (C, SDL_audiostatus); -- ../include/SDL/SDL_audio.h:184
function SDL_GetAudioStatus return SDL_audiostatus; -- ../include/SDL/SDL_audio.h:187
pragma Import (C, SDL_GetAudioStatus, "SDL_GetAudioStatus");
procedure SDL_PauseAudio (pause_on : int); -- ../include/SDL/SDL_audio.h:196
pragma Import (C, SDL_PauseAudio, "SDL_PauseAudio");
function SDL_LoadWAV_RW
(src : access SDL_SDL_rwops_h.SDL_RWops;
freesrc : int;
spec : access SDL_AudioSpec;
audio_buf : System.Address;
audio_len : access SDL_SDL_stdinc_h.Uint32) return access SDL_AudioSpec; -- ../include/SDL/SDL_audio.h:215
pragma Import (C, SDL_LoadWAV_RW, "SDL_LoadWAV_RW");
procedure SDL_FreeWAV (audio_buf : access SDL_SDL_stdinc_h.Uint8); -- ../include/SDL/SDL_audio.h:224
pragma Import (C, SDL_FreeWAV, "SDL_FreeWAV");
function SDL_BuildAudioCVT
(cvt : access SDL_AudioCVT;
src_format : SDL_SDL_stdinc_h.Uint16;
src_channels : SDL_SDL_stdinc_h.Uint8;
src_rate : int;
dst_format : SDL_SDL_stdinc_h.Uint16;
dst_channels : SDL_SDL_stdinc_h.Uint8;
dst_rate : int) return int; -- ../include/SDL/SDL_audio.h:234
pragma Import (C, SDL_BuildAudioCVT, "SDL_BuildAudioCVT");
function SDL_ConvertAudio (cvt : access SDL_AudioCVT) return int; -- ../include/SDL/SDL_audio.h:247
pragma Import (C, SDL_ConvertAudio, "SDL_ConvertAudio");
procedure SDL_MixAudio
(dst : access SDL_SDL_stdinc_h.Uint8;
src : access SDL_SDL_stdinc_h.Uint8;
len : SDL_SDL_stdinc_h.Uint32;
volume : int); -- ../include/SDL/SDL_audio.h:258
pragma Import (C, SDL_MixAudio, "SDL_MixAudio");
procedure SDL_LockAudio; -- ../include/SDL/SDL_audio.h:268
pragma Import (C, SDL_LockAudio, "SDL_LockAudio");
procedure SDL_UnlockAudio; -- ../include/SDL/SDL_audio.h:269
pragma Import (C, SDL_UnlockAudio, "SDL_UnlockAudio");
procedure SDL_CloseAudio; -- ../include/SDL/SDL_audio.h:275
pragma Import (C, SDL_CloseAudio, "SDL_CloseAudio");
end SDL_SDL_audio_h;
|
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Numerics.Discrete_Random;
procedure Test_Loop_Break is
type Value_Type is range 0..19;
package Random_Values is new Ada.Numerics.Discrete_Random (Value_Type);
use Random_Values;
Dice : Generator;
A, B : Value_Type;
begin
loop
A := Random (Dice);
Put_Line (Value_Type'Image (A));
exit when A = 10;
B := Random (Dice);
Put_Line (Value_Type'Image (B));
end loop;
end Test_Loop_Break;
|
with Actors, Engines, Libtcod.Color; use Libtcod;
package body Components.Destructibles is
-------------
-- is_dead --
-------------
function is_dead(self : Destructible) return Boolean is (self.hp = 0);
-----------------
-- take_damage --
-----------------
function take_damage(self : in out Destructible'Class; owner : in out Actors.Actor;
damage : Health; engine : in out Engines.Engine) return Health is
real_damage : Health;
begin
if Health(self.defense_stat) > damage then
real_damage := 0;
else
real_damage := damage - Health(self.defense_stat);
if real_damage >= self.hp then
self.hp := 0;
self.die(owner, engine);
else
self.hp := self.hp - real_damage;
end if;
end if;
return real_damage;
end take_damage;
---------
-- die --
---------
procedure die(self : in out Destructible; owner : in out Actors.Actor;
engine : in out Engines.Engine) is
begin
owner.ch := '%';
owner.color := Color.dark_red;
owner.blocks := False;
end die;
---------
-- die --
---------
overriding
procedure die(self : in out Monster_Destructible; owner : in out Actors.Actor;
engine : in out Engines.Engine) is
begin
engine.gui.log(owner.get_name & " is dead");
die(Destructible(self), owner, engine);
end die;
---------
-- die --
---------
overriding
procedure die(self : in out Player_Destructible; owner : in out Actors.Actor;
engine : in out Engines.Engine) is
begin
engine.gui.log("You died", Color.red);
die(Destructible(self), owner, engine);
engine.status := Engines.Status_Defeat;
end die;
end Components.Destructibles;
|
-- { dg-do compile }
-- { dg-options "-gnat2012" }
function Recursive_Call (File : String; Status : out Boolean) return Boolean is
begin
if File /= "/dev/null" then
return Recursive_Call ("/dev/null", Status);
end if;
return False;
end;
|
-- 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.
package body Items.Test_Data.Tests.Inventory_Container.Test_Data is
procedure Set_Up(Gnattest_T: in out Test) is
pragma Unreferenced(Gnattest_T);
begin
null;
end Set_Up;
procedure Tear_Down(Gnattest_T: in out Test) is
pragma Unreferenced(Gnattest_T);
begin
null;
end Tear_Down;
procedure User_Set_Up(Gnattest_T: in out New_Test) is
pragma Unreferenced(Gnattest_T);
begin
null;
end User_Set_Up;
procedure User_Tear_Down(Gnattest_T: in out New_Test) is
pragma Unreferenced(Gnattest_T);
begin
null;
end User_Tear_Down;
end Items.Test_Data.Tests.Inventory_Container.Test_Data;
|
-- Copyright (C) 2019 Thierry Rascle <thierr26@free.fr>
-- MIT license. Please refer to the LICENSE file.
with Ada.Unchecked_Deallocation;
package body Apsepp.Generic_Shared_Instance is
----------------------------------------------------------------------------
procedure Unl_CB is
begin
if Unlock_CB /= null then
Unlock_CB.all;
end if;
if Deallocation_Needed then
declare
procedure Free is new Ada.Unchecked_Deallocation
(Object => Instance_Ancestor_Type'Class,
Name => Instance_Type_Access);
begin
Deallocation_Needed := False;
Free (Instance_Access);
end;
else
Instance_Access := null;
end if;
end Unl_CB;
----------------------------------------------------------------------------
function Instance return Instance_Type_Access
is (Instance_Access);
----------------------------------------------------------------------------
function Locked return Boolean
is (Locked (Lock));
----------------------------------------------------------------------------
function Instantiated return Boolean
is (Instance_Access /= null);
----------------------------------------------------------------------------
end Apsepp.Generic_Shared_Instance;
|
-- This spec has been automatically generated from STM32L4x6.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.LCD is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype CR_DUTY_Field is HAL.UInt3;
subtype CR_BIAS_Field is HAL.UInt2;
-- control register
type CR_Register is record
-- LCD controller enable
LCDEN : Boolean := False;
-- Voltage source selection
VSEL : Boolean := False;
-- Duty selection
DUTY : CR_DUTY_Field := 16#0#;
-- Bias selector
BIAS : CR_BIAS_Field := 16#0#;
-- Mux segment enable
MUX_SEG : Boolean := False;
-- Voltage output buffer enable
BUFEN : Boolean := False;
-- unspecified
Reserved_9_31 : HAL.UInt23 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR_Register use record
LCDEN at 0 range 0 .. 0;
VSEL at 0 range 1 .. 1;
DUTY at 0 range 2 .. 4;
BIAS at 0 range 5 .. 6;
MUX_SEG at 0 range 7 .. 7;
BUFEN at 0 range 8 .. 8;
Reserved_9_31 at 0 range 9 .. 31;
end record;
subtype FCR_PON_Field is HAL.UInt3;
subtype FCR_DEAD_Field is HAL.UInt3;
subtype FCR_CC_Field is HAL.UInt3;
subtype FCR_BLINKF_Field is HAL.UInt3;
subtype FCR_BLINK_Field is HAL.UInt2;
subtype FCR_DIV_Field is HAL.UInt4;
subtype FCR_PS_Field is HAL.UInt4;
-- frame control register
type FCR_Register is record
-- High drive enable
HD : Boolean := False;
-- Start of frame interrupt enable
SOFIE : Boolean := False;
-- unspecified
Reserved_2_2 : HAL.Bit := 16#0#;
-- Update display done interrupt enable
UDDIE : Boolean := False;
-- Pulse ON duration
PON : FCR_PON_Field := 16#0#;
-- Dead time duration
DEAD : FCR_DEAD_Field := 16#0#;
-- Contrast control
CC : FCR_CC_Field := 16#0#;
-- Blink frequency selection
BLINKF : FCR_BLINKF_Field := 16#0#;
-- Blink mode selection
BLINK : FCR_BLINK_Field := 16#0#;
-- DIV clock divider
DIV : FCR_DIV_Field := 16#0#;
-- PS 16-bit prescaler
PS : FCR_PS_Field := 16#0#;
-- unspecified
Reserved_26_31 : HAL.UInt6 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for FCR_Register use record
HD at 0 range 0 .. 0;
SOFIE at 0 range 1 .. 1;
Reserved_2_2 at 0 range 2 .. 2;
UDDIE at 0 range 3 .. 3;
PON at 0 range 4 .. 6;
DEAD at 0 range 7 .. 9;
CC at 0 range 10 .. 12;
BLINKF at 0 range 13 .. 15;
BLINK at 0 range 16 .. 17;
DIV at 0 range 18 .. 21;
PS at 0 range 22 .. 25;
Reserved_26_31 at 0 range 26 .. 31;
end record;
-- status register
type SR_Register is record
-- Read-only. ENS
ENS : Boolean := False;
-- Read-only. Start of frame flag
SOF : Boolean := False;
-- Write-only. Update display request
UDR : Boolean := False;
-- Read-only. Update Display Done
UDD : Boolean := False;
-- Read-only. Ready flag
RDY : Boolean := False;
-- Read-only. LCD Frame Control Register Synchronization flag
FCRSF : Boolean := True;
-- unspecified
Reserved_6_31 : HAL.UInt26 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SR_Register use record
ENS at 0 range 0 .. 0;
SOF at 0 range 1 .. 1;
UDR at 0 range 2 .. 2;
UDD at 0 range 3 .. 3;
RDY at 0 range 4 .. 4;
FCRSF at 0 range 5 .. 5;
Reserved_6_31 at 0 range 6 .. 31;
end record;
-- clear register
type CLR_Register is record
-- unspecified
Reserved_0_0 : HAL.Bit := 16#0#;
-- Write-only. Start of frame flag clear
SOFC : Boolean := False;
-- unspecified
Reserved_2_2 : HAL.Bit := 16#0#;
-- Write-only. Update display done clear
UDDC : Boolean := False;
-- unspecified
Reserved_4_31 : HAL.UInt28 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CLR_Register use record
Reserved_0_0 at 0 range 0 .. 0;
SOFC at 0 range 1 .. 1;
Reserved_2_2 at 0 range 2 .. 2;
UDDC at 0 range 3 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
-- RAM_COM0_S array
type RAM_COM0_S_Field_Array is array (0 .. 30) of Boolean
with Component_Size => 1, Size => 31;
-- Type definition for RAM_COM0_S
type RAM_COM0_S_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- S as a value
Val : HAL.UInt31;
when True =>
-- S as an array
Arr : RAM_COM0_S_Field_Array;
end case;
end record
with Unchecked_Union, Size => 31;
for RAM_COM0_S_Field use record
Val at 0 range 0 .. 30;
Arr at 0 range 0 .. 30;
end record;
-- display memory
type RAM_COM0_Register is record
-- S00
S : RAM_COM0_S_Field := (As_Array => False, Val => 16#0#);
-- unspecified
Reserved_31_31 : HAL.Bit := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for RAM_COM0_Register use record
S at 0 range 0 .. 30;
Reserved_31_31 at 0 range 31 .. 31;
end record;
-- RAM_COM_S array
type RAM_COM_S_Field_Array is array (0 .. 31) of Boolean
with Component_Size => 1, Size => 32;
-- display memory
type RAM_COM_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- S as a value
Val : HAL.UInt32;
when True =>
-- S as an array
Arr : RAM_COM_S_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access,
Bit_Order => System.Low_Order_First;
for RAM_COM_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Liquid crystal display controller
type LCD_Peripheral is record
-- control register
CR : aliased CR_Register;
-- frame control register
FCR : aliased FCR_Register;
-- status register
SR : aliased SR_Register;
-- clear register
CLR : aliased CLR_Register;
-- display memory
RAM_COM0 : aliased RAM_COM0_Register;
-- display memory
RAM_COM1 : aliased RAM_COM_Register;
-- display memory
RAM_COM2 : aliased RAM_COM_Register;
-- display memory
RAM_COM3 : aliased RAM_COM_Register;
-- display memory
RAM_COM4 : aliased RAM_COM_Register;
-- display memory
RAM_COM5 : aliased RAM_COM_Register;
-- display memory
RAM_COM6 : aliased RAM_COM_Register;
-- display memory
RAM_COM7 : aliased RAM_COM_Register;
end record
with Volatile;
for LCD_Peripheral use record
CR at 16#0# range 0 .. 31;
FCR at 16#4# range 0 .. 31;
SR at 16#8# range 0 .. 31;
CLR at 16#C# range 0 .. 31;
RAM_COM0 at 16#14# range 0 .. 31;
RAM_COM1 at 16#1C# range 0 .. 31;
RAM_COM2 at 16#24# range 0 .. 31;
RAM_COM3 at 16#2C# range 0 .. 31;
RAM_COM4 at 16#34# range 0 .. 31;
RAM_COM5 at 16#3C# range 0 .. 31;
RAM_COM6 at 16#44# range 0 .. 31;
RAM_COM7 at 16#4C# range 0 .. 31;
end record;
-- Liquid crystal display controller
LCD_Periph : aliased LCD_Peripheral
with Import, Address => System'To_Address (16#40002400#);
end STM32_SVD.LCD;
|
pragma Ada_2012;
with Ada.Numerics.Elementary_Functions;
package body DSP.Generic_Functions is
function Complexify (X : Real_Filters.Coefficient_Array)
return Complex_Filters.Coefficient_Array
is
Result : Complex_Filters.Coefficient_Array (X'Range);
begin
for K in X'Range loop
Result (K) := (X (K), 0.0);
end loop;
return Result;
end Complexify;
function Notch_Specs (Freq : Normalized_Frequency;
Pole_Radius : Stable_Radius;
Class : Notch_Type := Stopband)
return Complex_IIR_Spec
is
Tmp : constant Real_IIR_Spec := Notch_Specs (Freq, Pole_Radius, Class);
begin
return Complex_IIR_Spec'(Num_Deg => Tmp.Num_Deg,
Den_Deg => Tmp.Den_Deg,
Numerator => Complexify (Tmp.Numerator),
Denominator => Complexify (Tmp.Denominator));
end Notch_Specs;
function Notch_Specs (Freq : Normalized_Frequency;
Pole_Radius : Stable_Radius;
Class : Notch_Type := Stopband)
return Real_IIR_Spec
is
use Ada.Numerics;
use Ada.Numerics.Elementary_Functions;
C : constant Scalar_Type := Scalar_Type (2.0 * Cos (2.0 * Pi * Freq));
R : constant Scalar_Type := Scalar_Type (Pole_Radius);
begin
case Class is
when Stopband =>
return Real_IIR_Spec'(Num_Deg => 2,
Den_Deg => 2,
Numerator =>
(0 => 1.0,
1 => -C,
2 => 1.0),
Denominator =>
(1 => -R * C,
2 => R ** 2));
when Passband =>
return Real_IIR_Spec'(Num_Deg => 1,
Den_Deg => 2,
Numerator =>
(0 => C * (1.0 - R),
1 => R ** 2 - 1.0),
Denominator =>
(1 => -R * C,
2 => R ** 2));
end case;
end Notch_Specs;
end DSP.Generic_Functions;
|
------------------------------------------------------------------------------
-- Copyright (C) 2020 by Heisenbug Ltd. (gh+flacada@heisenbug.eu)
--
-- This work is free. You can redistribute it and/or modify it under the
-- terms of the Do What The Fuck You Want To Public License, Version 2,
-- as published by Sam Hocevar. See the LICENSE file for more details.
------------------------------------------------------------------------------
pragma License (Unrestricted);
------------------------------------------------------------------------------
-- FLAC/Ada
--
-- Headers
--
-- The meta data block.
------------------------------------------------------------------------------
with Ada.Streams.Stream_IO;
with SPARK_Stream_IO;
package FLAC.Headers.Meta_Data with
Preelaborate => True,
SPARK_Mode => On
is
-- METADATA_BLOCK_HEADER
-- <1> Last-metadata-block flag: '1' if this block is the last metadata
-- block before the audio blocks, '0' otherwise.
-- <7> BLOCK_TYPE
-- 0 : STREAMINFO
-- 1 : PADDING
-- 2 : APPLICATION
-- 3 : SEEKTABLE
-- 4 : VORBIS_COMMENT
-- 5 : CUESHEET
-- 6 : PICTURE
-- 7-126 : reserved
-- 127 : invalid, to avoid confusion with a frame sync code
-- <24> Length (in bytes) of metadata to follow (does not include the size
-- of the METADATA_BLOCK_HEADER)
type T is
record
Last : Boolean;
Block_Type : Types.Block_Type;
Length : Types.Length_24;
end record;
Meta_Data_Length : constant := 32 / Ada.Streams.Stream_Element'Size;
---------------------------------------------------------------------------
-- Read
---------------------------------------------------------------------------
procedure Read (File : in Ada.Streams.Stream_IO.File_Type;
Item : out T;
Error : out Boolean)
with
Relaxed_Initialization => Item,
Pre => SPARK_Stream_IO.Is_Open (File => File),
Post => (if not Error then Item'Initialized),
Depends => ((Error, Item) => File);
end FLAC.Headers.Meta_Data;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Generic_Collections;
package AMF.DG.Marked_Elements.Collections is
pragma Preelaborate;
package DG_Marked_Element_Collections is
new AMF.Generic_Collections
(DG_Marked_Element,
DG_Marked_Element_Access);
type Set_Of_DG_Marked_Element is
new DG_Marked_Element_Collections.Set with null record;
Empty_Set_Of_DG_Marked_Element : constant Set_Of_DG_Marked_Element;
type Ordered_Set_Of_DG_Marked_Element is
new DG_Marked_Element_Collections.Ordered_Set with null record;
Empty_Ordered_Set_Of_DG_Marked_Element : constant Ordered_Set_Of_DG_Marked_Element;
type Bag_Of_DG_Marked_Element is
new DG_Marked_Element_Collections.Bag with null record;
Empty_Bag_Of_DG_Marked_Element : constant Bag_Of_DG_Marked_Element;
type Sequence_Of_DG_Marked_Element is
new DG_Marked_Element_Collections.Sequence with null record;
Empty_Sequence_Of_DG_Marked_Element : constant Sequence_Of_DG_Marked_Element;
private
Empty_Set_Of_DG_Marked_Element : constant Set_Of_DG_Marked_Element
:= (DG_Marked_Element_Collections.Set with null record);
Empty_Ordered_Set_Of_DG_Marked_Element : constant Ordered_Set_Of_DG_Marked_Element
:= (DG_Marked_Element_Collections.Ordered_Set with null record);
Empty_Bag_Of_DG_Marked_Element : constant Bag_Of_DG_Marked_Element
:= (DG_Marked_Element_Collections.Bag with null record);
Empty_Sequence_Of_DG_Marked_Element : constant Sequence_Of_DG_Marked_Element
:= (DG_Marked_Element_Collections.Sequence with null record);
end AMF.DG.Marked_Elements.Collections;
|
with Ada.Text_IO;
procedure Firstclass is
generic
n1, n2 : Float;
function Multiplier (m : Float) return Float;
function Multiplier (m : Float) return Float is begin
return n1 * n2 * m;
end Multiplier;
num, inv : array (1 .. 3) of Float;
begin
num := (2.0, 4.0, 6.0);
inv := (1.0/2.0, 1.0/4.0, 1.0/6.0);
for i in num'Range loop
declare
function new_function is new Multiplier (num (i), inv (i));
begin
Ada.Text_IO.Put_Line (new_function (0.5)'Img);
end;
end loop;
end Firstclass;
|
package Addr8 is
type Bytes is array (1 .. 4) of Character;
for Bytes'Alignment use 4;
procedure Proc (B: Bytes);
end Addr8;
|
-- Copyright 2018-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/>.
with Pck; use Pck;
procedure Bla is
begin
Global_Var := 1;
declare
begin
pragma Assert (Global_Var /= 1, "Error #1");
exception
when others =>
null;
end;
Global_Var := 2;
declare
begin
pragma Assert (Global_Var = 1, "Error #2"); -- STOP
exception
when others =>
null;
end;
Global_Var := 3;
declare
begin
pragma Assert (Global_Var = 2, "Error #3");
exception
when others =>
null;
end;
end Bla;
|
--------------------------------------------------------------------------------------------------------------------
-- Copyright (c) 2013-2020, Luke A. Guest
--
-- This software is provided 'as-is', without any express or implied
-- warranty. In no event will the authors be held liable for any damages
-- arising from the use of this software.
--
-- Permission is granted to anyone to use this software for any purpose,
-- including commercial applications, and to alter it and redistribute it
-- freely, subject to the following restrictions:
--
-- 1. The origin of this software must not be misrepresented; you must not
-- claim that you wrote the original software. If you use this software
-- in a product, an acknowledgment in the product documentation would be
-- appreciated but is not required.
--
-- 2. Altered source versions must be plainly marked as such, and must not be
-- misrepresented as being the original software.
--
-- 3. This notice may not be removed or altered from any source
-- distribution.
--------------------------------------------------------------------------------------------------------------------
-- SDL_Suites
--
-- Tests to check the Ada 2012 bindings for correctness.
--------------------------------------------------------------------------------------------------------------------
with AUnit; use AUnit;
with AUnit.Test_Suites;
package SDL_Suites is
function Suite return Test_Suites.Access_Test_Suite;
end SDL_Suites;
|
-- 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.RNG is
pragma Preelaborate;
---------------
-- Registers --
---------------
-- control register
type CR_Register is record
-- unspecified
Reserved_0_1 : HAL.UInt2 := 16#0#;
-- Random number generator enable
RNGEN : Boolean := False;
-- Interrupt enable
IE : Boolean := False;
-- unspecified
Reserved_4_31 : HAL.UInt28 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR_Register use record
Reserved_0_1 at 0 range 0 .. 1;
RNGEN at 0 range 2 .. 2;
IE at 0 range 3 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
-- status register
type SR_Register is record
-- Read-only. Data ready
DRDY : Boolean := False;
-- Read-only. Clock error current status
CECS : Boolean := False;
-- Read-only. Seed error current status
SECS : Boolean := False;
-- unspecified
Reserved_3_4 : HAL.UInt2 := 16#0#;
-- Clock error interrupt status
CEIS : Boolean := False;
-- Seed error interrupt status
SEIS : Boolean := False;
-- unspecified
Reserved_7_31 : HAL.UInt25 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SR_Register use record
DRDY at 0 range 0 .. 0;
CECS at 0 range 1 .. 1;
SECS at 0 range 2 .. 2;
Reserved_3_4 at 0 range 3 .. 4;
CEIS at 0 range 5 .. 5;
SEIS at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Random number generator
type RNG_Peripheral is record
-- control register
CR : aliased CR_Register;
-- status register
SR : aliased SR_Register;
-- data register
DR : aliased HAL.UInt32;
end record
with Volatile;
for RNG_Peripheral use record
CR at 16#0# range 0 .. 31;
SR at 16#4# range 0 .. 31;
DR at 16#8# range 0 .. 31;
end record;
-- Random number generator
RNG_Periph : aliased RNG_Peripheral
with Import, Address => System'To_Address (16#50060800#);
end STM32_SVD.RNG;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with AMF.Internals.UML_Named_Elements;
with AMF.String_Collections;
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.Clauses.Collections;
with AMF.UML.Conditional_Nodes;
with AMF.UML.Constraints.Collections;
with AMF.UML.Dependencies.Collections;
with AMF.UML.Element_Imports.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.Collections;
with AMF.UML.Namespaces;
with AMF.UML.Output_Pins.Collections;
with AMF.UML.Package_Imports.Collections;
with AMF.UML.Packageable_Elements.Collections;
with AMF.UML.Packages.Collections;
with AMF.UML.Redefinable_Elements.Collections;
with AMF.UML.String_Expressions;
with AMF.UML.Structured_Activity_Nodes;
with AMF.UML.Variables.Collections;
with AMF.Visitors;
package AMF.Internals.UML_Conditional_Nodes is
type UML_Conditional_Node_Proxy is
limited new AMF.Internals.UML_Named_Elements.UML_Named_Element_Proxy
and AMF.UML.Conditional_Nodes.UML_Conditional_Node with null record;
overriding function Get_Clause
(Self : not null access constant UML_Conditional_Node_Proxy)
return AMF.UML.Clauses.Collections.Set_Of_UML_Clause;
-- Getter of ConditionalNode::clause.
--
-- Set of clauses composing the conditional.
overriding function Get_Is_Assured
(Self : not null access constant UML_Conditional_Node_Proxy)
return Boolean;
-- Getter of ConditionalNode::isAssured.
--
-- If true, the modeler asserts that at least one test will succeed.
overriding procedure Set_Is_Assured
(Self : not null access UML_Conditional_Node_Proxy;
To : Boolean);
-- Setter of ConditionalNode::isAssured.
--
-- If true, the modeler asserts that at least one test will succeed.
overriding function Get_Is_Determinate
(Self : not null access constant UML_Conditional_Node_Proxy)
return Boolean;
-- Getter of ConditionalNode::isDeterminate.
--
-- If true, the modeler asserts that at most one test will succeed.
overriding procedure Set_Is_Determinate
(Self : not null access UML_Conditional_Node_Proxy;
To : Boolean);
-- Setter of ConditionalNode::isDeterminate.
--
-- If true, the modeler asserts that at most one test will succeed.
overriding function Get_Result
(Self : not null access constant UML_Conditional_Node_Proxy)
return AMF.UML.Output_Pins.Collections.Ordered_Set_Of_UML_Output_Pin;
-- Getter of ConditionalNode::result.
--
-- A list of output pins that constitute the data flow outputs of the
-- conditional.
overriding function Get_Activity
(Self : not null access constant UML_Conditional_Node_Proxy)
return AMF.UML.Activities.UML_Activity_Access;
-- Getter of StructuredActivityNode::activity.
--
-- Activity immediately containing the node.
overriding procedure Set_Activity
(Self : not null access UML_Conditional_Node_Proxy;
To : AMF.UML.Activities.UML_Activity_Access);
-- Setter of StructuredActivityNode::activity.
--
-- Activity immediately containing the node.
overriding function Get_Edge
(Self : not null access constant UML_Conditional_Node_Proxy)
return AMF.UML.Activity_Edges.Collections.Set_Of_UML_Activity_Edge;
-- Getter of StructuredActivityNode::edge.
--
-- Edges immediately contained in the structured node.
overriding function Get_Must_Isolate
(Self : not null access constant UML_Conditional_Node_Proxy)
return Boolean;
-- Getter of StructuredActivityNode::mustIsolate.
--
-- If true, then the actions in the node execute in isolation from actions
-- outside the node.
overriding procedure Set_Must_Isolate
(Self : not null access UML_Conditional_Node_Proxy;
To : Boolean);
-- Setter of StructuredActivityNode::mustIsolate.
--
-- If true, then the actions in the node execute in isolation from actions
-- outside the node.
overriding function Get_Node
(Self : not null access constant UML_Conditional_Node_Proxy)
return AMF.UML.Activity_Nodes.Collections.Set_Of_UML_Activity_Node;
-- Getter of StructuredActivityNode::node.
--
-- Nodes immediately contained in the group.
overriding function Get_Structured_Node_Input
(Self : not null access constant UML_Conditional_Node_Proxy)
return AMF.UML.Input_Pins.Collections.Set_Of_UML_Input_Pin;
-- Getter of StructuredActivityNode::structuredNodeInput.
--
overriding function Get_Structured_Node_Output
(Self : not null access constant UML_Conditional_Node_Proxy)
return AMF.UML.Output_Pins.Collections.Set_Of_UML_Output_Pin;
-- Getter of StructuredActivityNode::structuredNodeOutput.
--
overriding function Get_Variable
(Self : not null access constant UML_Conditional_Node_Proxy)
return AMF.UML.Variables.Collections.Set_Of_UML_Variable;
-- Getter of StructuredActivityNode::variable.
--
-- A variable defined in the scope of the structured activity node. It has
-- no value and may not be accessed
overriding function Get_Element_Import
(Self : not null access constant UML_Conditional_Node_Proxy)
return AMF.UML.Element_Imports.Collections.Set_Of_UML_Element_Import;
-- Getter of Namespace::elementImport.
--
-- References the ElementImports owned by the Namespace.
overriding function Get_Imported_Member
(Self : not null access constant UML_Conditional_Node_Proxy)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element;
-- Getter of Namespace::importedMember.
--
-- References the PackageableElements that are members of this Namespace
-- as a result of either PackageImports or ElementImports.
overriding function Get_Member
(Self : not null access constant UML_Conditional_Node_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Getter of Namespace::member.
--
-- A collection of NamedElements identifiable within the Namespace, either
-- by being owned or by being introduced by importing or inheritance.
overriding function Get_Owned_Member
(Self : not null access constant UML_Conditional_Node_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Getter of Namespace::ownedMember.
--
-- A collection of NamedElements owned by the Namespace.
overriding function Get_Owned_Rule
(Self : not null access constant UML_Conditional_Node_Proxy)
return AMF.UML.Constraints.Collections.Set_Of_UML_Constraint;
-- Getter of Namespace::ownedRule.
--
-- Specifies a set of Constraints owned by this Namespace.
overriding function Get_Package_Import
(Self : not null access constant UML_Conditional_Node_Proxy)
return AMF.UML.Package_Imports.Collections.Set_Of_UML_Package_Import;
-- Getter of Namespace::packageImport.
--
-- References the PackageImports owned by the Namespace.
overriding function Get_Client_Dependency
(Self : not null access constant UML_Conditional_Node_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_Conditional_Node_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_Conditional_Node_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_Conditional_Node_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_Conditional_Node_Proxy)
return AMF.Optional_String;
-- Getter of NamedElement::qualifiedName.
--
-- A name which allows the NamedElement to be identified within a
-- hierarchy of nested Namespaces. It is constructed from the names of the
-- containing namespaces starting at the root of the hierarchy and ending
-- with the name of the NamedElement itself.
overriding function Get_Contained_Edge
(Self : not null access constant UML_Conditional_Node_Proxy)
return AMF.UML.Activity_Edges.Collections.Set_Of_UML_Activity_Edge;
-- Getter of ActivityGroup::containedEdge.
--
-- Edges immediately contained in the group.
overriding function Get_Contained_Node
(Self : not null access constant UML_Conditional_Node_Proxy)
return AMF.UML.Activity_Nodes.Collections.Set_Of_UML_Activity_Node;
-- Getter of ActivityGroup::containedNode.
--
-- Nodes immediately contained in the group.
overriding function Get_In_Activity
(Self : not null access constant UML_Conditional_Node_Proxy)
return AMF.UML.Activities.UML_Activity_Access;
-- Getter of ActivityGroup::inActivity.
--
-- Activity containing the group.
overriding procedure Set_In_Activity
(Self : not null access UML_Conditional_Node_Proxy;
To : AMF.UML.Activities.UML_Activity_Access);
-- Setter of ActivityGroup::inActivity.
--
-- Activity containing the group.
overriding function Get_Subgroup
(Self : not null access constant UML_Conditional_Node_Proxy)
return AMF.UML.Activity_Groups.Collections.Set_Of_UML_Activity_Group;
-- Getter of ActivityGroup::subgroup.
--
-- Groups immediately contained in the group.
overriding function Get_Super_Group
(Self : not null access constant UML_Conditional_Node_Proxy)
return AMF.UML.Activity_Groups.UML_Activity_Group_Access;
-- Getter of ActivityGroup::superGroup.
--
-- Group immediately containing the group.
overriding function Get_Context
(Self : not null access constant UML_Conditional_Node_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_Conditional_Node_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_Conditional_Node_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_Conditional_Node_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_Conditional_Node_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_Conditional_Node_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_Conditional_Node_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_Conditional_Node_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_In_Group
(Self : not null access constant UML_Conditional_Node_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_Conditional_Node_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_Conditional_Node_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_Conditional_Node_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_Conditional_Node_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_Conditional_Node_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_Conditional_Node_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_Conditional_Node_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_Conditional_Node_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_Conditional_Node_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_Conditional_Node_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_Conditional_Node_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 Exclude_Collisions
(Self : not null access constant UML_Conditional_Node_Proxy;
Imps : AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element;
-- Operation Namespace::excludeCollisions.
--
-- The query excludeCollisions() excludes from a set of
-- PackageableElements any that would not be distinguishable from each
-- other in this namespace.
overriding function Get_Names_Of_Member
(Self : not null access constant UML_Conditional_Node_Proxy;
Element : AMF.UML.Named_Elements.UML_Named_Element_Access)
return AMF.String_Collections.Set_Of_String;
-- Operation Namespace::getNamesOfMember.
--
-- The query getNamesOfMember() takes importing into account. It gives
-- back the set of names that an element would have in an importing
-- namespace, either because it is owned, or if not owned then imported
-- individually, or if not individually then from a package.
-- The query getNamesOfMember() gives a set of all of the names that a
-- member would have in a Namespace. In general a member can have multiple
-- names in a Namespace if it is imported more than once with different
-- aliases. The query takes account of importing. It gives back the set of
-- names that an element would have in an importing namespace, either
-- because it is owned, or if not owned then imported individually, or if
-- not individually then from a package.
overriding function Import_Members
(Self : not null access constant UML_Conditional_Node_Proxy;
Imps : AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element;
-- Operation Namespace::importMembers.
--
-- The query importMembers() defines which of a set of PackageableElements
-- are actually imported into the namespace. This excludes hidden ones,
-- i.e., those which have names that conflict with names of owned members,
-- and also excludes elements which would have the same name when imported.
overriding function Imported_Member
(Self : not null access constant UML_Conditional_Node_Proxy)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element;
-- Operation Namespace::importedMember.
--
-- The importedMember property is derived from the ElementImports and the
-- PackageImports. References the PackageableElements that are members of
-- this Namespace as a result of either PackageImports or ElementImports.
overriding function Members_Are_Distinguishable
(Self : not null access constant UML_Conditional_Node_Proxy)
return Boolean;
-- Operation Namespace::membersAreDistinguishable.
--
-- The Boolean query membersAreDistinguishable() determines whether all of
-- the namespace's members are distinguishable within it.
overriding function Owned_Member
(Self : not null access constant UML_Conditional_Node_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Operation Namespace::ownedMember.
--
-- Missing derivation for Namespace::/ownedMember : NamedElement
overriding function All_Owning_Packages
(Self : not null access constant UML_Conditional_Node_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_Conditional_Node_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_Conditional_Node_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access;
-- Operation NamedElement::namespace.
--
-- Missing derivation for NamedElement::/namespace : Namespace
overriding function Context
(Self : not null access constant UML_Conditional_Node_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_Conditional_Node_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_Conditional_Node_Proxy;
Redefined : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean;
-- Operation RedefinableElement::isRedefinitionContextValid.
--
-- The query isRedefinitionContextValid() specifies whether the
-- redefinition contexts of this RedefinableElement are properly related
-- to the redefinition contexts of the specified RedefinableElement to
-- allow this element to redefine the other. By default at least one of
-- the redefinition contexts of this element must be a specialization of
-- at least one of the redefinition contexts of the specified element.
overriding procedure Enter_Element
(Self : not null access constant UML_Conditional_Node_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_Conditional_Node_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_Conditional_Node_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_Conditional_Nodes;
|
--
-- Copyright (C) 2015-2016 secunet Security Networks AG
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 2 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
with HW.GFX.I2C;
with HW.GFX.EDID;
with HW.GFX.GMA.Config;
with HW.GFX.GMA.Config_Helpers;
with HW.GFX.GMA.I2C;
with HW.GFX.GMA.DP_Aux_Ch;
with HW.GFX.GMA.Panel;
with HW.GFX.GMA.Power_And_Clocks;
with HW.Debug;
with GNAT.Source_Info;
package body HW.GFX.GMA.Display_Probing
is
function Port_Configured
(Configs : Pipe_Configs;
Port : Port_Type)
return Boolean
with
Global => null
is
begin
return Configs (Primary).Port = Port or
Configs (Secondary).Port = Port or
Configs (Tertiary).Port = Port;
end Port_Configured;
-- DP and HDMI share physical pins.
function Sibling_Port (Port : Port_Type) return Port_Type
is
begin
return
(case Port is
when HDMI1 => DP1,
when HDMI2 => DP2,
when HDMI3 => DP3,
when DP1 => HDMI1,
when DP2 => HDMI2,
when DP3 => HDMI3,
when others => Disabled);
end Sibling_Port;
function Has_Sibling_Port (Port : Port_Type) return Boolean
is
begin
return Sibling_Port (Port) /= Disabled;
end Has_Sibling_Port;
function Is_DVI_I (Port : Active_Port_Type) return Boolean
with
Global => null
is
begin
return Config.Have_DVI_I and
(Port = Analog or
Config_Helpers.To_PCH_Port (Port) = Config.Analog_I2C_Port);
end Is_DVI_I;
procedure Read_EDID
(Raw_EDID : out EDID.Raw_EDID_Data;
Port : in Active_Port_Type;
Success : out Boolean)
with
Post => (if Success then EDID.Valid (Raw_EDID))
is
Raw_EDID_Length : GFX.I2C.Transfer_Length := Raw_EDID'Length;
begin
pragma Debug (Debug.Put_Line (GNAT.Source_Info.Enclosing_Entity));
for I in 1 .. 2 loop
if Config_Helpers.To_Display_Type (Port) = DP then
-- May need power to read edid
declare
Temp_Configs : Pipe_Configs := Cur_Configs;
begin
Temp_Configs (Primary).Port := Port;
Power_And_Clocks.Power_Up (Cur_Configs, Temp_Configs);
end;
declare
DP_Port : constant GMA.DP_Port :=
(case Port is
when Internal => DP_A,
when DP1 => DP_B,
when DP2 => DP_C,
when DP3 => DP_D,
when others => GMA.DP_Port'First);
begin
DP_Aux_Ch.I2C_Read
(Port => DP_Port,
Address => 16#50#,
Length => Raw_EDID_Length,
Data => Raw_EDID,
Success => Success);
end;
else
I2C.I2C_Read
(Port => (if Port = Analog
then Config.Analog_I2C_Port
else Config_Helpers.To_PCH_Port (Port)),
Address => 16#50#,
Length => Raw_EDID_Length,
Data => Raw_EDID,
Success => Success);
end if;
exit when not Success; -- don't retry if reading itself failed
pragma Debug (Debug.Put_Buffer ("EDID", Raw_EDID, Raw_EDID_Length));
EDID.Sanitize (Raw_EDID, Success);
exit when Success;
end loop;
end Read_EDID;
procedure Probe_Port
(Pipe_Cfg : in out Pipe_Config;
Port : in Active_Port_Type;
Success : out Boolean)
with Pre => True
is
Raw_EDID : EDID.Raw_EDID_Data := (others => 16#00#);
begin
Success := Config.Valid_Port (Port);
if Success then
if Port = Internal then
Panel.Wait_On;
end if;
Read_EDID (Raw_EDID, Port, Success);
end if;
if Success and then
((not Is_DVI_I (Port) or EDID.Compatible_Display
(Raw_EDID, Config_Helpers.To_Display_Type (Port))) and
EDID.Has_Preferred_Mode (Raw_EDID))
then
Pipe_Cfg.Port := Port;
Pipe_Cfg.Mode := EDID.Preferred_Mode (Raw_EDID);
pragma Warnings (GNATprove, Off, "unused assignment to ""Raw_EDID""",
Reason => "We just want to check if it's readable.");
if Has_Sibling_Port (Port) then
-- Probe sibling port too and bail out if something is detected.
-- This is a precaution for adapters that expose the pins of a
-- port for both HDMI/DVI and DP (like some ThinkPad docks). A
-- user might have attached both by accident and there are ru-
-- mors of displays that got fried by applying the wrong signal.
declare
Have_Sibling_EDID : Boolean;
begin
Read_EDID (Raw_EDID, Sibling_Port (Port), Have_Sibling_EDID);
if Have_Sibling_EDID then
Pipe_Cfg.Port := Disabled;
Success := False;
end if;
end;
end if;
pragma Warnings (GNATprove, On, "unused assignment to ""Raw_EDID""");
else
Success := False;
end if;
end Probe_Port;
procedure Scan_Ports
(Configs : out Pipe_Configs;
Ports : in Port_List := All_Ports;
Max_Pipe : in Pipe_Index := Pipe_Index'Last;
Keep_Power : in Boolean := False)
is
Probe_Internal : Boolean := False;
Port_Idx : Port_List_Range := Port_List_Range'First;
Success : Boolean;
begin
Configs := (Pipe_Index =>
(Port => Disabled,
Mode => Invalid_Mode,
Cursor => Default_Cursor,
Framebuffer => Default_FB));
-- Turn panel on early to probe other ports during the power on delay.
for Idx in Port_List_Range loop
exit when Ports (Idx) = Disabled;
if Ports (Idx) = Internal then
Panel.On (Wait => False);
Probe_Internal := True;
exit;
end if;
end loop;
for Pipe in Pipe_Index range
Pipe_Index'First .. Pipe_Index'Min (Max_Pipe, Config.Max_Pipe)
loop
while Ports (Port_Idx) /= Disabled loop
if not Port_Configured (Configs, Ports (Port_Idx)) and
(not Has_Sibling_Port (Ports (Port_Idx)) or
not Port_Configured (Configs, Sibling_Port (Ports (Port_Idx))))
then
Probe_Port (Configs (Pipe), Ports (Port_Idx), Success);
else
Success := False;
end if;
exit when Port_Idx = Port_List_Range'Last;
Port_Idx := Port_List_Range'Succ (Port_Idx);
exit when Success;
end loop;
end loop;
-- Restore power settings
if not Keep_Power then
Power_And_Clocks.Power_Set_To (Cur_Configs);
end if;
-- Turn panel power off if probing failed.
if Probe_Internal and not Port_Configured (Configs, Internal) then
Panel.Off;
end if;
end Scan_Ports;
end HW.GFX.GMA.Display_Probing;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012-2015, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
pragma Restrictions (No_Elaboration_Code);
-- GNAT: enforce generation of preinitialized data section instead of
-- generation of elaboration code.
package Matreshka.Internals.Unicode.Ucd.Core_0E00 is
pragma Preelaborate;
Group_0E00 : aliased constant Core_Second_Stage
:= (16#01# => -- 0E0001
(Format, Neutral,
Control, Format, Format, Combining_Mark,
(Deprecated
| Case_Ignorable
| Default_Ignorable_Code_Point
| Changes_When_NFKC_Casefolded => True,
others => False)),
16#20# .. 16#7F# => -- 0E0020 .. 0E007F
(Format, Neutral,
Control, Format, Format, Combining_Mark,
(Deprecated
| Case_Ignorable
| Default_Ignorable_Code_Point
| Changes_When_NFKC_Casefolded => True,
others => False)),
others =>
(Unassigned, Neutral,
Control, Other, Other, Unknown,
(Other_Default_Ignorable_Code_Point
| Default_Ignorable_Code_Point
| Changes_When_NFKC_Casefolded => True,
others => False)));
end Matreshka.Internals.Unicode.Ucd.Core_0E00;
|
-----------------------------------------------------------------------
-- helios-tools-formats -- Formatting utilities for the agent
-- Copyright (C) 2017 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Dates.Formats;
with Util.Properties.Bundles;
package body Helios.Tools.Formats is
Bundle : Util.Properties.Bundles.Manager;
-- ------------------------------
-- Format the date by using the given pattern.
-- @see Utils.Dates.Formats
-- ------------------------------
function Format (Pattern : in String;
Date : in Ada.Calendar.Time) return String is
begin
return Util.Dates.Formats.Format (Pattern, Date, Bundle);
end Format;
-- ------------------------------
-- Initialize the resource bundle directory.
-- ------------------------------
procedure Initialize (Path : in String) is
Factory : Util.Properties.Bundles.Loader;
begin
Util.Properties.Bundles.Initialize (Factory, Path);
Util.Properties.Bundles.Load_Bundle (Factory, "dates", "en", Bundle);
end Initialize;
end Helios.Tools.Formats;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S T A N D --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992,1993,1994,1995,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. --
-- --
-- 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; use System;
with Tree_IO; use Tree_IO;
package body Stand is
---------------
-- Tree_Read --
---------------
procedure Tree_Read is
begin
Tree_Read_Data (Standard_Entity'Address,
Standard_Entity_Array_Type'Size / Storage_Unit);
Tree_Read_Int (Int (Standard_Package_Node));
Tree_Read_Int (Int (Last_Standard_Node_Id));
Tree_Read_Int (Int (Last_Standard_List_Id));
Tree_Read_Int (Int (Standard_Void_Type));
Tree_Read_Int (Int (Standard_Exception_Type));
Tree_Read_Int (Int (Standard_A_String));
Tree_Read_Int (Int (Any_Id));
Tree_Read_Int (Int (Any_Type));
Tree_Read_Int (Int (Any_Access));
Tree_Read_Int (Int (Any_Array));
Tree_Read_Int (Int (Any_Boolean));
Tree_Read_Int (Int (Any_Character));
Tree_Read_Int (Int (Any_Composite));
Tree_Read_Int (Int (Any_Discrete));
Tree_Read_Int (Int (Any_Fixed));
Tree_Read_Int (Int (Any_Integer));
Tree_Read_Int (Int (Any_Numeric));
Tree_Read_Int (Int (Any_Real));
Tree_Read_Int (Int (Any_Scalar));
Tree_Read_Int (Int (Any_String));
Tree_Read_Int (Int (Universal_Integer));
Tree_Read_Int (Int (Universal_Real));
Tree_Read_Int (Int (Universal_Fixed));
Tree_Read_Int (Int (Standard_Integer_8));
Tree_Read_Int (Int (Standard_Integer_16));
Tree_Read_Int (Int (Standard_Integer_32));
Tree_Read_Int (Int (Standard_Integer_64));
Tree_Read_Int (Int (Abort_Signal));
Tree_Read_Int (Int (Standard_Op_Rotate_Left));
Tree_Read_Int (Int (Standard_Op_Rotate_Right));
Tree_Read_Int (Int (Standard_Op_Shift_Left));
Tree_Read_Int (Int (Standard_Op_Shift_Right));
Tree_Read_Int (Int (Standard_Op_Shift_Right_Arithmetic));
end Tree_Read;
----------------
-- Tree_Write --
----------------
procedure Tree_Write is
begin
Tree_Write_Data (Standard_Entity'Address,
Standard_Entity_Array_Type'Size / Storage_Unit);
Tree_Write_Int (Int (Standard_Package_Node));
Tree_Write_Int (Int (Last_Standard_Node_Id));
Tree_Write_Int (Int (Last_Standard_List_Id));
Tree_Write_Int (Int (Standard_Void_Type));
Tree_Write_Int (Int (Standard_Exception_Type));
Tree_Write_Int (Int (Standard_A_String));
Tree_Write_Int (Int (Any_Id));
Tree_Write_Int (Int (Any_Type));
Tree_Write_Int (Int (Any_Access));
Tree_Write_Int (Int (Any_Array));
Tree_Write_Int (Int (Any_Boolean));
Tree_Write_Int (Int (Any_Character));
Tree_Write_Int (Int (Any_Composite));
Tree_Write_Int (Int (Any_Discrete));
Tree_Write_Int (Int (Any_Fixed));
Tree_Write_Int (Int (Any_Integer));
Tree_Write_Int (Int (Any_Numeric));
Tree_Write_Int (Int (Any_Real));
Tree_Write_Int (Int (Any_Scalar));
Tree_Write_Int (Int (Any_String));
Tree_Write_Int (Int (Universal_Integer));
Tree_Write_Int (Int (Universal_Real));
Tree_Write_Int (Int (Universal_Fixed));
Tree_Write_Int (Int (Standard_Integer_8));
Tree_Write_Int (Int (Standard_Integer_16));
Tree_Write_Int (Int (Standard_Integer_32));
Tree_Write_Int (Int (Standard_Integer_64));
Tree_Write_Int (Int (Abort_Signal));
Tree_Write_Int (Int (Standard_Op_Rotate_Left));
Tree_Write_Int (Int (Standard_Op_Rotate_Right));
Tree_Write_Int (Int (Standard_Op_Shift_Left));
Tree_Write_Int (Int (Standard_Op_Shift_Right));
Tree_Write_Int (Int (Standard_Op_Shift_Right_Arithmetic));
end Tree_Write;
end Stand;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- SYSTEM.TASK_PRIMITIVES.OPERATIONS.MONOTONIC --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
-- This is the Monotonic version of this package for Posix and Linux targets.
separate (System.Task_Primitives.Operations)
package body Monotonic is
-----------------------
-- Local Subprograms --
-----------------------
procedure Compute_Deadline
(Time : Duration;
Mode : ST.Delay_Modes;
Check_Time : out Duration;
Abs_Time : out Duration);
-- Helper for Timed_Sleep and Timed_Delay: given a deadline specified by
-- Time and Mode, compute the current clock reading (Check_Time), and the
-- target absolute and relative clock readings (Abs_Time). The
-- epoch for Time depends on Mode; the epoch for Check_Time and Abs_Time
-- is always that of CLOCK_RT_Ada.
---------------------
-- Monotonic_Clock --
---------------------
function Monotonic_Clock return Duration is
TS : aliased timespec;
Result : Interfaces.C.int;
begin
Result := clock_gettime
(clock_id => OSC.CLOCK_RT_Ada, tp => TS'Unchecked_Access);
pragma Assert (Result = 0);
return To_Duration (TS);
end Monotonic_Clock;
-------------------
-- RT_Resolution --
-------------------
function RT_Resolution return Duration is
TS : aliased timespec;
Result : Interfaces.C.int;
begin
Result := clock_getres (OSC.CLOCK_REALTIME, TS'Unchecked_Access);
pragma Assert (Result = 0);
return To_Duration (TS);
end RT_Resolution;
----------------------
-- Compute_Deadline --
----------------------
procedure Compute_Deadline
(Time : Duration;
Mode : ST.Delay_Modes;
Check_Time : out Duration;
Abs_Time : out Duration)
is
begin
Check_Time := Monotonic_Clock;
-- Relative deadline
if Mode = Relative then
Abs_Time := Duration'Min (Time, Max_Sensible_Delay) + Check_Time;
pragma Warnings (Off);
-- Comparison "OSC.CLOCK_RT_Ada = OSC.CLOCK_REALTIME" is compile
-- time known.
-- Absolute deadline specified using the tasking clock (CLOCK_RT_Ada)
elsif Mode = Absolute_RT
or else OSC.CLOCK_RT_Ada = OSC.CLOCK_REALTIME
then
pragma Warnings (On);
Abs_Time := Duration'Min (Check_Time + Max_Sensible_Delay, Time);
-- Absolute deadline specified using the calendar clock, in the
-- case where it is not the same as the tasking clock: compensate for
-- difference between clock epochs (Base_Time - Base_Cal_Time).
else
declare
Cal_Check_Time : constant Duration := OS_Primitives.Clock;
RT_Time : constant Duration :=
Time + Check_Time - Cal_Check_Time;
begin
Abs_Time :=
Duration'Min (Check_Time + Max_Sensible_Delay, RT_Time);
end;
end if;
end Compute_Deadline;
-----------------
-- Timed_Sleep --
-----------------
-- This is for use within the run-time system, so abort is
-- assumed to be already deferred, and the caller should be
-- holding its own ATCB lock.
procedure Timed_Sleep
(Self_ID : ST.Task_Id;
Time : Duration;
Mode : ST.Delay_Modes;
Reason : System.Tasking.Task_States;
Timedout : out Boolean;
Yielded : out Boolean)
is
pragma Unreferenced (Reason);
Base_Time : Duration;
Check_Time : Duration;
Abs_Time : Duration;
P_Abs_Time : Duration;
Request : aliased timespec;
Result : Interfaces.C.int;
Exit_Outer : Boolean := False;
begin
Timedout := True;
Yielded := False;
Compute_Deadline
(Time => Time,
Mode => Mode,
Check_Time => Check_Time,
Abs_Time => Abs_Time);
Base_Time := Check_Time;
-- To keep a sensible Max_Sensible_Delay on a target whose system
-- maximum is less than sensible, we split the delay into manageable
-- chunks of time less than or equal to the Max_System_Delay.
if Abs_Time > Check_Time then
Outer : loop
pragma Warnings (Off, "condition is always *");
if Max_System_Delay < Max_Sensible_Delay and then
Abs_Time > Check_Time + Max_System_Delay
then
P_Abs_Time := Check_Time + Max_System_Delay;
else
P_Abs_Time := Abs_Time;
Exit_Outer := True;
end if;
pragma Warnings (On);
Request := To_Timespec (P_Abs_Time);
Inner : loop
exit Outer
when Self_ID.Pending_ATC_Level < Self_ID.ATC_Nesting_Level;
Result :=
pthread_cond_timedwait
(cond => Self_ID.Common.LL.CV'Access,
mutex => Self_ID.Common.LL.L'Access,
abstime => Request'Access);
case Result is
when 0 | EINTR =>
-- Somebody may have called Wakeup for us
Timedout := False;
exit Outer;
when ETIMEDOUT =>
exit Outer when Exit_Outer;
Check_Time := Monotonic_Clock;
exit Inner;
when others =>
pragma Assert (False);
end case;
exit Outer
when Abs_Time <= Check_Time or else Check_Time < Base_Time;
end loop Inner;
end loop Outer;
end if;
end Timed_Sleep;
-----------------
-- Timed_Delay --
-----------------
-- This is for use in implementing delay statements, so we assume the
-- caller is abort-deferred but is holding no locks.
procedure Timed_Delay
(Self_ID : ST.Task_Id;
Time : Duration;
Mode : ST.Delay_Modes)
is
Base_Time : Duration;
Check_Time : Duration;
Abs_Time : Duration;
P_Abs_Time : Duration;
Request : aliased timespec;
Result : Interfaces.C.int;
Exit_Outer : Boolean := False;
begin
Write_Lock (Self_ID);
Compute_Deadline
(Time => Time,
Mode => Mode,
Check_Time => Check_Time,
Abs_Time => Abs_Time);
Base_Time := Check_Time;
-- To keep a sensible Max_Sensible_Delay on a target whose system
-- maximum is less than sensible, we split the delay into manageable
-- chunks of time less than or equal to the Max_System_Delay.
if Abs_Time > Check_Time then
Self_ID.Common.State := Delay_Sleep;
Outer : loop
pragma Warnings (Off, "condition is always *");
if Max_System_Delay < Max_Sensible_Delay and then
Abs_Time > Check_Time + Max_System_Delay
then
P_Abs_Time := Check_Time + Max_System_Delay;
else
P_Abs_Time := Abs_Time;
Exit_Outer := True;
end if;
pragma Warnings (On);
Request := To_Timespec (P_Abs_Time);
Inner : loop
exit Outer
when Self_ID.Pending_ATC_Level < Self_ID.ATC_Nesting_Level;
Result :=
pthread_cond_timedwait
(cond => Self_ID.Common.LL.CV'Access,
mutex => Self_ID.Common.LL.L'Access,
abstime => Request'Access);
case Result is
when ETIMEDOUT =>
exit Outer when Exit_Outer;
Check_Time := Monotonic_Clock;
exit Inner;
when 0 | EINTR => null;
when others =>
pragma Assert (False);
end case;
exit Outer
when Abs_Time <= Check_Time or else Check_Time < Base_Time;
end loop Inner;
end loop Outer;
Self_ID.Common.State := Runnable;
end if;
Unlock (Self_ID);
pragma Unreferenced (Result);
Result := sched_yield;
end Timed_Delay;
end Monotonic;
|
procedure Main is
begin
null;
end Main;
|
-----------------------------------------------------------------------
-- awa-wikis-writers -- Wiki writers
-- Copyright (C) 2011, 2012, 2013 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.Strings.Unbounded;
with ASF.Contexts.Writer.String;
with AWA.Wikis.Writers.Html;
with AWA.Wikis.Writers.Text;
package body AWA.Wikis.Writers is
-- ------------------------------
-- Render the wiki text according to the wiki syntax in an HTML string.
-- ------------------------------
function To_Html (Text : in Wide_Wide_String;
Syntax : in AWA.Wikis.Parsers.Wiki_Syntax_Type) return String is
Writer : aliased ASF.Contexts.Writer.String.String_Writer;
Html : aliased AWA.Wikis.Writers.Html.Html_Writer;
begin
Html.Set_Writer (Writer'Unchecked_Access);
AWA.Wikis.Parsers.Parse (Html'Unchecked_Access, Text, Syntax);
return Ada.Strings.Unbounded.To_String (Writer.Get_Response);
end To_Html;
-- ------------------------------
-- Render the wiki text according to the wiki syntax in a text string.
-- Wiki formatting and decoration are removed.
-- ------------------------------
function To_Text (Text : in Wide_Wide_String;
Syntax : in AWA.Wikis.Parsers.Wiki_Syntax_Type) return String is
Writer : aliased ASF.Contexts.Writer.String.String_Writer;
Renderer : aliased AWA.Wikis.Writers.Text.Text_Writer;
begin
Renderer.Set_Writer (Writer'Unchecked_Access);
AWA.Wikis.Parsers.Parse (Renderer'Unchecked_Access, Text, Syntax);
return Ada.Strings.Unbounded.To_String (Writer.Get_Response);
end To_Text;
end AWA.Wikis.Writers;
|
-- Version for sqlite
with GNATCOLL.SQL_Impl; use GNATCOLL.SQL_Impl;
with GNATCOLL.SQL.Exec; use GNATCOLL.SQL.Exec;
with GNATCOLL.SQL.Sqlite; use GNATCOLL.SQL;
procedure Prepared_Query is
DB_Descr : Database_Description;
Conn : Database_Connection;
Query : Prepared_Statement;
--sqlite does not support boolean fields
True_Str : aliased String := "TRUE";
Param : SQL_Parameters (1 .. 4) :=
(1 => (Parameter_Text, null),
2 => (Parameter_Integer, 0),
3 => (Parameter_Text, null),
4 => (Parameter_Integer, 0));
begin
-- Allocate and initialize the description of the connection
Setup_Database (DB_Descr, "rosetta.db", "", "", "", DBMS_Sqlite);
-- Allocate the connection
Conn := Sqlite.Build_Sqlite_Connection (DB_Descr);
-- Initialize the connection
Reset_Connection (DB_Descr, Conn);
Query :=
Prepare
("UPDATE players SET name = ?, score = ?, active = ? " &
" WHERE jerseyNum = ?");
declare
Name : aliased String := "Smith, Steve";
begin
Param := ("+" (Name'Access), "+" (42), "+" (True_Str'Access), "+" (99));
Execute (Conn, Query, Param);
end;
Commit_Or_Rollback (Conn);
Free (Conn);
Free (DB_Descr);
end Prepared_Query;
|
package Tkmrpc.Dispatchers is
end Tkmrpc.Dispatchers;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2017-2020, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision: 5704 $ $Date: 2017-01-20 23:11:33 +0300 (Fri, 20 Jan 2017) $
------------------------------------------------------------------------------
generic
package Web.Core.Connectables.Slots_0.Slots_1.Slots_2.Generic_Emitters is
pragma Preelaborate;
type Emitter (Owner : not null access Connectable_Object'Class) is
limited new Slots_2.Signal with private;
procedure Emit
(Self : in out Emitter'Class;
Parameter_1 : Parameter_1_Type;
Parameter_2 : Parameter_2_Type);
private
type Signal_End is abstract new Signal_End_Base with null record;
not overriding procedure Invoke
(Self : in out Signal_End;
Parameter_1 : Parameter_1_Type;
Parameter_2 : Parameter_2_Type) is abstract;
type Signal_End_0 is new Signal_End with null record;
overriding procedure Invoke
(Self : in out Signal_End_0;
Parameter_1 : Parameter_1_Type;
Parameter_2 : Parameter_2_Type);
type Signal_End_1 is new Signal_End with null record;
overriding procedure Invoke
(Self : in out Signal_End_1;
Parameter_1 : Parameter_1_Type;
Parameter_2 : Parameter_2_Type);
type Signal_End_2 is new Signal_End with null record;
overriding procedure Invoke
(Self : in out Signal_End_2;
Parameter_1 : Parameter_1_Type;
Parameter_2 : Parameter_2_Type);
-------------
-- Emitter --
-------------
type Emitter (Owner : not null access Connectable_Object'Class) is
limited new Emitter_Base and Slots_2.Signal with null record;
overriding procedure Connect
(Self : in out Emitter;
Slot : Slots_0.Slot'Class);
overriding procedure Connect
(Self : in out Emitter;
Slot : Slots_1.Slot'Class);
overriding procedure Connect
(Self : in out Emitter;
Slot : Slots_2.Slot'Class);
end Web.Core.Connectables.Slots_0.Slots_1.Slots_2.Generic_Emitters;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . S Y N C H R O N O U S _ T A S K _ C O N T R O L --
-- --
-- B o d y --
-- --
-- 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. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Ada.Exceptions;
with System.Tasking;
with System.Task_Primitives.Operations;
package body Ada.Synchronous_Task_Control with
SPARK_Mode => Off
is
----------------
-- Initialize --
----------------
procedure Initialize (S : in out Suspension_Object) is
begin
System.Task_Primitives.Operations.Initialize (S.SO);
end Initialize;
--------------
-- Finalize --
--------------
procedure Finalize (S : in out Suspension_Object) is
begin
System.Task_Primitives.Operations.Finalize (S.SO);
end Finalize;
-------------------
-- Current_State --
-------------------
function Current_State (S : Suspension_Object) return Boolean is
begin
return System.Task_Primitives.Operations.Current_State (S.SO);
end Current_State;
---------------
-- Set_False --
---------------
procedure Set_False (S : in out Suspension_Object) is
begin
System.Task_Primitives.Operations.Set_False (S.SO);
end Set_False;
--------------
-- Set_True --
--------------
procedure Set_True (S : in out Suspension_Object) is
begin
System.Task_Primitives.Operations.Set_True (S.SO);
end Set_True;
------------------------
-- Suspend_Until_True --
------------------------
procedure Suspend_Until_True (S : in out Suspension_Object) is
begin
-- This is a potentially blocking (see ARM D.10, par. 10), so that
-- if pragma Detect_Blocking is active then Program_Error must be
-- raised if this operation is called from a protected action.
if System.Tasking.Detect_Blocking
and then System.Tasking.Self.Common.Protected_Action_Nesting > 0
then
Ada.Exceptions.Raise_Exception
(Program_Error'Identity, "potentially blocking operation");
end if;
System.Task_Primitives.Operations.Suspend_Until_True (S.SO);
end Suspend_Until_True;
end Ada.Synchronous_Task_Control;
|
pragma Warnings (Off);
pragma Ada_95;
with System;
with System.Parameters;
with System.Secondary_Stack;
package ada_main is
gnat_argc : Integer;
gnat_argv : System.Address;
gnat_envp : System.Address;
pragma Import (C, gnat_argc);
pragma Import (C, gnat_argv);
pragma Import (C, gnat_envp);
gnat_exit_status : Integer;
pragma Import (C, gnat_exit_status);
GNAT_Version : constant String :=
"GNAT Version: Community 2020 (20200429-93)" & ASCII.NUL;
pragma Export (C, GNAT_Version, "__gnat_version");
Ada_Main_Program_Name : constant String := "_ada_tarea_dina_declare" & ASCII.NUL;
pragma Export (C, Ada_Main_Program_Name, "__gnat_ada_main_program_name");
procedure adainit;
pragma Export (C, adainit, "adainit");
procedure adafinal;
pragma Export (C, adafinal, "adafinal");
function main
(argc : Integer;
argv : System.Address;
envp : System.Address)
return Integer;
pragma Export (C, main, "main");
type Version_32 is mod 2 ** 32;
u00001 : constant Version_32 := 16#18810e13#;
pragma Export (C, u00001, "tarea_dina_declareB");
u00002 : constant Version_32 := 16#67c8d842#;
pragma Export (C, u00002, "system__standard_libraryB");
u00003 : constant Version_32 := 16#5741b5a5#;
pragma Export (C, u00003, "system__standard_libraryS");
u00004 : constant Version_32 := 16#76789da1#;
pragma Export (C, u00004, "adaS");
u00005 : constant Version_32 := 16#ffaa9e94#;
pragma Export (C, u00005, "ada__calendar__delaysB");
u00006 : constant Version_32 := 16#d86d2f1d#;
pragma Export (C, u00006, "ada__calendar__delaysS");
u00007 : constant Version_32 := 16#57c21ad4#;
pragma Export (C, u00007, "ada__calendarB");
u00008 : constant Version_32 := 16#31350a81#;
pragma Export (C, u00008, "ada__calendarS");
u00009 : constant Version_32 := 16#f34ff985#;
pragma Export (C, u00009, "ada__exceptionsB");
u00010 : constant Version_32 := 16#cfbb5cc5#;
pragma Export (C, u00010, "ada__exceptionsS");
u00011 : constant Version_32 := 16#35e1815f#;
pragma Export (C, u00011, "ada__exceptions__last_chance_handlerB");
u00012 : constant Version_32 := 16#cfec26ee#;
pragma Export (C, u00012, "ada__exceptions__last_chance_handlerS");
u00013 : constant Version_32 := 16#32a08138#;
pragma Export (C, u00013, "systemS");
u00014 : constant Version_32 := 16#ae860117#;
pragma Export (C, u00014, "system__soft_linksB");
u00015 : constant Version_32 := 16#4d9536d3#;
pragma Export (C, u00015, "system__soft_linksS");
u00016 : constant Version_32 := 16#59d61025#;
pragma Export (C, u00016, "system__secondary_stackB");
u00017 : constant Version_32 := 16#c30bb6bc#;
pragma Export (C, u00017, "system__secondary_stackS");
u00018 : constant Version_32 := 16#896564a3#;
pragma Export (C, u00018, "system__parametersB");
u00019 : constant Version_32 := 16#75f245f3#;
pragma Export (C, u00019, "system__parametersS");
u00020 : constant Version_32 := 16#ced09590#;
pragma Export (C, u00020, "system__storage_elementsB");
u00021 : constant Version_32 := 16#1f63cb3c#;
pragma Export (C, u00021, "system__storage_elementsS");
u00022 : constant Version_32 := 16#ce3e0e21#;
pragma Export (C, u00022, "system__soft_links__initializeB");
u00023 : constant Version_32 := 16#5697fc2b#;
pragma Export (C, u00023, "system__soft_links__initializeS");
u00024 : constant Version_32 := 16#41837d1e#;
pragma Export (C, u00024, "system__stack_checkingB");
u00025 : constant Version_32 := 16#bc1fead0#;
pragma Export (C, u00025, "system__stack_checkingS");
u00026 : constant Version_32 := 16#34742901#;
pragma Export (C, u00026, "system__exception_tableB");
u00027 : constant Version_32 := 16#0dc9c2c8#;
pragma Export (C, u00027, "system__exception_tableS");
u00028 : constant Version_32 := 16#ce4af020#;
pragma Export (C, u00028, "system__exceptionsB");
u00029 : constant Version_32 := 16#5ac3ecce#;
pragma Export (C, u00029, "system__exceptionsS");
u00030 : constant Version_32 := 16#69416224#;
pragma Export (C, u00030, "system__exceptions__machineB");
u00031 : constant Version_32 := 16#5c74e542#;
pragma Export (C, u00031, "system__exceptions__machineS");
u00032 : constant Version_32 := 16#aa0563fc#;
pragma Export (C, u00032, "system__exceptions_debugB");
u00033 : constant Version_32 := 16#2eed524e#;
pragma Export (C, u00033, "system__exceptions_debugS");
u00034 : constant Version_32 := 16#6c2f8802#;
pragma Export (C, u00034, "system__img_intB");
u00035 : constant Version_32 := 16#307b61fa#;
pragma Export (C, u00035, "system__img_intS");
u00036 : constant Version_32 := 16#39df8c17#;
pragma Export (C, u00036, "system__tracebackB");
u00037 : constant Version_32 := 16#6c825ffc#;
pragma Export (C, u00037, "system__tracebackS");
u00038 : constant Version_32 := 16#9ed49525#;
pragma Export (C, u00038, "system__traceback_entriesB");
u00039 : constant Version_32 := 16#32fb7748#;
pragma Export (C, u00039, "system__traceback_entriesS");
u00040 : constant Version_32 := 16#3f39e75e#;
pragma Export (C, u00040, "system__traceback__symbolicB");
u00041 : constant Version_32 := 16#46491211#;
pragma Export (C, u00041, "system__traceback__symbolicS");
u00042 : constant Version_32 := 16#179d7d28#;
pragma Export (C, u00042, "ada__containersS");
u00043 : constant Version_32 := 16#701f9d88#;
pragma Export (C, u00043, "ada__exceptions__tracebackB");
u00044 : constant Version_32 := 16#ae2d2db5#;
pragma Export (C, u00044, "ada__exceptions__tracebackS");
u00045 : constant Version_32 := 16#e865e681#;
pragma Export (C, u00045, "system__bounded_stringsB");
u00046 : constant Version_32 := 16#455da021#;
pragma Export (C, u00046, "system__bounded_stringsS");
u00047 : constant Version_32 := 16#7b499e82#;
pragma Export (C, u00047, "system__crtlS");
u00048 : constant Version_32 := 16#641e2245#;
pragma Export (C, u00048, "system__dwarf_linesB");
u00049 : constant Version_32 := 16#40ce1ea3#;
pragma Export (C, u00049, "system__dwarf_linesS");
u00050 : constant Version_32 := 16#5b4659fa#;
pragma Export (C, u00050, "ada__charactersS");
u00051 : constant Version_32 := 16#8f637df8#;
pragma Export (C, u00051, "ada__characters__handlingB");
u00052 : constant Version_32 := 16#3b3f6154#;
pragma Export (C, u00052, "ada__characters__handlingS");
u00053 : constant Version_32 := 16#4b7bb96a#;
pragma Export (C, u00053, "ada__characters__latin_1S");
u00054 : constant Version_32 := 16#e6d4fa36#;
pragma Export (C, u00054, "ada__stringsS");
u00055 : constant Version_32 := 16#96df1a3f#;
pragma Export (C, u00055, "ada__strings__mapsB");
u00056 : constant Version_32 := 16#1e526bec#;
pragma Export (C, u00056, "ada__strings__mapsS");
u00057 : constant Version_32 := 16#465aa89c#;
pragma Export (C, u00057, "system__bit_opsB");
u00058 : constant Version_32 := 16#0765e3a3#;
pragma Export (C, u00058, "system__bit_opsS");
u00059 : constant Version_32 := 16#6c6ff32a#;
pragma Export (C, u00059, "system__unsigned_typesS");
u00060 : constant Version_32 := 16#92f05f13#;
pragma Export (C, u00060, "ada__strings__maps__constantsS");
u00061 : constant Version_32 := 16#5ab55268#;
pragma Export (C, u00061, "interfacesS");
u00062 : constant Version_32 := 16#a0d3d22b#;
pragma Export (C, u00062, "system__address_imageB");
u00063 : constant Version_32 := 16#934c1c02#;
pragma Export (C, u00063, "system__address_imageS");
u00064 : constant Version_32 := 16#8631cc2e#;
pragma Export (C, u00064, "system__img_unsB");
u00065 : constant Version_32 := 16#f39bcfdd#;
pragma Export (C, u00065, "system__img_unsS");
u00066 : constant Version_32 := 16#20ec7aa3#;
pragma Export (C, u00066, "system__ioB");
u00067 : constant Version_32 := 16#ace27677#;
pragma Export (C, u00067, "system__ioS");
u00068 : constant Version_32 := 16#3080f2ca#;
pragma Export (C, u00068, "system__mmapB");
u00069 : constant Version_32 := 16#9ad4d587#;
pragma Export (C, u00069, "system__mmapS");
u00070 : constant Version_32 := 16#92d882c5#;
pragma Export (C, u00070, "ada__io_exceptionsS");
u00071 : constant Version_32 := 16#a8ba7b3b#;
pragma Export (C, u00071, "system__mmap__os_interfaceB");
u00072 : constant Version_32 := 16#8f4541b8#;
pragma Export (C, u00072, "system__mmap__os_interfaceS");
u00073 : constant Version_32 := 16#657efc5a#;
pragma Export (C, u00073, "system__os_libB");
u00074 : constant Version_32 := 16#d872da39#;
pragma Export (C, u00074, "system__os_libS");
u00075 : constant Version_32 := 16#ec4d5631#;
pragma Export (C, u00075, "system__case_utilB");
u00076 : constant Version_32 := 16#0d75376c#;
pragma Export (C, u00076, "system__case_utilS");
u00077 : constant Version_32 := 16#2a8e89ad#;
pragma Export (C, u00077, "system__stringsB");
u00078 : constant Version_32 := 16#52b6adad#;
pragma Export (C, u00078, "system__stringsS");
u00079 : constant Version_32 := 16#e49bce3e#;
pragma Export (C, u00079, "interfaces__cB");
u00080 : constant Version_32 := 16#dbc36ce0#;
pragma Export (C, u00080, "interfaces__cS");
u00081 : constant Version_32 := 16#c83ab8ef#;
pragma Export (C, u00081, "system__object_readerB");
u00082 : constant Version_32 := 16#f6d45c39#;
pragma Export (C, u00082, "system__object_readerS");
u00083 : constant Version_32 := 16#914b0305#;
pragma Export (C, u00083, "system__val_lliB");
u00084 : constant Version_32 := 16#5ece13c8#;
pragma Export (C, u00084, "system__val_lliS");
u00085 : constant Version_32 := 16#d2ae2792#;
pragma Export (C, u00085, "system__val_lluB");
u00086 : constant Version_32 := 16#01a17ec8#;
pragma Export (C, u00086, "system__val_lluS");
u00087 : constant Version_32 := 16#269742a9#;
pragma Export (C, u00087, "system__val_utilB");
u00088 : constant Version_32 := 16#9e0037c6#;
pragma Export (C, u00088, "system__val_utilS");
u00089 : constant Version_32 := 16#b578159b#;
pragma Export (C, u00089, "system__exception_tracesB");
u00090 : constant Version_32 := 16#167fa1a2#;
pragma Export (C, u00090, "system__exception_tracesS");
u00091 : constant Version_32 := 16#e1282880#;
pragma Export (C, u00091, "system__win32S");
u00092 : constant Version_32 := 16#8c33a517#;
pragma Export (C, u00092, "system__wch_conB");
u00093 : constant Version_32 := 16#29dda3ea#;
pragma Export (C, u00093, "system__wch_conS");
u00094 : constant Version_32 := 16#9721e840#;
pragma Export (C, u00094, "system__wch_stwB");
u00095 : constant Version_32 := 16#04cc8feb#;
pragma Export (C, u00095, "system__wch_stwS");
u00096 : constant Version_32 := 16#a831679c#;
pragma Export (C, u00096, "system__wch_cnvB");
u00097 : constant Version_32 := 16#266a1919#;
pragma Export (C, u00097, "system__wch_cnvS");
u00098 : constant Version_32 := 16#ece6fdb6#;
pragma Export (C, u00098, "system__wch_jisB");
u00099 : constant Version_32 := 16#a61a0038#;
pragma Export (C, u00099, "system__wch_jisS");
u00100 : constant Version_32 := 16#24ec69e6#;
pragma Export (C, u00100, "system__os_primitivesB");
u00101 : constant Version_32 := 16#355de4ce#;
pragma Export (C, u00101, "system__os_primitivesS");
u00102 : constant Version_32 := 16#05c60a38#;
pragma Export (C, u00102, "system__task_lockB");
u00103 : constant Version_32 := 16#532ab656#;
pragma Export (C, u00103, "system__task_lockS");
u00104 : constant Version_32 := 16#b8c476a4#;
pragma Export (C, u00104, "system__win32__extS");
u00105 : constant Version_32 := 16#553ad4ac#;
pragma Export (C, u00105, "ada__real_timeB");
u00106 : constant Version_32 := 16#1ad7dfc0#;
pragma Export (C, u00106, "ada__real_timeS");
u00107 : constant Version_32 := 16#0d140719#;
pragma Export (C, u00107, "system__taskingB");
u00108 : constant Version_32 := 16#c6674d66#;
pragma Export (C, u00108, "system__taskingS");
u00109 : constant Version_32 := 16#dc410cef#;
pragma Export (C, u00109, "system__task_primitivesS");
u00110 : constant Version_32 := 16#4cfe4fc8#;
pragma Export (C, u00110, "system__os_interfaceS");
u00111 : constant Version_32 := 16#1d638357#;
pragma Export (C, u00111, "interfaces__c__stringsB");
u00112 : constant Version_32 := 16#f239f79c#;
pragma Export (C, u00112, "interfaces__c__stringsS");
u00113 : constant Version_32 := 16#152ee045#;
pragma Export (C, u00113, "system__task_primitives__operationsB");
u00114 : constant Version_32 := 16#5a0b0d58#;
pragma Export (C, u00114, "system__task_primitives__operationsS");
u00115 : constant Version_32 := 16#1b28662b#;
pragma Export (C, u00115, "system__float_controlB");
u00116 : constant Version_32 := 16#d25cc204#;
pragma Export (C, u00116, "system__float_controlS");
u00117 : constant Version_32 := 16#6387a759#;
pragma Export (C, u00117, "system__interrupt_managementB");
u00118 : constant Version_32 := 16#246e2885#;
pragma Export (C, u00118, "system__interrupt_managementS");
u00119 : constant Version_32 := 16#64507e17#;
pragma Export (C, u00119, "system__multiprocessorsB");
u00120 : constant Version_32 := 16#0a0c1e4b#;
pragma Export (C, u00120, "system__multiprocessorsS");
u00121 : constant Version_32 := 16#ce7dfb56#;
pragma Export (C, u00121, "system__task_infoB");
u00122 : constant Version_32 := 16#4713b9b1#;
pragma Export (C, u00122, "system__task_infoS");
u00123 : constant Version_32 := 16#1bbc5086#;
pragma Export (C, u00123, "system__tasking__debugB");
u00124 : constant Version_32 := 16#48f9280e#;
pragma Export (C, u00124, "system__tasking__debugS");
u00125 : constant Version_32 := 16#fd83e873#;
pragma Export (C, u00125, "system__concat_2B");
u00126 : constant Version_32 := 16#300056e8#;
pragma Export (C, u00126, "system__concat_2S");
u00127 : constant Version_32 := 16#2b70b149#;
pragma Export (C, u00127, "system__concat_3B");
u00128 : constant Version_32 := 16#39d0dd9d#;
pragma Export (C, u00128, "system__concat_3S");
u00129 : constant Version_32 := 16#b31a5821#;
pragma Export (C, u00129, "system__img_enum_newB");
u00130 : constant Version_32 := 16#53ec87f8#;
pragma Export (C, u00130, "system__img_enum_newS");
u00131 : constant Version_32 := 16#617d5887#;
pragma Export (C, u00131, "system__stack_usageB");
u00132 : constant Version_32 := 16#3a3ac346#;
pragma Export (C, u00132, "system__stack_usageS");
u00133 : constant Version_32 := 16#f9576a72#;
pragma Export (C, u00133, "ada__tagsB");
u00134 : constant Version_32 := 16#b6661f55#;
pragma Export (C, u00134, "ada__tagsS");
u00135 : constant Version_32 := 16#796f31f1#;
pragma Export (C, u00135, "system__htableB");
u00136 : constant Version_32 := 16#b66232d2#;
pragma Export (C, u00136, "system__htableS");
u00137 : constant Version_32 := 16#089f5cd0#;
pragma Export (C, u00137, "system__string_hashB");
u00138 : constant Version_32 := 16#143c59ac#;
pragma Export (C, u00138, "system__string_hashS");
u00139 : constant Version_32 := 16#f4e097a7#;
pragma Export (C, u00139, "ada__text_ioB");
u00140 : constant Version_32 := 16#03e83e15#;
pragma Export (C, u00140, "ada__text_ioS");
u00141 : constant Version_32 := 16#10558b11#;
pragma Export (C, u00141, "ada__streamsB");
u00142 : constant Version_32 := 16#67e31212#;
pragma Export (C, u00142, "ada__streamsS");
u00143 : constant Version_32 := 16#73d2d764#;
pragma Export (C, u00143, "interfaces__c_streamsB");
u00144 : constant Version_32 := 16#b1330297#;
pragma Export (C, u00144, "interfaces__c_streamsS");
u00145 : constant Version_32 := 16#ec9c64c3#;
pragma Export (C, u00145, "system__file_ioB");
u00146 : constant Version_32 := 16#95d1605d#;
pragma Export (C, u00146, "system__file_ioS");
u00147 : constant Version_32 := 16#86c56e5a#;
pragma Export (C, u00147, "ada__finalizationS");
u00148 : constant Version_32 := 16#95817ed8#;
pragma Export (C, u00148, "system__finalization_rootB");
u00149 : constant Version_32 := 16#7d52f2a8#;
pragma Export (C, u00149, "system__finalization_rootS");
u00150 : constant Version_32 := 16#cf3f1b90#;
pragma Export (C, u00150, "system__file_control_blockS");
u00151 : constant Version_32 := 16#7d29cee1#;
pragma Export (C, u00151, "system__tasking__stagesB");
u00152 : constant Version_32 := 16#6153a6f3#;
pragma Export (C, u00152, "system__tasking__stagesS");
u00153 : constant Version_32 := 16#100eaf58#;
pragma Export (C, u00153, "system__restrictionsB");
u00154 : constant Version_32 := 16#dbc9df38#;
pragma Export (C, u00154, "system__restrictionsS");
u00155 : constant Version_32 := 16#b19e9df1#;
pragma Export (C, u00155, "system__tasking__initializationB");
u00156 : constant Version_32 := 16#cd0eb8a9#;
pragma Export (C, u00156, "system__tasking__initializationS");
u00157 : constant Version_32 := 16#215cb8f4#;
pragma Export (C, u00157, "system__soft_links__taskingB");
u00158 : constant Version_32 := 16#e939497e#;
pragma Export (C, u00158, "system__soft_links__taskingS");
u00159 : constant Version_32 := 16#3880736e#;
pragma Export (C, u00159, "ada__exceptions__is_null_occurrenceB");
u00160 : constant Version_32 := 16#6fde25af#;
pragma Export (C, u00160, "ada__exceptions__is_null_occurrenceS");
u00161 : constant Version_32 := 16#d798575d#;
pragma Export (C, u00161, "system__tasking__task_attributesB");
u00162 : constant Version_32 := 16#7dbadc03#;
pragma Export (C, u00162, "system__tasking__task_attributesS");
u00163 : constant Version_32 := 16#db326703#;
pragma Export (C, u00163, "system__tasking__queuingB");
u00164 : constant Version_32 := 16#73e13001#;
pragma Export (C, u00164, "system__tasking__queuingS");
u00165 : constant Version_32 := 16#3af67f9c#;
pragma Export (C, u00165, "system__tasking__protected_objectsB");
u00166 : constant Version_32 := 16#242da0e0#;
pragma Export (C, u00166, "system__tasking__protected_objectsS");
u00167 : constant Version_32 := 16#119b2d0b#;
pragma Export (C, u00167, "system__tasking__protected_objects__entriesB");
u00168 : constant Version_32 := 16#7daf93e7#;
pragma Export (C, u00168, "system__tasking__protected_objects__entriesS");
u00169 : constant Version_32 := 16#72e59739#;
pragma Export (C, u00169, "system__tasking__rendezvousB");
u00170 : constant Version_32 := 16#e93c6c5f#;
pragma Export (C, u00170, "system__tasking__rendezvousS");
u00171 : constant Version_32 := 16#4cd3ce3b#;
pragma Export (C, u00171, "system__tasking__entry_callsB");
u00172 : constant Version_32 := 16#526fb901#;
pragma Export (C, u00172, "system__tasking__entry_callsS");
u00173 : constant Version_32 := 16#ad55c617#;
pragma Export (C, u00173, "system__tasking__protected_objects__operationsB");
u00174 : constant Version_32 := 16#343fde45#;
pragma Export (C, u00174, "system__tasking__protected_objects__operationsS");
u00175 : constant Version_32 := 16#1d9c679e#;
pragma Export (C, u00175, "system__tasking__utilitiesB");
u00176 : constant Version_32 := 16#a65de031#;
pragma Export (C, u00176, "system__tasking__utilitiesS");
u00177 : constant Version_32 := 16#f5d48c3e#;
pragma Export (C, u00177, "tipos_tareaB");
u00178 : constant Version_32 := 16#cfbc21df#;
pragma Export (C, u00178, "tipos_tareaS");
u00179 : constant Version_32 := 16#eca5ecae#;
pragma Export (C, u00179, "system__memoryB");
u00180 : constant Version_32 := 16#6bdde70c#;
pragma Export (C, u00180, "system__memoryS");
-- BEGIN ELABORATION ORDER
-- ada%s
-- ada.characters%s
-- ada.characters.latin_1%s
-- interfaces%s
-- system%s
-- system.float_control%s
-- system.float_control%b
-- system.img_enum_new%s
-- system.img_enum_new%b
-- system.img_int%s
-- system.img_int%b
-- system.io%s
-- system.io%b
-- system.parameters%s
-- system.parameters%b
-- system.crtl%s
-- interfaces.c_streams%s
-- interfaces.c_streams%b
-- system.restrictions%s
-- system.restrictions%b
-- system.storage_elements%s
-- system.storage_elements%b
-- system.stack_checking%s
-- system.stack_checking%b
-- system.stack_usage%s
-- system.stack_usage%b
-- system.string_hash%s
-- system.string_hash%b
-- system.htable%s
-- system.htable%b
-- system.strings%s
-- system.strings%b
-- system.traceback_entries%s
-- system.traceback_entries%b
-- system.unsigned_types%s
-- system.img_uns%s
-- system.img_uns%b
-- system.wch_con%s
-- system.wch_con%b
-- system.wch_jis%s
-- system.wch_jis%b
-- system.wch_cnv%s
-- system.wch_cnv%b
-- system.concat_2%s
-- system.concat_2%b
-- system.concat_3%s
-- system.concat_3%b
-- system.traceback%s
-- system.traceback%b
-- ada.characters.handling%s
-- system.case_util%s
-- system.os_lib%s
-- system.secondary_stack%s
-- system.standard_library%s
-- ada.exceptions%s
-- system.exceptions_debug%s
-- system.exceptions_debug%b
-- system.soft_links%s
-- system.val_lli%s
-- system.val_llu%s
-- system.val_util%s
-- system.val_util%b
-- system.wch_stw%s
-- system.wch_stw%b
-- ada.exceptions.last_chance_handler%s
-- ada.exceptions.last_chance_handler%b
-- ada.exceptions.traceback%s
-- ada.exceptions.traceback%b
-- system.address_image%s
-- system.address_image%b
-- system.bit_ops%s
-- system.bit_ops%b
-- system.bounded_strings%s
-- system.bounded_strings%b
-- system.case_util%b
-- system.exception_table%s
-- system.exception_table%b
-- ada.containers%s
-- ada.io_exceptions%s
-- ada.strings%s
-- ada.strings.maps%s
-- ada.strings.maps%b
-- ada.strings.maps.constants%s
-- interfaces.c%s
-- interfaces.c%b
-- system.exceptions%s
-- system.exceptions%b
-- system.exceptions.machine%s
-- system.exceptions.machine%b
-- system.win32%s
-- ada.characters.handling%b
-- system.exception_traces%s
-- system.exception_traces%b
-- system.memory%s
-- system.memory%b
-- system.mmap%s
-- system.mmap.os_interface%s
-- system.mmap.os_interface%b
-- system.mmap%b
-- system.object_reader%s
-- system.object_reader%b
-- system.dwarf_lines%s
-- system.dwarf_lines%b
-- system.os_lib%b
-- system.secondary_stack%b
-- system.soft_links.initialize%s
-- system.soft_links.initialize%b
-- system.soft_links%b
-- system.standard_library%b
-- system.traceback.symbolic%s
-- system.traceback.symbolic%b
-- ada.exceptions%b
-- system.val_lli%b
-- system.val_llu%b
-- ada.exceptions.is_null_occurrence%s
-- ada.exceptions.is_null_occurrence%b
-- ada.tags%s
-- ada.tags%b
-- ada.streams%s
-- ada.streams%b
-- interfaces.c.strings%s
-- interfaces.c.strings%b
-- system.file_control_block%s
-- system.finalization_root%s
-- system.finalization_root%b
-- ada.finalization%s
-- system.file_io%s
-- system.file_io%b
-- system.multiprocessors%s
-- system.multiprocessors%b
-- system.os_interface%s
-- system.interrupt_management%s
-- system.interrupt_management%b
-- system.task_info%s
-- system.task_info%b
-- system.task_lock%s
-- system.task_lock%b
-- system.task_primitives%s
-- system.win32.ext%s
-- system.os_primitives%s
-- system.os_primitives%b
-- system.tasking%s
-- system.task_primitives.operations%s
-- system.tasking.debug%s
-- system.tasking.debug%b
-- system.task_primitives.operations%b
-- system.tasking%b
-- ada.calendar%s
-- ada.calendar%b
-- ada.calendar.delays%s
-- ada.calendar.delays%b
-- ada.real_time%s
-- ada.real_time%b
-- ada.text_io%s
-- ada.text_io%b
-- system.soft_links.tasking%s
-- system.soft_links.tasking%b
-- system.tasking.initialization%s
-- system.tasking.task_attributes%s
-- system.tasking.task_attributes%b
-- system.tasking.initialization%b
-- system.tasking.protected_objects%s
-- system.tasking.protected_objects%b
-- system.tasking.protected_objects.entries%s
-- system.tasking.protected_objects.entries%b
-- system.tasking.queuing%s
-- system.tasking.queuing%b
-- system.tasking.utilities%s
-- system.tasking.utilities%b
-- system.tasking.entry_calls%s
-- system.tasking.rendezvous%s
-- system.tasking.protected_objects.operations%s
-- system.tasking.protected_objects.operations%b
-- system.tasking.entry_calls%b
-- system.tasking.rendezvous%b
-- system.tasking.stages%s
-- system.tasking.stages%b
-- tipos_tarea%s
-- tipos_tarea%b
-- tarea_dina_declare%b
-- END ELABORATION ORDER
end ada_main;
|
------------------------------------------------------------------------------
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
with STM32_SVD.SDMMC;
-- SVD files for the STM32F4 and STM32F7 have different names for the SDMMC
-- device (SDIO or SDMMC). This package provides a common name for the
-- Peripheral type.
package SDMMC_SVD_Periph is
subtype Peripheral is STM32_SVD.SDMMC.SDMMC_Peripheral;
end SDMMC_SVD_Periph;
|
package Data_Type is
-- Complete implementation
type Record_T is null record;
function "<"
(L, R : Record_T)
return Boolean;
function Image
(Element : Record_T)
return String;
end Data_Type;
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.