CombinedText stringlengths 4 3.42M |
|---|
-----------------------------------------------------------------------
-- awa-storages-stores-databases -- Database store
-- Copyright (C) 2012, 2015, 2016 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.Streams.Stream_IO;
with Util.Log.Loggers;
package body AWA.Storages.Stores.Databases is
Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("AWA.Storages.Stores.Files");
-- Create a storage
procedure Create (Storage : in Database_Store;
Session : in out ADO.Sessions.Master_Session;
From : in AWA.Storages.Models.Storage_Ref'Class;
Into : in out AWA.Storages.Storage_File) is
begin
Storage.Tmp.Create (Session, From, Into);
end Create;
-- ------------------------------
-- Save the file represented by the `Path` variable into a store and associate that
-- content with the storage reference represented by `Into`.
-- ------------------------------
procedure Save (Storage : in Database_Store;
Session : in out ADO.Sessions.Master_Session;
Into : in out AWA.Storages.Models.Storage_Ref'Class;
Path : in String) is
pragma Unreferenced (Storage);
Store : AWA.Storages.Models.Storage_Data_Ref;
Blob : constant ADO.Blob_Ref := ADO.Create_Blob (Path);
begin
Log.Info ("Save database file {0}", Path);
Store.Set_Data (Blob);
Store.Save (Session);
Into.Set_File_Size (Natural (Blob.Value.Len));
Into.Set_Store_Data (Store);
end Save;
procedure Load (Storage : in Database_Store;
Session : in out ADO.Sessions.Session'Class;
From : in AWA.Storages.Models.Storage_Ref'Class;
Into : in out AWA.Storages.Storage_File) is
Store : AWA.Storages.Models.Storage_Data_Ref'Class := From.Get_Store_Data;
File : Ada.Streams.Stream_IO.File_Type;
DB : ADO.Sessions.Master_Session := ADO.Sessions.Master_Session (Session);
begin
Storage.Tmp.Create (DB, From, Into);
Log.Info ("Load database file {0} to {1}",
ADO.Identifier'Image (Store.Get_Id), Get_Path (Into));
Store.Load (Session, Store.Get_Id);
Ada.Streams.Stream_IO.Create (File => File,
Mode => Ada.Streams.Stream_IO.Out_File,
Name => Get_Path (Into));
Ada.Streams.Stream_IO.Write (File, Store.Get_Data.Value.Data);
Ada.Streams.Stream_IO.Close (File);
end Load;
-- ------------------------------
-- Delete the content associate with the storage represented by `From`.
-- ------------------------------
procedure Delete (Storage : in Database_Store;
Session : in out ADO.Sessions.Master_Session;
From : in out AWA.Storages.Models.Storage_Ref'Class) is
pragma Unreferenced (Storage);
Store : AWA.Storages.Models.Storage_Data_Ref'Class := From.Get_Store_Data;
begin
if not Store.Is_Null then
Log.Info ("Delete file {0}", ADO.Identifier'Image (From.Get_Id));
Store.Delete (Session);
end if;
end Delete;
end AWA.Storages.Stores.Databases;
|
pragma Ada_2005;
pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
with stddef_h;
with Interfaces.C.Strings;
package crtdefs_h is
--*
-- * This file has no copyright assigned and is placed in the Public Domain.
-- * This file is part of the mingw-w64 runtime package.
-- * No warranty is given; refer to the file DISCLAIMER.PD within this package.
--
-- #define __ERRCODE_DEFINED_MS
subtype rsize_t is stddef_h.size_t; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:26
type threadmbcinfostruct is null record; -- incomplete struct
type threadlocaleinfostruct;
type pthreadlocinfo is access all threadlocaleinfostruct; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:155
type pthreadmbcinfo is access all threadmbcinfostruct; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:156
type uu_lc_time_data is null record; -- incomplete struct
type localeinfo_struct is record
locinfo : pthreadlocinfo; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:160
mbcinfo : pthreadmbcinfo; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:161
end record;
pragma Convention (C_Pass_By_Copy, localeinfo_struct); -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:159
subtype u_locale_tstruct is localeinfo_struct; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:162
type u_locale_t is access all localeinfo_struct; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:162
type tagLC_ID is record
wLanguage : aliased unsigned_short; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:167
wCountry : aliased unsigned_short; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:168
wCodePage : aliased unsigned_short; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:169
end record;
pragma Convention (C_Pass_By_Copy, tagLC_ID); -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:166
subtype LC_ID is tagLC_ID; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:170
type LPLC_ID is access all tagLC_ID; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:170
type anon_1 is record
locale : Interfaces.C.Strings.chars_ptr; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:182
wlocale : access wchar_t; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:183
refcount : access int; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:184
wrefcount : access int; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:185
end record;
pragma Convention (C_Pass_By_Copy, anon_1);
type threadlocaleinfostruct_lc_handle_array is array (0 .. 5) of aliased unsigned_long;
type threadlocaleinfostruct_lc_id_array is array (0 .. 5) of aliased LC_ID;
type threadlocaleinfostruct_lc_category_array is array (0 .. 5) of aliased anon_1;
type lconv;
type threadlocaleinfostruct is record
refcount : aliased int; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:176
lc_codepage : aliased unsigned; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:177
lc_collate_cp : aliased unsigned; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:178
lc_handle : aliased threadlocaleinfostruct_lc_handle_array; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:179
lc_id : aliased threadlocaleinfostruct_lc_id_array; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:180
lc_category : aliased threadlocaleinfostruct_lc_category_array; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:186
lc_clike : aliased int; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:187
mb_cur_max : aliased int; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:188
lconv_intl_refcount : access int; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:189
lconv_num_refcount : access int; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:190
lconv_mon_refcount : access int; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:191
the_lconv : access lconv; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:192
ctype1_refcount : access int; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:193
ctype1 : access unsigned_short; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:194
pctype : access unsigned_short; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:195
pclmap : access unsigned_char; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:196
pcumap : access unsigned_char; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:197
lc_time_curr : access uu_lc_time_data; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:198
end record;
pragma Convention (C_Pass_By_Copy, threadlocaleinfostruct); -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:175
type lconv is null record; -- incomplete struct
subtype threadlocinfo is threadlocaleinfostruct; -- d:\install\gpl2018\x86_64-pc-mingw32\include\crtdefs.h:199
end crtdefs_h;
|
with Ada.Assertions; use Ada.Assertions;
package body Memory.Arbiter is
function Create_Arbiter(next : access Memory_Type'Class)
return Arbiter_Pointer is
result : constant Arbiter_Pointer := new Arbiter_Type;
begin
Set_Memory(result.all, next);
return result;
end Create_Arbiter;
function Clone(mem : Arbiter_Type) return Memory_Pointer is
result : constant Arbiter_Pointer := new Arbiter_Type'(mem);
begin
return Memory_Pointer(result);
end Clone;
procedure Reset(mem : in out Arbiter_Type;
context : in Natural) is
begin
Reset(Container_Type(mem), context);
end Reset;
procedure Set_Port(mem : in out Arbiter_Type;
port : in Natural;
ready : out Boolean) is
begin
mem.port := port;
ready := True;
end Set_Port;
function Get_Next_Time(mem : Arbiter_Type) return Time_Type is
begin
if mem.port > mem.pending.Last_Index then
return 0;
else
return mem.pending.Element(mem.port);
end if;
end Get_Next_Time;
procedure Read(mem : in out Arbiter_Type;
address : in Address_Type;
size : in Positive) is
begin
Read(Container_Type(mem), address, size);
end Read;
procedure Write(mem : in out Arbiter_Type;
address : in Address_Type;
size : in Positive) is
begin
Write(Container_Type(mem), address, size);
end Write;
procedure Idle(mem : in out Arbiter_Type;
cycles : in Time_Type) is
begin
Assert(False, "Memory.Arbiter.Idle not implemented");
end Idle;
function To_String(mem : Arbiter_Type) return Unbounded_String is
result : Unbounded_String;
begin
Append(result, "(arbiter ");
Append(result, "(memory ");
Append(result, To_String(Get_Memory(mem).all));
Append(result, ")");
Append(result, ")");
return result;
end To_String;
end Memory.Arbiter;
|
------------------------------------------------------------------------------
-- --
-- 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_Elements;
with AMF.Standard_Profile_L2.Auxiliaries;
with AMF.UML.Classes;
with AMF.Visitors;
package AMF.Internals.Standard_Profile_L2_Auxiliaries is
type Standard_Profile_L2_Auxiliary_Proxy is
limited new AMF.Internals.UML_Elements.UML_Element_Base
and AMF.Standard_Profile_L2.Auxiliaries.Standard_Profile_L2_Auxiliary with null record;
overriding function Get_Base_Class
(Self : not null access constant Standard_Profile_L2_Auxiliary_Proxy)
return AMF.UML.Classes.UML_Class_Access;
-- Getter of Auxiliary::base_Class.
--
overriding procedure Set_Base_Class
(Self : not null access Standard_Profile_L2_Auxiliary_Proxy;
To : AMF.UML.Classes.UML_Class_Access);
-- Setter of Auxiliary::base_Class.
--
overriding procedure Enter_Element
(Self : not null access constant Standard_Profile_L2_Auxiliary_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
overriding procedure Leave_Element
(Self : not null access constant Standard_Profile_L2_Auxiliary_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
overriding procedure Visit_Element
(Self : not null access constant Standard_Profile_L2_Auxiliary_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
end AMF.Internals.Standard_Profile_L2_Auxiliaries;
|
with C.signal;
package body System.Interrupt_Management.Operations is
use type C.signed_int;
procedure Set_Interrupt_Mask (Mask : access Interrupt_Mask) is
begin
Set_Interrupt_Mask (Mask => Mask, OMask => null);
end Set_Interrupt_Mask;
procedure Set_Interrupt_Mask (
Mask : access Interrupt_Mask;
OMask : access Interrupt_Mask)
is
errno : C.signed_int;
begin
errno := C.signal.sigprocmask (C.signal.SIG_SETMASK, Mask, OMask);
if errno /= 0 then
raise Program_Error;
end if;
end Set_Interrupt_Mask;
procedure Get_Interrupt_Mask (Mask : access Interrupt_Mask) is
begin
Set_Interrupt_Mask (Mask => null, OMask => Mask);
end Get_Interrupt_Mask;
procedure Fill_Interrupt_Mask (Mask : access Interrupt_Mask) is
Dummy : C.signed_int;
begin
Dummy := C.signal.sigfillset (Mask);
end Fill_Interrupt_Mask;
procedure Add_To_Interrupt_Mask (
Mask : access Interrupt_Mask;
Interrupt : Interrupt_ID)
is
Dummy : C.signed_int;
begin
Dummy := C.signal.sigaddset (Mask, Interrupt);
end Add_To_Interrupt_Mask;
procedure Copy_Interrupt_Mask (
X : out Interrupt_Mask;
Y : Interrupt_Mask) is
begin
X := Y;
end Copy_Interrupt_Mask;
end System.Interrupt_Management.Operations;
|
-- C93004C.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 WHEN AN EXCEPTION IS RAISED DURING THE ACTIVATION OF A
-- TASK, OTHER TASKS ARE UNAFFECTED.
-- IF SEVERAL TASKS FAIL THEIR ACTIVATION, ONLY ONE TASKING_ERROR IS
-- RAISED.
-- THE ENCLOSING BLOCK RECEIVES TASKING_ERROR.
-- CHECK THAT TASKS WAITING ON ENTRIES OF SUCH TASKS RECEIVE
-- TASKING_ERROR
-- JEAN-PIERRE ROSEN 09-MAR-1984
-- JBG 06/01/84
-- JBG 05/23/85
-- EG 10/29/85 ELIMINATE THE USE OF NUMERIC_ERROR IN TEST.
-- PWN 11/30/94 REMOVED PRAGMA PRIORITY INSTANCES FOR ADA 9X.
WITH REPORT; USE REPORT;
WITH SYSTEM; USE SYSTEM;
PROCEDURE C93004C IS
BEGIN
TEST("C93004C", "EXCEPTIONS DURING ACTIVATION");
DECLARE
TASK TYPE T1 IS
END T1;
TASK TYPE T2 IS
ENTRY E;
END T2;
ARR_T2: ARRAY(INTEGER RANGE 1..4) OF T2;
TYPE AT1 IS ACCESS T1;
PACKAGE START_T1 IS -- THIS PACKAGE TO AVOID ACCESS
END START_T1; -- BEFORE ELABORATION ON T1.
TASK BODY T1 IS
BEGIN
DECLARE -- THIS BLOCK TO CHECK THAT T1BIS TERMINATES.
TASK T1BIS IS
END T1BIS;
TASK BODY T1BIS IS
BEGIN
ARR_T2(IDENT_INT(2)).E;
FAILED ("RENDEZVOUS COMPLETED - T3");
EXCEPTION
WHEN TASKING_ERROR =>
NULL;
WHEN OTHERS =>
FAILED("ABNORMAL EXCEPTION - T3");
END T1BIS;
BEGIN
NULL;
END;
ARR_T2(IDENT_INT(2)).E; -- ARR_T2(2) IS NOW TERMINATED.
FAILED ("RENDEZVOUS COMPLETED WITHOUT ERROR - T1");
EXCEPTION
WHEN TASKING_ERROR =>
NULL;
WHEN OTHERS =>
FAILED("ABNORMAL EXCEPTION - T1");
END;
PACKAGE BODY START_T1 IS
V_AT1 : AT1 := NEW T1;
END START_T1;
TASK BODY T2 IS
I : POSITIVE := IDENT_INT(0); -- RAISE CONSTRAINT_ERROR.
BEGIN
IF I /= IDENT_INT(2) OR I = IDENT_INT(1) + 1 THEN
FAILED("T2 ACTIVATED OK");
END IF;
END T2;
TASK T3 IS
ENTRY E;
END T3;
TASK BODY T3 IS
BEGIN -- T3 MUST BE ACTIVATED OK.
ACCEPT E;
END T3;
BEGIN
FAILED ("TASKING_ERROR NOT RAISED IN MAIN");
T3.E; -- CLEAN UP.
EXCEPTION
WHEN TASKING_ERROR =>
BEGIN
T3.E;
EXCEPTION
WHEN TASKING_ERROR =>
FAILED ("T3 NOT ACTIVATED");
END;
WHEN CONSTRAINT_ERROR =>
FAILED ("CONSTRAINT_ERROR RAISED IN MAIN");
WHEN OTHERS =>
FAILED ("ABNORMAL EXCEPTION IN MAIN-2");
END;
RESULT;
END C93004C;
|
package FLTK.Images.RGB.BMP is
type BMP_Image is new RGB_Image with private;
type BMP_Image_Reference (Data : not null access BMP_Image'Class) is limited null record
with Implicit_Dereference => Data;
package Forge is
function Create
(Filename : in String)
return BMP_Image;
end Forge;
private
type BMP_Image is new RGB_Image with null record;
overriding procedure Finalize
(This : in out BMP_Image);
end FLTK.Images.RGB.BMP;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- SYSTEM.TASKING.PROTECTED_OBJECTS.SINGLE_ENTRY --
-- --
-- B o d y --
-- --
-- Copyright (C) 1998-2019, Free Software Foundation, Inc. --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
pragma Style_Checks (All_Checks);
-- Turn off subprogram ordering check, since restricted GNARLI subprograms are
-- gathered together at end.
-- This package provides an optimized version of Protected_Objects.Operations
-- and Protected_Objects.Entries making the following assumptions:
-- PO has only one entry
-- There is only one caller at a time (No_Entry_Queue)
-- There is no dynamic priority support (No_Dynamic_Priorities)
-- No Abort Statements
-- (No_Abort_Statements, Max_Asynchronous_Select_Nesting => 0)
-- PO are at library level
-- No Requeue
-- None of the tasks will terminate (no need for finalization)
-- This interface is intended to be used in the ravenscar and restricted
-- profiles, the compiler is responsible for ensuring that the conditions
-- mentioned above are respected, except for the No_Entry_Queue restriction
-- that is checked dynamically in this package, since the check cannot be
-- performed at compile time, and is relatively cheap (see PO_Do_Or_Queue,
-- Service_Entry).
pragma Polling (Off);
-- Turn off polling, we do not want polling to take place during tasking
-- operations. It can cause infinite loops and other problems.
pragma Suppress (All_Checks);
-- Why is this required ???
with Ada.Exceptions;
with System.Task_Primitives.Operations;
with System.Parameters;
package body System.Tasking.Protected_Objects.Single_Entry is
package STPO renames System.Task_Primitives.Operations;
use Parameters;
-----------------------
-- Local Subprograms --
-----------------------
procedure Send_Program_Error (Entry_Call : Entry_Call_Link);
pragma Inline (Send_Program_Error);
-- Raise Program_Error in the caller of the specified entry call
--------------------------
-- Entry Calls Handling --
--------------------------
procedure Wakeup_Entry_Caller (Entry_Call : Entry_Call_Link);
pragma Inline (Wakeup_Entry_Caller);
-- This is called at the end of service of an entry call, to abort the
-- caller if he is in an abortable part, and to wake up the caller if he
-- is on Entry_Caller_Sleep. Call it holding the lock of Entry_Call.Self.
procedure Wait_For_Completion (Entry_Call : Entry_Call_Link);
pragma Inline (Wait_For_Completion);
-- This procedure suspends the calling task until the specified entry call
-- has either been completed or cancelled. On exit, the call will not be
-- queued. This waits for calls on protected entries.
-- Call this only when holding Self_ID locked.
procedure Check_Exception
(Self_ID : Task_Id;
Entry_Call : Entry_Call_Link);
pragma Inline (Check_Exception);
-- Raise any pending exception from the Entry_Call. This should be called
-- at the end of every compiler interface procedure that implements an
-- entry call. The caller should not be holding any locks, or there will
-- be deadlock.
procedure PO_Do_Or_Queue
(Object : Protection_Entry_Access;
Entry_Call : Entry_Call_Link);
-- This procedure executes or queues an entry call, depending on the status
-- of the corresponding barrier. The specified object is assumed locked.
---------------------
-- Check_Exception --
---------------------
procedure Check_Exception
(Self_ID : Task_Id;
Entry_Call : Entry_Call_Link)
is
pragma Warnings (Off, Self_ID);
procedure Internal_Raise (X : Ada.Exceptions.Exception_Id);
pragma Import (C, Internal_Raise, "__gnat_raise_with_msg");
use type Ada.Exceptions.Exception_Id;
E : constant Ada.Exceptions.Exception_Id :=
Entry_Call.Exception_To_Raise;
begin
if E /= Ada.Exceptions.Null_Id then
Internal_Raise (E);
end if;
end Check_Exception;
------------------------
-- Send_Program_Error --
------------------------
procedure Send_Program_Error (Entry_Call : Entry_Call_Link) is
Caller : constant Task_Id := Entry_Call.Self;
begin
Entry_Call.Exception_To_Raise := Program_Error'Identity;
if Single_Lock then
STPO.Lock_RTS;
end if;
STPO.Write_Lock (Caller);
Wakeup_Entry_Caller (Entry_Call);
STPO.Unlock (Caller);
if Single_Lock then
STPO.Unlock_RTS;
end if;
end Send_Program_Error;
-------------------------
-- Wait_For_Completion --
-------------------------
procedure Wait_For_Completion (Entry_Call : Entry_Call_Link) is
Self_Id : constant Task_Id := Entry_Call.Self;
begin
Self_Id.Common.State := Entry_Caller_Sleep;
STPO.Sleep (Self_Id, Entry_Caller_Sleep);
Self_Id.Common.State := Runnable;
end Wait_For_Completion;
-------------------------
-- Wakeup_Entry_Caller --
-------------------------
-- This is called at the end of service of an entry call, to abort the
-- caller if he is in an abortable part, and to wake up the caller if it
-- is on Entry_Caller_Sleep. It assumes that the call is already off-queue.
-- (This enforces the rule that a task must be off-queue if its state is
-- Done or Cancelled.) Call it holding the lock of Entry_Call.Self.
-- The caller is waiting on Entry_Caller_Sleep, in Wait_For_Completion.
procedure Wakeup_Entry_Caller
(Entry_Call : Entry_Call_Link)
is
Caller : constant Task_Id := Entry_Call.Self;
begin
pragma Assert
(Caller.Common.State /= Terminated and then
Caller.Common.State /= Unactivated);
Entry_Call.State := Done;
STPO.Wakeup (Caller, Entry_Caller_Sleep);
end Wakeup_Entry_Caller;
-----------------------
-- Restricted GNARLI --
-----------------------
--------------------------------------------
-- Exceptional_Complete_Single_Entry_Body --
--------------------------------------------
procedure Exceptional_Complete_Single_Entry_Body
(Object : Protection_Entry_Access;
Ex : Ada.Exceptions.Exception_Id)
is
begin
Object.Call_In_Progress.Exception_To_Raise := Ex;
end Exceptional_Complete_Single_Entry_Body;
---------------------------------
-- Initialize_Protection_Entry --
---------------------------------
procedure Initialize_Protection_Entry
(Object : Protection_Entry_Access;
Ceiling_Priority : Integer;
Compiler_Info : System.Address;
Entry_Body : Entry_Body_Access)
is
begin
Initialize_Protection (Object.Common'Access, Ceiling_Priority);
Object.Compiler_Info := Compiler_Info;
Object.Call_In_Progress := null;
Object.Entry_Body := Entry_Body;
Object.Entry_Queue := null;
end Initialize_Protection_Entry;
----------------
-- Lock_Entry --
----------------
-- Compiler interface only
-- Do not call this procedure from within the run-time system.
procedure Lock_Entry (Object : Protection_Entry_Access) is
begin
Lock (Object.Common'Access);
end Lock_Entry;
--------------------------
-- Lock_Read_Only_Entry --
--------------------------
-- Compiler interface only
-- Do not call this procedure from within the runtime system
procedure Lock_Read_Only_Entry (Object : Protection_Entry_Access) is
begin
Lock_Read_Only (Object.Common'Access);
end Lock_Read_Only_Entry;
--------------------
-- PO_Do_Or_Queue --
--------------------
procedure PO_Do_Or_Queue
(Object : Protection_Entry_Access;
Entry_Call : Entry_Call_Link)
is
Barrier_Value : Boolean;
begin
-- When the Action procedure for an entry body returns, it must be
-- completed (having called [Exceptional_]Complete_Entry_Body).
Barrier_Value := Object.Entry_Body.Barrier (Object.Compiler_Info, 1);
if Barrier_Value then
if Object.Call_In_Progress /= null then
-- This violates the No_Entry_Queue restriction, send
-- Program_Error to the caller.
Send_Program_Error (Entry_Call);
return;
end if;
Object.Call_In_Progress := Entry_Call;
Object.Entry_Body.Action
(Object.Compiler_Info, Entry_Call.Uninterpreted_Data, 1);
Object.Call_In_Progress := null;
if Single_Lock then
STPO.Lock_RTS;
end if;
STPO.Write_Lock (Entry_Call.Self);
Wakeup_Entry_Caller (Entry_Call);
STPO.Unlock (Entry_Call.Self);
if Single_Lock then
STPO.Unlock_RTS;
end if;
else
pragma Assert (Entry_Call.Mode = Simple_Call);
if Object.Entry_Queue /= null then
-- This violates the No_Entry_Queue restriction, send
-- Program_Error to the caller.
Send_Program_Error (Entry_Call);
return;
else
Object.Entry_Queue := Entry_Call;
end if;
end if;
exception
when others =>
Send_Program_Error (Entry_Call);
end PO_Do_Or_Queue;
---------------------------
-- Protected_Count_Entry --
---------------------------
function Protected_Count_Entry (Object : Protection_Entry) return Natural is
begin
if Object.Entry_Queue /= null then
return 1;
else
return 0;
end if;
end Protected_Count_Entry;
---------------------------------
-- Protected_Single_Entry_Call --
---------------------------------
procedure Protected_Single_Entry_Call
(Object : Protection_Entry_Access;
Uninterpreted_Data : System.Address)
is
Self_Id : constant Task_Id := STPO.Self;
Entry_Call : Entry_Call_Record renames
Self_Id.Entry_Calls (Self_Id.Entry_Calls'First);
begin
-- If pragma Detect_Blocking is active then Program_Error must be
-- raised if this potentially blocking operation is called from a
-- protected action.
if Detect_Blocking
and then Self_Id.Common.Protected_Action_Nesting > 0
then
raise Program_Error with "potentially blocking operation";
end if;
Lock_Entry (Object);
Entry_Call.Mode := Simple_Call;
Entry_Call.State := Now_Abortable;
Entry_Call.Uninterpreted_Data := Uninterpreted_Data;
Entry_Call.Exception_To_Raise := Ada.Exceptions.Null_Id;
PO_Do_Or_Queue (Object, Entry_Call'Access);
Unlock_Entry (Object);
-- The call is either `Done' or not. It cannot be cancelled since there
-- is no ATC construct.
pragma Assert (Entry_Call.State /= Cancelled);
if Entry_Call.State /= Done then
if Single_Lock then
STPO.Lock_RTS;
end if;
STPO.Write_Lock (Self_Id);
Wait_For_Completion (Entry_Call'Access);
STPO.Unlock (Self_Id);
if Single_Lock then
STPO.Unlock_RTS;
end if;
end if;
Check_Exception (Self_Id, Entry_Call'Access);
end Protected_Single_Entry_Call;
-----------------------------------
-- Protected_Single_Entry_Caller --
-----------------------------------
function Protected_Single_Entry_Caller
(Object : Protection_Entry) return Task_Id
is
begin
return Object.Call_In_Progress.Self;
end Protected_Single_Entry_Caller;
-------------------
-- Service_Entry --
-------------------
procedure Service_Entry (Object : Protection_Entry_Access) is
Entry_Call : constant Entry_Call_Link := Object.Entry_Queue;
Caller : Task_Id;
begin
if Entry_Call /= null
and then Object.Entry_Body.Barrier (Object.Compiler_Info, 1)
then
Object.Entry_Queue := null;
if Object.Call_In_Progress /= null then
-- Violation of No_Entry_Queue restriction, raise exception
Send_Program_Error (Entry_Call);
Unlock_Entry (Object);
return;
end if;
Object.Call_In_Progress := Entry_Call;
Object.Entry_Body.Action
(Object.Compiler_Info, Entry_Call.Uninterpreted_Data, 1);
Object.Call_In_Progress := null;
Caller := Entry_Call.Self;
Unlock_Entry (Object);
if Single_Lock then
STPO.Lock_RTS;
end if;
STPO.Write_Lock (Caller);
Wakeup_Entry_Caller (Entry_Call);
STPO.Unlock (Caller);
if Single_Lock then
STPO.Unlock_RTS;
end if;
else
-- Just unlock the entry
Unlock_Entry (Object);
end if;
exception
when others =>
Send_Program_Error (Entry_Call);
Unlock_Entry (Object);
end Service_Entry;
------------------
-- Unlock_Entry --
------------------
procedure Unlock_Entry (Object : Protection_Entry_Access) is
begin
Unlock (Object.Common'Access);
end Unlock_Entry;
end System.Tasking.Protected_Objects.Single_Entry;
|
--
-- Copyright 2018 The wookey project team <wookey@ssi.gouv.fr>
-- - Ryad Benadjila
-- - Arnauld Michelizza
-- - Mathieu Renard
-- - Philippe Thierry
-- - Philippe Trebuchet
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
--
--
with ewok.debug;
with ewok.exported.gpios; use ewok.exported.gpios;
with soc.gpio; use type soc.gpio.t_gpio_pin_index;
use type soc.gpio.t_gpio_port_index;
package body ewok.gpio
with spark_mode => off
is
function to_pin_alt_func
(u : unsigned_32) return soc.gpio.t_pin_alt_func
is
pragma warnings (off);
function conv is new ada.unchecked_conversion
(unsigned_32, soc.gpio.t_pin_alt_func);
pragma warnings (on);
begin
if u > 15 then
raise program_error;
end if;
return conv (u);
end to_pin_alt_func;
function is_used
(ref : ewok.exported.gpios.t_gpio_ref)
return boolean
is
begin
return gpio_points(ref.port, ref.pin).used;
end is_used;
procedure register
(task_id : in ewok.tasks_shared.t_task_id;
device_id : in ewok.devices_shared.t_device_id;
conf_a : in ewok.exported.gpios.t_gpio_config_access;
success : out boolean)
is
ref : constant ewok.exported.gpios.t_gpio_ref := conf_a.all.kref;
begin
if gpio_points(ref.port, ref.pin).used then
pragma DEBUG (debug.log (debug.ERROR, "Registering GPIO: port" &
soc.gpio.t_gpio_port_index'image (ref.port) & ", pin" &
soc.gpio.t_gpio_pin_index'image (ref.pin) & " is already used."));
success := false;
else
gpio_points(ref.port, ref.pin).used := true;
gpio_points(ref.port, ref.pin).task_id := task_id;
gpio_points(ref.port, ref.pin).device_id := device_id;
gpio_points(ref.port, ref.pin).config := conf_a;
success := true;
end if;
end register;
procedure release
(task_id : in ewok.tasks_shared.t_task_id;
device_id : in ewok.devices_shared.t_device_id;
conf_a : in ewok.exported.gpios.t_gpio_config_access)
is
ref : constant ewok.exported.gpios.t_gpio_ref := conf_a.all.kref;
begin
if gpio_points(ref.port, ref.pin).task_id /= task_id or
gpio_points(ref.port, ref.pin).device_id /= device_id
then
raise program_error; -- Should never happen
else
gpio_points(ref.port, ref.pin).used := false;
gpio_points(ref.port, ref.pin).task_id := ID_UNUSED;
gpio_points(ref.port, ref.pin).device_id := ID_DEV_UNUSED;
gpio_points(ref.port, ref.pin).config := NULL;
end if;
end release;
procedure config
(conf : in ewok.exported.gpios.t_gpio_config_access)
is
begin
-- Enable RCC
soc.gpio.enable_clock (conf.all.kref.port);
if conf.all.settings.set_mode then
soc.gpio.set_mode
(conf.all.kref.port,
conf.all.kref.pin,
soc.gpio.t_pin_mode'val
(t_interface_gpio_mode'pos (conf.all.mode)));
end if;
if conf.all.settings.set_type then
soc.gpio.set_type
(conf.all.kref.port,
conf.all.kref.pin,
soc.gpio.t_pin_output_type'val
(t_interface_gpio_type'pos (conf.all.otype)));
end if;
if conf.all.settings.set_speed then
soc.gpio.set_speed
(conf.all.kref.port,
conf.all.kref.pin,
soc.gpio.t_pin_output_speed'val
(t_interface_gpio_speed'pos (conf.all.ospeed)));
end if;
if conf.all.settings.set_pupd then
soc.gpio.set_pupd
(conf.all.kref.port,
conf.all.kref.pin,
soc.gpio.t_pin_pupd'val
(t_interface_gpio_pupd'pos (conf.all.pupd)));
end if;
if conf.all.settings.set_bsr_r then
soc.gpio.set_bsr_r
(conf.all.kref.port,
conf.all.kref.pin,
types.to_bit (conf.all.bsr_r));
end if;
if conf.all.settings.set_bsr_s then
soc.gpio.set_bsr_s
(conf.all.kref.port,
conf.all.kref.pin,
types.to_bit (conf.all.bsr_s));
end if;
-- FIXME - Writing to LCKR register requires a specific sequence
-- describe in section 8.4.8 (RM 00090)
if conf.all.settings.set_lck then
soc.gpio.set_lck
(conf.all.kref.port,
conf.all.kref.pin,
soc.gpio.t_pin_lock'val (conf.all.lck));
end if;
if conf.all.settings.set_af then
soc.gpio.set_af
(conf.all.kref.port,
conf.all.kref.pin,
to_pin_alt_func (conf.all.af));
end if;
end config;
procedure write_pin
(ref : in ewok.exported.gpios.t_gpio_ref;
value : in bit)
is
begin
soc.gpio.write_pin (ref.port, ref.pin, value);
end write_pin;
function read_pin
(ref : ewok.exported.gpios.t_gpio_ref)
return bit
is
value : bit;
begin
soc.gpio.read_pin (ref.port, ref.pin, value);
return value;
end read_pin;
function belong_to
(task_id : ewok.tasks_shared.t_task_id;
ref : ewok.exported.gpios.t_gpio_ref)
return boolean
is
begin
if gpio_points(ref.port, ref.pin).used and
gpio_points(ref.port, ref.pin).task_id = task_id
then
return true;
else
return false;
end if;
end belong_to;
function get_task_id
(ref : in ewok.exported.gpios.t_gpio_ref)
return ewok.tasks_shared.t_task_id
is
begin
return gpio_points(ref.port, ref.pin).task_id;
end get_task_id;
function get_device_id
(ref : in ewok.exported.gpios.t_gpio_ref)
return ewok.devices_shared.t_device_id
is
begin
return gpio_points(ref.port, ref.pin).device_id;
end get_device_id;
function get_config
(ref : in ewok.exported.gpios.t_gpio_ref)
return ewok.exported.gpios.t_gpio_config_access
is
begin
return gpio_points(ref.port, ref.pin).config;
end get_config;
end ewok.gpio;
|
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="11">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>matrixmul</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>a</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>a</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>b</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>b</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>res</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>res</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>104</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>4</id>
<name>a_row_0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>a_row[0]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>130</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>5</id>
<name>a_row_1_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>a_row[1]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>131</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>6</id>
<name>a_row_2_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>a_row[2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>132</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>7</id>
<name>b_copy_0_2_3</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>b_copy[0][2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>133</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name>b_copy_0_2_6</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>b_copy[0][2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>134</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>b_copy_0_2_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>b_copy[0][2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>135</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>b_copy_1_2_3</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>b_copy[1][2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>136</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>b_copy_1_2_6</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>b_copy[1][2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>137</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>b_copy_1_2_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>b_copy[1][2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>138</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name>b_copy_2_2_3</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>b_copy[2][2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>139</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name>b_copy_2_2_6</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>b_copy[2][2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>140</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>b_copy_2_2_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>b_copy[2][2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>141</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name></name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>63</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</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>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>63</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>142</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>indvar_flatten</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>144</item>
<item>145</item>
<item>146</item>
<item>147</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>i</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>65</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>65</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>149</item>
<item>150</item>
<item>151</item>
<item>152</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>j</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>153</item>
<item>154</item>
<item>155</item>
<item>156</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>exitcond_flatten</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>157</item>
<item>159</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>indvar_flatten_next</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>160</item>
<item>162</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>163</item>
<item>164</item>
<item>165</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>exitcond</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>65</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>65</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>331</item>
<item>333</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>j_mid2</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>65</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>65</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>334</item>
<item>335</item>
<item>336</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>i_s</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>63</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>63</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>337</item>
<item>338</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>i_mid2</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>65</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>65</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>339</item>
<item>340</item>
<item>341</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name>tmp</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>342</item>
<item>343</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>tmp_3</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>70</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>70</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>344</item>
<item>345</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name></name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>70</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>70</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>346</item>
<item>347</item>
<item>348</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>a_read</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>72</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>72</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>167</item>
<item>168</item>
</oprand_edges>
<opcode>read</opcode>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>a_row_0_1</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>72</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>72</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>a_row[0]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>169</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name>a_row_1</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>72</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>72</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>a_row[1]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>171</item>
<item>172</item>
<item>174</item>
<item>176</item>
</oprand_edges>
<opcode>partselect</opcode>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name>a_row_2</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>72</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>72</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>a_row[2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>177</item>
<item>178</item>
<item>180</item>
<item>182</item>
</oprand_edges>
<opcode>partselect</opcode>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name></name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>72</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>72</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>183</item>
<item>184</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name></name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>72</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>72</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>185</item>
<item>186</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>51</id>
<name></name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>72</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>72</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>187</item>
<item>188</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>189</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>54</id>
<name></name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>190</item>
<item>191</item>
<item>192</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name>b_copy_0_2_3_load</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>193</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name>b_copy_0_2_6_load</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>194</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name>b_copy_0_2_1_load</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>195</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>59</id>
<name>b_copy_1_2_3_load</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>196</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name>b_copy_1_2_6_load</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>197</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>61</id>
<name>b_copy_1_2_1_load</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>198</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>62</id>
<name>b_copy_2_2_3_load</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>199</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>63</id>
<name>b_copy_2_2_6_load</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>200</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>64</id>
<name>b_copy_2_2_1_load</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>201</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>65</id>
<name>b_read</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>77</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>77</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>202</item>
<item>203</item>
</oprand_edges>
<opcode>read</opcode>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>66</id>
<name>b_copy_0_2_9</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>77</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>77</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>b_copy[0][2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>204</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>67</id>
<name>sel_tmp</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>65</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>65</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>205</item>
<item>207</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>68</id>
<name>b_copy_0_2</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>65</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>65</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>b_copy[0][2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>208</item>
<item>209</item>
<item>210</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_52">
<Value>
<Obj>
<type>0</type>
<id>69</id>
<name>b_copy_0_2_2</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>70</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>70</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>b_copy[0][2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>211</item>
<item>212</item>
<item>213</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_53">
<Value>
<Obj>
<type>0</type>
<id>70</id>
<name>b_copy_0_2_4</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>65</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>65</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>b_copy[0][2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>214</item>
<item>215</item>
<item>216</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_54">
<Value>
<Obj>
<type>0</type>
<id>71</id>
<name>b_copy_0_2_5</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>70</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>70</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>b_copy[0][2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>217</item>
<item>218</item>
<item>219</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_55">
<Value>
<Obj>
<type>0</type>
<id>72</id>
<name>b_copy_0_2_7</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>70</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>70</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>b_copy[0][2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>220</item>
<item>221</item>
<item>222</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_56">
<Value>
<Obj>
<type>0</type>
<id>73</id>
<name>b_copy_1_2_9</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>77</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>77</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>b_copy[1][2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>223</item>
<item>224</item>
<item>225</item>
<item>226</item>
</oprand_edges>
<opcode>partselect</opcode>
</item>
<item class_id_reference="9" object_id="_57">
<Value>
<Obj>
<type>0</type>
<id>74</id>
<name>b_copy_1_2</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>65</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>65</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>b_copy[1][2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>227</item>
<item>228</item>
<item>229</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_58">
<Value>
<Obj>
<type>0</type>
<id>75</id>
<name>b_copy_1_2_2</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>70</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>70</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>b_copy[1][2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>230</item>
<item>231</item>
<item>232</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_59">
<Value>
<Obj>
<type>0</type>
<id>76</id>
<name>b_copy_1_2_4</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>65</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>65</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>b_copy[1][2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>233</item>
<item>234</item>
<item>235</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_60">
<Value>
<Obj>
<type>0</type>
<id>77</id>
<name>b_copy_1_2_5</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>70</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>70</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>b_copy[1][2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>236</item>
<item>237</item>
<item>238</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_61">
<Value>
<Obj>
<type>0</type>
<id>78</id>
<name>b_copy_1_2_7</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>70</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>70</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>b_copy[1][2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>239</item>
<item>240</item>
<item>241</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_62">
<Value>
<Obj>
<type>0</type>
<id>79</id>
<name>b_copy_2_2_9</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>77</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>77</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>b_copy[2][2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>242</item>
<item>243</item>
<item>244</item>
<item>245</item>
</oprand_edges>
<opcode>partselect</opcode>
</item>
<item class_id_reference="9" object_id="_63">
<Value>
<Obj>
<type>0</type>
<id>80</id>
<name>b_copy_2_2</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>65</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>65</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>b_copy[2][2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>246</item>
<item>247</item>
<item>248</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_64">
<Value>
<Obj>
<type>0</type>
<id>81</id>
<name>b_copy_2_2_2</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>70</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>70</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>b_copy[2][2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>249</item>
<item>250</item>
<item>251</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_65">
<Value>
<Obj>
<type>0</type>
<id>82</id>
<name>b_copy_2_2_4</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>65</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>65</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>b_copy[2][2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>252</item>
<item>253</item>
<item>254</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_66">
<Value>
<Obj>
<type>0</type>
<id>83</id>
<name>b_copy_2_2_5</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>70</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>70</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>b_copy[2][2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>255</item>
<item>256</item>
<item>257</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_67">
<Value>
<Obj>
<type>0</type>
<id>84</id>
<name>b_copy_2_2_7</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>70</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>70</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>b_copy[2][2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>258</item>
<item>259</item>
<item>260</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_68">
<Value>
<Obj>
<type>0</type>
<id>85</id>
<name></name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>77</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>77</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>261</item>
<item>262</item>
<item>431</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_69">
<Value>
<Obj>
<type>0</type>
<id>86</id>
<name></name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>77</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>77</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>263</item>
<item>264</item>
<item>432</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_70">
<Value>
<Obj>
<type>0</type>
<id>87</id>
<name></name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>77</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>77</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>265</item>
<item>266</item>
<item>433</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_71">
<Value>
<Obj>
<type>0</type>
<id>88</id>
<name></name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>77</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>77</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>267</item>
<item>268</item>
<item>434</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_72">
<Value>
<Obj>
<type>0</type>
<id>89</id>
<name></name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>77</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>77</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>269</item>
<item>270</item>
<item>435</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_73">
<Value>
<Obj>
<type>0</type>
<id>90</id>
<name></name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>77</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>77</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>271</item>
<item>272</item>
<item>436</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_74">
<Value>
<Obj>
<type>0</type>
<id>91</id>
<name></name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>77</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>77</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>273</item>
<item>274</item>
<item>437</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_75">
<Value>
<Obj>
<type>0</type>
<id>92</id>
<name></name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>77</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>77</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>275</item>
<item>276</item>
<item>438</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_76">
<Value>
<Obj>
<type>0</type>
<id>93</id>
<name></name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>77</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>77</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>277</item>
<item>278</item>
<item>439</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_77">
<Value>
<Obj>
<type>0</type>
<id>94</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>279</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_78">
<Value>
<Obj>
<type>0</type>
<id>96</id>
<name>a_row_0_load</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>280</item>
<item>442</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_79">
<Value>
<Obj>
<type>0</type>
<id>97</id>
<name>a_row_1_1_load</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>281</item>
<item>441</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_80">
<Value>
<Obj>
<type>0</type>
<id>98</id>
<name>a_row_2_1_load</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>282</item>
<item>440</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_81">
<Value>
<Obj>
<type>0</type>
<id>99</id>
<name>b_copy_0_2_3_load_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>283</item>
<item>451</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_82">
<Value>
<Obj>
<type>0</type>
<id>100</id>
<name>b_copy_0_2_6_load_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>284</item>
<item>450</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_83">
<Value>
<Obj>
<type>0</type>
<id>101</id>
<name>b_copy_0_2_1_load_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>285</item>
<item>449</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_84">
<Value>
<Obj>
<type>0</type>
<id>102</id>
<name>b_copy_1_2_3_load_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>286</item>
<item>448</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_85">
<Value>
<Obj>
<type>0</type>
<id>103</id>
<name>b_copy_1_2_6_load_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>287</item>
<item>447</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_86">
<Value>
<Obj>
<type>0</type>
<id>104</id>
<name>b_copy_1_2_1_load_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>288</item>
<item>446</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_87">
<Value>
<Obj>
<type>0</type>
<id>105</id>
<name>b_copy_2_2_3_load_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>289</item>
<item>445</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_88">
<Value>
<Obj>
<type>0</type>
<id>106</id>
<name>b_copy_2_2_6_load_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>290</item>
<item>444</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_89">
<Value>
<Obj>
<type>0</type>
<id>107</id>
<name>b_copy_2_2_1_load_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>291</item>
<item>443</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_90">
<Value>
<Obj>
<type>0</type>
<id>108</id>
<name>tmp_s</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>292</item>
</oprand_edges>
<opcode>sext</opcode>
</item>
<item class_id_reference="9" object_id="_91">
<Value>
<Obj>
<type>0</type>
<id>109</id>
<name>tmp_1</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>65</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>65</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>294</item>
<item>295</item>
<item>296</item>
<item>297</item>
<item>298</item>
</oprand_edges>
<opcode>mux</opcode>
</item>
<item class_id_reference="9" object_id="_92">
<Value>
<Obj>
<type>0</type>
<id>110</id>
<name>tmp_5</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>299</item>
</oprand_edges>
<opcode>sext</opcode>
</item>
<item class_id_reference="9" object_id="_93">
<Value>
<Obj>
<type>0</type>
<id>111</id>
<name>tmp_6</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>300</item>
<item>301</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_94">
<Value>
<Obj>
<type>0</type>
<id>112</id>
<name>tmp_5_1</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>302</item>
</oprand_edges>
<opcode>sext</opcode>
</item>
<item class_id_reference="9" object_id="_95">
<Value>
<Obj>
<type>0</type>
<id>113</id>
<name>tmp_7</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>65</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>65</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>303</item>
<item>304</item>
<item>305</item>
<item>306</item>
<item>307</item>
</oprand_edges>
<opcode>mux</opcode>
</item>
<item class_id_reference="9" object_id="_96">
<Value>
<Obj>
<type>0</type>
<id>114</id>
<name>tmp_8_1</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>308</item>
</oprand_edges>
<opcode>sext</opcode>
</item>
<item class_id_reference="9" object_id="_97">
<Value>
<Obj>
<type>0</type>
<id>115</id>
<name>tmp_10_1</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>309</item>
<item>310</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_98">
<Value>
<Obj>
<type>0</type>
<id>116</id>
<name>tmp_5_2</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>311</item>
</oprand_edges>
<opcode>sext</opcode>
</item>
<item class_id_reference="9" object_id="_99">
<Value>
<Obj>
<type>0</type>
<id>117</id>
<name>tmp_8</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>65</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>65</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>312</item>
<item>313</item>
<item>314</item>
<item>315</item>
<item>316</item>
</oprand_edges>
<opcode>mux</opcode>
</item>
<item class_id_reference="9" object_id="_100">
<Value>
<Obj>
<type>0</type>
<id>118</id>
<name>tmp_8_2</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>317</item>
</oprand_edges>
<opcode>sext</opcode>
</item>
<item class_id_reference="9" object_id="_101">
<Value>
<Obj>
<type>0</type>
<id>119</id>
<name>tmp_10_2</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>318</item>
<item>319</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_102">
<Value>
<Obj>
<type>0</type>
<id>120</id>
<name>tmp9</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>320</item>
<item>321</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_103">
<Value>
<Obj>
<type>0</type>
<id>121</id>
<name>tmp_11_2</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>322</item>
<item>323</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_104">
<Value>
<Obj>
<type>0</type>
<id>122</id>
<name></name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>325</item>
<item>326</item>
<item>327</item>
</oprand_edges>
<opcode>write</opcode>
</item>
<item class_id_reference="9" object_id="_105">
<Value>
<Obj>
<type>0</type>
<id>124</id>
<name>j_1</name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>65</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>65</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>328</item>
<item>329</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_106">
<Value>
<Obj>
<type>0</type>
<id>125</id>
<name></name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>65</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>65</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>330</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_107">
<Value>
<Obj>
<type>0</type>
<id>127</id>
<name></name>
<fileName>matrixmul.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</fileDirectory>
<lineNumber>85</lineNumber>
<contextFuncName>matrixmul</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Optimization/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>matrixmul.cpp</first>
<second>matrixmul</second>
</first>
<second>85</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>11</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_108">
<Value>
<Obj>
<type>2</type>
<id>129</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="_109">
<Value>
<Obj>
<type>2</type>
<id>143</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_110">
<Value>
<Obj>
<type>2</type>
<id>148</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_111">
<Value>
<Obj>
<type>2</type>
<id>158</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>9</content>
</item>
<item class_id_reference="16" object_id="_112">
<Value>
<Obj>
<type>2</type>
<id>161</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_113">
<Value>
<Obj>
<type>2</type>
<id>173</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_114">
<Value>
<Obj>
<type>2</type>
<id>175</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>15</content>
</item>
<item class_id_reference="16" object_id="_115">
<Value>
<Obj>
<type>2</type>
<id>179</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>16</content>
</item>
<item class_id_reference="16" object_id="_116">
<Value>
<Obj>
<type>2</type>
<id>181</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>23</content>
</item>
<item class_id_reference="16" object_id="_117">
<Value>
<Obj>
<type>2</type>
<id>206</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_118">
<Value>
<Obj>
<type>2</type>
<id>332</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<const_type>0</const_type>
<content>3</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>8</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_119">
<Obj>
<type>3</type>
<id>24</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>13</count>
<item_version>0</item_version>
<item>4</item>
<item>5</item>
<item>6</item>
<item>7</item>
<item>8</item>
<item>9</item>
<item>10</item>
<item>11</item>
<item>12</item>
<item>13</item>
<item>14</item>
<item>15</item>
<item>23</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_120">
<Obj>
<type>3</type>
<id>31</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>6</count>
<item_version>0</item_version>
<item>25</item>
<item>26</item>
<item>27</item>
<item>28</item>
<item>29</item>
<item>30</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_121">
<Obj>
<type>3</type>
<id>44</id>
<name>.reset</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>7</count>
<item_version>0</item_version>
<item>34</item>
<item>35</item>
<item>36</item>
<item>37</item>
<item>38</item>
<item>42</item>
<item>43</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_122">
<Obj>
<type>3</type>
<id>53</id>
<name>.preheader5.0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>8</count>
<item_version>0</item_version>
<item>45</item>
<item>46</item>
<item>47</item>
<item>48</item>
<item>49</item>
<item>50</item>
<item>51</item>
<item>52</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_123">
<Obj>
<type>3</type>
<id>55</id>
<name>.loopexit6</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_124">
<Obj>
<type>3</type>
<id>95</id>
<name>.preheader.preheader_ifconv</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>39</count>
<item_version>0</item_version>
<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>
<item>67</item>
<item>68</item>
<item>69</item>
<item>70</item>
<item>71</item>
<item>72</item>
<item>73</item>
<item>74</item>
<item>75</item>
<item>76</item>
<item>77</item>
<item>78</item>
<item>79</item>
<item>80</item>
<item>81</item>
<item>82</item>
<item>83</item>
<item>84</item>
<item>85</item>
<item>86</item>
<item>87</item>
<item>88</item>
<item>89</item>
<item>90</item>
<item>91</item>
<item>92</item>
<item>93</item>
<item>94</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_125">
<Obj>
<type>3</type>
<id>126</id>
<name>.loopexit</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>29</count>
<item_version>0</item_version>
<item>96</item>
<item>97</item>
<item>98</item>
<item>99</item>
<item>100</item>
<item>101</item>
<item>102</item>
<item>103</item>
<item>104</item>
<item>105</item>
<item>106</item>
<item>107</item>
<item>108</item>
<item>109</item>
<item>110</item>
<item>111</item>
<item>112</item>
<item>113</item>
<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>124</item>
<item>125</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_126">
<Obj>
<type>3</type>
<id>128</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>127</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>226</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_127">
<id>130</id>
<edge_type>1</edge_type>
<source_obj>129</source_obj>
<sink_obj>4</sink_obj>
</item>
<item class_id_reference="20" object_id="_128">
<id>131</id>
<edge_type>1</edge_type>
<source_obj>129</source_obj>
<sink_obj>5</sink_obj>
</item>
<item class_id_reference="20" object_id="_129">
<id>132</id>
<edge_type>1</edge_type>
<source_obj>129</source_obj>
<sink_obj>6</sink_obj>
</item>
<item class_id_reference="20" object_id="_130">
<id>133</id>
<edge_type>1</edge_type>
<source_obj>129</source_obj>
<sink_obj>7</sink_obj>
</item>
<item class_id_reference="20" object_id="_131">
<id>134</id>
<edge_type>1</edge_type>
<source_obj>129</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_132">
<id>135</id>
<edge_type>1</edge_type>
<source_obj>129</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_133">
<id>136</id>
<edge_type>1</edge_type>
<source_obj>129</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_134">
<id>137</id>
<edge_type>1</edge_type>
<source_obj>129</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_135">
<id>138</id>
<edge_type>1</edge_type>
<source_obj>129</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_136">
<id>139</id>
<edge_type>1</edge_type>
<source_obj>129</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_137">
<id>140</id>
<edge_type>1</edge_type>
<source_obj>129</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_138">
<id>141</id>
<edge_type>1</edge_type>
<source_obj>129</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_139">
<id>142</id>
<edge_type>2</edge_type>
<source_obj>31</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_140">
<id>144</id>
<edge_type>1</edge_type>
<source_obj>143</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_141">
<id>145</id>
<edge_type>2</edge_type>
<source_obj>24</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_142">
<id>146</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_143">
<id>147</id>
<edge_type>2</edge_type>
<source_obj>126</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_144">
<id>149</id>
<edge_type>1</edge_type>
<source_obj>148</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_145">
<id>150</id>
<edge_type>2</edge_type>
<source_obj>24</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_146">
<id>151</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_147">
<id>152</id>
<edge_type>2</edge_type>
<source_obj>126</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_148">
<id>153</id>
<edge_type>1</edge_type>
<source_obj>148</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_149">
<id>154</id>
<edge_type>2</edge_type>
<source_obj>24</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_150">
<id>155</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_151">
<id>156</id>
<edge_type>2</edge_type>
<source_obj>126</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_152">
<id>157</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_153">
<id>159</id>
<edge_type>1</edge_type>
<source_obj>158</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_154">
<id>160</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_155">
<id>162</id>
<edge_type>1</edge_type>
<source_obj>161</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_156">
<id>163</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_157">
<id>164</id>
<edge_type>2</edge_type>
<source_obj>44</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_158">
<id>165</id>
<edge_type>2</edge_type>
<source_obj>128</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_159">
<id>168</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_160">
<id>169</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_161">
<id>172</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_162">
<id>174</id>
<edge_type>1</edge_type>
<source_obj>173</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_163">
<id>176</id>
<edge_type>1</edge_type>
<source_obj>175</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_164">
<id>178</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_165">
<id>180</id>
<edge_type>1</edge_type>
<source_obj>179</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_166">
<id>182</id>
<edge_type>1</edge_type>
<source_obj>181</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_167">
<id>183</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_168">
<id>184</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_169">
<id>185</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_170">
<id>186</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_171">
<id>187</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>51</sink_obj>
</item>
<item class_id_reference="20" object_id="_172">
<id>188</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>51</sink_obj>
</item>
<item class_id_reference="20" object_id="_173">
<id>189</id>
<edge_type>2</edge_type>
<source_obj>55</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_174">
<id>190</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>54</sink_obj>
</item>
<item class_id_reference="20" object_id="_175">
<id>191</id>
<edge_type>2</edge_type>
<source_obj>126</source_obj>
<sink_obj>54</sink_obj>
</item>
<item class_id_reference="20" object_id="_176">
<id>192</id>
<edge_type>2</edge_type>
<source_obj>95</source_obj>
<sink_obj>54</sink_obj>
</item>
<item class_id_reference="20" object_id="_177">
<id>193</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_178">
<id>194</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>57</sink_obj>
</item>
<item class_id_reference="20" object_id="_179">
<id>195</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>58</sink_obj>
</item>
<item class_id_reference="20" object_id="_180">
<id>196</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>59</sink_obj>
</item>
<item class_id_reference="20" object_id="_181">
<id>197</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_182">
<id>198</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>61</sink_obj>
</item>
<item class_id_reference="20" object_id="_183">
<id>199</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>62</sink_obj>
</item>
<item class_id_reference="20" object_id="_184">
<id>200</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>63</sink_obj>
</item>
<item class_id_reference="20" object_id="_185">
<id>201</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>64</sink_obj>
</item>
<item class_id_reference="20" object_id="_186">
<id>203</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_187">
<id>204</id>
<edge_type>1</edge_type>
<source_obj>65</source_obj>
<sink_obj>66</sink_obj>
</item>
<item class_id_reference="20" object_id="_188">
<id>205</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>67</sink_obj>
</item>
<item class_id_reference="20" object_id="_189">
<id>207</id>
<edge_type>1</edge_type>
<source_obj>206</source_obj>
<sink_obj>67</sink_obj>
</item>
<item class_id_reference="20" object_id="_190">
<id>208</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>68</sink_obj>
</item>
<item class_id_reference="20" object_id="_191">
<id>209</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>68</sink_obj>
</item>
<item class_id_reference="20" object_id="_192">
<id>210</id>
<edge_type>1</edge_type>
<source_obj>66</source_obj>
<sink_obj>68</sink_obj>
</item>
<item class_id_reference="20" object_id="_193">
<id>211</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>69</sink_obj>
</item>
<item class_id_reference="20" object_id="_194">
<id>212</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>69</sink_obj>
</item>
<item class_id_reference="20" object_id="_195">
<id>213</id>
<edge_type>1</edge_type>
<source_obj>68</source_obj>
<sink_obj>69</sink_obj>
</item>
<item class_id_reference="20" object_id="_196">
<id>214</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>70</sink_obj>
</item>
<item class_id_reference="20" object_id="_197">
<id>215</id>
<edge_type>1</edge_type>
<source_obj>66</source_obj>
<sink_obj>70</sink_obj>
</item>
<item class_id_reference="20" object_id="_198">
<id>216</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>70</sink_obj>
</item>
<item class_id_reference="20" object_id="_199">
<id>217</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>71</sink_obj>
</item>
<item class_id_reference="20" object_id="_200">
<id>218</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>71</sink_obj>
</item>
<item class_id_reference="20" object_id="_201">
<id>219</id>
<edge_type>1</edge_type>
<source_obj>70</source_obj>
<sink_obj>71</sink_obj>
</item>
<item class_id_reference="20" object_id="_202">
<id>220</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>72</sink_obj>
</item>
<item class_id_reference="20" object_id="_203">
<id>221</id>
<edge_type>1</edge_type>
<source_obj>66</source_obj>
<sink_obj>72</sink_obj>
</item>
<item class_id_reference="20" object_id="_204">
<id>222</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>72</sink_obj>
</item>
<item class_id_reference="20" object_id="_205">
<id>224</id>
<edge_type>1</edge_type>
<source_obj>65</source_obj>
<sink_obj>73</sink_obj>
</item>
<item class_id_reference="20" object_id="_206">
<id>225</id>
<edge_type>1</edge_type>
<source_obj>173</source_obj>
<sink_obj>73</sink_obj>
</item>
<item class_id_reference="20" object_id="_207">
<id>226</id>
<edge_type>1</edge_type>
<source_obj>175</source_obj>
<sink_obj>73</sink_obj>
</item>
<item class_id_reference="20" object_id="_208">
<id>227</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_209">
<id>228</id>
<edge_type>1</edge_type>
<source_obj>61</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_210">
<id>229</id>
<edge_type>1</edge_type>
<source_obj>73</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_211">
<id>230</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>75</sink_obj>
</item>
<item class_id_reference="20" object_id="_212">
<id>231</id>
<edge_type>1</edge_type>
<source_obj>61</source_obj>
<sink_obj>75</sink_obj>
</item>
<item class_id_reference="20" object_id="_213">
<id>232</id>
<edge_type>1</edge_type>
<source_obj>74</source_obj>
<sink_obj>75</sink_obj>
</item>
<item class_id_reference="20" object_id="_214">
<id>233</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>76</sink_obj>
</item>
<item class_id_reference="20" object_id="_215">
<id>234</id>
<edge_type>1</edge_type>
<source_obj>73</source_obj>
<sink_obj>76</sink_obj>
</item>
<item class_id_reference="20" object_id="_216">
<id>235</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>76</sink_obj>
</item>
<item class_id_reference="20" object_id="_217">
<id>236</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>77</sink_obj>
</item>
<item class_id_reference="20" object_id="_218">
<id>237</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>77</sink_obj>
</item>
<item class_id_reference="20" object_id="_219">
<id>238</id>
<edge_type>1</edge_type>
<source_obj>76</source_obj>
<sink_obj>77</sink_obj>
</item>
<item class_id_reference="20" object_id="_220">
<id>239</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>78</sink_obj>
</item>
<item class_id_reference="20" object_id="_221">
<id>240</id>
<edge_type>1</edge_type>
<source_obj>73</source_obj>
<sink_obj>78</sink_obj>
</item>
<item class_id_reference="20" object_id="_222">
<id>241</id>
<edge_type>1</edge_type>
<source_obj>59</source_obj>
<sink_obj>78</sink_obj>
</item>
<item class_id_reference="20" object_id="_223">
<id>243</id>
<edge_type>1</edge_type>
<source_obj>65</source_obj>
<sink_obj>79</sink_obj>
</item>
<item class_id_reference="20" object_id="_224">
<id>244</id>
<edge_type>1</edge_type>
<source_obj>179</source_obj>
<sink_obj>79</sink_obj>
</item>
<item class_id_reference="20" object_id="_225">
<id>245</id>
<edge_type>1</edge_type>
<source_obj>181</source_obj>
<sink_obj>79</sink_obj>
</item>
<item class_id_reference="20" object_id="_226">
<id>246</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>80</sink_obj>
</item>
<item class_id_reference="20" object_id="_227">
<id>247</id>
<edge_type>1</edge_type>
<source_obj>64</source_obj>
<sink_obj>80</sink_obj>
</item>
<item class_id_reference="20" object_id="_228">
<id>248</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>80</sink_obj>
</item>
<item class_id_reference="20" object_id="_229">
<id>249</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>81</sink_obj>
</item>
<item class_id_reference="20" object_id="_230">
<id>250</id>
<edge_type>1</edge_type>
<source_obj>64</source_obj>
<sink_obj>81</sink_obj>
</item>
<item class_id_reference="20" object_id="_231">
<id>251</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>81</sink_obj>
</item>
<item class_id_reference="20" object_id="_232">
<id>252</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>82</sink_obj>
</item>
<item class_id_reference="20" object_id="_233">
<id>253</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>82</sink_obj>
</item>
<item class_id_reference="20" object_id="_234">
<id>254</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>82</sink_obj>
</item>
<item class_id_reference="20" object_id="_235">
<id>255</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>83</sink_obj>
</item>
<item class_id_reference="20" object_id="_236">
<id>256</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>83</sink_obj>
</item>
<item class_id_reference="20" object_id="_237">
<id>257</id>
<edge_type>1</edge_type>
<source_obj>82</source_obj>
<sink_obj>83</sink_obj>
</item>
<item class_id_reference="20" object_id="_238">
<id>258</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>84</sink_obj>
</item>
<item class_id_reference="20" object_id="_239">
<id>259</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>84</sink_obj>
</item>
<item class_id_reference="20" object_id="_240">
<id>260</id>
<edge_type>1</edge_type>
<source_obj>62</source_obj>
<sink_obj>84</sink_obj>
</item>
<item class_id_reference="20" object_id="_241">
<id>261</id>
<edge_type>1</edge_type>
<source_obj>81</source_obj>
<sink_obj>85</sink_obj>
</item>
<item class_id_reference="20" object_id="_242">
<id>262</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>85</sink_obj>
</item>
<item class_id_reference="20" object_id="_243">
<id>263</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>86</sink_obj>
</item>
<item class_id_reference="20" object_id="_244">
<id>264</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>86</sink_obj>
</item>
<item class_id_reference="20" object_id="_245">
<id>265</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>87</sink_obj>
</item>
<item class_id_reference="20" object_id="_246">
<id>266</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>87</sink_obj>
</item>
<item class_id_reference="20" object_id="_247">
<id>267</id>
<edge_type>1</edge_type>
<source_obj>75</source_obj>
<sink_obj>88</sink_obj>
</item>
<item class_id_reference="20" object_id="_248">
<id>268</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>88</sink_obj>
</item>
<item class_id_reference="20" object_id="_249">
<id>269</id>
<edge_type>1</edge_type>
<source_obj>77</source_obj>
<sink_obj>89</sink_obj>
</item>
<item class_id_reference="20" object_id="_250">
<id>270</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>89</sink_obj>
</item>
<item class_id_reference="20" object_id="_251">
<id>271</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>90</sink_obj>
</item>
<item class_id_reference="20" object_id="_252">
<id>272</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>90</sink_obj>
</item>
<item class_id_reference="20" object_id="_253">
<id>273</id>
<edge_type>1</edge_type>
<source_obj>69</source_obj>
<sink_obj>91</sink_obj>
</item>
<item class_id_reference="20" object_id="_254">
<id>274</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>91</sink_obj>
</item>
<item class_id_reference="20" object_id="_255">
<id>275</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>92</sink_obj>
</item>
<item class_id_reference="20" object_id="_256">
<id>276</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>92</sink_obj>
</item>
<item class_id_reference="20" object_id="_257">
<id>277</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>93</sink_obj>
</item>
<item class_id_reference="20" object_id="_258">
<id>278</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>93</sink_obj>
</item>
<item class_id_reference="20" object_id="_259">
<id>279</id>
<edge_type>2</edge_type>
<source_obj>126</source_obj>
<sink_obj>94</sink_obj>
</item>
<item class_id_reference="20" object_id="_260">
<id>280</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>96</sink_obj>
</item>
<item class_id_reference="20" object_id="_261">
<id>281</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>97</sink_obj>
</item>
<item class_id_reference="20" object_id="_262">
<id>282</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>98</sink_obj>
</item>
<item class_id_reference="20" object_id="_263">
<id>283</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>99</sink_obj>
</item>
<item class_id_reference="20" object_id="_264">
<id>284</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>100</sink_obj>
</item>
<item class_id_reference="20" object_id="_265">
<id>285</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>101</sink_obj>
</item>
<item class_id_reference="20" object_id="_266">
<id>286</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>102</sink_obj>
</item>
<item class_id_reference="20" object_id="_267">
<id>287</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>103</sink_obj>
</item>
<item class_id_reference="20" object_id="_268">
<id>288</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>104</sink_obj>
</item>
<item class_id_reference="20" object_id="_269">
<id>289</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>105</sink_obj>
</item>
<item class_id_reference="20" object_id="_270">
<id>290</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>106</sink_obj>
</item>
<item class_id_reference="20" object_id="_271">
<id>291</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>107</sink_obj>
</item>
<item class_id_reference="20" object_id="_272">
<id>292</id>
<edge_type>1</edge_type>
<source_obj>96</source_obj>
<sink_obj>108</sink_obj>
</item>
<item class_id_reference="20" object_id="_273">
<id>295</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>109</sink_obj>
</item>
<item class_id_reference="20" object_id="_274">
<id>296</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>109</sink_obj>
</item>
<item class_id_reference="20" object_id="_275">
<id>297</id>
<edge_type>1</edge_type>
<source_obj>101</source_obj>
<sink_obj>109</sink_obj>
</item>
<item class_id_reference="20" object_id="_276">
<id>298</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>109</sink_obj>
</item>
<item class_id_reference="20" object_id="_277">
<id>299</id>
<edge_type>1</edge_type>
<source_obj>109</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_278">
<id>300</id>
<edge_type>1</edge_type>
<source_obj>108</source_obj>
<sink_obj>111</sink_obj>
</item>
<item class_id_reference="20" object_id="_279">
<id>301</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>111</sink_obj>
</item>
<item class_id_reference="20" object_id="_280">
<id>302</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>112</sink_obj>
</item>
<item class_id_reference="20" object_id="_281">
<id>304</id>
<edge_type>1</edge_type>
<source_obj>102</source_obj>
<sink_obj>113</sink_obj>
</item>
<item class_id_reference="20" object_id="_282">
<id>305</id>
<edge_type>1</edge_type>
<source_obj>103</source_obj>
<sink_obj>113</sink_obj>
</item>
<item class_id_reference="20" object_id="_283">
<id>306</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>113</sink_obj>
</item>
<item class_id_reference="20" object_id="_284">
<id>307</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>113</sink_obj>
</item>
<item class_id_reference="20" object_id="_285">
<id>308</id>
<edge_type>1</edge_type>
<source_obj>113</source_obj>
<sink_obj>114</sink_obj>
</item>
<item class_id_reference="20" object_id="_286">
<id>309</id>
<edge_type>1</edge_type>
<source_obj>112</source_obj>
<sink_obj>115</sink_obj>
</item>
<item class_id_reference="20" object_id="_287">
<id>310</id>
<edge_type>1</edge_type>
<source_obj>114</source_obj>
<sink_obj>115</sink_obj>
</item>
<item class_id_reference="20" object_id="_288">
<id>311</id>
<edge_type>1</edge_type>
<source_obj>98</source_obj>
<sink_obj>116</sink_obj>
</item>
<item class_id_reference="20" object_id="_289">
<id>313</id>
<edge_type>1</edge_type>
<source_obj>105</source_obj>
<sink_obj>117</sink_obj>
</item>
<item class_id_reference="20" object_id="_290">
<id>314</id>
<edge_type>1</edge_type>
<source_obj>106</source_obj>
<sink_obj>117</sink_obj>
</item>
<item class_id_reference="20" object_id="_291">
<id>315</id>
<edge_type>1</edge_type>
<source_obj>107</source_obj>
<sink_obj>117</sink_obj>
</item>
<item class_id_reference="20" object_id="_292">
<id>316</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>117</sink_obj>
</item>
<item class_id_reference="20" object_id="_293">
<id>317</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>118</sink_obj>
</item>
<item class_id_reference="20" object_id="_294">
<id>318</id>
<edge_type>1</edge_type>
<source_obj>116</source_obj>
<sink_obj>119</sink_obj>
</item>
<item class_id_reference="20" object_id="_295">
<id>319</id>
<edge_type>1</edge_type>
<source_obj>118</source_obj>
<sink_obj>119</sink_obj>
</item>
<item class_id_reference="20" object_id="_296">
<id>320</id>
<edge_type>1</edge_type>
<source_obj>115</source_obj>
<sink_obj>120</sink_obj>
</item>
<item class_id_reference="20" object_id="_297">
<id>321</id>
<edge_type>1</edge_type>
<source_obj>119</source_obj>
<sink_obj>120</sink_obj>
</item>
<item class_id_reference="20" object_id="_298">
<id>322</id>
<edge_type>1</edge_type>
<source_obj>120</source_obj>
<sink_obj>121</sink_obj>
</item>
<item class_id_reference="20" object_id="_299">
<id>323</id>
<edge_type>1</edge_type>
<source_obj>111</source_obj>
<sink_obj>121</sink_obj>
</item>
<item class_id_reference="20" object_id="_300">
<id>326</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>122</sink_obj>
</item>
<item class_id_reference="20" object_id="_301">
<id>327</id>
<edge_type>1</edge_type>
<source_obj>121</source_obj>
<sink_obj>122</sink_obj>
</item>
<item class_id_reference="20" object_id="_302">
<id>328</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>124</sink_obj>
</item>
<item class_id_reference="20" object_id="_303">
<id>329</id>
<edge_type>1</edge_type>
<source_obj>206</source_obj>
<sink_obj>124</sink_obj>
</item>
<item class_id_reference="20" object_id="_304">
<id>330</id>
<edge_type>2</edge_type>
<source_obj>31</source_obj>
<sink_obj>125</sink_obj>
</item>
<item class_id_reference="20" object_id="_305">
<id>331</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_306">
<id>333</id>
<edge_type>1</edge_type>
<source_obj>332</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_307">
<id>334</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_308">
<id>335</id>
<edge_type>1</edge_type>
<source_obj>148</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_309">
<id>336</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_310">
<id>337</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_311">
<id>338</id>
<edge_type>1</edge_type>
<source_obj>206</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_312">
<id>339</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_313">
<id>340</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_314">
<id>341</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_315">
<id>342</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_316">
<id>343</id>
<edge_type>1</edge_type>
<source_obj>148</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_317">
<id>344</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_318">
<id>345</id>
<edge_type>1</edge_type>
<source_obj>148</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_319">
<id>346</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_320">
<id>347</id>
<edge_type>2</edge_type>
<source_obj>55</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_321">
<id>348</id>
<edge_type>2</edge_type>
<source_obj>53</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_322">
<id>421</id>
<edge_type>2</edge_type>
<source_obj>24</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_323">
<id>422</id>
<edge_type>2</edge_type>
<source_obj>31</source_obj>
<sink_obj>128</sink_obj>
</item>
<item class_id_reference="20" object_id="_324">
<id>423</id>
<edge_type>2</edge_type>
<source_obj>31</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_325">
<id>424</id>
<edge_type>2</edge_type>
<source_obj>44</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_326">
<id>425</id>
<edge_type>2</edge_type>
<source_obj>44</source_obj>
<sink_obj>55</sink_obj>
</item>
<item class_id_reference="20" object_id="_327">
<id>426</id>
<edge_type>2</edge_type>
<source_obj>53</source_obj>
<sink_obj>55</sink_obj>
</item>
<item class_id_reference="20" object_id="_328">
<id>427</id>
<edge_type>2</edge_type>
<source_obj>55</source_obj>
<sink_obj>95</sink_obj>
</item>
<item class_id_reference="20" object_id="_329">
<id>428</id>
<edge_type>2</edge_type>
<source_obj>55</source_obj>
<sink_obj>126</sink_obj>
</item>
<item class_id_reference="20" object_id="_330">
<id>429</id>
<edge_type>2</edge_type>
<source_obj>95</source_obj>
<sink_obj>126</sink_obj>
</item>
<item class_id_reference="20" object_id="_331">
<id>430</id>
<edge_type>2</edge_type>
<source_obj>126</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_332">
<id>431</id>
<edge_type>4</edge_type>
<source_obj>64</source_obj>
<sink_obj>85</sink_obj>
</item>
<item class_id_reference="20" object_id="_333">
<id>432</id>
<edge_type>4</edge_type>
<source_obj>63</source_obj>
<sink_obj>86</sink_obj>
</item>
<item class_id_reference="20" object_id="_334">
<id>433</id>
<edge_type>4</edge_type>
<source_obj>62</source_obj>
<sink_obj>87</sink_obj>
</item>
<item class_id_reference="20" object_id="_335">
<id>434</id>
<edge_type>4</edge_type>
<source_obj>61</source_obj>
<sink_obj>88</sink_obj>
</item>
<item class_id_reference="20" object_id="_336">
<id>435</id>
<edge_type>4</edge_type>
<source_obj>60</source_obj>
<sink_obj>89</sink_obj>
</item>
<item class_id_reference="20" object_id="_337">
<id>436</id>
<edge_type>4</edge_type>
<source_obj>59</source_obj>
<sink_obj>90</sink_obj>
</item>
<item class_id_reference="20" object_id="_338">
<id>437</id>
<edge_type>4</edge_type>
<source_obj>58</source_obj>
<sink_obj>91</sink_obj>
</item>
<item class_id_reference="20" object_id="_339">
<id>438</id>
<edge_type>4</edge_type>
<source_obj>57</source_obj>
<sink_obj>92</sink_obj>
</item>
<item class_id_reference="20" object_id="_340">
<id>439</id>
<edge_type>4</edge_type>
<source_obj>56</source_obj>
<sink_obj>93</sink_obj>
</item>
<item class_id_reference="20" object_id="_341">
<id>440</id>
<edge_type>4</edge_type>
<source_obj>49</source_obj>
<sink_obj>98</sink_obj>
</item>
<item class_id_reference="20" object_id="_342">
<id>441</id>
<edge_type>4</edge_type>
<source_obj>50</source_obj>
<sink_obj>97</sink_obj>
</item>
<item class_id_reference="20" object_id="_343">
<id>442</id>
<edge_type>4</edge_type>
<source_obj>51</source_obj>
<sink_obj>96</sink_obj>
</item>
<item class_id_reference="20" object_id="_344">
<id>443</id>
<edge_type>4</edge_type>
<source_obj>85</source_obj>
<sink_obj>107</sink_obj>
</item>
<item class_id_reference="20" object_id="_345">
<id>444</id>
<edge_type>4</edge_type>
<source_obj>86</source_obj>
<sink_obj>106</sink_obj>
</item>
<item class_id_reference="20" object_id="_346">
<id>445</id>
<edge_type>4</edge_type>
<source_obj>87</source_obj>
<sink_obj>105</sink_obj>
</item>
<item class_id_reference="20" object_id="_347">
<id>446</id>
<edge_type>4</edge_type>
<source_obj>88</source_obj>
<sink_obj>104</sink_obj>
</item>
<item class_id_reference="20" object_id="_348">
<id>447</id>
<edge_type>4</edge_type>
<source_obj>89</source_obj>
<sink_obj>103</sink_obj>
</item>
<item class_id_reference="20" object_id="_349">
<id>448</id>
<edge_type>4</edge_type>
<source_obj>90</source_obj>
<sink_obj>102</sink_obj>
</item>
<item class_id_reference="20" object_id="_350">
<id>449</id>
<edge_type>4</edge_type>
<source_obj>91</source_obj>
<sink_obj>101</sink_obj>
</item>
<item class_id_reference="20" object_id="_351">
<id>450</id>
<edge_type>4</edge_type>
<source_obj>92</source_obj>
<sink_obj>100</sink_obj>
</item>
<item class_id_reference="20" object_id="_352">
<id>451</id>
<edge_type>4</edge_type>
<source_obj>93</source_obj>
<sink_obj>99</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_353">
<mId>1</mId>
<mTag>matrixmul</mTag>
<mType>0</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>13</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_354">
<mId>2</mId>
<mTag>Entry</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_355">
<mId>3</mId>
<mTag>Row_Col</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>6</count>
<item_version>0</item_version>
<item>31</item>
<item>44</item>
<item>53</item>
<item>55</item>
<item>95</item>
<item>126</item>
</basic_blocks>
<mII>1</mII>
<mDepth>4</mDepth>
<mMinTripCount>9</mMinTripCount>
<mMaxTripCount>9</mMaxTripCount>
<mMinLatency>11</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_356">
<mId>4</mId>
<mTag>Return</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>128</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="-1"></fsm>
<res class_id="25" tracking_level="1" version="0" object_id="_357">
<dp_component_resource class_id="26" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_resource>
<dp_expression_resource>
<count>0</count>
<item_version>0</item_version>
</dp_expression_resource>
<dp_fifo_resource>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_resource>
<dp_memory_resource>
<count>0</count>
<item_version>0</item_version>
</dp_memory_resource>
<dp_multiplexer_resource>
<count>0</count>
<item_version>0</item_version>
</dp_multiplexer_resource>
<dp_register_resource>
<count>0</count>
<item_version>0</item_version>
</dp_register_resource>
<dp_component_map class_id="27" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_map>
<dp_expression_map>
<count>0</count>
<item_version>0</item_version>
</dp_expression_map>
<dp_fifo_map>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_map>
<dp_memory_map>
<count>0</count>
<item_version>0</item_version>
</dp_memory_map>
</res>
<node_label_latency class_id="28" tracking_level="0" version="0">
<count>104</count>
<item_version>0</item_version>
<item class_id="29" tracking_level="0" version="0">
<first>4</first>
<second class_id="30" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>5</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>6</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>7</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>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>13</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>62</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>63</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>65</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>66</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>67</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>69</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>70</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>71</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>72</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>73</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>74</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>75</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>76</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>77</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>78</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>79</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>80</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>81</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>82</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>83</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>84</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>85</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>86</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>87</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>88</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>89</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>90</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>91</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>92</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>93</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>94</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>96</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>97</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>98</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>99</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>100</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>101</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>102</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>103</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>104</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>105</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>106</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>107</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>108</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>109</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>110</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>111</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>112</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>113</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>114</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>115</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>116</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>117</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>118</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>119</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>120</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>121</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>122</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>124</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>125</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>127</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="31" tracking_level="0" version="0">
<count>8</count>
<item_version>0</item_version>
<item class_id="32" tracking_level="0" version="0">
<first>24</first>
<second class_id="33" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>1</first>
<second>4</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>2</first>
<second>3</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>95</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>126</first>
<second>
<first>1</first>
<second>4</second>
</second>
</item>
<item>
<first>128</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="34" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="35" tracking_level="1" version="0" object_id="_358">
<region_name>Row_Col</region_name>
<basic_blocks>
<count>6</count>
<item_version>0</item_version>
<item>31</item>
<item>44</item>
<item>53</item>
<item>55</item>
<item>95</item>
<item>126</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>4</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="36" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="37" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="38" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_reg_nodes>
<dp_regname_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="39" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_port_io_nodes>
<port2core class_id="40" 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>
|
-----------------------------------------------------------------------
-- jason-projects -- Module projects
-- Copyright (C) 2016 Stephane.Carrez
-- Written by Stephane.Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
package Jason.Projects is
end Jason.Projects;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S E M _ A U X --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2014, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING3. If not, go to --
-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Package containing utility procedures used throughout the compiler,
-- and also by ASIS so dependencies are limited to ASIS included packages.
-- Historical note. Many of the routines here were originally in Einfo, but
-- Einfo is supposed to be a relatively low level package dealing with the
-- content of entities in the tree, so this package is used for routines that
-- require more than minimal semantic knowledge.
with Alloc; use Alloc;
with Namet; use Namet;
with Table;
with Types; use Types;
with Sinfo; use Sinfo;
package Sem_Aux is
--------------------------------
-- Obsolescent Warnings Table --
--------------------------------
-- This table records entities for which a pragma Obsolescent with a
-- message argument has been processed.
type OWT_Record is record
Ent : Entity_Id;
-- The entity to which the pragma applies
Msg : String_Id;
-- The string containing the message
end record;
package Obsolescent_Warnings is new Table.Table (
Table_Component_Type => OWT_Record,
Table_Index_Type => Int,
Table_Low_Bound => 0,
Table_Initial => Alloc.Obsolescent_Warnings_Initial,
Table_Increment => Alloc.Obsolescent_Warnings_Increment,
Table_Name => "Obsolescent_Warnings");
procedure Initialize;
-- Called at the start of compilation of each new main source file to
-- initialize the allocation of the Obsolescent_Warnings table. Note that
-- Initialize must not be called if Tree_Read is used.
procedure Tree_Read;
-- Initializes Obsolescent_Warnings table from current tree file using the
-- relevant Table.Tree_Read routine.
procedure Tree_Write;
-- Writes out Obsolescent_Warnings table to current tree file using the
-- relevant Table.Tree_Write routine.
-----------------
-- Subprograms --
-----------------
function Ancestor_Subtype (Typ : Entity_Id) return Entity_Id;
-- The argument Id is a type or subtype entity. If the argument is a
-- subtype then it returns the subtype or type from which the subtype was
-- obtained, otherwise it returns Empty.
function Available_View (Ent : Entity_Id) return Entity_Id;
-- Ent denotes an abstract state or a type that may come from a limited
-- with clause. Return the non-limited view of Ent if there is one or Ent
-- if this is not the case.
function Constant_Value (Ent : Entity_Id) return Node_Id;
-- Ent is a variable, constant, named integer, or named real entity. This
-- call obtains the initialization expression for the entity. Will return
-- Empty for a deferred constant whose full view is not available or
-- in some other cases of internal entities, which cannot be treated as
-- constants from the point of view of constant folding. Empty is also
-- returned for variables with no initialization expression.
function Corresponding_Unsigned_Type (Typ : Entity_Id) return Entity_Id;
-- Typ is a signed integer subtype. This routine returns the standard
-- unsigned type with the same Esize as the implementation base type of
-- Typ, e.g. Long_Integer => Long_Unsigned.
function Enclosing_Dynamic_Scope (Ent : Entity_Id) return Entity_Id;
-- For any entity, Ent, returns the closest dynamic scope in which the
-- entity is declared or Standard_Standard for library-level entities.
function First_Discriminant (Typ : Entity_Id) return Entity_Id;
-- Typ is a type with discriminants. The discriminants are the first
-- entities declared in the type, so normally this is equivalent to
-- First_Entity. The exception arises for tagged types, where the tag
-- itself is prepended to the front of the entity chain, so the
-- First_Discriminant function steps past the tag if it is present.
function First_Stored_Discriminant (Typ : Entity_Id) return Entity_Id;
-- Typ is a type with discriminants. Gives the first discriminant stored
-- in an object of this type. In many cases, these are the same as the
-- normal visible discriminants for the type, but in the case of renamed
-- discriminants, this is not always the case.
--
-- For tagged types, and untagged types which are root types or derived
-- types but which do not rename discriminants in their root type, the
-- stored discriminants are the same as the actual discriminants of the
-- type, and hence this function is the same as First_Discriminant.
--
-- For derived untagged types that rename discriminants in the root type
-- this is the first of the discriminants that occur in the root type. To
-- be precise, in this case stored discriminants are entities attached to
-- the entity chain of the derived type which are a copy of the
-- discriminants of the root type. Furthermore their Is_Completely_Hidden
-- flag is set since although they are actually stored in the object, they
-- are not in the set of discriminants that is visible in the type.
--
-- For derived untagged types, the set of stored discriminants are the real
-- discriminants from Gigi's standpoint, i.e. those that will be stored in
-- actual objects of the type.
function First_Subtype (Typ : Entity_Id) return Entity_Id;
-- Applies to all types and subtypes. For types, yields the first subtype
-- of the type. For subtypes, yields the first subtype of the base type of
-- the subtype.
function First_Tag_Component (Typ : Entity_Id) return Entity_Id;
-- Typ must be a tagged record type. This function returns the Entity for
-- the first _Tag field in the record type.
function Get_Binary_Nkind (Op : Entity_Id) return Node_Kind;
-- Op must be an entity with an Ekind of E_Operator. This function returns
-- the Nkind value that would be used to construct a binary operator node
-- referencing this entity. It is an error to call this function if Ekind
-- (Op) /= E_Operator.
function Get_Unary_Nkind (Op : Entity_Id) return Node_Kind;
-- Op must be an entity with an Ekind of E_Operator. This function returns
-- the Nkind value that would be used to construct a unary operator node
-- referencing this entity. It is an error to call this function if Ekind
-- (Op) /= E_Operator.
function Get_Rep_Item
(E : Entity_Id;
Nam : Name_Id;
Check_Parents : Boolean := True) return Node_Id;
-- Searches the Rep_Item chain for a given entity E, for an instance of a
-- rep item (pragma, attribute definition clause, or aspect specification)
-- whose name matches the given name Nam. If Check_Parents is False then it
-- only returns rep item that has been directly specified for E (and not
-- inherited from its parents, if any). If one is found, it is returned,
-- otherwise Empty is returned. A special case is that when Nam is
-- Name_Priority, the call will also find Interrupt_Priority.
function Get_Rep_Item
(E : Entity_Id;
Nam1 : Name_Id;
Nam2 : Name_Id;
Check_Parents : Boolean := True) return Node_Id;
-- Searches the Rep_Item chain for a given entity E, for an instance of a
-- rep item (pragma, attribute definition clause, or aspect specification)
-- whose name matches one of the given names Nam1 or Nam2. If Check_Parents
-- is False then it only returns rep item that has been directly specified
-- for E (and not inherited from its parents, if any). If one is found, it
-- is returned, otherwise Empty is returned. A special case is that when
-- one of the given names is Name_Priority, the call will also find
-- Interrupt_Priority.
function Get_Rep_Pragma
(E : Entity_Id;
Nam : Name_Id;
Check_Parents : Boolean := True) return Node_Id;
-- Searches the Rep_Item chain for a given entity E, for an instance of a
-- representation pragma whose name matches the given name Nam. If
-- Check_Parents is False then it only returns representation pragma that
-- has been directly specified for E (and not inherited from its parents,
-- if any). If one is found and if it is the first rep item in the list
-- that matches Nam, it is returned, otherwise Empty is returned. A special
-- case is that when Nam is Name_Priority, the call will also find
-- Interrupt_Priority.
function Get_Rep_Pragma
(E : Entity_Id;
Nam1 : Name_Id;
Nam2 : Name_Id;
Check_Parents : Boolean := True) return Node_Id;
-- Searches the Rep_Item chain for a given entity E, for an instance of a
-- representation pragma whose name matches one of the given names Nam1 or
-- Nam2. If Check_Parents is False then it only returns representation
-- pragma that has been directly specified for E (and not inherited from
-- its parents, if any). If one is found and if it is the first rep item in
-- the list that matches one of the given names, it is returned, otherwise
-- Empty is returned. A special case is that when one of the given names is
-- Name_Priority, the call will also find Interrupt_Priority.
function Has_Rep_Item
(E : Entity_Id;
Nam : Name_Id;
Check_Parents : Boolean := True) return Boolean;
-- Searches the Rep_Item chain for the given entity E, for an instance of a
-- rep item (pragma, attribute definition clause, or aspect specification)
-- with the given name Nam. If Check_Parents is False then it only checks
-- for a rep item that has been directly specified for E (and not inherited
-- from its parents, if any). If found then True is returned, otherwise
-- False indicates that no matching entry was found.
function Has_Rep_Item
(E : Entity_Id;
Nam1 : Name_Id;
Nam2 : Name_Id;
Check_Parents : Boolean := True) return Boolean;
-- Searches the Rep_Item chain for the given entity E, for an instance of a
-- rep item (pragma, attribute definition clause, or aspect specification)
-- with the given names Nam1 or Nam2. If Check_Parents is False then it
-- only checks for a rep item that has been directly specified for E (and
-- not inherited from its parents, if any). If found then True is returned,
-- otherwise False indicates that no matching entry was found.
function Has_Rep_Pragma
(E : Entity_Id;
Nam : Name_Id;
Check_Parents : Boolean := True) return Boolean;
-- Searches the Rep_Item chain for the given entity E, for an instance of a
-- representation pragma with the given name Nam. If Check_Parents is False
-- then it only checks for a representation pragma that has been directly
-- specified for E (and not inherited from its parents, if any). If found
-- and if it is the first rep item in the list that matches Nam then True
-- is returned, otherwise False indicates that no matching entry was found.
function Has_Rep_Pragma
(E : Entity_Id;
Nam1 : Name_Id;
Nam2 : Name_Id;
Check_Parents : Boolean := True) return Boolean;
-- Searches the Rep_Item chain for the given entity E, for an instance of a
-- representation pragma with the given names Nam1 or Nam2. If
-- Check_Parents is False then it only checks for a rep item that has been
-- directly specified for E (and not inherited from its parents, if any).
-- If found and if it is the first rep item in the list that matches one of
-- the given names then True is returned, otherwise False indicates that no
-- matching entry was found.
function Has_External_Tag_Rep_Clause (T : Entity_Id) return Boolean;
-- Defined in tagged types. Set if an External_Tag rep. clause has been
-- given for this type. Use to avoid the generation of the default
-- External_Tag.
--
-- Note: we used to use an entity flag for this purpose, but that was wrong
-- because it was not propagated from the private view to the full view. We
-- could have added that propagation, but it would have been an annoying
-- irregularity compared to other representation aspects, and the cost of
-- looking up the aspect when needed is small.
function Has_Unconstrained_Elements (T : Entity_Id) return Boolean;
-- True if T has discriminants and is unconstrained, or is an array type
-- whose element type Has_Unconstrained_Elements.
function Has_Variant_Part (Typ : Entity_Id) return Boolean;
-- Return True if the first subtype of Typ is a discriminated record type
-- which has a variant part. False otherwise.
function In_Generic_Body (Id : Entity_Id) return Boolean;
-- Determine whether entity Id appears inside a generic body
function Initialization_Suppressed (Typ : Entity_Id) return Boolean;
pragma Inline (Initialization_Suppressed);
-- Returns True if initialization should be suppressed for the given type
-- or subtype. This is true if Suppress_Initialization is set either for
-- the subtype itself, or for the corresponding base type.
function Is_Body (N : Node_Id) return Boolean;
-- Determine whether an arbitrary node denotes a body
function Is_By_Copy_Type (Ent : Entity_Id) return Boolean;
-- Ent is any entity. Returns True if Ent is a type entity where the type
-- is required to be passed by copy, as defined in (RM 6.2(3)).
function Is_By_Reference_Type (Ent : Entity_Id) return Boolean;
-- Ent is any entity. Returns True if Ent is a type entity where the type
-- is required to be passed by reference, as defined in (RM 6.2(4-9)).
function Is_Derived_Type (Ent : Entity_Id) return Boolean;
-- Determines if the given entity Ent is a derived type. Result is always
-- false if argument is not a type.
function Is_Generic_Formal (E : Entity_Id) return Boolean;
-- Determine whether E is a generic formal parameter. In particular this is
-- used to set the visibility of generic formals of a generic package
-- declared with a box or with partial parameterization.
function Is_Indefinite_Subtype (Ent : Entity_Id) return Boolean;
-- Ent is any entity. Determines if given entity is an unconstrained array
-- type or subtype, a discriminated record type or subtype with no initial
-- discriminant values or a class wide type or subtype and returns True if
-- so. False for other type entities, or any entities that are not types.
function Is_Immutably_Limited_Type (Ent : Entity_Id) return Boolean;
-- Implements definition in Ada 2012 RM-7.5 (8.1/3). This differs from the
-- following predicate in that an untagged record with immutably limited
-- components is NOT by itself immutably limited. This matters, e.g. when
-- checking the legality of an access to the current instance.
function Is_Limited_View (Ent : Entity_Id) return Boolean;
-- Ent is any entity. True for a type that is "inherently" limited (i.e.
-- cannot become nonlimited). From the Ada 2005 RM-7.5(8.1/2), "a type with
-- a part that is of a task, protected, or explicitly limited record type".
-- These are the types that are defined as return-by-reference types in Ada
-- 95 (see RM95-6.5(11-16)). In Ada 2005, these are the types that require
-- build-in-place for function calls. Note that build-in-place is allowed
-- for other types, too. This is also used for identifying pure procedures
-- whose calls should not be eliminated (RM 10.2.1(18/2)).
function Is_Limited_Type (Ent : Entity_Id) return Boolean;
-- Ent is any entity. Returns true if Ent is a limited type (limited
-- private type, limited interface type, task type, protected type,
-- composite containing a limited component, or a subtype of any of
-- these types). This older routine overlaps with the previous one, this
-- should be cleaned up???
function Nearest_Ancestor (Typ : Entity_Id) return Entity_Id;
-- Given a subtype Typ, this function finds out the nearest ancestor from
-- which constraints and predicates are inherited. There is no simple link
-- for doing this, consider:
--
-- subtype R is Integer range 1 .. 10;
-- type T is new R;
--
-- In this case the nearest ancestor is R, but the Etype of T'Base will
-- point to R'Base, so we have to go rummaging in the declarations to get
-- this information. It is used for making sure we freeze this before we
-- freeze Typ, and also for retrieving inherited predicate information.
-- For the case of base types or first subtypes, there is no useful entity
-- to return, so Empty is returned.
--
-- Note: this is similar to Ancestor_Subtype except that it also deals
-- with the case of derived types.
function Nearest_Dynamic_Scope (Ent : Entity_Id) return Entity_Id;
-- This is similar to Enclosing_Dynamic_Scope except that if Ent is itself
-- a dynamic scope, then it is returned. Otherwise the result is the same
-- as that returned by Enclosing_Dynamic_Scope.
function Next_Tag_Component (Tag : Entity_Id) return Entity_Id;
-- Tag must be an entity representing a _Tag field of a tagged record.
-- The result returned is the next _Tag field in this record, or Empty
-- if this is the last such field.
function Number_Discriminants (Typ : Entity_Id) return Pos;
-- Typ is a type with discriminants, yields number of discriminants in type
function Object_Type_Has_Constrained_Partial_View
(Typ : Entity_Id;
Scop : Entity_Id) return Boolean;
-- Return True if type of object has attribute Has_Constrained_Partial_View
-- set to True; in addition, within a generic body, return True if subtype
-- of the object is a descendant of an untagged generic formal private or
-- derived type, and the subtype is not an unconstrained array subtype
-- (RM 3.3(23.10/3)).
function Ultimate_Alias (Prim : Entity_Id) return Entity_Id;
pragma Inline (Ultimate_Alias);
-- Return the last entity in the chain of aliased entities of Prim. If Prim
-- has no alias return Prim.
function Unit_Declaration_Node (Unit_Id : Entity_Id) return Node_Id;
-- Unit_Id is the simple name of a program unit, this function returns the
-- corresponding xxx_Declaration node for the entity. Also applies to the
-- body entities for subprograms, tasks and protected units, in which case
-- it returns the subprogram, task or protected body node for it. The unit
-- may be a child unit with any number of ancestors.
function Package_Specification (Pack_Id : Entity_Id) return Node_Id;
-- Given an entity for a package or generic package, return corresponding
-- package specification. Simplifies handling of child units, and better
-- than the old idiom: Specification (Unit_Declaration_Node (Pack_Id)).
end Sem_Aux;
|
-- NORX6441
-- an Ada implementation of the NORX Authenticated Encryption Algorithm
-- created by Jean-Philippe Aumasson, Philipp Jovanovic and Samuel Neves
-- This instantiation words on 64-bit words, with 4 rounds and a parallelism
-- degree of 1
-- Copyright (c) 2016, James Humphry - see LICENSE file for details
pragma SPARK_Mode (On);
with Interfaces;
with NORX;
with NORX_Load_Store;
pragma Elaborate_All(NORX);
use all type Interfaces.Unsigned_64;
package NORX6441 is new NORX(w => 64,
Word => Interfaces.Unsigned_64,
Storage_Array_To_Word => NORX_Load_Store.Storage_Array_To_Unsigned_64,
Word_To_Storage_Array => NORX_Load_Store.Unsigned_64_To_Storage_Array,
l => 4,
k => 256,
Key_Position => 4,
t => 256,
n => 256,
rot => (8, 19, 40, 63),
r => 768,
c => 256);
|
-- Standard Ada library specification
-- Copyright (c) 2003-2018 Maxim Reznik <reznikmm@gmail.com>
-- Copyright (c) 2004-2016 AXE Consultants
-- Copyright (c) 2004, 2005, 2006 Ada-Europe
-- Copyright (c) 2000 The MITRE Corporation, Inc.
-- Copyright (c) 1992, 1993, 1994, 1995 Intermetrics, Inc.
-- SPDX-License-Identifier: BSD-3-Clause and LicenseRef-AdaReferenceManual
---------------------------------------------------------------------------
with Ada.Streams;
package Ada.Text_IO.Text_Streams is
type Stream_Access is access all Streams.Root_Stream_Type'Class;
function Stream (File : in File_Type) return Stream_Access;
end Ada.Text_IO.Text_Streams;
|
-- SPDX-FileCopyrightText: 2020 Max Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
--
-- This package provides Unit_Naming_Schema interface and its methods.
package Program.Unit_Naming is
pragma Preelaborate;
type Unit_Naming_Schema is limited interface;
-- Interface to get compilation Text_Name for given compilation unit.
type Unit_Naming_Schema_Access is access all Unit_Naming_Schema'Class;
for Unit_Naming_Schema_Access'Storage_Size use 0;
not overriding function Standard_Text_Name (Self : Unit_Naming_Schema)
return Text is abstract;
-- Get compilation Text_Name for Standard library package.
not overriding function Declaration_Text_Name
(Self : Unit_Naming_Schema;
Name : Program.Text)
return Text is abstract;
-- Get compilation Text_Name for given library declaration unit.
not overriding function Body_Text_Name
(Self : Unit_Naming_Schema;
Name : Program.Text)
return Text is abstract;
-- Get compilation Text_Name for given body.
not overriding function Subunit_Text_Name
(Self : Unit_Naming_Schema;
Name : Program.Text)
return Text is abstract;
-- Get compilation Text_Name for given subunit.
end Program.Unit_Naming;
|
with AWS.Messages;
with AWS.MIME;
package body @_Project_Name_@.Callbacks is
-------------
-- Default --
-------------
function Default (Request : in Status.Data) return Response.Data is
URI : constant String := Status.URI (Request);
begin
if URI = "/" then
return Response.Build
(MIME.Text_HTML, "<p>Hello World!");
else
return Response.Acknowledge (Messages.S404);
end if;
end Default;
end @_Project_Name_@.Callbacks;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUNTIME COMPONENTS --
-- --
-- A D A . T E X T _ I O . E N U M E R A T I O N _ I O --
-- --
-- B o d y --
-- --
-- $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-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Ada.Text_IO.Enumeration_Aux;
package body Ada.Text_IO.Enumeration_IO is
package Aux renames Ada.Text_IO.Enumeration_Aux;
---------
-- Get --
---------
procedure Get (File : in File_Type; Item : out Enum) is
Buf : String (1 .. Enum'Width);
Buflen : Natural;
begin
Aux.Get_Enum_Lit (File, Buf, Buflen);
declare
Buf_Str : String renames Buf (1 .. Buflen);
pragma Unsuppress (Range_Check);
begin
Item := Enum'Value (Buf_Str);
end;
exception
when Constraint_Error => raise Data_Error;
end Get;
procedure Get (Item : out Enum) is
pragma Unsuppress (Range_Check);
begin
Get (Current_In, Item);
end Get;
procedure Get
(From : in String;
Item : out Enum;
Last : out Positive)
is
Start : Natural;
begin
Aux.Scan_Enum_Lit (From, Start, Last);
declare
From_Str : String renames From (Start .. Last);
pragma Unsuppress (Range_Check);
begin
Item := Enum'Value (From_Str);
end;
exception
when Constraint_Error => raise Data_Error;
end Get;
---------
-- Put --
---------
procedure Put
(File : in File_Type;
Item : in Enum;
Width : in Field := Default_Width;
Set : in Type_Set := Default_Setting)
is
Image : constant String := Enum'Image (Item);
begin
Aux.Put (File, Image, Width, Set);
end Put;
procedure Put
(Item : in Enum;
Width : in Field := Default_Width;
Set : in Type_Set := Default_Setting)
is
begin
Put (Current_Out, Item, Width, Set);
end Put;
procedure Put
(To : out String;
Item : in Enum;
Set : in Type_Set := Default_Setting)
is
Image : constant String := Enum'Image (Item);
begin
Aux.Puts (To, Image, Set);
end Put;
end Ada.Text_IO.Enumeration_IO;
|
-- This spec has been automatically generated from STM32F46_79x.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.SAI is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype GCR_SYNCOUT_Field is HAL.UInt2;
-- Global configuration register
type GCR_Register is record
-- Synchronization outputs
SYNCOUT : GCR_SYNCOUT_Field := 16#0#;
-- unspecified
Reserved_2_31 : HAL.UInt30 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for GCR_Register use record
SYNCOUT at 0 range 0 .. 1;
Reserved_2_31 at 0 range 2 .. 31;
end record;
subtype ACR1_MODE_Field is HAL.UInt2;
subtype ACR1_PRTCFG_Field is HAL.UInt2;
subtype ACR1_DS_Field is HAL.UInt3;
subtype ACR1_SYNCEN_Field is HAL.UInt2;
subtype ACR1_MCJDIV_Field is HAL.UInt4;
-- AConfiguration register 1
type ACR1_Register is record
-- Audio block mode
MODE : ACR1_MODE_Field := 16#0#;
-- Protocol configuration
PRTCFG : ACR1_PRTCFG_Field := 16#0#;
-- unspecified
Reserved_4_4 : HAL.Bit := 16#0#;
-- Data size
DS : ACR1_DS_Field := 16#2#;
-- Least significant bit first
LSBFIRST : Boolean := False;
-- Clock strobing edge
CKSTR : Boolean := False;
-- Synchronization enable
SYNCEN : ACR1_SYNCEN_Field := 16#0#;
-- Mono mode
MONO : Boolean := False;
-- Output drive
OutDri : Boolean := False;
-- unspecified
Reserved_14_15 : HAL.UInt2 := 16#0#;
-- Audio block A enable
SAIAEN : Boolean := False;
-- DMA enable
DMAEN : Boolean := False;
-- unspecified
Reserved_18_18 : HAL.Bit := 16#0#;
-- No divider
NODIV : Boolean := False;
-- Master clock divider
MCJDIV : ACR1_MCJDIV_Field := 16#0#;
-- unspecified
Reserved_24_31 : HAL.UInt8 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ACR1_Register use record
MODE at 0 range 0 .. 1;
PRTCFG at 0 range 2 .. 3;
Reserved_4_4 at 0 range 4 .. 4;
DS at 0 range 5 .. 7;
LSBFIRST at 0 range 8 .. 8;
CKSTR at 0 range 9 .. 9;
SYNCEN at 0 range 10 .. 11;
MONO at 0 range 12 .. 12;
OutDri at 0 range 13 .. 13;
Reserved_14_15 at 0 range 14 .. 15;
SAIAEN at 0 range 16 .. 16;
DMAEN at 0 range 17 .. 17;
Reserved_18_18 at 0 range 18 .. 18;
NODIV at 0 range 19 .. 19;
MCJDIV at 0 range 20 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
subtype ACR2_FTH_Field is HAL.UInt3;
subtype ACR2_MUTECN_Field is HAL.UInt6;
subtype ACR2_COMP_Field is HAL.UInt2;
-- AConfiguration register 2
type ACR2_Register is record
-- FIFO threshold
FTH : ACR2_FTH_Field := 16#0#;
-- FIFO flush
FFLUS : Boolean := False;
-- Tristate management on data line
TRIS : Boolean := False;
-- Mute
MUTE : Boolean := False;
-- Mute value
MUTEVAL : Boolean := False;
-- Mute counter
MUTECN : ACR2_MUTECN_Field := 16#0#;
-- Complement bit
CPL : Boolean := False;
-- Companding mode
COMP : ACR2_COMP_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ACR2_Register use record
FTH at 0 range 0 .. 2;
FFLUS at 0 range 3 .. 3;
TRIS at 0 range 4 .. 4;
MUTE at 0 range 5 .. 5;
MUTEVAL at 0 range 6 .. 6;
MUTECN at 0 range 7 .. 12;
CPL at 0 range 13 .. 13;
COMP at 0 range 14 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype AFRCR_FRL_Field is HAL.UInt8;
subtype AFRCR_FSALL_Field is HAL.UInt7;
-- AFRCR
type AFRCR_Register is record
-- Frame length
FRL : AFRCR_FRL_Field := 16#7#;
-- Frame synchronization active level length
FSALL : AFRCR_FSALL_Field := 16#0#;
-- unspecified
Reserved_15_15 : HAL.Bit := 16#0#;
-- Frame synchronization definition
FSDEF : Boolean := False;
-- Frame synchronization polarity
FSPOL : Boolean := False;
-- Frame synchronization offset
FSOFF : Boolean := False;
-- unspecified
Reserved_19_31 : HAL.UInt13 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for AFRCR_Register use record
FRL at 0 range 0 .. 7;
FSALL at 0 range 8 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
FSDEF at 0 range 16 .. 16;
FSPOL at 0 range 17 .. 17;
FSOFF at 0 range 18 .. 18;
Reserved_19_31 at 0 range 19 .. 31;
end record;
subtype ASLOTR_FBOFF_Field is HAL.UInt5;
subtype ASLOTR_SLOTSZ_Field is HAL.UInt2;
subtype ASLOTR_NBSLOT_Field is HAL.UInt4;
subtype ASLOTR_SLOTEN_Field is HAL.UInt16;
-- ASlot register
type ASLOTR_Register is record
-- First bit offset
FBOFF : ASLOTR_FBOFF_Field := 16#0#;
-- unspecified
Reserved_5_5 : HAL.Bit := 16#0#;
-- Slot size
SLOTSZ : ASLOTR_SLOTSZ_Field := 16#0#;
-- Number of slots in an audio frame
NBSLOT : ASLOTR_NBSLOT_Field := 16#0#;
-- unspecified
Reserved_12_15 : HAL.UInt4 := 16#0#;
-- Slot enable
SLOTEN : ASLOTR_SLOTEN_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ASLOTR_Register use record
FBOFF at 0 range 0 .. 4;
Reserved_5_5 at 0 range 5 .. 5;
SLOTSZ at 0 range 6 .. 7;
NBSLOT at 0 range 8 .. 11;
Reserved_12_15 at 0 range 12 .. 15;
SLOTEN at 0 range 16 .. 31;
end record;
-- AInterrupt mask register2
type AIM_Register is record
-- Overrun/underrun interrupt enable
OVRUDRIE : Boolean := False;
-- Mute detection interrupt enable
MUTEDET : Boolean := False;
-- Wrong clock configuration interrupt enable
WCKCFG : Boolean := False;
-- FIFO request interrupt enable
FREQIE : Boolean := False;
-- Codec not ready interrupt enable
CNRDYIE : Boolean := False;
-- Anticipated frame synchronization detection interrupt enable
AFSDETIE : Boolean := False;
-- Late frame synchronization detection interrupt enable
LFSDET : 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 AIM_Register use record
OVRUDRIE at 0 range 0 .. 0;
MUTEDET at 0 range 1 .. 1;
WCKCFG at 0 range 2 .. 2;
FREQIE at 0 range 3 .. 3;
CNRDYIE at 0 range 4 .. 4;
AFSDETIE at 0 range 5 .. 5;
LFSDET at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
subtype ASR_FLVL_Field is HAL.UInt3;
-- AStatus register
type ASR_Register is record
-- Overrun / underrun
OVRUDR : Boolean := False;
-- Mute detection
MUTEDET : Boolean := False;
-- Wrong clock configuration flag. This bit is read only.
WCKCFG : Boolean := False;
-- FIFO request
FREQ : Boolean := False;
-- Codec not ready
CNRDY : Boolean := False;
-- Anticipated frame synchronization detection
AFSDET : Boolean := False;
-- Late frame synchronization detection
LFSDET : Boolean := False;
-- unspecified
Reserved_7_15 : HAL.UInt9 := 16#0#;
-- FIFO level threshold
FLVL : ASR_FLVL_Field := 16#0#;
-- unspecified
Reserved_19_31 : HAL.UInt13 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ASR_Register use record
OVRUDR at 0 range 0 .. 0;
MUTEDET at 0 range 1 .. 1;
WCKCFG at 0 range 2 .. 2;
FREQ at 0 range 3 .. 3;
CNRDY at 0 range 4 .. 4;
AFSDET at 0 range 5 .. 5;
LFSDET at 0 range 6 .. 6;
Reserved_7_15 at 0 range 7 .. 15;
FLVL at 0 range 16 .. 18;
Reserved_19_31 at 0 range 19 .. 31;
end record;
-- AClear flag register
type ACLRFR_Register is record
-- Clear overrun / underrun
OVRUDR : Boolean := False;
-- Mute detection flag
MUTEDET : Boolean := False;
-- Clear wrong clock configuration flag
WCKCFG : Boolean := False;
-- unspecified
Reserved_3_3 : HAL.Bit := 16#0#;
-- Clear codec not ready flag
CNRDY : Boolean := False;
-- Clear anticipated frame synchronization detection flag.
CAFSDET : Boolean := False;
-- Clear late frame synchronization detection flag
LFSDET : 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 ACLRFR_Register use record
OVRUDR at 0 range 0 .. 0;
MUTEDET at 0 range 1 .. 1;
WCKCFG at 0 range 2 .. 2;
Reserved_3_3 at 0 range 3 .. 3;
CNRDY at 0 range 4 .. 4;
CAFSDET at 0 range 5 .. 5;
LFSDET at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
subtype BCR1_MODE_Field is HAL.UInt2;
subtype BCR1_PRTCFG_Field is HAL.UInt2;
subtype BCR1_DS_Field is HAL.UInt3;
subtype BCR1_SYNCEN_Field is HAL.UInt2;
subtype BCR1_MCJDIV_Field is HAL.UInt4;
-- BConfiguration register 1
type BCR1_Register is record
-- Audio block mode
MODE : BCR1_MODE_Field := 16#0#;
-- Protocol configuration
PRTCFG : BCR1_PRTCFG_Field := 16#0#;
-- unspecified
Reserved_4_4 : HAL.Bit := 16#0#;
-- Data size
DS : BCR1_DS_Field := 16#2#;
-- Least significant bit first
LSBFIRST : Boolean := False;
-- Clock strobing edge
CKSTR : Boolean := False;
-- Synchronization enable
SYNCEN : BCR1_SYNCEN_Field := 16#0#;
-- Mono mode
MONO : Boolean := False;
-- Output drive
OutDri : Boolean := False;
-- unspecified
Reserved_14_15 : HAL.UInt2 := 16#0#;
-- Audio block B enable
SAIBEN : Boolean := False;
-- DMA enable
DMAEN : Boolean := False;
-- unspecified
Reserved_18_18 : HAL.Bit := 16#0#;
-- No divider
NODIV : Boolean := False;
-- Master clock divider
MCJDIV : BCR1_MCJDIV_Field := 16#0#;
-- unspecified
Reserved_24_31 : HAL.UInt8 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BCR1_Register use record
MODE at 0 range 0 .. 1;
PRTCFG at 0 range 2 .. 3;
Reserved_4_4 at 0 range 4 .. 4;
DS at 0 range 5 .. 7;
LSBFIRST at 0 range 8 .. 8;
CKSTR at 0 range 9 .. 9;
SYNCEN at 0 range 10 .. 11;
MONO at 0 range 12 .. 12;
OutDri at 0 range 13 .. 13;
Reserved_14_15 at 0 range 14 .. 15;
SAIBEN at 0 range 16 .. 16;
DMAEN at 0 range 17 .. 17;
Reserved_18_18 at 0 range 18 .. 18;
NODIV at 0 range 19 .. 19;
MCJDIV at 0 range 20 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
subtype BCR2_FTH_Field is HAL.UInt3;
subtype BCR2_MUTECN_Field is HAL.UInt6;
subtype BCR2_COMP_Field is HAL.UInt2;
-- BConfiguration register 2
type BCR2_Register is record
-- FIFO threshold
FTH : BCR2_FTH_Field := 16#0#;
-- FIFO flush
FFLUS : Boolean := False;
-- Tristate management on data line
TRIS : Boolean := False;
-- Mute
MUTE : Boolean := False;
-- Mute value
MUTEVAL : Boolean := False;
-- Mute counter
MUTECN : BCR2_MUTECN_Field := 16#0#;
-- Complement bit
CPL : Boolean := False;
-- Companding mode
COMP : BCR2_COMP_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BCR2_Register use record
FTH at 0 range 0 .. 2;
FFLUS at 0 range 3 .. 3;
TRIS at 0 range 4 .. 4;
MUTE at 0 range 5 .. 5;
MUTEVAL at 0 range 6 .. 6;
MUTECN at 0 range 7 .. 12;
CPL at 0 range 13 .. 13;
COMP at 0 range 14 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype BFRCR_FRL_Field is HAL.UInt8;
subtype BFRCR_FSALL_Field is HAL.UInt7;
-- BFRCR
type BFRCR_Register is record
-- Frame length
FRL : BFRCR_FRL_Field := 16#7#;
-- Frame synchronization active level length
FSALL : BFRCR_FSALL_Field := 16#0#;
-- unspecified
Reserved_15_15 : HAL.Bit := 16#0#;
-- Frame synchronization definition
FSDEF : Boolean := False;
-- Frame synchronization polarity
FSPOL : Boolean := False;
-- Frame synchronization offset
FSOFF : Boolean := False;
-- unspecified
Reserved_19_31 : HAL.UInt13 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BFRCR_Register use record
FRL at 0 range 0 .. 7;
FSALL at 0 range 8 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
FSDEF at 0 range 16 .. 16;
FSPOL at 0 range 17 .. 17;
FSOFF at 0 range 18 .. 18;
Reserved_19_31 at 0 range 19 .. 31;
end record;
subtype BSLOTR_FBOFF_Field is HAL.UInt5;
subtype BSLOTR_SLOTSZ_Field is HAL.UInt2;
subtype BSLOTR_NBSLOT_Field is HAL.UInt4;
subtype BSLOTR_SLOTEN_Field is HAL.UInt16;
-- BSlot register
type BSLOTR_Register is record
-- First bit offset
FBOFF : BSLOTR_FBOFF_Field := 16#0#;
-- unspecified
Reserved_5_5 : HAL.Bit := 16#0#;
-- Slot size
SLOTSZ : BSLOTR_SLOTSZ_Field := 16#0#;
-- Number of slots in an audio frame
NBSLOT : BSLOTR_NBSLOT_Field := 16#0#;
-- unspecified
Reserved_12_15 : HAL.UInt4 := 16#0#;
-- Slot enable
SLOTEN : BSLOTR_SLOTEN_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BSLOTR_Register use record
FBOFF at 0 range 0 .. 4;
Reserved_5_5 at 0 range 5 .. 5;
SLOTSZ at 0 range 6 .. 7;
NBSLOT at 0 range 8 .. 11;
Reserved_12_15 at 0 range 12 .. 15;
SLOTEN at 0 range 16 .. 31;
end record;
-- BInterrupt mask register2
type BIM_Register is record
-- Overrun/underrun interrupt enable
OVRUDRIE : Boolean := False;
-- Mute detection interrupt enable
MUTEDET : Boolean := False;
-- Wrong clock configuration interrupt enable
WCKCFG : Boolean := False;
-- FIFO request interrupt enable
FREQIE : Boolean := False;
-- Codec not ready interrupt enable
CNRDYIE : Boolean := False;
-- Anticipated frame synchronization detection interrupt enable
AFSDETIE : Boolean := False;
-- Late frame synchronization detection interrupt enable
LFSDETIE : 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 BIM_Register use record
OVRUDRIE at 0 range 0 .. 0;
MUTEDET at 0 range 1 .. 1;
WCKCFG at 0 range 2 .. 2;
FREQIE at 0 range 3 .. 3;
CNRDYIE at 0 range 4 .. 4;
AFSDETIE at 0 range 5 .. 5;
LFSDETIE at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
subtype BSR_FLVL_Field is HAL.UInt3;
-- BStatus register
type BSR_Register is record
-- Read-only. Overrun / underrun
OVRUDR : Boolean;
-- Read-only. Mute detection
MUTEDET : Boolean;
-- Read-only. Wrong clock configuration flag
WCKCFG : Boolean;
-- Read-only. FIFO request
FREQ : Boolean;
-- Read-only. Codec not ready
CNRDY : Boolean;
-- Read-only. Anticipated frame synchronization detection
AFSDET : Boolean;
-- Read-only. Late frame synchronization detection
LFSDET : Boolean;
-- unspecified
Reserved_7_15 : HAL.UInt9;
-- Read-only. FIFO level threshold
FLVL : BSR_FLVL_Field;
-- unspecified
Reserved_19_31 : HAL.UInt13;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BSR_Register use record
OVRUDR at 0 range 0 .. 0;
MUTEDET at 0 range 1 .. 1;
WCKCFG at 0 range 2 .. 2;
FREQ at 0 range 3 .. 3;
CNRDY at 0 range 4 .. 4;
AFSDET at 0 range 5 .. 5;
LFSDET at 0 range 6 .. 6;
Reserved_7_15 at 0 range 7 .. 15;
FLVL at 0 range 16 .. 18;
Reserved_19_31 at 0 range 19 .. 31;
end record;
-- BClear flag register
type BCLRFR_Register is record
-- Write-only. Clear overrun / underrun
OVRUDR : Boolean := False;
-- Write-only. Mute detection flag
MUTEDET : Boolean := False;
-- Write-only. Clear wrong clock configuration flag
WCKCFG : Boolean := False;
-- unspecified
Reserved_3_3 : HAL.Bit := 16#0#;
-- Write-only. Clear codec not ready flag
CNRDY : Boolean := False;
-- Write-only. Clear anticipated frame synchronization detection flag
CAFSDET : Boolean := False;
-- Write-only. Clear late frame synchronization detection flag
LFSDET : 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 BCLRFR_Register use record
OVRUDR at 0 range 0 .. 0;
MUTEDET at 0 range 1 .. 1;
WCKCFG at 0 range 2 .. 2;
Reserved_3_3 at 0 range 3 .. 3;
CNRDY at 0 range 4 .. 4;
CAFSDET at 0 range 5 .. 5;
LFSDET at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Serial audio interface
type SAI_Peripheral is record
-- Global configuration register
GCR : aliased GCR_Register;
-- AConfiguration register 1
ACR1 : aliased ACR1_Register;
-- AConfiguration register 2
ACR2 : aliased ACR2_Register;
-- AFRCR
AFRCR : aliased AFRCR_Register;
-- ASlot register
ASLOTR : aliased ASLOTR_Register;
-- AInterrupt mask register2
AIM : aliased AIM_Register;
-- AStatus register
ASR : aliased ASR_Register;
-- AClear flag register
ACLRFR : aliased ACLRFR_Register;
-- AData register
ADR : aliased HAL.UInt32;
-- BConfiguration register 1
BCR1 : aliased BCR1_Register;
-- BConfiguration register 2
BCR2 : aliased BCR2_Register;
-- BFRCR
BFRCR : aliased BFRCR_Register;
-- BSlot register
BSLOTR : aliased BSLOTR_Register;
-- BInterrupt mask register2
BIM : aliased BIM_Register;
-- BStatus register
BSR : aliased BSR_Register;
-- BClear flag register
BCLRFR : aliased BCLRFR_Register;
-- BData register
BDR : aliased HAL.UInt32;
end record
with Volatile;
for SAI_Peripheral use record
GCR at 16#0# range 0 .. 31;
ACR1 at 16#4# range 0 .. 31;
ACR2 at 16#8# range 0 .. 31;
AFRCR at 16#C# range 0 .. 31;
ASLOTR at 16#10# range 0 .. 31;
AIM at 16#14# range 0 .. 31;
ASR at 16#18# range 0 .. 31;
ACLRFR at 16#1C# range 0 .. 31;
ADR at 16#20# range 0 .. 31;
BCR1 at 16#24# range 0 .. 31;
BCR2 at 16#28# range 0 .. 31;
BFRCR at 16#2C# range 0 .. 31;
BSLOTR at 16#30# range 0 .. 31;
BIM at 16#34# range 0 .. 31;
BSR at 16#38# range 0 .. 31;
BCLRFR at 16#3C# range 0 .. 31;
BDR at 16#40# range 0 .. 31;
end record;
-- Serial audio interface
SAI_Periph : aliased SAI_Peripheral
with Import, Address => System'To_Address (16#40015800#);
end STM32_SVD.SAI;
|
-- SPDX-FileCopyrightText: 2019 Max Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
with System.Storage_Pools.Subpools;
with Program.Compilation_Units;
with Program.Compilations;
with Program.Contexts;
with Program.Lexical_Elements;
with Program.Parsers;
with Program.Plain_Lexical_Elements;
private with Ada.Containers.Vectors;
private with Ada.Strings.Wide_Wide_Unbounded;
private with Program.Source_Buffers;
private with Program.Plain_Source_Buffers;
private with Program.Plain_Contexts;
package Program.Plain_Compilations is
pragma Preelaborate;
type Compilation
(Subpool : not null System.Storage_Pools.Subpools.Subpool_Handle)
is limited new Program.Compilations.Compilation
and Program.Plain_Lexical_Elements.Line_Buffer with private;
procedure Initialize
(Self : in out Compilation'Class;
Context : not null Program.Contexts.Context_Access);
overriding function Context (Self : Compilation)
return not null Program.Contexts.Context_Access;
-- Return corresponding context
overriding function Text_Name (Self : Compilation) return Program.Text;
overriding function Object_Name (Self : Compilation) return Program.Text;
overriding function Line_Count (Self : Compilation) return Natural;
overriding function Line
(Self : Compilation;
Index : Positive) return Program.Text;
overriding function Lexical_Element_Count (Self : Compilation)
return Natural;
overriding function Lexical_Element
(Self : Compilation;
Index : Positive) return Program.Lexical_Elements.Lexical_Element_Access;
not overriding procedure Parse_File
(Self : aliased in out Compilation;
Text_Name : Program.Text;
Units : out Program.Parsers.Unit_Vectors.Vector;
Pragmas : out Program.Parsers.Element_Vectors.Vector;
Standard : Boolean := False);
private
package Span_Vectors is new Ada.Containers.Vectors
(Index_Type => Positive,
Element_Type => Program.Source_Buffers.Span,
"=" => Program.Source_Buffers."=");
type Plain_Context_Access is access all Program.Plain_Contexts.Context;
type Compilation
(Subpool : not null System.Storage_Pools.Subpools.Subpool_Handle)
is limited new Compilations.Compilation
and Plain_Lexical_Elements.Line_Buffer with
record
Context : Plain_Context_Access;
Text_Name : Ada.Strings.Wide_Wide_Unbounded.Unbounded_Wide_Wide_String;
Object_Name : Ada.Strings.Wide_Wide_Unbounded.Unbounded_Wide_Wide_String;
Buffer : aliased Program.Plain_Source_Buffers.Source_Buffer;
Tokens : aliased Plain_Lexical_Elements.Lexical_Element_Vector
(Compilation'Unchecked_Access);
Line_Spans : Span_Vectors.Vector;
end record;
overriding function Text
(Self : Compilation;
Span : Program.Source_Buffers.Span) return Program.Text;
overriding procedure Get_Span
(Self : Compilation;
Span : Program.Source_Buffers.Span;
From_Line : out Positive;
To_Line : out Positive;
From_Column : out Positive;
To_Column : out Positive);
end Program.Plain_Compilations;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 1 3 --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Handling of packed arrays with Component_Size = 13
package System.Pack_13 is
pragma Preelaborate;
Bits : constant := 13;
type Bits_13 is mod 2 ** Bits;
for Bits_13'Size use Bits;
-- In all subprograms below, Rev_SSO is set True if the array has the
-- non-default scalar storage order.
function Get_13
(Arr : System.Address;
N : Natural;
Rev_SSO : Boolean) return Bits_13 with Inline;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned.
procedure Set_13
(Arr : System.Address;
N : Natural;
E : Bits_13;
Rev_SSO : Boolean) with Inline;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is set to the given value.
end System.Pack_13;
|
-- This spec has been automatically generated from STM32F429x.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;
|
--
-- The author disclaims copyright to this source code. In place of
-- a legal notice, here is a blessing:
--
-- May you do good and not evil.
-- May you find forgiveness for yourself and forgive others.
-- May you share freely, not taking more than you give.
--
with Ada.Text_IO;
with Ada.Strings.Unbounded;
with AWS.MIME;
with AWS.Templates;
with AWS.Parameters;
with GNAT.Traceback.Symbolic;
with Parser;
with Database.Jobs;
with Web_IO;
with Types;
package body Web_Callbacks is
Web_Base : constant String := "../web/";
Translations : AWS.Templates.Translate_Set;
function Job_Name (Job : in Types.Job_Id)
return String;
-- Get name of current job.
procedure Associate (Placeholder : String;
Value : String);
-- Update template translation Placeholder with Value.
procedure Serve_Main_Page (Request : in AWS.Status.Data);
-- Build main web page "/"
procedure Associate (Placeholder : String;
Value : String)
is
begin
AWS.Templates.Insert (Translations,
AWS.Templates.Assoc (Placeholder, Value));
end Associate;
procedure Initialize is
begin
-- Static translations
Associate ("COMMAND_TABLE", Web_IO.Help_Image);
end Initialize;
function Job_Name (Job : in Types.Job_Id)
return String
is
use Database.Jobs;
use Types;
Top_Jobs : constant Job_Sets.Vector :=
Get_Jobs (Database.Jobs.Top_Level);
begin
for J of Top_Jobs loop
if Job = J.Id then
return Ada.Strings.Unbounded.To_String (J.Title);
end if;
end loop;
return "UNKNOWN=XXX";
end Job_Name;
procedure Serve_Main_Page (Request : in AWS.Status.Data) is
List : constant AWS.Parameters.List := AWS.Status.Parameters (Request);
CMD : constant String := AWS.Parameters.Get (List, "cmd");
begin
Parser.Parse_Input (CMD);
Associate ("CUR_JOB_NAME", Job_Name (Database.Jobs.Get_Current_Job));
Associate ("JOBS_LIST", Web_IO.Jobs_Image);
Associate ("JOB_INFORMATION",
Web_IO.Job_Image (Database.Jobs.Get_Current_Job));
Associate ("LAST_COMMAND", Parser.Get_Last_Command);
end Serve_Main_Page;
----------
-- Main --
----------
function Main (Request : in AWS.Status.Data)
return AWS.Response.Data
is
use AWS;
URI : constant String := Status.URI (Request);
Filename : constant String := URI (URI'First + 1 .. URI'Last);
begin
if
URI = "/stylesheets/print.css" or
URI = "/stylesheets/main.css" or
URI = "/stylesheets/boilerplate.css" or
URI = "/css/rg.css"
then
return AWS.Response.Build
(MIME.Text_CSS,
Message_Body => Templates.Parse (Web_Base & Filename));
elsif URI = "/favicon.ico" then
Ada.Text_IO.Put_Line ("Serving ikon " & URI);
return AWS.Response.Build
(MIME.Text_HTML, Message_Body
=> Templates.Parse (Web_Base & "favicon.ico"));
elsif URI = "/" then
Serve_Main_Page (Request);
return AWS.Response.Build
(MIME.Text_HTML,
Message_Body => AWS.Templates.Parse (Web_Base & "main.thtml",
Translations));
elsif URI = "/test" then
return AWS.Response.Build
(MIME.Text_HTML,
Message_Body => "<html><head><title>Test</title></head>" &
"<body><h1>Test</html>");
else
Ada.Text_IO.Put_Line ("URI is " & URI);
Ada.Text_IO.Put_Line ("Filename is " & Filename);
return AWS.Response.Build
(MIME.Text_HTML,
Message_Body => Templates.Parse (Web_Base & "fejl.html"));
end if;
exception
when others =>
declare -- Call_Stack
Trace : GNAT.Traceback.Tracebacks_Array (1 .. 100);
Length : Natural;
begin
GNAT.Traceback.Call_Chain (Trace, Length);
Ada.Text_IO.Put_Line
(GNAT.Traceback.Symbolic.Symbolic_Traceback
(Trace (1 .. Length)));
end;
raise;
end Main;
end Web_Callbacks;
|
-- { dg-do run }
-- { dg-options "-gnatws" }
procedure View_Conversion1 is
type Matrix is array (Integer range <>, Integer range <>) of Float;
S1 : Matrix (-3 .. -2, 2 .. 3) := ((2.0, -1.0), (-1.0, 2.0));
S2 : Matrix (1 .. 2, 1 .. 2) := S1;
S3 : Matrix (2 .. 3, -3 .. -2);
S4 : Matrix (1 .. 2, 1 .. 2);
function Normal_Last (A : Matrix; N : Natural) return Boolean is
begin
if A'Last (1) = N and then A'Last (2) = N then
return True;
else
return False;
end if;
end;
procedure Transpose (A : Matrix; B : out Matrix) is
N : constant Natural := A'Length (1);
subtype Normal_Matrix is Matrix (1 .. N, 1 .. N);
begin
if not Normal_Last (A, N) or else not Normal_Last (B, N) then
Transpose (Normal_Matrix (A), Normal_Matrix (B));
return;
end if;
for J in 1 .. N loop
for K in 1 .. N loop
B (J, K) := A (K, J);
end loop;
end loop;
end;
begin
Transpose (S1, S3);
Transpose (S3, S4);
if S4 /= S2 then
raise Program_Error;
end if;
end;
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2015-2016, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- Based on ov2640.c from OpenMV
--
-- This file is part of the OpenMV project.
-- Copyright (c) 2013/2014 Ibrahim Abdelkader <i.abdalkader@gmail.com>
-- This work is licensed under the MIT license, see the file LICENSE for
-- details.
--
-- OV2640 driver.
--
with Bit_Fields; use Bit_Fields;
package body OV2640 is
type Addr_And_Data is record
Addr, Data : UInt8;
end record;
type Command_Array is array (Natural range <>) of Addr_And_Data;
Setup_Commands : constant Command_Array :=
((REG_BANK_SELECT, SELECT_DSP),
(16#2c#, 16#ff#),
(16#2e#, 16#df#),
(REG_BANK_SELECT, SELECT_SENSOR),
(16#3c#, 16#32#),
(REG_SENSOR_CLKRC, 16#80#), -- Set PCLK divider */
-- COM2_OUT_DRIVE_3x
(REG_SENSOR_COM2, 16#02#), -- Output drive x3 */
-- #ifdef OPENMV2
(REG_SENSOR_REG04, 16#F8#), -- Mirror/VFLIP/AEC[1:0] */
-- #else
-- (REG04_SET(REG04_HREF_EN)),
-- #endif
(REG_SENSOR_COM8, COM8_DEFAULT or
COM8_BNDF_EN or
COM8_AGC_EN or
COM8_AEC_EN),
-- COM9_AGC_GAIN_8x
(REG_SENSOR_COM9, COM9_DEFAULT or Shift_Left (16#02#, 5)),
(16#2c#, 16#0c#),
(16#33#, 16#78#),
(16#3a#, 16#33#),
(16#3b#, 16#fb#),
(16#3e#, 16#00#),
(16#43#, 16#11#),
(16#16#, 16#10#),
(16#39#, 16#02#),
(16#35#, 16#88#),
(16#22#, 16#0a#),
(16#37#, 16#40#),
(16#23#, 16#00#),
(REG_SENSOR_ARCOM2, 16#a0#),
(16#06#, 16#02#),
(16#06#, 16#88#),
(16#07#, 16#c0#),
(16#0d#, 16#b7#),
(16#0e#, 16#01#),
(16#4c#, 16#00#),
(16#4a#, 16#81#),
(16#21#, 16#99#),
(REG_SENSOR_AEW, 16#40#),
(REG_SENSOR_AEB, 16#38#),
-- AGC/AEC fast mode operating region
-- VV_AGC_TH_SET(h,l) ((h<<4)|(l&0x0F))
-- VV_AGC_TH_SET(16#08#, 16#02#)
(REG_SENSOR_VV, Shift_Left (16#08#, 4) or 16#02#),
(REG_SENSOR_COM19, 16#00#), -- Zoom control 2 MSBs */
(REG_SENSOR_ZOOMS, 16#00#), -- Zoom control 8 MSBs */
(16#5c#, 16#00#),
(16#63#, 16#00#),
(REG_SENSOR_FLL, 16#00#),
(REG_SENSOR_FLH, 16#00#),
-- Set banding filter
(REG_SENSOR_COM3, COM3_DEFAULT or COM3_BAND_AUTO),
(REG_SENSOR_REG5D, 16#55#),
(REG_SENSOR_REG5E, 16#7d#),
(REG_SENSOR_REG5F, 16#7d#),
(REG_SENSOR_REG60, 16#55#),
(REG_SENSOR_HISTO_LOW, 16#70#),
(REG_SENSOR_HISTO_HIGH, 16#80#),
(16#7c#, 16#05#),
(16#20#, 16#80#),
(16#28#, 16#30#),
(16#6c#, 16#00#),
(16#6d#, 16#80#),
(16#6e#, 16#00#),
(16#70#, 16#02#),
(16#71#, 16#94#),
(16#73#, 16#c1#),
(16#3d#, 16#34#),
-- (COM7, COM7_RES_UXGA | COM7_ZOOM_EN),
(16#5a#, 16#57#),
(REG_SENSOR_BD50, 16#bb#),
(REG_SENSOR_BD60, 16#9c#),
(REG_BANK_SELECT, SELECT_DSP),
(16#e5#, 16#7f#),
(REG_DSP_MC_BIST, MC_BIST_RESET or MC_BIST_BOOT_ROM_SEL),
(16#41#, 16#24#),
(REG_DSP_RESET, RESET_JPEG or RESET_DVP),
(16#76#, 16#ff#),
(16#33#, 16#a0#),
(16#42#, 16#20#),
(16#43#, 16#18#),
(16#4c#, 16#00#),
(REG_DSP_CTRL3, CTRL3_BPC_EN or CTRL3_WPC_EN or 16#10#),
(16#88#, 16#3f#),
(16#d7#, 16#03#),
(16#d9#, 16#10#),
(REG_DSP_R_DVP_SP, R_DVP_SP_AUTO_MODE or 16#2#),
(16#c8#, 16#08#),
(16#c9#, 16#80#),
(REG_DSP_BPADDR, 16#00#),
(REG_DSP_BPDATA, 16#00#),
(REG_DSP_BPADDR, 16#03#),
(REG_DSP_BPDATA, 16#48#),
(REG_DSP_BPDATA, 16#48#),
(REG_DSP_BPADDR, 16#08#),
(REG_DSP_BPDATA, 16#20#),
(REG_DSP_BPDATA, 16#10#),
(REG_DSP_BPDATA, 16#0e#),
(16#90#, 16#00#),
(16#91#, 16#0e#),
(16#91#, 16#1a#),
(16#91#, 16#31#),
(16#91#, 16#5a#),
(16#91#, 16#69#),
(16#91#, 16#75#),
(16#91#, 16#7e#),
(16#91#, 16#88#),
(16#91#, 16#8f#),
(16#91#, 16#96#),
(16#91#, 16#a3#),
(16#91#, 16#af#),
(16#91#, 16#c4#),
(16#91#, 16#d7#),
(16#91#, 16#e8#),
(16#91#, 16#20#),
(16#92#, 16#00#),
(16#93#, 16#06#),
(16#93#, 16#e3#),
(16#93#, 16#03#),
(16#93#, 16#03#),
(16#93#, 16#00#),
(16#93#, 16#02#),
(16#93#, 16#00#),
(16#93#, 16#00#),
(16#93#, 16#00#),
(16#93#, 16#00#),
(16#93#, 16#00#),
(16#93#, 16#00#),
(16#93#, 16#00#),
(16#96#, 16#00#),
(16#97#, 16#08#),
(16#97#, 16#19#),
(16#97#, 16#02#),
(16#97#, 16#0c#),
(16#97#, 16#24#),
(16#97#, 16#30#),
(16#97#, 16#28#),
(16#97#, 16#26#),
(16#97#, 16#02#),
(16#97#, 16#98#),
(16#97#, 16#80#),
(16#97#, 16#00#),
(16#97#, 16#00#),
(16#a4#, 16#00#),
(16#a8#, 16#00#),
(16#c5#, 16#11#),
(16#c6#, 16#51#),
(16#bf#, 16#80#),
(16#c7#, 16#10#),
(16#b6#, 16#66#),
(16#b8#, 16#A5#),
(16#b7#, 16#64#),
(16#b9#, 16#7C#),
(16#b3#, 16#af#),
(16#b4#, 16#97#),
(16#b5#, 16#FF#),
(16#b0#, 16#C5#),
(16#b1#, 16#94#),
(16#b2#, 16#0f#),
(16#c4#, 16#5c#),
(16#a6#, 16#00#),
(16#a7#, 16#20#),
(16#a7#, 16#d8#),
(16#a7#, 16#1b#),
(16#a7#, 16#31#),
(16#a7#, 16#00#),
(16#a7#, 16#18#),
(16#a7#, 16#20#),
(16#a7#, 16#d8#),
(16#a7#, 16#19#),
(16#a7#, 16#31#),
(16#a7#, 16#00#),
(16#a7#, 16#18#),
(16#a7#, 16#20#),
(16#a7#, 16#d8#),
(16#a7#, 16#19#),
(16#a7#, 16#31#),
(16#a7#, 16#00#),
(16#a7#, 16#18#),
(16#7f#, 16#00#),
(16#e5#, 16#1f#),
(16#e1#, 16#77#),
(16#dd#, 16#7f#),
(REG_DSP_CTRL0, CTRL0_YUV422 or CTRL0_YUV_EN or CTRL0_RGB_EN),
(16#00#, 16#00#)
);
procedure Write (This : OV2640_Camera; Addr, Data : UInt8);
function Read (This : OV2640_Camera; Addr : UInt8) return UInt8;
procedure Select_Sensor_Bank (This : OV2640_Camera);
procedure Select_DSP_Bank (This : OV2640_Camera);
procedure Enable_DSP (This : OV2640_Camera; Enable : Boolean);
-----------
-- Write --
-----------
procedure Write (This : OV2640_Camera; Addr, Data : UInt8) is
Status : I2C_Status;
begin
This.I2C.Mem_Write (Addr => This.Addr,
Mem_Addr => UInt16 (Addr),
Mem_Addr_Size => Memory_Size_8b,
Data => (1 => Data),
Status => Status);
if Status /= Ok then
raise Program_Error;
end if;
end Write;
----------
-- Read --
----------
function Read (This : OV2640_Camera; Addr : UInt8) return UInt8 is
Data : I2C_Data (1 .. 1);
Status : I2C_Status;
begin
This.I2C.Mem_Read (Addr => This.Addr,
Mem_Addr => UInt16 (Addr),
Mem_Addr_Size => Memory_Size_8b,
Data => Data,
Status => Status);
if Status /= Ok then
raise Program_Error;
end if;
return Data (Data'First);
end Read;
------------------------
-- Select_Sensor_Bank --
------------------------
procedure Select_Sensor_Bank (This : OV2640_Camera) is
begin
Write (This, REG_BANK_SELECT, 1);
end Select_Sensor_Bank;
---------------------
-- Select_DSP_Bank --
---------------------
procedure Select_DSP_Bank (This : OV2640_Camera) is
begin
Write (This, REG_BANK_SELECT, 0);
end Select_DSP_Bank;
----------------
-- Enable_DSP --
----------------
procedure Enable_DSP (This : OV2640_Camera; Enable : Boolean) is
begin
Select_DSP_Bank (This);
Write (This, REG_DSP_BYPASS, (if Enable then 0 else 1));
end Enable_DSP;
----------------
-- Initialize --
----------------
procedure Initialize
(This : in out OV2640_Camera;
Addr : UInt10)
is
begin
This.Addr := Addr;
for Elt of Setup_Commands loop
Write (This, Elt.Addr, Elt.Data);
end loop;
end Initialize;
----------------------
-- Set_Pixel_Format --
----------------------
procedure Set_Pixel_Format
(This : OV2640_Camera;
Pix : Pixel_Format)
is
begin
Select_DSP_Bank (This);
Write (This, REG_DSP_RESET, 2#0000_0100#); -- DVP
case Pix is
when Pix_RGB565 =>
Write (This, REG_DSP_IMAGE_MODE, 2#0000_1001#);
when Pix_YUV422 =>
Write (This, REG_DSP_IMAGE_MODE, 2#0000_0001#);
when Pix_JPEG =>
Write (This, REG_DSP_IMAGE_MODE, 2#0001_1000#);
Write (This, REG_DSP_QS, 16#0C#);
end case;
-- Write 0xD7 := 0x03 (not documented)
-- Write 0xE1 := 0X77 (not documented)
Write (This, REG_DSP_RESET, 0);
end Set_Pixel_Format;
--------------------
-- Set_Frame_Size --
--------------------
procedure Set_Frame_Size
(This : OV2640_Camera;
Res : Frame_Size)
is
H_SIZE, V_SIZE : Bit_Field (0 .. 15);
Width : constant UInt16 := Resolutions (Res).Width;
Height : constant UInt16 := Resolutions (Res).Height;
Is_UXGA : constant Boolean := Res = SXGA or else Res = UXGA;
CLK_Divider : constant Boolean := Is_UXGA;
begin
Enable_DSP (This, False);
-- DSP bank selected
Write (This, REG_DSP_ZMOW, UInt8 ((Width / 4) and 16#FF#));
Write (This, REG_DSP_ZMOH, UInt8 ((Height / 4) and 16#FF#));
Write (This, REG_DSP_ZMHH,
UInt8 (Shift_Right (Width, 10) and 16#3#)
or
UInt8 (Shift_Right (Height, 8) and 16#4#));
Select_Sensor_Bank (This);
Write (This, REG_SENSOR_CLKRC, (if CLK_Divider then 16#81# else 16#80#));
-- The sensor has only two mode (UXGA and SVGA), the resolution is then
-- scaled down by ZMOW, ZMOH and ZMHH.
Select_Sensor_Bank (This);
Write (This, REG_SENSOR_COM7, (if Is_UXGA then 16#00# else 16#40#));
Write (This, REG_SENSOR_COM1, (if Is_UXGA then 16#0F# else 16#0A#));
Write (This, REG_SENSOR_REG32, (if Is_UXGA then 16#36# else 16#09#));
Write (This, REG_SENSOR_HREFST, (if Is_UXGA then 16#11# else 16#11#));
Write (This, REG_SENSOR_HREFEND, (if Is_UXGA then 16#75# else 16#43#));
Write (This, REG_SENSOR_VSTRT, (if Is_UXGA then 16#01# else 16#00#));
Write (This, REG_SENSOR_VEND, (if Is_UXGA then 16#97# else 16#4B#));
-- Not documented...
Write (This, 16#3D#, (if Is_UXGA then 16#34# else 16#38#));
Write (This, 16#35#, (if Is_UXGA then 16#88# else 16#DA#));
Write (This, 16#22#, (if Is_UXGA then 16#0A# else 16#1A#));
Write (This, 16#37#, (if Is_UXGA then 16#40# else 16#C3#));
Write (This, 16#34#, (if Is_UXGA then 16#A0# else 16#C0#));
Write (This, 16#06#, (if Is_UXGA then 16#02# else 16#88#));
Write (This, 16#0D#, (if Is_UXGA then 16#B7# else 16#87#));
Write (This, 16#0E#, (if Is_UXGA then 16#01# else 16#41#));
Write (This, 16#42#, (if Is_UXGA then 16#83# else 16#03#));
Enable_DSP (This, False);
-- DSP bank selected
Write (This, REG_DSP_RESET, 2#0000_0100#); -- DVP
-- HSIZE8, VSIZE8 and SIZEL use the rela values, where HZISE, VSIZE,
-- VHYX use the value divided by 4 (shifted by 3)...
if Is_UXGA then
H_SIZE := To_Bit_Field (Resolutions (UXGA).Width);
V_SIZE := To_Bit_Field (Resolutions (UXGA).Height);
else
H_SIZE := To_Bit_Field (Resolutions (SVGA).Width);
V_SIZE := To_Bit_Field (Resolutions (SVGA).Height);
end if;
-- Real HSIZE[10..3]
Write (This, REG_DSP_HSIZE8, To_UInt8 (H_SIZE (3 .. 10)));
-- Real VSIZE[10..3]
Write (This, REG_DSP_VSIZE8, To_UInt8 (V_SIZE (3 .. 10)));
-- Real HSIZE[11] real HSIZE[2..0]
Write (This, REG_DSP_SIZEL,
To_UInt8 (V_SIZE (0 .. 2) & H_SIZE (0 .. 2) & (H_SIZE (11), 0)));
H_SIZE := To_Bit_Field (To_UInt16 (H_SIZE) / 4);
V_SIZE := To_Bit_Field (To_UInt16 (V_SIZE) / 4);
Write (This, REG_DSP_XOFFL, 0);
Write (This, REG_DSP_YOFFL, 0);
Write (This, REG_DSP_HSIZE, To_UInt8 (H_SIZE (0 .. 7)));
Write (This, REG_DSP_VSIZE, To_UInt8 (V_SIZE (0 .. 7)));
Write (This, REG_DSP_VHYX,
To_UInt8 ((0 => 0,
1 => 0,
2 => 0,
3 => H_SIZE (8),
4 => 0,
5 => 0,
6 => 0,
7 => V_SIZE (8))));
Write (This, REG_DSP_TEST,
To_UInt8 ((0 => 0,
1 => 0,
2 => 0,
3 => 0,
4 => 0,
5 => 0,
6 => 0,
7 => H_SIZE (9))));
Write (This, REG_DSP_CTRL2, 2#0011_1101#);
Write (This, REG_DSP_CTRLI, 2#1000_0000#); -- LP_DP
if Is_UXGA then
Write (This, REG_DSP_R_DVP_SP, 0); -- AUTO Mode, Div 0
else
Write (This, REG_DSP_R_DVP_SP, 4); -- AUTO Mode, Div 4
end if;
Enable_DSP (This, True);
Write (This, REG_DSP_RESET, 0);
end Set_Frame_Size;
--------------------
-- Set_Frame_Rate --
--------------------
procedure Set_Frame_Rate
(This : OV2640_Camera;
FR : Frame_Rate)
is
begin
null;
end Set_Frame_Rate;
-------------
-- Get_PID --
-------------
function Get_PID (This : OV2640_Camera) return UInt8 is
begin
Select_Sensor_Bank (This);
return Read (This, REG_SENSOR_PID);
end Get_PID;
------------------------------
-- Enable_Auto_Gain_Control --
------------------------------
procedure Enable_Auto_Gain_Control (This : OV2640_Camera;
Enable : Boolean := True)
is
COM8 : UInt8;
begin
Select_Sensor_Bank (This);
COM8 := Read (This, REG_SENSOR_COM8);
if Enable then
COM8 := COM8 or 2#0000_0100#;
else
COM8 := COM8 and 2#1111_1011#;
end if;
Write (This, REG_SENSOR_COM8, COM8);
end Enable_Auto_Gain_Control;
-------------------------------
-- Enable_Auto_White_Balance --
-------------------------------
procedure Enable_Auto_White_Balance (This : OV2640_Camera;
Enable : Boolean := True)
is
CTRL1 : UInt8;
begin
Select_DSP_Bank (This);
CTRL1 := Read (This, REG_DSP_CTRL1);
if Enable then
CTRL1 := CTRL1 or 2#0000_1000#;
else
CTRL1 := CTRL1 and 2#1111_0111#;
end if;
Write (This, REG_DSP_CTRL1, CTRL1);
end Enable_Auto_White_Balance;
----------------------------------
-- Enable_Auto_Exposure_Control --
----------------------------------
procedure Enable_Auto_Exposure_Control (This : OV2640_Camera;
Enable : Boolean := True)
is
CTRL0 : UInt8;
begin
Select_DSP_Bank (This);
CTRL0 := Read (This, REG_DSP_CTRL0);
if Enable then
CTRL0 := CTRL0 or 2#1000_0000#;
else
CTRL0 := CTRL0 and 2#0111_1111#;
end if;
Write (This, REG_DSP_CTRL0, CTRL0);
end Enable_Auto_Exposure_Control;
-----------------------------
-- Enable_Auto_Band_Filter --
-----------------------------
procedure Enable_Auto_Band_Filter (This : OV2640_Camera;
Enable : Boolean := True)
is
COM8 : UInt8;
begin
Select_Sensor_Bank (This);
COM8 := Read (This, REG_SENSOR_COM8);
if Enable then
COM8 := COM8 or 2#0010_0000#;
else
COM8 := COM8 and 2#1101_1111#;
end if;
Write (This, REG_SENSOR_COM8, COM8);
end Enable_Auto_Band_Filter;
end OV2640;
|
-- Adobe Experience Manager (AEM) API
-- Swagger AEM is an OpenAPI specification for Adobe Experience Manager (AEM) API
--
-- The version of the OpenAPI document: 3.5.0_pre.0
-- Contact: opensource@shinesolutions.com
--
-- NOTE: This package is auto generated by OpenAPI-Generator 5.2.1.
-- https://openapi-generator.tech
-- Do not edit the class manually.
pragma Warnings (Off, "*is not referenced");
with Swagger.Streams;
package body .Clients is
pragma Style_Checks ("-mr");
--
procedure Get_Aem_Product_Info
(Client : in out Client_Type;
Result : out Swagger.UString_Vectors.Vector) is
URI : Swagger.Clients.URI_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((1 => Swagger.Clients.APPLICATION_JSON));
URI.Set_Path ("/system/console/status-productinfo.json");
Client.Call (Swagger.Clients.GET, URI, Reply);
.Models.Deserialize (Reply, "", Result);
end Get_Aem_Product_Info;
--
procedure Get_Bundle_Info
(Client : in out Client_Type;
Name : in Swagger.UString;
Result : out .Models.BundleInfo_Type) is
URI : Swagger.Clients.URI_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((1 => Swagger.Clients.APPLICATION_JSON));
URI.Set_Path ("/system/console/bundles/{name}.json");
URI.Set_Path_Param ("name", Name);
Client.Call (Swagger.Clients.GET, URI, Reply);
.Models.Deserialize (Reply, "", Result);
end Get_Bundle_Info;
--
procedure Get_Config_Mgr
(Client : in out Client_Type;
Result : out Swagger.UString) is
URI : Swagger.Clients.URI_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((1 => Swagger.Clients.TEXT_XML));
URI.Set_Path ("/system/console/configMgr");
Client.Call (Swagger.Clients.GET, URI, Reply);
.Models.Deserialize (Reply, "", Result);
end Get_Config_Mgr;
--
procedure Post_Bundle
(Client : in out Client_Type;
Name : in Swagger.UString;
Action : in Swagger.UString) is
URI : Swagger.Clients.URI_Type;
begin
URI.Add_Param ("action", Action);
URI.Set_Path ("/system/console/bundles/{name}");
URI.Set_Path_Param ("name", Name);
Client.Call (Swagger.Clients.POST, URI);
end Post_Bundle;
--
procedure Post_Jmx_Repository
(Client : in out Client_Type;
Action : in Swagger.UString) is
URI : Swagger.Clients.URI_Type;
begin
URI.Set_Path ("/system/console/jmx/com.adobe.granite:type=Repository/op/{action}");
URI.Set_Path_Param ("action", Action);
Client.Call (Swagger.Clients.POST, URI);
end Post_Jmx_Repository;
--
procedure Post_Saml_Configuration
(Client : in out Client_Type;
Post : in Swagger.Nullable_Boolean;
Apply : in Swagger.Nullable_Boolean;
Delete : in Swagger.Nullable_Boolean;
Action : in Swagger.Nullable_UString;
Dollarlocation : in Swagger.Nullable_UString;
Path : in Swagger.UString_Vectors.Vector;
Service_Periodranking : in Swagger.Nullable_Integer;
Idp_Url : in Swagger.Nullable_UString;
Idp_Cert_Alias : in Swagger.Nullable_UString;
Idp_Http_Redirect : in Swagger.Nullable_Boolean;
Service_Provider_Entity_Id : in Swagger.Nullable_UString;
Assertion_Consumer_Service_URL : in Swagger.Nullable_UString;
Sp_Private_Key_Alias : in Swagger.Nullable_UString;
Key_Store_Password : in Swagger.Nullable_UString;
Default_Redirect_Url : in Swagger.Nullable_UString;
User_IDAttribute : in Swagger.Nullable_UString;
Use_Encryption : in Swagger.Nullable_Boolean;
Create_User : in Swagger.Nullable_Boolean;
Add_Group_Memberships : in Swagger.Nullable_Boolean;
Group_Membership_Attribute : in Swagger.Nullable_UString;
Default_Groups : in Swagger.UString_Vectors.Vector;
Name_Id_Format : in Swagger.Nullable_UString;
Synchronize_Attributes : in Swagger.UString_Vectors.Vector;
Handle_Logout : in Swagger.Nullable_Boolean;
Logout_Url : in Swagger.Nullable_UString;
Clock_Tolerance : in Swagger.Nullable_Integer;
Digest_Method : in Swagger.Nullable_UString;
Signature_Method : in Swagger.Nullable_UString;
User_Intermediate_Path : in Swagger.Nullable_UString;
Propertylist : in Swagger.UString_Vectors.Vector;
Result : out .Models.SamlConfigurationInfo_Type) is
URI : Swagger.Clients.URI_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((1 => Swagger.Clients.TEXT_PLAIN));
URI.Add_Param ("post", Post);
URI.Add_Param ("apply", Apply);
URI.Add_Param ("delete", Delete);
URI.Add_Param ("action", Action);
URI.Add_Param ("$location", Dollarlocation);
URI.Add_Param ("path", Path);
URI.Add_Param ("service.ranking", Service_Periodranking);
URI.Add_Param ("idpUrl", Idp_Url);
URI.Add_Param ("idpCertAlias", Idp_Cert_Alias);
URI.Add_Param ("idpHttpRedirect", Idp_Http_Redirect);
URI.Add_Param ("serviceProviderEntityId", Service_Provider_Entity_Id);
URI.Add_Param ("assertionConsumerServiceURL", Assertion_Consumer_Service_URL);
URI.Add_Param ("spPrivateKeyAlias", Sp_Private_Key_Alias);
URI.Add_Param ("keyStorePassword", Key_Store_Password);
URI.Add_Param ("defaultRedirectUrl", Default_Redirect_Url);
URI.Add_Param ("userIDAttribute", User_IDAttribute);
URI.Add_Param ("useEncryption", Use_Encryption);
URI.Add_Param ("createUser", Create_User);
URI.Add_Param ("addGroupMemberships", Add_Group_Memberships);
URI.Add_Param ("groupMembershipAttribute", Group_Membership_Attribute);
URI.Add_Param ("defaultGroups", Default_Groups);
URI.Add_Param ("nameIdFormat", Name_Id_Format);
URI.Add_Param ("synchronizeAttributes", Synchronize_Attributes);
URI.Add_Param ("handleLogout", Handle_Logout);
URI.Add_Param ("logoutUrl", Logout_Url);
URI.Add_Param ("clockTolerance", Clock_Tolerance);
URI.Add_Param ("digestMethod", Digest_Method);
URI.Add_Param ("signatureMethod", Signature_Method);
URI.Add_Param ("userIntermediatePath", User_Intermediate_Path);
URI.Add_Param ("propertylist", Propertylist);
URI.Set_Path ("/system/console/configMgr/com.adobe.granite.auth.saml.SamlAuthenticationHandler");
Client.Call (Swagger.Clients.POST, URI, Reply);
.Models.Deserialize (Reply, "", Result);
end Post_Saml_Configuration;
--
procedure Get_Login_Page
(Client : in out Client_Type;
Result : out Swagger.UString) is
URI : Swagger.Clients.URI_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((1 => Swagger.Clients.TEXT_HTML));
URI.Set_Path ("/libs/granite/core/content/login.html");
Client.Call (Swagger.Clients.GET, URI, Reply);
.Models.Deserialize (Reply, "", Result);
end Get_Login_Page;
--
procedure Post_Cq_Actions
(Client : in out Client_Type;
Authorizable_Id : in Swagger.UString;
Changelog : in Swagger.UString) is
URI : Swagger.Clients.URI_Type;
begin
URI.Add_Param ("authorizableId", Authorizable_Id);
URI.Add_Param ("changelog", Changelog);
URI.Set_Path ("/.cqactions.html");
Client.Call (Swagger.Clients.POST, URI);
end Post_Cq_Actions;
--
procedure Get_Crxde_Status
(Client : in out Client_Type;
Result : out Swagger.UString) is
URI : Swagger.Clients.URI_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((1 => Swagger.Clients.PLAIN_TEXT));
URI.Set_Path ("/crx/server/crx.default/jcr:root/.1.json");
Client.Call (Swagger.Clients.GET, URI, Reply);
.Models.Deserialize (Reply, "", Result);
end Get_Crxde_Status;
--
procedure Get_Install_Status
(Client : in out Client_Type;
Result : out .Models.InstallStatus_Type) is
URI : Swagger.Clients.URI_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((1 => Swagger.Clients.APPLICATION_JSON));
URI.Set_Path ("/crx/packmgr/installstatus.jsp");
Client.Call (Swagger.Clients.GET, URI, Reply);
.Models.Deserialize (Reply, "", Result);
end Get_Install_Status;
--
procedure Get_Package_Manager_Servlet
(Client : in out Client_Type) is
URI : Swagger.Clients.URI_Type;
begin
Client.Set_Accept ((1 => Swagger.Clients.TEXT_HTML));
URI.Set_Path ("/crx/packmgr/service/script.html");
Client.Call (Swagger.Clients.GET, URI);
end Get_Package_Manager_Servlet;
--
procedure Post_Package_Service
(Client : in out Client_Type;
Cmd : in Swagger.UString;
Result : out Swagger.UString) is
URI : Swagger.Clients.URI_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((1 => Swagger.Clients.TEXT_XML));
URI.Add_Param ("cmd", Cmd);
URI.Set_Path ("/crx/packmgr/service.jsp");
Client.Call (Swagger.Clients.POST, URI, Reply);
.Models.Deserialize (Reply, "", Result);
end Post_Package_Service;
--
procedure Post_Package_Service_Json
(Client : in out Client_Type;
Path : in Swagger.UString;
Cmd : in Swagger.UString;
Group_Name : in Swagger.Nullable_UString;
Package_Name : in Swagger.Nullable_UString;
Package_Version : in Swagger.Nullable_UString;
Charset : in Swagger.Nullable_UString;
Force : in Swagger.Nullable_Boolean;
Recursive : in Swagger.Nullable_Boolean;
P_Package : in Swagger.File_Part_Type;
Result : out Swagger.UString) is
URI : Swagger.Clients.URI_Type;
Req : Swagger.Clients.Request_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((1 => Swagger.Clients.APPLICATION_JSON));
Client.Initialize (Req, (1 => Swagger.Clients.APPLICATION_FORM));
.Models.Serialize (Req.Stream, "package", P_Package);
URI.Add_Param ("cmd", Cmd);
URI.Add_Param ("groupName", Group_Name);
URI.Add_Param ("packageName", Package_Name);
URI.Add_Param ("packageVersion", Package_Version);
URI.Add_Param ("_charset_", Charset);
URI.Add_Param ("force", Force);
URI.Add_Param ("recursive", Recursive);
URI.Set_Path ("/crx/packmgr/service/.json/{path}");
URI.Set_Path_Param ("path", Path);
Client.Call (Swagger.Clients.POST, URI, Req, Reply);
.Models.Deserialize (Reply, "", Result);
end Post_Package_Service_Json;
--
procedure Post_Package_Update
(Client : in out Client_Type;
Group_Name : in Swagger.UString;
Package_Name : in Swagger.UString;
Version : in Swagger.UString;
Path : in Swagger.UString;
Filter : in Swagger.Nullable_UString;
Charset : in Swagger.Nullable_UString;
Result : out Swagger.UString) is
URI : Swagger.Clients.URI_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((1 => Swagger.Clients.APPLICATION_JSON));
URI.Add_Param ("groupName", Group_Name);
URI.Add_Param ("packageName", Package_Name);
URI.Add_Param ("version", Version);
URI.Add_Param ("path", Path);
URI.Add_Param ("filter", Filter);
URI.Add_Param ("_charset_", Charset);
URI.Set_Path ("/crx/packmgr/update.jsp");
Client.Call (Swagger.Clients.POST, URI, Reply);
.Models.Deserialize (Reply, "", Result);
end Post_Package_Update;
--
procedure Post_Set_Password
(Client : in out Client_Type;
Old : in Swagger.UString;
Plain : in Swagger.UString;
Verify : in Swagger.UString;
Result : out Swagger.UString) is
URI : Swagger.Clients.URI_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((1 => Swagger.Clients.TEXT_PLAIN));
URI.Add_Param ("old", Old);
URI.Add_Param ("plain", Plain);
URI.Add_Param ("verify", Verify);
URI.Set_Path ("/crx/explorer/ui/setpassword.jsp");
Client.Call (Swagger.Clients.POST, URI, Reply);
.Models.Deserialize (Reply, "", Result);
end Post_Set_Password;
--
procedure Get_Aem_Health_Check
(Client : in out Client_Type;
Tags : in Swagger.Nullable_UString;
Combine_Tags_Or : in Swagger.Nullable_Boolean;
Result : out Swagger.UString) is
URI : Swagger.Clients.URI_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((1 => Swagger.Clients.APPLICATION_JSON));
URI.Add_Param ("tags", Tags);
URI.Add_Param ("combineTagsOr", Combine_Tags_Or);
URI.Set_Path ("/system/health");
Client.Call (Swagger.Clients.GET, URI, Reply);
.Models.Deserialize (Reply, "", Result);
end Get_Aem_Health_Check;
--
procedure Post_Config_Aem_Health_Check_Servlet
(Client : in out Client_Type;
Bundles_Periodignored : in Swagger.UString_Vectors.Vector;
Bundles_Periodignored_At_Type_Hint : in Swagger.Nullable_UString) is
URI : Swagger.Clients.URI_Type;
begin
URI.Add_Param ("bundles.ignored", Bundles_Periodignored);
URI.Add_Param ("bundles.ignored@TypeHint", Bundles_Periodignored_At_Type_Hint);
URI.Set_Path ("/apps/system/config/com.shinesolutions.healthcheck.hc.impl.ActiveBundleHealthCheck");
Client.Call (Swagger.Clients.POST, URI);
end Post_Config_Aem_Health_Check_Servlet;
--
procedure Post_Config_Aem_Password_Reset
(Client : in out Client_Type;
Pwdreset_Periodauthorizables : in Swagger.UString_Vectors.Vector;
Pwdreset_Periodauthorizables_At_Type_Hint : in Swagger.Nullable_UString) is
URI : Swagger.Clients.URI_Type;
begin
URI.Add_Param ("pwdreset.authorizables", Pwdreset_Periodauthorizables);
URI.Add_Param ("pwdreset.authorizables@TypeHint", Pwdreset_Periodauthorizables_At_Type_Hint);
URI.Set_Path ("/apps/system/config/com.shinesolutions.aem.passwordreset.Activator");
Client.Call (Swagger.Clients.POST, URI);
end Post_Config_Aem_Password_Reset;
--
procedure Ssl_Setup
(Client : in out Client_Type;
Keystore_Password : in Swagger.UString;
Keystore_Password_Confirm : in Swagger.UString;
Truststore_Password : in Swagger.UString;
Truststore_Password_Confirm : in Swagger.UString;
Https_Hostname : in Swagger.UString;
Https_Port : in Swagger.UString;
Privatekey_File : in Swagger.File_Part_Type;
Certificate_File : in Swagger.File_Part_Type;
Result : out Swagger.UString) is
URI : Swagger.Clients.URI_Type;
Req : Swagger.Clients.Request_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((1 => Swagger.Clients.TEXT_PLAIN));
Client.Initialize (Req, (1 => Swagger.Clients.APPLICATION_FORM));
.Models.Serialize (Req.Stream, "privatekeyFile", Privatekey_File);
.Models.Serialize (Req.Stream, "certificateFile", Certificate_File);
URI.Add_Param ("keystorePassword", Keystore_Password);
URI.Add_Param ("keystorePasswordConfirm", Keystore_Password_Confirm);
URI.Add_Param ("truststorePassword", Truststore_Password);
URI.Add_Param ("truststorePasswordConfirm", Truststore_Password_Confirm);
URI.Add_Param ("httpsHostname", Https_Hostname);
URI.Add_Param ("httpsPort", Https_Port);
URI.Set_Path ("/libs/granite/security/post/sslSetup.html");
Client.Call (Swagger.Clients.POST, URI, Req, Reply);
.Models.Deserialize (Reply, "", Result);
end Ssl_Setup;
--
procedure Delete_Agent
(Client : in out Client_Type;
Runmode : in Swagger.UString;
Name : in Swagger.UString) is
URI : Swagger.Clients.URI_Type;
begin
URI.Set_Path ("/etc/replication/agents.{runmode}/{name}");
URI.Set_Path_Param ("runmode", Runmode);
URI.Set_Path_Param ("name", Name);
Client.Call (Swagger.Clients.DELETE, URI);
end Delete_Agent;
--
procedure Delete_Node
(Client : in out Client_Type;
Path : in Swagger.UString;
Name : in Swagger.UString) is
URI : Swagger.Clients.URI_Type;
begin
URI.Set_Path ("/{path}/{name}");
URI.Set_Path_Param ("path", Path);
URI.Set_Path_Param ("name", Name);
Client.Call (Swagger.Clients.DELETE, URI);
end Delete_Node;
--
procedure Get_Agent
(Client : in out Client_Type;
Runmode : in Swagger.UString;
Name : in Swagger.UString) is
URI : Swagger.Clients.URI_Type;
begin
URI.Set_Path ("/etc/replication/agents.{runmode}/{name}");
URI.Set_Path_Param ("runmode", Runmode);
URI.Set_Path_Param ("name", Name);
Client.Call (Swagger.Clients.GET, URI);
end Get_Agent;
--
procedure Get_Agents
(Client : in out Client_Type;
Runmode : in Swagger.UString;
Result : out Swagger.UString) is
URI : Swagger.Clients.URI_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((1 => Swagger.Clients.APPLICATION_JSON));
URI.Set_Path ("/etc/replication/agents.{runmode}.-1.json");
URI.Set_Path_Param ("runmode", Runmode);
Client.Call (Swagger.Clients.GET, URI, Reply);
.Models.Deserialize (Reply, "", Result);
end Get_Agents;
--
procedure Get_Authorizable_Keystore
(Client : in out Client_Type;
Intermediate_Path : in Swagger.UString;
Authorizable_Id : in Swagger.UString;
Result : out .Models.KeystoreInfo_Type) is
URI : Swagger.Clients.URI_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((1 => Swagger.Clients.TEXT_PLAIN));
URI.Set_Path ("/{intermediatePath}/{authorizableId}.ks.json");
URI.Set_Path_Param ("intermediatePath", Intermediate_Path);
URI.Set_Path_Param ("authorizableId", Authorizable_Id);
Client.Call (Swagger.Clients.GET, URI, Reply);
.Models.Deserialize (Reply, "", Result);
end Get_Authorizable_Keystore;
--
procedure Get_Keystore
(Client : in out Client_Type;
Intermediate_Path : in Swagger.UString;
Authorizable_Id : in Swagger.UString;
Result : out Swagger.Http_Content_Type) is
URI : Swagger.Clients.URI_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((1 => Swagger.Clients.APPLICATION_OCTET_STREAM));
URI.Set_Path ("/{intermediatePath}/{authorizableId}/keystore/store.p12");
URI.Set_Path_Param ("intermediatePath", Intermediate_Path);
URI.Set_Path_Param ("authorizableId", Authorizable_Id);
Client.Call (Swagger.Clients.GET, URI, Reply);
.Models.Deserialize (Reply, "", Result);
end Get_Keystore;
--
procedure Get_Node
(Client : in out Client_Type;
Path : in Swagger.UString;
Name : in Swagger.UString) is
URI : Swagger.Clients.URI_Type;
begin
URI.Set_Path ("/{path}/{name}");
URI.Set_Path_Param ("path", Path);
URI.Set_Path_Param ("name", Name);
Client.Call (Swagger.Clients.GET, URI);
end Get_Node;
--
procedure Get_Package
(Client : in out Client_Type;
Group : in Swagger.UString;
Name : in Swagger.UString;
Version : in Swagger.UString;
Result : out Swagger.Http_Content_Type) is
URI : Swagger.Clients.URI_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((1 => Swagger.Clients.APPLICATION_OCTET_STREAM));
URI.Set_Path ("/etc/packages/{group}/{name}-{version}.zip");
URI.Set_Path_Param ("group", Group);
URI.Set_Path_Param ("name", Name);
URI.Set_Path_Param ("version", Version);
Client.Call (Swagger.Clients.GET, URI, Reply);
.Models.Deserialize (Reply, "", Result);
end Get_Package;
--
procedure Get_Package_Filter
(Client : in out Client_Type;
Group : in Swagger.UString;
Name : in Swagger.UString;
Version : in Swagger.UString;
Result : out Swagger.UString) is
URI : Swagger.Clients.URI_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((1 => Swagger.Clients.APPLICATION_JSON));
URI.Set_Path ("/etc/packages/{group}/{name}-{version}.zip/jcr:content/vlt:definition/filter.tidy.2.json");
URI.Set_Path_Param ("group", Group);
URI.Set_Path_Param ("name", Name);
URI.Set_Path_Param ("version", Version);
Client.Call (Swagger.Clients.GET, URI, Reply);
.Models.Deserialize (Reply, "", Result);
end Get_Package_Filter;
--
procedure Get_Query
(Client : in out Client_Type;
Path : in Swagger.UString;
P_Periodlimit : in Swagger.Number;
P_1Property : in Swagger.UString;
P_1Property_Periodvalue : in Swagger.UString;
Result : out Swagger.UString) is
URI : Swagger.Clients.URI_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((1 => Swagger.Clients.APPLICATION_JSON));
URI.Add_Param ("path", Path);
URI.Add_Param ("p.limit", P_Periodlimit);
URI.Add_Param ("1_property", P_1Property);
URI.Add_Param ("1_property.value", P_1Property_Periodvalue);
URI.Set_Path ("/bin/querybuilder.json");
Client.Call (Swagger.Clients.GET, URI, Reply);
.Models.Deserialize (Reply, "", Result);
end Get_Query;
--
procedure Get_Truststore
(Client : in out Client_Type;
Result : out Swagger.Http_Content_Type) is
URI : Swagger.Clients.URI_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((1 => Swagger.Clients.APPLICATION_OCTET_STREAM));
URI.Set_Path ("/etc/truststore/truststore.p12");
Client.Call (Swagger.Clients.GET, URI, Reply);
.Models.Deserialize (Reply, "", Result);
end Get_Truststore;
--
procedure Get_Truststore_Info
(Client : in out Client_Type;
Result : out .Models.TruststoreInfo_Type) is
URI : Swagger.Clients.URI_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((1 => Swagger.Clients.APPLICATION_JSON));
URI.Set_Path ("/libs/granite/security/truststore.json");
Client.Call (Swagger.Clients.GET, URI, Reply);
.Models.Deserialize (Reply, "", Result);
end Get_Truststore_Info;
--
procedure Post_Agent
(Client : in out Client_Type;
Runmode : in Swagger.UString;
Name : in Swagger.UString;
Jcr_Content_Slashcq_Distribute : in Swagger.Nullable_Boolean;
Jcr_Content_Slashcq_Distribute_At_Type_Hint : in Swagger.Nullable_UString;
Jcr_Content_Slashcq_Name : in Swagger.Nullable_UString;
Jcr_Content_Slashcq_Template : in Swagger.Nullable_UString;
Jcr_Content_Slashenabled : in Swagger.Nullable_Boolean;
Jcr_Content_Slashjcr_Description : in Swagger.Nullable_UString;
Jcr_Content_Slashjcr_Last_Modified : in Swagger.Nullable_UString;
Jcr_Content_Slashjcr_Last_Modified_By : in Swagger.Nullable_UString;
Jcr_Content_Slashjcr_Mixin_Types : in Swagger.Nullable_UString;
Jcr_Content_Slashjcr_Title : in Swagger.Nullable_UString;
Jcr_Content_Slashlog_Level : in Swagger.Nullable_UString;
Jcr_Content_Slashno_Status_Update : in Swagger.Nullable_Boolean;
Jcr_Content_Slashno_Versioning : in Swagger.Nullable_Boolean;
Jcr_Content_Slashprotocol_Connect_Timeout : in Swagger.Number;
Jcr_Content_Slashprotocol_HTTPConnection_Closed : in Swagger.Nullable_Boolean;
Jcr_Content_Slashprotocol_HTTPExpired : in Swagger.Nullable_UString;
Jcr_Content_Slashprotocol_HTTPHeaders : in Swagger.UString_Vectors.Vector;
Jcr_Content_Slashprotocol_HTTPHeaders_At_Type_Hint : in Swagger.Nullable_UString;
Jcr_Content_Slashprotocol_HTTPMethod : in Swagger.Nullable_UString;
Jcr_Content_Slashprotocol_HTTPSRelaxed : in Swagger.Nullable_Boolean;
Jcr_Content_Slashprotocol_Interface : in Swagger.Nullable_UString;
Jcr_Content_Slashprotocol_Socket_Timeout : in Swagger.Number;
Jcr_Content_Slashprotocol_Version : in Swagger.Nullable_UString;
Jcr_Content_Slashproxy_NTLMDomain : in Swagger.Nullable_UString;
Jcr_Content_Slashproxy_NTLMHost : in Swagger.Nullable_UString;
Jcr_Content_Slashproxy_Host : in Swagger.Nullable_UString;
Jcr_Content_Slashproxy_Password : in Swagger.Nullable_UString;
Jcr_Content_Slashproxy_Port : in Swagger.Number;
Jcr_Content_Slashproxy_User : in Swagger.Nullable_UString;
Jcr_Content_Slashqueue_Batch_Max_Size : in Swagger.Number;
Jcr_Content_Slashqueue_Batch_Mode : in Swagger.Nullable_UString;
Jcr_Content_Slashqueue_Batch_Wait_Time : in Swagger.Number;
Jcr_Content_Slashretry_Delay : in Swagger.Nullable_UString;
Jcr_Content_Slashreverse_Replication : in Swagger.Nullable_Boolean;
Jcr_Content_Slashserialization_Type : in Swagger.Nullable_UString;
Jcr_Content_Slashsling_Resource_Type : in Swagger.Nullable_UString;
Jcr_Content_Slashssl : in Swagger.Nullable_UString;
Jcr_Content_Slashtransport_NTLMDomain : in Swagger.Nullable_UString;
Jcr_Content_Slashtransport_NTLMHost : in Swagger.Nullable_UString;
Jcr_Content_Slashtransport_Password : in Swagger.Nullable_UString;
Jcr_Content_Slashtransport_Uri : in Swagger.Nullable_UString;
Jcr_Content_Slashtransport_User : in Swagger.Nullable_UString;
Jcr_Content_Slashtrigger_Distribute : in Swagger.Nullable_Boolean;
Jcr_Content_Slashtrigger_Modified : in Swagger.Nullable_Boolean;
Jcr_Content_Slashtrigger_On_Off_Time : in Swagger.Nullable_Boolean;
Jcr_Content_Slashtrigger_Receive : in Swagger.Nullable_Boolean;
Jcr_Content_Slashtrigger_Specific : in Swagger.Nullable_Boolean;
Jcr_Content_Slashuser_Id : in Swagger.Nullable_UString;
Jcr_Primary_Type : in Swagger.Nullable_UString;
Operation : in Swagger.Nullable_UString) is
URI : Swagger.Clients.URI_Type;
begin
URI.Add_Param ("jcr:content/cq:distribute", Jcr_Content_Slashcq_Distribute);
URI.Add_Param ("jcr:content/cq:distribute@TypeHint", Jcr_Content_Slashcq_Distribute_At_Type_Hint);
URI.Add_Param ("jcr:content/cq:name", Jcr_Content_Slashcq_Name);
URI.Add_Param ("jcr:content/cq:template", Jcr_Content_Slashcq_Template);
URI.Add_Param ("jcr:content/enabled", Jcr_Content_Slashenabled);
URI.Add_Param ("jcr:content/jcr:description", Jcr_Content_Slashjcr_Description);
URI.Add_Param ("jcr:content/jcr:lastModified", Jcr_Content_Slashjcr_Last_Modified);
URI.Add_Param ("jcr:content/jcr:lastModifiedBy", Jcr_Content_Slashjcr_Last_Modified_By);
URI.Add_Param ("jcr:content/jcr:mixinTypes", Jcr_Content_Slashjcr_Mixin_Types);
URI.Add_Param ("jcr:content/jcr:title", Jcr_Content_Slashjcr_Title);
URI.Add_Param ("jcr:content/logLevel", Jcr_Content_Slashlog_Level);
URI.Add_Param ("jcr:content/noStatusUpdate", Jcr_Content_Slashno_Status_Update);
URI.Add_Param ("jcr:content/noVersioning", Jcr_Content_Slashno_Versioning);
URI.Add_Param ("jcr:content/protocolConnectTimeout", Jcr_Content_Slashprotocol_Connect_Timeout);
URI.Add_Param ("jcr:content/protocolHTTPConnectionClosed", Jcr_Content_Slashprotocol_HTTPConnection_Closed);
URI.Add_Param ("jcr:content/protocolHTTPExpired", Jcr_Content_Slashprotocol_HTTPExpired);
URI.Add_Param ("jcr:content/protocolHTTPHeaders", Jcr_Content_Slashprotocol_HTTPHeaders);
URI.Add_Param ("jcr:content/protocolHTTPHeaders@TypeHint", Jcr_Content_Slashprotocol_HTTPHeaders_At_Type_Hint);
URI.Add_Param ("jcr:content/protocolHTTPMethod", Jcr_Content_Slashprotocol_HTTPMethod);
URI.Add_Param ("jcr:content/protocolHTTPSRelaxed", Jcr_Content_Slashprotocol_HTTPSRelaxed);
URI.Add_Param ("jcr:content/protocolInterface", Jcr_Content_Slashprotocol_Interface);
URI.Add_Param ("jcr:content/protocolSocketTimeout", Jcr_Content_Slashprotocol_Socket_Timeout);
URI.Add_Param ("jcr:content/protocolVersion", Jcr_Content_Slashprotocol_Version);
URI.Add_Param ("jcr:content/proxyNTLMDomain", Jcr_Content_Slashproxy_NTLMDomain);
URI.Add_Param ("jcr:content/proxyNTLMHost", Jcr_Content_Slashproxy_NTLMHost);
URI.Add_Param ("jcr:content/proxyHost", Jcr_Content_Slashproxy_Host);
URI.Add_Param ("jcr:content/proxyPassword", Jcr_Content_Slashproxy_Password);
URI.Add_Param ("jcr:content/proxyPort", Jcr_Content_Slashproxy_Port);
URI.Add_Param ("jcr:content/proxyUser", Jcr_Content_Slashproxy_User);
URI.Add_Param ("jcr:content/queueBatchMaxSize", Jcr_Content_Slashqueue_Batch_Max_Size);
URI.Add_Param ("jcr:content/queueBatchMode", Jcr_Content_Slashqueue_Batch_Mode);
URI.Add_Param ("jcr:content/queueBatchWaitTime", Jcr_Content_Slashqueue_Batch_Wait_Time);
URI.Add_Param ("jcr:content/retryDelay", Jcr_Content_Slashretry_Delay);
URI.Add_Param ("jcr:content/reverseReplication", Jcr_Content_Slashreverse_Replication);
URI.Add_Param ("jcr:content/serializationType", Jcr_Content_Slashserialization_Type);
URI.Add_Param ("jcr:content/sling:resourceType", Jcr_Content_Slashsling_Resource_Type);
URI.Add_Param ("jcr:content/ssl", Jcr_Content_Slashssl);
URI.Add_Param ("jcr:content/transportNTLMDomain", Jcr_Content_Slashtransport_NTLMDomain);
URI.Add_Param ("jcr:content/transportNTLMHost", Jcr_Content_Slashtransport_NTLMHost);
URI.Add_Param ("jcr:content/transportPassword", Jcr_Content_Slashtransport_Password);
URI.Add_Param ("jcr:content/transportUri", Jcr_Content_Slashtransport_Uri);
URI.Add_Param ("jcr:content/transportUser", Jcr_Content_Slashtransport_User);
URI.Add_Param ("jcr:content/triggerDistribute", Jcr_Content_Slashtrigger_Distribute);
URI.Add_Param ("jcr:content/triggerModified", Jcr_Content_Slashtrigger_Modified);
URI.Add_Param ("jcr:content/triggerOnOffTime", Jcr_Content_Slashtrigger_On_Off_Time);
URI.Add_Param ("jcr:content/triggerReceive", Jcr_Content_Slashtrigger_Receive);
URI.Add_Param ("jcr:content/triggerSpecific", Jcr_Content_Slashtrigger_Specific);
URI.Add_Param ("jcr:content/userId", Jcr_Content_Slashuser_Id);
URI.Add_Param ("jcr:primaryType", Jcr_Primary_Type);
URI.Add_Param (":operation", Operation);
URI.Set_Path ("/etc/replication/agents.{runmode}/{name}");
URI.Set_Path_Param ("runmode", Runmode);
URI.Set_Path_Param ("name", Name);
Client.Call (Swagger.Clients.POST, URI);
end Post_Agent;
--
procedure Post_Authorizable_Keystore
(Client : in out Client_Type;
Intermediate_Path : in Swagger.UString;
Authorizable_Id : in Swagger.UString;
Operation : in Swagger.Nullable_UString;
Current_Password : in Swagger.Nullable_UString;
New_Password : in Swagger.Nullable_UString;
Re_Password : in Swagger.Nullable_UString;
Key_Password : in Swagger.Nullable_UString;
Key_Store_Pass : in Swagger.Nullable_UString;
Alias : in Swagger.Nullable_UString;
New_Alias : in Swagger.Nullable_UString;
Remove_Alias : in Swagger.Nullable_UString;
Cert_Chain : in Swagger.File_Part_Type;
Pk : in Swagger.File_Part_Type;
Key_Store : in Swagger.File_Part_Type;
Result : out .Models.KeystoreInfo_Type) is
URI : Swagger.Clients.URI_Type;
Req : Swagger.Clients.Request_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((1 => Swagger.Clients.TEXT_PLAIN));
Client.Initialize (Req, (1 => Swagger.Clients.APPLICATION_FORM));
.Models.Serialize (Req.Stream, "cert-chain", Cert_Chain);
.Models.Serialize (Req.Stream, "pk", Pk);
.Models.Serialize (Req.Stream, "keyStore", Key_Store);
URI.Add_Param (":operation", Operation);
URI.Add_Param ("currentPassword", Current_Password);
URI.Add_Param ("newPassword", New_Password);
URI.Add_Param ("rePassword", Re_Password);
URI.Add_Param ("keyPassword", Key_Password);
URI.Add_Param ("keyStorePass", Key_Store_Pass);
URI.Add_Param ("alias", Alias);
URI.Add_Param ("newAlias", New_Alias);
URI.Add_Param ("removeAlias", Remove_Alias);
URI.Set_Path ("/{intermediatePath}/{authorizableId}.ks.html");
URI.Set_Path_Param ("intermediatePath", Intermediate_Path);
URI.Set_Path_Param ("authorizableId", Authorizable_Id);
Client.Call (Swagger.Clients.POST, URI, Req, Reply);
.Models.Deserialize (Reply, "", Result);
end Post_Authorizable_Keystore;
--
procedure Post_Authorizables
(Client : in out Client_Type;
Authorizable_Id : in Swagger.UString;
Intermediate_Path : in Swagger.UString;
Create_User : in Swagger.Nullable_UString;
Create_Group : in Swagger.Nullable_UString;
Rep_Password : in Swagger.Nullable_UString;
Profile_Slashgiven_Name : in Swagger.Nullable_UString;
Result : out Swagger.UString) is
URI : Swagger.Clients.URI_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((1 => Swagger.Clients.TEXT_HTML));
URI.Add_Param ("authorizableId", Authorizable_Id);
URI.Add_Param ("intermediatePath", Intermediate_Path);
URI.Add_Param ("createUser", Create_User);
URI.Add_Param ("createGroup", Create_Group);
URI.Add_Param ("rep:password", Rep_Password);
URI.Add_Param ("profile/givenName", Profile_Slashgiven_Name);
URI.Set_Path ("/libs/granite/security/post/authorizables");
Client.Call (Swagger.Clients.POST, URI, Reply);
.Models.Deserialize (Reply, "", Result);
end Post_Authorizables;
--
procedure Post_Config_Adobe_Granite_Saml_Authentication_Handler
(Client : in out Client_Type;
Key_Store_Password : in Swagger.Nullable_UString;
Key_Store_Password_At_Type_Hint : in Swagger.Nullable_UString;
Service_Periodranking : in Swagger.Nullable_Integer;
Service_Periodranking_At_Type_Hint : in Swagger.Nullable_UString;
Idp_Http_Redirect : in Swagger.Nullable_Boolean;
Idp_Http_Redirect_At_Type_Hint : in Swagger.Nullable_UString;
Create_User : in Swagger.Nullable_Boolean;
Create_User_At_Type_Hint : in Swagger.Nullable_UString;
Default_Redirect_Url : in Swagger.Nullable_UString;
Default_Redirect_Url_At_Type_Hint : in Swagger.Nullable_UString;
User_IDAttribute : in Swagger.Nullable_UString;
User_IDAttribute_At_Type_Hint : in Swagger.Nullable_UString;
Default_Groups : in Swagger.UString_Vectors.Vector;
Default_Groups_At_Type_Hint : in Swagger.Nullable_UString;
Idp_Cert_Alias : in Swagger.Nullable_UString;
Idp_Cert_Alias_At_Type_Hint : in Swagger.Nullable_UString;
Add_Group_Memberships : in Swagger.Nullable_Boolean;
Add_Group_Memberships_At_Type_Hint : in Swagger.Nullable_UString;
Path : in Swagger.UString_Vectors.Vector;
Path_At_Type_Hint : in Swagger.Nullable_UString;
Synchronize_Attributes : in Swagger.UString_Vectors.Vector;
Synchronize_Attributes_At_Type_Hint : in Swagger.Nullable_UString;
Clock_Tolerance : in Swagger.Nullable_Integer;
Clock_Tolerance_At_Type_Hint : in Swagger.Nullable_UString;
Group_Membership_Attribute : in Swagger.Nullable_UString;
Group_Membership_Attribute_At_Type_Hint : in Swagger.Nullable_UString;
Idp_Url : in Swagger.Nullable_UString;
Idp_Url_At_Type_Hint : in Swagger.Nullable_UString;
Logout_Url : in Swagger.Nullable_UString;
Logout_Url_At_Type_Hint : in Swagger.Nullable_UString;
Service_Provider_Entity_Id : in Swagger.Nullable_UString;
Service_Provider_Entity_Id_At_Type_Hint : in Swagger.Nullable_UString;
Assertion_Consumer_Service_URL : in Swagger.Nullable_UString;
Assertion_Consumer_Service_URLAt_Type_Hint : in Swagger.Nullable_UString;
Handle_Logout : in Swagger.Nullable_Boolean;
Handle_Logout_At_Type_Hint : in Swagger.Nullable_UString;
Sp_Private_Key_Alias : in Swagger.Nullable_UString;
Sp_Private_Key_Alias_At_Type_Hint : in Swagger.Nullable_UString;
Use_Encryption : in Swagger.Nullable_Boolean;
Use_Encryption_At_Type_Hint : in Swagger.Nullable_UString;
Name_Id_Format : in Swagger.Nullable_UString;
Name_Id_Format_At_Type_Hint : in Swagger.Nullable_UString;
Digest_Method : in Swagger.Nullable_UString;
Digest_Method_At_Type_Hint : in Swagger.Nullable_UString;
Signature_Method : in Swagger.Nullable_UString;
Signature_Method_At_Type_Hint : in Swagger.Nullable_UString;
User_Intermediate_Path : in Swagger.Nullable_UString;
User_Intermediate_Path_At_Type_Hint : in Swagger.Nullable_UString) is
URI : Swagger.Clients.URI_Type;
begin
URI.Add_Param ("keyStorePassword", Key_Store_Password);
URI.Add_Param ("keyStorePassword@TypeHint", Key_Store_Password_At_Type_Hint);
URI.Add_Param ("service.ranking", Service_Periodranking);
URI.Add_Param ("service.ranking@TypeHint", Service_Periodranking_At_Type_Hint);
URI.Add_Param ("idpHttpRedirect", Idp_Http_Redirect);
URI.Add_Param ("idpHttpRedirect@TypeHint", Idp_Http_Redirect_At_Type_Hint);
URI.Add_Param ("createUser", Create_User);
URI.Add_Param ("createUser@TypeHint", Create_User_At_Type_Hint);
URI.Add_Param ("defaultRedirectUrl", Default_Redirect_Url);
URI.Add_Param ("defaultRedirectUrl@TypeHint", Default_Redirect_Url_At_Type_Hint);
URI.Add_Param ("userIDAttribute", User_IDAttribute);
URI.Add_Param ("userIDAttribute@TypeHint", User_IDAttribute_At_Type_Hint);
URI.Add_Param ("defaultGroups", Default_Groups);
URI.Add_Param ("defaultGroups@TypeHint", Default_Groups_At_Type_Hint);
URI.Add_Param ("idpCertAlias", Idp_Cert_Alias);
URI.Add_Param ("idpCertAlias@TypeHint", Idp_Cert_Alias_At_Type_Hint);
URI.Add_Param ("addGroupMemberships", Add_Group_Memberships);
URI.Add_Param ("addGroupMemberships@TypeHint", Add_Group_Memberships_At_Type_Hint);
URI.Add_Param ("path", Path);
URI.Add_Param ("path@TypeHint", Path_At_Type_Hint);
URI.Add_Param ("synchronizeAttributes", Synchronize_Attributes);
URI.Add_Param ("synchronizeAttributes@TypeHint", Synchronize_Attributes_At_Type_Hint);
URI.Add_Param ("clockTolerance", Clock_Tolerance);
URI.Add_Param ("clockTolerance@TypeHint", Clock_Tolerance_At_Type_Hint);
URI.Add_Param ("groupMembershipAttribute", Group_Membership_Attribute);
URI.Add_Param ("groupMembershipAttribute@TypeHint", Group_Membership_Attribute_At_Type_Hint);
URI.Add_Param ("idpUrl", Idp_Url);
URI.Add_Param ("idpUrl@TypeHint", Idp_Url_At_Type_Hint);
URI.Add_Param ("logoutUrl", Logout_Url);
URI.Add_Param ("logoutUrl@TypeHint", Logout_Url_At_Type_Hint);
URI.Add_Param ("serviceProviderEntityId", Service_Provider_Entity_Id);
URI.Add_Param ("serviceProviderEntityId@TypeHint", Service_Provider_Entity_Id_At_Type_Hint);
URI.Add_Param ("assertionConsumerServiceURL", Assertion_Consumer_Service_URL);
URI.Add_Param ("assertionConsumerServiceURL@TypeHint", Assertion_Consumer_Service_URLAt_Type_Hint);
URI.Add_Param ("handleLogout", Handle_Logout);
URI.Add_Param ("handleLogout@TypeHint", Handle_Logout_At_Type_Hint);
URI.Add_Param ("spPrivateKeyAlias", Sp_Private_Key_Alias);
URI.Add_Param ("spPrivateKeyAlias@TypeHint", Sp_Private_Key_Alias_At_Type_Hint);
URI.Add_Param ("useEncryption", Use_Encryption);
URI.Add_Param ("useEncryption@TypeHint", Use_Encryption_At_Type_Hint);
URI.Add_Param ("nameIdFormat", Name_Id_Format);
URI.Add_Param ("nameIdFormat@TypeHint", Name_Id_Format_At_Type_Hint);
URI.Add_Param ("digestMethod", Digest_Method);
URI.Add_Param ("digestMethod@TypeHint", Digest_Method_At_Type_Hint);
URI.Add_Param ("signatureMethod", Signature_Method);
URI.Add_Param ("signatureMethod@TypeHint", Signature_Method_At_Type_Hint);
URI.Add_Param ("userIntermediatePath", User_Intermediate_Path);
URI.Add_Param ("userIntermediatePath@TypeHint", User_Intermediate_Path_At_Type_Hint);
URI.Set_Path ("/apps/system/config/com.adobe.granite.auth.saml.SamlAuthenticationHandler.config");
Client.Call (Swagger.Clients.POST, URI);
end Post_Config_Adobe_Granite_Saml_Authentication_Handler;
--
procedure Post_Config_Apache_Felix_Jetty_Based_Http_Service
(Client : in out Client_Type;
Org_Periodapache_Periodfelix_Periodhttps_Periodnio : in Swagger.Nullable_Boolean;
Org_Periodapache_Periodfelix_Periodhttps_Periodnio_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodpassword : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodpassword_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodkey : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodkey_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodkey_Periodpassword : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodkey_Periodpassword_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodtruststore : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodtruststore_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodtruststore_Periodpassword : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodtruststore_Periodpassword_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodclientcertificate : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodclientcertificate_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodenable : in Swagger.Nullable_Boolean;
Org_Periodapache_Periodfelix_Periodhttps_Periodenable_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodosgi_Periodservice_Periodhttp_Periodport_Periodsecure : in Swagger.Nullable_UString;
Org_Periodosgi_Periodservice_Periodhttp_Periodport_Periodsecure_At_Type_Hint : in Swagger.Nullable_UString) is
URI : Swagger.Clients.URI_Type;
begin
URI.Add_Param ("org.apache.felix.https.nio", Org_Periodapache_Periodfelix_Periodhttps_Periodnio);
URI.Add_Param ("org.apache.felix.https.nio@TypeHint", Org_Periodapache_Periodfelix_Periodhttps_Periodnio_At_Type_Hint);
URI.Add_Param ("org.apache.felix.https.keystore", Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore);
URI.Add_Param ("org.apache.felix.https.keystore@TypeHint", Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_At_Type_Hint);
URI.Add_Param ("org.apache.felix.https.keystore.password", Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodpassword);
URI.Add_Param ("org.apache.felix.https.keystore.password@TypeHint", Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodpassword_At_Type_Hint);
URI.Add_Param ("org.apache.felix.https.keystore.key", Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodkey);
URI.Add_Param ("org.apache.felix.https.keystore.key@TypeHint", Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodkey_At_Type_Hint);
URI.Add_Param ("org.apache.felix.https.keystore.key.password", Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodkey_Periodpassword);
URI.Add_Param ("org.apache.felix.https.keystore.key.password@TypeHint", Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodkey_Periodpassword_At_Type_Hint);
URI.Add_Param ("org.apache.felix.https.truststore", Org_Periodapache_Periodfelix_Periodhttps_Periodtruststore);
URI.Add_Param ("org.apache.felix.https.truststore@TypeHint", Org_Periodapache_Periodfelix_Periodhttps_Periodtruststore_At_Type_Hint);
URI.Add_Param ("org.apache.felix.https.truststore.password", Org_Periodapache_Periodfelix_Periodhttps_Periodtruststore_Periodpassword);
URI.Add_Param ("org.apache.felix.https.truststore.password@TypeHint", Org_Periodapache_Periodfelix_Periodhttps_Periodtruststore_Periodpassword_At_Type_Hint);
URI.Add_Param ("org.apache.felix.https.clientcertificate", Org_Periodapache_Periodfelix_Periodhttps_Periodclientcertificate);
URI.Add_Param ("org.apache.felix.https.clientcertificate@TypeHint", Org_Periodapache_Periodfelix_Periodhttps_Periodclientcertificate_At_Type_Hint);
URI.Add_Param ("org.apache.felix.https.enable", Org_Periodapache_Periodfelix_Periodhttps_Periodenable);
URI.Add_Param ("org.apache.felix.https.enable@TypeHint", Org_Periodapache_Periodfelix_Periodhttps_Periodenable_At_Type_Hint);
URI.Add_Param ("org.osgi.service.http.port.secure", Org_Periodosgi_Periodservice_Periodhttp_Periodport_Periodsecure);
URI.Add_Param ("org.osgi.service.http.port.secure@TypeHint", Org_Periodosgi_Periodservice_Periodhttp_Periodport_Periodsecure_At_Type_Hint);
URI.Set_Path ("/apps/system/config/org.apache.felix.http");
Client.Call (Swagger.Clients.POST, URI);
end Post_Config_Apache_Felix_Jetty_Based_Http_Service;
--
procedure Post_Config_Apache_Http_Components_Proxy_Configuration
(Client : in out Client_Type;
Proxy_Periodhost : in Swagger.Nullable_UString;
Proxy_Periodhost_At_Type_Hint : in Swagger.Nullable_UString;
Proxy_Periodport : in Swagger.Nullable_Integer;
Proxy_Periodport_At_Type_Hint : in Swagger.Nullable_UString;
Proxy_Periodexceptions : in Swagger.UString_Vectors.Vector;
Proxy_Periodexceptions_At_Type_Hint : in Swagger.Nullable_UString;
Proxy_Periodenabled : in Swagger.Nullable_Boolean;
Proxy_Periodenabled_At_Type_Hint : in Swagger.Nullable_UString;
Proxy_Perioduser : in Swagger.Nullable_UString;
Proxy_Perioduser_At_Type_Hint : in Swagger.Nullable_UString;
Proxy_Periodpassword : in Swagger.Nullable_UString;
Proxy_Periodpassword_At_Type_Hint : in Swagger.Nullable_UString) is
URI : Swagger.Clients.URI_Type;
begin
URI.Add_Param ("proxy.host", Proxy_Periodhost);
URI.Add_Param ("proxy.host@TypeHint", Proxy_Periodhost_At_Type_Hint);
URI.Add_Param ("proxy.port", Proxy_Periodport);
URI.Add_Param ("proxy.port@TypeHint", Proxy_Periodport_At_Type_Hint);
URI.Add_Param ("proxy.exceptions", Proxy_Periodexceptions);
URI.Add_Param ("proxy.exceptions@TypeHint", Proxy_Periodexceptions_At_Type_Hint);
URI.Add_Param ("proxy.enabled", Proxy_Periodenabled);
URI.Add_Param ("proxy.enabled@TypeHint", Proxy_Periodenabled_At_Type_Hint);
URI.Add_Param ("proxy.user", Proxy_Perioduser);
URI.Add_Param ("proxy.user@TypeHint", Proxy_Perioduser_At_Type_Hint);
URI.Add_Param ("proxy.password", Proxy_Periodpassword);
URI.Add_Param ("proxy.password@TypeHint", Proxy_Periodpassword_At_Type_Hint);
URI.Set_Path ("/apps/system/config/org.apache.http.proxyconfigurator.config");
Client.Call (Swagger.Clients.POST, URI);
end Post_Config_Apache_Http_Components_Proxy_Configuration;
--
procedure Post_Config_Apache_Sling_Dav_Ex_Servlet
(Client : in out Client_Type;
Alias : in Swagger.Nullable_UString;
Alias_At_Type_Hint : in Swagger.Nullable_UString;
Dav_Periodcreate_Absolute_Uri : in Swagger.Nullable_Boolean;
Dav_Periodcreate_Absolute_Uri_At_Type_Hint : in Swagger.Nullable_UString) is
URI : Swagger.Clients.URI_Type;
begin
URI.Add_Param ("alias", Alias);
URI.Add_Param ("alias@TypeHint", Alias_At_Type_Hint);
URI.Add_Param ("dav.create-absolute-uri", Dav_Periodcreate_Absolute_Uri);
URI.Add_Param ("dav.create-absolute-uri@TypeHint", Dav_Periodcreate_Absolute_Uri_At_Type_Hint);
URI.Set_Path ("/apps/system/config/org.apache.sling.jcr.davex.impl.servlets.SlingDavExServlet");
Client.Call (Swagger.Clients.POST, URI);
end Post_Config_Apache_Sling_Dav_Ex_Servlet;
--
procedure Post_Config_Apache_Sling_Get_Servlet
(Client : in out Client_Type;
Json_Periodmaximumresults : in Swagger.Nullable_UString;
Json_Periodmaximumresults_At_Type_Hint : in Swagger.Nullable_UString;
Enable_Periodhtml : in Swagger.Nullable_Boolean;
Enable_Periodhtml_At_Type_Hint : in Swagger.Nullable_UString;
Enable_Periodtxt : in Swagger.Nullable_Boolean;
Enable_Periodtxt_At_Type_Hint : in Swagger.Nullable_UString;
Enable_Periodxml : in Swagger.Nullable_Boolean;
Enable_Periodxml_At_Type_Hint : in Swagger.Nullable_UString) is
URI : Swagger.Clients.URI_Type;
begin
URI.Add_Param ("json.maximumresults", Json_Periodmaximumresults);
URI.Add_Param ("json.maximumresults@TypeHint", Json_Periodmaximumresults_At_Type_Hint);
URI.Add_Param ("enable.html", Enable_Periodhtml);
URI.Add_Param ("enable.html@TypeHint", Enable_Periodhtml_At_Type_Hint);
URI.Add_Param ("enable.txt", Enable_Periodtxt);
URI.Add_Param ("enable.txt@TypeHint", Enable_Periodtxt_At_Type_Hint);
URI.Add_Param ("enable.xml", Enable_Periodxml);
URI.Add_Param ("enable.xml@TypeHint", Enable_Periodxml_At_Type_Hint);
URI.Set_Path ("/apps/system/config/org.apache.sling.servlets.get.DefaultGetServlet");
Client.Call (Swagger.Clients.POST, URI);
end Post_Config_Apache_Sling_Get_Servlet;
--
procedure Post_Config_Apache_Sling_Referrer_Filter
(Client : in out Client_Type;
Allow_Periodempty : in Swagger.Nullable_Boolean;
Allow_Periodempty_At_Type_Hint : in Swagger.Nullable_UString;
Allow_Periodhosts : in Swagger.Nullable_UString;
Allow_Periodhosts_At_Type_Hint : in Swagger.Nullable_UString;
Allow_Periodhosts_Periodregexp : in Swagger.Nullable_UString;
Allow_Periodhosts_Periodregexp_At_Type_Hint : in Swagger.Nullable_UString;
Filter_Periodmethods : in Swagger.Nullable_UString;
Filter_Periodmethods_At_Type_Hint : in Swagger.Nullable_UString) is
URI : Swagger.Clients.URI_Type;
begin
URI.Add_Param ("allow.empty", Allow_Periodempty);
URI.Add_Param ("allow.empty@TypeHint", Allow_Periodempty_At_Type_Hint);
URI.Add_Param ("allow.hosts", Allow_Periodhosts);
URI.Add_Param ("allow.hosts@TypeHint", Allow_Periodhosts_At_Type_Hint);
URI.Add_Param ("allow.hosts.regexp", Allow_Periodhosts_Periodregexp);
URI.Add_Param ("allow.hosts.regexp@TypeHint", Allow_Periodhosts_Periodregexp_At_Type_Hint);
URI.Add_Param ("filter.methods", Filter_Periodmethods);
URI.Add_Param ("filter.methods@TypeHint", Filter_Periodmethods_At_Type_Hint);
URI.Set_Path ("/apps/system/config/org.apache.sling.security.impl.ReferrerFilter");
Client.Call (Swagger.Clients.POST, URI);
end Post_Config_Apache_Sling_Referrer_Filter;
--
procedure Post_Config_Property
(Client : in out Client_Type;
Config_Node_Name : in Swagger.UString) is
URI : Swagger.Clients.URI_Type;
begin
URI.Set_Path ("/apps/system/config/{configNodeName}");
URI.Set_Path_Param ("configNodeName", Config_Node_Name);
Client.Call (Swagger.Clients.POST, URI);
end Post_Config_Property;
--
procedure Post_Node
(Client : in out Client_Type;
Path : in Swagger.UString;
Name : in Swagger.UString;
Operation : in Swagger.Nullable_UString;
Delete_Authorizable : in Swagger.Nullable_UString;
File : in Swagger.File_Part_Type) is
URI : Swagger.Clients.URI_Type;
Req : Swagger.Clients.Request_Type;
begin
Client.Initialize (Req, (1 => Swagger.Clients.APPLICATION_FORM));
.Models.Serialize (Req.Stream, "file", File);
URI.Add_Param (":operation", Operation);
URI.Add_Param ("deleteAuthorizable", Delete_Authorizable);
URI.Set_Path ("/{path}/{name}");
URI.Set_Path_Param ("path", Path);
URI.Set_Path_Param ("name", Name);
Client.Call (Swagger.Clients.POST, URI, Req);
end Post_Node;
--
procedure Post_Node_Rw
(Client : in out Client_Type;
Path : in Swagger.UString;
Name : in Swagger.UString;
Add_Members : in Swagger.Nullable_UString) is
URI : Swagger.Clients.URI_Type;
begin
URI.Add_Param ("addMembers", Add_Members);
URI.Set_Path ("/{path}/{name}.rw.html");
URI.Set_Path_Param ("path", Path);
URI.Set_Path_Param ("name", Name);
Client.Call (Swagger.Clients.POST, URI);
end Post_Node_Rw;
--
procedure Post_Path
(Client : in out Client_Type;
Path : in Swagger.UString;
Jcr_Primary_Type : in Swagger.UString;
Name : in Swagger.UString) is
URI : Swagger.Clients.URI_Type;
begin
URI.Add_Param ("jcr:primaryType", Jcr_Primary_Type);
URI.Add_Param (":name", Name);
URI.Set_Path ("/{path}/");
URI.Set_Path_Param ("path", Path);
Client.Call (Swagger.Clients.POST, URI);
end Post_Path;
--
procedure Post_Query
(Client : in out Client_Type;
Path : in Swagger.UString;
P_Periodlimit : in Swagger.Number;
P_1Property : in Swagger.UString;
P_1Property_Periodvalue : in Swagger.UString;
Result : out Swagger.UString) is
URI : Swagger.Clients.URI_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((1 => Swagger.Clients.APPLICATION_JSON));
URI.Add_Param ("path", Path);
URI.Add_Param ("p.limit", P_Periodlimit);
URI.Add_Param ("1_property", P_1Property);
URI.Add_Param ("1_property.value", P_1Property_Periodvalue);
URI.Set_Path ("/bin/querybuilder.json");
Client.Call (Swagger.Clients.POST, URI, Reply);
.Models.Deserialize (Reply, "", Result);
end Post_Query;
--
procedure Post_Tree_Activation
(Client : in out Client_Type;
Ignoredeactivated : in Boolean;
Onlymodified : in Boolean;
Path : in Swagger.UString) is
URI : Swagger.Clients.URI_Type;
begin
URI.Add_Param ("ignoredeactivated", Ignoredeactivated);
URI.Add_Param ("onlymodified", Onlymodified);
URI.Add_Param ("path", Path);
URI.Set_Path ("/etc/replication/treeactivation.html");
Client.Call (Swagger.Clients.POST, URI);
end Post_Tree_Activation;
--
procedure Post_Truststore
(Client : in out Client_Type;
Operation : in Swagger.Nullable_UString;
New_Password : in Swagger.Nullable_UString;
Re_Password : in Swagger.Nullable_UString;
Key_Store_Type : in Swagger.Nullable_UString;
Remove_Alias : in Swagger.Nullable_UString;
Certificate : in Swagger.File_Part_Type;
Result : out Swagger.UString) is
URI : Swagger.Clients.URI_Type;
Req : Swagger.Clients.Request_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((1 => Swagger.Clients.TEXT_PLAIN));
Client.Initialize (Req, (1 => Swagger.Clients.APPLICATION_FORM));
.Models.Serialize (Req.Stream, "certificate", Certificate);
URI.Add_Param (":operation", Operation);
URI.Add_Param ("newPassword", New_Password);
URI.Add_Param ("rePassword", Re_Password);
URI.Add_Param ("keyStoreType", Key_Store_Type);
URI.Add_Param ("removeAlias", Remove_Alias);
URI.Set_Path ("/libs/granite/security/post/truststore");
Client.Call (Swagger.Clients.POST, URI, Req, Reply);
.Models.Deserialize (Reply, "", Result);
end Post_Truststore;
--
procedure Post_Truststore_PKCS12
(Client : in out Client_Type;
Truststore_Periodp_12 : in Swagger.File_Part_Type;
Result : out Swagger.UString) is
URI : Swagger.Clients.URI_Type;
Req : Swagger.Clients.Request_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((1 => Swagger.Clients.TEXT_PLAIN));
Client.Initialize (Req, (1 => Swagger.Clients.APPLICATION_FORM));
.Models.Serialize (Req.Stream, "truststore.p12", Truststore_Periodp_12);
URI.Set_Path ("/etc/truststore");
Client.Call (Swagger.Clients.POST, URI, Req, Reply);
.Models.Deserialize (Reply, "", Result);
end Post_Truststore_PKCS12;
end .Clients;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . T E X T _ I O --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2013, 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.Machine_Code;
package body System.Text_IO is
STDIO : Character;
for STDIO'Address use 16#52#;
-- IO port in the simulator for console output
---------
-- Get --
---------
function Get return Character is
begin
-- Will never be called.
raise Program_Error;
return ASCII.NUL;
end Get;
----------------
-- Initialize --
----------------
procedure Initialize is
begin
Initialized := True;
end Initialize;
-----------------
-- Is_Rx_Ready --
-----------------
function Is_Rx_Ready return Boolean is
begin
return False;
end Is_Rx_Ready;
-----------------
-- Is_Tx_Ready --
-----------------
function Is_Tx_Ready return Boolean is
begin
return True;
end Is_Tx_Ready;
---------
-- Put --
---------
procedure Put (C : Character) is
use System.Machine_Code;
begin
-- STDIO := Item;
Asm ("out 0x32,%0", Inputs => Character'Asm_Input ("r", C),
Volatile => True);
end Put;
----------------------------
-- Use_Cr_Lf_For_New_Line --
----------------------------
function Use_Cr_Lf_For_New_Line return Boolean is
begin
return False;
end Use_Cr_Lf_For_New_Line;
end System.Text_IO;
|
package Problem_44 is
procedure Solve;
end Problem_44;
|
-- Auto generated file. Don't edit
-- Read copyright and license at the end of this file
package Encodings.Maps.CP_856 is
function Decode (Char : Character) return Wide_Character;
pragma Inline (Decode);
procedure Encode
(Text : in Wide_String;
Text_Last : out Natural;
Result : out Raw_String;
Result_Last : out Natural;
Map : in Encoding := Encodings.CP_856);
procedure Decode
(Text : in Raw_String;
Text_Last : out Natural;
Result : out Wide_String;
Result_Last : out Natural;
Map : in Encoding := Encodings.CP_856);
end Encodings.Maps.CP_856;
------------------------------------------------------------------------------
-- 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.
------------------------------------------------------------------------------
|
-----------------------------------------------------------------------
-- Faces Context Tests - Unit tests for ASF.Contexts.Faces
-- Copyright (C) 2010, 2011, 2012, 2013, 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 Util.Tests;
with ASF.Tests;
with ASF.Applications.Tests;
with ASF.Helpers.Beans;
package ASF.Contexts.Faces.Tests is
procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite);
function Get_Form_Bean is
new ASF.Helpers.Beans.Get_Bean (ASF.Applications.Tests.Form_Bean,
ASF.Applications.Tests.Form_Bean_Access);
type Test is new ASF.Tests.EL_Test with record
-- The ELContext, Variables, Resolver, Form area controlled object.
-- Due to AUnit implementation, we cannot store a controlled object in the Test object.
-- This is due to the 'for Obj'Address use Ret;' clause used by AUnit to allocate
-- a test object.
-- The application object is allocated dyanmically by Set_Up.
Form : ASF.Applications.Tests.Form_Bean_Access;
end record;
-- Cleanup the test instance.
overriding
procedure Tear_Down (T : in out Test);
-- Setup the faces context for the unit test.
procedure Setup (T : in out Test;
Context : in out Faces_Context);
-- Test getting an attribute from the faces context.
procedure Test_Get_Attribute (T : in out Test);
-- Test getting a bean object from the faces context.
procedure Test_Get_Bean (T : in out Test);
-- Test getting a bean object from the faces context and doing a conversion.
procedure Test_Get_Bean_Helper (T : in out Test);
-- Test the faces message queue.
procedure Test_Add_Message (T : in out Test);
procedure Test_Max_Severity (T : in out Test);
procedure Test_Get_Messages (T : in out Test);
-- Test the application message factory for the creation of localized messages.
procedure Test_Add_Localized_Message (T : in out Test);
-- Test adding some exception in the faces context.
procedure Test_Queue_Exception (T : in out Test);
-- Test the flash instance.
procedure Test_Flash_Context (T : in out Test);
-- Test the mockup faces context.
procedure Test_Mockup_Faces_Context (T : in out Test);
end ASF.Contexts.Faces.Tests;
|
------------------------------------------------------------------------------
-- Copyright (c) 2016-2017, 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. --
------------------------------------------------------------------------------
------------------------------------------------------------------------------
-- Natools.Smaz_Generic provides a generic implementation of the Smaz --
-- algorithm, leaving encoding and decoding to the formal subprograms. --
-- This factors all the logic common to standard byte-based Smaz, the --
-- the base-64 variant, and the base-4096 variant. --
-- --
-- WARNING: an important assumption that is not checked/asserted, is that --
-- it is never preferable to use verbatim encoding rather than a code, --
-- except when merging to verbatim sections and the code between them. This --
-- means in particular that a dictionary must never contain an entry --
-- shorter than its encoded counterpart. --
------------------------------------------------------------------------------
with Ada.Streams;
generic
type Dictionary_Code is (<>);
with procedure Read_Code
(Input : in Ada.Streams.Stream_Element_Array;
Offset : in out Ada.Streams.Stream_Element_Offset;
Code : out Dictionary_Code;
Verbatim_Length : out Natural;
Last_Code : in Dictionary_Code;
Variable_Length_Verbatim : in Boolean);
with procedure Read_Verbatim
(Input : in Ada.Streams.Stream_Element_Array;
Offset : in out Ada.Streams.Stream_Element_Offset;
Output : out String);
with procedure Skip_Verbatim
(Input : in Ada.Streams.Stream_Element_Array;
Offset : in out Ada.Streams.Stream_Element_Offset;
Verbatim_Length : in Positive);
with function Verbatim_Size
(Input_Length : in Positive;
Last_Code : in Dictionary_Code;
Variable_Length_Verbatim : in Boolean)
return Ada.Streams.Stream_Element_Count;
with procedure Write_Code
(Output : in out Ada.Streams.Stream_Element_Array;
Offset : in out Ada.Streams.Stream_Element_Offset;
Code : in Dictionary_Code);
with procedure Write_Verbatim
(Output : in out Ada.Streams.Stream_Element_Array;
Offset : in out Ada.Streams.Stream_Element_Offset;
Input : in String;
Last_Code : in Dictionary_Code;
Variable_Length_Verbatim : in Boolean);
package Natools.Smaz_Generic is
pragma Pure;
type Offset_Array is array (Dictionary_Code range <>) of Positive;
type Dictionary
(Last_Code : Dictionary_Code;
Values_Last : Natural)
is record
Variable_Length_Verbatim : Boolean;
Max_Word_Length : Positive;
Offsets : Offset_Array
(Dictionary_Code'Succ (Dictionary_Code'First) .. Last_Code);
Values : String (1 .. Values_Last);
Hash : not null access function (Value : String) return Natural;
end record;
function Code_First
(Offsets : in Offset_Array;
Code : in Dictionary_Code;
Fallback : in Positive)
return Positive
is (if Code in Offsets'Range then Offsets (Code) else Fallback);
-- Return the first index of the value for Code in Dictionary.Values
function Code_Last
(Offsets : in Offset_Array;
Code : in Dictionary_Code;
Fallback : in Natural)
return Natural
is (if Dictionary_Code'Succ (Code) in Offsets'Range
then Offsets (Dictionary_Code'Succ (Code)) - 1
else Fallback);
-- Return the value index of the value for Code in Dictionary.Values
function Is_Valid_Code
(Dict : in Dictionary;
Code : in Dictionary_Code)
return Boolean
is (Code in Dictionary_Code'First .. Dict.Last_Code);
-- Return whether Code exists in Dict
function Dict_Entry
(Dict : in Dictionary;
Code : in Dictionary_Code)
return String
is (Dict.Values (Code_First (Dict.Offsets, Code, Dict.Values'First)
.. Code_Last (Dict.Offsets, Code, Dict.Values'Last)))
with Pre => Is_Valid_Code (Dict, Code);
-- Return the string for at the given Index in Dict
function Dict_Entry_Length
(Dict : in Dictionary;
Code : in Dictionary_Code)
return Positive
is (1 + Code_Last (Dict.Offsets, Code, Dict.Values'Last)
- Code_First (Dict.Offsets, Code, Dict.Values'First))
with Pre => Is_Valid_Code (Dict, Code);
-- Return the length of the string for at the given Index in Dict
function Is_Valid (Dictionary : in Smaz_Generic.Dictionary) return Boolean
is ((for all Code in Dictionary.Offsets'Range
=> Dictionary.Offsets (Code) in Dictionary.Values'Range)
and then (for all Code in Dictionary_Code'First .. Dictionary.Last_Code
=> Code_Last (Dictionary.Offsets, Code, Dictionary.Values'Last) + 1
- Code_First (Dictionary.Offsets, Code, Dictionary.Values'First)
in 1 .. Dictionary.Max_Word_Length)
and then (for all Code in Dictionary_Code'First .. Dictionary.Last_Code
=> Dictionary_Code'Val (Dictionary.Hash
(Dict_Entry (Dictionary, Code)))
= Code));
-- Check all the assumptions made on Dictionary objects.
function Compressed_Upper_Bound
(Dict : in Dictionary;
Input : in String)
return Ada.Streams.Stream_Element_Count;
-- Return the maximum number of bytes needed to encode Input
procedure Compress
(Dict : in Dictionary;
Input : in String;
Output_Buffer : out Ada.Streams.Stream_Element_Array;
Output_Last : out Ada.Streams.Stream_Element_Offset);
-- Encode Input into Output_Buffer
function Compress (Dict : in Dictionary; Input : in String)
return Ada.Streams.Stream_Element_Array;
-- Return an encoded buffer for Input
function Decompressed_Length
(Dict : in Dictionary;
Input : in Ada.Streams.Stream_Element_Array)
return Natural;
-- Return the exact length when Input is decoded
procedure Decompress
(Dict : in Dictionary;
Input : in Ada.Streams.Stream_Element_Array;
Output_Buffer : out String;
Output_Last : out Natural);
-- Decode Input into Output_Buffer
function Decompress
(Dict : in Dictionary; Input : in Ada.Streams.Stream_Element_Array)
return String;
-- Return a decoded buffer for Input
end Natools.Smaz_Generic;
|
with avtas.lmcp.types; use avtas.lmcp.types;
with avtas.lmcp.byteBuffers; use avtas.lmcp.byteBuffers;
with Ada.Streams;
with Utilities;
package avtas.lmcp.object is
type Object is abstract tagged null record;
type Object_Acc is access all Object;
type Object_Any is access all Object'Class;
-- function clone(this, that: access Object) return Object_Acc is abstract;
overriding
function "=" (This, That : Object) return Boolean is (True); -- FIXME
function getLmcpTypeName(this : Object) return String is ("Object");
function getFullLmcpTypeName(this : Object) return String is ("avtas.lmcp.object.Object");
function getLmcpType(this : Object) return UInt32 is (0);
function getSeriesName(this : Object) return String is ("");
function getSeriesNameAsLong(this : Object) return Int64 is (0);
function getSeriesVersion(this : Object) return UInt16 is (0);
function calculatePackedSize(this : Object) return UInt32 is (0);
procedure Pack (This : Object; Buf : in out ByteBuffer) is null;
procedure Unpack (This : out Object; Buf : in out ByteBuffer) is null;
-- XML output
function LeftPad is new Utilities.LeftPad (Width => 2);
procedure XML_Output (this : Object'Class;
S : access Ada.Streams.Root_Stream_Type'Class;
Level : Natural := 0);
procedure XML_Write (this : Object;
S : access Ada.Streams.Root_Stream_Type'Class;
Level : Natural) is null;
end avtas.lmcp.object;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- F N A M E --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2004 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package, together with its child package Fname.UF define the
-- association between source file names and unit names as defined
-- (see package Uname for definition of format of unit names).
with Types; use Types;
package Fname is
-- Note: this package spec does not depend on the Uname spec in the Ada
-- sense, but the comments and description of the semantics do depend on
-- the conventions established by Uname.
---------------------------
-- File Name Conventions --
---------------------------
-- GNAT requires that there be a one to one correspondence between source
-- file names (as used in the Osint package interface) and unit names as
-- defined by the Uname package. This correspondence is defined by the
-- two subprograms defined here in the Fname package.
-- For full rules of file naming, see GNAT User's Guide. Note that the
-- naming rules are affected by the presence of Source_File_Name pragmas
-- that have been previously processed.
-- Note that the file name does *not* include the directory name. The
-- management of directories is provided by Osint, and full file names
-- are used only for error message purposes within GNAT itself.
-----------------
-- Subprograms --
-----------------
function Is_Predefined_File_Name
(Fname : File_Name_Type;
Renamings_Included : Boolean := True) return Boolean;
-- This function determines if the given file name (which must be a simple
-- file name with no directory information) is the file name for one of
-- the predefined library units. On return, Name_Buffer contains the
-- file name. The Renamings_Included parameter indicates whether annex
-- J renamings such as Text_IO are to be considered as predefined. If
-- Renamings_Included is True, then Text_IO will return True, otherwise
-- only children of Ada, Interfaces and System return True.
function Is_Predefined_File_Name
(Renamings_Included : Boolean := True) return Boolean;
-- This version is called with the file name already in Name_Buffer
function Is_Internal_File_Name
(Fname : File_Name_Type;
Renamings_Included : Boolean := True) return Boolean;
-- Similar to Is_Predefined_File_Name. The internal file set is a
-- superset of the predefined file set including children of GNAT,
-- and also children of DEC for the VMS case.
procedure Tree_Read;
-- Dummy procedure (reads dummy table values from tree file)
procedure Tree_Write;
-- Writes out internal tables to current tree file using Tree_Write
-- This is actually a dummy routine, since the relevant table is
-- no longer used, but we retain it for now, to avoid a tree file
-- incompatibility with the 3.13 compiler. Should be removed for
-- the 3.14a release ???
end Fname;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . T A S K I N G . A S Y N C _ D E L A Y S --
-- --
-- S p e c --
-- --
-- Copyright (C) 1998-2009, Free Software Foundation, Inc. --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains the procedures to implements timeouts (delays) for
-- asynchronous select statements.
-- Note: the compiler generates direct calls to this interface, via Rtsfind.
-- Any changes to this interface may require corresponding compiler changes.
package System.Tasking.Async_Delays is
-- Suppose the following source code is given:
-- select delay When;
-- ...continuation for timeout case...
-- then abort
-- ...abortable part...
-- end select;
-- The compiler should expand this to the following:
-- declare
-- DB : aliased Delay_Block;
-- begin
-- if System.Tasking.Async_Delays.Enqueue_Duration
-- (When, DB'Unchecked_Access)
-- then
-- begin
-- A101b : declare
-- procedure _clean is
-- begin
-- System.Tasking.Async_Delays.Cancel_Async_Delay
-- (DB'Unchecked_Access);
-- return;
-- end _clean;
-- begin
-- abort_undefer.all;
-- ...abortable part...
-- exception
-- when all others =>
-- declare
-- E105b : exception_occurrence;
-- begin
-- save_occurrence (E105b, get_current_excep.all.all);
-- _clean;
-- reraise_occurrence_no_defer (E105b);
-- end;
-- at end
-- _clean;
-- end A101b;
-- exception
-- when _abort_signal =>
-- abort_undefer.all;
-- end;
-- end if;
--
-- if Timed_Out (DB'Unchecked_Access) then
-- ...continuation for timeout case...
-- end if;
-- end;
-----------------
-- Delay_Block --
-----------------
type Delay_Block is limited private;
type Delay_Block_Access is access all Delay_Block;
function Enqueue_Duration
(T : Duration;
D : Delay_Block_Access) return Boolean;
-- Enqueue the specified relative delay. Returns True if the delay has
-- been enqueued, False if it has already expired. If the delay has been
-- enqueued, abort is deferred.
procedure Cancel_Async_Delay (D : Delay_Block_Access);
-- Cancel the specified asynchronous delay
function Timed_Out (D : Delay_Block_Access) return Boolean;
pragma Inline (Timed_Out);
-- Return True if the delay specified in D has timed out
-- There are child units for delays on Ada.Calendar.Time and
-- Ada.Real_Time.Time, so that an application will not need to link in
-- features that is not using.
private
type Delay_Block is record
Self_Id : Task_Id;
-- ID of the calling task
Level : ATC_Level_Base;
-- Normally Level is the ATC nesting level of the
-- async. select statement to which this delay belongs, but
-- after a call has been dequeued we set it to
-- ATC_Level_Infinity so that the Cancel operation can
-- detect repeated calls, and act idempotently.
Resume_Time : Duration;
-- The absolute wake up time, represented as Duration
Timed_Out : Boolean := False;
-- Set to true if the delay has timed out
Succ, Pred : Delay_Block_Access;
-- A double linked list
end record;
-- The above "overlaying" of Self_ID and Level to hold other
-- data that has a non-overlapping lifetime is an unabashed
-- hack to save memory.
procedure Time_Enqueue
(T : Duration;
D : Delay_Block_Access);
pragma Inline (Time_Enqueue);
-- Used by the child units to enqueue delays on the timer queue
-- implemented in the body of this package.
end System.Tasking.Async_Delays;
|
------------------------------------------------------------------------------
-- --
-- ASIS-for-GNAT IMPLEMENTATION COMPONENTS --
-- --
-- A 4 G . I T E S T S --
-- --
-- S p e c --
-- --
-- Copyright (c) 1995-1999, Free Software Foundation, Inc. --
-- --
-- ASIS-for-GNAT is free software; you can redistribute it and/or modify it --
-- under terms of the GNU General Public License as published by the Free --
-- Software Foundation; either version 2, or (at your option) any later --
-- version. ASIS-for-GNAT is distributed in the hope that it will be use- --
-- ful, but WITHOUT ANY WARRANTY; without even the implied warranty of MER- --
-- CHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General --
-- Public License for more details. You should have received a copy of the --
-- GNU General Public License distributed with ASIS-for-GNAT; see file --
-- COPYING. If not, write to the Free Software Foundation, 59 Temple Place --
-- - Suite 330, Boston, MA 02111-1307, USA. --
-- --
-- --
-- --
-- --
-- --
-- --
-- --
-- --
-- ASIS-for-GNAT was originally developed by the ASIS-for-GNAT team at the --
-- Software Engineering Laboratory of the Swiss Federal Institute of --
-- Technology (LGL-EPFL) in Lausanne, Switzerland, in cooperation with the --
-- Scientific Research Computer Center of Moscow State University (SRCC --
-- MSU), Russia, with funding partially provided by grants from the Swiss --
-- National Science Foundation and the Swiss Academy of Engineering --
-- Sciences. ASIS-for-GNAT is now maintained by Ada Core Technologies Inc --
-- (http://www.gnat.com). --
-- --
------------------------------------------------------------------------------
-- This package defines tests for defining if an Element based on the
-- given node should test Is_Implicit, Is_Inherited and Is_From_Instance
with Types; use Types;
package A4G.Itests is
function Is_Inherited_Discriminant (N : Node_Id) return Boolean;
-- Tests if N corresponds to the defining occurrence of an inherited
-- discriminant. N should be of N_Defining_Identifier kind
--
-- INCOMPLETE and INRELIABLE for now!
function Is_From_Instance (N : Node_Id) return Boolean;
-- Tests if N corresponds to an implicit or explicit construction from
-- the result of some generic instantiation (that is, from an expanded
-- generic template)
end A4G.Itests;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- A D A . R E A L _ T I M E . D E L A Y S --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2019, 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. --
-- --
------------------------------------------------------------------------------
with Ada.Exceptions;
with System.Tasking;
with System.Task_Primitives.Operations;
package body Ada.Real_Time.Delays is
package STPO renames System.Task_Primitives.Operations;
----------------
-- Local Data --
----------------
Absolute_RT : constant := 2;
-----------------
-- Delay_Until --
-----------------
procedure Delay_Until (T : Time) is
Self_Id : constant System.Tasking.Task_Id := STPO.Self;
begin
-- If pragma Detect_Blocking is active, Program_Error must be
-- raised if this potentially blocking operation is called from a
-- protected action.
if System.Tasking.Detect_Blocking
and then Self_Id.Common.Protected_Action_Nesting > 0
then
Ada.Exceptions.Raise_Exception
(Program_Error'Identity, "potentially blocking operation");
else
STPO.Timed_Delay (Self_Id, To_Duration (T), Absolute_RT);
end if;
end Delay_Until;
-----------------
-- To_Duration --
-----------------
function To_Duration (T : Time) return Duration is
begin
return To_Duration (Time_Span (T));
end To_Duration;
end Ada.Real_Time.Delays;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . C O N C A T _ 9 --
-- --
-- B o d y --
-- --
-- Copyright (C) 2008-2013, 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. --
-- --
------------------------------------------------------------------------------
pragma Compiler_Unit_Warning;
with System.Concat_8;
package body System.Concat_9 is
pragma Suppress (All_Checks);
------------------
-- Str_Concat_9 --
------------------
procedure Str_Concat_9
(R : out String;
S1, S2, S3, S4, S5, S6, S7, S8, S9 : String)
is
F, L : Natural;
begin
F := R'First;
L := F + S1'Length - 1;
R (F .. L) := S1;
F := L + 1;
L := F + S2'Length - 1;
R (F .. L) := S2;
F := L + 1;
L := F + S3'Length - 1;
R (F .. L) := S3;
F := L + 1;
L := F + S4'Length - 1;
R (F .. L) := S4;
F := L + 1;
L := F + S5'Length - 1;
R (F .. L) := S5;
F := L + 1;
L := F + S6'Length - 1;
R (F .. L) := S6;
F := L + 1;
L := F + S7'Length - 1;
R (F .. L) := S7;
F := L + 1;
L := F + S8'Length - 1;
R (F .. L) := S8;
F := L + 1;
L := R'Last;
R (F .. L) := S9;
end Str_Concat_9;
-------------------------
-- Str_Concat_Bounds_9 --
-------------------------
procedure Str_Concat_Bounds_9
(Lo, Hi : out Natural;
S1, S2, S3, S4, S5, S6, S7, S8, S9 : String)
is
begin
System.Concat_8.Str_Concat_Bounds_8
(Lo, Hi, S2, S3, S4, S5, S6, S7, S8, S9);
if S1 /= "" then
Hi := S1'Last + Hi - Lo + 1;
Lo := S1'First;
end if;
end Str_Concat_Bounds_9;
end System.Concat_9;
|
------------------------------------------------------------------------------
-- Copyright (C) 2020 by Heisenbug Ltd. (gh+spat@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);
------------------------------------------------------------------------------
--
-- SPARK Proof Analysis Tool
--
-- S.P.A.T. - Provide atomic ids (counters) to facilitate stable sorting.
-- Each instantiation provides its own local counter.
--
------------------------------------------------------------------------------
with GNATCOLL.Atomic;
generic
package SPAT.Unique_Ids is
-- Sometimes entries are identical which makes sorting unstable. To
-- counter the issue we add a unique id to each entry which serves as a
-- last ditch sorting criterion, making two entries always distinct.
-- CAREFUL: This approach only works if the order of elements being
-- inserted does not change between runs (I'm thinking further
-- parallelization here). But to make sure this works in a
-- tasking context anyway we use atomic increments to generate
-- our ids.
-- Luckily GNATCOLL already serves us, so we don't need to wrap
-- it into our own protected type (inefficient) or revert to
-- compiler/target specific intrinsics.
subtype Id is GNATCOLL.Atomic.Atomic_Counter;
-- Our id type.
--------------------------------------------------------------------------
-- Next
--
-- Returns the next available id.
-- Id is a modular type, so it wraps around instead of overflow, but we
-- should never be able to exhaust an Id's range, anyway.
--------------------------------------------------------------------------
function Next return Id with
Volatile_Function => True;
end SPAT.Unique_Ids;
|
-- { dg-do compile }
-- { dg-options "-gnatws" }
with System.Storage_Elements; use System.Storage_Elements;
with Unchecked_Conversion;
with Slice7_Pkg; use Slice7_Pkg;
procedure Slice7 is
type Discrete_Type is range 1 .. 32;
Max_Byte_Count : constant := 4;
subtype Byte_Count_Type is Storage_Offset range 1..Max_Byte_Count;
subtype Buffer_Type is Storage_Array (Byte_Count_Type);
function Convert_Put is new Unchecked_Conversion (Integer, Buffer_Type);
function Set_Buffer_Size return Byte_Count_Type is
begin
return 4;
end;
Buffer_Size : constant Byte_Count_Type := Set_Buffer_Size;
Buffer_End : constant Byte_Count_Type := Max_Byte_Count;
Buffer_Start : constant Byte_Count_Type := Buffer_End - Buffer_Size + 1;
Obj : Discrete_Type;
begin
Put (Convert_Put(Discrete_Type'Pos (Obj)));
Put (Convert_Put(Discrete_Type'Pos (Obj))
(Buffer_Start..Buffer_End));
Put (Convert_Put(Discrete_Type'Pos (Obj) -
Discrete_Type'Pos (Discrete_Type'First))
(Buffer_Start..Buffer_End));
end;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . T A G S --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2005, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System;
with System.Storage_Elements;
with Unchecked_Conversion;
package Ada.Tags is
pragma Preelaborate_05;
-- In accordance with Ada 2005 AI-362
type Tag is private;
No_Tag : constant Tag;
function Expanded_Name (T : Tag) return String;
function External_Tag (T : Tag) return String;
function Internal_Tag (External : String) return Tag;
function Descendant_Tag
(External : String;
Ancestor : Tag) return Tag;
pragma Ada_05 (Descendant_Tag);
function Is_Descendant_At_Same_Level
(Descendant : Tag;
Ancestor : Tag) return Boolean;
pragma Ada_05 (Is_Descendant_At_Same_Level);
function Parent_Tag (T : Tag) return Tag;
pragma Ada_05 (Parent_Tag);
Tag_Error : exception;
function Wide_Expanded_Name (T : Tag) return Wide_String;
pragma Ada_05 (Wide_Expanded_Name);
function Wide_Wide_Expanded_Name (T : Tag) return Wide_Wide_String;
pragma Ada_05 (Wide_Wide_Expanded_Name);
private
-- The following subprogram specifications are placed here instead of
-- the package body to see them from the frontend through rtsfind.
---------------------------------------------------------------
-- Abstract Procedural Interface For The GNAT Dispatch Table --
---------------------------------------------------------------
-- GNAT's Dispatch Table format is customizable in order to match the
-- format used in another language. GNAT supports programs that use two
-- different dispatch table formats at the same time: the native format
-- that supports Ada 95 tagged types and which is described in Ada.Tags,
-- and a foreign format for types that are imported from some other
-- language (typically C++) which is described in Interfaces.CPP. The
-- runtime information kept for each tagged type is separated into two
-- objects: the Dispatch Table and the Type Specific Data record. These
-- two objects are allocated statically using the constants:
-- DT Size = DT_Prologue_Size + Nb_Prim * DT_Entry_Size
-- TSD Size = TSD_Prologue_Size + (1 + Idepth) * TSD_Entry_Size
-- where Nb_prim is the number of primitive operations of the given
-- type and Idepth its inheritance depth.
-- In order to set or retrieve information from the Dispatch Table or
-- the Type Specific Data record, GNAT generates calls to Set_XXX or
-- Get_XXX routines, where XXX is the name of the field of interest.
type Dispatch_Table;
type Tag is access all Dispatch_Table;
type Interface_Tag is access all Dispatch_Table;
No_Tag : constant Tag := null;
type Interface_Data (Nb_Ifaces : Positive);
type Interface_Data_Ptr is access all Interface_Data;
-- Table of abstract interfaces used to give support to backward interface
-- conversions and also to IW_Membership.
type Object_Specific_Data (Nb_Prim : Positive);
type Object_Specific_Data_Ptr is access all Object_Specific_Data;
-- Information associated with the secondary dispatch table of tagged-type
-- objects implementing abstract interfaces.
type Select_Specific_Data (Nb_Prim : Positive);
type Select_Specific_Data_Ptr is access all Select_Specific_Data;
-- A table used to store the primitive operation kind and entry index of
-- primitive subprograms of a type that implements a limited interface.
-- The Select Specific Data table resides in the Type Specific Data of a
-- type. This construct is used in the handling of dispatching triggers
-- in select statements.
type Type_Specific_Data;
type Type_Specific_Data_Ptr is access all Type_Specific_Data;
-- Primitive operation kinds. These values differentiate the kinds of
-- callable entities stored in the dispatch table. Certain kinds may
-- not be used, but are added for completeness.
type Prim_Op_Kind is
(POK_Function,
POK_Procedure,
POK_Protected_Entry,
POK_Protected_Function,
POK_Protected_Procedure,
POK_Task_Entry,
POK_Task_Function,
POK_Task_Procedure);
-- Tagged type kinds with respect to concurrency and limitedness
type Tagged_Kind is
(TK_Abstract_Limited_Tagged,
TK_Abstract_Tagged,
TK_Limited_Tagged,
TK_Protected,
TK_Tagged,
TK_Task);
type Tagged_Kind_Ptr is access all Tagged_Kind;
Default_Prim_Op_Count : constant Positive := 15;
-- Number of predefined primitive operations added by the Expander for a
-- tagged type (must match Exp_Disp.Default_Prim_Op_Count).
type Signature_Kind is
(Unknown,
Valid_Signature,
Primary_DT,
Secondary_DT,
Abstract_Interface);
for Signature_Kind'Size use 8;
-- Kind of signature found in the header of the dispatch table. These
-- signatures are generated by the frontend and are used by the Check_XXX
-- routines to ensure that the kind of dispatch table managed by each of
-- the routines in this package is correct. This additional check is only
-- performed with this run-time package is compiled with assertions enabled
-- The signature is a sequence of two bytes. The first byte must have the
-- value Valid_Signature, and the second byte must have a value in the
-- range Primary_DT .. Abstract_Interface. The Unknown value is used by
-- the Check_XXX routines to indicate that the signature is wrong.
package SSE renames System.Storage_Elements;
function CW_Membership (Obj_Tag : Tag; Typ_Tag : Tag) return Boolean;
-- Given the tag of an object and the tag associated to a type, return
-- true if Obj is in Typ'Class.
function IW_Membership (This : System.Address; T : Tag) return Boolean;
-- Ada 2005 (AI-251): General routine that checks if a given object
-- implements a tagged type. Its common usage is to check if Obj is in
-- Iface'Class, but it is also used to check if a class-wide interface
-- implements a given type (Iface_CW_Typ in T'Class). For example:
--
-- type I is interface;
-- type T is tagged ...
--
-- function Test (O : in I'Class) is
-- begin
-- return O in T'Class.
-- end Test;
function Displace (This : System.Address; T : Tag) return System.Address;
-- (Ada 2005 (AI-251): Displace "This" to point to the secondary dispatch
-- table of T.
function Get_Access_Level (T : Tag) return Natural;
-- Given the tag associated with a type, returns the accessibility level
-- of the type.
function Get_Entry_Index (T : Tag; Position : Positive) return Positive;
-- Return a primitive operation's entry index (if entry) given a dispatch
-- table T and a position of a primitive operation in T.
function Get_External_Tag (T : Tag) return System.Address;
-- Retrieve the address of a null terminated string containing
-- the external name.
function Get_Offset_Index
(T : Tag;
Position : Positive) return Positive;
-- Given a pointer to a secondary dispatch table (T) and a position of an
-- operation in the DT, retrieve the corresponding operation's position in
-- the primary dispatch table from the Offset Specific Data table of T.
function Get_Predefined_Prim_Op_Address
(T : Tag;
Position : Positive) return System.Address;
-- Given a pointer to a dispatch table (T) and a position in the DT
-- this function returns the address of the virtual function stored
-- in it (used for dispatching calls).
function Get_Prim_Op_Address
(T : Tag;
Position : Positive) return System.Address;
-- Given a pointer to a dispatch table (T) and a position in the DT
-- this function returns the address of the virtual function stored
-- in it (used for dispatching calls).
function Get_Prim_Op_Kind
(T : Tag;
Position : Positive) return Prim_Op_Kind;
-- Return a primitive operation's kind given a dispatch table T and a
-- position of a primitive operation in T.
function Get_RC_Offset (T : Tag) return SSE.Storage_Offset;
-- Return the Offset of the implicit record controller when the object
-- has controlled components. O otherwise.
pragma Export (Ada, Get_RC_Offset, "ada__tags__get_rc_offset");
-- This procedure is used in s-finimp to compute the deep routines
-- it is exported manually in order to avoid changing completely the
-- organization of the run time.
function Get_Remotely_Callable (T : Tag) return Boolean;
-- Return the value previously set by Set_Remotely_Callable
function Get_Tagged_Kind (T : Tag) return Tagged_Kind;
-- Given a pointer to either a primary or a secondary dispatch table,
-- return the tagged kind of a type in the context of concurrency and
-- limitedness.
procedure Inherit_DT (Old_T : Tag; New_T : Tag; Entry_Count : Natural);
-- Entry point used to initialize the DT of a type knowing the tag
-- of the direct ancestor and the number of primitive ops that are
-- inherited (Entry_Count).
procedure Inherit_TSD (Old_Tag : Tag; New_Tag : Tag);
-- Initialize the TSD of a type knowing the tag of the direct ancestor
function Offset_To_Top
(This : System.Address) return System.Storage_Elements.Storage_Offset;
-- Returns the current value of the offset_to_top component available in
-- the prologue of the dispatch table. If the parent of the tagged type
-- has discriminants this value is stored in a record component just
-- immediately after the tag component.
function OSD (T : Tag) return Object_Specific_Data_Ptr;
-- Ada 2005 (AI-251): Given a pointer T to a secondary dispatch table,
-- retrieve the address of the record containing the Objet Specific
-- Data table.
function Parent_Size
(Obj : System.Address;
T : Tag) return SSE.Storage_Count;
-- Computes the size the ancestor part of a tagged extension object whose
-- address is 'obj' by calling indirectly the ancestor _size function. The
-- ancestor is the parent of the type represented by tag T. This function
-- assumes that _size is always in slot one of the dispatch table.
pragma Export (Ada, Parent_Size, "ada__tags__parent_size");
-- This procedure is used in s-finimp and is thus exported manually
procedure Register_Interface_Tag
(T : Tag;
Interface_T : Tag;
Position : Positive);
-- Ada 2005 (AI-251): Used to initialize the table of interfaces
-- implemented by a type. Required to give support to backward interface
-- conversions and also to IW_Membership.
procedure Register_Tag (T : Tag);
-- Insert the Tag and its associated external_tag in a table for the
-- sake of Internal_Tag
procedure Set_Access_Level (T : Tag; Value : Natural);
-- Sets the accessibility level of the tagged type associated with T
-- in its TSD.
procedure Set_Entry_Index (T : Tag; Position : Positive; Value : Positive);
-- Set the entry index of a primitive operation in T's TSD table indexed
-- by Position.
procedure Set_Expanded_Name (T : Tag; Value : System.Address);
-- Set the address of the string containing the expanded name
-- in the Dispatch table.
procedure Set_External_Tag (T : Tag; Value : System.Address);
-- Set the address of the string containing the external tag
-- in the Dispatch table.
procedure Set_Interface_Table (T : Tag; Value : System.Address);
-- Ada 2005 (AI-251): Given a pointer T to a dispatch Table, stores the
-- pointer to the table of interfaces.
procedure Set_Num_Prim_Ops (T : Tag; Value : Natural);
-- Set the number of primitive operations in the dispatch table of T. This
-- is used for debugging purposes.
procedure Set_Offset_Index
(T : Tag;
Position : Positive;
Value : Positive);
-- Set the offset value of a primitive operation in a secondary dispatch
-- table denoted by T, indexed by Position.
procedure Set_Offset_To_Top
(This : System.Address;
Interface_T : Tag;
Is_Static : Boolean;
Offset_Value : System.Storage_Elements.Storage_Offset;
Offset_Func : System.Address);
-- Ada 2005 (AI-251): Initialize the Offset_To_Top field in the prologue of
-- the dispatch table. In primary dispatch tables the value of "This" is
-- not required (and the compiler passes always the Null_Address value) and
-- the Offset_Value is always cero; in secondary dispatch tables "This"
-- points to the object, Interface_T is the interface for which the
-- secondary dispatch table is being initialized, and Offset_Value is the
-- distance from "This" to the object component containing the tag of the
-- secondary dispatch table.
procedure Set_OSD (T : Tag; Value : System.Address);
-- Given a pointer T to a secondary dispatch table, store the pointer to
-- the record containing the Object Specific Data generated by GNAT.
procedure Set_Predefined_Prim_Op_Address
(T : Tag;
Position : Positive;
Value : System.Address);
-- Given a pointer to a dispatch Table (T) and a position in the dispatch
-- table associated with a predefined primitive operation, put the address
-- of the virtual function in it (used for overriding).
procedure Set_Prim_Op_Address
(T : Tag;
Position : Positive;
Value : System.Address);
-- Given a pointer to a dispatch Table (T) and a position in the dispatch
-- Table put the address of the virtual function in it (used for
-- overriding).
procedure Set_Prim_Op_Kind
(T : Tag;
Position : Positive;
Value : Prim_Op_Kind);
-- Set the kind of a primitive operation in T's TSD table indexed by
-- Position.
procedure Set_RC_Offset (T : Tag; Value : SSE.Storage_Offset);
-- Sets the Offset of the implicit record controller when the object
-- has controlled components. Set to O otherwise.
procedure Set_Remotely_Callable (T : Tag; Value : Boolean);
-- Set to true if the type has been declared in a context described
-- in E.4 (18).
procedure Set_Signature (T : Tag; Value : Signature_Kind);
-- Given a pointer T to a dispatch table, store the signature id
procedure Set_SSD (T : Tag; Value : System.Address);
-- Given a pointer T to a dispatch Table, stores the pointer to the record
-- containing the Select Specific Data generated by GNAT.
procedure Set_Tagged_Kind (T : Tag; Value : Tagged_Kind);
-- Set the tagged kind of a type in either a primary or a secondary
-- dispatch table denoted by T.
procedure Set_TSD (T : Tag; Value : System.Address);
-- Given a pointer T to a dispatch Table, stores the address of the record
-- containing the Type Specific Data generated by GNAT.
function SSD (T : Tag) return Select_Specific_Data_Ptr;
-- Given a pointer T to a dispatch Table, retrieves the address of the
-- record containing the Select Specific Data in T's TSD.
function TSD (T : Tag) return Type_Specific_Data_Ptr;
-- Given a pointer T to a dispatch Table, retrieves the address of the
-- record containing the Type Specific Data generated by GNAT.
DT_Prologue_Size : constant SSE.Storage_Count :=
SSE.Storage_Count
((Default_Prim_Op_Count + 4) *
(Standard'Address_Size / System.Storage_Unit));
-- Size of the hidden part of the dispatch table. It contains the table of
-- predefined primitive operations plus the C++ ABI header.
DT_Signature_Size : constant SSE.Storage_Count :=
SSE.Storage_Count
(1 * (Standard'Address_Size / System.Storage_Unit));
-- Size of the Signature field of the dispatch table
DT_Tagged_Kind_Size : constant SSE.Storage_Count :=
SSE.Storage_Count (1 * (Standard'Address_Size / System.Storage_Unit));
-- Size of the Tagged_Type_Kind field of the dispatch table
DT_Offset_To_Top_Size : constant SSE.Storage_Count :=
SSE.Storage_Count
(1 * (Standard'Address_Size /
System.Storage_Unit));
-- Size of the Offset_To_Top field of the Dispatch Table
DT_Typeinfo_Ptr_Size : constant SSE.Storage_Count :=
SSE.Storage_Count
(1 * (Standard'Address_Size /
System.Storage_Unit));
-- Size of the Typeinfo_Ptr field of the Dispatch Table
DT_Entry_Size : constant SSE.Storage_Count :=
SSE.Storage_Count
(1 * (Standard'Address_Size / System.Storage_Unit));
-- Size of each primitive operation entry in the Dispatch Table
Tag_Size : constant SSE.Storage_Count :=
SSE.Storage_Count (1 * (Standard'Address_Size / System.Storage_Unit));
-- Size of each tag
TSD_Prologue_Size : constant SSE.Storage_Count :=
SSE.Storage_Count
(10 * (Standard'Address_Size /
System.Storage_Unit));
-- Size of the first part of the type specific data
TSD_Entry_Size : constant SSE.Storage_Count :=
SSE.Storage_Count
(1 * (Standard'Address_Size / System.Storage_Unit));
-- Size of each ancestor tag entry in the TSD
type Address_Array is array (Natural range <>) of System.Address;
pragma Suppress (Index_Check, On => Address_Array);
-- The reason we suppress index checks is that in the body, objects
-- of this type are declared with a dummy size of 1, the actual size
-- depending on the number of primitive operations.
-- Unchecked Conversions
type Addr_Ptr is access System.Address;
type Tag_Ptr is access Tag;
type Signature_Values is
array (1 .. DT_Signature_Size) of Signature_Kind;
-- Type used to see the signature as a sequence of Signature_Kind values
type Signature_Values_Ptr is access all Signature_Values;
function To_Addr_Ptr is
new Unchecked_Conversion (System.Address, Addr_Ptr);
function To_Type_Specific_Data_Ptr is
new Unchecked_Conversion (System.Address, Type_Specific_Data_Ptr);
function To_Address is
new Unchecked_Conversion (Interface_Tag, System.Address);
function To_Address is
new Unchecked_Conversion (Tag, System.Address);
function To_Address is
new Unchecked_Conversion (Type_Specific_Data_Ptr, System.Address);
function To_Interface_Data_Ptr is
new Unchecked_Conversion (System.Address, Interface_Data_Ptr);
function To_Object_Specific_Data_Ptr is
new Unchecked_Conversion (System.Address, Object_Specific_Data_Ptr);
function To_Select_Specific_Data_Ptr is
new Unchecked_Conversion (System.Address, Select_Specific_Data_Ptr);
function To_Signature_Values is
new Unchecked_Conversion (System.Storage_Elements.Storage_Offset,
Signature_Values);
function To_Signature_Values_Ptr is
new Unchecked_Conversion (System.Address,
Signature_Values_Ptr);
function To_Tag is
new Unchecked_Conversion (System.Address, Tag);
function To_Tag_Ptr is
new Unchecked_Conversion (System.Address, Tag_Ptr);
function To_Tagged_Kind_Ptr is
new Unchecked_Conversion (System.Address, Tagged_Kind_Ptr);
-- Primitive dispatching operations are always inlined, to facilitate
-- use in a minimal/no run-time environment for high integrity use.
pragma Inline_Always (CW_Membership);
pragma Inline_Always (Displace);
pragma Inline_Always (IW_Membership);
pragma Inline_Always (Get_Access_Level);
pragma Inline_Always (Get_Entry_Index);
pragma Inline_Always (Get_Offset_Index);
pragma Inline_Always (Get_Predefined_Prim_Op_Address);
pragma Inline_Always (Get_Prim_Op_Address);
pragma Inline_Always (Get_Prim_Op_Kind);
pragma Inline_Always (Get_RC_Offset);
pragma Inline_Always (Get_Remotely_Callable);
pragma Inline_Always (Get_Tagged_Kind);
pragma Inline_Always (Inherit_DT);
pragma Inline_Always (Inherit_TSD);
pragma Inline_Always (OSD);
pragma Inline_Always (Register_Interface_Tag);
pragma Inline_Always (Register_Tag);
pragma Inline_Always (Set_Access_Level);
pragma Inline_Always (Set_Entry_Index);
pragma Inline_Always (Set_Expanded_Name);
pragma Inline_Always (Set_External_Tag);
pragma Inline_Always (Set_Interface_Table);
pragma Inline_Always (Set_Num_Prim_Ops);
pragma Inline_Always (Set_Offset_Index);
pragma Inline_Always (Set_Offset_To_Top);
pragma Inline_Always (Set_Predefined_Prim_Op_Address);
pragma Inline_Always (Set_Prim_Op_Address);
pragma Inline_Always (Set_Prim_Op_Kind);
pragma Inline_Always (Set_RC_Offset);
pragma Inline_Always (Set_Remotely_Callable);
pragma Inline_Always (Set_Signature);
pragma Inline_Always (Set_OSD);
pragma Inline_Always (Set_SSD);
pragma Inline_Always (Set_TSD);
pragma Inline_Always (Set_Tagged_Kind);
pragma Inline_Always (SSD);
pragma Inline_Always (TSD);
end Ada.Tags;
|
with Asis;
with A_Nodes;
with Dot;
package Asis_Tool_2.Unit is
type Class (Trace : Boolean := False) is tagged limited private; -- Initialized
procedure Process
(This : in out Class;
Unit : in Asis.Compilation_Unit;
Outputs : in Outputs_Record);
private
type Class (Trace : Boolean := False) is tagged limited
record
-- Current, in-progress intermediate output products:
-- Used when making dot edges to child nodes:
Unit_ID : a_nodes_h.Unit_ID := anhS.Invalid_Unit_ID;
Dot_Node : Dot.Node_Stmt.Class; -- Initialized
Dot_Label : Dot.HTML_Like_Labels.Class; -- Initialized
A_Unit : a_nodes_h.Unit_Struct := anhS.Default_Unit_Struct;
-- I would like to just pass Outputs through and not store it in the
-- object, since it is all pointers and we doesn't need to store their
-- values between calls to Process_Element_Tree. Outputs has to go into
-- Add_To_Dot_Label, though, so we'll put it in the object and pass
-- that:
Outputs : Outputs_Record; -- Initialized
end record;
end Asis_Tool_2.Unit;
|
pragma Ada_2012;
pragma Style_Checks (Off);
with System;
package Vulkan.Low_Level.vulkan_metal_h is
VULKAN_METAL_H_u : constant := 1; -- vulkan_metal.h:2
VK_EXT_metal_surface : constant := 1; -- vulkan_metal.h:32
VK_EXT_METAL_SURFACE_SPEC_VERSION : constant := 1; -- vulkan_metal.h:40
VK_EXT_METAL_SURFACE_EXTENSION_NAME : aliased constant String := "VK_EXT_metal_surface" & ASCII.NUL; -- vulkan_metal.h:41
--** Copyright (c) 2015-2019 The Khronos Group Inc.
--**
--** 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.
--
--** This header is generated from the Khronos Vulkan XML API Registry.
--**
--
subtype CAMetalLayer is System.Address; -- vulkan_metal.h:37
type VkMetalSurfaceCreateInfoEXT is record
pNext : System.Address; -- vulkan_metal.h:45
pLayer : System.Address; -- vulkan_metal.h:47
end record
with Convention => C_Pass_By_Copy; -- vulkan_metal.h:43
end Vulkan.Low_Level.vulkan_metal_h;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- I N T E R F A C E S . P A C K E D _ D E C I M A L --
-- --
-- B o d y --
-- (Version for IBM Mainframe Packed Decimal Format) --
-- --
-- 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 System; use System;
with Ada.Unchecked_Conversion;
package body Interfaces.Packed_Decimal is
type Packed is array (Byte_Length) of Unsigned_8;
-- The type used internally to represent packed decimal
type Packed_Ptr is access Packed;
function To_Packed_Ptr is
new Ada.Unchecked_Conversion (Address, Packed_Ptr);
-- The following array is used to convert a value in the range 0-99 to
-- a packed decimal format with two hexadecimal nibbles. It is worth
-- using table look up in this direction because divides are expensive.
Packed_Byte : constant array (00 .. 99) of Unsigned_8 :=
(16#00#, 16#01#, 16#02#, 16#03#, 16#04#,
16#05#, 16#06#, 16#07#, 16#08#, 16#09#,
16#10#, 16#11#, 16#12#, 16#13#, 16#14#,
16#15#, 16#16#, 16#17#, 16#18#, 16#19#,
16#20#, 16#21#, 16#22#, 16#23#, 16#24#,
16#25#, 16#26#, 16#27#, 16#28#, 16#29#,
16#30#, 16#31#, 16#32#, 16#33#, 16#34#,
16#35#, 16#36#, 16#37#, 16#38#, 16#39#,
16#40#, 16#41#, 16#42#, 16#43#, 16#44#,
16#45#, 16#46#, 16#47#, 16#48#, 16#49#,
16#50#, 16#51#, 16#52#, 16#53#, 16#54#,
16#55#, 16#56#, 16#57#, 16#58#, 16#59#,
16#60#, 16#61#, 16#62#, 16#63#, 16#64#,
16#65#, 16#66#, 16#67#, 16#68#, 16#69#,
16#70#, 16#71#, 16#72#, 16#73#, 16#74#,
16#75#, 16#76#, 16#77#, 16#78#, 16#79#,
16#80#, 16#81#, 16#82#, 16#83#, 16#84#,
16#85#, 16#86#, 16#87#, 16#88#, 16#89#,
16#90#, 16#91#, 16#92#, 16#93#, 16#94#,
16#95#, 16#96#, 16#97#, 16#98#, 16#99#);
---------------------
-- Int32_To_Packed --
---------------------
procedure Int32_To_Packed (V : Integer_32; P : System.Address; D : D32) is
PP : constant Packed_Ptr := To_Packed_Ptr (P);
Empty_Nibble : constant Boolean := ((D rem 2) = 0);
B : constant Byte_Length := (D / 2) + 1;
VV : Integer_32 := V;
begin
-- Deal with sign byte first
if VV >= 0 then
PP (B) := Unsigned_8 (VV rem 10) * 16 + 16#C#;
VV := VV / 10;
else
VV := -VV;
PP (B) := Unsigned_8 (VV rem 10) * 16 + 16#D#;
end if;
for J in reverse B - 1 .. 2 loop
if VV = 0 then
for K in 1 .. J loop
PP (K) := 16#00#;
end loop;
return;
else
PP (J) := Packed_Byte (Integer (VV rem 100));
VV := VV / 100;
end if;
end loop;
-- Deal with leading byte
if Empty_Nibble then
if VV > 9 then
raise Constraint_Error;
else
PP (1) := Unsigned_8 (VV);
end if;
else
if VV > 99 then
raise Constraint_Error;
else
PP (1) := Packed_Byte (Integer (VV));
end if;
end if;
end Int32_To_Packed;
---------------------
-- Int64_To_Packed --
---------------------
procedure Int64_To_Packed (V : Integer_64; P : System.Address; D : D64) is
PP : constant Packed_Ptr := To_Packed_Ptr (P);
Empty_Nibble : constant Boolean := ((D rem 2) = 0);
B : constant Byte_Length := (D / 2) + 1;
VV : Integer_64 := V;
begin
-- Deal with sign byte first
if VV >= 0 then
PP (B) := Unsigned_8 (VV rem 10) * 16 + 16#C#;
VV := VV / 10;
else
VV := -VV;
PP (B) := Unsigned_8 (VV rem 10) * 16 + 16#D#;
end if;
for J in reverse B - 1 .. 2 loop
if VV = 0 then
for K in 1 .. J loop
PP (K) := 16#00#;
end loop;
return;
else
PP (J) := Packed_Byte (Integer (VV rem 100));
VV := VV / 100;
end if;
end loop;
-- Deal with leading byte
if Empty_Nibble then
if VV > 9 then
raise Constraint_Error;
else
PP (1) := Unsigned_8 (VV);
end if;
else
if VV > 99 then
raise Constraint_Error;
else
PP (1) := Packed_Byte (Integer (VV));
end if;
end if;
end Int64_To_Packed;
---------------------
-- Packed_To_Int32 --
---------------------
function Packed_To_Int32 (P : System.Address; D : D32) return Integer_32 is
PP : constant Packed_Ptr := To_Packed_Ptr (P);
Empty_Nibble : constant Boolean := ((D mod 2) = 0);
B : constant Byte_Length := (D / 2) + 1;
V : Integer_32;
Dig : Unsigned_8;
Sign : Unsigned_8;
J : Positive;
begin
-- Cases where there is an unused (zero) nibble in the first byte.
-- Deal with the single digit nibble at the right of this byte
if Empty_Nibble then
V := Integer_32 (PP (1));
J := 2;
if V > 9 then
raise Constraint_Error;
end if;
-- Cases where all nibbles are used
else
V := 0;
J := 1;
end if;
-- Loop to process bytes containing two digit nibbles
while J < B loop
Dig := Shift_Right (PP (J), 4);
if Dig > 9 then
raise Constraint_Error;
else
V := V * 10 + Integer_32 (Dig);
end if;
Dig := PP (J) and 16#0F#;
if Dig > 9 then
raise Constraint_Error;
else
V := V * 10 + Integer_32 (Dig);
end if;
J := J + 1;
end loop;
-- Deal with digit nibble in sign byte
Dig := Shift_Right (PP (J), 4);
if Dig > 9 then
raise Constraint_Error;
else
V := V * 10 + Integer_32 (Dig);
end if;
Sign := PP (J) and 16#0F#;
-- Process sign nibble (deal with most common cases first)
if Sign = 16#C# then
return V;
elsif Sign = 16#D# then
return -V;
elsif Sign = 16#B# then
return -V;
elsif Sign >= 16#A# then
return V;
else
raise Constraint_Error;
end if;
end Packed_To_Int32;
---------------------
-- Packed_To_Int64 --
---------------------
function Packed_To_Int64 (P : System.Address; D : D64) return Integer_64 is
PP : constant Packed_Ptr := To_Packed_Ptr (P);
Empty_Nibble : constant Boolean := ((D mod 2) = 0);
B : constant Byte_Length := (D / 2) + 1;
V : Integer_64;
Dig : Unsigned_8;
Sign : Unsigned_8;
J : Positive;
begin
-- Cases where there is an unused (zero) nibble in the first byte.
-- Deal with the single digit nibble at the right of this byte
if Empty_Nibble then
V := Integer_64 (PP (1));
J := 2;
if V > 9 then
raise Constraint_Error;
end if;
-- Cases where all nibbles are used
else
J := 1;
V := 0;
end if;
-- Loop to process bytes containing two digit nibbles
while J < B loop
Dig := Shift_Right (PP (J), 4);
if Dig > 9 then
raise Constraint_Error;
else
V := V * 10 + Integer_64 (Dig);
end if;
Dig := PP (J) and 16#0F#;
if Dig > 9 then
raise Constraint_Error;
else
V := V * 10 + Integer_64 (Dig);
end if;
J := J + 1;
end loop;
-- Deal with digit nibble in sign byte
Dig := Shift_Right (PP (J), 4);
if Dig > 9 then
raise Constraint_Error;
else
V := V * 10 + Integer_64 (Dig);
end if;
Sign := PP (J) and 16#0F#;
-- Process sign nibble (deal with most common cases first)
if Sign = 16#C# then
return V;
elsif Sign = 16#D# then
return -V;
elsif Sign = 16#B# then
return -V;
elsif Sign >= 16#A# then
return V;
else
raise Constraint_Error;
end if;
end Packed_To_Int64;
end Interfaces.Packed_Decimal;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . T E X T _ I O . C _ S T R E A M S --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2009, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package provides an interface between Ada.Text_IO and the
-- C streams. This allows sharing of a stream between Ada and C or C++,
-- as well as allowing the Ada program to operate directly on the stream.
with Interfaces.C_Streams;
package Ada.Text_IO.C_Streams is
package ICS renames Interfaces.C_Streams;
function C_Stream (F : File_Type) return ICS.FILEs;
-- Obtain stream from existing open file
procedure Open
(File : in out File_Type;
Mode : File_Mode;
C_Stream : ICS.FILEs;
Form : String := "";
Name : String := "");
-- Create new file from existing stream
end Ada.Text_IO.C_Streams;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Elements.Generic_Hash;
function AMF.UMLDI.UML_Composite_Structure_Diagrams.Hash is
new AMF.Elements.Generic_Hash (UMLDI_UML_Composite_Structure_Diagram, UMLDI_UML_Composite_Structure_Diagram_Access);
|
------------------------------------------------------------------------------
-- --
-- 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$
------------------------------------------------------------------------------
-- AMF module for DD metamodel.
------------------------------------------------------------------------------
package AMF.Internals.Modules.DD_Module is
pragma Elaborate_Body;
end AMF.Internals.Modules.DD_Module;
|
-- Amp
--
-- Amplifier LADSPA plugin.
------------------------------------------------------------------------------------------------------------------------
-- with Ada.Finalization;
with Interfaces.C;
with LADSPA;
package Amp is
type Port_Numbers is (Gain, Input_1, Output_1, Input_2, Output_2) with
Convention => C;
private
package C renames Interfaces.C;
function Descriptor (Index : C.unsigned_long) return access constant LADSPA.Descriptors with
Export => True,
Convention => C,
External_Name => "ladspa_descriptor";
end Amp; |
-- C41303K.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- CHECK THAT THE NOTATION L.ALL IS ALLOWED IF L IS THE NAME OF AN
-- ACCESS OBJECT DESIGNATING A RECORD, AN ARRAY, A SCALAR, OR
-- ANOTHER ACCESS OBJECT.
-- CHECK THAT IF A IS AN IDENTIFIER DENOTING AN ACCESS OBJECT WHICH
-- IN TURN DESIGNATES AN ACCESS OBJECT, THE FORM A.ALL.ALL IS
-- ACCEPTED.
-- THIS OBJECTIVE IS COVERED IN SEVERAL TESTS. IN THE FOLLOWING DIAGRAM,
-- THE PORTION COVERED BY THE CURRENT TEST IS MARKED BY 'X' .
-- || ASSIGNMT | PROC. PARAMETERS
-- || ():= :=() | IN OUT IN OUT
-- ========================||=============|====================
-- ACC REC || |
-- --------------||-------------|--------------------
-- 1 '.ALL' ACC ARR || |
-- --------------||-------------|--------------------
-- ACC SCLR || |
-- ========================||=============|====================
-- ACC ACC REC || |
-- --------------||-------------|--------------------
-- 1 '.ALL' ACC ACC ARR || |
-- --------------||-------------|--------------------
-- ACC ACC SCLR || |
-- ========================||=============|====================
-- ACC ACC REC || |
-- --------------||-------------|--------------------
-- 2 '.ALL' ACC ACC ARR || |
-- --------------||-------------|--------------------
-- ACC ACC SCLR || XXXXXXXXX |
-- ============================================================
-- RM 1/20/82
-- RM 1/25/82
-- SPS 12/2/82
WITH REPORT;
USE REPORT;
PROCEDURE C41303K IS
BEGIN
TEST ( "C41303K" , "CHECK THAT IF A IS AN IDENTIFIER DENOTING" &
" AN ACCESS OBJECT WHICH IN TURN DESIGNATES" &
" AN ACCESS OBJECT, THE FORM A.ALL.ALL IS" &
" ACCEPTED" );
-------------------------------------------------------------------
--------------- ACCESS TO ACCESS TO SCALAR ----------------------
DECLARE
TYPE NEWINT IS NEW INTEGER ;
NEWINT_CONST : NEWINT := ( 813 );
NEWINT_VAR : NEWINT := NEWINT_CONST ;
NEWINT_CONST2 : NEWINT := ( 707 );
TYPE ACCNEWINT IS ACCESS NEWINT ;
TYPE ACC_ACCNEWINT IS ACCESS ACCNEWINT ;
ACC_ACCNEWINT_VAR : ACC_ACCNEWINT := NEW ACCNEWINT'(
NEW NEWINT' (
NEWINT_CONST2
)
);
BEGIN
NEWINT_VAR := ACC_ACCNEWINT_VAR.ALL.ALL ;
IF NEWINT_VAR /= NEWINT_CONST2
THEN
FAILED( "ACC2 NEWINT,RIGHT SIDE OF ASSIGN., WRONG VAL.");
END IF;
ACC_ACCNEWINT_VAR.ALL.ALL := NEWINT_CONST ;
IF NEWINT_CONST /= ACC_ACCNEWINT_VAR.ALL.ALL
THEN
FAILED( "ACC2 NEWINT,LEFT SIDE OF ASSIGN., WRONG VAL." );
END IF;
END ;
-------------------------------------------------------------------
RESULT;
END C41303K;
|
-- Generated by utildgen.c from system includes
with Interfaces.C;
package Util.Systems.Constants is
pragma Pure;
-- Flags used when opening a file with open/creat.
O_RDONLY : constant Interfaces.C.int := 8#000000#;
O_WRONLY : constant Interfaces.C.int := 8#000001#;
O_RDWR : constant Interfaces.C.int := 8#000002#;
O_CREAT : constant Interfaces.C.int := 8#001000#;
O_EXCL : constant Interfaces.C.int := 8#004000#;
O_TRUNC : constant Interfaces.C.int := 8#002000#;
O_APPEND : constant Interfaces.C.int := 8#000010#;
O_CLOEXEC : constant Interfaces.C.int := 8#4000000#;
O_SYNC : constant Interfaces.C.int := 8#000200#;
O_DIRECT : constant Interfaces.C.int := 8#200000#;
O_NONBLOCK : constant Interfaces.C.int := 8#000004#;
-- Flags used by fcntl
F_SETFL : constant Interfaces.C.int := 4;
F_GETFL : constant Interfaces.C.int := 3;
FD_CLOEXEC : constant Interfaces.C.int := 1;
-- Flags used by dlopen
RTLD_LAZY : constant Interfaces.C.int := 8#000001#;
RTLD_NOW : constant Interfaces.C.int := 8#000002#;
RTLD_NOLOAD : constant Interfaces.C.int := 8#020000#;
RTLD_DEEPBIND : constant Interfaces.C.int := 8#000000#;
RTLD_GLOBAL : constant Interfaces.C.int := 8#000400#;
RTLD_LOCAL : constant Interfaces.C.int := 8#000000#;
RTLD_NODELETE : constant Interfaces.C.int := 8#010000#;
DLL_OPTIONS : constant String := "-ldl";
SYMBOL_PREFIX : constant String := "";
end Util.Systems.Constants;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- I N T E R F A C E S . C . S T R I N G S --
-- --
-- S p e c --
-- --
-- Copyright (C) 1993-2010, 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 System.Parameters;
package Interfaces.C.Strings is
pragma Preelaborate;
type char_array_access is access all char_array;
for char_array_access'Size use System.Parameters.ptr_bits;
pragma No_Strict_Aliasing (char_array_access);
-- Since this type is used for external interfacing, with the pointer
-- coming from who knows where, it seems a good idea to turn off any
-- strict aliasing assumptions for this type.
type chars_ptr is private;
pragma Preelaborable_Initialization (chars_ptr);
type chars_ptr_array is array (size_t range <>) of aliased chars_ptr;
Null_Ptr : constant chars_ptr;
function To_Chars_Ptr
(Item : char_array_access;
Nul_Check : Boolean := False) return chars_ptr;
-- function New_Char_Array (Chars : char_array) return chars_ptr;
-- function New_String (Str : String) return chars_ptr;
-- procedure Free (Item : in out chars_ptr);
-- Dereference_Error : exception;
-- function Value (Item : chars_ptr) return char_array;
-- function Value
-- (Item : chars_ptr;
-- Length : size_t) return char_array;
-- function Value (Item : chars_ptr) return String;
-- function Value
-- (Item : chars_ptr;
-- Length : size_t) return String;
function Strlen (Item : chars_ptr) return size_t;
-- procedure Update
-- (Item : chars_ptr;
-- Offset : size_t;
-- Chars : char_array;
-- Check : Boolean := True);
-- procedure Update
-- (Item : chars_ptr;
-- Offset : size_t;
-- Str : String;
-- Check : Boolean := True);
-- Update_Error : exception;
private
type chars_ptr is access all Character;
for chars_ptr'Size use System.Parameters.ptr_bits;
pragma No_Strict_Aliasing (chars_ptr);
-- Since this type is used for external interfacing, with the pointer
-- coming from who knows where, it seems a good idea to turn off any
-- strict aliasing assumptions for this type.
Null_Ptr : constant chars_ptr := null;
end Interfaces.C.Strings;
|
with Ada.Strings; use Ada.Strings;
with Ada.Strings.Fixed; use Ada.Strings.Fixed;
with Ada.Text_IO; use Ada.Text_IO;
with Libadalang.Analysis; use Libadalang.Analysis;
with Libadalang.Common; use Libadalang.Common;
with Rejuvenation.Finder;
with Rejuvenation.Utils;
package body Generator.Match_Pattern_Specific is
use Rejuvenation.Node_List;
function Equivalent_Key (Left, Right : String) return Boolean is
begin
return Left = Right;
end Equivalent_Key;
function Equivalent_Value (Left, Right : List_String.Vector) return Boolean
is
use List_String;
begin
return Left = Right;
end Equivalent_Value;
Type_Decls : constant Rejuvenation.Node_List.Vector :=
Rejuvenation.Finder.Find (Unit_LAL_Ads.Root, Ada_Type_Decl);
Subp_Decls : constant Rejuvenation.Node_List.Vector :=
Rejuvenation.Finder.Find (Unit_LAL_Ads.Root, Ada_Subp_Spec);
Type_Decls2 : constant Rejuvenation.Node_List.Vector :=
Rejuvenation.Finder.Find (Unit_LALCO_Ads.Root, Ada_Type_Decl);
Kinds : List_String.Vector;
Type_To_Direct_Children, Type_To_All_Fields : Mapping_Single_Map.Map;
procedure Append
(Map : in out Mapping_Single_Map.Map; Key : String; Value : String)
is
begin
if not Map.Contains (Key) then
declare
List : List_String.Vector;
begin
Map.Include (Key, List);
end;
end if;
declare
List : List_String.Vector := Map.Element (Key);
UValue : constant Unbounded_String := To_Unbounded_String (Value);
begin
if not List.Contains (UValue) then
List.Append (UValue);
Map.Include (Key, List);
end if;
end;
end Append;
procedure Process_Node_Kinds is
begin
for Type_Decl of Type_Decls2 loop
declare
Name : constant Libadalang.Analysis.Name :=
Type_Decl.As_Type_Decl.F_Name.F_Name;
Str_Name : constant String :=
Rejuvenation.Utils.Raw_Signature (Name);
Def : constant Type_Def := Type_Decl.As_Type_Decl.F_Type_Def;
begin
if Str_Name = "Ada_Node_Kind_Type" then
for E of Def.As_Enum_Type_Def.F_Enum_Literals loop
Kinds.Append
(To_Unbounded_String
(Rejuvenation.Utils.Raw_Signature (E)));
end loop;
end if;
end;
end loop;
end Process_Node_Kinds;
procedure Process_Type_Decl is
begin
for Type_Decl of Type_Decls loop
declare
Name : constant Libadalang.Analysis.Name :=
Type_Decl.As_Type_Decl.F_Name.F_Name;
Str_Name : constant String :=
Rejuvenation.Utils.Raw_Signature (Name);
TypeDef : constant Type_Def := Type_Decl.As_Type_Decl.F_Type_Def;
begin
if TypeDef.Kind = Ada_Derived_Type_Def then
if not TypeDef.As_Derived_Type_Def.F_Record_Extension.Is_Null
then
declare
Sub_Type : constant Subtype_Indication :=
TypeDef.As_Derived_Type_Def.F_Subtype_Indication;
Sub_Type_Name : constant Libadalang.Analysis.Name :=
Sub_Type.F_Name;
Str_Sub_Type_Name : constant String :=
Rejuvenation.Utils.Raw_Signature (Sub_Type_Name);
begin
-- Put_Line(Str_Name & " -> " & Str_Sub_Type_Name);
Append (Type_To_Direct_Children,
Str_Sub_Type_Name,
Str_Name);
end;
end if;
end if;
end;
end loop;
end Process_Type_Decl;
procedure Process_Subp is
procedure Add_Recursive (Name : String; Type_Name : String);
procedure Add_Recursive (Name : String; Type_Name : String) is
begin
if Type_To_Direct_Children.Contains (Type_Name) then
for N of Type_To_Direct_Children (Type_Name) loop
-- Put_Line(" -> " & To_String(N));
Append (Type_To_All_Fields, To_String (N), Name);
Add_Recursive (Name, To_String (N));
end loop;
end if;
end Add_Recursive;
begin
for Subp_Decl of Subp_Decls loop
declare
Subp_Name : constant Defining_Name :=
Subp_Decl.As_Subp_Spec.F_Subp_Name;
Name : constant String :=
Rejuvenation.Utils.Raw_Signature (Subp_Name);
begin
if Index (Name, "F_") = 1 then
declare
First_Param : constant Param_Spec :=
Subp_Decl.As_Subp_Spec.F_Subp_Params
.F_Params.Child (1).As_Param_Spec;
First_Param_Type : constant Subtype_Indication :=
First_Param.F_Type_Expr.As_Subtype_Indication;
First_Param_Type_Name : constant Libadalang.Analysis.Name :=
First_Param_Type.F_Name.As_Attribute_Ref.F_Prefix;
Str_First_Param_Type_Name : constant String :=
Rejuvenation.Utils.Raw_Signature (First_Param_Type_Name);
begin
-- Put_Line(Name & " / " & Str_First_Param_Type_Name);
Append (Type_To_All_Fields, Str_First_Param_Type_Name, Name);
Add_Recursive (Name, Str_First_Param_Type_Name);
end;
end if;
end;
end loop;
end Process_Subp;
procedure Generate_Match_Specific is
begin
for E in Type_To_All_Fields.Iterate loop
if Kinds.Contains
(To_Unbounded_String ("Ada_" & Mapping_Single_Map.Key (E)))
then
Put_Line ("elsif Pattern.Kind = Ada_"
& Mapping_Single_Map.Key (E) & " then");
Put_Line (" declare");
Put_Line (" Pattern2 : constant " & Mapping_Single_Map.Key (E)
& " := Pattern.As_" & Mapping_Single_Map.Key (E) & ";");
Put_Line (" Instance2 : constant " & Mapping_Single_Map.Key (E)
& " := Instance.As_" & Mapping_Single_Map.Key (E) & ";");
Put_Line (" begin");
for N of Mapping_Single_Map.Element (E) loop
declare
Prefix : Unbounded_String;
Postfix : Unbounded_String;
begin
if N = Mapping_Single_Map.Element (E).First_Element then
Prefix := To_Unbounded_String (" return ");
else
Prefix := To_Unbounded_String (" ");
end if;
if N = Mapping_Single_Map.Element (E).Last_Element then
Postfix := To_Unbounded_String (";");
else
Postfix := To_Unbounded_String (" and then");
end if;
Put_Line (To_String (Prefix) & "MP.Match (Pattern2."
& To_String (N) & ", Instance2."
& To_String (N) & ")" & To_String (Postfix));
end;
end loop;
Put_Line (" end;");
end if;
end loop;
end Generate_Match_Specific;
procedure Main is
begin
Process_Node_Kinds;
Process_Type_Decl;
Process_Subp;
Generate_Match_Specific;
end Main;
end Generator.Match_Pattern_Specific;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S E M _ A T T R --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2016, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING3. If not, go to --
-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Ada.Characters.Latin_1; use Ada.Characters.Latin_1;
with Atree; use Atree;
with Casing; use Casing;
with Checks; use Checks;
with Debug; use Debug;
with Einfo; use Einfo;
with Elists; use Elists;
with Errout; use Errout;
with Eval_Fat;
with Exp_Dist; use Exp_Dist;
with Exp_Util; use Exp_Util;
with Expander; use Expander;
with Freeze; use Freeze;
with Gnatvsn; use Gnatvsn;
with Itypes; use Itypes;
with Lib; use Lib;
with Lib.Xref; use Lib.Xref;
with Nlists; use Nlists;
with Nmake; use Nmake;
with Opt; use Opt;
with Restrict; use Restrict;
with Rident; use Rident;
with Rtsfind; use Rtsfind;
with Sdefault; use Sdefault;
with Sem; use Sem;
with Sem_Aux; use Sem_Aux;
with Sem_Cat; use Sem_Cat;
with Sem_Ch6; use Sem_Ch6;
with Sem_Ch8; use Sem_Ch8;
with Sem_Ch10; use Sem_Ch10;
with Sem_Dim; use Sem_Dim;
with Sem_Dist; use Sem_Dist;
with Sem_Elab; use Sem_Elab;
with Sem_Elim; use Sem_Elim;
with Sem_Eval; use Sem_Eval;
with Sem_Prag; use Sem_Prag;
with Sem_Res; use Sem_Res;
with Sem_Type; use Sem_Type;
with Sem_Util; use Sem_Util;
with Sem_Warn;
with Stand; use Stand;
with Sinfo; use Sinfo;
with Sinput; use Sinput;
with System;
with Stringt; use Stringt;
with Style;
with Stylesw; use Stylesw;
with Targparm; use Targparm;
with Ttypes; use Ttypes;
with Tbuild; use Tbuild;
with Uintp; use Uintp;
with Uname; use Uname;
with Urealp; use Urealp;
with System.CRC32; use System.CRC32;
package body Sem_Attr is
True_Value : constant Uint := Uint_1;
False_Value : constant Uint := Uint_0;
-- Synonyms to be used when these constants are used as Boolean values
Bad_Attribute : exception;
-- Exception raised if an error is detected during attribute processing,
-- used so that we can abandon the processing so we don't run into
-- trouble with cascaded errors.
-- The following array is the list of attributes defined in the Ada 83 RM.
-- In Ada 83 mode, these are the only recognized attributes. In other Ada
-- modes all these attributes are recognized, even if removed in Ada 95.
Attribute_83 : constant Attribute_Class_Array := Attribute_Class_Array'(
Attribute_Address |
Attribute_Aft |
Attribute_Alignment |
Attribute_Base |
Attribute_Callable |
Attribute_Constrained |
Attribute_Count |
Attribute_Delta |
Attribute_Digits |
Attribute_Emax |
Attribute_Epsilon |
Attribute_First |
Attribute_First_Bit |
Attribute_Fore |
Attribute_Image |
Attribute_Large |
Attribute_Last |
Attribute_Last_Bit |
Attribute_Leading_Part |
Attribute_Length |
Attribute_Machine_Emax |
Attribute_Machine_Emin |
Attribute_Machine_Mantissa |
Attribute_Machine_Overflows |
Attribute_Machine_Radix |
Attribute_Machine_Rounds |
Attribute_Mantissa |
Attribute_Pos |
Attribute_Position |
Attribute_Pred |
Attribute_Range |
Attribute_Safe_Emax |
Attribute_Safe_Large |
Attribute_Safe_Small |
Attribute_Size |
Attribute_Small |
Attribute_Storage_Size |
Attribute_Succ |
Attribute_Terminated |
Attribute_Val |
Attribute_Value |
Attribute_Width => True,
others => False);
-- The following array is the list of attributes defined in the Ada 2005
-- RM which are not defined in Ada 95. These are recognized in Ada 95 mode,
-- but in Ada 95 they are considered to be implementation defined.
Attribute_05 : constant Attribute_Class_Array := Attribute_Class_Array'(
Attribute_Machine_Rounding |
Attribute_Mod |
Attribute_Priority |
Attribute_Stream_Size |
Attribute_Wide_Wide_Width => True,
others => False);
-- The following array is the list of attributes defined in the Ada 2012
-- RM which are not defined in Ada 2005. These are recognized in Ada 95
-- and Ada 2005 modes, but are considered to be implementation defined.
Attribute_12 : constant Attribute_Class_Array := Attribute_Class_Array'(
Attribute_First_Valid |
Attribute_Has_Same_Storage |
Attribute_Last_Valid |
Attribute_Max_Alignment_For_Allocation => True,
others => False);
-- The following array contains all attributes that imply a modification
-- of their prefixes or result in an access value. Such prefixes can be
-- considered as lvalues.
Attribute_Name_Implies_Lvalue_Prefix : constant Attribute_Class_Array :=
Attribute_Class_Array'(
Attribute_Access |
Attribute_Address |
Attribute_Input |
Attribute_Read |
Attribute_Unchecked_Access |
Attribute_Unrestricted_Access => True,
others => False);
-----------------------
-- Local_Subprograms --
-----------------------
procedure Eval_Attribute (N : Node_Id);
-- Performs compile time evaluation of attributes where possible, leaving
-- the Is_Static_Expression/Raises_Constraint_Error flags appropriately
-- set, and replacing the node with a literal node if the value can be
-- computed at compile time. All static attribute references are folded,
-- as well as a number of cases of non-static attributes that can always
-- be computed at compile time (e.g. floating-point model attributes that
-- are applied to non-static subtypes). Of course in such cases, the
-- Is_Static_Expression flag will not be set on the resulting literal.
-- Note that the only required action of this procedure is to catch the
-- static expression cases as described in the RM. Folding of other cases
-- is done where convenient, but some additional non-static folding is in
-- Expand_N_Attribute_Reference in cases where this is more convenient.
function Is_Anonymous_Tagged_Base
(Anon : Entity_Id;
Typ : Entity_Id) return Boolean;
-- For derived tagged types that constrain parent discriminants we build
-- an anonymous unconstrained base type. We need to recognize the relation
-- between the two when analyzing an access attribute for a constrained
-- component, before the full declaration for Typ has been analyzed, and
-- where therefore the prefix of the attribute does not match the enclosing
-- scope.
procedure Set_Boolean_Result (N : Node_Id; B : Boolean);
-- Rewrites node N with an occurrence of either Standard_False or
-- Standard_True, depending on the value of the parameter B. The
-- result is marked as a static expression.
-----------------------
-- Analyze_Attribute --
-----------------------
procedure Analyze_Attribute (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Aname : constant Name_Id := Attribute_Name (N);
P : constant Node_Id := Prefix (N);
Exprs : constant List_Id := Expressions (N);
Attr_Id : constant Attribute_Id := Get_Attribute_Id (Aname);
E1 : Node_Id;
E2 : Node_Id;
P_Type : Entity_Id;
-- Type of prefix after analysis
P_Base_Type : Entity_Id;
-- Base type of prefix after analysis
-----------------------
-- Local Subprograms --
-----------------------
procedure Address_Checks;
-- Semantic checks for valid use of Address attribute. This was made
-- a separate routine with the idea of using it for unrestricted access
-- which seems like it should follow the same rules, but that turned
-- out to be impractical. So now this is only used for Address.
procedure Analyze_Access_Attribute;
-- Used for Access, Unchecked_Access, Unrestricted_Access attributes.
-- Internally, Id distinguishes which of the three cases is involved.
procedure Analyze_Attribute_Old_Result
(Legal : out Boolean;
Spec_Id : out Entity_Id);
-- Common processing for attributes 'Old and 'Result. The routine checks
-- that the attribute appears in a postcondition-like aspect or pragma
-- associated with a suitable subprogram or a body. Flag Legal is set
-- when the above criteria are met. Spec_Id denotes the entity of the
-- subprogram [body] or Empty if the attribute is illegal.
procedure Bad_Attribute_For_Predicate;
-- Output error message for use of a predicate (First, Last, Range) not
-- allowed with a type that has predicates. If the type is a generic
-- actual, then the message is a warning, and we generate code to raise
-- program error with an appropriate reason. No error message is given
-- for internally generated uses of the attributes. This legality rule
-- only applies to scalar types.
procedure Check_Array_Or_Scalar_Type;
-- Common procedure used by First, Last, Range attribute to check
-- that the prefix is a constrained array or scalar type, or a name
-- of an array object, and that an argument appears only if appropriate
-- (i.e. only in the array case).
procedure Check_Array_Type;
-- Common semantic checks for all array attributes. Checks that the
-- prefix is a constrained array type or the name of an array object.
-- The error message for non-arrays is specialized appropriately.
procedure Check_Asm_Attribute;
-- Common semantic checks for Asm_Input and Asm_Output attributes
procedure Check_Component;
-- Common processing for Bit_Position, First_Bit, Last_Bit, and
-- Position. Checks prefix is an appropriate selected component.
procedure Check_Decimal_Fixed_Point_Type;
-- Check that prefix of attribute N is a decimal fixed-point type
procedure Check_Dereference;
-- If the prefix of attribute is an object of an access type, then
-- introduce an explicit dereference, and adjust P_Type accordingly.
procedure Check_Discrete_Type;
-- Verify that prefix of attribute N is a discrete type
procedure Check_E0;
-- Check that no attribute arguments are present
procedure Check_Either_E0_Or_E1;
-- Check that there are zero or one attribute arguments present
procedure Check_E1;
-- Check that exactly one attribute argument is present
procedure Check_E2;
-- Check that two attribute arguments are present
procedure Check_Enum_Image;
-- If the prefix type of 'Image is an enumeration type, set all its
-- literals as referenced, since the image function could possibly end
-- up referencing any of the literals indirectly. Same for Enum_Val.
-- Set the flag only if the reference is in the main code unit. Same
-- restriction when resolving 'Value; otherwise an improperly set
-- reference when analyzing an inlined body will lose a proper
-- warning on a useless with_clause.
procedure Check_First_Last_Valid;
-- Perform all checks for First_Valid and Last_Valid attributes
procedure Check_Fixed_Point_Type;
-- Verify that prefix of attribute N is a fixed type
procedure Check_Fixed_Point_Type_0;
-- Verify that prefix of attribute N is a fixed type and that
-- no attribute expressions are present
procedure Check_Floating_Point_Type;
-- Verify that prefix of attribute N is a float type
procedure Check_Floating_Point_Type_0;
-- Verify that prefix of attribute N is a float type and that
-- no attribute expressions are present
procedure Check_Floating_Point_Type_1;
-- Verify that prefix of attribute N is a float type and that
-- exactly one attribute expression is present
procedure Check_Floating_Point_Type_2;
-- Verify that prefix of attribute N is a float type and that
-- two attribute expressions are present
procedure Check_SPARK_05_Restriction_On_Attribute;
-- Issue an error in formal mode because attribute N is allowed
procedure Check_Integer_Type;
-- Verify that prefix of attribute N is an integer type
procedure Check_Modular_Integer_Type;
-- Verify that prefix of attribute N is a modular integer type
procedure Check_Not_CPP_Type;
-- Check that P (the prefix of the attribute) is not an CPP type
-- for which no Ada predefined primitive is available.
procedure Check_Not_Incomplete_Type;
-- Check that P (the prefix of the attribute) is not an incomplete
-- type or a private type for which no full view has been given.
procedure Check_Object_Reference (P : Node_Id);
-- Check that P is an object reference
procedure Check_PolyORB_Attribute;
-- Validity checking for PolyORB/DSA attribute
procedure Check_Program_Unit;
-- Verify that prefix of attribute N is a program unit
procedure Check_Real_Type;
-- Verify that prefix of attribute N is fixed or float type
procedure Check_Scalar_Type;
-- Verify that prefix of attribute N is a scalar type
procedure Check_Standard_Prefix;
-- Verify that prefix of attribute N is package Standard. Also checks
-- that there are no arguments.
procedure Check_Stream_Attribute (Nam : TSS_Name_Type);
-- Validity checking for stream attribute. Nam is the TSS name of the
-- corresponding possible defined attribute function (e.g. for the
-- Read attribute, Nam will be TSS_Stream_Read).
procedure Check_System_Prefix;
-- Verify that prefix of attribute N is package System
procedure Check_Task_Prefix;
-- Verify that prefix of attribute N is a task or task type
procedure Check_Type;
-- Verify that the prefix of attribute N is a type
procedure Check_Unit_Name (Nod : Node_Id);
-- Check that Nod is of the form of a library unit name, i.e that
-- it is an identifier, or a selected component whose prefix is
-- itself of the form of a library unit name. Note that this is
-- quite different from Check_Program_Unit, since it only checks
-- the syntactic form of the name, not the semantic identity. This
-- is because it is used with attributes (Elab_Body, Elab_Spec and
-- Elaborated) which can refer to non-visible unit.
procedure Error_Attr (Msg : String; Error_Node : Node_Id);
pragma No_Return (Error_Attr);
procedure Error_Attr;
pragma No_Return (Error_Attr);
-- Posts error using Error_Msg_N at given node, sets type of attribute
-- node to Any_Type, and then raises Bad_Attribute to avoid any further
-- semantic processing. The message typically contains a % insertion
-- character which is replaced by the attribute name. The call with
-- no arguments is used when the caller has already generated the
-- required error messages.
procedure Error_Attr_P (Msg : String);
pragma No_Return (Error_Attr);
-- Like Error_Attr, but error is posted at the start of the prefix
procedure Legal_Formal_Attribute;
-- Common processing for attributes Definite and Has_Discriminants.
-- Checks that prefix is generic indefinite formal type.
procedure Max_Alignment_For_Allocation_Max_Size_In_Storage_Elements;
-- Common processing for attributes Max_Alignment_For_Allocation and
-- Max_Size_In_Storage_Elements.
procedure Min_Max;
-- Common processing for attributes Max and Min
procedure Standard_Attribute (Val : Int);
-- Used to process attributes whose prefix is package Standard which
-- yield values of type Universal_Integer. The attribute reference
-- node is rewritten with an integer literal of the given value which
-- is marked as static.
procedure Uneval_Old_Msg;
-- Called when Loop_Entry or Old is used in a potentially unevaluated
-- expression. Generates appropriate message or warning depending on
-- the setting of Opt.Uneval_Old (or flags in an N_Aspect_Specification
-- node in the aspect case).
procedure Unexpected_Argument (En : Node_Id);
-- Signal unexpected attribute argument (En is the argument)
procedure Validate_Non_Static_Attribute_Function_Call;
-- Called when processing an attribute that is a function call to a
-- non-static function, i.e. an attribute function that either takes
-- non-scalar arguments or returns a non-scalar result. Verifies that
-- such a call does not appear in a preelaborable context.
--------------------
-- Address_Checks --
--------------------
procedure Address_Checks is
begin
-- An Address attribute created by expansion is legal even when it
-- applies to other entity-denoting expressions.
if not Comes_From_Source (N) then
return;
-- Address attribute on a protected object self reference is legal
elsif Is_Protected_Self_Reference (P) then
return;
-- Address applied to an entity
elsif Is_Entity_Name (P) then
declare
Ent : constant Entity_Id := Entity (P);
begin
if Is_Subprogram (Ent) then
Set_Address_Taken (Ent);
Kill_Current_Values (Ent);
-- An Address attribute is accepted when generated by the
-- compiler for dispatching operation, and an error is
-- issued once the subprogram is frozen (to avoid confusing
-- errors about implicit uses of Address in the dispatch
-- table initialization).
if Has_Pragma_Inline_Always (Entity (P))
and then Comes_From_Source (P)
then
Error_Attr_P
("prefix of % attribute cannot be Inline_Always "
& "subprogram");
-- It is illegal to apply 'Address to an intrinsic
-- subprogram. This is now formalized in AI05-0095.
-- In an instance, an attempt to obtain 'Address of an
-- intrinsic subprogram (e.g the renaming of a predefined
-- operator that is an actual) raises Program_Error.
elsif Convention (Ent) = Convention_Intrinsic then
if In_Instance then
Rewrite (N,
Make_Raise_Program_Error (Loc,
Reason => PE_Address_Of_Intrinsic));
else
Error_Msg_Name_1 := Aname;
Error_Msg_N
("cannot take % of intrinsic subprogram", N);
end if;
-- Issue an error if prefix denotes an eliminated subprogram
else
Check_For_Eliminated_Subprogram (P, Ent);
end if;
-- Object or label reference
elsif Is_Object (Ent) or else Ekind (Ent) = E_Label then
Set_Address_Taken (Ent);
-- Deal with No_Implicit_Aliasing restriction
if Restriction_Check_Required (No_Implicit_Aliasing) then
if not Is_Aliased_View (P) then
Check_Restriction (No_Implicit_Aliasing, P);
else
Check_No_Implicit_Aliasing (P);
end if;
end if;
-- If we have an address of an object, and the attribute
-- comes from source, then set the object as potentially
-- source modified. We do this because the resulting address
-- can potentially be used to modify the variable and we
-- might not detect this, leading to some junk warnings.
Set_Never_Set_In_Source (Ent, False);
-- Allow Address to be applied to task or protected type,
-- returning null address (what is that about???)
elsif (Is_Concurrent_Type (Etype (Ent))
and then Etype (Ent) = Base_Type (Ent))
or else Ekind (Ent) = E_Package
or else Is_Generic_Unit (Ent)
then
Rewrite (N,
New_Occurrence_Of (RTE (RE_Null_Address), Sloc (N)));
-- Anything else is illegal
else
Error_Attr ("invalid prefix for % attribute", P);
end if;
end;
-- Object is OK
elsif Is_Object_Reference (P) then
return;
-- Subprogram called using dot notation
elsif Nkind (P) = N_Selected_Component
and then Is_Subprogram (Entity (Selector_Name (P)))
then
return;
-- What exactly are we allowing here ??? and is this properly
-- documented in the sinfo documentation for this node ???
elsif Relaxed_RM_Semantics
and then Nkind (P) = N_Attribute_Reference
then
return;
-- All other non-entity name cases are illegal
else
Error_Attr ("invalid prefix for % attribute", P);
end if;
end Address_Checks;
------------------------------
-- Analyze_Access_Attribute --
------------------------------
procedure Analyze_Access_Attribute is
Acc_Type : Entity_Id;
Scop : Entity_Id;
Typ : Entity_Id;
function Build_Access_Object_Type (DT : Entity_Id) return Entity_Id;
-- Build an access-to-object type whose designated type is DT,
-- and whose Ekind is appropriate to the attribute type. The
-- type that is constructed is returned as the result.
procedure Build_Access_Subprogram_Type (P : Node_Id);
-- Build an access to subprogram whose designated type is the type of
-- the prefix. If prefix is overloaded, so is the node itself. The
-- result is stored in Acc_Type.
function OK_Self_Reference return Boolean;
-- An access reference whose prefix is a type can legally appear
-- within an aggregate, where it is obtained by expansion of
-- a defaulted aggregate. The enclosing aggregate that contains
-- the self-referenced is flagged so that the self-reference can
-- be expanded into a reference to the target object (see exp_aggr).
------------------------------
-- Build_Access_Object_Type --
------------------------------
function Build_Access_Object_Type (DT : Entity_Id) return Entity_Id is
Typ : constant Entity_Id :=
New_Internal_Entity
(E_Access_Attribute_Type, Current_Scope, Loc, 'A');
begin
Set_Etype (Typ, Typ);
Set_Is_Itype (Typ);
Set_Associated_Node_For_Itype (Typ, N);
Set_Directly_Designated_Type (Typ, DT);
return Typ;
end Build_Access_Object_Type;
----------------------------------
-- Build_Access_Subprogram_Type --
----------------------------------
procedure Build_Access_Subprogram_Type (P : Node_Id) is
Index : Interp_Index;
It : Interp;
procedure Check_Local_Access (E : Entity_Id);
-- Deal with possible access to local subprogram. If we have such
-- an access, we set a flag to kill all tracked values on any call
-- because this access value may be passed around, and any called
-- code might use it to access a local procedure which clobbers a
-- tracked value. If the scope is a loop or block, indicate that
-- value tracking is disabled for the enclosing subprogram.
function Get_Kind (E : Entity_Id) return Entity_Kind;
-- Distinguish between access to regular/protected subprograms
------------------------
-- Check_Local_Access --
------------------------
procedure Check_Local_Access (E : Entity_Id) is
begin
if not Is_Library_Level_Entity (E) then
Set_Suppress_Value_Tracking_On_Call (Current_Scope);
Set_Suppress_Value_Tracking_On_Call
(Nearest_Dynamic_Scope (Current_Scope));
end if;
end Check_Local_Access;
--------------
-- Get_Kind --
--------------
function Get_Kind (E : Entity_Id) return Entity_Kind is
begin
if Convention (E) = Convention_Protected then
return E_Access_Protected_Subprogram_Type;
else
return E_Access_Subprogram_Type;
end if;
end Get_Kind;
-- Start of processing for Build_Access_Subprogram_Type
begin
-- In the case of an access to subprogram, use the name of the
-- subprogram itself as the designated type. Type-checking in
-- this case compares the signatures of the designated types.
-- Note: This fragment of the tree is temporarily malformed
-- because the correct tree requires an E_Subprogram_Type entity
-- as the designated type. In most cases this designated type is
-- later overridden by the semantics with the type imposed by the
-- context during the resolution phase. In the specific case of
-- the expression Address!(Prim'Unrestricted_Access), used to
-- initialize slots of dispatch tables, this work will be done by
-- the expander (see Exp_Aggr).
-- The reason to temporarily add this kind of node to the tree
-- instead of a proper E_Subprogram_Type itype, is the following:
-- in case of errors found in the source file we report better
-- error messages. For example, instead of generating the
-- following error:
-- "expected access to subprogram with profile
-- defined at line X"
-- we currently generate:
-- "expected access to function Z defined at line X"
Set_Etype (N, Any_Type);
if not Is_Overloaded (P) then
Check_Local_Access (Entity (P));
if not Is_Intrinsic_Subprogram (Entity (P)) then
Acc_Type := Create_Itype (Get_Kind (Entity (P)), N);
Set_Is_Public (Acc_Type, False);
Set_Etype (Acc_Type, Acc_Type);
Set_Convention (Acc_Type, Convention (Entity (P)));
Set_Directly_Designated_Type (Acc_Type, Entity (P));
Set_Etype (N, Acc_Type);
Freeze_Before (N, Acc_Type);
end if;
else
Get_First_Interp (P, Index, It);
while Present (It.Nam) loop
Check_Local_Access (It.Nam);
if not Is_Intrinsic_Subprogram (It.Nam) then
Acc_Type := Create_Itype (Get_Kind (It.Nam), N);
Set_Is_Public (Acc_Type, False);
Set_Etype (Acc_Type, Acc_Type);
Set_Convention (Acc_Type, Convention (It.Nam));
Set_Directly_Designated_Type (Acc_Type, It.Nam);
Add_One_Interp (N, Acc_Type, Acc_Type);
Freeze_Before (N, Acc_Type);
end if;
Get_Next_Interp (Index, It);
end loop;
end if;
-- Cannot be applied to intrinsic. Looking at the tests above,
-- the only way Etype (N) can still be set to Any_Type is if
-- Is_Intrinsic_Subprogram was True for some referenced entity.
if Etype (N) = Any_Type then
Error_Attr_P ("prefix of % attribute cannot be intrinsic");
end if;
end Build_Access_Subprogram_Type;
----------------------
-- OK_Self_Reference --
----------------------
function OK_Self_Reference return Boolean is
Par : Node_Id;
begin
Par := Parent (N);
while Present (Par)
and then
(Nkind (Par) = N_Component_Association
or else Nkind (Par) in N_Subexpr)
loop
if Nkind_In (Par, N_Aggregate, N_Extension_Aggregate) then
if Etype (Par) = Typ then
Set_Has_Self_Reference (Par);
-- Check the context: the aggregate must be part of the
-- initialization of a type or component, or it is the
-- resulting expansion in an initialization procedure.
if Is_Init_Proc (Current_Scope) then
return True;
else
Par := Parent (Par);
while Present (Par) loop
if Nkind (Par) = N_Full_Type_Declaration then
return True;
end if;
Par := Parent (Par);
end loop;
end if;
return False;
end if;
end if;
Par := Parent (Par);
end loop;
-- No enclosing aggregate, or not a self-reference
return False;
end OK_Self_Reference;
-- Start of processing for Analyze_Access_Attribute
begin
Check_SPARK_05_Restriction_On_Attribute;
Check_E0;
if Nkind (P) = N_Character_Literal then
Error_Attr_P
("prefix of % attribute cannot be enumeration literal");
end if;
-- Case of access to subprogram
if Is_Entity_Name (P) and then Is_Overloadable (Entity (P)) then
if Has_Pragma_Inline_Always (Entity (P)) then
Error_Attr_P
("prefix of % attribute cannot be Inline_Always subprogram");
elsif Aname = Name_Unchecked_Access then
Error_Attr ("attribute% cannot be applied to a subprogram", P);
end if;
-- Issue an error if the prefix denotes an eliminated subprogram
Check_For_Eliminated_Subprogram (P, Entity (P));
-- Check for obsolescent subprogram reference
Check_Obsolescent_2005_Entity (Entity (P), P);
-- Build the appropriate subprogram type
Build_Access_Subprogram_Type (P);
-- For P'Access or P'Unrestricted_Access, where P is a nested
-- subprogram, we might be passing P to another subprogram (but we
-- don't check that here), which might call P. P could modify
-- local variables, so we need to kill current values. It is
-- important not to do this for library-level subprograms, because
-- Kill_Current_Values is very inefficient in the case of library
-- level packages with lots of tagged types.
if Is_Library_Level_Entity (Entity (Prefix (N))) then
null;
-- Do not kill values on nodes initializing dispatch tables
-- slots. The construct Prim_Ptr!(Prim'Unrestricted_Access)
-- is currently generated by the expander only for this
-- purpose. Done to keep the quality of warnings currently
-- generated by the compiler (otherwise any declaration of
-- a tagged type cleans constant indications from its scope).
elsif Nkind (Parent (N)) = N_Unchecked_Type_Conversion
and then (Etype (Parent (N)) = RTE (RE_Prim_Ptr)
or else
Etype (Parent (N)) = RTE (RE_Size_Ptr))
and then Is_Dispatching_Operation
(Directly_Designated_Type (Etype (N)))
then
null;
else
Kill_Current_Values;
end if;
-- In the static elaboration model, treat the attribute reference
-- as a call for elaboration purposes. Suppress this treatment
-- under debug flag. In any case, we are all done.
if not Dynamic_Elaboration_Checks and not Debug_Flag_Dot_UU then
Check_Elab_Call (N);
end if;
return;
-- Component is an operation of a protected type
elsif Nkind (P) = N_Selected_Component
and then Is_Overloadable (Entity (Selector_Name (P)))
then
if Ekind (Entity (Selector_Name (P))) = E_Entry then
Error_Attr_P ("prefix of % attribute must be subprogram");
end if;
Build_Access_Subprogram_Type (Selector_Name (P));
return;
end if;
-- Deal with incorrect reference to a type, but note that some
-- accesses are allowed: references to the current type instance,
-- or in Ada 2005 self-referential pointer in a default-initialized
-- aggregate.
if Is_Entity_Name (P) then
Typ := Entity (P);
-- The reference may appear in an aggregate that has been expanded
-- into a loop. Locate scope of type definition, if any.
Scop := Current_Scope;
while Ekind (Scop) = E_Loop loop
Scop := Scope (Scop);
end loop;
if Is_Type (Typ) then
-- OK if we are within the scope of a limited type
-- let's mark the component as having per object constraint
if Is_Anonymous_Tagged_Base (Scop, Typ) then
Typ := Scop;
Set_Entity (P, Typ);
Set_Etype (P, Typ);
end if;
if Typ = Scop then
declare
Q : Node_Id := Parent (N);
begin
while Present (Q)
and then Nkind (Q) /= N_Component_Declaration
loop
Q := Parent (Q);
end loop;
if Present (Q) then
Set_Has_Per_Object_Constraint
(Defining_Identifier (Q), True);
end if;
end;
if Nkind (P) = N_Expanded_Name then
Error_Msg_F
("current instance prefix must be a direct name", P);
end if;
-- If a current instance attribute appears in a component
-- constraint it must appear alone; other contexts (spec-
-- expressions, within a task body) are not subject to this
-- restriction.
if not In_Spec_Expression
and then not Has_Completion (Scop)
and then not
Nkind_In (Parent (N), N_Discriminant_Association,
N_Index_Or_Discriminant_Constraint)
then
Error_Msg_N
("current instance attribute must appear alone", N);
end if;
if Is_CPP_Class (Root_Type (Typ)) then
Error_Msg_N
("??current instance unsupported for derivations of "
& "'C'P'P types", N);
end if;
-- OK if we are in initialization procedure for the type
-- in question, in which case the reference to the type
-- is rewritten as a reference to the current object.
elsif Ekind (Scop) = E_Procedure
and then Is_Init_Proc (Scop)
and then Etype (First_Formal (Scop)) = Typ
then
Rewrite (N,
Make_Attribute_Reference (Loc,
Prefix => Make_Identifier (Loc, Name_uInit),
Attribute_Name => Name_Unrestricted_Access));
Analyze (N);
return;
-- OK if a task type, this test needs sharpening up ???
elsif Is_Task_Type (Typ) then
null;
-- OK if self-reference in an aggregate in Ada 2005, and
-- the reference comes from a copied default expression.
-- Note that we check legality of self-reference even if the
-- expression comes from source, e.g. when a single component
-- association in an aggregate has a box association.
elsif Ada_Version >= Ada_2005
and then OK_Self_Reference
then
null;
-- OK if reference to current instance of a protected object
elsif Is_Protected_Self_Reference (P) then
null;
-- Otherwise we have an error case
else
Error_Attr ("% attribute cannot be applied to type", P);
return;
end if;
end if;
end if;
-- If we fall through, we have a normal access to object case
-- Unrestricted_Access is (for now) legal wherever an allocator would
-- be legal, so its Etype is set to E_Allocator. The expected type
-- of the other attributes is a general access type, and therefore
-- we label them with E_Access_Attribute_Type.
if not Is_Overloaded (P) then
Acc_Type := Build_Access_Object_Type (P_Type);
Set_Etype (N, Acc_Type);
else
declare
Index : Interp_Index;
It : Interp;
begin
Set_Etype (N, Any_Type);
Get_First_Interp (P, Index, It);
while Present (It.Typ) loop
Acc_Type := Build_Access_Object_Type (It.Typ);
Add_One_Interp (N, Acc_Type, Acc_Type);
Get_Next_Interp (Index, It);
end loop;
end;
end if;
-- Special cases when we can find a prefix that is an entity name
declare
PP : Node_Id;
Ent : Entity_Id;
begin
PP := P;
loop
if Is_Entity_Name (PP) then
Ent := Entity (PP);
-- If we have an access to an object, and the attribute
-- comes from source, then set the object as potentially
-- source modified. We do this because the resulting access
-- pointer can be used to modify the variable, and we might
-- not detect this, leading to some junk warnings.
-- We only do this for source references, since otherwise
-- we can suppress warnings, e.g. from the unrestricted
-- access generated for validity checks in -gnatVa mode.
if Comes_From_Source (N) then
Set_Never_Set_In_Source (Ent, False);
end if;
-- Mark entity as address taken in the case of
-- 'Unrestricted_Access or subprograms, and kill current
-- values.
if Aname = Name_Unrestricted_Access
or else Is_Subprogram (Ent)
then
Set_Address_Taken (Ent);
end if;
Kill_Current_Values (Ent);
exit;
elsif Nkind_In (PP, N_Selected_Component,
N_Indexed_Component)
then
PP := Prefix (PP);
else
exit;
end if;
end loop;
end;
-- Check for aliased view. We allow a nonaliased prefix when within
-- an instance because the prefix may have been a tagged formal
-- object, which is defined to be aliased even when the actual
-- might not be (other instance cases will have been caught in the
-- generic). Similarly, within an inlined body we know that the
-- attribute is legal in the original subprogram, and therefore
-- legal in the expansion.
if not Is_Aliased_View (P)
and then not In_Instance
and then not In_Inlined_Body
and then Comes_From_Source (N)
then
-- Here we have a non-aliased view. This is illegal unless we
-- have the case of Unrestricted_Access, where for now we allow
-- this (we will reject later if expected type is access to an
-- unconstrained array with a thin pointer).
-- No need for an error message on a generated access reference
-- for the controlling argument in a dispatching call: error will
-- be reported when resolving the call.
if Aname /= Name_Unrestricted_Access then
Error_Attr_P ("prefix of % attribute must be aliased");
Check_No_Implicit_Aliasing (P);
-- For Unrestricted_Access, record that prefix is not aliased
-- to simplify legality check later on.
else
Set_Non_Aliased_Prefix (N);
end if;
-- If we have an aliased view, and we have Unrestricted_Access, then
-- output a warning that Unchecked_Access would have been fine, and
-- change the node to be Unchecked_Access.
else
-- For now, hold off on this change ???
null;
end if;
end Analyze_Access_Attribute;
----------------------------------
-- Analyze_Attribute_Old_Result --
----------------------------------
procedure Analyze_Attribute_Old_Result
(Legal : out Boolean;
Spec_Id : out Entity_Id)
is
procedure Check_Placement_In_Check (Prag : Node_Id);
-- Verify that the attribute appears within pragma Check that mimics
-- a postcondition.
procedure Check_Placement_In_Contract_Cases (Prag : Node_Id);
-- Verify that the attribute appears within a consequence of aspect
-- or pragma Contract_Cases denoted by Prag.
procedure Check_Placement_In_Test_Case (Prag : Node_Id);
-- Verify that the attribute appears within the "Ensures" argument of
-- aspect or pragma Test_Case denoted by Prag.
function Is_Within
(Nod : Node_Id;
Encl_Nod : Node_Id) return Boolean;
-- Subsidiary to Check_Placemenet_In_XXX. Determine whether arbitrary
-- node Nod is within enclosing node Encl_Nod.
procedure Placement_Error;
-- Emit a general error when the attributes does not appear in a
-- postcondition-like aspect or pragma.
------------------------------
-- Check_Placement_In_Check --
------------------------------
procedure Check_Placement_In_Check (Prag : Node_Id) is
Args : constant List_Id := Pragma_Argument_Associations (Prag);
Nam : constant Name_Id := Chars (Get_Pragma_Arg (First (Args)));
begin
-- The "Name" argument of pragma Check denotes a postcondition
if Nam_In (Nam, Name_Post,
Name_Post_Class,
Name_Postcondition,
Name_Refined_Post)
then
null;
-- Otherwise the placement of the attribute is illegal
else
Placement_Error;
end if;
end Check_Placement_In_Check;
---------------------------------------
-- Check_Placement_In_Contract_Cases --
---------------------------------------
procedure Check_Placement_In_Contract_Cases (Prag : Node_Id) is
Arg : Node_Id;
Cases : Node_Id;
CCase : Node_Id;
begin
-- Obtain the argument of the aspect or pragma
if Nkind (Prag) = N_Aspect_Specification then
Arg := Prag;
else
Arg := First (Pragma_Argument_Associations (Prag));
end if;
Cases := Expression (Arg);
if Present (Component_Associations (Cases)) then
CCase := First (Component_Associations (Cases));
while Present (CCase) loop
-- Detect whether the attribute appears within the
-- consequence of the current contract case.
if Nkind (CCase) = N_Component_Association
and then Is_Within (N, Expression (CCase))
then
return;
end if;
Next (CCase);
end loop;
end if;
-- Otherwise aspect or pragma Contract_Cases is either malformed
-- or the attribute does not appear within a consequence.
Error_Attr
("attribute % must appear in the consequence of a contract case",
P);
end Check_Placement_In_Contract_Cases;
----------------------------------
-- Check_Placement_In_Test_Case --
----------------------------------
procedure Check_Placement_In_Test_Case (Prag : Node_Id) is
Arg : constant Node_Id :=
Test_Case_Arg
(Prag => Prag,
Arg_Nam => Name_Ensures,
From_Aspect => Nkind (Prag) = N_Aspect_Specification);
begin
-- Detect whether the attribute appears within the "Ensures"
-- expression of aspect or pragma Test_Case.
if Present (Arg) and then Is_Within (N, Arg) then
null;
else
Error_Attr
("attribute % must appear in the ensures expression of a "
& "test case", P);
end if;
end Check_Placement_In_Test_Case;
---------------
-- Is_Within --
---------------
function Is_Within
(Nod : Node_Id;
Encl_Nod : Node_Id) return Boolean
is
Par : Node_Id;
begin
Par := Nod;
while Present (Par) loop
if Par = Encl_Nod then
return True;
-- Prevent the search from going too far
elsif Is_Body_Or_Package_Declaration (Par) then
exit;
end if;
Par := Parent (Par);
end loop;
return False;
end Is_Within;
---------------------
-- Placement_Error --
---------------------
procedure Placement_Error is
begin
if Aname = Name_Old then
Error_Attr ("attribute % can only appear in postcondition", P);
-- Specialize the error message for attribute 'Result
else
Error_Attr
("attribute % can only appear in postcondition of function",
P);
end if;
end Placement_Error;
-- Local variables
Prag : Node_Id;
Prag_Nam : Name_Id;
Subp_Decl : Node_Id;
-- Start of processing for Analyze_Attribute_Old_Result
begin
-- Assume that the attribute is illegal
Legal := False;
Spec_Id := Empty;
-- Traverse the parent chain to find the aspect or pragma where the
-- attribute resides.
Prag := N;
while Present (Prag) loop
if Nkind_In (Prag, N_Aspect_Specification, N_Pragma) then
exit;
-- Prevent the search from going too far
elsif Is_Body_Or_Package_Declaration (Prag) then
exit;
end if;
Prag := Parent (Prag);
end loop;
-- The attribute is allowed to appear only in postcondition-like
-- aspects or pragmas.
if Nkind_In (Prag, N_Aspect_Specification, N_Pragma) then
if Nkind (Prag) = N_Aspect_Specification then
Prag_Nam := Chars (Identifier (Prag));
else
Prag_Nam := Pragma_Name (Prag);
end if;
if Prag_Nam = Name_Check then
Check_Placement_In_Check (Prag);
elsif Prag_Nam = Name_Contract_Cases then
Check_Placement_In_Contract_Cases (Prag);
-- Attribute 'Result is allowed to appear in aspect or pragma
-- [Refined_]Depends (SPARK RM 6.1.5(11)).
elsif Nam_In (Prag_Nam, Name_Depends, Name_Refined_Depends)
and then Aname = Name_Result
then
null;
elsif Nam_In (Prag_Nam, Name_Post,
Name_Post_Class,
Name_Postcondition,
Name_Refined_Post)
then
null;
elsif Prag_Nam = Name_Test_Case then
Check_Placement_In_Test_Case (Prag);
else
Placement_Error;
return;
end if;
-- Otherwise the placement of the attribute is illegal
else
Placement_Error;
return;
end if;
-- Find the related subprogram subject to the aspect or pragma
if Nkind (Prag) = N_Aspect_Specification then
Subp_Decl := Parent (Prag);
else
Subp_Decl := Find_Related_Declaration_Or_Body (Prag);
end if;
-- The aspect or pragma where the attribute resides should be
-- associated with a subprogram declaration or a body. If this is not
-- the case, then the aspect or pragma is illegal. Return as analysis
-- cannot be carried out. Note that it is legal to have the aspect
-- appear on a subprogram renaming, when the renamed entity is an
-- attribute reference.
-- Generating C code the internally built nested _postcondition
-- subprograms are inlined; after expanded, inlined aspects are
-- located in the internal block generated by the frontend.
if Nkind (Subp_Decl) = N_Block_Statement
and then Modify_Tree_For_C
and then In_Inlined_Body
then
null;
elsif not Nkind_In (Subp_Decl, N_Abstract_Subprogram_Declaration,
N_Entry_Declaration,
N_Generic_Subprogram_Declaration,
N_Subprogram_Body,
N_Subprogram_Body_Stub,
N_Subprogram_Declaration,
N_Subprogram_Renaming_Declaration)
then
return;
end if;
-- If we get here, then the attribute is legal
Legal := True;
Spec_Id := Unique_Defining_Entity (Subp_Decl);
-- When generating C code, nested _postcondition subprograms are
-- inlined by the front end to avoid problems (when unnested) with
-- referenced itypes. Handle that here, since as part of inlining the
-- expander nests subprogram within a dummy procedure named _parent
-- (see Build_Postconditions_Procedure and Build_Body_To_Inline).
-- Hence, in this context, the spec_id of _postconditions is the
-- enclosing scope.
if Modify_Tree_For_C
and then Chars (Spec_Id) = Name_uParent
and then Chars (Scope (Spec_Id)) = Name_uPostconditions
then
-- This situation occurs only when preanalyzing the inlined body
pragma Assert (not Full_Analysis);
Spec_Id := Scope (Spec_Id);
pragma Assert (Is_Inlined (Spec_Id));
end if;
end Analyze_Attribute_Old_Result;
---------------------------------
-- Bad_Attribute_For_Predicate --
---------------------------------
procedure Bad_Attribute_For_Predicate is
begin
if Is_Scalar_Type (P_Type)
and then Comes_From_Source (N)
then
Error_Msg_Name_1 := Aname;
Bad_Predicated_Subtype_Use
("type& has predicates, attribute % not allowed", N, P_Type);
end if;
end Bad_Attribute_For_Predicate;
--------------------------------
-- Check_Array_Or_Scalar_Type --
--------------------------------
procedure Check_Array_Or_Scalar_Type is
function In_Aspect_Specification return Boolean;
-- A current instance of a type in an aspect specification is an
-- object and not a type, and therefore cannot be of a scalar type
-- in the prefix of one of the array attributes if the attribute
-- reference is part of an aspect expression.
-----------------------------
-- In_Aspect_Specification --
-----------------------------
function In_Aspect_Specification return Boolean is
P : Node_Id;
begin
P := Parent (N);
while Present (P) loop
if Nkind (P) = N_Aspect_Specification then
return P_Type = Entity (P);
elsif Nkind (P) in N_Declaration then
return False;
end if;
P := Parent (P);
end loop;
return False;
end In_Aspect_Specification;
-- Local variables
Dims : Int;
Index : Entity_Id;
-- Start of processing for Check_Array_Or_Scalar_Type
begin
-- Case of string literal or string literal subtype. These cases
-- cannot arise from legal Ada code, but the expander is allowed
-- to generate them. They require special handling because string
-- literal subtypes do not have standard bounds (the whole idea
-- of these subtypes is to avoid having to generate the bounds)
if Ekind (P_Type) = E_String_Literal_Subtype then
Set_Etype (N, Etype (First_Index (P_Base_Type)));
return;
-- Scalar types
elsif Is_Scalar_Type (P_Type) then
Check_Type;
if Present (E1) then
Error_Attr ("invalid argument in % attribute", E1);
elsif In_Aspect_Specification then
Error_Attr
("prefix of % attribute cannot be the current instance of a "
& "scalar type", P);
else
Set_Etype (N, P_Base_Type);
return;
end if;
-- The following is a special test to allow 'First to apply to
-- private scalar types if the attribute comes from generated
-- code. This occurs in the case of Normalize_Scalars code.
elsif Is_Private_Type (P_Type)
and then Present (Full_View (P_Type))
and then Is_Scalar_Type (Full_View (P_Type))
and then not Comes_From_Source (N)
then
Set_Etype (N, Implementation_Base_Type (P_Type));
-- Array types other than string literal subtypes handled above
else
Check_Array_Type;
-- We know prefix is an array type, or the name of an array
-- object, and that the expression, if present, is static
-- and within the range of the dimensions of the type.
pragma Assert (Is_Array_Type (P_Type));
Index := First_Index (P_Base_Type);
if No (E1) then
-- First dimension assumed
Set_Etype (N, Base_Type (Etype (Index)));
else
Dims := UI_To_Int (Intval (E1));
for J in 1 .. Dims - 1 loop
Next_Index (Index);
end loop;
Set_Etype (N, Base_Type (Etype (Index)));
Set_Etype (E1, Standard_Integer);
end if;
end if;
end Check_Array_Or_Scalar_Type;
----------------------
-- Check_Array_Type --
----------------------
procedure Check_Array_Type is
D : Int;
-- Dimension number for array attributes
begin
-- If the type is a string literal type, then this must be generated
-- internally, and no further check is required on its legality.
if Ekind (P_Type) = E_String_Literal_Subtype then
return;
-- If the type is a composite, it is an illegal aggregate, no point
-- in going on.
elsif P_Type = Any_Composite then
raise Bad_Attribute;
end if;
-- Normal case of array type or subtype
Check_Either_E0_Or_E1;
Check_Dereference;
if Is_Array_Type (P_Type) then
if not Is_Constrained (P_Type)
and then Is_Entity_Name (P)
and then Is_Type (Entity (P))
then
-- Note: we do not call Error_Attr here, since we prefer to
-- continue, using the relevant index type of the array,
-- even though it is unconstrained. This gives better error
-- recovery behavior.
Error_Msg_Name_1 := Aname;
Error_Msg_F
("prefix for % attribute must be constrained array", P);
end if;
-- The attribute reference freezes the type, and thus the
-- component type, even if the attribute may not depend on the
-- component. Diagnose arrays with incomplete components now.
-- If the prefix is an access to array, this does not freeze
-- the designated type.
if Nkind (P) /= N_Explicit_Dereference then
Check_Fully_Declared (Component_Type (P_Type), P);
end if;
D := Number_Dimensions (P_Type);
else
if Is_Private_Type (P_Type) then
Error_Attr_P ("prefix for % attribute may not be private type");
elsif Is_Access_Type (P_Type)
and then Is_Array_Type (Designated_Type (P_Type))
and then Is_Entity_Name (P)
and then Is_Type (Entity (P))
then
Error_Attr_P ("prefix of % attribute cannot be access type");
elsif Attr_Id = Attribute_First
or else
Attr_Id = Attribute_Last
then
Error_Attr ("invalid prefix for % attribute", P);
else
Error_Attr_P ("prefix for % attribute must be array");
end if;
end if;
if Present (E1) then
Resolve (E1, Any_Integer);
Set_Etype (E1, Standard_Integer);
if not Is_OK_Static_Expression (E1)
or else Raises_Constraint_Error (E1)
then
Flag_Non_Static_Expr
("expression for dimension must be static!", E1);
Error_Attr;
elsif UI_To_Int (Expr_Value (E1)) > D
or else UI_To_Int (Expr_Value (E1)) < 1
then
Error_Attr ("invalid dimension number for array type", E1);
end if;
end if;
if (Style_Check and Style_Check_Array_Attribute_Index)
and then Comes_From_Source (N)
then
Style.Check_Array_Attribute_Index (N, E1, D);
end if;
end Check_Array_Type;
-------------------------
-- Check_Asm_Attribute --
-------------------------
procedure Check_Asm_Attribute is
begin
Check_Type;
Check_E2;
-- Check first argument is static string expression
Analyze_And_Resolve (E1, Standard_String);
if Etype (E1) = Any_Type then
return;
elsif not Is_OK_Static_Expression (E1) then
Flag_Non_Static_Expr
("constraint argument must be static string expression!", E1);
Error_Attr;
end if;
-- Check second argument is right type
Analyze_And_Resolve (E2, Entity (P));
-- Note: that is all we need to do, we don't need to check
-- that it appears in a correct context. The Ada type system
-- will do that for us.
end Check_Asm_Attribute;
---------------------
-- Check_Component --
---------------------
procedure Check_Component is
begin
Check_E0;
if Nkind (P) /= N_Selected_Component
or else
(Ekind (Entity (Selector_Name (P))) /= E_Component
and then
Ekind (Entity (Selector_Name (P))) /= E_Discriminant)
then
Error_Attr_P ("prefix for % attribute must be selected component");
end if;
end Check_Component;
------------------------------------
-- Check_Decimal_Fixed_Point_Type --
------------------------------------
procedure Check_Decimal_Fixed_Point_Type is
begin
Check_Type;
if not Is_Decimal_Fixed_Point_Type (P_Type) then
Error_Attr_P ("prefix of % attribute must be decimal type");
end if;
end Check_Decimal_Fixed_Point_Type;
-----------------------
-- Check_Dereference --
-----------------------
procedure Check_Dereference is
begin
-- Case of a subtype mark
if Is_Entity_Name (P) and then Is_Type (Entity (P)) then
return;
end if;
-- Case of an expression
Resolve (P);
if Is_Access_Type (P_Type) then
-- If there is an implicit dereference, then we must freeze the
-- designated type of the access type, since the type of the
-- referenced array is this type (see AI95-00106).
-- As done elsewhere, freezing must not happen when pre-analyzing
-- a pre- or postcondition or a default value for an object or for
-- a formal parameter.
if not In_Spec_Expression then
Freeze_Before (N, Designated_Type (P_Type));
end if;
Rewrite (P,
Make_Explicit_Dereference (Sloc (P),
Prefix => Relocate_Node (P)));
Analyze_And_Resolve (P);
P_Type := Etype (P);
if P_Type = Any_Type then
raise Bad_Attribute;
end if;
P_Base_Type := Base_Type (P_Type);
end if;
end Check_Dereference;
-------------------------
-- Check_Discrete_Type --
-------------------------
procedure Check_Discrete_Type is
begin
Check_Type;
if not Is_Discrete_Type (P_Type) then
Error_Attr_P ("prefix of % attribute must be discrete type");
end if;
end Check_Discrete_Type;
--------------
-- Check_E0 --
--------------
procedure Check_E0 is
begin
if Present (E1) then
Unexpected_Argument (E1);
end if;
end Check_E0;
--------------
-- Check_E1 --
--------------
procedure Check_E1 is
begin
Check_Either_E0_Or_E1;
if No (E1) then
-- Special-case attributes that are functions and that appear as
-- the prefix of another attribute. Error is posted on parent.
if Nkind (Parent (N)) = N_Attribute_Reference
and then Nam_In (Attribute_Name (Parent (N)), Name_Address,
Name_Code_Address,
Name_Access)
then
Error_Msg_Name_1 := Attribute_Name (Parent (N));
Error_Msg_N ("illegal prefix for % attribute", Parent (N));
Set_Etype (Parent (N), Any_Type);
Set_Entity (Parent (N), Any_Type);
raise Bad_Attribute;
else
Error_Attr ("missing argument for % attribute", N);
end if;
end if;
end Check_E1;
--------------
-- Check_E2 --
--------------
procedure Check_E2 is
begin
if No (E1) then
Error_Attr ("missing arguments for % attribute (2 required)", N);
elsif No (E2) then
Error_Attr ("missing argument for % attribute (2 required)", N);
end if;
end Check_E2;
---------------------------
-- Check_Either_E0_Or_E1 --
---------------------------
procedure Check_Either_E0_Or_E1 is
begin
if Present (E2) then
Unexpected_Argument (E2);
end if;
end Check_Either_E0_Or_E1;
----------------------
-- Check_Enum_Image --
----------------------
procedure Check_Enum_Image is
Lit : Entity_Id;
begin
-- When an enumeration type appears in an attribute reference, all
-- literals of the type are marked as referenced. This must only be
-- done if the attribute reference appears in the current source.
-- Otherwise the information on references may differ between a
-- normal compilation and one that performs inlining.
if Is_Enumeration_Type (P_Base_Type)
and then In_Extended_Main_Code_Unit (N)
then
Lit := First_Literal (P_Base_Type);
while Present (Lit) loop
Set_Referenced (Lit);
Next_Literal (Lit);
end loop;
end if;
end Check_Enum_Image;
----------------------------
-- Check_First_Last_Valid --
----------------------------
procedure Check_First_Last_Valid is
begin
Check_Discrete_Type;
-- Freeze the subtype now, so that the following test for predicates
-- works (we set the predicates stuff up at freeze time)
Insert_Actions (N, Freeze_Entity (P_Type, P));
-- Now test for dynamic predicate
if Has_Predicates (P_Type)
and then not (Has_Static_Predicate (P_Type))
then
Error_Attr_P
("prefix of % attribute may not have dynamic predicate");
end if;
-- Check non-static subtype
if not Is_OK_Static_Subtype (P_Type) then
Error_Attr_P ("prefix of % attribute must be a static subtype");
end if;
-- Test case for no values
if Expr_Value (Type_Low_Bound (P_Type)) >
Expr_Value (Type_High_Bound (P_Type))
or else (Has_Predicates (P_Type)
and then
Is_Empty_List (Static_Discrete_Predicate (P_Type)))
then
Error_Attr_P
("prefix of % attribute must be subtype with at least one "
& "value");
end if;
end Check_First_Last_Valid;
----------------------------
-- Check_Fixed_Point_Type --
----------------------------
procedure Check_Fixed_Point_Type is
begin
Check_Type;
if not Is_Fixed_Point_Type (P_Type) then
Error_Attr_P ("prefix of % attribute must be fixed point type");
end if;
end Check_Fixed_Point_Type;
------------------------------
-- Check_Fixed_Point_Type_0 --
------------------------------
procedure Check_Fixed_Point_Type_0 is
begin
Check_Fixed_Point_Type;
Check_E0;
end Check_Fixed_Point_Type_0;
-------------------------------
-- Check_Floating_Point_Type --
-------------------------------
procedure Check_Floating_Point_Type is
begin
Check_Type;
if not Is_Floating_Point_Type (P_Type) then
Error_Attr_P ("prefix of % attribute must be float type");
end if;
end Check_Floating_Point_Type;
---------------------------------
-- Check_Floating_Point_Type_0 --
---------------------------------
procedure Check_Floating_Point_Type_0 is
begin
Check_Floating_Point_Type;
Check_E0;
end Check_Floating_Point_Type_0;
---------------------------------
-- Check_Floating_Point_Type_1 --
---------------------------------
procedure Check_Floating_Point_Type_1 is
begin
Check_Floating_Point_Type;
Check_E1;
end Check_Floating_Point_Type_1;
---------------------------------
-- Check_Floating_Point_Type_2 --
---------------------------------
procedure Check_Floating_Point_Type_2 is
begin
Check_Floating_Point_Type;
Check_E2;
end Check_Floating_Point_Type_2;
------------------------
-- Check_Integer_Type --
------------------------
procedure Check_Integer_Type is
begin
Check_Type;
if not Is_Integer_Type (P_Type) then
Error_Attr_P ("prefix of % attribute must be integer type");
end if;
end Check_Integer_Type;
--------------------------------
-- Check_Modular_Integer_Type --
--------------------------------
procedure Check_Modular_Integer_Type is
begin
Check_Type;
if not Is_Modular_Integer_Type (P_Type) then
Error_Attr_P
("prefix of % attribute must be modular integer type");
end if;
end Check_Modular_Integer_Type;
------------------------
-- Check_Not_CPP_Type --
------------------------
procedure Check_Not_CPP_Type is
begin
if Is_Tagged_Type (Etype (P))
and then Convention (Etype (P)) = Convention_CPP
and then Is_CPP_Class (Root_Type (Etype (P)))
then
Error_Attr_P
("invalid use of % attribute with 'C'P'P tagged type");
end if;
end Check_Not_CPP_Type;
-------------------------------
-- Check_Not_Incomplete_Type --
-------------------------------
procedure Check_Not_Incomplete_Type is
E : Entity_Id;
Typ : Entity_Id;
begin
-- Ada 2005 (AI-50217, AI-326): If the prefix is an explicit
-- dereference we have to check wrong uses of incomplete types
-- (other wrong uses are checked at their freezing point).
-- In Ada 2012, incomplete types can appear in subprogram
-- profiles, but formals with incomplete types cannot be the
-- prefix of attributes.
-- Example 1: Limited-with
-- limited with Pkg;
-- package P is
-- type Acc is access Pkg.T;
-- X : Acc;
-- S : Integer := X.all'Size; -- ERROR
-- end P;
-- Example 2: Tagged incomplete
-- type T is tagged;
-- type Acc is access all T;
-- X : Acc;
-- S : constant Integer := X.all'Size; -- ERROR
-- procedure Q (Obj : Integer := X.all'Alignment); -- ERROR
if Ada_Version >= Ada_2005
and then Nkind (P) = N_Explicit_Dereference
then
E := P;
while Nkind (E) = N_Explicit_Dereference loop
E := Prefix (E);
end loop;
Typ := Etype (E);
if From_Limited_With (Typ) then
Error_Attr_P
("prefix of % attribute cannot be an incomplete type");
-- If the prefix is an access type check the designated type
elsif Is_Access_Type (Typ)
and then Nkind (P) = N_Explicit_Dereference
then
Typ := Directly_Designated_Type (Typ);
end if;
if Is_Class_Wide_Type (Typ) then
Typ := Root_Type (Typ);
end if;
-- A legal use of a shadow entity occurs only when the unit where
-- the non-limited view resides is imported via a regular with
-- clause in the current body. Such references to shadow entities
-- may occur in subprogram formals.
if Is_Incomplete_Type (Typ)
and then From_Limited_With (Typ)
and then Present (Non_Limited_View (Typ))
and then Is_Legal_Shadow_Entity_In_Body (Typ)
then
Typ := Non_Limited_View (Typ);
end if;
-- If still incomplete, it can be a local incomplete type, or a
-- limited view whose scope is also a limited view.
if Ekind (Typ) = E_Incomplete_Type then
if not From_Limited_With (Typ)
and then No (Full_View (Typ))
then
Error_Attr_P
("prefix of % attribute cannot be an incomplete type");
-- The limited view may be available indirectly through
-- an intermediate unit. If the non-limited view is available
-- the attribute reference is legal.
elsif From_Limited_With (Typ)
and then
(No (Non_Limited_View (Typ))
or else Is_Incomplete_Type (Non_Limited_View (Typ)))
then
Error_Attr_P
("prefix of % attribute cannot be an incomplete type");
end if;
end if;
-- Ada 2012 : formals in bodies may be incomplete, but no attribute
-- legally applies.
elsif Is_Entity_Name (P)
and then Is_Formal (Entity (P))
and then Is_Incomplete_Type (Etype (Etype (P)))
then
Error_Attr_P
("prefix of % attribute cannot be an incomplete type");
end if;
if not Is_Entity_Name (P)
or else not Is_Type (Entity (P))
or else In_Spec_Expression
then
return;
else
Check_Fully_Declared (P_Type, P);
end if;
end Check_Not_Incomplete_Type;
----------------------------
-- Check_Object_Reference --
----------------------------
procedure Check_Object_Reference (P : Node_Id) is
Rtyp : Entity_Id;
begin
-- If we need an object, and we have a prefix that is the name of
-- a function entity, convert it into a function call.
if Is_Entity_Name (P)
and then Ekind (Entity (P)) = E_Function
then
Rtyp := Etype (Entity (P));
Rewrite (P,
Make_Function_Call (Sloc (P),
Name => Relocate_Node (P)));
Analyze_And_Resolve (P, Rtyp);
-- Otherwise we must have an object reference
elsif not Is_Object_Reference (P) then
Error_Attr_P ("prefix of % attribute must be object");
end if;
end Check_Object_Reference;
----------------------------
-- Check_PolyORB_Attribute --
----------------------------
procedure Check_PolyORB_Attribute is
begin
Validate_Non_Static_Attribute_Function_Call;
Check_Type;
Check_Not_CPP_Type;
if Get_PCS_Name /= Name_PolyORB_DSA then
Error_Attr
("attribute% requires the 'Poly'O'R'B 'P'C'S", N);
end if;
end Check_PolyORB_Attribute;
------------------------
-- Check_Program_Unit --
------------------------
procedure Check_Program_Unit is
begin
if Is_Entity_Name (P) then
declare
K : constant Entity_Kind := Ekind (Entity (P));
T : constant Entity_Id := Etype (Entity (P));
begin
if K in Subprogram_Kind
or else K in Task_Kind
or else K in Protected_Kind
or else K = E_Package
or else K in Generic_Unit_Kind
or else (K = E_Variable
and then
(Is_Task_Type (T)
or else
Is_Protected_Type (T)))
then
return;
end if;
end;
end if;
Error_Attr_P ("prefix of % attribute must be program unit");
end Check_Program_Unit;
---------------------
-- Check_Real_Type --
---------------------
procedure Check_Real_Type is
begin
Check_Type;
if not Is_Real_Type (P_Type) then
Error_Attr_P ("prefix of % attribute must be real type");
end if;
end Check_Real_Type;
-----------------------
-- Check_Scalar_Type --
-----------------------
procedure Check_Scalar_Type is
begin
Check_Type;
if not Is_Scalar_Type (P_Type) then
Error_Attr_P ("prefix of % attribute must be scalar type");
end if;
end Check_Scalar_Type;
------------------------------------------
-- Check_SPARK_05_Restriction_On_Attribute --
------------------------------------------
procedure Check_SPARK_05_Restriction_On_Attribute is
begin
Error_Msg_Name_1 := Aname;
Check_SPARK_05_Restriction ("attribute % is not allowed", P);
end Check_SPARK_05_Restriction_On_Attribute;
---------------------------
-- Check_Standard_Prefix --
---------------------------
procedure Check_Standard_Prefix is
begin
Check_E0;
if Nkind (P) /= N_Identifier or else Chars (P) /= Name_Standard then
Error_Attr ("only allowed prefix for % attribute is Standard", P);
end if;
end Check_Standard_Prefix;
----------------------------
-- Check_Stream_Attribute --
----------------------------
procedure Check_Stream_Attribute (Nam : TSS_Name_Type) is
Etyp : Entity_Id;
Btyp : Entity_Id;
In_Shared_Var_Procs : Boolean;
-- True when compiling System.Shared_Storage.Shared_Var_Procs body.
-- For this runtime package (always compiled in GNAT mode), we allow
-- stream attributes references for limited types for the case where
-- shared passive objects are implemented using stream attributes,
-- which is the default in GNAT's persistent storage implementation.
begin
Validate_Non_Static_Attribute_Function_Call;
-- With the exception of 'Input, Stream attributes are procedures,
-- and can only appear at the position of procedure calls. We check
-- for this here, before they are rewritten, to give a more precise
-- diagnostic.
if Nam = TSS_Stream_Input then
null;
elsif Is_List_Member (N)
and then not Nkind_In (Parent (N), N_Procedure_Call_Statement,
N_Aggregate)
then
null;
else
Error_Attr
("invalid context for attribute%, which is a procedure", N);
end if;
Check_Type;
Btyp := Implementation_Base_Type (P_Type);
-- Stream attributes not allowed on limited types unless the
-- attribute reference was generated by the expander (in which
-- case the underlying type will be used, as described in Sinfo),
-- or the attribute was specified explicitly for the type itself
-- or one of its ancestors (taking visibility rules into account if
-- in Ada 2005 mode), or a pragma Stream_Convert applies to Btyp
-- (with no visibility restriction).
declare
Gen_Body : constant Node_Id := Enclosing_Generic_Body (N);
begin
if Present (Gen_Body) then
In_Shared_Var_Procs :=
Is_RTE (Corresponding_Spec (Gen_Body), RE_Shared_Var_Procs);
else
In_Shared_Var_Procs := False;
end if;
end;
if (Comes_From_Source (N)
and then not (In_Shared_Var_Procs or In_Instance))
and then not Stream_Attribute_Available (P_Type, Nam)
and then not Has_Rep_Pragma (Btyp, Name_Stream_Convert)
then
Error_Msg_Name_1 := Aname;
if Is_Limited_Type (P_Type) then
Error_Msg_NE
("limited type& has no% attribute", P, P_Type);
Explain_Limited_Type (P_Type, P);
else
Error_Msg_NE
("attribute% for type& is not available", P, P_Type);
end if;
end if;
-- Check for no stream operations allowed from No_Tagged_Streams
if Is_Tagged_Type (P_Type)
and then Present (No_Tagged_Streams_Pragma (P_Type))
then
Error_Msg_Sloc := Sloc (No_Tagged_Streams_Pragma (P_Type));
Error_Msg_NE
("no stream operations for & (No_Tagged_Streams #)", N, P_Type);
return;
end if;
-- Check restriction violations
-- First check the No_Streams restriction, which prohibits the use
-- of explicit stream attributes in the source program. We do not
-- prevent the occurrence of stream attributes in generated code,
-- for instance those generated implicitly for dispatching purposes.
if Comes_From_Source (N) then
Check_Restriction (No_Streams, P);
end if;
-- AI05-0057: if restriction No_Default_Stream_Attributes is active,
-- it is illegal to use a predefined elementary type stream attribute
-- either by itself, or more importantly as part of the attribute
-- subprogram for a composite type. However, if the broader
-- restriction No_Streams is active, stream operations are not
-- generated, and there is no error.
if Restriction_Active (No_Default_Stream_Attributes)
and then not Restriction_Active (No_Streams)
then
declare
T : Entity_Id;
begin
if Nam = TSS_Stream_Input
or else
Nam = TSS_Stream_Read
then
T :=
Type_Without_Stream_Operation (P_Type, TSS_Stream_Read);
else
T :=
Type_Without_Stream_Operation (P_Type, TSS_Stream_Write);
end if;
if Present (T) then
Check_Restriction (No_Default_Stream_Attributes, N);
Error_Msg_NE
("missing user-defined Stream Read or Write for type&",
N, T);
if not Is_Elementary_Type (P_Type) then
Error_Msg_NE
("\which is a component of type&", N, P_Type);
end if;
end if;
end;
end if;
-- Check special case of Exception_Id and Exception_Occurrence which
-- are not allowed for restriction No_Exception_Registration.
if Restriction_Check_Required (No_Exception_Registration)
and then (Is_RTE (P_Type, RE_Exception_Id)
or else
Is_RTE (P_Type, RE_Exception_Occurrence))
then
Check_Restriction (No_Exception_Registration, P);
end if;
-- Here we must check that the first argument is an access type
-- that is compatible with Ada.Streams.Root_Stream_Type'Class.
Analyze_And_Resolve (E1);
Etyp := Etype (E1);
-- Note: the double call to Root_Type here is needed because the
-- root type of a class-wide type is the corresponding type (e.g.
-- X for X'Class, and we really want to go to the root.)
if not Is_Access_Type (Etyp)
or else Root_Type (Root_Type (Designated_Type (Etyp))) /=
RTE (RE_Root_Stream_Type)
then
Error_Attr
("expected access to Ada.Streams.Root_Stream_Type''Class", E1);
end if;
-- Check that the second argument is of the right type if there is
-- one (the Input attribute has only one argument so this is skipped)
if Present (E2) then
Analyze (E2);
if Nam = TSS_Stream_Read
and then not Is_OK_Variable_For_Out_Formal (E2)
then
Error_Attr
("second argument of % attribute must be a variable", E2);
end if;
Resolve (E2, P_Type);
end if;
Check_Not_CPP_Type;
end Check_Stream_Attribute;
-------------------------
-- Check_System_Prefix --
-------------------------
procedure Check_System_Prefix is
begin
if Nkind (P) /= N_Identifier or else Chars (P) /= Name_System then
Error_Attr ("only allowed prefix for % attribute is System", P);
end if;
end Check_System_Prefix;
-----------------------
-- Check_Task_Prefix --
-----------------------
procedure Check_Task_Prefix is
begin
Analyze (P);
-- Ada 2005 (AI-345): Attribute 'Terminated can be applied to
-- task interface class-wide types.
if Is_Task_Type (Etype (P))
or else (Is_Access_Type (Etype (P))
and then Is_Task_Type (Designated_Type (Etype (P))))
or else (Ada_Version >= Ada_2005
and then Ekind (Etype (P)) = E_Class_Wide_Type
and then Is_Interface (Etype (P))
and then Is_Task_Interface (Etype (P)))
then
Resolve (P);
else
if Ada_Version >= Ada_2005 then
Error_Attr_P
("prefix of % attribute must be a task or a task " &
"interface class-wide object");
else
Error_Attr_P ("prefix of % attribute must be a task");
end if;
end if;
end Check_Task_Prefix;
----------------
-- Check_Type --
----------------
-- The possibilities are an entity name denoting a type, or an
-- attribute reference that denotes a type (Base or Class). If
-- the type is incomplete, replace it with its full view.
procedure Check_Type is
begin
if not Is_Entity_Name (P)
or else not Is_Type (Entity (P))
then
Error_Attr_P ("prefix of % attribute must be a type");
elsif Is_Protected_Self_Reference (P) then
Error_Attr_P
("prefix of % attribute denotes current instance "
& "(RM 9.4(21/2))");
elsif Ekind (Entity (P)) = E_Incomplete_Type
and then Present (Full_View (Entity (P)))
then
P_Type := Full_View (Entity (P));
Set_Entity (P, P_Type);
end if;
end Check_Type;
---------------------
-- Check_Unit_Name --
---------------------
procedure Check_Unit_Name (Nod : Node_Id) is
begin
if Nkind (Nod) = N_Identifier then
return;
elsif Nkind_In (Nod, N_Selected_Component, N_Expanded_Name) then
Check_Unit_Name (Prefix (Nod));
if Nkind (Selector_Name (Nod)) = N_Identifier then
return;
end if;
end if;
Error_Attr ("argument for % attribute must be unit name", P);
end Check_Unit_Name;
----------------
-- Error_Attr --
----------------
procedure Error_Attr is
begin
Set_Etype (N, Any_Type);
Set_Entity (N, Any_Type);
raise Bad_Attribute;
end Error_Attr;
procedure Error_Attr (Msg : String; Error_Node : Node_Id) is
begin
Error_Msg_Name_1 := Aname;
Error_Msg_N (Msg, Error_Node);
Error_Attr;
end Error_Attr;
------------------
-- Error_Attr_P --
------------------
procedure Error_Attr_P (Msg : String) is
begin
Error_Msg_Name_1 := Aname;
Error_Msg_F (Msg, P);
Error_Attr;
end Error_Attr_P;
----------------------------
-- Legal_Formal_Attribute --
----------------------------
procedure Legal_Formal_Attribute is
begin
Check_E0;
if not Is_Entity_Name (P)
or else not Is_Type (Entity (P))
then
Error_Attr_P ("prefix of % attribute must be generic type");
elsif Is_Generic_Actual_Type (Entity (P))
or else In_Instance
or else In_Inlined_Body
then
null;
elsif Is_Generic_Type (Entity (P)) then
if Is_Definite_Subtype (Entity (P)) then
Error_Attr_P
("prefix of % attribute must be indefinite generic type");
end if;
else
Error_Attr_P
("prefix of % attribute must be indefinite generic type");
end if;
Set_Etype (N, Standard_Boolean);
end Legal_Formal_Attribute;
---------------------------------------------------------------
-- Max_Alignment_For_Allocation_Max_Size_In_Storage_Elements --
---------------------------------------------------------------
procedure Max_Alignment_For_Allocation_Max_Size_In_Storage_Elements is
begin
Check_E0;
Check_Type;
Check_Not_Incomplete_Type;
Set_Etype (N, Universal_Integer);
end Max_Alignment_For_Allocation_Max_Size_In_Storage_Elements;
-------------
-- Min_Max --
-------------
procedure Min_Max is
begin
Check_E2;
Check_Scalar_Type;
Resolve (E1, P_Base_Type);
Resolve (E2, P_Base_Type);
Set_Etype (N, P_Base_Type);
-- Check for comparison on unordered enumeration type
if Bad_Unordered_Enumeration_Reference (N, P_Base_Type) then
Error_Msg_Sloc := Sloc (P_Base_Type);
Error_Msg_NE
("comparison on unordered enumeration type& declared#?U?",
N, P_Base_Type);
end if;
end Min_Max;
------------------------
-- Standard_Attribute --
------------------------
procedure Standard_Attribute (Val : Int) is
begin
Check_Standard_Prefix;
Rewrite (N, Make_Integer_Literal (Loc, Val));
Analyze (N);
Set_Is_Static_Expression (N, True);
end Standard_Attribute;
--------------------
-- Uneval_Old_Msg --
--------------------
procedure Uneval_Old_Msg is
Uneval_Old_Setting : Character;
Prag : Node_Id;
begin
-- If from aspect, then Uneval_Old_Setting comes from flags in the
-- N_Aspect_Specification node that corresponds to the attribute.
-- First find the pragma in which we appear (note that at this stage,
-- even if we appeared originally within an aspect specification, we
-- are now within the corresponding pragma).
Prag := N;
loop
Prag := Parent (Prag);
exit when No (Prag) or else Nkind (Prag) = N_Pragma;
end loop;
if Present (Prag) then
if Uneval_Old_Accept (Prag) then
Uneval_Old_Setting := 'A';
elsif Uneval_Old_Warn (Prag) then
Uneval_Old_Setting := 'W';
else
Uneval_Old_Setting := 'E';
end if;
-- If we did not find the pragma, that's odd, just use the setting
-- from Opt.Uneval_Old. Perhaps this is due to a previous error?
else
Uneval_Old_Setting := Opt.Uneval_Old;
end if;
-- Processing depends on the setting of Uneval_Old
case Uneval_Old_Setting is
when 'E' =>
Error_Attr_P
("prefix of attribute % that is potentially "
& "unevaluated must denote an entity");
when 'W' =>
Error_Msg_Name_1 := Aname;
Error_Msg_F
("??prefix of attribute % appears in potentially "
& "unevaluated context, exception may be raised", P);
when 'A' =>
null;
when others =>
raise Program_Error;
end case;
end Uneval_Old_Msg;
-------------------------
-- Unexpected Argument --
-------------------------
procedure Unexpected_Argument (En : Node_Id) is
begin
Error_Attr ("unexpected argument for % attribute", En);
end Unexpected_Argument;
-------------------------------------------------
-- Validate_Non_Static_Attribute_Function_Call --
-------------------------------------------------
-- This function should be moved to Sem_Dist ???
procedure Validate_Non_Static_Attribute_Function_Call is
begin
if In_Preelaborated_Unit
and then not In_Subprogram_Or_Concurrent_Unit
then
Flag_Non_Static_Expr
("non-static function call in preelaborated unit!", N);
end if;
end Validate_Non_Static_Attribute_Function_Call;
-- Start of processing for Analyze_Attribute
begin
-- Immediate return if unrecognized attribute (already diagnosed by
-- parser, so there is nothing more that we need to do).
if not Is_Attribute_Name (Aname) then
raise Bad_Attribute;
end if;
Check_Restriction_No_Use_Of_Attribute (N);
-- Deal with Ada 83 issues
if Comes_From_Source (N) then
if not Attribute_83 (Attr_Id) then
if Ada_Version = Ada_83 and then Comes_From_Source (N) then
Error_Msg_Name_1 := Aname;
Error_Msg_N ("(Ada 83) attribute% is not standard??", N);
end if;
if Attribute_Impl_Def (Attr_Id) then
Check_Restriction (No_Implementation_Attributes, N);
end if;
end if;
end if;
-- Deal with Ada 2005 attributes that are implementation attributes
-- because they appear in a version of Ada before Ada 2005, and
-- similarly for Ada 2012 attributes appearing in an earlier version.
if (Attribute_05 (Attr_Id) and then Ada_Version < Ada_2005)
or else
(Attribute_12 (Attr_Id) and then Ada_Version < Ada_2012)
then
Check_Restriction (No_Implementation_Attributes, N);
end if;
-- Remote access to subprogram type access attribute reference needs
-- unanalyzed copy for tree transformation. The analyzed copy is used
-- for its semantic information (whether prefix is a remote subprogram
-- name), the unanalyzed copy is used to construct new subtree rooted
-- with N_Aggregate which represents a fat pointer aggregate.
if Aname = Name_Access then
Discard_Node (Copy_Separate_Tree (N));
end if;
-- Analyze prefix and exit if error in analysis. If the prefix is an
-- incomplete type, use full view if available. Note that there are
-- some attributes for which we do not analyze the prefix, since the
-- prefix is not a normal name, or else needs special handling.
if Aname /= Name_Elab_Body and then
Aname /= Name_Elab_Spec and then
Aname /= Name_Elab_Subp_Body and then
Aname /= Name_Enabled and then
Aname /= Name_Old
then
Analyze (P);
P_Type := Etype (P);
if Is_Entity_Name (P)
and then Present (Entity (P))
and then Is_Type (Entity (P))
then
if Ekind (Entity (P)) = E_Incomplete_Type then
P_Type := Get_Full_View (P_Type);
Set_Entity (P, P_Type);
Set_Etype (P, P_Type);
elsif Entity (P) = Current_Scope
and then Is_Record_Type (Entity (P))
then
-- Use of current instance within the type. Verify that if the
-- attribute appears within a constraint, it yields an access
-- type, other uses are illegal.
declare
Par : Node_Id;
begin
Par := Parent (N);
while Present (Par)
and then Nkind (Parent (Par)) /= N_Component_Definition
loop
Par := Parent (Par);
end loop;
if Present (Par)
and then Nkind (Par) = N_Subtype_Indication
then
if Attr_Id /= Attribute_Access
and then Attr_Id /= Attribute_Unchecked_Access
and then Attr_Id /= Attribute_Unrestricted_Access
then
Error_Msg_N
("in a constraint the current instance can only "
& "be used with an access attribute", N);
end if;
end if;
end;
end if;
end if;
if P_Type = Any_Type then
raise Bad_Attribute;
end if;
P_Base_Type := Base_Type (P_Type);
end if;
-- Analyze expressions that may be present, exiting if an error occurs
if No (Exprs) then
E1 := Empty;
E2 := Empty;
else
E1 := First (Exprs);
-- Skip analysis for case of Restriction_Set, we do not expect
-- the argument to be analyzed in this case.
if Aname /= Name_Restriction_Set then
Analyze (E1);
-- Check for missing/bad expression (result of previous error)
if No (E1) or else Etype (E1) = Any_Type then
raise Bad_Attribute;
end if;
end if;
E2 := Next (E1);
if Present (E2) then
Analyze (E2);
if Etype (E2) = Any_Type then
raise Bad_Attribute;
end if;
if Present (Next (E2)) then
Unexpected_Argument (Next (E2));
end if;
end if;
end if;
-- Cases where prefix must be resolvable by itself
if Is_Overloaded (P)
and then Aname /= Name_Access
and then Aname /= Name_Address
and then Aname /= Name_Code_Address
and then Aname /= Name_Result
and then Aname /= Name_Unchecked_Access
then
-- The prefix must be resolvable by itself, without reference to the
-- attribute. One case that requires special handling is a prefix
-- that is a function name, where one interpretation may be a
-- parameterless call. Entry attributes are handled specially below.
if Is_Entity_Name (P)
and then not Nam_In (Aname, Name_Count, Name_Caller)
then
Check_Parameterless_Call (P);
end if;
if Is_Overloaded (P) then
-- Ada 2005 (AI-345): Since protected and task types have
-- primitive entry wrappers, the attributes Count, and Caller
-- require a context check
if Nam_In (Aname, Name_Count, Name_Caller) then
declare
Count : Natural := 0;
I : Interp_Index;
It : Interp;
begin
Get_First_Interp (P, I, It);
while Present (It.Nam) loop
if Comes_From_Source (It.Nam) then
Count := Count + 1;
else
Remove_Interp (I);
end if;
Get_Next_Interp (I, It);
end loop;
if Count > 1 then
Error_Attr ("ambiguous prefix for % attribute", P);
else
Set_Is_Overloaded (P, False);
end if;
end;
else
Error_Attr ("ambiguous prefix for % attribute", P);
end if;
end if;
end if;
-- In SPARK, attributes of private types are only allowed if the full
-- type declaration is visible.
-- Note: the check for Present (Entity (P)) defends against some error
-- conditions where the Entity field is not set.
if Is_Entity_Name (P) and then Present (Entity (P))
and then Is_Type (Entity (P))
and then Is_Private_Type (P_Type)
and then not In_Open_Scopes (Scope (P_Type))
and then not In_Spec_Expression
then
Check_SPARK_05_Restriction ("invisible attribute of type", N);
end if;
-- Remaining processing depends on attribute
case Attr_Id is
-- Attributes related to Ada 2012 iterators. Attribute specifications
-- exist for these, but they cannot be queried.
when Attribute_Constant_Indexing
| Attribute_Default_Iterator
| Attribute_Implicit_Dereference
| Attribute_Iterator_Element
| Attribute_Iterable
| Attribute_Variable_Indexing
=>
Error_Msg_N ("illegal attribute", N);
-- Internal attributes used to deal with Ada 2012 delayed aspects. These
-- were already rejected by the parser. Thus they shouldn't appear here.
when Internal_Attribute_Id =>
raise Program_Error;
------------------
-- Abort_Signal --
------------------
when Attribute_Abort_Signal =>
Check_Standard_Prefix;
Rewrite (N, New_Occurrence_Of (Stand.Abort_Signal, Loc));
Analyze (N);
------------
-- Access --
------------
when Attribute_Access =>
Analyze_Access_Attribute;
Check_Not_Incomplete_Type;
-------------
-- Address --
-------------
when Attribute_Address =>
Check_E0;
Address_Checks;
Check_Not_Incomplete_Type;
Set_Etype (N, RTE (RE_Address));
------------------
-- Address_Size --
------------------
when Attribute_Address_Size =>
Standard_Attribute (System_Address_Size);
--------------
-- Adjacent --
--------------
when Attribute_Adjacent =>
Check_Floating_Point_Type_2;
Set_Etype (N, P_Base_Type);
Resolve (E1, P_Base_Type);
Resolve (E2, P_Base_Type);
---------
-- Aft --
---------
when Attribute_Aft =>
Check_Fixed_Point_Type_0;
Set_Etype (N, Universal_Integer);
---------------
-- Alignment --
---------------
when Attribute_Alignment =>
-- Don't we need more checking here, cf Size ???
Check_E0;
Check_Not_Incomplete_Type;
Check_Not_CPP_Type;
Set_Etype (N, Universal_Integer);
---------------
-- Asm_Input --
---------------
when Attribute_Asm_Input =>
Check_Asm_Attribute;
-- The back end may need to take the address of E2
if Is_Entity_Name (E2) then
Set_Address_Taken (Entity (E2));
end if;
Set_Etype (N, RTE (RE_Asm_Input_Operand));
----------------
-- Asm_Output --
----------------
when Attribute_Asm_Output =>
Check_Asm_Attribute;
if Etype (E2) = Any_Type then
return;
elsif Aname = Name_Asm_Output then
if not Is_Variable (E2) then
Error_Attr
("second argument for Asm_Output is not variable", E2);
end if;
end if;
Note_Possible_Modification (E2, Sure => True);
-- The back end may need to take the address of E2
if Is_Entity_Name (E2) then
Set_Address_Taken (Entity (E2));
end if;
Set_Etype (N, RTE (RE_Asm_Output_Operand));
-----------------------------
-- Atomic_Always_Lock_Free --
-----------------------------
when Attribute_Atomic_Always_Lock_Free =>
Check_E0;
Check_Type;
Set_Etype (N, Standard_Boolean);
----------
-- Base --
----------
-- Note: when the base attribute appears in the context of a subtype
-- mark, the analysis is done by Sem_Ch8.Find_Type, rather than by
-- the following circuit.
when Attribute_Base => Base : declare
Typ : Entity_Id;
begin
Check_E0;
Find_Type (P);
Typ := Entity (P);
if Ada_Version >= Ada_95
and then not Is_Scalar_Type (Typ)
and then not Is_Generic_Type (Typ)
then
Error_Attr_P ("prefix of Base attribute must be scalar type");
elsif Sloc (Typ) = Standard_Location
and then Base_Type (Typ) = Typ
and then Warn_On_Redundant_Constructs
then
Error_Msg_NE -- CODEFIX
("?r?redundant attribute, & is its own base type", N, Typ);
end if;
if Nkind (Parent (N)) /= N_Attribute_Reference then
Error_Msg_Name_1 := Aname;
Check_SPARK_05_Restriction
("attribute% is only allowed as prefix of another attribute", P);
end if;
Set_Etype (N, Base_Type (Entity (P)));
Set_Entity (N, Base_Type (Entity (P)));
Rewrite (N, New_Occurrence_Of (Entity (N), Loc));
Analyze (N);
end Base;
---------
-- Bit --
---------
when Attribute_Bit =>
Check_E0;
if not Is_Object_Reference (P) then
Error_Attr_P ("prefix for % attribute must be object");
-- What about the access object cases ???
else
null;
end if;
Set_Etype (N, Universal_Integer);
---------------
-- Bit_Order --
---------------
when Attribute_Bit_Order =>
Check_E0;
Check_Type;
if not Is_Record_Type (P_Type) then
Error_Attr_P ("prefix of % attribute must be record type");
end if;
if Bytes_Big_Endian xor Reverse_Bit_Order (P_Type) then
Rewrite (N,
New_Occurrence_Of (RTE (RE_High_Order_First), Loc));
else
Rewrite (N,
New_Occurrence_Of (RTE (RE_Low_Order_First), Loc));
end if;
Set_Etype (N, RTE (RE_Bit_Order));
Resolve (N);
-- Reset incorrect indication of staticness
Set_Is_Static_Expression (N, False);
------------------
-- Bit_Position --
------------------
-- Note: in generated code, we can have a Bit_Position attribute
-- applied to a (naked) record component (i.e. the prefix is an
-- identifier that references an E_Component or E_Discriminant
-- entity directly, and this is interpreted as expected by Gigi.
-- The following code will not tolerate such usage, but when the
-- expander creates this special case, it marks it as analyzed
-- immediately and sets an appropriate type.
when Attribute_Bit_Position =>
if Comes_From_Source (N) then
Check_Component;
end if;
Set_Etype (N, Universal_Integer);
------------------
-- Body_Version --
------------------
when Attribute_Body_Version =>
Check_E0;
Check_Program_Unit;
Set_Etype (N, RTE (RE_Version_String));
--------------
-- Callable --
--------------
when Attribute_Callable =>
Check_E0;
Set_Etype (N, Standard_Boolean);
Check_Task_Prefix;
------------
-- Caller --
------------
when Attribute_Caller => Caller : declare
Ent : Entity_Id;
S : Entity_Id;
begin
Check_E0;
if Nkind_In (P, N_Identifier, N_Expanded_Name) then
Ent := Entity (P);
if not Is_Entry (Ent) then
Error_Attr ("invalid entry name", N);
end if;
else
Error_Attr ("invalid entry name", N);
return;
end if;
for J in reverse 0 .. Scope_Stack.Last loop
S := Scope_Stack.Table (J).Entity;
if S = Scope (Ent) then
Error_Attr ("Caller must appear in matching accept or body", N);
elsif S = Ent then
exit;
end if;
end loop;
Set_Etype (N, RTE (RO_AT_Task_Id));
end Caller;
-------------
-- Ceiling --
-------------
when Attribute_Ceiling =>
Check_Floating_Point_Type_1;
Set_Etype (N, P_Base_Type);
Resolve (E1, P_Base_Type);
-----------
-- Class --
-----------
when Attribute_Class =>
Check_Restriction (No_Dispatch, N);
Check_E0;
Find_Type (N);
-- Applying Class to untagged incomplete type is obsolescent in Ada
-- 2005. Note that we can't test Is_Tagged_Type here on P_Type, since
-- this flag gets set by Find_Type in this situation.
if Restriction_Check_Required (No_Obsolescent_Features)
and then Ada_Version >= Ada_2005
and then Ekind (P_Type) = E_Incomplete_Type
then
declare
DN : constant Node_Id := Declaration_Node (P_Type);
begin
if Nkind (DN) = N_Incomplete_Type_Declaration
and then not Tagged_Present (DN)
then
Check_Restriction (No_Obsolescent_Features, P);
end if;
end;
end if;
------------------
-- Code_Address --
------------------
when Attribute_Code_Address =>
Check_E0;
if Nkind (P) = N_Attribute_Reference
and then Nam_In (Attribute_Name (P), Name_Elab_Body, Name_Elab_Spec)
then
null;
elsif not Is_Entity_Name (P)
or else (Ekind (Entity (P)) /= E_Function
and then
Ekind (Entity (P)) /= E_Procedure)
then
Error_Attr ("invalid prefix for % attribute", P);
Set_Address_Taken (Entity (P));
-- Issue an error if the prefix denotes an eliminated subprogram
else
Check_For_Eliminated_Subprogram (P, Entity (P));
end if;
Set_Etype (N, RTE (RE_Address));
----------------------
-- Compiler_Version --
----------------------
when Attribute_Compiler_Version =>
Check_E0;
Check_Standard_Prefix;
Rewrite (N, Make_String_Literal (Loc, "GNAT " & Gnat_Version_String));
Analyze_And_Resolve (N, Standard_String);
Set_Is_Static_Expression (N, True);
--------------------
-- Component_Size --
--------------------
when Attribute_Component_Size =>
Check_E0;
Set_Etype (N, Universal_Integer);
-- Note: unlike other array attributes, unconstrained arrays are OK
if Is_Array_Type (P_Type) and then not Is_Constrained (P_Type) then
null;
else
Check_Array_Type;
end if;
-------------
-- Compose --
-------------
when Attribute_Compose =>
Check_Floating_Point_Type_2;
Set_Etype (N, P_Base_Type);
Resolve (E1, P_Base_Type);
Resolve (E2, Any_Integer);
-----------------
-- Constrained --
-----------------
when Attribute_Constrained =>
Check_E0;
Set_Etype (N, Standard_Boolean);
-- Case from RM J.4(2) of constrained applied to private type
if Is_Entity_Name (P) and then Is_Type (Entity (P)) then
Check_Restriction (No_Obsolescent_Features, P);
if Warn_On_Obsolescent_Feature then
Error_Msg_N
("constrained for private type is an obsolescent feature "
& "(RM J.4)?j?", N);
end if;
-- If we are within an instance, the attribute must be legal
-- because it was valid in the generic unit. Ditto if this is
-- an inlining of a function declared in an instance.
if In_Instance or else In_Inlined_Body then
return;
-- For sure OK if we have a real private type itself, but must
-- be completed, cannot apply Constrained to incomplete type.
elsif Is_Private_Type (Entity (P)) then
-- Note: this is one of the Annex J features that does not
-- generate a warning from -gnatwj, since in fact it seems
-- very useful, and is used in the GNAT runtime.
Check_Not_Incomplete_Type;
return;
end if;
-- Normal (non-obsolescent case) of application to object of
-- a discriminated type.
else
Check_Object_Reference (P);
-- If N does not come from source, then we allow the
-- the attribute prefix to be of a private type whose
-- full type has discriminants. This occurs in cases
-- involving expanded calls to stream attributes.
if not Comes_From_Source (N) then
P_Type := Underlying_Type (P_Type);
end if;
-- Must have discriminants or be an access type designating a type
-- with discriminants. If it is a class-wide type it has unknown
-- discriminants.
if Has_Discriminants (P_Type)
or else Has_Unknown_Discriminants (P_Type)
or else
(Is_Access_Type (P_Type)
and then Has_Discriminants (Designated_Type (P_Type)))
then
return;
-- The rule given in 3.7.2 is part of static semantics, but the
-- intent is clearly that it be treated as a legality rule, and
-- rechecked in the visible part of an instance. Nevertheless
-- the intent also seems to be it should legally apply to the
-- actual of a formal with unknown discriminants, regardless of
-- whether the actual has discriminants, in which case the value
-- of the attribute is determined using the J.4 rules. This choice
-- seems the most useful, and is compatible with existing tests.
elsif In_Instance then
return;
-- Also allow an object of a generic type if extensions allowed
-- and allow this for any type at all. (this may be obsolete ???)
elsif (Is_Generic_Type (P_Type)
or else Is_Generic_Actual_Type (P_Type))
and then Extensions_Allowed
then
return;
end if;
end if;
-- Fall through if bad prefix
Error_Attr_P
("prefix of % attribute must be object of discriminated type");
---------------
-- Copy_Sign --
---------------
when Attribute_Copy_Sign =>
Check_Floating_Point_Type_2;
Set_Etype (N, P_Base_Type);
Resolve (E1, P_Base_Type);
Resolve (E2, P_Base_Type);
-----------
-- Count --
-----------
when Attribute_Count => Count : declare
Ent : Entity_Id;
S : Entity_Id;
Tsk : Entity_Id;
begin
Check_E0;
if Nkind_In (P, N_Identifier, N_Expanded_Name) then
Ent := Entity (P);
if Ekind (Ent) /= E_Entry then
Error_Attr ("invalid entry name", N);
end if;
elsif Nkind (P) = N_Indexed_Component then
if not Is_Entity_Name (Prefix (P))
or else No (Entity (Prefix (P)))
or else Ekind (Entity (Prefix (P))) /= E_Entry_Family
then
if Nkind (Prefix (P)) = N_Selected_Component
and then Present (Entity (Selector_Name (Prefix (P))))
and then Ekind (Entity (Selector_Name (Prefix (P)))) =
E_Entry_Family
then
Error_Attr
("attribute % must apply to entry of current task", P);
else
Error_Attr ("invalid entry family name", P);
end if;
return;
else
Ent := Entity (Prefix (P));
end if;
elsif Nkind (P) = N_Selected_Component
and then Present (Entity (Selector_Name (P)))
and then Ekind (Entity (Selector_Name (P))) = E_Entry
then
Error_Attr
("attribute % must apply to entry of current task", P);
else
Error_Attr ("invalid entry name", N);
return;
end if;
for J in reverse 0 .. Scope_Stack.Last loop
S := Scope_Stack.Table (J).Entity;
if S = Scope (Ent) then
if Nkind (P) = N_Expanded_Name then
Tsk := Entity (Prefix (P));
-- The prefix denotes either the task type, or else a
-- single task whose task type is being analyzed.
if (Is_Type (Tsk) and then Tsk = S)
or else (not Is_Type (Tsk)
and then Etype (Tsk) = S
and then not (Comes_From_Source (S)))
then
null;
else
Error_Attr
("Attribute % must apply to entry of current task", N);
end if;
end if;
exit;
elsif Ekind (Scope (Ent)) in Task_Kind
and then not Ekind_In (S, E_Block,
E_Entry,
E_Entry_Family,
E_Loop)
then
Error_Attr ("Attribute % cannot appear in inner unit", N);
elsif Ekind (Scope (Ent)) = E_Protected_Type
and then not Has_Completion (Scope (Ent))
then
Error_Attr ("attribute % can only be used inside body", N);
end if;
end loop;
if Is_Overloaded (P) then
declare
Index : Interp_Index;
It : Interp;
begin
Get_First_Interp (P, Index, It);
while Present (It.Nam) loop
if It.Nam = Ent then
null;
-- Ada 2005 (AI-345): Do not consider primitive entry
-- wrappers generated for task or protected types.
elsif Ada_Version >= Ada_2005
and then not Comes_From_Source (It.Nam)
then
null;
else
Error_Attr ("ambiguous entry name", N);
end if;
Get_Next_Interp (Index, It);
end loop;
end;
end if;
Set_Etype (N, Universal_Integer);
end Count;
-----------------------
-- Default_Bit_Order --
-----------------------
when Attribute_Default_Bit_Order => Default_Bit_Order : declare
Target_Default_Bit_Order : System.Bit_Order;
begin
Check_Standard_Prefix;
if Bytes_Big_Endian then
Target_Default_Bit_Order := System.High_Order_First;
else
Target_Default_Bit_Order := System.Low_Order_First;
end if;
Rewrite (N,
Make_Integer_Literal (Loc,
UI_From_Int (System.Bit_Order'Pos (Target_Default_Bit_Order))));
Set_Etype (N, Universal_Integer);
Set_Is_Static_Expression (N);
end Default_Bit_Order;
----------------------------------
-- Default_Scalar_Storage_Order --
----------------------------------
when Attribute_Default_Scalar_Storage_Order => Default_SSO : declare
RE_Default_SSO : RE_Id;
begin
Check_Standard_Prefix;
case Opt.Default_SSO is
when ' ' =>
if Bytes_Big_Endian then
RE_Default_SSO := RE_High_Order_First;
else
RE_Default_SSO := RE_Low_Order_First;
end if;
when 'H' =>
RE_Default_SSO := RE_High_Order_First;
when 'L' =>
RE_Default_SSO := RE_Low_Order_First;
when others =>
raise Program_Error;
end case;
Rewrite (N, New_Occurrence_Of (RTE (RE_Default_SSO), Loc));
end Default_SSO;
--------------
-- Definite --
--------------
when Attribute_Definite =>
Legal_Formal_Attribute;
-----------
-- Delta --
-----------
when Attribute_Delta =>
Check_Fixed_Point_Type_0;
Set_Etype (N, Universal_Real);
------------
-- Denorm --
------------
when Attribute_Denorm =>
Check_Floating_Point_Type_0;
Set_Etype (N, Standard_Boolean);
-----------
-- Deref --
-----------
when Attribute_Deref =>
Check_Type;
Check_E1;
Resolve (E1, RTE (RE_Address));
Set_Etype (N, P_Type);
---------------------
-- Descriptor_Size --
---------------------
when Attribute_Descriptor_Size =>
Check_E0;
if not Is_Entity_Name (P) or else not Is_Type (Entity (P)) then
Error_Attr_P ("prefix of attribute % must denote a type");
end if;
Set_Etype (N, Universal_Integer);
------------
-- Digits --
------------
when Attribute_Digits =>
Check_E0;
Check_Type;
if not Is_Floating_Point_Type (P_Type)
and then not Is_Decimal_Fixed_Point_Type (P_Type)
then
Error_Attr_P
("prefix of % attribute must be float or decimal type");
end if;
Set_Etype (N, Universal_Integer);
---------------
-- Elab_Body --
---------------
-- Also handles processing for Elab_Spec and Elab_Subp_Body
when Attribute_Elab_Body
| Attribute_Elab_Spec
| Attribute_Elab_Subp_Body
=>
Check_E0;
Check_Unit_Name (P);
Set_Etype (N, Standard_Void_Type);
-- We have to manually call the expander in this case to get
-- the necessary expansion (normally attributes that return
-- entities are not expanded).
Expand (N);
---------------
-- Elab_Spec --
---------------
-- Shares processing with Elab_Body
----------------
-- Elaborated --
----------------
when Attribute_Elaborated =>
Check_E0;
Check_Unit_Name (P);
Set_Etype (N, Standard_Boolean);
----------
-- Emax --
----------
when Attribute_Emax =>
Check_Floating_Point_Type_0;
Set_Etype (N, Universal_Integer);
-------------
-- Enabled --
-------------
when Attribute_Enabled =>
Check_Either_E0_Or_E1;
if Present (E1) then
if not Is_Entity_Name (E1) or else No (Entity (E1)) then
Error_Msg_N ("entity name expected for Enabled attribute", E1);
E1 := Empty;
end if;
end if;
if Nkind (P) /= N_Identifier then
Error_Msg_N ("identifier expected (check name)", P);
elsif Get_Check_Id (Chars (P)) = No_Check_Id then
Error_Msg_N ("& is not a recognized check name", P);
end if;
Set_Etype (N, Standard_Boolean);
--------------
-- Enum_Rep --
--------------
when Attribute_Enum_Rep =>
if Present (E1) then
Check_E1;
Check_Discrete_Type;
Resolve (E1, P_Base_Type);
elsif not Is_Discrete_Type (Etype (P)) then
Error_Attr_P ("prefix of % attribute must be of discrete type");
end if;
Set_Etype (N, Universal_Integer);
--------------
-- Enum_Val --
--------------
when Attribute_Enum_Val =>
Check_E1;
Check_Type;
if not Is_Enumeration_Type (P_Type) then
Error_Attr_P ("prefix of % attribute must be enumeration type");
end if;
-- If the enumeration type has a standard representation, the effect
-- is the same as 'Val, so rewrite the attribute as a 'Val.
if not Has_Non_Standard_Rep (P_Base_Type) then
Rewrite (N,
Make_Attribute_Reference (Loc,
Prefix => Relocate_Node (Prefix (N)),
Attribute_Name => Name_Val,
Expressions => New_List (Relocate_Node (E1))));
Analyze_And_Resolve (N, P_Base_Type);
-- Non-standard representation case (enumeration with holes)
else
Check_Enum_Image;
Resolve (E1, Any_Integer);
Set_Etype (N, P_Base_Type);
end if;
-------------
-- Epsilon --
-------------
when Attribute_Epsilon =>
Check_Floating_Point_Type_0;
Set_Etype (N, Universal_Real);
--------------
-- Exponent --
--------------
when Attribute_Exponent =>
Check_Floating_Point_Type_1;
Set_Etype (N, Universal_Integer);
Resolve (E1, P_Base_Type);
------------------
-- External_Tag --
------------------
when Attribute_External_Tag =>
Check_E0;
Check_Type;
Set_Etype (N, Standard_String);
if not Is_Tagged_Type (P_Type) then
Error_Attr_P ("prefix of % attribute must be tagged");
end if;
---------------
-- Fast_Math --
---------------
when Attribute_Fast_Math =>
Check_Standard_Prefix;
Rewrite (N, New_Occurrence_Of (Boolean_Literals (Fast_Math), Loc));
-----------------------
-- Finalization_Size --
-----------------------
when Attribute_Finalization_Size =>
Check_E0;
-- The prefix denotes an object
if Is_Object_Reference (P) then
Check_Object_Reference (P);
-- The prefix denotes a type
elsif Is_Entity_Name (P) and then Is_Type (Entity (P)) then
Check_Type;
Check_Not_Incomplete_Type;
-- Attribute 'Finalization_Size is not defined for class-wide
-- types because it is not possible to know statically whether
-- a definite type will have controlled components or not.
if Is_Class_Wide_Type (Etype (P)) then
Error_Attr_P
("prefix of % attribute cannot denote a class-wide type");
end if;
-- The prefix denotes an illegal construct
else
Error_Attr_P
("prefix of % attribute must be a definite type or an object");
end if;
Set_Etype (N, Universal_Integer);
-----------
-- First --
-----------
when Attribute_First =>
Check_Array_Or_Scalar_Type;
Bad_Attribute_For_Predicate;
---------------
-- First_Bit --
---------------
when Attribute_First_Bit =>
Check_Component;
Set_Etype (N, Universal_Integer);
-----------------
-- First_Valid --
-----------------
when Attribute_First_Valid =>
Check_First_Last_Valid;
Set_Etype (N, P_Type);
-----------------
-- Fixed_Value --
-----------------
when Attribute_Fixed_Value =>
Check_E1;
Check_Fixed_Point_Type;
Resolve (E1, Any_Integer);
Set_Etype (N, P_Base_Type);
-----------
-- Floor --
-----------
when Attribute_Floor =>
Check_Floating_Point_Type_1;
Set_Etype (N, P_Base_Type);
Resolve (E1, P_Base_Type);
----------
-- Fore --
----------
when Attribute_Fore =>
Check_Fixed_Point_Type_0;
Set_Etype (N, Universal_Integer);
--------------
-- Fraction --
--------------
when Attribute_Fraction =>
Check_Floating_Point_Type_1;
Set_Etype (N, P_Base_Type);
Resolve (E1, P_Base_Type);
--------------
-- From_Any --
--------------
when Attribute_From_Any =>
Check_E1;
Check_PolyORB_Attribute;
Set_Etype (N, P_Base_Type);
-----------------------
-- Has_Access_Values --
-----------------------
when Attribute_Has_Access_Values =>
Check_Type;
Check_E0;
Set_Etype (N, Standard_Boolean);
----------------------
-- Has_Same_Storage --
----------------------
when Attribute_Has_Same_Storage =>
Check_E1;
-- The arguments must be objects of any type
Analyze_And_Resolve (P);
Analyze_And_Resolve (E1);
Check_Object_Reference (P);
Check_Object_Reference (E1);
Set_Etype (N, Standard_Boolean);
-----------------------
-- Has_Tagged_Values --
-----------------------
when Attribute_Has_Tagged_Values =>
Check_Type;
Check_E0;
Set_Etype (N, Standard_Boolean);
-----------------------
-- Has_Discriminants --
-----------------------
when Attribute_Has_Discriminants =>
Legal_Formal_Attribute;
--------------
-- Identity --
--------------
when Attribute_Identity =>
Check_E0;
Analyze (P);
if Etype (P) = Standard_Exception_Type then
Set_Etype (N, RTE (RE_Exception_Id));
-- Ada 2005 (AI-345): Attribute 'Identity may be applied to task
-- interface class-wide types.
elsif Is_Task_Type (Etype (P))
or else (Is_Access_Type (Etype (P))
and then Is_Task_Type (Designated_Type (Etype (P))))
or else (Ada_Version >= Ada_2005
and then Ekind (Etype (P)) = E_Class_Wide_Type
and then Is_Interface (Etype (P))
and then Is_Task_Interface (Etype (P)))
then
Resolve (P);
Set_Etype (N, RTE (RO_AT_Task_Id));
else
if Ada_Version >= Ada_2005 then
Error_Attr_P
("prefix of % attribute must be an exception, a task or a "
& "task interface class-wide object");
else
Error_Attr_P
("prefix of % attribute must be a task or an exception");
end if;
end if;
-----------
-- Image --
-----------
when Attribute_Image =>
Check_SPARK_05_Restriction_On_Attribute;
-- AI12-00124-1 : The ARG has adopted the GNAT semantics of 'Img
-- for scalar types, so that the prefix can be an object and not
-- a type, and there is no need for an argument. Given this vote
-- of confidence from the ARG, simplest is to transform this new
-- usage of 'Image into a reference to 'Img.
if Ada_Version > Ada_2005
and then Is_Object_Reference (P)
and then Is_Scalar_Type (P_Type)
then
Rewrite (N,
Make_Attribute_Reference (Loc,
Prefix => Relocate_Node (P),
Attribute_Name => Name_Img));
Analyze (N);
return;
else
Check_Scalar_Type;
end if;
Set_Etype (N, Standard_String);
if Is_Real_Type (P_Type) then
if Ada_Version = Ada_83 and then Comes_From_Source (N) then
Error_Msg_Name_1 := Aname;
Error_Msg_N
("(Ada 83) % attribute not allowed for real types", N);
end if;
end if;
if Is_Enumeration_Type (P_Type) then
Check_Restriction (No_Enumeration_Maps, N);
end if;
Check_E1;
Resolve (E1, P_Base_Type);
Check_Enum_Image;
Validate_Non_Static_Attribute_Function_Call;
-- Check restriction No_Fixed_IO. Note the check of Comes_From_Source
-- to avoid giving a duplicate message for Img expanded into Image.
if Restriction_Check_Required (No_Fixed_IO)
and then Comes_From_Source (N)
and then Is_Fixed_Point_Type (P_Type)
then
Check_Restriction (No_Fixed_IO, P);
end if;
---------
-- Img --
---------
when Attribute_Img =>
Check_E0;
Set_Etype (N, Standard_String);
if not Is_Scalar_Type (P_Type)
or else (Is_Entity_Name (P) and then Is_Type (Entity (P)))
then
Error_Attr_P
("prefix of % attribute must be scalar object name");
end if;
Check_Enum_Image;
-- Check restriction No_Fixed_IO
if Restriction_Check_Required (No_Fixed_IO)
and then Is_Fixed_Point_Type (P_Type)
then
Check_Restriction (No_Fixed_IO, P);
end if;
-----------
-- Input --
-----------
when Attribute_Input =>
Check_E1;
Check_Stream_Attribute (TSS_Stream_Input);
Set_Etype (N, P_Base_Type);
-------------------
-- Integer_Value --
-------------------
when Attribute_Integer_Value =>
Check_E1;
Check_Integer_Type;
Resolve (E1, Any_Fixed);
-- Signal an error if argument type is not a specific fixed-point
-- subtype. An error has been signalled already if the argument
-- was not of a fixed-point type.
if Etype (E1) = Any_Fixed and then not Error_Posted (E1) then
Error_Attr ("argument of % must be of a fixed-point type", E1);
end if;
Set_Etype (N, P_Base_Type);
-------------------
-- Invalid_Value --
-------------------
when Attribute_Invalid_Value =>
Check_E0;
Check_Scalar_Type;
Set_Etype (N, P_Base_Type);
Invalid_Value_Used := True;
-----------
-- Large --
-----------
when Attribute_Large =>
Check_E0;
Check_Real_Type;
Set_Etype (N, Universal_Real);
----------
-- Last --
----------
when Attribute_Last =>
Check_Array_Or_Scalar_Type;
Bad_Attribute_For_Predicate;
--------------
-- Last_Bit --
--------------
when Attribute_Last_Bit =>
Check_Component;
Set_Etype (N, Universal_Integer);
----------------
-- Last_Valid --
----------------
when Attribute_Last_Valid =>
Check_First_Last_Valid;
Set_Etype (N, P_Type);
------------------
-- Leading_Part --
------------------
when Attribute_Leading_Part =>
Check_Floating_Point_Type_2;
Set_Etype (N, P_Base_Type);
Resolve (E1, P_Base_Type);
Resolve (E2, Any_Integer);
------------
-- Length --
------------
when Attribute_Length =>
Check_Array_Type;
Set_Etype (N, Universal_Integer);
-------------------
-- Library_Level --
-------------------
when Attribute_Library_Level =>
Check_E0;
if not Is_Entity_Name (P) then
Error_Attr_P ("prefix of % attribute must be an entity name");
end if;
if not Inside_A_Generic then
Set_Boolean_Result (N,
Is_Library_Level_Entity (Entity (P)));
end if;
Set_Etype (N, Standard_Boolean);
---------------
-- Lock_Free --
---------------
when Attribute_Lock_Free =>
Check_E0;
Set_Etype (N, Standard_Boolean);
if not Is_Protected_Type (P_Type) then
Error_Attr_P
("prefix of % attribute must be a protected object");
end if;
----------------
-- Loop_Entry --
----------------
when Attribute_Loop_Entry => Loop_Entry : declare
procedure Check_References_In_Prefix (Loop_Id : Entity_Id);
-- Inspect the prefix for any uses of entities declared within the
-- related loop. Loop_Id denotes the loop identifier.
--------------------------------
-- Check_References_In_Prefix --
--------------------------------
procedure Check_References_In_Prefix (Loop_Id : Entity_Id) is
Loop_Decl : constant Node_Id := Label_Construct (Parent (Loop_Id));
function Check_Reference (Nod : Node_Id) return Traverse_Result;
-- Determine whether a reference mentions an entity declared
-- within the related loop.
function Declared_Within (Nod : Node_Id) return Boolean;
-- Determine whether Nod appears in the subtree of Loop_Decl
---------------------
-- Check_Reference --
---------------------
function Check_Reference (Nod : Node_Id) return Traverse_Result is
begin
if Nkind (Nod) = N_Identifier
and then Present (Entity (Nod))
and then Declared_Within (Declaration_Node (Entity (Nod)))
then
Error_Attr
("prefix of attribute % cannot reference local entities",
Nod);
return Abandon;
else
return OK;
end if;
end Check_Reference;
procedure Check_References is new Traverse_Proc (Check_Reference);
---------------------
-- Declared_Within --
---------------------
function Declared_Within (Nod : Node_Id) return Boolean is
Stmt : Node_Id;
begin
Stmt := Nod;
while Present (Stmt) loop
if Stmt = Loop_Decl then
return True;
-- Prevent the search from going too far
elsif Is_Body_Or_Package_Declaration (Stmt) then
exit;
end if;
Stmt := Parent (Stmt);
end loop;
return False;
end Declared_Within;
-- Start of processing for Check_Prefix_For_Local_References
begin
Check_References (P);
end Check_References_In_Prefix;
-- Local variables
Context : constant Node_Id := Parent (N);
Attr : Node_Id;
Encl_Loop : Node_Id;
Encl_Prag : Node_Id := Empty;
Loop_Id : Entity_Id := Empty;
Scop : Entity_Id;
Stmt : Node_Id;
-- Start of processing for Loop_Entry
begin
Attr := N;
-- Set the type of the attribute now to ensure the successfull
-- continuation of analysis even if the attribute is misplaced.
Set_Etype (Attr, P_Type);
-- Attribute 'Loop_Entry may appear in several flavors:
-- * Prefix'Loop_Entry - in this form, the attribute applies to the
-- nearest enclosing loop.
-- * Prefix'Loop_Entry (Expr) - depending on what Expr denotes, the
-- attribute may be related to a loop denoted by label Expr or
-- the prefix may denote an array object and Expr may act as an
-- indexed component.
-- * Prefix'Loop_Entry (Expr1, ..., ExprN) - the attribute applies
-- to the nearest enclosing loop, all expressions are part of
-- an indexed component.
-- * Prefix'Loop_Entry (Expr) (...) (...) - depending on what Expr
-- denotes, the attribute may be related to a loop denoted by
-- label Expr or the prefix may denote a multidimensional array
-- array object and Expr along with the rest of the expressions
-- may act as indexed components.
-- Regardless of variations, the attribute reference does not have an
-- expression list. Instead, all available expressions are stored as
-- indexed components.
-- When the attribute is part of an indexed component, find the first
-- expression as it will determine the semantics of 'Loop_Entry.
if Nkind (Context) = N_Indexed_Component then
E1 := First (Expressions (Context));
E2 := Next (E1);
-- The attribute reference appears in the following form:
-- Prefix'Loop_Entry (Exp1, Expr2, ..., ExprN) [(...)]
-- In this case, the loop name is omitted and no rewriting is
-- required.
if Present (E2) then
null;
-- The form of the attribute is:
-- Prefix'Loop_Entry (Expr) [(...)]
-- If Expr denotes a loop entry, the whole attribute and indexed
-- component will have to be rewritten to reflect this relation.
else
pragma Assert (Present (E1));
-- Do not expand the expression as it may have side effects.
-- Simply preanalyze to determine whether it is a loop name or
-- something else.
Preanalyze_And_Resolve (E1);
if Is_Entity_Name (E1)
and then Present (Entity (E1))
and then Ekind (Entity (E1)) = E_Loop
then
Loop_Id := Entity (E1);
-- Transform the attribute and enclosing indexed component
Set_Expressions (N, Expressions (Context));
Rewrite (Context, N);
Set_Etype (Context, P_Type);
Attr := Context;
end if;
end if;
end if;
-- The prefix must denote an object
if not Is_Object_Reference (P) then
Error_Attr_P ("prefix of attribute % must denote an object");
end if;
-- The prefix cannot be of a limited type because the expansion of
-- Loop_Entry must create a constant initialized by the evaluated
-- prefix.
if Is_Limited_View (Etype (P)) then
Error_Attr_P ("prefix of attribute % cannot be limited");
end if;
-- Climb the parent chain to verify the location of the attribute and
-- find the enclosing loop.
Stmt := Attr;
while Present (Stmt) loop
-- Locate the corresponding enclosing pragma. Note that in the
-- case of Assert[And_Cut] and Assume, we have already checked
-- that the pragma appears in an appropriate loop location.
if Nkind (Original_Node (Stmt)) = N_Pragma
and then Nam_In (Pragma_Name_Unmapped (Original_Node (Stmt)),
Name_Loop_Invariant,
Name_Loop_Variant,
Name_Assert,
Name_Assert_And_Cut,
Name_Assume)
then
Encl_Prag := Original_Node (Stmt);
-- Locate the enclosing loop (if any). Note that Ada 2012 array
-- iteration may be expanded into several nested loops, we are
-- interested in the outermost one which has the loop identifier,
-- and comes from source.
elsif Nkind (Stmt) = N_Loop_Statement
and then Present (Identifier (Stmt))
and then Comes_From_Source (Original_Node (Stmt))
and then Nkind (Original_Node (Stmt)) = N_Loop_Statement
then
Encl_Loop := Stmt;
-- The original attribute reference may lack a loop name. Use
-- the name of the enclosing loop because it is the related
-- loop.
if No (Loop_Id) then
Loop_Id := Entity (Identifier (Encl_Loop));
end if;
exit;
-- Prevent the search from going too far
elsif Is_Body_Or_Package_Declaration (Stmt) then
exit;
end if;
Stmt := Parent (Stmt);
end loop;
-- Loop_Entry must appear within a Loop_Assertion pragma (Assert,
-- Assert_And_Cut, Assume count as loop assertion pragmas for this
-- purpose if they appear in an appropriate location in a loop,
-- which was already checked by the top level pragma circuit).
-- Loop_Entry also denotes a value and as such can appear within an
-- expression that is an argument for another loop aspect. In that
-- case it will have been expanded into the corresponding assignment.
if Expander_Active
and then Nkind (Parent (N)) = N_Assignment_Statement
and then not Comes_From_Source (Parent (N))
then
null;
elsif No (Encl_Prag) then
Error_Attr ("attribute% must appear within appropriate pragma", N);
end if;
-- A Loop_Entry that applies to a given loop statement must not
-- appear within a body of accept statement, if this construct is
-- itself enclosed by the given loop statement.
for Index in reverse 0 .. Scope_Stack.Last loop
Scop := Scope_Stack.Table (Index).Entity;
if Ekind (Scop) = E_Loop and then Scop = Loop_Id then
exit;
elsif Ekind_In (Scop, E_Block, E_Loop, E_Return_Statement) then
null;
else
Error_Attr
("attribute % cannot appear in body or accept statement", N);
exit;
end if;
end loop;
-- The prefix cannot mention entities declared within the related
-- loop because they will not be visible once the prefix is moved
-- outside the loop.
Check_References_In_Prefix (Loop_Id);
-- The prefix must denote a static entity if the pragma does not
-- apply to the innermost enclosing loop statement, or if it appears
-- within a potentially unevaluated epxression.
if Is_Entity_Name (P)
or else Nkind (Parent (P)) = N_Object_Renaming_Declaration
then
null;
elsif Present (Encl_Loop)
and then Entity (Identifier (Encl_Loop)) /= Loop_Id
then
Error_Attr_P
("prefix of attribute % that applies to outer loop must denote "
& "an entity");
elsif Is_Potentially_Unevaluated (P) then
Uneval_Old_Msg;
end if;
-- Replace the Loop_Entry attribute reference by its prefix if the
-- related pragma is ignored. This transformation is OK with respect
-- to typing because Loop_Entry's type is that of its prefix. This
-- early transformation also avoids the generation of a useless loop
-- entry constant.
if Present (Encl_Prag) and then Is_Ignored (Encl_Prag) then
Rewrite (N, Relocate_Node (P));
Preanalyze_And_Resolve (N);
else
Preanalyze_And_Resolve (P);
end if;
end Loop_Entry;
-------------
-- Machine --
-------------
when Attribute_Machine =>
Check_Floating_Point_Type_1;
Set_Etype (N, P_Base_Type);
Resolve (E1, P_Base_Type);
------------------
-- Machine_Emax --
------------------
when Attribute_Machine_Emax =>
Check_Floating_Point_Type_0;
Set_Etype (N, Universal_Integer);
------------------
-- Machine_Emin --
------------------
when Attribute_Machine_Emin =>
Check_Floating_Point_Type_0;
Set_Etype (N, Universal_Integer);
----------------------
-- Machine_Mantissa --
----------------------
when Attribute_Machine_Mantissa =>
Check_Floating_Point_Type_0;
Set_Etype (N, Universal_Integer);
-----------------------
-- Machine_Overflows --
-----------------------
when Attribute_Machine_Overflows =>
Check_Real_Type;
Check_E0;
Set_Etype (N, Standard_Boolean);
-------------------
-- Machine_Radix --
-------------------
when Attribute_Machine_Radix =>
Check_Real_Type;
Check_E0;
Set_Etype (N, Universal_Integer);
----------------------
-- Machine_Rounding --
----------------------
when Attribute_Machine_Rounding =>
Check_Floating_Point_Type_1;
Set_Etype (N, P_Base_Type);
Resolve (E1, P_Base_Type);
--------------------
-- Machine_Rounds --
--------------------
when Attribute_Machine_Rounds =>
Check_Real_Type;
Check_E0;
Set_Etype (N, Standard_Boolean);
------------------
-- Machine_Size --
------------------
when Attribute_Machine_Size =>
Check_E0;
Check_Type;
Check_Not_Incomplete_Type;
Set_Etype (N, Universal_Integer);
--------------
-- Mantissa --
--------------
when Attribute_Mantissa =>
Check_E0;
Check_Real_Type;
Set_Etype (N, Universal_Integer);
---------
-- Max --
---------
when Attribute_Max =>
Min_Max;
----------------------------------
-- Max_Alignment_For_Allocation --
----------------------------------
when Attribute_Max_Size_In_Storage_Elements =>
Max_Alignment_For_Allocation_Max_Size_In_Storage_Elements;
----------------------------------
-- Max_Size_In_Storage_Elements --
----------------------------------
when Attribute_Max_Alignment_For_Allocation =>
Max_Alignment_For_Allocation_Max_Size_In_Storage_Elements;
-----------------------
-- Maximum_Alignment --
-----------------------
when Attribute_Maximum_Alignment =>
Standard_Attribute (Ttypes.Maximum_Alignment);
--------------------
-- Mechanism_Code --
--------------------
when Attribute_Mechanism_Code =>
if not Is_Entity_Name (P)
or else not Is_Subprogram (Entity (P))
then
Error_Attr_P ("prefix of % attribute must be subprogram");
end if;
Check_Either_E0_Or_E1;
if Present (E1) then
Resolve (E1, Any_Integer);
Set_Etype (E1, Standard_Integer);
if not Is_OK_Static_Expression (E1) then
Flag_Non_Static_Expr
("expression for parameter number must be static!", E1);
Error_Attr;
elsif UI_To_Int (Intval (E1)) > Number_Formals (Entity (P))
or else UI_To_Int (Intval (E1)) < 0
then
Error_Attr ("invalid parameter number for % attribute", E1);
end if;
end if;
Set_Etype (N, Universal_Integer);
---------
-- Min --
---------
when Attribute_Min =>
Min_Max;
---------
-- Mod --
---------
when Attribute_Mod =>
-- Note: this attribute is only allowed in Ada 2005 mode, but
-- we do not need to test that here, since Mod is only recognized
-- as an attribute name in Ada 2005 mode during the parse.
Check_E1;
Check_Modular_Integer_Type;
Resolve (E1, Any_Integer);
Set_Etype (N, P_Base_Type);
-----------
-- Model --
-----------
when Attribute_Model =>
Check_Floating_Point_Type_1;
Set_Etype (N, P_Base_Type);
Resolve (E1, P_Base_Type);
----------------
-- Model_Emin --
----------------
when Attribute_Model_Emin =>
Check_Floating_Point_Type_0;
Set_Etype (N, Universal_Integer);
-------------------
-- Model_Epsilon --
-------------------
when Attribute_Model_Epsilon =>
Check_Floating_Point_Type_0;
Set_Etype (N, Universal_Real);
--------------------
-- Model_Mantissa --
--------------------
when Attribute_Model_Mantissa =>
Check_Floating_Point_Type_0;
Set_Etype (N, Universal_Integer);
-----------------
-- Model_Small --
-----------------
when Attribute_Model_Small =>
Check_Floating_Point_Type_0;
Set_Etype (N, Universal_Real);
-------------
-- Modulus --
-------------
when Attribute_Modulus =>
Check_E0;
Check_Modular_Integer_Type;
Set_Etype (N, Universal_Integer);
--------------------
-- Null_Parameter --
--------------------
when Attribute_Null_Parameter => Null_Parameter : declare
Parnt : constant Node_Id := Parent (N);
GParnt : constant Node_Id := Parent (Parnt);
procedure Bad_Null_Parameter (Msg : String);
-- Used if bad Null parameter attribute node is found. Issues
-- given error message, and also sets the type to Any_Type to
-- avoid blowups later on from dealing with a junk node.
procedure Must_Be_Imported (Proc_Ent : Entity_Id);
-- Called to check that Proc_Ent is imported subprogram
------------------------
-- Bad_Null_Parameter --
------------------------
procedure Bad_Null_Parameter (Msg : String) is
begin
Error_Msg_N (Msg, N);
Set_Etype (N, Any_Type);
end Bad_Null_Parameter;
----------------------
-- Must_Be_Imported --
----------------------
procedure Must_Be_Imported (Proc_Ent : Entity_Id) is
Pent : constant Entity_Id := Ultimate_Alias (Proc_Ent);
begin
-- Ignore check if procedure not frozen yet (we will get
-- another chance when the default parameter is reanalyzed)
if not Is_Frozen (Pent) then
return;
elsif not Is_Imported (Pent) then
Bad_Null_Parameter
("Null_Parameter can only be used with imported subprogram");
else
return;
end if;
end Must_Be_Imported;
-- Start of processing for Null_Parameter
begin
Check_Type;
Check_E0;
Set_Etype (N, P_Type);
-- Case of attribute used as default expression
if Nkind (Parnt) = N_Parameter_Specification then
Must_Be_Imported (Defining_Entity (GParnt));
-- Case of attribute used as actual for subprogram (positional)
elsif Nkind (Parnt) in N_Subprogram_Call
and then Is_Entity_Name (Name (Parnt))
then
Must_Be_Imported (Entity (Name (Parnt)));
-- Case of attribute used as actual for subprogram (named)
elsif Nkind (Parnt) = N_Parameter_Association
and then Nkind (GParnt) in N_Subprogram_Call
and then Is_Entity_Name (Name (GParnt))
then
Must_Be_Imported (Entity (Name (GParnt)));
-- Not an allowed case
else
Bad_Null_Parameter
("Null_Parameter must be actual or default parameter");
end if;
end Null_Parameter;
-----------------
-- Object_Size --
-----------------
when Attribute_Object_Size =>
Check_E0;
Check_Type;
Check_Not_Incomplete_Type;
Set_Etype (N, Universal_Integer);
---------
-- Old --
---------
when Attribute_Old => Old : declare
procedure Check_References_In_Prefix (Subp_Id : Entity_Id);
-- Inspect the contents of the prefix and detect illegal uses of a
-- nested 'Old, attribute 'Result or a use of an entity declared in
-- the related postcondition expression. Subp_Id is the subprogram to
-- which the related postcondition applies.
--------------------------------
-- Check_References_In_Prefix --
--------------------------------
procedure Check_References_In_Prefix (Subp_Id : Entity_Id) is
function Check_Reference (Nod : Node_Id) return Traverse_Result;
-- Detect attribute 'Old, attribute 'Result of a use of an entity
-- and perform the appropriate semantic check.
---------------------
-- Check_Reference --
---------------------
function Check_Reference (Nod : Node_Id) return Traverse_Result is
begin
-- Attributes 'Old and 'Result cannot appear in the prefix of
-- another attribute 'Old.
if Nkind (Nod) = N_Attribute_Reference
and then Nam_In (Attribute_Name (Nod), Name_Old,
Name_Result)
then
Error_Msg_Name_1 := Attribute_Name (Nod);
Error_Msg_Name_2 := Name_Old;
Error_Msg_N
("attribute % cannot appear in the prefix of attribute %",
Nod);
return Abandon;
-- Entities mentioned within the prefix of attribute 'Old must
-- be global to the related postcondition. If this is not the
-- case, then the scope of the local entity is nested within
-- that of the subprogram.
elsif Is_Entity_Name (Nod)
and then Present (Entity (Nod))
and then Scope_Within (Scope (Entity (Nod)), Subp_Id)
then
Error_Attr
("prefix of attribute % cannot reference local entities",
Nod);
return Abandon;
-- Otherwise keep inspecting the prefix
else
return OK;
end if;
end Check_Reference;
procedure Check_References is new Traverse_Proc (Check_Reference);
-- Start of processing for Check_References_In_Prefix
begin
Check_References (P);
end Check_References_In_Prefix;
-- Local variables
Legal : Boolean;
Pref_Id : Entity_Id;
Pref_Typ : Entity_Id;
Spec_Id : Entity_Id;
-- Start of processing for Old
begin
-- The attribute reference is a primary. If any expressions follow,
-- then the attribute reference is an indexable object. Transform the
-- attribute into an indexed component and analyze it.
if Present (E1) then
Rewrite (N,
Make_Indexed_Component (Loc,
Prefix =>
Make_Attribute_Reference (Loc,
Prefix => Relocate_Node (P),
Attribute_Name => Name_Old),
Expressions => Expressions (N)));
Analyze (N);
return;
end if;
Analyze_Attribute_Old_Result (Legal, Spec_Id);
-- The aspect or pragma where attribute 'Old resides should be
-- associated with a subprogram declaration or a body. If this is not
-- the case, then the aspect or pragma is illegal. Return as analysis
-- cannot be carried out.
-- The exception to this rule is when generating C since in this case
-- postconditions are inlined.
if No (Spec_Id)
and then Modify_Tree_For_C
and then In_Inlined_Body
then
Spec_Id := Entity (P);
elsif not Legal then
return;
end if;
-- The prefix must be preanalyzed as the full analysis will take
-- place during expansion.
Preanalyze_And_Resolve (P);
-- Ensure that the prefix does not contain attributes 'Old or 'Result
Check_References_In_Prefix (Spec_Id);
-- Set the type of the attribute now to prevent cascaded errors
Pref_Typ := Etype (P);
Set_Etype (N, Pref_Typ);
-- Legality checks
if Is_Limited_Type (Pref_Typ) then
Error_Attr ("attribute % cannot apply to limited objects", P);
end if;
-- The prefix is a simple name
if Is_Entity_Name (P) and then Present (Entity (P)) then
Pref_Id := Entity (P);
-- Emit a warning when the prefix is a constant. Note that the use
-- of Error_Attr would reset the type of N to Any_Type even though
-- this is a warning. Use Error_Msg_XXX instead.
if Is_Constant_Object (Pref_Id) then
Error_Msg_Name_1 := Name_Old;
Error_Msg_N
("??attribute % applied to constant has no effect", P);
end if;
-- Otherwise the prefix is not a simple name
else
-- Ensure that the prefix of attribute 'Old is an entity when it
-- is potentially unevaluated (6.1.1 (27/3)).
if Is_Potentially_Unevaluated (N) then
Uneval_Old_Msg;
-- Detect a possible infinite recursion when the prefix denotes
-- the related function.
-- function Func (...) return ...
-- with Post => Func'Old ...;
-- The function may be specified in qualified form X.Y where X is
-- a protected object and Y is a protected function. In that case
-- ensure that the qualified form has an entity.
elsif Nkind (P) = N_Function_Call
and then Nkind (Name (P)) in N_Has_Entity
then
Pref_Id := Entity (Name (P));
if Ekind_In (Spec_Id, E_Function, E_Generic_Function)
and then Pref_Id = Spec_Id
then
Error_Msg_Warn := SPARK_Mode /= On;
Error_Msg_N ("!possible infinite recursion<<", P);
Error_Msg_N ("\!??Storage_Error ]<<", P);
end if;
end if;
-- The prefix of attribute 'Old may refer to a component of a
-- formal parameter. In this case its expansion may generate
-- actual subtypes that are referenced in an inner context and
-- that must be elaborated within the subprogram itself. If the
-- prefix includes a function call, it may involve finalization
-- actions that should be inserted when the attribute has been
-- rewritten as a declaration. Create a declaration for the prefix
-- and insert it at the start of the enclosing subprogram. This is
-- an expansion activity that has to be performed now to prevent
-- out-of-order issues.
-- This expansion is both harmful and not needed in SPARK mode,
-- since the formal verification back end relies on the types of
-- nodes (hence is not robust w.r.t. a change to base type here),
-- and does not suffer from the out-of-order issue described
-- above. Thus, this expansion is skipped in SPARK mode.
-- The expansion is not relevant for discrete types, which will
-- not generate extra declarations, and where use of the base type
-- may lead to spurious errors if context is a case.
if not GNATprove_Mode then
if not Is_Discrete_Type (Pref_Typ) then
Pref_Typ := Base_Type (Pref_Typ);
end if;
Set_Etype (N, Pref_Typ);
Set_Etype (P, Pref_Typ);
Analyze_Dimension (N);
Expand (N);
end if;
end if;
end Old;
----------------------
-- Overlaps_Storage --
----------------------
when Attribute_Overlaps_Storage =>
Check_E1;
-- Both arguments must be objects of any type
Analyze_And_Resolve (P);
Analyze_And_Resolve (E1);
Check_Object_Reference (P);
Check_Object_Reference (E1);
Set_Etype (N, Standard_Boolean);
------------
-- Output --
------------
when Attribute_Output =>
Check_E2;
Check_Stream_Attribute (TSS_Stream_Output);
Set_Etype (N, Standard_Void_Type);
Resolve (N, Standard_Void_Type);
------------------
-- Partition_ID --
------------------
when Attribute_Partition_ID =>
Check_E0;
if P_Type /= Any_Type then
if not Is_Library_Level_Entity (Entity (P)) then
Error_Attr_P
("prefix of % attribute must be library-level entity");
-- The defining entity of prefix should not be declared inside a
-- Pure unit. RM E.1(8). Is_Pure was set during declaration.
elsif Is_Entity_Name (P)
and then Is_Pure (Entity (P))
then
Error_Attr_P ("prefix of% attribute must not be declared pure");
end if;
end if;
Set_Etype (N, Universal_Integer);
-------------------------
-- Passed_By_Reference --
-------------------------
when Attribute_Passed_By_Reference =>
Check_E0;
Check_Type;
Set_Etype (N, Standard_Boolean);
------------------
-- Pool_Address --
------------------
when Attribute_Pool_Address =>
Check_E0;
Set_Etype (N, RTE (RE_Address));
---------
-- Pos --
---------
when Attribute_Pos =>
Check_Discrete_Type;
Check_E1;
if Is_Boolean_Type (P_Type) then
Error_Msg_Name_1 := Aname;
Error_Msg_Name_2 := Chars (P_Type);
Check_SPARK_05_Restriction
("attribute% is not allowed for type%", P);
end if;
Resolve (E1, P_Base_Type);
Set_Etype (N, Universal_Integer);
--------------
-- Position --
--------------
when Attribute_Position =>
Check_Component;
Set_Etype (N, Universal_Integer);
----------
-- Pred --
----------
when Attribute_Pred =>
Check_Scalar_Type;
Check_E1;
if Is_Real_Type (P_Type) or else Is_Boolean_Type (P_Type) then
Error_Msg_Name_1 := Aname;
Error_Msg_Name_2 := Chars (P_Type);
Check_SPARK_05_Restriction
("attribute% is not allowed for type%", P);
end if;
Resolve (E1, P_Base_Type);
Set_Etype (N, P_Base_Type);
-- Since Pred works on the base type, we normally do no check for the
-- floating-point case, since the base type is unconstrained. But we
-- make an exception in Check_Float_Overflow mode.
if Is_Floating_Point_Type (P_Type) then
if not Range_Checks_Suppressed (P_Base_Type) then
Set_Do_Range_Check (E1);
end if;
-- If not modular type, test for overflow check required
else
if not Is_Modular_Integer_Type (P_Type)
and then not Range_Checks_Suppressed (P_Base_Type)
then
Enable_Range_Check (E1);
end if;
end if;
--------------
-- Priority --
--------------
-- Ada 2005 (AI-327): Dynamic ceiling priorities
when Attribute_Priority =>
if Ada_Version < Ada_2005 then
Error_Attr ("% attribute is allowed only in Ada 2005 mode", P);
end if;
Check_E0;
Check_Restriction (No_Dynamic_Priorities, N);
-- The prefix must be a protected object (AARM D.5.2 (2/2))
Analyze (P);
if Is_Protected_Type (Etype (P))
or else (Is_Access_Type (Etype (P))
and then Is_Protected_Type (Designated_Type (Etype (P))))
then
Resolve (P, Etype (P));
else
Error_Attr_P ("prefix of % attribute must be a protected object");
end if;
Set_Etype (N, Standard_Integer);
-- Must be called from within a protected procedure or entry of the
-- protected object.
declare
S : Entity_Id;
begin
S := Current_Scope;
while S /= Etype (P)
and then S /= Standard_Standard
loop
S := Scope (S);
end loop;
if S = Standard_Standard then
Error_Attr ("the attribute % is only allowed inside protected "
& "operations", P);
end if;
end;
Validate_Non_Static_Attribute_Function_Call;
-----------
-- Range --
-----------
when Attribute_Range =>
Check_Array_Or_Scalar_Type;
Bad_Attribute_For_Predicate;
if Ada_Version = Ada_83
and then Is_Scalar_Type (P_Type)
and then Comes_From_Source (N)
then
Error_Attr
("(Ada 83) % attribute not allowed for scalar type", P);
end if;
------------
-- Result --
------------
when Attribute_Result => Result : declare
function Denote_Same_Function
(Pref_Id : Entity_Id;
Spec_Id : Entity_Id) return Boolean;
-- Determine whether the entity of the prefix Pref_Id denotes the
-- same entity as that of the related subprogram Spec_Id.
--------------------------
-- Denote_Same_Function --
--------------------------
function Denote_Same_Function
(Pref_Id : Entity_Id;
Spec_Id : Entity_Id) return Boolean
is
Over_Id : constant Entity_Id := Overridden_Operation (Spec_Id);
Subp_Spec : constant Node_Id := Parent (Spec_Id);
begin
-- The prefix denotes the related subprogram
if Pref_Id = Spec_Id then
return True;
-- Account for a special case when attribute 'Result appears in
-- the postcondition of a generic function.
-- generic
-- function Gen_Func return ...
-- with Post => Gen_Func'Result ...;
-- When the generic function is instantiated, the Chars field of
-- the instantiated prefix still denotes the name of the generic
-- function. Note that any preemptive transformation is impossible
-- without a proper analysis. The structure of the wrapper package
-- is as follows:
-- package Anon_Gen_Pack is
-- <subtypes and renamings>
-- function Subp_Decl return ...; -- (!)
-- pragma Postcondition (Gen_Func'Result ...); -- (!)
-- function Gen_Func ... renames Subp_Decl;
-- end Anon_Gen_Pack;
elsif Nkind (Subp_Spec) = N_Function_Specification
and then Present (Generic_Parent (Subp_Spec))
and then Ekind_In (Pref_Id, E_Generic_Function, E_Function)
then
if Generic_Parent (Subp_Spec) = Pref_Id then
return True;
elsif Present (Alias (Pref_Id))
and then Alias (Pref_Id) = Spec_Id
then
return True;
end if;
-- Account for a special case where a primitive of a tagged type
-- inherits a class-wide postcondition from a parent type. In this
-- case the prefix of attribute 'Result denotes the overriding
-- primitive.
elsif Present (Over_Id) and then Pref_Id = Over_Id then
return True;
end if;
-- Otherwise the prefix does not denote the related subprogram
return False;
end Denote_Same_Function;
-- Local variables
In_Inlined_C_Postcondition : constant Boolean :=
Modify_Tree_For_C
and then In_Inlined_Body;
Legal : Boolean;
Pref_Id : Entity_Id;
Spec_Id : Entity_Id;
-- Start of processing for Result
begin
-- The attribute reference is a primary. If any expressions follow,
-- then the attribute reference is an indexable object. Transform the
-- attribute into an indexed component and analyze it.
if Present (E1) then
Rewrite (N,
Make_Indexed_Component (Loc,
Prefix =>
Make_Attribute_Reference (Loc,
Prefix => Relocate_Node (P),
Attribute_Name => Name_Result),
Expressions => Expressions (N)));
Analyze (N);
return;
end if;
Analyze_Attribute_Old_Result (Legal, Spec_Id);
-- The aspect or pragma where attribute 'Result resides should be
-- associated with a subprogram declaration or a body. If this is not
-- the case, then the aspect or pragma is illegal. Return as analysis
-- cannot be carried out.
-- The exception to this rule is when generating C since in this case
-- postconditions are inlined.
if No (Spec_Id) and then In_Inlined_C_Postcondition then
Spec_Id := Entity (P);
elsif not Legal then
return;
end if;
-- Attribute 'Result is part of a _Postconditions procedure. There is
-- no need to perform the semantic checks below as they were already
-- verified when the attribute was analyzed in its original context.
-- Instead, rewrite the attribute as a reference to formal parameter
-- _Result of the _Postconditions procedure.
if Chars (Spec_Id) = Name_uPostconditions
or else
(In_Inlined_C_Postcondition
and then Nkind (Parent (Spec_Id)) = N_Block_Statement)
then
Rewrite (N, Make_Identifier (Loc, Name_uResult));
-- The type of formal parameter _Result is that of the function
-- encapsulating the _Postconditions procedure. Resolution must
-- be carried out against the function return type.
Analyze_And_Resolve (N, Etype (Scope (Spec_Id)));
-- Otherwise attribute 'Result appears in its original context and
-- all semantic checks should be carried out.
else
-- Verify the legality of the prefix. It must denotes the entity
-- of the related [generic] function.
if Is_Entity_Name (P) then
Pref_Id := Entity (P);
if Ekind_In (Pref_Id, E_Function, E_Generic_Function)
and then Ekind (Spec_Id) = Ekind (Pref_Id)
then
if Denote_Same_Function (Pref_Id, Spec_Id) then
-- Correct the prefix of the attribute when the context
-- is a generic function.
if Pref_Id /= Spec_Id then
Rewrite (P, New_Occurrence_Of (Spec_Id, Loc));
Analyze (P);
end if;
Set_Etype (N, Etype (Spec_Id));
-- Otherwise the prefix denotes some unrelated function
else
Error_Msg_Name_2 := Chars (Spec_Id);
Error_Attr
("incorrect prefix for attribute %, expected %", P);
end if;
-- Otherwise the prefix denotes some other form of subprogram
-- entity.
else
Error_Attr
("attribute % can only appear in postcondition of "
& "function", P);
end if;
-- Otherwise the prefix is illegal
else
Error_Msg_Name_2 := Chars (Spec_Id);
Error_Attr ("incorrect prefix for attribute %, expected %", P);
end if;
end if;
end Result;
------------------
-- Range_Length --
------------------
when Attribute_Range_Length =>
Check_E0;
Check_Discrete_Type;
Set_Etype (N, Universal_Integer);
----------
-- Read --
----------
when Attribute_Read =>
Check_E2;
Check_Stream_Attribute (TSS_Stream_Read);
Set_Etype (N, Standard_Void_Type);
Resolve (N, Standard_Void_Type);
Note_Possible_Modification (E2, Sure => True);
---------
-- Ref --
---------
when Attribute_Ref =>
Check_E1;
Analyze (P);
if Nkind (P) /= N_Expanded_Name
or else not Is_RTE (P_Type, RE_Address)
then
Error_Attr_P ("prefix of % attribute must be System.Address");
end if;
Analyze_And_Resolve (E1, Any_Integer);
Set_Etype (N, RTE (RE_Address));
---------------
-- Remainder --
---------------
when Attribute_Remainder =>
Check_Floating_Point_Type_2;
Set_Etype (N, P_Base_Type);
Resolve (E1, P_Base_Type);
Resolve (E2, P_Base_Type);
---------------------
-- Restriction_Set --
---------------------
when Attribute_Restriction_Set => Restriction_Set : declare
R : Restriction_Id;
U : Node_Id;
Unam : Unit_Name_Type;
begin
Check_E1;
Analyze (P);
Check_System_Prefix;
-- No_Dependence case
if Nkind (E1) = N_Parameter_Association then
pragma Assert (Chars (Selector_Name (E1)) = Name_No_Dependence);
U := Explicit_Actual_Parameter (E1);
if not OK_No_Dependence_Unit_Name (U) then
Set_Boolean_Result (N, False);
Error_Attr;
end if;
-- See if there is an entry already in the table. That's the
-- case in which we can return True.
for J in No_Dependences.First .. No_Dependences.Last loop
if Designate_Same_Unit (U, No_Dependences.Table (J).Unit)
and then No_Dependences.Table (J).Warn = False
then
Set_Boolean_Result (N, True);
return;
end if;
end loop;
-- If not in the No_Dependence table, result is False
Set_Boolean_Result (N, False);
-- In this case, we must ensure that the binder will reject any
-- other unit in the partition that sets No_Dependence for this
-- unit. We do that by making an entry in the special table kept
-- for this purpose (if the entry is not there already).
Unam := Get_Spec_Name (Get_Unit_Name (U));
for J in Restriction_Set_Dependences.First ..
Restriction_Set_Dependences.Last
loop
if Restriction_Set_Dependences.Table (J) = Unam then
return;
end if;
end loop;
Restriction_Set_Dependences.Append (Unam);
-- Normal restriction case
else
if Nkind (E1) /= N_Identifier then
Set_Boolean_Result (N, False);
Error_Attr ("attribute % requires restriction identifier", E1);
else
R := Get_Restriction_Id (Process_Restriction_Synonyms (E1));
if R = Not_A_Restriction_Id then
Set_Boolean_Result (N, False);
Error_Msg_Node_1 := E1;
Error_Attr ("invalid restriction identifier &", E1);
elsif R not in Partition_Boolean_Restrictions then
Set_Boolean_Result (N, False);
Error_Msg_Node_1 := E1;
Error_Attr
("& is not a boolean partition-wide restriction", E1);
end if;
if Restriction_Active (R) then
Set_Boolean_Result (N, True);
else
Check_Restriction (R, N);
Set_Boolean_Result (N, False);
end if;
end if;
end if;
end Restriction_Set;
-----------
-- Round --
-----------
when Attribute_Round =>
Check_E1;
Check_Decimal_Fixed_Point_Type;
Set_Etype (N, P_Base_Type);
-- Because the context is universal_real (3.5.10(12)) it is a
-- legal context for a universal fixed expression. This is the
-- only attribute whose functional description involves U_R.
if Etype (E1) = Universal_Fixed then
declare
Conv : constant Node_Id := Make_Type_Conversion (Loc,
Subtype_Mark => New_Occurrence_Of (Universal_Real, Loc),
Expression => Relocate_Node (E1));
begin
Rewrite (E1, Conv);
Analyze (E1);
end;
end if;
Resolve (E1, Any_Real);
--------------
-- Rounding --
--------------
when Attribute_Rounding =>
Check_Floating_Point_Type_1;
Set_Etype (N, P_Base_Type);
Resolve (E1, P_Base_Type);
---------------
-- Safe_Emax --
---------------
when Attribute_Safe_Emax =>
Check_Floating_Point_Type_0;
Set_Etype (N, Universal_Integer);
----------------
-- Safe_First --
----------------
when Attribute_Safe_First =>
Check_Floating_Point_Type_0;
Set_Etype (N, Universal_Real);
----------------
-- Safe_Large --
----------------
when Attribute_Safe_Large =>
Check_E0;
Check_Real_Type;
Set_Etype (N, Universal_Real);
---------------
-- Safe_Last --
---------------
when Attribute_Safe_Last =>
Check_Floating_Point_Type_0;
Set_Etype (N, Universal_Real);
----------------
-- Safe_Small --
----------------
when Attribute_Safe_Small =>
Check_E0;
Check_Real_Type;
Set_Etype (N, Universal_Real);
--------------------------
-- Scalar_Storage_Order --
--------------------------
when Attribute_Scalar_Storage_Order => Scalar_Storage_Order : declare
Ent : Entity_Id := Empty;
begin
Check_E0;
Check_Type;
if not (Is_Record_Type (P_Type) or else Is_Array_Type (P_Type)) then
-- In GNAT mode, the attribute applies to generic types as well
-- as composite types, and for non-composite types always returns
-- the default bit order for the target.
if not (GNAT_Mode and then Is_Generic_Type (P_Type))
and then not In_Instance
then
Error_Attr_P
("prefix of % attribute must be record or array type");
elsif not Is_Generic_Type (P_Type) then
if Bytes_Big_Endian then
Ent := RTE (RE_High_Order_First);
else
Ent := RTE (RE_Low_Order_First);
end if;
end if;
elsif Bytes_Big_Endian xor Reverse_Storage_Order (P_Type) then
Ent := RTE (RE_High_Order_First);
else
Ent := RTE (RE_Low_Order_First);
end if;
if Present (Ent) then
Rewrite (N, New_Occurrence_Of (Ent, Loc));
end if;
Set_Etype (N, RTE (RE_Bit_Order));
Resolve (N);
-- Reset incorrect indication of staticness
Set_Is_Static_Expression (N, False);
end Scalar_Storage_Order;
-----------
-- Scale --
-----------
when Attribute_Scale =>
Check_E0;
Check_Decimal_Fixed_Point_Type;
Set_Etype (N, Universal_Integer);
-------------
-- Scaling --
-------------
when Attribute_Scaling =>
Check_Floating_Point_Type_2;
Set_Etype (N, P_Base_Type);
Resolve (E1, P_Base_Type);
------------------
-- Signed_Zeros --
------------------
when Attribute_Signed_Zeros =>
Check_Floating_Point_Type_0;
Set_Etype (N, Standard_Boolean);
----------
-- Size --
----------
when Attribute_Size
| Attribute_VADS_Size
=>
Check_E0;
-- If prefix is parameterless function call, rewrite and resolve
-- as such.
if Is_Entity_Name (P)
and then Ekind (Entity (P)) = E_Function
then
Resolve (P);
-- Similar processing for a protected function call
elsif Nkind (P) = N_Selected_Component
and then Ekind (Entity (Selector_Name (P))) = E_Function
then
Resolve (P);
end if;
if Is_Object_Reference (P) then
Check_Object_Reference (P);
elsif Is_Entity_Name (P)
and then (Is_Type (Entity (P))
or else Ekind (Entity (P)) = E_Enumeration_Literal)
then
null;
elsif Nkind (P) = N_Type_Conversion
and then not Comes_From_Source (P)
then
null;
-- Some other compilers allow dubious use of X'???'Size
elsif Relaxed_RM_Semantics
and then Nkind (P) = N_Attribute_Reference
then
null;
else
Error_Attr_P ("invalid prefix for % attribute");
end if;
Check_Not_Incomplete_Type;
Check_Not_CPP_Type;
Set_Etype (N, Universal_Integer);
-- If we are processing pragmas Compile_Time_Warning and Compile_
-- Time_Errors after the back end has been called and this occurrence
-- of 'Size is known at compile time then it is safe to perform this
-- evaluation. Needed to perform the static evaluation of the full
-- boolean expression of these pragmas.
if In_Compile_Time_Warning_Or_Error
and then Is_Entity_Name (P)
and then (Is_Type (Entity (P))
or else Ekind (Entity (P)) = E_Enumeration_Literal)
and then Size_Known_At_Compile_Time (Entity (P))
then
Rewrite (N, Make_Integer_Literal (Sloc (N), Esize (Entity (P))));
Analyze (N);
end if;
-----------
-- Small --
-----------
when Attribute_Small =>
Check_E0;
Check_Real_Type;
Set_Etype (N, Universal_Real);
------------------
-- Storage_Pool --
------------------
when Attribute_Storage_Pool
| Attribute_Simple_Storage_Pool
=>
Check_E0;
if Is_Access_Type (P_Type) then
if Ekind (P_Type) = E_Access_Subprogram_Type then
Error_Attr_P
("cannot use % attribute for access-to-subprogram type");
end if;
-- Set appropriate entity
if Present (Associated_Storage_Pool (Root_Type (P_Type))) then
Set_Entity (N, Associated_Storage_Pool (Root_Type (P_Type)));
else
Set_Entity (N, RTE (RE_Global_Pool_Object));
end if;
if Attr_Id = Attribute_Storage_Pool then
if Present (Get_Rep_Pragma (Etype (Entity (N)),
Name_Simple_Storage_Pool_Type))
then
Error_Msg_Name_1 := Aname;
Error_Msg_Warn := SPARK_Mode /= On;
Error_Msg_N
("cannot use % attribute for type with simple storage "
& "pool<<", N);
Error_Msg_N ("\Program_Error [<<", N);
Rewrite
(N, Make_Raise_Program_Error
(Sloc (N), Reason => PE_Explicit_Raise));
end if;
Set_Etype (N, Class_Wide_Type (RTE (RE_Root_Storage_Pool)));
-- In the Simple_Storage_Pool case, verify that the pool entity is
-- actually of a simple storage pool type, and set the attribute's
-- type to the pool object's type.
else
if not Present (Get_Rep_Pragma (Etype (Entity (N)),
Name_Simple_Storage_Pool_Type))
then
Error_Attr_P
("cannot use % attribute for type without simple " &
"storage pool");
end if;
Set_Etype (N, Etype (Entity (N)));
end if;
-- Validate_Remote_Access_To_Class_Wide_Type for attribute
-- Storage_Pool since this attribute is not defined for such
-- types (RM E.2.3(22)).
Validate_Remote_Access_To_Class_Wide_Type (N);
else
Error_Attr_P ("prefix of % attribute must be access type");
end if;
------------------
-- Storage_Size --
------------------
when Attribute_Storage_Size =>
Check_E0;
if Is_Task_Type (P_Type) then
Set_Etype (N, Universal_Integer);
-- Use with tasks is an obsolescent feature
Check_Restriction (No_Obsolescent_Features, P);
elsif Is_Access_Type (P_Type) then
if Ekind (P_Type) = E_Access_Subprogram_Type then
Error_Attr_P
("cannot use % attribute for access-to-subprogram type");
end if;
if Is_Entity_Name (P)
and then Is_Type (Entity (P))
then
Check_Type;
Set_Etype (N, Universal_Integer);
-- Validate_Remote_Access_To_Class_Wide_Type for attribute
-- Storage_Size since this attribute is not defined for
-- such types (RM E.2.3(22)).
Validate_Remote_Access_To_Class_Wide_Type (N);
-- The prefix is allowed to be an implicit dereference of an
-- access value designating a task.
else
Check_Task_Prefix;
Set_Etype (N, Universal_Integer);
end if;
else
Error_Attr_P ("prefix of % attribute must be access or task type");
end if;
------------------
-- Storage_Unit --
------------------
when Attribute_Storage_Unit =>
Standard_Attribute (Ttypes.System_Storage_Unit);
-----------------
-- Stream_Size --
-----------------
when Attribute_Stream_Size =>
Check_E0;
Check_Type;
if Is_Entity_Name (P)
and then Is_Elementary_Type (Entity (P))
then
Set_Etype (N, Universal_Integer);
else
Error_Attr_P ("invalid prefix for % attribute");
end if;
---------------
-- Stub_Type --
---------------
when Attribute_Stub_Type =>
Check_Type;
Check_E0;
if Is_Remote_Access_To_Class_Wide_Type (Base_Type (P_Type)) then
-- For a real RACW [sub]type, use corresponding stub type
if not Is_Generic_Type (P_Type) then
Rewrite (N,
New_Occurrence_Of
(Corresponding_Stub_Type (Base_Type (P_Type)), Loc));
-- For a generic type (that has been marked as an RACW using the
-- Remote_Access_Type aspect or pragma), use a generic RACW stub
-- type. Note that if the actual is not a remote access type, the
-- instantiation will fail.
else
-- Note: we go to the underlying type here because the view
-- returned by RTE (RE_RACW_Stub_Type) might be incomplete.
Rewrite (N,
New_Occurrence_Of
(Underlying_Type (RTE (RE_RACW_Stub_Type)), Loc));
end if;
else
Error_Attr_P
("prefix of% attribute must be remote access-to-class-wide");
end if;
----------
-- Succ --
----------
when Attribute_Succ =>
Check_Scalar_Type;
Check_E1;
if Is_Real_Type (P_Type) or else Is_Boolean_Type (P_Type) then
Error_Msg_Name_1 := Aname;
Error_Msg_Name_2 := Chars (P_Type);
Check_SPARK_05_Restriction
("attribute% is not allowed for type%", P);
end if;
Resolve (E1, P_Base_Type);
Set_Etype (N, P_Base_Type);
-- Since Pred works on the base type, we normally do no check for the
-- floating-point case, since the base type is unconstrained. But we
-- make an exception in Check_Float_Overflow mode.
if Is_Floating_Point_Type (P_Type) then
if not Range_Checks_Suppressed (P_Base_Type) then
Set_Do_Range_Check (E1);
end if;
-- If not modular type, test for overflow check required
else
if not Is_Modular_Integer_Type (P_Type)
and then not Range_Checks_Suppressed (P_Base_Type)
then
Enable_Range_Check (E1);
end if;
end if;
--------------------------------
-- System_Allocator_Alignment --
--------------------------------
when Attribute_System_Allocator_Alignment =>
Standard_Attribute (Ttypes.System_Allocator_Alignment);
---------
-- Tag --
---------
when Attribute_Tag =>
Check_E0;
Check_Dereference;
if not Is_Tagged_Type (P_Type) then
Error_Attr_P ("prefix of % attribute must be tagged");
-- Next test does not apply to generated code why not, and what does
-- the illegal reference mean???
elsif Is_Object_Reference (P)
and then not Is_Class_Wide_Type (P_Type)
and then Comes_From_Source (N)
then
Error_Attr_P
("% attribute can only be applied to objects " &
"of class - wide type");
end if;
-- The prefix cannot be an incomplete type. However, references to
-- 'Tag can be generated when expanding interface conversions, and
-- this is legal.
if Comes_From_Source (N) then
Check_Not_Incomplete_Type;
end if;
-- Set appropriate type
Set_Etype (N, RTE (RE_Tag));
-----------------
-- Target_Name --
-----------------
when Attribute_Target_Name => Target_Name : declare
TN : constant String := Sdefault.Target_Name.all;
TL : Natural;
begin
Check_Standard_Prefix;
TL := TN'Last;
if TN (TL) = '/' or else TN (TL) = '\' then
TL := TL - 1;
end if;
Rewrite (N,
Make_String_Literal (Loc,
Strval => TN (TN'First .. TL)));
Analyze_And_Resolve (N, Standard_String);
Set_Is_Static_Expression (N, True);
end Target_Name;
----------------
-- Terminated --
----------------
when Attribute_Terminated =>
Check_E0;
Set_Etype (N, Standard_Boolean);
Check_Task_Prefix;
----------------
-- To_Address --
----------------
when Attribute_To_Address => To_Address : declare
Val : Uint;
begin
Check_E1;
Analyze (P);
Check_System_Prefix;
Generate_Reference (RTE (RE_Address), P);
Analyze_And_Resolve (E1, Any_Integer);
Set_Etype (N, RTE (RE_Address));
if Is_Static_Expression (E1) then
Set_Is_Static_Expression (N, True);
end if;
-- OK static expression case, check range and set appropriate type
if Is_OK_Static_Expression (E1) then
Val := Expr_Value (E1);
if Val < -(2 ** UI_From_Int (Standard'Address_Size - 1))
or else
Val > 2 ** UI_From_Int (Standard'Address_Size) - 1
then
Error_Attr ("address value out of range for % attribute", E1);
end if;
-- In most cases the expression is a numeric literal or some other
-- address expression, but if it is a declared constant it may be
-- of a compatible type that must be left on the node.
if Is_Entity_Name (E1) then
null;
-- Set type to universal integer if negative
elsif Val < 0 then
Set_Etype (E1, Universal_Integer);
-- Otherwise set type to Unsigned_64 to accomodate max values
else
Set_Etype (E1, Standard_Unsigned_64);
end if;
end if;
Set_Is_Static_Expression (N, True);
end To_Address;
------------
-- To_Any --
------------
when Attribute_To_Any =>
Check_E1;
Check_PolyORB_Attribute;
Set_Etype (N, RTE (RE_Any));
----------------
-- Truncation --
----------------
when Attribute_Truncation =>
Check_Floating_Point_Type_1;
Resolve (E1, P_Base_Type);
Set_Etype (N, P_Base_Type);
----------------
-- Type_Class --
----------------
when Attribute_Type_Class =>
Check_E0;
Check_Type;
Check_Not_Incomplete_Type;
Set_Etype (N, RTE (RE_Type_Class));
--------------
-- TypeCode --
--------------
when Attribute_TypeCode =>
Check_E0;
Check_PolyORB_Attribute;
Set_Etype (N, RTE (RE_TypeCode));
--------------
-- Type_Key --
--------------
when Attribute_Type_Key => Type_Key : declare
Full_Name : constant String_Id :=
Fully_Qualified_Name_String (Entity (P));
CRC : CRC32;
-- The computed signature for the type
Deref : Boolean;
-- To simplify the handling of mutually recursive types, follow a
-- single dereference link in a composite type.
procedure Compute_Type_Key (T : Entity_Id);
-- Create a CRC integer from the declaration of the type, For a
-- composite type, fold in the representation of its components in
-- recursive fashion. We use directly the source representation of
-- the types involved.
----------------------
-- Compute_Type_Key --
----------------------
procedure Compute_Type_Key (T : Entity_Id) is
Buffer : Source_Buffer_Ptr;
P_Max : Source_Ptr;
P_Min : Source_Ptr;
Rep : Node_Id;
SFI : Source_File_Index;
procedure Process_One_Declaration;
-- Update CRC with the characters of one type declaration, or a
-- representation pragma that applies to the type.
-----------------------------
-- Process_One_Declaration --
-----------------------------
procedure Process_One_Declaration is
Ptr : Source_Ptr;
begin
Ptr := P_Min;
-- Scan type declaration, skipping blanks
while Ptr <= P_Max loop
if Buffer (Ptr) /= ' ' then
System.CRC32.Update (CRC, Buffer (Ptr));
end if;
Ptr := Ptr + 1;
end loop;
end Process_One_Declaration;
-- Start of processing for Compute_Type_Key
begin
if Is_Itype (T) then
return;
end if;
Sloc_Range (Enclosing_Declaration (T), P_Min, P_Max);
SFI := Get_Source_File_Index (P_Min);
Buffer := Source_Text (SFI);
Process_One_Declaration;
-- Recurse on relevant component types
if Is_Array_Type (T) then
Compute_Type_Key (Component_Type (T));
elsif Is_Access_Type (T) then
if not Deref then
Deref := True;
Compute_Type_Key (Designated_Type (T));
end if;
elsif Is_Derived_Type (T) then
Compute_Type_Key (Etype (T));
elsif Is_Record_Type (T) then
declare
Comp : Entity_Id;
begin
Comp := First_Component (T);
while Present (Comp) loop
Compute_Type_Key (Etype (Comp));
Next_Component (Comp);
end loop;
end;
end if;
-- Fold in representation aspects for the type, which appear in
-- the same source buffer.
Rep := First_Rep_Item (T);
while Present (Rep) loop
if Comes_From_Source (Rep) then
Sloc_Range (Rep, P_Min, P_Max);
Process_One_Declaration;
end if;
Rep := Next_Rep_Item (Rep);
end loop;
end Compute_Type_Key;
-- Start of processing for Type_Key
begin
Check_E0;
Check_Type;
Start_String;
Deref := False;
-- Copy all characters in Full_Name but the trailing NUL
for J in 1 .. String_Length (Full_Name) - 1 loop
Store_String_Char (Get_String_Char (Full_Name, Pos (J)));
end loop;
-- For standard types return the name of the type, as there is no
-- explicit source declaration to use. Otherwise compute CRC and
-- convert it to string one character at a time, so as not to use
-- Image within the compiler.
if Scope (Entity (P)) /= Standard_Standard then
Initialize (CRC);
Compute_Type_Key (Entity (P));
if not Is_Frozen (Entity (P)) then
Error_Msg_N ("premature usage of Type_Key?", N);
end if;
while CRC > 0 loop
Store_String_Char (Character'Val (48 + (CRC rem 10)));
CRC := CRC / 10;
end loop;
end if;
Rewrite (N, Make_String_Literal (Loc, End_String));
Analyze_And_Resolve (N, Standard_String);
end Type_Key;
-----------------------
-- Unbiased_Rounding --
-----------------------
when Attribute_Unbiased_Rounding =>
Check_Floating_Point_Type_1;
Set_Etype (N, P_Base_Type);
Resolve (E1, P_Base_Type);
----------------------
-- Unchecked_Access --
----------------------
when Attribute_Unchecked_Access =>
if Comes_From_Source (N) then
Check_Restriction (No_Unchecked_Access, N);
end if;
Analyze_Access_Attribute;
Check_Not_Incomplete_Type;
-------------------------
-- Unconstrained_Array --
-------------------------
when Attribute_Unconstrained_Array =>
Check_E0;
Check_Type;
Check_Not_Incomplete_Type;
Set_Etype (N, Standard_Boolean);
Set_Is_Static_Expression (N, True);
------------------------------
-- Universal_Literal_String --
------------------------------
-- This is a GNAT specific attribute whose prefix must be a named
-- number where the expression is either a single numeric literal,
-- or a numeric literal immediately preceded by a minus sign. The
-- result is equivalent to a string literal containing the text of
-- the literal as it appeared in the source program with a possible
-- leading minus sign.
when Attribute_Universal_Literal_String =>
Check_E0;
if not Is_Entity_Name (P)
or else Ekind (Entity (P)) not in Named_Kind
then
Error_Attr_P ("prefix for % attribute must be named number");
else
declare
Expr : Node_Id;
Negative : Boolean;
S : Source_Ptr;
Src : Source_Buffer_Ptr;
begin
Expr := Original_Node (Expression (Parent (Entity (P))));
if Nkind (Expr) = N_Op_Minus then
Negative := True;
Expr := Original_Node (Right_Opnd (Expr));
else
Negative := False;
end if;
if not Nkind_In (Expr, N_Integer_Literal, N_Real_Literal) then
Error_Attr
("named number for % attribute must be simple literal", N);
end if;
-- Build string literal corresponding to source literal text
Start_String;
if Negative then
Store_String_Char (Get_Char_Code ('-'));
end if;
S := Sloc (Expr);
Src := Source_Text (Get_Source_File_Index (S));
while Src (S) /= ';' and then Src (S) /= ' ' loop
Store_String_Char (Get_Char_Code (Src (S)));
S := S + 1;
end loop;
-- Now we rewrite the attribute with the string literal
Rewrite (N,
Make_String_Literal (Loc, End_String));
Analyze (N);
Set_Is_Static_Expression (N, True);
end;
end if;
-------------------------
-- Unrestricted_Access --
-------------------------
-- This is a GNAT specific attribute which is like Access except that
-- all scope checks and checks for aliased views are omitted. It is
-- documented as being equivalent to the use of the Address attribute
-- followed by an unchecked conversion to the target access type.
when Attribute_Unrestricted_Access =>
-- If from source, deal with relevant restrictions
if Comes_From_Source (N) then
Check_Restriction (No_Unchecked_Access, N);
if Nkind (P) in N_Has_Entity
and then Present (Entity (P))
and then Is_Object (Entity (P))
then
Check_Restriction (No_Implicit_Aliasing, N);
end if;
end if;
if Is_Entity_Name (P) then
Set_Address_Taken (Entity (P));
end if;
-- It might seem reasonable to call Address_Checks here to apply the
-- same set of semantic checks that we enforce for 'Address (after
-- all we document Unrestricted_Access as being equivalent to the
-- use of Address followed by an Unchecked_Conversion). However, if
-- we do enable these checks, we get multiple failures in both the
-- compiler run-time and in our regression test suite, so we leave
-- out these checks for now. To be investigated further some time???
-- Address_Checks;
-- Now complete analysis using common access processing
Analyze_Access_Attribute;
------------
-- Update --
------------
when Attribute_Update => Update : declare
Common_Typ : Entity_Id;
-- The common type of a multiple component update for a record
Comps : Elist_Id := No_Elist;
-- A list used in the resolution of a record update. It contains the
-- entities of all record components processed so far.
procedure Analyze_Array_Component_Update (Assoc : Node_Id);
-- Analyze and resolve array_component_association Assoc against the
-- index of array type P_Type.
procedure Analyze_Record_Component_Update (Comp : Node_Id);
-- Analyze and resolve record_component_association Comp against
-- record type P_Type.
------------------------------------
-- Analyze_Array_Component_Update --
------------------------------------
procedure Analyze_Array_Component_Update (Assoc : Node_Id) is
Expr : Node_Id;
High : Node_Id;
Index : Node_Id;
Index_Typ : Entity_Id;
Low : Node_Id;
begin
-- The current association contains a sequence of indexes denoting
-- an element of a multidimensional array:
-- (Index_1, ..., Index_N)
-- Examine each individual index and resolve it against the proper
-- index type of the array.
if Nkind (First (Choices (Assoc))) = N_Aggregate then
Expr := First (Choices (Assoc));
while Present (Expr) loop
-- The use of others is illegal (SPARK RM 4.4.1(12))
if Nkind (Expr) = N_Others_Choice then
Error_Attr
("others choice not allowed in attribute %", Expr);
-- Otherwise analyze and resolve all indexes
else
Index := First (Expressions (Expr));
Index_Typ := First_Index (P_Type);
while Present (Index) and then Present (Index_Typ) loop
Analyze_And_Resolve (Index, Etype (Index_Typ));
Next (Index);
Next_Index (Index_Typ);
end loop;
-- Detect a case where the association either lacks an
-- index or contains an extra index.
if Present (Index) or else Present (Index_Typ) then
Error_Msg_N
("dimension mismatch in index list", Assoc);
end if;
end if;
Next (Expr);
end loop;
-- The current association denotes either a single component or a
-- range of components of a one dimensional array:
-- 1, 2 .. 5
-- Resolve the index or its high and low bounds (if range) against
-- the proper index type of the array.
else
Index := First (Choices (Assoc));
Index_Typ := First_Index (P_Type);
if Present (Next_Index (Index_Typ)) then
Error_Msg_N ("too few subscripts in array reference", Assoc);
end if;
while Present (Index) loop
-- The use of others is illegal (SPARK RM 4.4.1(12))
if Nkind (Index) = N_Others_Choice then
Error_Attr
("others choice not allowed in attribute %", Index);
-- The index denotes a range of elements
elsif Nkind (Index) = N_Range then
Low := Low_Bound (Index);
High := High_Bound (Index);
Analyze_And_Resolve (Low, Etype (Index_Typ));
Analyze_And_Resolve (High, Etype (Index_Typ));
-- Add a range check to ensure that the bounds of the
-- range are within the index type when this cannot be
-- determined statically.
if not Is_OK_Static_Expression (Low) then
Set_Do_Range_Check (Low);
end if;
if not Is_OK_Static_Expression (High) then
Set_Do_Range_Check (High);
end if;
-- Otherwise the index denotes a single element
else
Analyze_And_Resolve (Index, Etype (Index_Typ));
-- Add a range check to ensure that the index is within
-- the index type when it is not possible to determine
-- this statically.
if not Is_OK_Static_Expression (Index) then
Set_Do_Range_Check (Index);
end if;
end if;
Next (Index);
end loop;
end if;
end Analyze_Array_Component_Update;
-------------------------------------
-- Analyze_Record_Component_Update --
-------------------------------------
procedure Analyze_Record_Component_Update (Comp : Node_Id) is
Comp_Name : constant Name_Id := Chars (Comp);
Base_Typ : Entity_Id;
Comp_Or_Discr : Entity_Id;
begin
-- Find the discriminant or component whose name corresponds to
-- Comp. A simple character comparison is sufficient because all
-- visible names within a record type are unique.
Comp_Or_Discr := First_Entity (P_Type);
while Present (Comp_Or_Discr) loop
if Chars (Comp_Or_Discr) = Comp_Name then
-- Decorate the component reference by setting its entity
-- and type for resolution purposes.
Set_Entity (Comp, Comp_Or_Discr);
Set_Etype (Comp, Etype (Comp_Or_Discr));
exit;
end if;
Comp_Or_Discr := Next_Entity (Comp_Or_Discr);
end loop;
-- Diagnose an illegal reference
if Present (Comp_Or_Discr) then
if Ekind (Comp_Or_Discr) = E_Discriminant then
Error_Attr
("attribute % may not modify record discriminants", Comp);
else pragma Assert (Ekind (Comp_Or_Discr) = E_Component);
if Contains (Comps, Comp_Or_Discr) then
Error_Msg_N ("component & already updated", Comp);
-- Mark this component as processed
else
Append_New_Elmt (Comp_Or_Discr, Comps);
end if;
end if;
-- The update aggregate mentions an entity that does not belong to
-- the record type.
else
Error_Msg_N ("& is not a component of aggregate subtype", Comp);
end if;
-- Verify the consistency of types when the current component is
-- part of a miltiple component update.
-- Comp_1, ..., Comp_N => <value>
if Present (Etype (Comp)) then
Base_Typ := Base_Type (Etype (Comp));
-- Save the type of the first component reference as the
-- remaning references (if any) must resolve to this type.
if No (Common_Typ) then
Common_Typ := Base_Typ;
elsif Base_Typ /= Common_Typ then
Error_Msg_N
("components in choice list must have same type", Comp);
end if;
end if;
end Analyze_Record_Component_Update;
-- Local variables
Assoc : Node_Id;
Comp : Node_Id;
-- Start of processing for Update
begin
Check_E1;
if not Is_Object_Reference (P) then
Error_Attr_P ("prefix of attribute % must denote an object");
elsif not Is_Array_Type (P_Type)
and then not Is_Record_Type (P_Type)
then
Error_Attr_P ("prefix of attribute % must be a record or array");
elsif Is_Limited_View (P_Type) then
Error_Attr ("prefix of attribute % cannot be limited", N);
elsif Nkind (E1) /= N_Aggregate then
Error_Attr ("attribute % requires component association list", N);
end if;
-- Inspect the update aggregate, looking at all the associations and
-- choices. Perform the following checks:
-- 1) Legality of "others" in all cases
-- 2) Legality of <>
-- 3) Component legality for arrays
-- 4) Component legality for records
-- The remaining checks are performed on the expanded attribute
Assoc := First (Component_Associations (E1));
while Present (Assoc) loop
-- The use of <> is illegal (SPARK RM 4.4.1(1))
if Box_Present (Assoc) then
Error_Attr
("default initialization not allowed in attribute %", Assoc);
-- Otherwise process the association
else
Analyze (Expression (Assoc));
if Is_Array_Type (P_Type) then
Analyze_Array_Component_Update (Assoc);
elsif Is_Record_Type (P_Type) then
-- Reset the common type used in a multiple component update
-- as we are processing the contents of a new association.
Common_Typ := Empty;
Comp := First (Choices (Assoc));
while Present (Comp) loop
if Nkind (Comp) = N_Identifier then
Analyze_Record_Component_Update (Comp);
-- The use of others is illegal (SPARK RM 4.4.1(5))
elsif Nkind (Comp) = N_Others_Choice then
Error_Attr
("others choice not allowed in attribute %", Comp);
-- The name of a record component cannot appear in any
-- other form.
else
Error_Msg_N
("name should be identifier or OTHERS", Comp);
end if;
Next (Comp);
end loop;
end if;
end if;
Next (Assoc);
end loop;
-- The type of attribute 'Update is that of the prefix
Set_Etype (N, P_Type);
Sem_Warn.Warn_On_Suspicious_Update (N);
end Update;
---------
-- Val --
---------
when Attribute_Val =>
Check_E1;
Check_Discrete_Type;
if Is_Boolean_Type (P_Type) then
Error_Msg_Name_1 := Aname;
Error_Msg_Name_2 := Chars (P_Type);
Check_SPARK_05_Restriction
("attribute% is not allowed for type%", P);
end if;
-- Note, we need a range check in general, but we wait for the
-- Resolve call to do this, since we want to let Eval_Attribute
-- have a chance to find an static illegality first.
Resolve (E1, Any_Integer);
Set_Etype (N, P_Base_Type);
-----------
-- Valid --
-----------
when Attribute_Valid =>
Check_E0;
-- Ignore check for object if we have a 'Valid reference generated
-- by the expanded code, since in some cases valid checks can occur
-- on items that are names, but are not objects (e.g. attributes).
if Comes_From_Source (N) then
Check_Object_Reference (P);
end if;
if not Is_Scalar_Type (P_Type) then
Error_Attr_P ("object for % attribute must be of scalar type");
end if;
-- If the attribute appears within the subtype's own predicate
-- function, then issue a warning that this will cause infinite
-- recursion.
declare
Pred_Func : constant Entity_Id := Predicate_Function (P_Type);
begin
if Present (Pred_Func) and then Current_Scope = Pred_Func then
Error_Msg_N
("attribute Valid requires a predicate check??", N);
Error_Msg_N ("\and will result in infinite recursion??", N);
end if;
end;
Set_Etype (N, Standard_Boolean);
-------------------
-- Valid_Scalars --
-------------------
when Attribute_Valid_Scalars =>
Check_E0;
Check_Object_Reference (P);
Set_Etype (N, Standard_Boolean);
-- Following checks are only for source types
if Comes_From_Source (N) then
if not Scalar_Part_Present (P_Type) then
Error_Attr_P
("??attribute % always True, no scalars to check");
end if;
-- Not allowed for unchecked union type
if Has_Unchecked_Union (P_Type) then
Error_Attr_P
("attribute % not allowed for Unchecked_Union type");
end if;
end if;
-----------
-- Value --
-----------
when Attribute_Value =>
Check_SPARK_05_Restriction_On_Attribute;
Check_E1;
Check_Scalar_Type;
-- Case of enumeration type
-- When an enumeration type appears in an attribute reference, all
-- literals of the type are marked as referenced. This must only be
-- done if the attribute reference appears in the current source.
-- Otherwise the information on references may differ between a
-- normal compilation and one that performs inlining.
if Is_Enumeration_Type (P_Type)
and then In_Extended_Main_Code_Unit (N)
then
Check_Restriction (No_Enumeration_Maps, N);
-- Mark all enumeration literals as referenced, since the use of
-- the Value attribute can implicitly reference any of the
-- literals of the enumeration base type.
declare
Ent : Entity_Id := First_Literal (P_Base_Type);
begin
while Present (Ent) loop
Set_Referenced (Ent);
Next_Literal (Ent);
end loop;
end;
end if;
-- Set Etype before resolving expression because expansion of
-- expression may require enclosing type. Note that the type
-- returned by 'Value is the base type of the prefix type.
Set_Etype (N, P_Base_Type);
Validate_Non_Static_Attribute_Function_Call;
-- Check restriction No_Fixed_IO
if Restriction_Check_Required (No_Fixed_IO)
and then Is_Fixed_Point_Type (P_Type)
then
Check_Restriction (No_Fixed_IO, P);
end if;
----------------
-- Value_Size --
----------------
when Attribute_Value_Size =>
Check_E0;
Check_Type;
Check_Not_Incomplete_Type;
Set_Etype (N, Universal_Integer);
-------------
-- Version --
-------------
when Attribute_Version =>
Check_E0;
Check_Program_Unit;
Set_Etype (N, RTE (RE_Version_String));
------------------
-- Wchar_T_Size --
------------------
when Attribute_Wchar_T_Size =>
Standard_Attribute (Interfaces_Wchar_T_Size);
----------------
-- Wide_Image --
----------------
when Attribute_Wide_Image =>
Check_SPARK_05_Restriction_On_Attribute;
Check_Scalar_Type;
Set_Etype (N, Standard_Wide_String);
Check_E1;
Resolve (E1, P_Base_Type);
Validate_Non_Static_Attribute_Function_Call;
-- Check restriction No_Fixed_IO
if Restriction_Check_Required (No_Fixed_IO)
and then Is_Fixed_Point_Type (P_Type)
then
Check_Restriction (No_Fixed_IO, P);
end if;
---------------------
-- Wide_Wide_Image --
---------------------
when Attribute_Wide_Wide_Image =>
Check_Scalar_Type;
Set_Etype (N, Standard_Wide_Wide_String);
Check_E1;
Resolve (E1, P_Base_Type);
Validate_Non_Static_Attribute_Function_Call;
-- Check restriction No_Fixed_IO
if Restriction_Check_Required (No_Fixed_IO)
and then Is_Fixed_Point_Type (P_Type)
then
Check_Restriction (No_Fixed_IO, P);
end if;
----------------
-- Wide_Value --
----------------
when Attribute_Wide_Value =>
Check_SPARK_05_Restriction_On_Attribute;
Check_E1;
Check_Scalar_Type;
-- Set Etype before resolving expression because expansion
-- of expression may require enclosing type.
Set_Etype (N, P_Type);
Validate_Non_Static_Attribute_Function_Call;
-- Check restriction No_Fixed_IO
if Restriction_Check_Required (No_Fixed_IO)
and then Is_Fixed_Point_Type (P_Type)
then
Check_Restriction (No_Fixed_IO, P);
end if;
---------------------
-- Wide_Wide_Value --
---------------------
when Attribute_Wide_Wide_Value =>
Check_E1;
Check_Scalar_Type;
-- Set Etype before resolving expression because expansion
-- of expression may require enclosing type.
Set_Etype (N, P_Type);
Validate_Non_Static_Attribute_Function_Call;
-- Check restriction No_Fixed_IO
if Restriction_Check_Required (No_Fixed_IO)
and then Is_Fixed_Point_Type (P_Type)
then
Check_Restriction (No_Fixed_IO, P);
end if;
---------------------
-- Wide_Wide_Width --
---------------------
when Attribute_Wide_Wide_Width =>
Check_E0;
Check_Scalar_Type;
Set_Etype (N, Universal_Integer);
----------------
-- Wide_Width --
----------------
when Attribute_Wide_Width =>
Check_SPARK_05_Restriction_On_Attribute;
Check_E0;
Check_Scalar_Type;
Set_Etype (N, Universal_Integer);
-----------
-- Width --
-----------
when Attribute_Width =>
Check_SPARK_05_Restriction_On_Attribute;
Check_E0;
Check_Scalar_Type;
Set_Etype (N, Universal_Integer);
---------------
-- Word_Size --
---------------
when Attribute_Word_Size =>
Standard_Attribute (System_Word_Size);
-----------
-- Write --
-----------
when Attribute_Write =>
Check_E2;
Check_Stream_Attribute (TSS_Stream_Write);
Set_Etype (N, Standard_Void_Type);
Resolve (N, Standard_Void_Type);
end case;
-- In SPARK certain attributes (see below) depend on Tasking_State.
-- Ensure that the entity is available for gnat2why by loading it.
-- See SPARK RM 9(18) for the relevant rule.
if GNATprove_Mode then
declare
Unused : Entity_Id;
begin
case Attr_Id is
when Attribute_Callable
| Attribute_Caller
| Attribute_Count
| Attribute_Terminated
=>
Unused := RTE (RE_Tasking_State);
when others =>
null;
end case;
end;
end if;
-- All errors raise Bad_Attribute, so that we get out before any further
-- damage occurs when an error is detected (for example, if we check for
-- one attribute expression, and the check succeeds, we want to be able
-- to proceed securely assuming that an expression is in fact present.
-- Note: we set the attribute analyzed in this case to prevent any
-- attempt at reanalysis which could generate spurious error msgs.
exception
when Bad_Attribute =>
Set_Analyzed (N);
Set_Etype (N, Any_Type);
return;
end Analyze_Attribute;
--------------------
-- Eval_Attribute --
--------------------
procedure Eval_Attribute (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Aname : constant Name_Id := Attribute_Name (N);
Id : constant Attribute_Id := Get_Attribute_Id (Aname);
P : constant Node_Id := Prefix (N);
C_Type : constant Entity_Id := Etype (N);
-- The type imposed by the context
E1 : Node_Id;
-- First expression, or Empty if none
E2 : Node_Id;
-- Second expression, or Empty if none
P_Entity : Entity_Id;
-- Entity denoted by prefix
P_Type : Entity_Id;
-- The type of the prefix
P_Base_Type : Entity_Id;
-- The base type of the prefix type
P_Root_Type : Entity_Id;
-- The root type of the prefix type
Static : Boolean;
-- True if the result is Static. This is set by the general processing
-- to true if the prefix is static, and all expressions are static. It
-- can be reset as processing continues for particular attributes. This
-- flag can still be True if the reference raises a constraint error.
-- Is_Static_Expression (N) is set to follow this value as it is set
-- and we could always reference this, but it is convenient to have a
-- simple short name to use, since it is frequently referenced.
Lo_Bound, Hi_Bound : Node_Id;
-- Expressions for low and high bounds of type or array index referenced
-- by First, Last, or Length attribute for array, set by Set_Bounds.
CE_Node : Node_Id;
-- Constraint error node used if we have an attribute reference has
-- an argument that raises a constraint error. In this case we replace
-- the attribute with a raise constraint_error node. This is important
-- processing, since otherwise gigi might see an attribute which it is
-- unprepared to deal with.
procedure Check_Concurrent_Discriminant (Bound : Node_Id);
-- If Bound is a reference to a discriminant of a task or protected type
-- occurring within the object's body, rewrite attribute reference into
-- a reference to the corresponding discriminal. Use for the expansion
-- of checks against bounds of entry family index subtypes.
procedure Check_Expressions;
-- In case where the attribute is not foldable, the expressions, if
-- any, of the attribute, are in a non-static context. This procedure
-- performs the required additional checks.
function Compile_Time_Known_Bounds (Typ : Entity_Id) return Boolean;
-- Determines if the given type has compile time known bounds. Note
-- that we enter the case statement even in cases where the prefix
-- type does NOT have known bounds, so it is important to guard any
-- attempt to evaluate both bounds with a call to this function.
procedure Compile_Time_Known_Attribute (N : Node_Id; Val : Uint);
-- This procedure is called when the attribute N has a non-static
-- but compile time known value given by Val. It includes the
-- necessary checks for out of range values.
function Fore_Value return Nat;
-- Computes the Fore value for the current attribute prefix, which is
-- known to be a static fixed-point type. Used by Fore and Width.
function Mantissa return Uint;
-- Returns the Mantissa value for the prefix type
procedure Set_Bounds;
-- Used for First, Last and Length attributes applied to an array or
-- array subtype. Sets the variables Lo_Bound and Hi_Bound to the low
-- and high bound expressions for the index referenced by the attribute
-- designator (i.e. the first index if no expression is present, and the
-- N'th index if the value N is present as an expression). Also used for
-- First and Last of scalar types and for First_Valid and Last_Valid.
-- Static is reset to False if the type or index type is not statically
-- constrained.
function Statically_Denotes_Entity (N : Node_Id) return Boolean;
-- Verify that the prefix of a potentially static array attribute
-- satisfies the conditions of 4.9 (14).
-----------------------------------
-- Check_Concurrent_Discriminant --
-----------------------------------
procedure Check_Concurrent_Discriminant (Bound : Node_Id) is
Tsk : Entity_Id;
-- The concurrent (task or protected) type
begin
if Nkind (Bound) = N_Identifier
and then Ekind (Entity (Bound)) = E_Discriminant
and then Is_Concurrent_Record_Type (Scope (Entity (Bound)))
then
Tsk := Corresponding_Concurrent_Type (Scope (Entity (Bound)));
if In_Open_Scopes (Tsk) and then Has_Completion (Tsk) then
-- Find discriminant of original concurrent type, and use
-- its current discriminal, which is the renaming within
-- the task/protected body.
Rewrite (N,
New_Occurrence_Of
(Find_Body_Discriminal (Entity (Bound)), Loc));
end if;
end if;
end Check_Concurrent_Discriminant;
-----------------------
-- Check_Expressions --
-----------------------
procedure Check_Expressions is
E : Node_Id;
begin
E := E1;
while Present (E) loop
Check_Non_Static_Context (E);
Next (E);
end loop;
end Check_Expressions;
----------------------------------
-- Compile_Time_Known_Attribute --
----------------------------------
procedure Compile_Time_Known_Attribute (N : Node_Id; Val : Uint) is
T : constant Entity_Id := Etype (N);
begin
Fold_Uint (N, Val, False);
-- Check that result is in bounds of the type if it is static
if Is_In_Range (N, T, Assume_Valid => False) then
null;
elsif Is_Out_Of_Range (N, T) then
Apply_Compile_Time_Constraint_Error
(N, "value not in range of}??", CE_Range_Check_Failed);
elsif not Range_Checks_Suppressed (T) then
Enable_Range_Check (N);
else
Set_Do_Range_Check (N, False);
end if;
end Compile_Time_Known_Attribute;
-------------------------------
-- Compile_Time_Known_Bounds --
-------------------------------
function Compile_Time_Known_Bounds (Typ : Entity_Id) return Boolean is
begin
return
Compile_Time_Known_Value (Type_Low_Bound (Typ))
and then
Compile_Time_Known_Value (Type_High_Bound (Typ));
end Compile_Time_Known_Bounds;
----------------
-- Fore_Value --
----------------
-- Note that the Fore calculation is based on the actual values
-- of the bounds, and does not take into account possible rounding.
function Fore_Value return Nat is
Lo : constant Uint := Expr_Value (Type_Low_Bound (P_Type));
Hi : constant Uint := Expr_Value (Type_High_Bound (P_Type));
Small : constant Ureal := Small_Value (P_Type);
Lo_Real : constant Ureal := Lo * Small;
Hi_Real : constant Ureal := Hi * Small;
T : Ureal;
R : Nat;
begin
-- Bounds are given in terms of small units, so first compute
-- proper values as reals.
T := UR_Max (abs Lo_Real, abs Hi_Real);
R := 2;
-- Loop to compute proper value if more than one digit required
while T >= Ureal_10 loop
R := R + 1;
T := T / Ureal_10;
end loop;
return R;
end Fore_Value;
--------------
-- Mantissa --
--------------
-- Table of mantissa values accessed by function Computed using
-- the relation:
-- T'Mantissa = integer next above (D * log(10)/log(2)) + 1)
-- where D is T'Digits (RM83 3.5.7)
Mantissa_Value : constant array (Nat range 1 .. 40) of Nat := (
1 => 5,
2 => 8,
3 => 11,
4 => 15,
5 => 18,
6 => 21,
7 => 25,
8 => 28,
9 => 31,
10 => 35,
11 => 38,
12 => 41,
13 => 45,
14 => 48,
15 => 51,
16 => 55,
17 => 58,
18 => 61,
19 => 65,
20 => 68,
21 => 71,
22 => 75,
23 => 78,
24 => 81,
25 => 85,
26 => 88,
27 => 91,
28 => 95,
29 => 98,
30 => 101,
31 => 104,
32 => 108,
33 => 111,
34 => 114,
35 => 118,
36 => 121,
37 => 124,
38 => 128,
39 => 131,
40 => 134);
function Mantissa return Uint is
begin
return
UI_From_Int (Mantissa_Value (UI_To_Int (Digits_Value (P_Type))));
end Mantissa;
----------------
-- Set_Bounds --
----------------
procedure Set_Bounds is
Ndim : Nat;
Indx : Node_Id;
Ityp : Entity_Id;
begin
-- For a string literal subtype, we have to construct the bounds.
-- Valid Ada code never applies attributes to string literals, but
-- it is convenient to allow the expander to generate attribute
-- references of this type (e.g. First and Last applied to a string
-- literal).
-- Note that the whole point of the E_String_Literal_Subtype is to
-- avoid this construction of bounds, but the cases in which we
-- have to materialize them are rare enough that we don't worry.
-- The low bound is simply the low bound of the base type. The
-- high bound is computed from the length of the string and this
-- low bound.
if Ekind (P_Type) = E_String_Literal_Subtype then
Ityp := Etype (First_Index (Base_Type (P_Type)));
Lo_Bound := Type_Low_Bound (Ityp);
Hi_Bound :=
Make_Integer_Literal (Sloc (P),
Intval =>
Expr_Value (Lo_Bound) + String_Literal_Length (P_Type) - 1);
Set_Parent (Hi_Bound, P);
Analyze_And_Resolve (Hi_Bound, Etype (Lo_Bound));
return;
-- For non-array case, just get bounds of scalar type
elsif Is_Scalar_Type (P_Type) then
Ityp := P_Type;
-- For a fixed-point type, we must freeze to get the attributes
-- of the fixed-point type set now so we can reference them.
if Is_Fixed_Point_Type (P_Type)
and then not Is_Frozen (Base_Type (P_Type))
and then Compile_Time_Known_Value (Type_Low_Bound (P_Type))
and then Compile_Time_Known_Value (Type_High_Bound (P_Type))
then
Freeze_Fixed_Point_Type (Base_Type (P_Type));
end if;
-- For array case, get type of proper index
else
if No (E1) then
Ndim := 1;
else
Ndim := UI_To_Int (Expr_Value (E1));
end if;
Indx := First_Index (P_Type);
for J in 1 .. Ndim - 1 loop
Next_Index (Indx);
end loop;
-- If no index type, get out (some other error occurred, and
-- we don't have enough information to complete the job).
if No (Indx) then
Lo_Bound := Error;
Hi_Bound := Error;
return;
end if;
Ityp := Etype (Indx);
end if;
-- A discrete range in an index constraint is allowed to be a
-- subtype indication. This is syntactically a pain, but should
-- not propagate to the entity for the corresponding index subtype.
-- After checking that the subtype indication is legal, the range
-- of the subtype indication should be transfered to the entity.
-- The attributes for the bounds should remain the simple retrievals
-- that they are now.
Lo_Bound := Type_Low_Bound (Ityp);
Hi_Bound := Type_High_Bound (Ityp);
-- If subtype is non-static, result is definitely non-static
if not Is_Static_Subtype (Ityp) then
Static := False;
Set_Is_Static_Expression (N, False);
-- Subtype is static, does it raise CE?
elsif not Is_OK_Static_Subtype (Ityp) then
Set_Raises_Constraint_Error (N);
end if;
end Set_Bounds;
-------------------------------
-- Statically_Denotes_Entity --
-------------------------------
function Statically_Denotes_Entity (N : Node_Id) return Boolean is
E : Entity_Id;
begin
if not Is_Entity_Name (N) then
return False;
else
E := Entity (N);
end if;
return
Nkind (Parent (E)) /= N_Object_Renaming_Declaration
or else Statically_Denotes_Entity (Renamed_Object (E));
end Statically_Denotes_Entity;
-- Start of processing for Eval_Attribute
begin
-- Initialize result as non-static, will be reset if appropriate
Set_Is_Static_Expression (N, False);
Static := False;
-- Acquire first two expressions (at the moment, no attributes take more
-- than two expressions in any case).
if Present (Expressions (N)) then
E1 := First (Expressions (N));
E2 := Next (E1);
else
E1 := Empty;
E2 := Empty;
end if;
-- Special processing for Enabled attribute. This attribute has a very
-- special prefix, and the easiest way to avoid lots of special checks
-- to protect this special prefix from causing trouble is to deal with
-- this attribute immediately and be done with it.
if Id = Attribute_Enabled then
-- We skip evaluation if the expander is not active. This is not just
-- an optimization. It is of key importance that we not rewrite the
-- attribute in a generic template, since we want to pick up the
-- setting of the check in the instance, Testing Expander_Active
-- might seem an easy way of doing this, but we need to account for
-- ASIS needs, so check explicitly for a generic context.
if not Inside_A_Generic then
declare
C : constant Check_Id := Get_Check_Id (Chars (P));
R : Boolean;
begin
if No (E1) then
if C in Predefined_Check_Id then
R := Scope_Suppress.Suppress (C);
else
R := Is_Check_Suppressed (Empty, C);
end if;
else
R := Is_Check_Suppressed (Entity (E1), C);
end if;
Rewrite (N, New_Occurrence_Of (Boolean_Literals (not R), Loc));
end;
end if;
return;
end if;
-- Attribute 'Img applied to a static enumeration value is static, and
-- we will do the folding right here (things get confused if we let this
-- case go through the normal circuitry).
if Attribute_Name (N) = Name_Img
and then Is_Entity_Name (P)
and then Is_Enumeration_Type (Etype (Entity (P)))
and then Is_OK_Static_Expression (P)
then
declare
Lit : constant Entity_Id := Expr_Value_E (P);
Str : String_Id;
begin
Start_String;
Get_Unqualified_Decoded_Name_String (Chars (Lit));
Set_Casing (All_Upper_Case);
Store_String_Chars (Name_Buffer (1 .. Name_Len));
Str := End_String;
Rewrite (N, Make_String_Literal (Loc, Strval => Str));
Analyze_And_Resolve (N, Standard_String);
Set_Is_Static_Expression (N, True);
end;
return;
end if;
-- Special processing for cases where the prefix is an object. For this
-- purpose, a string literal counts as an object (attributes of string
-- literals can only appear in generated code).
if Is_Object_Reference (P) or else Nkind (P) = N_String_Literal then
-- For Component_Size, the prefix is an array object, and we apply
-- the attribute to the type of the object. This is allowed for both
-- unconstrained and constrained arrays, since the bounds have no
-- influence on the value of this attribute.
if Id = Attribute_Component_Size then
P_Entity := Etype (P);
-- For Enum_Rep, evaluation depends on the nature of the prefix and
-- the optional argument.
elsif Id = Attribute_Enum_Rep then
if Is_Entity_Name (P) then
declare
Enum_Expr : Node_Id;
-- The enumeration-type expression of interest
begin
-- P'Enum_Rep case
if Ekind_In (Entity (P), E_Constant,
E_Enumeration_Literal)
then
Enum_Expr := P;
-- Enum_Type'Enum_Rep (E1) case
elsif Is_Enumeration_Type (Entity (P)) then
Enum_Expr := E1;
-- Otherwise the attribute must be expanded into a
-- conversion and evaluated at run time.
else
Check_Expressions;
return;
end if;
-- We can fold if the expression is an enumeration
-- literal, or if it denotes a constant whose value
-- is known at compile time.
if Nkind (Enum_Expr) in N_Has_Entity
and then (Ekind (Entity (Enum_Expr)) =
E_Enumeration_Literal
or else
(Ekind (Entity (Enum_Expr)) = E_Constant
and then Nkind (Parent (Entity (Enum_Expr))) =
N_Object_Declaration
and then Compile_Time_Known_Value
(Expression (Parent (Entity (P))))))
then
P_Entity := Etype (P);
else
Check_Expressions;
return;
end if;
end;
-- Otherwise the attribute is illegal, do not attempt to perform
-- any kind of folding.
else
return;
end if;
-- For First and Last, the prefix is an array object, and we apply
-- the attribute to the type of the array, but we need a constrained
-- type for this, so we use the actual subtype if available.
elsif Id = Attribute_First or else
Id = Attribute_Last or else
Id = Attribute_Length
then
declare
AS : constant Entity_Id := Get_Actual_Subtype_If_Available (P);
begin
if Present (AS) and then Is_Constrained (AS) then
P_Entity := AS;
-- If we have an unconstrained type we cannot fold
else
Check_Expressions;
return;
end if;
end;
-- For Size, give size of object if available, otherwise we
-- cannot fold Size.
elsif Id = Attribute_Size then
if Is_Entity_Name (P)
and then Known_Esize (Entity (P))
then
Compile_Time_Known_Attribute (N, Esize (Entity (P)));
return;
else
Check_Expressions;
return;
end if;
-- For Alignment, give size of object if available, otherwise we
-- cannot fold Alignment.
elsif Id = Attribute_Alignment then
if Is_Entity_Name (P)
and then Known_Alignment (Entity (P))
then
Fold_Uint (N, Alignment (Entity (P)), Static);
return;
else
Check_Expressions;
return;
end if;
-- For Lock_Free, we apply the attribute to the type of the object.
-- This is allowed since we have already verified that the type is a
-- protected type.
elsif Id = Attribute_Lock_Free then
P_Entity := Etype (P);
-- No other attributes for objects are folded
else
Check_Expressions;
return;
end if;
-- Cases where P is not an object. Cannot do anything if P is not the
-- name of an entity.
elsif not Is_Entity_Name (P) then
Check_Expressions;
return;
-- Otherwise get prefix entity
else
P_Entity := Entity (P);
end if;
-- If we are asked to evaluate an attribute where the prefix is a
-- non-frozen generic actual type whose RM_Size is still set to zero,
-- then abandon the effort.
if Is_Type (P_Entity)
and then (not Is_Frozen (P_Entity)
and then Is_Generic_Actual_Type (P_Entity)
and then RM_Size (P_Entity) = 0)
-- However, the attribute Unconstrained_Array must be evaluated,
-- since it is documented to be a static attribute (and can for
-- example appear in a Compile_Time_Warning pragma). The frozen
-- status of the type does not affect its evaluation.
and then Id /= Attribute_Unconstrained_Array
then
return;
end if;
-- At this stage P_Entity is the entity to which the attribute
-- is to be applied. This is usually simply the entity of the
-- prefix, except in some cases of attributes for objects, where
-- as described above, we apply the attribute to the object type.
-- Here is where we make sure that static attributes are properly
-- marked as such. These are attributes whose prefix is a static
-- scalar subtype, whose result is scalar, and whose arguments, if
-- present, are static scalar expressions. Note that such references
-- are static expressions even if they raise Constraint_Error.
-- For example, Boolean'Pos (1/0 = 0) is a static expression, even
-- though evaluating it raises constraint error. This means that a
-- declaration like:
-- X : constant := (if True then 1 else Boolean'Pos (1/0 = 0));
-- is legal, since here this expression appears in a statically
-- unevaluated position, so it does not actually raise an exception.
if Is_Scalar_Type (P_Entity)
and then (not Is_Generic_Type (P_Entity))
and then Is_Static_Subtype (P_Entity)
and then Is_Scalar_Type (Etype (N))
and then
(No (E1)
or else (Is_Static_Expression (E1)
and then Is_Scalar_Type (Etype (E1))))
and then
(No (E2)
or else (Is_Static_Expression (E2)
and then Is_Scalar_Type (Etype (E1))))
then
Static := True;
Set_Is_Static_Expression (N, True);
end if;
-- First foldable possibility is a scalar or array type (RM 4.9(7))
-- that is not generic (generic types are eliminated by RM 4.9(25)).
-- Note we allow non-static non-generic types at this stage as further
-- described below.
if Is_Type (P_Entity)
and then (Is_Scalar_Type (P_Entity) or Is_Array_Type (P_Entity))
and then (not Is_Generic_Type (P_Entity))
then
P_Type := P_Entity;
-- Second foldable possibility is an array object (RM 4.9(8))
elsif Ekind_In (P_Entity, E_Variable, E_Constant)
and then Is_Array_Type (Etype (P_Entity))
and then (not Is_Generic_Type (Etype (P_Entity)))
then
P_Type := Etype (P_Entity);
-- If the entity is an array constant with an unconstrained nominal
-- subtype then get the type from the initial value. If the value has
-- been expanded into assignments, there is no expression and the
-- attribute reference remains dynamic.
-- We could do better here and retrieve the type ???
if Ekind (P_Entity) = E_Constant
and then not Is_Constrained (P_Type)
then
if No (Constant_Value (P_Entity)) then
return;
else
P_Type := Etype (Constant_Value (P_Entity));
end if;
end if;
-- Definite must be folded if the prefix is not a generic type, that
-- is to say if we are within an instantiation. Same processing applies
-- to the GNAT attributes Atomic_Always_Lock_Free, Has_Discriminants,
-- Lock_Free, Type_Class, Has_Tagged_Value, and Unconstrained_Array.
elsif (Id = Attribute_Atomic_Always_Lock_Free or else
Id = Attribute_Definite or else
Id = Attribute_Has_Access_Values or else
Id = Attribute_Has_Discriminants or else
Id = Attribute_Has_Tagged_Values or else
Id = Attribute_Lock_Free or else
Id = Attribute_Type_Class or else
Id = Attribute_Unconstrained_Array or else
Id = Attribute_Max_Alignment_For_Allocation)
and then not Is_Generic_Type (P_Entity)
then
P_Type := P_Entity;
-- We can fold 'Size applied to a type if the size is known (as happens
-- for a size from an attribute definition clause). At this stage, this
-- can happen only for types (e.g. record types) for which the size is
-- always non-static. We exclude generic types from consideration (since
-- they have bogus sizes set within templates).
elsif Id = Attribute_Size
and then Is_Type (P_Entity)
and then (not Is_Generic_Type (P_Entity))
and then Known_Static_RM_Size (P_Entity)
then
Compile_Time_Known_Attribute (N, RM_Size (P_Entity));
return;
-- We can fold 'Alignment applied to a type if the alignment is known
-- (as happens for an alignment from an attribute definition clause).
-- At this stage, this can happen only for types (e.g. record types) for
-- which the size is always non-static. We exclude generic types from
-- consideration (since they have bogus sizes set within templates).
elsif Id = Attribute_Alignment
and then Is_Type (P_Entity)
and then (not Is_Generic_Type (P_Entity))
and then Known_Alignment (P_Entity)
then
Compile_Time_Known_Attribute (N, Alignment (P_Entity));
return;
-- If this is an access attribute that is known to fail accessibility
-- check, rewrite accordingly.
elsif Attribute_Name (N) = Name_Access
and then Raises_Constraint_Error (N)
then
Rewrite (N,
Make_Raise_Program_Error (Loc,
Reason => PE_Accessibility_Check_Failed));
Set_Etype (N, C_Type);
return;
-- No other cases are foldable (they certainly aren't static, and at
-- the moment we don't try to fold any cases other than the ones above).
else
Check_Expressions;
return;
end if;
-- If either attribute or the prefix is Any_Type, then propagate
-- Any_Type to the result and don't do anything else at all.
if P_Type = Any_Type
or else (Present (E1) and then Etype (E1) = Any_Type)
or else (Present (E2) and then Etype (E2) = Any_Type)
then
Set_Etype (N, Any_Type);
return;
end if;
-- Scalar subtype case. We have not yet enforced the static requirement
-- of (RM 4.9(7)) and we don't intend to just yet, since there are cases
-- of non-static attribute references (e.g. S'Digits for a non-static
-- floating-point type, which we can compute at compile time).
-- Note: this folding of non-static attributes is not simply a case of
-- optimization. For many of the attributes affected, Gigi cannot handle
-- the attribute and depends on the front end having folded them away.
-- Note: although we don't require staticness at this stage, we do set
-- the Static variable to record the staticness, for easy reference by
-- those attributes where it matters (e.g. Succ and Pred), and also to
-- be used to ensure that non-static folded things are not marked as
-- being static (a check that is done right at the end).
P_Root_Type := Root_Type (P_Type);
P_Base_Type := Base_Type (P_Type);
-- If the root type or base type is generic, then we cannot fold. This
-- test is needed because subtypes of generic types are not always
-- marked as being generic themselves (which seems odd???)
if Is_Generic_Type (P_Root_Type)
or else Is_Generic_Type (P_Base_Type)
then
return;
end if;
if Is_Scalar_Type (P_Type) then
if not Is_Static_Subtype (P_Type) then
Static := False;
Set_Is_Static_Expression (N, False);
elsif not Is_OK_Static_Subtype (P_Type) then
Set_Raises_Constraint_Error (N);
end if;
-- Array case. We enforce the constrained requirement of (RM 4.9(7-8))
-- since we can't do anything with unconstrained arrays. In addition,
-- only the First, Last and Length attributes are possibly static.
-- Atomic_Always_Lock_Free, Definite, Has_Access_Values,
-- Has_Discriminants, Has_Tagged_Values, Lock_Free, Type_Class, and
-- Unconstrained_Array are again exceptions, because they apply as well
-- to unconstrained types.
-- In addition Component_Size is an exception since it is possibly
-- foldable, even though it is never static, and it does apply to
-- unconstrained arrays. Furthermore, it is essential to fold this
-- in the packed case, since otherwise the value will be incorrect.
elsif Id = Attribute_Atomic_Always_Lock_Free or else
Id = Attribute_Definite or else
Id = Attribute_Has_Access_Values or else
Id = Attribute_Has_Discriminants or else
Id = Attribute_Has_Tagged_Values or else
Id = Attribute_Lock_Free or else
Id = Attribute_Type_Class or else
Id = Attribute_Unconstrained_Array or else
Id = Attribute_Component_Size
then
Static := False;
Set_Is_Static_Expression (N, False);
elsif Id /= Attribute_Max_Alignment_For_Allocation then
if not Is_Constrained (P_Type)
or else (Id /= Attribute_First and then
Id /= Attribute_Last and then
Id /= Attribute_Length)
then
Check_Expressions;
return;
end if;
-- The rules in (RM 4.9(7,8)) require a static array, but as in the
-- scalar case, we hold off on enforcing staticness, since there are
-- cases which we can fold at compile time even though they are not
-- static (e.g. 'Length applied to a static index, even though other
-- non-static indexes make the array type non-static). This is only
-- an optimization, but it falls out essentially free, so why not.
-- Again we compute the variable Static for easy reference later
-- (note that no array attributes are static in Ada 83).
-- We also need to set Static properly for subsequent legality checks
-- which might otherwise accept non-static constants in contexts
-- where they are not legal.
Static :=
Ada_Version >= Ada_95 and then Statically_Denotes_Entity (P);
Set_Is_Static_Expression (N, Static);
declare
Nod : Node_Id;
begin
Nod := First_Index (P_Type);
-- The expression is static if the array type is constrained
-- by given bounds, and not by an initial expression. Constant
-- strings are static in any case.
if Root_Type (P_Type) /= Standard_String then
Static :=
Static and then not Is_Constr_Subt_For_U_Nominal (P_Type);
Set_Is_Static_Expression (N, Static);
end if;
while Present (Nod) loop
if not Is_Static_Subtype (Etype (Nod)) then
Static := False;
Set_Is_Static_Expression (N, False);
elsif not Is_OK_Static_Subtype (Etype (Nod)) then
Set_Raises_Constraint_Error (N);
Static := False;
Set_Is_Static_Expression (N, False);
end if;
-- If however the index type is generic, or derived from
-- one, attributes cannot be folded.
if Is_Generic_Type (Root_Type (Etype (Nod)))
and then Id /= Attribute_Component_Size
then
return;
end if;
Next_Index (Nod);
end loop;
end;
end if;
-- Check any expressions that are present. Note that these expressions,
-- depending on the particular attribute type, are either part of the
-- attribute designator, or they are arguments in a case where the
-- attribute reference returns a function. In the latter case, the
-- rule in (RM 4.9(22)) applies and in particular requires the type
-- of the expressions to be scalar in order for the attribute to be
-- considered to be static.
declare
E : Node_Id;
begin
E := E1;
while Present (E) loop
-- If expression is not static, then the attribute reference
-- result certainly cannot be static.
if not Is_Static_Expression (E) then
Static := False;
Set_Is_Static_Expression (N, False);
end if;
if Raises_Constraint_Error (E) then
Set_Raises_Constraint_Error (N);
end if;
-- If the result is not known at compile time, or is not of
-- a scalar type, then the result is definitely not static,
-- so we can quit now.
if not Compile_Time_Known_Value (E)
or else not Is_Scalar_Type (Etype (E))
then
-- An odd special case, if this is a Pos attribute, this
-- is where we need to apply a range check since it does
-- not get done anywhere else.
if Id = Attribute_Pos then
if Is_Integer_Type (Etype (E)) then
Apply_Range_Check (E, Etype (N));
end if;
end if;
Check_Expressions;
return;
-- If the expression raises a constraint error, then so does
-- the attribute reference. We keep going in this case because
-- we are still interested in whether the attribute reference
-- is static even if it is not static.
elsif Raises_Constraint_Error (E) then
Set_Raises_Constraint_Error (N);
end if;
Next (E);
end loop;
if Raises_Constraint_Error (Prefix (N)) then
Set_Is_Static_Expression (N, False);
return;
end if;
end;
-- Deal with the case of a static attribute reference that raises
-- constraint error. The Raises_Constraint_Error flag will already
-- have been set, and the Static flag shows whether the attribute
-- reference is static. In any case we certainly can't fold such an
-- attribute reference.
-- Note that the rewriting of the attribute node with the constraint
-- error node is essential in this case, because otherwise Gigi might
-- blow up on one of the attributes it never expects to see.
-- The constraint_error node must have the type imposed by the context,
-- to avoid spurious errors in the enclosing expression.
if Raises_Constraint_Error (N) then
CE_Node :=
Make_Raise_Constraint_Error (Sloc (N),
Reason => CE_Range_Check_Failed);
Set_Etype (CE_Node, Etype (N));
Set_Raises_Constraint_Error (CE_Node);
Check_Expressions;
Rewrite (N, Relocate_Node (CE_Node));
Set_Raises_Constraint_Error (N, True);
return;
end if;
-- At this point we have a potentially foldable attribute reference.
-- If Static is set, then the attribute reference definitely obeys
-- the requirements in (RM 4.9(7,8,22)), and it definitely can be
-- folded. If Static is not set, then the attribute may or may not
-- be foldable, and the individual attribute processing routines
-- test Static as required in cases where it makes a difference.
-- In the case where Static is not set, we do know that all the
-- expressions present are at least known at compile time (we assumed
-- above that if this was not the case, then there was no hope of static
-- evaluation). However, we did not require that the bounds of the
-- prefix type be compile time known, let alone static). That's because
-- there are many attributes that can be computed at compile time on
-- non-static subtypes, even though such references are not static
-- expressions.
-- For VAX float, the root type is an IEEE type. So make sure to use the
-- base type instead of the root-type for floating point attributes.
case Id is
-- Attributes related to Ada 2012 iterators (placeholder ???)
when Attribute_Constant_Indexing
| Attribute_Default_Iterator
| Attribute_Implicit_Dereference
| Attribute_Iterator_Element
| Attribute_Iterable
| Attribute_Variable_Indexing
=>
null;
-- Internal attributes used to deal with Ada 2012 delayed aspects.
-- These were already rejected by the parser. Thus they shouldn't
-- appear here.
when Internal_Attribute_Id =>
raise Program_Error;
--------------
-- Adjacent --
--------------
when Attribute_Adjacent =>
Fold_Ureal
(N,
Eval_Fat.Adjacent
(P_Base_Type, Expr_Value_R (E1), Expr_Value_R (E2)),
Static);
---------
-- Aft --
---------
when Attribute_Aft =>
Fold_Uint (N, Aft_Value (P_Type), Static);
---------------
-- Alignment --
---------------
when Attribute_Alignment => Alignment_Block : declare
P_TypeA : constant Entity_Id := Underlying_Type (P_Type);
begin
-- Fold if alignment is set and not otherwise
if Known_Alignment (P_TypeA) then
Fold_Uint (N, Alignment (P_TypeA), Static);
end if;
end Alignment_Block;
-----------------------------
-- Atomic_Always_Lock_Free --
-----------------------------
-- Atomic_Always_Lock_Free attribute is a Boolean, thus no need to fold
-- here.
when Attribute_Atomic_Always_Lock_Free => Atomic_Always_Lock_Free :
declare
V : constant Entity_Id :=
Boolean_Literals
(Support_Atomic_Primitives_On_Target
and then Support_Atomic_Primitives (P_Type));
begin
Rewrite (N, New_Occurrence_Of (V, Loc));
-- Analyze and resolve as boolean. Note that this attribute is a
-- static attribute in GNAT.
Analyze_And_Resolve (N, Standard_Boolean);
Static := True;
Set_Is_Static_Expression (N, True);
end Atomic_Always_Lock_Free;
---------
-- Bit --
---------
-- Bit can never be folded
when Attribute_Bit =>
null;
------------------
-- Body_Version --
------------------
-- Body_version can never be static
when Attribute_Body_Version =>
null;
-------------
-- Ceiling --
-------------
when Attribute_Ceiling =>
Fold_Ureal
(N, Eval_Fat.Ceiling (P_Base_Type, Expr_Value_R (E1)), Static);
--------------------
-- Component_Size --
--------------------
when Attribute_Component_Size =>
if Known_Static_Component_Size (P_Type) then
Fold_Uint (N, Component_Size (P_Type), Static);
end if;
-------------
-- Compose --
-------------
when Attribute_Compose =>
Fold_Ureal
(N,
Eval_Fat.Compose (P_Base_Type, Expr_Value_R (E1), Expr_Value (E2)),
Static);
-----------------
-- Constrained --
-----------------
-- Constrained is never folded for now, there may be cases that
-- could be handled at compile time. To be looked at later.
when Attribute_Constrained =>
-- The expander might fold it and set the static flag accordingly,
-- but with expansion disabled (as in ASIS), it remains as an
-- attribute reference, and this reference is not static.
Set_Is_Static_Expression (N, False);
null;
---------------
-- Copy_Sign --
---------------
when Attribute_Copy_Sign =>
Fold_Ureal
(N,
Eval_Fat.Copy_Sign
(P_Base_Type, Expr_Value_R (E1), Expr_Value_R (E2)),
Static);
--------------
-- Definite --
--------------
when Attribute_Definite =>
Rewrite (N, New_Occurrence_Of (
Boolean_Literals (Is_Definite_Subtype (P_Entity)), Loc));
Analyze_And_Resolve (N, Standard_Boolean);
-----------
-- Delta --
-----------
when Attribute_Delta =>
Fold_Ureal (N, Delta_Value (P_Type), True);
------------
-- Denorm --
------------
when Attribute_Denorm =>
Fold_Uint
(N, UI_From_Int (Boolean'Pos (Has_Denormals (P_Type))), Static);
---------------------
-- Descriptor_Size --
---------------------
when Attribute_Descriptor_Size =>
null;
------------
-- Digits --
------------
when Attribute_Digits =>
Fold_Uint (N, Digits_Value (P_Type), Static);
----------
-- Emax --
----------
when Attribute_Emax =>
-- Ada 83 attribute is defined as (RM83 3.5.8)
-- T'Emax = 4 * T'Mantissa
Fold_Uint (N, 4 * Mantissa, Static);
--------------
-- Enum_Rep --
--------------
when Attribute_Enum_Rep => Enum_Rep : declare
Val : Node_Id;
begin
-- The attribute appears in the form:
-- Enum_Typ'Enum_Rep (Const)
-- Enum_Typ'Enum_Rep (Enum_Lit)
if Present (E1) then
Val := E1;
-- Otherwise the prefix denotes a constant or enumeration literal:
-- Const'Enum_Rep
-- Enum_Lit'Enum_Rep
else
Val := P;
end if;
-- For an enumeration type with a non-standard representation use
-- the Enumeration_Rep field of the proper constant. Note that this
-- will not work for types Character/Wide_[Wide-]Character, since no
-- real entities are created for the enumeration literals, but that
-- does not matter since these two types do not have non-standard
-- representations anyway.
if Is_Enumeration_Type (P_Type)
and then Has_Non_Standard_Rep (P_Type)
then
Fold_Uint (N, Enumeration_Rep (Expr_Value_E (Val)), Static);
-- For enumeration types with standard representations and all other
-- cases (i.e. all integer and modular types), Enum_Rep is equivalent
-- to Pos.
else
Fold_Uint (N, Expr_Value (Val), Static);
end if;
end Enum_Rep;
--------------
-- Enum_Val --
--------------
when Attribute_Enum_Val => Enum_Val : declare
Lit : Node_Id;
begin
-- We have something like Enum_Type'Enum_Val (23), so search for a
-- corresponding value in the list of Enum_Rep values for the type.
Lit := First_Literal (P_Base_Type);
loop
if Enumeration_Rep (Lit) = Expr_Value (E1) then
Fold_Uint (N, Enumeration_Pos (Lit), Static);
exit;
end if;
Next_Literal (Lit);
if No (Lit) then
Apply_Compile_Time_Constraint_Error
(N, "no representation value matches",
CE_Range_Check_Failed,
Warn => not Static);
exit;
end if;
end loop;
end Enum_Val;
-------------
-- Epsilon --
-------------
when Attribute_Epsilon =>
-- Ada 83 attribute is defined as (RM83 3.5.8)
-- T'Epsilon = 2.0**(1 - T'Mantissa)
Fold_Ureal (N, Ureal_2 ** (1 - Mantissa), True);
--------------
-- Exponent --
--------------
when Attribute_Exponent =>
Fold_Uint (N,
Eval_Fat.Exponent (P_Base_Type, Expr_Value_R (E1)), Static);
-----------------------
-- Finalization_Size --
-----------------------
when Attribute_Finalization_Size =>
null;
-----------
-- First --
-----------
when Attribute_First =>
Set_Bounds;
if Compile_Time_Known_Value (Lo_Bound) then
if Is_Real_Type (P_Type) then
Fold_Ureal (N, Expr_Value_R (Lo_Bound), Static);
else
Fold_Uint (N, Expr_Value (Lo_Bound), Static);
end if;
else
Check_Concurrent_Discriminant (Lo_Bound);
end if;
-----------------
-- First_Valid --
-----------------
when Attribute_First_Valid =>
if Has_Predicates (P_Type)
and then Has_Static_Predicate (P_Type)
then
declare
FirstN : constant Node_Id :=
First (Static_Discrete_Predicate (P_Type));
begin
if Nkind (FirstN) = N_Range then
Fold_Uint (N, Expr_Value (Low_Bound (FirstN)), Static);
else
Fold_Uint (N, Expr_Value (FirstN), Static);
end if;
end;
else
Set_Bounds;
Fold_Uint (N, Expr_Value (Lo_Bound), Static);
end if;
-----------------
-- Fixed_Value --
-----------------
when Attribute_Fixed_Value =>
null;
-----------
-- Floor --
-----------
when Attribute_Floor =>
Fold_Ureal
(N, Eval_Fat.Floor (P_Base_Type, Expr_Value_R (E1)), Static);
----------
-- Fore --
----------
when Attribute_Fore =>
if Compile_Time_Known_Bounds (P_Type) then
Fold_Uint (N, UI_From_Int (Fore_Value), Static);
end if;
--------------
-- Fraction --
--------------
when Attribute_Fraction =>
Fold_Ureal
(N, Eval_Fat.Fraction (P_Base_Type, Expr_Value_R (E1)), Static);
-----------------------
-- Has_Access_Values --
-----------------------
when Attribute_Has_Access_Values =>
Rewrite (N, New_Occurrence_Of
(Boolean_Literals (Has_Access_Values (P_Root_Type)), Loc));
Analyze_And_Resolve (N, Standard_Boolean);
-----------------------
-- Has_Discriminants --
-----------------------
when Attribute_Has_Discriminants =>
Rewrite (N, New_Occurrence_Of (
Boolean_Literals (Has_Discriminants (P_Entity)), Loc));
Analyze_And_Resolve (N, Standard_Boolean);
----------------------
-- Has_Same_Storage --
----------------------
when Attribute_Has_Same_Storage =>
null;
-----------------------
-- Has_Tagged_Values --
-----------------------
when Attribute_Has_Tagged_Values =>
Rewrite (N, New_Occurrence_Of
(Boolean_Literals (Has_Tagged_Component (P_Root_Type)), Loc));
Analyze_And_Resolve (N, Standard_Boolean);
--------------
-- Identity --
--------------
when Attribute_Identity =>
null;
-----------
-- Image --
-----------
-- Image is a scalar attribute, but is never static, because it is
-- not a static function (having a non-scalar argument (RM 4.9(22))
-- However, we can constant-fold the image of an enumeration literal
-- if names are available.
when Attribute_Image =>
if Is_Entity_Name (E1)
and then Ekind (Entity (E1)) = E_Enumeration_Literal
and then not Discard_Names (First_Subtype (Etype (E1)))
and then not Global_Discard_Names
then
declare
Lit : constant Entity_Id := Entity (E1);
Str : String_Id;
begin
Start_String;
Get_Unqualified_Decoded_Name_String (Chars (Lit));
Set_Casing (All_Upper_Case);
Store_String_Chars (Name_Buffer (1 .. Name_Len));
Str := End_String;
Rewrite (N, Make_String_Literal (Loc, Strval => Str));
Analyze_And_Resolve (N, Standard_String);
Set_Is_Static_Expression (N, False);
end;
end if;
-------------------
-- Integer_Value --
-------------------
-- We never try to fold Integer_Value (though perhaps we could???)
when Attribute_Integer_Value =>
null;
-------------------
-- Invalid_Value --
-------------------
-- Invalid_Value is a scalar attribute that is never static, because
-- the value is by design out of range.
when Attribute_Invalid_Value =>
null;
-----------
-- Large --
-----------
when Attribute_Large =>
-- For fixed-point, we use the identity:
-- T'Large = (2.0**T'Mantissa - 1.0) * T'Small
if Is_Fixed_Point_Type (P_Type) then
Rewrite (N,
Make_Op_Multiply (Loc,
Left_Opnd =>
Make_Op_Subtract (Loc,
Left_Opnd =>
Make_Op_Expon (Loc,
Left_Opnd =>
Make_Real_Literal (Loc, Ureal_2),
Right_Opnd =>
Make_Attribute_Reference (Loc,
Prefix => P,
Attribute_Name => Name_Mantissa)),
Right_Opnd => Make_Real_Literal (Loc, Ureal_1)),
Right_Opnd =>
Make_Real_Literal (Loc, Small_Value (Entity (P)))));
Analyze_And_Resolve (N, C_Type);
-- Floating-point (Ada 83 compatibility)
else
-- Ada 83 attribute is defined as (RM83 3.5.8)
-- T'Large = 2.0**T'Emax * (1.0 - 2.0**(-T'Mantissa))
-- where
-- T'Emax = 4 * T'Mantissa
Fold_Ureal
(N,
Ureal_2 ** (4 * Mantissa) * (Ureal_1 - Ureal_2 ** (-Mantissa)),
True);
end if;
---------------
-- Lock_Free --
---------------
when Attribute_Lock_Free => Lock_Free : declare
V : constant Entity_Id := Boolean_Literals (Uses_Lock_Free (P_Type));
begin
Rewrite (N, New_Occurrence_Of (V, Loc));
-- Analyze and resolve as boolean. Note that this attribute is a
-- static attribute in GNAT.
Analyze_And_Resolve (N, Standard_Boolean);
Static := True;
Set_Is_Static_Expression (N, True);
end Lock_Free;
----------
-- Last --
----------
when Attribute_Last =>
Set_Bounds;
if Compile_Time_Known_Value (Hi_Bound) then
if Is_Real_Type (P_Type) then
Fold_Ureal (N, Expr_Value_R (Hi_Bound), Static);
else
Fold_Uint (N, Expr_Value (Hi_Bound), Static);
end if;
else
Check_Concurrent_Discriminant (Hi_Bound);
end if;
----------------
-- Last_Valid --
----------------
when Attribute_Last_Valid =>
if Has_Predicates (P_Type)
and then Has_Static_Predicate (P_Type)
then
declare
LastN : constant Node_Id :=
Last (Static_Discrete_Predicate (P_Type));
begin
if Nkind (LastN) = N_Range then
Fold_Uint (N, Expr_Value (High_Bound (LastN)), Static);
else
Fold_Uint (N, Expr_Value (LastN), Static);
end if;
end;
else
Set_Bounds;
Fold_Uint (N, Expr_Value (Hi_Bound), Static);
end if;
------------------
-- Leading_Part --
------------------
when Attribute_Leading_Part =>
Fold_Ureal
(N,
Eval_Fat.Leading_Part
(P_Base_Type, Expr_Value_R (E1), Expr_Value (E2)),
Static);
------------
-- Length --
------------
when Attribute_Length => Length : declare
Ind : Node_Id;
begin
-- If any index type is a formal type, or derived from one, the
-- bounds are not static. Treating them as static can produce
-- spurious warnings or improper constant folding.
Ind := First_Index (P_Type);
while Present (Ind) loop
if Is_Generic_Type (Root_Type (Etype (Ind))) then
return;
end if;
Next_Index (Ind);
end loop;
Set_Bounds;
-- For two compile time values, we can compute length
if Compile_Time_Known_Value (Lo_Bound)
and then Compile_Time_Known_Value (Hi_Bound)
then
Fold_Uint (N,
UI_Max (0, 1 + (Expr_Value (Hi_Bound) - Expr_Value (Lo_Bound))),
Static);
end if;
-- One more case is where Hi_Bound and Lo_Bound are compile-time
-- comparable, and we can figure out the difference between them.
declare
Diff : aliased Uint;
begin
case
Compile_Time_Compare
(Lo_Bound, Hi_Bound, Diff'Access, Assume_Valid => False)
is
when EQ =>
Fold_Uint (N, Uint_1, Static);
when GT =>
Fold_Uint (N, Uint_0, Static);
when LT =>
if Diff /= No_Uint then
Fold_Uint (N, Diff + 1, Static);
end if;
when others =>
null;
end case;
end;
end Length;
----------------
-- Loop_Entry --
----------------
-- Loop_Entry acts as an alias of a constant initialized to the prefix
-- of the said attribute at the point of entry into the related loop. As
-- such, the attribute reference does not need to be evaluated because
-- the prefix is the one that is evaluted.
when Attribute_Loop_Entry =>
null;
-------------
-- Machine --
-------------
when Attribute_Machine =>
Fold_Ureal
(N,
Eval_Fat.Machine
(P_Base_Type, Expr_Value_R (E1), Eval_Fat.Round, N),
Static);
------------------
-- Machine_Emax --
------------------
when Attribute_Machine_Emax =>
Fold_Uint (N, Machine_Emax_Value (P_Type), Static);
------------------
-- Machine_Emin --
------------------
when Attribute_Machine_Emin =>
Fold_Uint (N, Machine_Emin_Value (P_Type), Static);
----------------------
-- Machine_Mantissa --
----------------------
when Attribute_Machine_Mantissa =>
Fold_Uint (N, Machine_Mantissa_Value (P_Type), Static);
-----------------------
-- Machine_Overflows --
-----------------------
when Attribute_Machine_Overflows =>
-- Always true for fixed-point
if Is_Fixed_Point_Type (P_Type) then
Fold_Uint (N, True_Value, Static);
-- Floating point case
else
Fold_Uint (N,
UI_From_Int (Boolean'Pos (Machine_Overflows_On_Target)),
Static);
end if;
-------------------
-- Machine_Radix --
-------------------
when Attribute_Machine_Radix =>
if Is_Fixed_Point_Type (P_Type) then
if Is_Decimal_Fixed_Point_Type (P_Type)
and then Machine_Radix_10 (P_Type)
then
Fold_Uint (N, Uint_10, Static);
else
Fold_Uint (N, Uint_2, Static);
end if;
-- All floating-point type always have radix 2
else
Fold_Uint (N, Uint_2, Static);
end if;
----------------------
-- Machine_Rounding --
----------------------
-- Note: for the folding case, it is fine to treat Machine_Rounding
-- exactly the same way as Rounding, since this is one of the allowed
-- behaviors, and performance is not an issue here. It might be a bit
-- better to give the same result as it would give at run time, even
-- though the non-determinism is certainly permitted.
when Attribute_Machine_Rounding =>
Fold_Ureal
(N, Eval_Fat.Rounding (P_Base_Type, Expr_Value_R (E1)), Static);
--------------------
-- Machine_Rounds --
--------------------
when Attribute_Machine_Rounds =>
-- Always False for fixed-point
if Is_Fixed_Point_Type (P_Type) then
Fold_Uint (N, False_Value, Static);
-- Else yield proper floating-point result
else
Fold_Uint
(N, UI_From_Int (Boolean'Pos (Machine_Rounds_On_Target)),
Static);
end if;
------------------
-- Machine_Size --
------------------
-- Note: Machine_Size is identical to Object_Size
when Attribute_Machine_Size => Machine_Size : declare
P_TypeA : constant Entity_Id := Underlying_Type (P_Type);
begin
if Known_Esize (P_TypeA) then
Fold_Uint (N, Esize (P_TypeA), Static);
end if;
end Machine_Size;
--------------
-- Mantissa --
--------------
when Attribute_Mantissa =>
-- Fixed-point mantissa
if Is_Fixed_Point_Type (P_Type) then
-- Compile time foldable case
if Compile_Time_Known_Value (Type_Low_Bound (P_Type))
and then
Compile_Time_Known_Value (Type_High_Bound (P_Type))
then
-- The calculation of the obsolete Ada 83 attribute Mantissa
-- is annoying, because of AI00143, quoted here:
-- !question 84-01-10
-- Consider the model numbers for F:
-- type F is delta 1.0 range -7.0 .. 8.0;
-- The wording requires that F'MANTISSA be the SMALLEST
-- integer number for which each bound of the specified
-- range is either a model number or lies at most small
-- distant from a model number. This means F'MANTISSA
-- is required to be 3 since the range -7.0 .. 7.0 fits
-- in 3 signed bits, and 8 is "at most" 1.0 from a model
-- number, namely, 7. Is this analysis correct? Note that
-- this implies the upper bound of the range is not
-- represented as a model number.
-- !response 84-03-17
-- The analysis is correct. The upper and lower bounds for
-- a fixed point type can lie outside the range of model
-- numbers.
declare
Siz : Uint;
LBound : Ureal;
UBound : Ureal;
Bound : Ureal;
Max_Man : Uint;
begin
LBound := Expr_Value_R (Type_Low_Bound (P_Type));
UBound := Expr_Value_R (Type_High_Bound (P_Type));
Bound := UR_Max (UR_Abs (LBound), UR_Abs (UBound));
Max_Man := UR_Trunc (Bound / Small_Value (P_Type));
-- If the Bound is exactly a model number, i.e. a multiple
-- of Small, then we back it off by one to get the integer
-- value that must be representable.
if Small_Value (P_Type) * Max_Man = Bound then
Max_Man := Max_Man - 1;
end if;
-- Now find corresponding size = Mantissa value
Siz := Uint_0;
while 2 ** Siz < Max_Man loop
Siz := Siz + 1;
end loop;
Fold_Uint (N, Siz, Static);
end;
else
-- The case of dynamic bounds cannot be evaluated at compile
-- time. Instead we use a runtime routine (see Exp_Attr).
null;
end if;
-- Floating-point Mantissa
else
Fold_Uint (N, Mantissa, Static);
end if;
---------
-- Max --
---------
when Attribute_Max =>
if Is_Real_Type (P_Type) then
Fold_Ureal
(N, UR_Max (Expr_Value_R (E1), Expr_Value_R (E2)), Static);
else
Fold_Uint (N, UI_Max (Expr_Value (E1), Expr_Value (E2)), Static);
end if;
----------------------------------
-- Max_Alignment_For_Allocation --
----------------------------------
-- Max_Alignment_For_Allocation is usually the Alignment. However,
-- arrays are allocated with dope, so we need to take into account both
-- the alignment of the array, which comes from the component alignment,
-- and the alignment of the dope. Also, if the alignment is unknown, we
-- use the max (it's OK to be pessimistic).
when Attribute_Max_Alignment_For_Allocation => Max_Align : declare
A : Uint := UI_From_Int (Ttypes.Maximum_Alignment);
begin
if Known_Alignment (P_Type)
and then (not Is_Array_Type (P_Type) or else Alignment (P_Type) > A)
then
A := Alignment (P_Type);
end if;
Fold_Uint (N, A, Static);
end Max_Align;
----------------------------------
-- Max_Size_In_Storage_Elements --
----------------------------------
-- Max_Size_In_Storage_Elements is simply the Size rounded up to a
-- Storage_Unit boundary. We can fold any cases for which the size
-- is known by the front end.
when Attribute_Max_Size_In_Storage_Elements =>
if Known_Esize (P_Type) then
Fold_Uint (N,
(Esize (P_Type) + System_Storage_Unit - 1) /
System_Storage_Unit,
Static);
end if;
--------------------
-- Mechanism_Code --
--------------------
when Attribute_Mechanism_Code => Mechanism_Code : declare
Formal : Entity_Id;
Mech : Mechanism_Type;
Val : Int;
begin
if No (E1) then
Mech := Mechanism (P_Entity);
else
Val := UI_To_Int (Expr_Value (E1));
Formal := First_Formal (P_Entity);
for J in 1 .. Val - 1 loop
Next_Formal (Formal);
end loop;
Mech := Mechanism (Formal);
end if;
if Mech < 0 then
Fold_Uint (N, UI_From_Int (Int (-Mech)), Static);
end if;
end Mechanism_Code;
---------
-- Min --
---------
when Attribute_Min =>
if Is_Real_Type (P_Type) then
Fold_Ureal
(N, UR_Min (Expr_Value_R (E1), Expr_Value_R (E2)), Static);
else
Fold_Uint
(N, UI_Min (Expr_Value (E1), Expr_Value (E2)), Static);
end if;
---------
-- Mod --
---------
when Attribute_Mod =>
Fold_Uint
(N, UI_Mod (Expr_Value (E1), Modulus (P_Base_Type)), Static);
-----------
-- Model --
-----------
when Attribute_Model =>
Fold_Ureal
(N, Eval_Fat.Model (P_Base_Type, Expr_Value_R (E1)), Static);
----------------
-- Model_Emin --
----------------
when Attribute_Model_Emin =>
Fold_Uint (N, Model_Emin_Value (P_Base_Type), Static);
-------------------
-- Model_Epsilon --
-------------------
when Attribute_Model_Epsilon =>
Fold_Ureal (N, Model_Epsilon_Value (P_Base_Type), Static);
--------------------
-- Model_Mantissa --
--------------------
when Attribute_Model_Mantissa =>
Fold_Uint (N, Model_Mantissa_Value (P_Base_Type), Static);
-----------------
-- Model_Small --
-----------------
when Attribute_Model_Small =>
Fold_Ureal (N, Model_Small_Value (P_Base_Type), Static);
-------------
-- Modulus --
-------------
when Attribute_Modulus =>
Fold_Uint (N, Modulus (P_Type), Static);
--------------------
-- Null_Parameter --
--------------------
-- Cannot fold, we know the value sort of, but the whole point is
-- that there is no way to talk about this imaginary value except
-- by using the attribute, so we leave it the way it is.
when Attribute_Null_Parameter =>
null;
-----------------
-- Object_Size --
-----------------
-- The Object_Size attribute for a type returns the Esize of the
-- type and can be folded if this value is known.
when Attribute_Object_Size => Object_Size : declare
P_TypeA : constant Entity_Id := Underlying_Type (P_Type);
begin
if Known_Esize (P_TypeA) then
Fold_Uint (N, Esize (P_TypeA), Static);
end if;
end Object_Size;
----------------------
-- Overlaps_Storage --
----------------------
when Attribute_Overlaps_Storage =>
null;
-------------------------
-- Passed_By_Reference --
-------------------------
-- Scalar types are never passed by reference
when Attribute_Passed_By_Reference =>
Fold_Uint (N, False_Value, Static);
---------
-- Pos --
---------
when Attribute_Pos =>
Fold_Uint (N, Expr_Value (E1), Static);
----------
-- Pred --
----------
when Attribute_Pred =>
-- Floating-point case
if Is_Floating_Point_Type (P_Type) then
Fold_Ureal
(N, Eval_Fat.Pred (P_Base_Type, Expr_Value_R (E1)), Static);
-- Fixed-point case
elsif Is_Fixed_Point_Type (P_Type) then
Fold_Ureal
(N, Expr_Value_R (E1) - Small_Value (P_Type), True);
-- Modular integer case (wraps)
elsif Is_Modular_Integer_Type (P_Type) then
Fold_Uint (N, (Expr_Value (E1) - 1) mod Modulus (P_Type), Static);
-- Other scalar cases
else
pragma Assert (Is_Scalar_Type (P_Type));
if Is_Enumeration_Type (P_Type)
and then Expr_Value (E1) =
Expr_Value (Type_Low_Bound (P_Base_Type))
then
Apply_Compile_Time_Constraint_Error
(N, "Pred of `&''First`",
CE_Overflow_Check_Failed,
Ent => P_Base_Type,
Warn => not Static);
Check_Expressions;
return;
end if;
Fold_Uint (N, Expr_Value (E1) - 1, Static);
end if;
-----------
-- Range --
-----------
-- No processing required, because by this stage, Range has been
-- replaced by First .. Last, so this branch can never be taken.
when Attribute_Range =>
raise Program_Error;
------------------
-- Range_Length --
------------------
when Attribute_Range_Length => Range_Length : declare
Diff : aliased Uint;
begin
Set_Bounds;
-- Can fold if both bounds are compile time known
if Compile_Time_Known_Value (Hi_Bound)
and then Compile_Time_Known_Value (Lo_Bound)
then
Fold_Uint (N,
UI_Max
(0, Expr_Value (Hi_Bound) - Expr_Value (Lo_Bound) + 1),
Static);
end if;
-- One more case is where Hi_Bound and Lo_Bound are compile-time
-- comparable, and we can figure out the difference between them.
case Compile_Time_Compare
(Lo_Bound, Hi_Bound, Diff'Access, Assume_Valid => False)
is
when EQ =>
Fold_Uint (N, Uint_1, Static);
when GT =>
Fold_Uint (N, Uint_0, Static);
when LT =>
if Diff /= No_Uint then
Fold_Uint (N, Diff + 1, Static);
end if;
when others =>
null;
end case;
end Range_Length;
---------
-- Ref --
---------
when Attribute_Ref =>
Fold_Uint (N, Expr_Value (E1), Static);
---------------
-- Remainder --
---------------
when Attribute_Remainder => Remainder : declare
X : constant Ureal := Expr_Value_R (E1);
Y : constant Ureal := Expr_Value_R (E2);
begin
if UR_Is_Zero (Y) then
Apply_Compile_Time_Constraint_Error
(N, "division by zero in Remainder",
CE_Overflow_Check_Failed,
Warn => not Static);
Check_Expressions;
return;
end if;
Fold_Ureal (N, Eval_Fat.Remainder (P_Base_Type, X, Y), Static);
end Remainder;
-----------------
-- Restriction --
-----------------
when Attribute_Restriction_Set =>
Rewrite (N, New_Occurrence_Of (Standard_False, Loc));
Set_Is_Static_Expression (N);
-----------
-- Round --
-----------
when Attribute_Round => Round : declare
Sr : Ureal;
Si : Uint;
begin
-- First we get the (exact result) in units of small
Sr := Expr_Value_R (E1) / Small_Value (C_Type);
-- Now round that exactly to an integer
Si := UR_To_Uint (Sr);
-- Finally the result is obtained by converting back to real
Fold_Ureal (N, Si * Small_Value (C_Type), Static);
end Round;
--------------
-- Rounding --
--------------
when Attribute_Rounding =>
Fold_Ureal
(N, Eval_Fat.Rounding (P_Base_Type, Expr_Value_R (E1)), Static);
---------------
-- Safe_Emax --
---------------
when Attribute_Safe_Emax =>
Fold_Uint (N, Safe_Emax_Value (P_Type), Static);
----------------
-- Safe_First --
----------------
when Attribute_Safe_First =>
Fold_Ureal (N, Safe_First_Value (P_Type), Static);
----------------
-- Safe_Large --
----------------
when Attribute_Safe_Large =>
if Is_Fixed_Point_Type (P_Type) then
Fold_Ureal
(N, Expr_Value_R (Type_High_Bound (P_Base_Type)), Static);
else
Fold_Ureal (N, Safe_Last_Value (P_Type), Static);
end if;
---------------
-- Safe_Last --
---------------
when Attribute_Safe_Last =>
Fold_Ureal (N, Safe_Last_Value (P_Type), Static);
----------------
-- Safe_Small --
----------------
when Attribute_Safe_Small =>
-- In Ada 95, the old Ada 83 attribute Safe_Small is redundant
-- for fixed-point, since is the same as Small, but we implement
-- it for backwards compatibility.
if Is_Fixed_Point_Type (P_Type) then
Fold_Ureal (N, Small_Value (P_Type), Static);
-- Ada 83 Safe_Small for floating-point cases
else
Fold_Ureal (N, Model_Small_Value (P_Type), Static);
end if;
-----------
-- Scale --
-----------
when Attribute_Scale =>
Fold_Uint (N, Scale_Value (P_Type), Static);
-------------
-- Scaling --
-------------
when Attribute_Scaling =>
Fold_Ureal
(N,
Eval_Fat.Scaling
(P_Base_Type, Expr_Value_R (E1), Expr_Value (E2)),
Static);
------------------
-- Signed_Zeros --
------------------
when Attribute_Signed_Zeros =>
Fold_Uint
(N, UI_From_Int (Boolean'Pos (Has_Signed_Zeros (P_Type))), Static);
----------
-- Size --
----------
-- Size attribute returns the RM size. All scalar types can be folded,
-- as well as any types for which the size is known by the front end,
-- including any type for which a size attribute is specified. This is
-- one of the places where it is annoying that a size of zero means two
-- things (zero size for scalars, unspecified size for non-scalars).
when Attribute_Size
| Attribute_VADS_Size
=>
Size : declare
P_TypeA : constant Entity_Id := Underlying_Type (P_Type);
begin
if Is_Scalar_Type (P_TypeA)
or else RM_Size (P_TypeA) /= Uint_0
then
-- VADS_Size case
if Id = Attribute_VADS_Size or else Use_VADS_Size then
declare
S : constant Node_Id := Size_Clause (P_TypeA);
begin
-- If a size clause applies, then use the size from it.
-- This is one of the rare cases where we can use the
-- Size_Clause field for a subtype when Has_Size_Clause
-- is False. Consider:
-- type x is range 1 .. 64;
-- for x'size use 12;
-- subtype y is x range 0 .. 3;
-- Here y has a size clause inherited from x, but
-- normally it does not apply, and y'size is 2. However,
-- y'VADS_Size is indeed 12 and not 2.
if Present (S)
and then Is_OK_Static_Expression (Expression (S))
then
Fold_Uint (N, Expr_Value (Expression (S)), Static);
-- If no size is specified, then we simply use the object
-- size in the VADS_Size case (e.g. Natural'Size is equal
-- to Integer'Size, not one less).
else
Fold_Uint (N, Esize (P_TypeA), Static);
end if;
end;
-- Normal case (Size) in which case we want the RM_Size
else
Fold_Uint (N, RM_Size (P_TypeA), Static);
end if;
end if;
end Size;
-----------
-- Small --
-----------
when Attribute_Small =>
-- The floating-point case is present only for Ada 83 compatibility.
-- Note that strictly this is an illegal addition, since we are
-- extending an Ada 95 defined attribute, but we anticipate an
-- ARG ruling that will permit this.
if Is_Floating_Point_Type (P_Type) then
-- Ada 83 attribute is defined as (RM83 3.5.8)
-- T'Small = 2.0**(-T'Emax - 1)
-- where
-- T'Emax = 4 * T'Mantissa
Fold_Ureal (N, Ureal_2 ** ((-(4 * Mantissa)) - 1), Static);
-- Normal Ada 95 fixed-point case
else
Fold_Ureal (N, Small_Value (P_Type), True);
end if;
-----------------
-- Stream_Size --
-----------------
when Attribute_Stream_Size =>
null;
----------
-- Succ --
----------
when Attribute_Succ =>
-- Floating-point case
if Is_Floating_Point_Type (P_Type) then
Fold_Ureal
(N, Eval_Fat.Succ (P_Base_Type, Expr_Value_R (E1)), Static);
-- Fixed-point case
elsif Is_Fixed_Point_Type (P_Type) then
Fold_Ureal (N, Expr_Value_R (E1) + Small_Value (P_Type), Static);
-- Modular integer case (wraps)
elsif Is_Modular_Integer_Type (P_Type) then
Fold_Uint (N, (Expr_Value (E1) + 1) mod Modulus (P_Type), Static);
-- Other scalar cases
else
pragma Assert (Is_Scalar_Type (P_Type));
if Is_Enumeration_Type (P_Type)
and then Expr_Value (E1) =
Expr_Value (Type_High_Bound (P_Base_Type))
then
Apply_Compile_Time_Constraint_Error
(N, "Succ of `&''Last`",
CE_Overflow_Check_Failed,
Ent => P_Base_Type,
Warn => not Static);
Check_Expressions;
return;
else
Fold_Uint (N, Expr_Value (E1) + 1, Static);
end if;
end if;
----------------
-- Truncation --
----------------
when Attribute_Truncation =>
Fold_Ureal
(N,
Eval_Fat.Truncation (P_Base_Type, Expr_Value_R (E1)),
Static);
----------------
-- Type_Class --
----------------
when Attribute_Type_Class => Type_Class : declare
Typ : constant Entity_Id := Underlying_Type (P_Base_Type);
Id : RE_Id;
begin
if Is_Descendant_Of_Address (Typ) then
Id := RE_Type_Class_Address;
elsif Is_Enumeration_Type (Typ) then
Id := RE_Type_Class_Enumeration;
elsif Is_Integer_Type (Typ) then
Id := RE_Type_Class_Integer;
elsif Is_Fixed_Point_Type (Typ) then
Id := RE_Type_Class_Fixed_Point;
elsif Is_Floating_Point_Type (Typ) then
Id := RE_Type_Class_Floating_Point;
elsif Is_Array_Type (Typ) then
Id := RE_Type_Class_Array;
elsif Is_Record_Type (Typ) then
Id := RE_Type_Class_Record;
elsif Is_Access_Type (Typ) then
Id := RE_Type_Class_Access;
elsif Is_Enumeration_Type (Typ) then
Id := RE_Type_Class_Enumeration;
elsif Is_Task_Type (Typ) then
Id := RE_Type_Class_Task;
-- We treat protected types like task types. It would make more
-- sense to have another enumeration value, but after all the
-- whole point of this feature is to be exactly DEC compatible,
-- and changing the type Type_Class would not meet this requirement.
elsif Is_Protected_Type (Typ) then
Id := RE_Type_Class_Task;
-- Not clear if there are any other possibilities, but if there
-- are, then we will treat them as the address case.
else
Id := RE_Type_Class_Address;
end if;
Rewrite (N, New_Occurrence_Of (RTE (Id), Loc));
end Type_Class;
-----------------------
-- Unbiased_Rounding --
-----------------------
when Attribute_Unbiased_Rounding =>
Fold_Ureal
(N,
Eval_Fat.Unbiased_Rounding (P_Base_Type, Expr_Value_R (E1)),
Static);
-------------------------
-- Unconstrained_Array --
-------------------------
when Attribute_Unconstrained_Array => Unconstrained_Array : declare
Typ : constant Entity_Id := Underlying_Type (P_Type);
begin
Rewrite (N, New_Occurrence_Of (
Boolean_Literals (
Is_Array_Type (P_Type)
and then not Is_Constrained (Typ)), Loc));
-- Analyze and resolve as boolean, note that this attribute is
-- a static attribute in GNAT.
Analyze_And_Resolve (N, Standard_Boolean);
Static := True;
Set_Is_Static_Expression (N, True);
end Unconstrained_Array;
-- Attribute Update is never static
when Attribute_Update =>
return;
---------------
-- VADS_Size --
---------------
-- Processing is shared with Size
---------
-- Val --
---------
when Attribute_Val =>
if Expr_Value (E1) < Expr_Value (Type_Low_Bound (P_Base_Type))
or else
Expr_Value (E1) > Expr_Value (Type_High_Bound (P_Base_Type))
then
Apply_Compile_Time_Constraint_Error
(N, "Val expression out of range",
CE_Range_Check_Failed,
Warn => not Static);
Check_Expressions;
return;
else
Fold_Uint (N, Expr_Value (E1), Static);
end if;
----------------
-- Value_Size --
----------------
-- The Value_Size attribute for a type returns the RM size of the type.
-- This an always be folded for scalar types, and can also be folded for
-- non-scalar types if the size is set. This is one of the places where
-- it is annoying that a size of zero means two things!
when Attribute_Value_Size => Value_Size : declare
P_TypeA : constant Entity_Id := Underlying_Type (P_Type);
begin
if Is_Scalar_Type (P_TypeA) or else RM_Size (P_TypeA) /= Uint_0 then
Fold_Uint (N, RM_Size (P_TypeA), Static);
end if;
end Value_Size;
-------------
-- Version --
-------------
-- Version can never be static
when Attribute_Version =>
null;
----------------
-- Wide_Image --
----------------
-- Wide_Image is a scalar attribute, but is never static, because it
-- is not a static function (having a non-scalar argument (RM 4.9(22))
when Attribute_Wide_Image =>
null;
---------------------
-- Wide_Wide_Image --
---------------------
-- Wide_Wide_Image is a scalar attribute but is never static, because it
-- is not a static function (having a non-scalar argument (RM 4.9(22)).
when Attribute_Wide_Wide_Image =>
null;
---------------------
-- Wide_Wide_Width --
---------------------
-- Processing for Wide_Wide_Width is combined with Width
----------------
-- Wide_Width --
----------------
-- Processing for Wide_Width is combined with Width
-----------
-- Width --
-----------
-- This processing also handles the case of Wide_[Wide_]Width
when Attribute_Width
| Attribute_Wide_Width
| Attribute_Wide_Wide_Width
=>
if Compile_Time_Known_Bounds (P_Type) then
-- Floating-point types
if Is_Floating_Point_Type (P_Type) then
-- Width is zero for a null range (RM 3.5 (38))
if Expr_Value_R (Type_High_Bound (P_Type)) <
Expr_Value_R (Type_Low_Bound (P_Type))
then
Fold_Uint (N, Uint_0, Static);
else
-- For floating-point, we have +N.dddE+nnn where length
-- of ddd is determined by type'Digits - 1, but is one
-- if Digits is one (RM 3.5 (33)).
-- nnn is set to 2 for Short_Float and Float (32 bit
-- floats), and 3 for Long_Float and Long_Long_Float.
-- For machines where Long_Long_Float is the IEEE
-- extended precision type, the exponent takes 4 digits.
declare
Len : Int :=
Int'Max (2, UI_To_Int (Digits_Value (P_Type)));
begin
if Esize (P_Type) <= 32 then
Len := Len + 6;
elsif Esize (P_Type) = 64 then
Len := Len + 7;
else
Len := Len + 8;
end if;
Fold_Uint (N, UI_From_Int (Len), Static);
end;
end if;
-- Fixed-point types
elsif Is_Fixed_Point_Type (P_Type) then
-- Width is zero for a null range (RM 3.5 (38))
if Expr_Value (Type_High_Bound (P_Type)) <
Expr_Value (Type_Low_Bound (P_Type))
then
Fold_Uint (N, Uint_0, Static);
-- The non-null case depends on the specific real type
else
-- For fixed-point type width is Fore + 1 + Aft (RM 3.5(34))
Fold_Uint
(N, UI_From_Int (Fore_Value + 1) + Aft_Value (P_Type),
Static);
end if;
-- Discrete types
else
declare
R : constant Entity_Id := Root_Type (P_Type);
Lo : constant Uint := Expr_Value (Type_Low_Bound (P_Type));
Hi : constant Uint := Expr_Value (Type_High_Bound (P_Type));
W : Nat;
Wt : Nat;
T : Uint;
L : Node_Id;
C : Character;
begin
-- Empty ranges
if Lo > Hi then
W := 0;
-- Width for types derived from Standard.Character
-- and Standard.Wide_[Wide_]Character.
elsif Is_Standard_Character_Type (P_Type) then
W := 0;
-- Set W larger if needed
for J in UI_To_Int (Lo) .. UI_To_Int (Hi) loop
-- All wide characters look like Hex_hhhhhhhh
if J > 255 then
-- No need to compute this more than once
exit;
else
C := Character'Val (J);
-- Test for all cases where Character'Image
-- yields an image that is longer than three
-- characters. First the cases of Reserved_xxx
-- names (length = 12).
case C is
when Reserved_128
| Reserved_129
| Reserved_132
| Reserved_153
=>
Wt := 12;
when BS
| CR
| EM
| FF
| FS
| GS
| HT
| LF
| MW
| PM
| RI
| RS
| SI
| SO
| ST
| US
| VT
=>
Wt := 2;
when ACK
| APC
| BEL
| BPH
| CAN
| CCH
| CSI
| DC1
| DC2
| DC3
| DC4
| DCS
| DEL
| DLE
| ENQ
| EOT
| EPA
| ESA
| ESC
| ETB
| ETX
| HTJ
| HTS
| NAK
| NBH
| NEL
| NUL
| OSC
| PLD
| PLU
| PU1
| PU2
| SCI
| SOH
| SOS
| SPA
| SS2
| SS3
| SSA
| STS
| STX
| SUB
| SYN
| VTS
=>
Wt := 3;
when Space .. Tilde
| No_Break_Space .. LC_Y_Diaeresis
=>
-- Special case of soft hyphen in Ada 2005
if C = Character'Val (16#AD#)
and then Ada_Version >= Ada_2005
then
Wt := 11;
else
Wt := 3;
end if;
end case;
W := Int'Max (W, Wt);
end if;
end loop;
-- Width for types derived from Standard.Boolean
elsif R = Standard_Boolean then
if Lo = 0 then
W := 5; -- FALSE
else
W := 4; -- TRUE
end if;
-- Width for integer types
elsif Is_Integer_Type (P_Type) then
T := UI_Max (abs Lo, abs Hi);
W := 2;
while T >= 10 loop
W := W + 1;
T := T / 10;
end loop;
-- User declared enum type with discard names
elsif Discard_Names (R) then
-- If range is null, result is zero, that has already
-- been dealt with, so what we need is the power of ten
-- that accomodates the Pos of the largest value, which
-- is the high bound of the range + one for the space.
W := 1;
T := Hi;
while T /= 0 loop
T := T / 10;
W := W + 1;
end loop;
-- Only remaining possibility is user declared enum type
-- with normal case of Discard_Names not active.
else
pragma Assert (Is_Enumeration_Type (P_Type));
W := 0;
L := First_Literal (P_Type);
while Present (L) loop
-- Only pay attention to in range characters
if Lo <= Enumeration_Pos (L)
and then Enumeration_Pos (L) <= Hi
then
-- For Width case, use decoded name
if Id = Attribute_Width then
Get_Decoded_Name_String (Chars (L));
Wt := Nat (Name_Len);
-- For Wide_[Wide_]Width, use encoded name, and
-- then adjust for the encoding.
else
Get_Name_String (Chars (L));
-- Character literals are always of length 3
if Name_Buffer (1) = 'Q' then
Wt := 3;
-- Otherwise loop to adjust for upper/wide chars
else
Wt := Nat (Name_Len);
for J in 1 .. Name_Len loop
if Name_Buffer (J) = 'U' then
Wt := Wt - 2;
elsif Name_Buffer (J) = 'W' then
Wt := Wt - 4;
end if;
end loop;
end if;
end if;
W := Int'Max (W, Wt);
end if;
Next_Literal (L);
end loop;
end if;
Fold_Uint (N, UI_From_Int (W), Static);
end;
end if;
end if;
-- The following attributes denote functions that cannot be folded
when Attribute_From_Any
| Attribute_To_Any
| Attribute_TypeCode
=>
null;
-- The following attributes can never be folded, and furthermore we
-- should not even have entered the case statement for any of these.
-- Note that in some cases, the values have already been folded as
-- a result of the processing in Analyze_Attribute or earlier in
-- this procedure.
when Attribute_Abort_Signal
| Attribute_Access
| Attribute_Address
| Attribute_Address_Size
| Attribute_Asm_Input
| Attribute_Asm_Output
| Attribute_Base
| Attribute_Bit_Order
| Attribute_Bit_Position
| Attribute_Callable
| Attribute_Caller
| Attribute_Class
| Attribute_Code_Address
| Attribute_Compiler_Version
| Attribute_Count
| Attribute_Default_Bit_Order
| Attribute_Default_Scalar_Storage_Order
| Attribute_Deref
| Attribute_Elaborated
| Attribute_Elab_Body
| Attribute_Elab_Spec
| Attribute_Elab_Subp_Body
| Attribute_Enabled
| Attribute_External_Tag
| Attribute_Fast_Math
| Attribute_First_Bit
| Attribute_Img
| Attribute_Input
| Attribute_Last_Bit
| Attribute_Library_Level
| Attribute_Maximum_Alignment
| Attribute_Old
| Attribute_Output
| Attribute_Partition_ID
| Attribute_Pool_Address
| Attribute_Position
| Attribute_Priority
| Attribute_Read
| Attribute_Result
| Attribute_Scalar_Storage_Order
| Attribute_Simple_Storage_Pool
| Attribute_Storage_Pool
| Attribute_Storage_Size
| Attribute_Storage_Unit
| Attribute_Stub_Type
| Attribute_System_Allocator_Alignment
| Attribute_Tag
| Attribute_Target_Name
| Attribute_Terminated
| Attribute_To_Address
| Attribute_Type_Key
| Attribute_Unchecked_Access
| Attribute_Universal_Literal_String
| Attribute_Unrestricted_Access
| Attribute_Valid
| Attribute_Valid_Scalars
| Attribute_Value
| Attribute_Wchar_T_Size
| Attribute_Wide_Value
| Attribute_Wide_Wide_Value
| Attribute_Word_Size
| Attribute_Write
=>
raise Program_Error;
end case;
-- At the end of the case, one more check. If we did a static evaluation
-- so that the result is now a literal, then set Is_Static_Expression
-- in the constant only if the prefix type is a static subtype. For
-- non-static subtypes, the folding is still OK, but not static.
-- An exception is the GNAT attribute Constrained_Array which is
-- defined to be a static attribute in all cases.
if Nkind_In (N, N_Integer_Literal,
N_Real_Literal,
N_Character_Literal,
N_String_Literal)
or else (Is_Entity_Name (N)
and then Ekind (Entity (N)) = E_Enumeration_Literal)
then
Set_Is_Static_Expression (N, Static);
-- If this is still an attribute reference, then it has not been folded
-- and that means that its expressions are in a non-static context.
elsif Nkind (N) = N_Attribute_Reference then
Check_Expressions;
-- Note: the else case not covered here are odd cases where the
-- processing has transformed the attribute into something other
-- than a constant. Nothing more to do in such cases.
else
null;
end if;
end Eval_Attribute;
------------------------------
-- Is_Anonymous_Tagged_Base --
------------------------------
function Is_Anonymous_Tagged_Base
(Anon : Entity_Id;
Typ : Entity_Id) return Boolean
is
begin
return
Anon = Current_Scope
and then Is_Itype (Anon)
and then Associated_Node_For_Itype (Anon) = Parent (Typ);
end Is_Anonymous_Tagged_Base;
--------------------------------
-- Name_Implies_Lvalue_Prefix --
--------------------------------
function Name_Implies_Lvalue_Prefix (Nam : Name_Id) return Boolean is
pragma Assert (Is_Attribute_Name (Nam));
begin
return Attribute_Name_Implies_Lvalue_Prefix (Get_Attribute_Id (Nam));
end Name_Implies_Lvalue_Prefix;
-----------------------
-- Resolve_Attribute --
-----------------------
procedure Resolve_Attribute (N : Node_Id; Typ : Entity_Id) is
Loc : constant Source_Ptr := Sloc (N);
P : constant Node_Id := Prefix (N);
Aname : constant Name_Id := Attribute_Name (N);
Attr_Id : constant Attribute_Id := Get_Attribute_Id (Aname);
Btyp : constant Entity_Id := Base_Type (Typ);
Des_Btyp : Entity_Id;
Index : Interp_Index;
It : Interp;
Nom_Subt : Entity_Id;
procedure Accessibility_Message;
-- Error, or warning within an instance, if the static accessibility
-- rules of 3.10.2 are violated.
function Declared_Within_Generic_Unit
(Entity : Entity_Id;
Generic_Unit : Node_Id) return Boolean;
-- Returns True if Declared_Entity is declared within the declarative
-- region of Generic_Unit; otherwise returns False.
---------------------------
-- Accessibility_Message --
---------------------------
procedure Accessibility_Message is
Indic : Node_Id := Parent (Parent (N));
begin
-- In an instance, this is a runtime check, but one we
-- know will fail, so generate an appropriate warning.
if In_Instance_Body then
Error_Msg_Warn := SPARK_Mode /= On;
Error_Msg_F
("non-local pointer cannot point to local object<<", P);
Error_Msg_F ("\Program_Error [<<", P);
Rewrite (N,
Make_Raise_Program_Error (Loc,
Reason => PE_Accessibility_Check_Failed));
Set_Etype (N, Typ);
return;
else
Error_Msg_F ("non-local pointer cannot point to local object", P);
-- Check for case where we have a missing access definition
if Is_Record_Type (Current_Scope)
and then
Nkind_In (Parent (N), N_Discriminant_Association,
N_Index_Or_Discriminant_Constraint)
then
Indic := Parent (Parent (N));
while Present (Indic)
and then Nkind (Indic) /= N_Subtype_Indication
loop
Indic := Parent (Indic);
end loop;
if Present (Indic) then
Error_Msg_NE
("\use an access definition for" &
" the access discriminant of&",
N, Entity (Subtype_Mark (Indic)));
end if;
end if;
end if;
end Accessibility_Message;
----------------------------------
-- Declared_Within_Generic_Unit --
----------------------------------
function Declared_Within_Generic_Unit
(Entity : Entity_Id;
Generic_Unit : Node_Id) return Boolean
is
Generic_Encloser : Node_Id := Enclosing_Generic_Unit (Entity);
begin
while Present (Generic_Encloser) loop
if Generic_Encloser = Generic_Unit then
return True;
end if;
-- We have to step to the scope of the generic's entity, because
-- otherwise we'll just get back the same generic.
Generic_Encloser :=
Enclosing_Generic_Unit
(Scope (Defining_Entity (Generic_Encloser)));
end loop;
return False;
end Declared_Within_Generic_Unit;
-- Start of processing for Resolve_Attribute
begin
-- If error during analysis, no point in continuing, except for array
-- types, where we get better recovery by using unconstrained indexes
-- than nothing at all (see Check_Array_Type).
if Error_Posted (N)
and then Attr_Id /= Attribute_First
and then Attr_Id /= Attribute_Last
and then Attr_Id /= Attribute_Length
and then Attr_Id /= Attribute_Range
then
return;
end if;
-- If attribute was universal type, reset to actual type
if Etype (N) = Universal_Integer
or else Etype (N) = Universal_Real
then
Set_Etype (N, Typ);
end if;
-- Remaining processing depends on attribute
case Attr_Id is
------------
-- Access --
------------
-- For access attributes, if the prefix denotes an entity, it is
-- interpreted as a name, never as a call. It may be overloaded,
-- in which case resolution uses the profile of the context type.
-- Otherwise prefix must be resolved.
when Attribute_Access
| Attribute_Unchecked_Access
| Attribute_Unrestricted_Access
=>
-- Note possible modification if we have a variable
if Is_Variable (P) then
declare
PN : constant Node_Id := Parent (N);
Nm : Node_Id;
Note : Boolean := True;
-- Skip this for the case of Unrestricted_Access occuring in
-- the context of a Valid check, since this otherwise leads
-- to a missed warning (the Valid check does not really
-- modify!) If this case, Note will be reset to False.
-- Skip it as well if the type is an Acccess_To_Constant,
-- given that no use of the value can modify the prefix.
begin
if Attr_Id = Attribute_Unrestricted_Access
and then Nkind (PN) = N_Function_Call
then
Nm := Name (PN);
if Nkind (Nm) = N_Expanded_Name
and then Chars (Nm) = Name_Valid
and then Nkind (Prefix (Nm)) = N_Identifier
and then Chars (Prefix (Nm)) = Name_Attr_Long_Float
then
Note := False;
end if;
elsif Is_Access_Constant (Typ) then
Note := False;
end if;
if Note then
Note_Possible_Modification (P, Sure => False);
end if;
end;
end if;
-- The following comes from a query concerning improper use of
-- universal_access in equality tests involving anonymous access
-- types. Another good reason for 'Ref, but for now disable the
-- test, which breaks several filed tests???
if Ekind (Typ) = E_Anonymous_Access_Type
and then Nkind_In (Parent (N), N_Op_Eq, N_Op_Ne)
and then False
then
Error_Msg_N ("need unique type to resolve 'Access", N);
Error_Msg_N ("\qualify attribute with some access type", N);
end if;
-- Case where prefix is an entity name
if Is_Entity_Name (P) then
-- Deal with case where prefix itself is overloaded
if Is_Overloaded (P) then
Get_First_Interp (P, Index, It);
while Present (It.Nam) loop
if Type_Conformant (Designated_Type (Typ), It.Nam) then
Set_Entity (P, It.Nam);
-- The prefix is definitely NOT overloaded anymore at
-- this point, so we reset the Is_Overloaded flag to
-- avoid any confusion when reanalyzing the node.
Set_Is_Overloaded (P, False);
Set_Is_Overloaded (N, False);
Generate_Reference (Entity (P), P);
exit;
end if;
Get_Next_Interp (Index, It);
end loop;
-- If Prefix is a subprogram name, this reference freezes,
-- but not if within spec expression mode. The profile of
-- the subprogram is not frozen at this point.
if not In_Spec_Expression then
Freeze_Before (N, Entity (P), Do_Freeze_Profile => False);
end if;
-- If it is a type, there is nothing to resolve.
-- If it is a subprogram, do not freeze its profile.
-- If it is an object, complete its resolution.
elsif Is_Overloadable (Entity (P)) then
if not In_Spec_Expression then
Freeze_Before (N, Entity (P), Do_Freeze_Profile => False);
end if;
-- Nothing to do if prefix is a type name
elsif Is_Type (Entity (P)) then
null;
-- Otherwise non-overloaded other case, resolve the prefix
else
Resolve (P);
end if;
-- Some further error checks
Error_Msg_Name_1 := Aname;
if not Is_Entity_Name (P) then
null;
elsif Is_Overloadable (Entity (P))
and then Is_Abstract_Subprogram (Entity (P))
then
Error_Msg_F ("prefix of % attribute cannot be abstract", P);
Set_Etype (N, Any_Type);
elsif Ekind (Entity (P)) = E_Enumeration_Literal then
Error_Msg_F
("prefix of % attribute cannot be enumeration literal", P);
Set_Etype (N, Any_Type);
-- An attempt to take 'Access of a function that renames an
-- enumeration literal. Issue a specialized error message.
elsif Ekind (Entity (P)) = E_Function
and then Present (Alias (Entity (P)))
and then Ekind (Alias (Entity (P))) = E_Enumeration_Literal
then
Error_Msg_F
("prefix of % attribute cannot be function renaming "
& "an enumeration literal", P);
Set_Etype (N, Any_Type);
elsif Convention (Entity (P)) = Convention_Intrinsic then
Error_Msg_F ("prefix of % attribute cannot be intrinsic", P);
Set_Etype (N, Any_Type);
end if;
-- Assignments, return statements, components of aggregates,
-- generic instantiations will require convention checks if
-- the type is an access to subprogram. Given that there will
-- also be accessibility checks on those, this is where the
-- checks can eventually be centralized ???
if Ekind_In (Btyp, E_Access_Subprogram_Type,
E_Anonymous_Access_Subprogram_Type,
E_Access_Protected_Subprogram_Type,
E_Anonymous_Access_Protected_Subprogram_Type)
then
-- Deal with convention mismatch
if Convention (Designated_Type (Btyp)) /=
Convention (Entity (P))
then
Error_Msg_FE
("subprogram & has wrong convention", P, Entity (P));
Error_Msg_Sloc := Sloc (Btyp);
Error_Msg_FE ("\does not match & declared#", P, Btyp);
if not Is_Itype (Btyp)
and then not Has_Convention_Pragma (Btyp)
then
Error_Msg_FE
("\probable missing pragma Convention for &",
P, Btyp);
end if;
else
Check_Subtype_Conformant
(New_Id => Entity (P),
Old_Id => Designated_Type (Btyp),
Err_Loc => P);
end if;
if Attr_Id = Attribute_Unchecked_Access then
Error_Msg_Name_1 := Aname;
Error_Msg_F
("attribute% cannot be applied to a subprogram", P);
elsif Aname = Name_Unrestricted_Access then
null; -- Nothing to check
-- Check the static accessibility rule of 3.10.2(32).
-- This rule also applies within the private part of an
-- instantiation. This rule does not apply to anonymous
-- access-to-subprogram types in access parameters.
elsif Attr_Id = Attribute_Access
and then not In_Instance_Body
and then
(Ekind (Btyp) = E_Access_Subprogram_Type
or else Is_Local_Anonymous_Access (Btyp))
and then Subprogram_Access_Level (Entity (P)) >
Type_Access_Level (Btyp)
then
Error_Msg_F
("subprogram must not be deeper than access type", P);
-- Check the restriction of 3.10.2(32) that disallows the
-- access attribute within a generic body when the ultimate
-- ancestor of the type of the attribute is declared outside
-- of the generic unit and the subprogram is declared within
-- that generic unit. This includes any such attribute that
-- occurs within the body of a generic unit that is a child
-- of the generic unit where the subprogram is declared.
-- The rule also prohibits applying the attribute when the
-- access type is a generic formal access type (since the
-- level of the actual type is not known). This restriction
-- does not apply when the attribute type is an anonymous
-- access-to-subprogram type. Note that this check was
-- revised by AI-229, because the original Ada 95 rule
-- was too lax. The original rule only applied when the
-- subprogram was declared within the body of the generic,
-- which allowed the possibility of dangling references).
-- The rule was also too strict in some cases, in that it
-- didn't permit the access to be declared in the generic
-- spec, whereas the revised rule does (as long as it's not
-- a formal type).
-- There are a couple of subtleties of the test for applying
-- the check that are worth noting. First, we only apply it
-- when the levels of the subprogram and access type are the
-- same (the case where the subprogram is statically deeper
-- was applied above, and the case where the type is deeper
-- is always safe). Second, we want the check to apply
-- within nested generic bodies and generic child unit
-- bodies, but not to apply to an attribute that appears in
-- the generic unit's specification. This is done by testing
-- that the attribute's innermost enclosing generic body is
-- not the same as the innermost generic body enclosing the
-- generic unit where the subprogram is declared (we don't
-- want the check to apply when the access attribute is in
-- the spec and there's some other generic body enclosing
-- generic). Finally, there's no point applying the check
-- when within an instance, because any violations will have
-- been caught by the compilation of the generic unit.
-- We relax this check in Relaxed_RM_Semantics mode for
-- compatibility with legacy code for use by Ada source
-- code analyzers (e.g. CodePeer).
elsif Attr_Id = Attribute_Access
and then not Relaxed_RM_Semantics
and then not In_Instance
and then Present (Enclosing_Generic_Unit (Entity (P)))
and then Present (Enclosing_Generic_Body (N))
and then Enclosing_Generic_Body (N) /=
Enclosing_Generic_Body
(Enclosing_Generic_Unit (Entity (P)))
and then Subprogram_Access_Level (Entity (P)) =
Type_Access_Level (Btyp)
and then Ekind (Btyp) /=
E_Anonymous_Access_Subprogram_Type
and then Ekind (Btyp) /=
E_Anonymous_Access_Protected_Subprogram_Type
then
-- The attribute type's ultimate ancestor must be
-- declared within the same generic unit as the
-- subprogram is declared (including within another
-- nested generic unit). The error message is
-- specialized to say "ancestor" for the case where the
-- access type is not its own ancestor, since saying
-- simply "access type" would be very confusing.
if not Declared_Within_Generic_Unit
(Root_Type (Btyp),
Enclosing_Generic_Unit (Entity (P)))
then
Error_Msg_N
("''Access attribute not allowed in generic body",
N);
if Root_Type (Btyp) = Btyp then
Error_Msg_NE
("\because " &
"access type & is declared outside " &
"generic unit (RM 3.10.2(32))", N, Btyp);
else
Error_Msg_NE
("\because ancestor of " &
"access type & is declared outside " &
"generic unit (RM 3.10.2(32))", N, Btyp);
end if;
Error_Msg_NE
("\move ''Access to private part, or " &
"(Ada 2005) use anonymous access type instead of &",
N, Btyp);
-- If the ultimate ancestor of the attribute's type is
-- a formal type, then the attribute is illegal because
-- the actual type might be declared at a higher level.
-- The error message is specialized to say "ancestor"
-- for the case where the access type is not its own
-- ancestor, since saying simply "access type" would be
-- very confusing.
elsif Is_Generic_Type (Root_Type (Btyp)) then
if Root_Type (Btyp) = Btyp then
Error_Msg_N
("access type must not be a generic formal type",
N);
else
Error_Msg_N
("ancestor access type must not be a generic " &
"formal type", N);
end if;
end if;
end if;
end if;
-- If this is a renaming, an inherited operation, or a
-- subprogram instance, use the original entity. This may make
-- the node type-inconsistent, so this transformation can only
-- be done if the node will not be reanalyzed. In particular,
-- if it is within a default expression, the transformation
-- must be delayed until the default subprogram is created for
-- it, when the enclosing subprogram is frozen.
if Is_Entity_Name (P)
and then Is_Overloadable (Entity (P))
and then Present (Alias (Entity (P)))
and then Expander_Active
then
Rewrite (P,
New_Occurrence_Of (Alias (Entity (P)), Sloc (P)));
end if;
elsif Nkind (P) = N_Selected_Component
and then Is_Overloadable (Entity (Selector_Name (P)))
then
-- Protected operation. If operation is overloaded, must
-- disambiguate. Prefix that denotes protected object itself
-- is resolved with its own type.
if Attr_Id = Attribute_Unchecked_Access then
Error_Msg_Name_1 := Aname;
Error_Msg_F
("attribute% cannot be applied to protected operation", P);
end if;
Resolve (Prefix (P));
Generate_Reference (Entity (Selector_Name (P)), P);
-- Implement check implied by 3.10.2 (18.1/2) : F.all'access is
-- statically illegal if F is an anonymous access to subprogram.
elsif Nkind (P) = N_Explicit_Dereference
and then Is_Entity_Name (Prefix (P))
and then Ekind (Etype (Entity (Prefix (P)))) =
E_Anonymous_Access_Subprogram_Type
then
Error_Msg_N ("anonymous access to subprogram "
& "has deeper accessibility than any master", P);
elsif Is_Overloaded (P) then
-- Use the designated type of the context to disambiguate
-- Note that this was not strictly conformant to Ada 95,
-- but was the implementation adopted by most Ada 95 compilers.
-- The use of the context type to resolve an Access attribute
-- reference is now mandated in AI-235 for Ada 2005.
declare
Index : Interp_Index;
It : Interp;
begin
Get_First_Interp (P, Index, It);
while Present (It.Typ) loop
if Covers (Designated_Type (Typ), It.Typ) then
Resolve (P, It.Typ);
exit;
end if;
Get_Next_Interp (Index, It);
end loop;
end;
else
Resolve (P);
end if;
-- X'Access is illegal if X denotes a constant and the access type
-- is access-to-variable. Same for 'Unchecked_Access. The rule
-- does not apply to 'Unrestricted_Access. If the reference is a
-- default-initialized aggregate component for a self-referential
-- type the reference is legal.
if not (Ekind (Btyp) = E_Access_Subprogram_Type
or else Ekind (Btyp) = E_Anonymous_Access_Subprogram_Type
or else (Is_Record_Type (Btyp)
and then
Present (Corresponding_Remote_Type (Btyp)))
or else Ekind (Btyp) = E_Access_Protected_Subprogram_Type
or else Ekind (Btyp)
= E_Anonymous_Access_Protected_Subprogram_Type
or else Is_Access_Constant (Btyp)
or else Is_Variable (P)
or else Attr_Id = Attribute_Unrestricted_Access)
then
if Is_Entity_Name (P)
and then Is_Type (Entity (P))
then
-- Legality of a self-reference through an access
-- attribute has been verified in Analyze_Access_Attribute.
null;
elsif Comes_From_Source (N) then
Error_Msg_F ("access-to-variable designates constant", P);
end if;
end if;
Des_Btyp := Designated_Type (Btyp);
if Ada_Version >= Ada_2005
and then Is_Incomplete_Type (Des_Btyp)
then
-- Ada 2005 (AI-412): If the (sub)type is a limited view of an
-- imported entity, and the non-limited view is visible, make
-- use of it. If it is an incomplete subtype, use the base type
-- in any case.
if From_Limited_With (Des_Btyp)
and then Present (Non_Limited_View (Des_Btyp))
then
Des_Btyp := Non_Limited_View (Des_Btyp);
elsif Ekind (Des_Btyp) = E_Incomplete_Subtype then
Des_Btyp := Etype (Des_Btyp);
end if;
end if;
if (Attr_Id = Attribute_Access
or else
Attr_Id = Attribute_Unchecked_Access)
and then (Ekind (Btyp) = E_General_Access_Type
or else Ekind (Btyp) = E_Anonymous_Access_Type)
then
-- Ada 2005 (AI-230): Check the accessibility of anonymous
-- access types for stand-alone objects, record and array
-- components, and return objects. For a component definition
-- the level is the same of the enclosing composite type.
if Ada_Version >= Ada_2005
and then (Is_Local_Anonymous_Access (Btyp)
-- Handle cases where Btyp is the anonymous access
-- type of an Ada 2012 stand-alone object.
or else Nkind (Associated_Node_For_Itype (Btyp)) =
N_Object_Declaration)
and then
Object_Access_Level (P) > Deepest_Type_Access_Level (Btyp)
and then Attr_Id = Attribute_Access
then
-- In an instance, this is a runtime check, but one we know
-- will fail, so generate an appropriate warning. As usual,
-- this kind of warning is an error in SPARK mode.
if In_Instance_Body then
Error_Msg_Warn := SPARK_Mode /= On;
Error_Msg_F
("non-local pointer cannot point to local object<<", P);
Error_Msg_F ("\Program_Error [<<", P);
Rewrite (N,
Make_Raise_Program_Error (Loc,
Reason => PE_Accessibility_Check_Failed));
Set_Etype (N, Typ);
else
Error_Msg_F
("non-local pointer cannot point to local object", P);
end if;
end if;
if Is_Dependent_Component_Of_Mutable_Object (P) then
Error_Msg_F
("illegal attribute for discriminant-dependent component",
P);
end if;
-- Check static matching rule of 3.10.2(27). Nominal subtype
-- of the prefix must statically match the designated type.
Nom_Subt := Etype (P);
if Is_Constr_Subt_For_U_Nominal (Nom_Subt) then
Nom_Subt := Base_Type (Nom_Subt);
end if;
if Is_Tagged_Type (Designated_Type (Typ)) then
-- If the attribute is in the context of an access
-- parameter, then the prefix is allowed to be of
-- the class-wide type (by AI-127).
if Ekind (Typ) = E_Anonymous_Access_Type then
if not Covers (Designated_Type (Typ), Nom_Subt)
and then not Covers (Nom_Subt, Designated_Type (Typ))
then
declare
Desig : Entity_Id;
begin
Desig := Designated_Type (Typ);
if Is_Class_Wide_Type (Desig) then
Desig := Etype (Desig);
end if;
if Is_Anonymous_Tagged_Base (Nom_Subt, Desig) then
null;
else
Error_Msg_FE
("type of prefix: & not compatible",
P, Nom_Subt);
Error_Msg_FE
("\with &, the expected designated type",
P, Designated_Type (Typ));
end if;
end;
end if;
elsif not Covers (Designated_Type (Typ), Nom_Subt)
or else
(not Is_Class_Wide_Type (Designated_Type (Typ))
and then Is_Class_Wide_Type (Nom_Subt))
then
Error_Msg_FE
("type of prefix: & is not covered", P, Nom_Subt);
Error_Msg_FE
("\by &, the expected designated type" &
" (RM 3.10.2 (27))", P, Designated_Type (Typ));
end if;
if Is_Class_Wide_Type (Designated_Type (Typ))
and then Has_Discriminants (Etype (Designated_Type (Typ)))
and then Is_Constrained (Etype (Designated_Type (Typ)))
and then Designated_Type (Typ) /= Nom_Subt
then
Apply_Discriminant_Check
(N, Etype (Designated_Type (Typ)));
end if;
-- Ada 2005 (AI-363): Require static matching when designated
-- type has discriminants and a constrained partial view, since
-- in general objects of such types are mutable, so we can't
-- allow the access value to designate a constrained object
-- (because access values must be assumed to designate mutable
-- objects when designated type does not impose a constraint).
elsif Subtypes_Statically_Match (Des_Btyp, Nom_Subt) then
null;
elsif Has_Discriminants (Designated_Type (Typ))
and then not Is_Constrained (Des_Btyp)
and then
(Ada_Version < Ada_2005
or else
not Object_Type_Has_Constrained_Partial_View
(Typ => Designated_Type (Base_Type (Typ)),
Scop => Current_Scope))
then
null;
else
Error_Msg_F
("object subtype must statically match "
& "designated subtype", P);
if Is_Entity_Name (P)
and then Is_Array_Type (Designated_Type (Typ))
then
declare
D : constant Node_Id := Declaration_Node (Entity (P));
begin
Error_Msg_N
("aliased object has explicit bounds??", D);
Error_Msg_N
("\declare without bounds (and with explicit "
& "initialization)??", D);
Error_Msg_N
("\for use with unconstrained access??", D);
end;
end if;
end if;
-- Check the static accessibility rule of 3.10.2(28). Note that
-- this check is not performed for the case of an anonymous
-- access type, since the access attribute is always legal
-- in such a context.
if Attr_Id /= Attribute_Unchecked_Access
and then Ekind (Btyp) = E_General_Access_Type
and then
Object_Access_Level (P) > Deepest_Type_Access_Level (Btyp)
then
Accessibility_Message;
return;
end if;
end if;
if Ekind_In (Btyp, E_Access_Protected_Subprogram_Type,
E_Anonymous_Access_Protected_Subprogram_Type)
then
if Is_Entity_Name (P)
and then not Is_Protected_Type (Scope (Entity (P)))
then
Error_Msg_F ("context requires a protected subprogram", P);
-- Check accessibility of protected object against that of the
-- access type, but only on user code, because the expander
-- creates access references for handlers. If the context is an
-- anonymous_access_to_protected, there are no accessibility
-- checks either. Omit check entirely for Unrestricted_Access.
elsif Object_Access_Level (P) > Deepest_Type_Access_Level (Btyp)
and then Comes_From_Source (N)
and then Ekind (Btyp) = E_Access_Protected_Subprogram_Type
and then Attr_Id /= Attribute_Unrestricted_Access
then
Accessibility_Message;
return;
-- AI05-0225: If the context is not an access to protected
-- function, the prefix must be a variable, given that it may
-- be used subsequently in a protected call.
elsif Nkind (P) = N_Selected_Component
and then not Is_Variable (Prefix (P))
and then Ekind (Entity (Selector_Name (P))) /= E_Function
then
Error_Msg_N
("target object of access to protected procedure "
& "must be variable", N);
elsif Is_Entity_Name (P) then
Check_Internal_Protected_Use (N, Entity (P));
end if;
elsif Ekind_In (Btyp, E_Access_Subprogram_Type,
E_Anonymous_Access_Subprogram_Type)
and then Ekind (Etype (N)) = E_Access_Protected_Subprogram_Type
then
Error_Msg_F ("context requires a non-protected subprogram", P);
end if;
-- The context cannot be a pool-specific type, but this is a
-- legality rule, not a resolution rule, so it must be checked
-- separately, after possibly disambiguation (see AI-245).
if Ekind (Btyp) = E_Access_Type
and then Attr_Id /= Attribute_Unrestricted_Access
then
Wrong_Type (N, Typ);
end if;
-- The context may be a constrained access type (however ill-
-- advised such subtypes might be) so in order to generate a
-- constraint check when needed set the type of the attribute
-- reference to the base type of the context.
Set_Etype (N, Btyp);
-- Check for incorrect atomic/volatile reference (RM C.6(12))
if Attr_Id /= Attribute_Unrestricted_Access then
if Is_Atomic_Object (P)
and then not Is_Atomic (Designated_Type (Typ))
then
Error_Msg_F
("access to atomic object cannot yield access-to-" &
"non-atomic type", P);
elsif Is_Volatile_Object (P)
and then not Is_Volatile (Designated_Type (Typ))
then
Error_Msg_F
("access to volatile object cannot yield access-to-" &
"non-volatile type", P);
end if;
end if;
-- Check for unrestricted access where expected type is a thin
-- pointer to an unconstrained array.
if Non_Aliased_Prefix (N)
and then Has_Size_Clause (Typ)
and then RM_Size (Typ) = System_Address_Size
then
declare
DT : constant Entity_Id := Designated_Type (Typ);
begin
if Is_Array_Type (DT) and then not Is_Constrained (DT) then
Error_Msg_N
("illegal use of Unrestricted_Access attribute", P);
Error_Msg_N
("\attempt to generate thin pointer to unaliased "
& "object", P);
end if;
end;
end if;
-- Mark that address of entity is taken in case of
-- 'Unrestricted_Access or in case of a subprogram.
if Is_Entity_Name (P)
and then (Attr_Id = Attribute_Unrestricted_Access
or else Is_Subprogram (Entity (P)))
then
Set_Address_Taken (Entity (P));
end if;
-- Deal with possible elaboration check
if Is_Entity_Name (P) and then Is_Subprogram (Entity (P)) then
declare
Subp_Id : constant Entity_Id := Entity (P);
Scop : constant Entity_Id := Scope (Subp_Id);
Subp_Decl : constant Node_Id :=
Unit_Declaration_Node (Subp_Id);
Flag_Id : Entity_Id;
Subp_Body : Node_Id;
-- If the access has been taken and the body of the subprogram
-- has not been see yet, indirect calls must be protected with
-- elaboration checks. We have the proper elaboration machinery
-- for subprograms declared in packages, but within a block or
-- a subprogram the body will appear in the same declarative
-- part, and we must insert a check in the eventual body itself
-- using the elaboration flag that we generate now. The check
-- is then inserted when the body is expanded. This processing
-- is not needed for a stand alone expression function because
-- the internally generated spec and body are always inserted
-- as a pair in the same declarative list.
begin
if Expander_Active
and then Comes_From_Source (Subp_Id)
and then Comes_From_Source (N)
and then In_Open_Scopes (Scop)
and then Ekind_In (Scop, E_Block, E_Procedure, E_Function)
and then not Has_Completion (Subp_Id)
and then No (Elaboration_Entity (Subp_Id))
and then Nkind (Subp_Decl) = N_Subprogram_Declaration
and then Nkind (Original_Node (Subp_Decl)) /=
N_Expression_Function
then
-- Create elaboration variable for it
Flag_Id := Make_Temporary (Loc, 'E');
Set_Elaboration_Entity (Subp_Id, Flag_Id);
Set_Is_Frozen (Flag_Id);
-- Insert declaration for flag after subprogram
-- declaration. Note that attribute reference may
-- appear within a nested scope.
Insert_After_And_Analyze (Subp_Decl,
Make_Object_Declaration (Loc,
Defining_Identifier => Flag_Id,
Object_Definition =>
New_Occurrence_Of (Standard_Short_Integer, Loc),
Expression =>
Make_Integer_Literal (Loc, Uint_0)));
end if;
-- Taking the 'Access of an expression function freezes its
-- expression (RM 13.14 10.3/3). This does not apply to an
-- expression function that acts as a completion because the
-- generated body is immediately analyzed and the expression
-- is automatically frozen.
if Is_Expression_Function (Subp_Id)
and then Present (Corresponding_Body (Subp_Decl))
then
Subp_Body :=
Unit_Declaration_Node (Corresponding_Body (Subp_Decl));
-- The body has already been analyzed when the expression
-- function acts as a completion.
if Analyzed (Subp_Body) then
null;
-- Attribute 'Access may appear within the generated body
-- of the expression function subject to the attribute:
-- function F is (... F'Access ...);
-- If the expression function is on the scope stack, then
-- the body is currently being analyzed. Do not reanalyze
-- it because this will lead to infinite recursion.
elsif In_Open_Scopes (Subp_Id) then
null;
-- If reference to the expression function appears in an
-- inner scope, for example as an actual in an instance,
-- this is not a freeze point either.
elsif Scope (Subp_Id) /= Current_Scope then
null;
-- Analyze the body of the expression function to freeze
-- the expression. This takes care of the case where the
-- 'Access is part of dispatch table initialization and
-- the generated body of the expression function has not
-- been analyzed yet.
else
Analyze (Subp_Body);
end if;
end if;
end;
end if;
-------------
-- Address --
-------------
-- Deal with resolving the type for Address attribute, overloading
-- is not permitted here, since there is no context to resolve it.
when Attribute_Address
| Attribute_Code_Address
=>
-- To be safe, assume that if the address of a variable is taken,
-- it may be modified via this address, so note modification.
if Is_Variable (P) then
Note_Possible_Modification (P, Sure => False);
end if;
if Nkind (P) in N_Subexpr
and then Is_Overloaded (P)
then
Get_First_Interp (P, Index, It);
Get_Next_Interp (Index, It);
if Present (It.Nam) then
Error_Msg_Name_1 := Aname;
Error_Msg_F
("prefix of % attribute cannot be overloaded", P);
end if;
end if;
if not Is_Entity_Name (P)
or else not Is_Overloadable (Entity (P))
then
if not Is_Task_Type (Etype (P))
or else Nkind (P) = N_Explicit_Dereference
then
Resolve (P);
end if;
end if;
-- If this is the name of a derived subprogram, or that of a
-- generic actual, the address is that of the original entity.
if Is_Entity_Name (P)
and then Is_Overloadable (Entity (P))
and then Present (Alias (Entity (P)))
then
Rewrite (P,
New_Occurrence_Of (Alias (Entity (P)), Sloc (P)));
end if;
if Is_Entity_Name (P) then
Set_Address_Taken (Entity (P));
end if;
if Nkind (P) = N_Slice then
-- Arr (X .. Y)'address is identical to Arr (X)'address,
-- even if the array is packed and the slice itself is not
-- addressable. Transform the prefix into an indexed component.
-- Note that the transformation is safe only if we know that
-- the slice is non-null. That is because a null slice can have
-- an out of bounds index value.
-- Right now, gigi blows up if given 'Address on a slice as a
-- result of some incorrect freeze nodes generated by the front
-- end, and this covers up that bug in one case, but the bug is
-- likely still there in the cases not handled by this code ???
-- It's not clear what 'Address *should* return for a null
-- slice with out of bounds indexes, this might be worth an ARG
-- discussion ???
-- One approach would be to do a length check unconditionally,
-- and then do the transformation below unconditionally, but
-- analyze with checks off, avoiding the problem of the out of
-- bounds index. This approach would interpret the address of
-- an out of bounds null slice as being the address where the
-- array element would be if there was one, which is probably
-- as reasonable an interpretation as any ???
declare
Loc : constant Source_Ptr := Sloc (P);
D : constant Node_Id := Discrete_Range (P);
Lo : Node_Id;
begin
if Is_Entity_Name (D)
and then
Not_Null_Range
(Type_Low_Bound (Entity (D)),
Type_High_Bound (Entity (D)))
then
Lo :=
Make_Attribute_Reference (Loc,
Prefix => (New_Occurrence_Of (Entity (D), Loc)),
Attribute_Name => Name_First);
elsif Nkind (D) = N_Range
and then Not_Null_Range (Low_Bound (D), High_Bound (D))
then
Lo := Low_Bound (D);
else
Lo := Empty;
end if;
if Present (Lo) then
Rewrite (P,
Make_Indexed_Component (Loc,
Prefix => Relocate_Node (Prefix (P)),
Expressions => New_List (Lo)));
Analyze_And_Resolve (P);
end if;
end;
end if;
------------------
-- Body_Version --
------------------
-- Prefix of Body_Version attribute can be a subprogram name which
-- must not be resolved, since this is not a call.
when Attribute_Body_Version =>
null;
------------
-- Caller --
------------
-- Prefix of Caller attribute is an entry name which must not
-- be resolved, since this is definitely not an entry call.
when Attribute_Caller =>
null;
------------------
-- Code_Address --
------------------
-- Shares processing with Address attribute
-----------
-- Count --
-----------
-- If the prefix of the Count attribute is an entry name it must not
-- be resolved, since this is definitely not an entry call. However,
-- if it is an element of an entry family, the index itself may
-- have to be resolved because it can be a general expression.
when Attribute_Count =>
if Nkind (P) = N_Indexed_Component
and then Is_Entity_Name (Prefix (P))
then
declare
Indx : constant Node_Id := First (Expressions (P));
Fam : constant Entity_Id := Entity (Prefix (P));
begin
Resolve (Indx, Entry_Index_Type (Fam));
Apply_Range_Check (Indx, Entry_Index_Type (Fam));
end;
end if;
----------------
-- Elaborated --
----------------
-- Prefix of the Elaborated attribute is a subprogram name which
-- must not be resolved, since this is definitely not a call. Note
-- that it is a library unit, so it cannot be overloaded here.
when Attribute_Elaborated =>
null;
-------------
-- Enabled --
-------------
-- Prefix of Enabled attribute is a check name, which must be treated
-- specially and not touched by Resolve.
when Attribute_Enabled =>
null;
----------------
-- Loop_Entry --
----------------
-- Do not resolve the prefix of Loop_Entry, instead wait until the
-- attribute has been expanded (see Expand_Loop_Entry_Attributes).
-- The delay ensures that any generated checks or temporaries are
-- inserted before the relocated prefix.
when Attribute_Loop_Entry =>
null;
--------------------
-- Mechanism_Code --
--------------------
-- Prefix of the Mechanism_Code attribute is a function name
-- which must not be resolved. Should we check for overloaded ???
when Attribute_Mechanism_Code =>
null;
------------------
-- Partition_ID --
------------------
-- Most processing is done in sem_dist, after determining the
-- context type. Node is rewritten as a conversion to a runtime call.
when Attribute_Partition_ID =>
Process_Partition_Id (N);
return;
------------------
-- Pool_Address --
------------------
when Attribute_Pool_Address =>
Resolve (P);
-----------
-- Range --
-----------
-- We replace the Range attribute node with a range expression whose
-- bounds are the 'First and 'Last attributes applied to the same
-- prefix. The reason that we do this transformation here instead of
-- in the expander is that it simplifies other parts of the semantic
-- analysis which assume that the Range has been replaced; thus it
-- must be done even when in semantic-only mode (note that the RM
-- specifically mentions this equivalence, we take care that the
-- prefix is only evaluated once).
when Attribute_Range => Range_Attribute : declare
Dims : List_Id;
HB : Node_Id;
LB : Node_Id;
begin
if not Is_Entity_Name (P) or else not Is_Type (Entity (P)) then
Resolve (P);
end if;
Dims := Expressions (N);
HB :=
Make_Attribute_Reference (Loc,
Prefix => Duplicate_Subexpr (P, Name_Req => True),
Attribute_Name => Name_Last,
Expressions => Dims);
LB :=
Make_Attribute_Reference (Loc,
Prefix => P,
Attribute_Name => Name_First,
Expressions => (Dims));
-- Do not share the dimension indicator, if present. Even though
-- it is a static constant, its source location may be modified
-- when printing expanded code and node sharing will lead to chaos
-- in Sprint.
if Present (Dims) then
Set_Expressions (LB, New_List (New_Copy_Tree (First (Dims))));
end if;
-- If the original was marked as Must_Not_Freeze (see code in
-- Sem_Ch3.Make_Index), then make sure the rewriting does not
-- freeze either.
if Must_Not_Freeze (N) then
Set_Must_Not_Freeze (HB);
Set_Must_Not_Freeze (LB);
Set_Must_Not_Freeze (Prefix (HB));
Set_Must_Not_Freeze (Prefix (LB));
end if;
if Raises_Constraint_Error (Prefix (N)) then
-- Preserve Sloc of prefix in the new bounds, so that the
-- posted warning can be removed if we are within unreachable
-- code.
Set_Sloc (LB, Sloc (Prefix (N)));
Set_Sloc (HB, Sloc (Prefix (N)));
end if;
Rewrite (N, Make_Range (Loc, LB, HB));
Analyze_And_Resolve (N, Typ);
-- Ensure that the expanded range does not have side effects
Force_Evaluation (LB);
Force_Evaluation (HB);
-- Normally after resolving attribute nodes, Eval_Attribute
-- is called to do any possible static evaluation of the node.
-- However, here since the Range attribute has just been
-- transformed into a range expression it is no longer an
-- attribute node and therefore the call needs to be avoided
-- and is accomplished by simply returning from the procedure.
return;
end Range_Attribute;
------------
-- Result --
------------
-- We will only come here during the prescan of a spec expression
-- containing a Result attribute. In that case the proper Etype has
-- already been set, and nothing more needs to be done here.
when Attribute_Result =>
null;
----------------------
-- Unchecked_Access --
----------------------
-- Processing is shared with Access
-------------------------
-- Unrestricted_Access --
-------------------------
-- Processing is shared with Access
------------
-- Update --
------------
-- Resolve aggregate components in component associations
when Attribute_Update => Update : declare
Aggr : constant Node_Id := First (Expressions (N));
Typ : constant Entity_Id := Etype (Prefix (N));
Assoc : Node_Id;
Comp : Node_Id;
Expr : Node_Id;
begin
-- Set the Etype of the aggregate to that of the prefix, even
-- though the aggregate may not be a proper representation of a
-- value of the type (missing or duplicated associations, etc.)
-- Complete resolution of the prefix. Note that in Ada 2012 it
-- can be a qualified expression that is e.g. an aggregate.
Set_Etype (Aggr, Typ);
Resolve (Prefix (N), Typ);
-- For an array type, resolve expressions with the component type
-- of the array, and apply constraint checks when needed.
if Is_Array_Type (Typ) then
Assoc := First (Component_Associations (Aggr));
while Present (Assoc) loop
Expr := Expression (Assoc);
Resolve (Expr, Component_Type (Typ));
-- For scalar array components set Do_Range_Check when
-- needed. Constraint checking on non-scalar components
-- is done in Aggregate_Constraint_Checks, but only if
-- full analysis is enabled. These flags are not set in
-- the front-end in GnatProve mode.
if Is_Scalar_Type (Component_Type (Typ))
and then not Is_OK_Static_Expression (Expr)
then
if Is_Entity_Name (Expr)
and then Etype (Expr) = Component_Type (Typ)
then
null;
else
Set_Do_Range_Check (Expr);
end if;
end if;
-- The choices in the association are static constants,
-- or static aggregates each of whose components belongs
-- to the proper index type. However, they must also
-- belong to the index subtype (s) of the prefix, which
-- may be a subtype (e.g. given by a slice).
-- Choices may also be identifiers with no staticness
-- requirements, in which case they must resolve to the
-- index type.
declare
C : Node_Id;
C_E : Node_Id;
Indx : Node_Id;
begin
C := First (Choices (Assoc));
while Present (C) loop
Indx := First_Index (Etype (Prefix (N)));
if Nkind (C) /= N_Aggregate then
Analyze_And_Resolve (C, Etype (Indx));
Apply_Constraint_Check (C, Etype (Indx));
Check_Non_Static_Context (C);
else
C_E := First (Expressions (C));
while Present (C_E) loop
Analyze_And_Resolve (C_E, Etype (Indx));
Apply_Constraint_Check (C_E, Etype (Indx));
Check_Non_Static_Context (C_E);
Next (C_E);
Next_Index (Indx);
end loop;
end if;
Next (C);
end loop;
end;
Next (Assoc);
end loop;
-- For a record type, use type of each component, which is
-- recorded during analysis.
else
Assoc := First (Component_Associations (Aggr));
while Present (Assoc) loop
Comp := First (Choices (Assoc));
Expr := Expression (Assoc);
if Nkind (Comp) /= N_Others_Choice
and then not Error_Posted (Comp)
then
Resolve (Expr, Etype (Entity (Comp)));
if Is_Scalar_Type (Etype (Entity (Comp)))
and then not Is_OK_Static_Expression (Expr)
then
Set_Do_Range_Check (Expr);
end if;
end if;
Next (Assoc);
end loop;
end if;
end Update;
---------
-- Val --
---------
-- Apply range check. Note that we did not do this during the
-- analysis phase, since we wanted Eval_Attribute to have a
-- chance at finding an illegal out of range value.
when Attribute_Val =>
-- Note that we do our own Eval_Attribute call here rather than
-- use the common one, because we need to do processing after
-- the call, as per above comment.
Eval_Attribute (N);
-- Eval_Attribute may replace the node with a raise CE, or
-- fold it to a constant. Obviously we only apply a scalar
-- range check if this did not happen.
if Nkind (N) = N_Attribute_Reference
and then Attribute_Name (N) = Name_Val
then
Apply_Scalar_Range_Check (First (Expressions (N)), Btyp);
end if;
return;
-------------
-- Version --
-------------
-- Prefix of Version attribute can be a subprogram name which
-- must not be resolved, since this is not a call.
when Attribute_Version =>
null;
----------------------
-- Other Attributes --
----------------------
-- For other attributes, resolve prefix unless it is a type. If
-- the attribute reference itself is a type name ('Base and 'Class)
-- then this is only legal within a task or protected record.
when others =>
if not Is_Entity_Name (P) or else not Is_Type (Entity (P)) then
Resolve (P);
end if;
-- If the attribute reference itself is a type name ('Base,
-- 'Class) then this is only legal within a task or protected
-- record. What is this all about ???
if Is_Entity_Name (N) and then Is_Type (Entity (N)) then
if Is_Concurrent_Type (Entity (N))
and then In_Open_Scopes (Entity (P))
then
null;
else
Error_Msg_N
("invalid use of subtype name in expression or call", N);
end if;
end if;
-- For attributes whose argument may be a string, complete
-- resolution of argument now. This avoids premature expansion
-- (and the creation of transient scopes) before the attribute
-- reference is resolved.
case Attr_Id is
when Attribute_Value =>
Resolve (First (Expressions (N)), Standard_String);
when Attribute_Wide_Value =>
Resolve (First (Expressions (N)), Standard_Wide_String);
when Attribute_Wide_Wide_Value =>
Resolve (First (Expressions (N)), Standard_Wide_Wide_String);
when others => null;
end case;
-- If the prefix of the attribute is a class-wide type then it
-- will be expanded into a dispatching call to a predefined
-- primitive. Therefore we must check for potential violation
-- of such restriction.
if Is_Class_Wide_Type (Etype (P)) then
Check_Restriction (No_Dispatching_Calls, N);
end if;
end case;
-- Normally the Freezing is done by Resolve but sometimes the Prefix
-- is not resolved, in which case the freezing must be done now.
-- For an elaboration check on a subprogram, we do not freeze its type.
-- It may be declared in an unrelated scope, in particular in the case
-- of a generic function whose type may remain unelaborated.
if Attr_Id = Attribute_Elaborated then
null;
else
Freeze_Expression (P);
end if;
-- Finally perform static evaluation on the attribute reference
Analyze_Dimension (N);
Eval_Attribute (N);
end Resolve_Attribute;
------------------------
-- Set_Boolean_Result --
------------------------
procedure Set_Boolean_Result (N : Node_Id; B : Boolean) is
Loc : constant Source_Ptr := Sloc (N);
begin
if B then
Rewrite (N, New_Occurrence_Of (Standard_True, Loc));
else
Rewrite (N, New_Occurrence_Of (Standard_False, Loc));
end if;
end Set_Boolean_Result;
--------------------------------
-- Stream_Attribute_Available --
--------------------------------
function Stream_Attribute_Available
(Typ : Entity_Id;
Nam : TSS_Name_Type;
Partial_View : Node_Id := Empty) return Boolean
is
Etyp : Entity_Id := Typ;
-- Start of processing for Stream_Attribute_Available
begin
-- We need some comments in this body ???
if Has_Stream_Attribute_Definition (Typ, Nam) then
return True;
end if;
if Is_Class_Wide_Type (Typ) then
return not Is_Limited_Type (Typ)
or else Stream_Attribute_Available (Etype (Typ), Nam);
end if;
if Nam = TSS_Stream_Input
and then Is_Abstract_Type (Typ)
and then not Is_Class_Wide_Type (Typ)
then
return False;
end if;
if not (Is_Limited_Type (Typ)
or else (Present (Partial_View)
and then Is_Limited_Type (Partial_View)))
then
return True;
end if;
-- In Ada 2005, Input can invoke Read, and Output can invoke Write
if Nam = TSS_Stream_Input
and then Ada_Version >= Ada_2005
and then Stream_Attribute_Available (Etyp, TSS_Stream_Read)
then
return True;
elsif Nam = TSS_Stream_Output
and then Ada_Version >= Ada_2005
and then Stream_Attribute_Available (Etyp, TSS_Stream_Write)
then
return True;
end if;
-- Case of Read and Write: check for attribute definition clause that
-- applies to an ancestor type.
while Etype (Etyp) /= Etyp loop
Etyp := Etype (Etyp);
if Has_Stream_Attribute_Definition (Etyp, Nam) then
return True;
end if;
end loop;
if Ada_Version < Ada_2005 then
-- In Ada 95 mode, also consider a non-visible definition
declare
Btyp : constant Entity_Id := Implementation_Base_Type (Typ);
begin
return Btyp /= Typ
and then Stream_Attribute_Available
(Btyp, Nam, Partial_View => Typ);
end;
end if;
return False;
end Stream_Attribute_Available;
end Sem_Attr;
|
with
ada.unchecked_Deallocation;
package body physics.Space
is
procedure free (Self : in out View)
is
procedure deallocate is new ada.unchecked_Deallocation (Item'Class, View);
begin
Self.destruct;
deallocate (Self);
end free;
end physics.Space;
|
with Render;
with Game_Assets;
with Game_Assets.Tileset;
with Game_Assets.Tileset_Collisions;
with Game_Assets.outside;
with Game_Assets.inside;
with Game_Assets.cave;
with GESTE; use GESTE;
with GESTE.Tile_Bank;
with GESTE.Grid;
with GESTE.Text;
with Player;
package body Levels is
Debug_Collisions : constant Boolean := False;
Tile_Bank : aliased GESTE.Tile_Bank.Instance
(Game_Assets.Tileset.Tiles'Access,
Game_Assets.Tileset_Collisions.Tiles'Access,
Game_Assets.Palette'Access);
Outside_Front : aliased GESTE.Grid.Instance
(Game_Assets.outside.over2.Data'Access,
Tile_Bank'Access);
Outside_Mid : aliased GESTE.Grid.Instance
(Game_Assets.outside.over.Data'Access,
Tile_Bank'Access);
Outside_Back : aliased GESTE.Grid.Instance
(Game_Assets.outside.ground.Data'Access,
Tile_Bank'Access);
Outside_Collisions : aliased GESTE.Grid.Instance
(Game_Assets.outside.collisions.Data'Access,
Tile_Bank'Access);
Inside_Objects2 : aliased GESTE.Grid.Instance
(Game_Assets.inside.objects2.Data'Access,
Tile_Bank'Access);
Inside_Objects : aliased GESTE.Grid.Instance
(Game_Assets.inside.objects.Data'Access,
Tile_Bank'Access);
Inside_Walls : aliased GESTE.Grid.Instance
(Game_Assets.inside.walls.Data'Access,
Tile_Bank'Access);
Inside_Ground : aliased GESTE.Grid.Instance
(Game_Assets.inside.ground.Data'Access,
Tile_Bank'Access);
Inside_Collisions : aliased GESTE.Grid.Instance
(Game_Assets.inside.collisions.Data'Access,
Tile_Bank'Access);
Cave_Mid : aliased GESTE.Grid.Instance
(Game_Assets.cave.Over.Data'Access,
Tile_Bank'Access);
Cave_Back : aliased GESTE.Grid.Instance
(Game_Assets.cave.Ground.Data'Access,
Tile_Bank'Access);
Cave_Collisions : aliased GESTE.Grid.Instance
(Game_Assets.cave.collisions.Data'Access,
Tile_Bank'Access);
Lvl : Levels.Level_Id := Levels.Inside;
Screen_Pos : GESTE.Pix_Point := (0, 0);
procedure Move_To (Obj : Game_Assets.Object);
-------------
-- Move_To --
-------------
procedure Move_To (Obj : Game_Assets.Object) is
begin
Player.Move ((Integer (Obj.X), Integer (Obj.Y)));
end Move_To;
------------
-- Update --
------------
procedure Update is
Pos : constant GESTE.Pix_Point := Player.Position;
function Is_In (Obj : Game_Assets.Object) return Boolean;
-----------
-- Is_In --
-----------
function Is_In (Obj : Game_Assets.Object) return Boolean is
begin
return Pos.X in
Integer (Obj.X) .. Integer (Obj.X) + Integer (Obj.Width) - 1
and then
Pos.Y in
Integer (Obj.Y) .. Integer (Obj.Y) + Integer (Obj.Height) - 1;
end Is_In;
begin
case Lvl is
when Outside =>
for Obj of Game_Assets.outside.screen_border.Objects loop
if Is_In (Obj) then
if Screen_Pos /= (Integer (Obj.X), Integer (Obj.Y)) then
Screen_Pos := (Integer (Obj.X), Integer (Obj.Y));
Render.Set_Screen_Offset (Screen_Pos);
Leave (Outside);
Enter (Outside);
end if;
end if;
end loop;
if Is_In (Game_Assets.outside.gates.To_House) then
Move_To (Game_Assets.inside.gates.From_Outside);
Leave (Outside);
Enter (Inside);
end if;
when Inside =>
if Is_In (Game_Assets.inside.gates.To_Outside) then
Move_To (Game_Assets.outside.gates.From_House);
Leave (Inside);
Enter (Outside);
end if;
if Is_In (Game_Assets.inside.gates.To_Cave) then
Move_To (Game_Assets.cave.gates.From_House);
Leave (Inside);
Enter (Cave);
end if;
when Cave =>
if Is_In (Game_Assets.cave.gates.To_House) then
Move_To (Game_Assets.inside.gates.From_Cave);
Leave (Cave);
Enter (Inside);
end if;
end case;
end Update;
-----------
-- Enter --
-----------
procedure Enter (Id : Level_Id) is
begin
case Id is
when Outside =>
Outside_Collisions.Move ((0, 0));
Outside_Collisions.Enable_Collisions;
GESTE.Add (Outside_Collisions'Access,
(if Debug_Collisions then 6 else 0));
Outside_Back.Move ((0, 0));
GESTE.Add (Outside_Back'Access, 1);
Outside_Mid.Enable_Collisions;
Outside_Mid.Move ((0, 0));
GESTE.Add (Outside_Mid'Access, 2);
Outside_Front.Move ((0, 0));
GESTE.Add (Outside_Front'Access, 5);
when Inside =>
Inside_Collisions.Move ((0, 0));
Inside_Collisions.Enable_Collisions;
GESTE.Add (Inside_Collisions'Access,
(if Debug_Collisions then 6 else 0));
Inside_Ground.Move ((0, 0));
GESTE.Add (Inside_Ground'Access, 1);
Inside_Walls.Move ((0, 0));
GESTE.Add (Inside_Walls'Access, 2);
Inside_Objects.Move ((0, 0));
GESTE.Add (Inside_Objects'Access, 3);
Inside_Objects2.Move ((0, 0));
GESTE.Add (Inside_Objects2'Access, 5);
when Cave =>
Cave_Collisions.Move ((0, 0));
Cave_Collisions.Enable_Collisions;
GESTE.Add (Cave_Collisions'Access,
(if Debug_Collisions then 6 else 0));
Cave_Back.Move ((0, 0));
GESTE.Add (Cave_Back'Access, 1);
Cave_Mid.Move ((0, 0));
GESTE.Add (Cave_Mid'Access, 2);
end case;
Render.Render_All (0);
Lvl := Id;
end Enter;
-----------
-- Leave --
-----------
procedure Leave (Id : Level_Id) is
begin
case Id is
when Outside =>
GESTE.Remove (Outside_Collisions'Access);
GESTE.Remove (Outside_Back'Access);
GESTE.Remove (Outside_Mid'Access);
GESTE.Remove (Outside_Front'Access);
when Inside =>
GESTE.Remove (Inside_Collisions'Access);
GESTE.Remove (Inside_Ground'Access);
GESTE.Remove (Inside_Walls'Access);
GESTE.Remove (Inside_Objects'Access);
GESTE.Remove (Inside_Objects2'Access);
when Cave =>
GESTE.Remove (Cave_Collisions'Access);
GESTE.Remove (Cave_Back'Access);
GESTE.Remove (Cave_Mid'Access);
end case;
end Leave;
begin
Enter (Inside);
Move_To (Game_Assets.inside.gates.From_Outside);
end Levels;
|
------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding Samples --
-- --
-- Sample.Manifest --
-- --
-- S P E C --
-- --
------------------------------------------------------------------------------
-- Copyright (c) 1998 Free Software Foundation, Inc. --
-- --
-- Permission is hereby granted, free of charge, to any person obtaining a --
-- copy of this software and associated documentation files (the --
-- "Software"), to deal in the Software without restriction, including --
-- without limitation the rights to use, copy, modify, merge, publish, --
-- distribute, distribute with modifications, sublicense, and/or sell --
-- copies of the Software, and to permit persons to whom the Software is --
-- furnished to do so, subject to the following conditions: --
-- --
-- The above copyright notice and this permission notice shall be included --
-- in all copies or substantial portions of the Software. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS --
-- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF --
-- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. --
-- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, --
-- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR --
-- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR --
-- THE USE OR OTHER DEALINGS IN THE SOFTWARE. --
-- --
-- Except as contained in this notice, the name(s) of the above copyright --
-- holders shall not be used in advertising or otherwise to promote the --
-- sale, use or other dealings in this Software without prior written --
-- authorization. --
------------------------------------------------------------------------------
-- Author: Juergen Pfeifer, 1996
-- Version Control
-- $Revision: 1.11 $
-- Binding Version 01.00
------------------------------------------------------------------------------
with Terminal_Interface.Curses; use Terminal_Interface.Curses;
package Sample.Manifest is
QUIT : constant User_Key_Code := User_Key_Code'First;
SELECT_ITEM : constant User_Key_Code := QUIT + 1;
FKEY_HELP : constant Label_Number := 1;
HELP_CODE : constant Special_Key_Code := Key_F1;
FKEY_EXPLAIN : constant Label_Number := 2;
EXPLAIN_CODE : constant Special_Key_Code := Key_F2;
FKEY_QUIT : constant Label_Number := 3;
QUIT_CODE : constant Special_Key_Code := Key_F3;
Menu_Marker : constant String := "=> ";
Default_Colors : constant Redefinable_Color_Pair := 1;
Menu_Fore_Color : constant Redefinable_Color_Pair := 2;
Menu_Back_Color : constant Redefinable_Color_Pair := 3;
Menu_Grey_Color : constant Redefinable_Color_Pair := 4;
Form_Fore_Color : constant Redefinable_Color_Pair := 5;
Form_Back_Color : constant Redefinable_Color_Pair := 6;
Notepad_Color : constant Redefinable_Color_Pair := 7;
Help_Color : constant Redefinable_Color_Pair := 8;
Header_Color : constant Redefinable_Color_Pair := 9;
end Sample.Manifest;
|
-- Copyright (c) 2021 Bartek thindil Jasicki <thindil@laeran.pl>
--
-- 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.
-- ****ih* CalculatorCommands/Unproved
-- FUNCTION
-- Contains unproved by SPARK code from CalculatorCommands package
-- SOURCE
package CalculatorCommands.Unproved with
SPARK_Mode
is
-- ****
-- ****f* Uproved/Uproved.Add_Commands
-- FUNCTION
-- Add Tcl commands needed by the program
-- RESULT
-- True if commands were successfully added, otherwise False
-- SOURCE
function Add_Commands return Boolean;
-- ****
end CalculatorCommands.Unproved;
|
-- Copyright 2008-2014 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package body Pck is
procedure Proc (I : Integer) is
Not_In_Scope : Integer := 77;
begin
Inner.Inside_Variable := Not_In_Scope + I;
end Proc;
end Pck;
|
------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding Samples --
-- --
-- ncurses --
-- --
-- B O D Y --
-- --
------------------------------------------------------------------------------
-- Copyright (c) 2000,2001,2004 Free Software Foundation, Inc. --
-- --
-- Permission is hereby granted, free of charge, to any person obtaining a --
-- copy of this software and associated documentation files (the --
-- "Software"), to deal in the Software without restriction, including --
-- without limitation the rights to use, copy, modify, merge, publish, --
-- distribute, distribute with modifications, sublicense, and/or sell --
-- copies of the Software, and to permit persons to whom the Software is --
-- furnished to do so, subject to the following conditions: --
-- --
-- The above copyright notice and this permission notice shall be included --
-- in all copies or substantial portions of the Software. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS --
-- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF --
-- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. --
-- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, --
-- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR --
-- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR --
-- THE USE OR OTHER DEALINGS IN THE SOFTWARE. --
-- --
-- Except as contained in this notice, the name(s) of the above copyright --
-- holders shall not be used in advertising or otherwise to promote the --
-- sale, use or other dealings in this Software without prior written --
-- authorization. --
------------------------------------------------------------------------------
-- Author: Eugene V. Melaragno <aldomel@ix.netcom.com> 2000
-- Version Control
-- $Revision: 1.5 $
-- $Date: 2004/08/21 21:37:00 $
-- Binding Version 01.00
------------------------------------------------------------------------------
with ncurses2.util; use ncurses2.util;
with Terminal_Interface.Curses; use Terminal_Interface.Curses;
with Terminal_Interface.Curses.Terminfo;
use Terminal_Interface.Curses.Terminfo;
with Ada.Characters.Handling;
with Ada.Strings.Fixed;
procedure ncurses2.attr_test is
function subset (super, sub : Character_Attribute_Set) return Boolean;
function intersect (b, a : Character_Attribute_Set) return Boolean;
function has_A_COLOR (attr : Attributed_Character) return Boolean;
function show_attr (row : Line_Position;
skip : Natural;
attr : Character_Attribute_Set;
name : String;
once : Boolean) return Line_Position;
procedure attr_getc (skip : out Integer;
fg, bg : in out Color_Number;
result : out Boolean);
function subset (super, sub : Character_Attribute_Set) return Boolean is
begin
if
(super.Stand_Out or not sub.Stand_Out) and
(super.Under_Line or not sub.Under_Line) and
(super.Reverse_Video or not sub.Reverse_Video) and
(super.Blink or not sub.Blink) and
(super.Dim_Character or not sub.Dim_Character) and
(super.Bold_Character or not sub.Bold_Character) and
(super.Alternate_Character_Set or not sub.Alternate_Character_Set) and
(super.Invisible_Character or not sub.Invisible_Character) -- and
-- (super.Protected_Character or not sub.Protected_Character) and
-- (super.Horizontal or not sub.Horizontal) and
-- (super.Left or not sub.Left) and
-- (super.Low or not sub.Low) and
-- (super.Right or not sub.Right) and
-- (super.Top or not sub.Top) and
-- (super.Vertical or not sub.Vertical)
then
return True;
else
return False;
end if;
end subset;
function intersect (b, a : Character_Attribute_Set) return Boolean is
begin
if
(a.Stand_Out and b.Stand_Out) or
(a.Under_Line and b.Under_Line) or
(a.Reverse_Video and b.Reverse_Video) or
(a.Blink and b.Blink) or
(a.Dim_Character and b.Dim_Character) or
(a.Bold_Character and b.Bold_Character) or
(a.Alternate_Character_Set and b.Alternate_Character_Set) or
(a.Invisible_Character and b.Invisible_Character) -- or
-- (a.Protected_Character and b.Protected_Character) or
-- (a.Horizontal and b.Horizontal) or
-- (a.Left and b.Left) or
-- (a.Low and b.Low) or
-- (a.Right and b.Right) or
-- (a.Top and b.Top) or
-- (a.Vertical and b.Vertical)
then
return True;
else
return False;
end if;
end intersect;
function has_A_COLOR (attr : Attributed_Character) return Boolean is
begin
if attr.Color /= Color_Pair (0) then
return True;
else
return False;
end if;
end has_A_COLOR;
-- Print some text with attributes.
function show_attr (row : Line_Position;
skip : Natural;
attr : Character_Attribute_Set;
name : String;
once : Boolean) return Line_Position is
function make_record (n : Integer) return Character_Attribute_Set;
function make_record (n : Integer) return Character_Attribute_Set is
-- unsupported means true
a : Character_Attribute_Set := (others => False);
m : Integer;
rest : Integer;
begin
-- ncv is a bitmap with these fields
-- A_STANDOUT,
-- A_UNDERLINE,
-- A_REVERSE,
-- A_BLINK,
-- A_DIM,
-- A_BOLD,
-- A_INVIS,
-- A_PROTECT,
-- A_ALTCHARSET
-- It means no_color_video,
-- video attributes that can't be used with colors
-- see man terminfo.5
m := n mod 2;
rest := n / 2;
if 1 = m then
a.Stand_Out := True;
end if;
m := rest mod 2;
rest := rest / 2;
if 1 = m then
a.Under_Line := True;
end if;
m := rest mod 2;
rest := rest / 2;
if 1 = m then
a.Reverse_Video := True;
end if;
m := rest mod 2;
rest := rest / 2;
if 1 = m then
a.Blink := True;
end if;
m := rest mod 2;
rest := rest / 2;
if 1 = m then
a.Bold_Character := True;
end if;
m := rest mod 2;
rest := rest / 2;
if 1 = m then
a.Invisible_Character := True;
end if;
m := rest mod 2;
rest := rest / 2;
-- if 1 = m then
-- a.Protected_Character := True;
-- end if;
m := rest mod 2;
rest := rest / 2;
if 1 = m then
a.Alternate_Character_Set := True;
end if;
return a;
end make_record;
ncv : constant Integer := Get_Number ("ncv");
begin
Move_Cursor (Line => row, Column => 8);
Add (Str => name & " mode:");
Move_Cursor (Line => row, Column => 24);
Add (Ch => '|');
if skip /= 0 then
-- printw("%*s", skip, " ")
Add (Str => Ada.Strings.Fixed."*" (skip, ' '));
end if;
if once then
Switch_Character_Attribute (Attr => attr);
else
Set_Character_Attributes (Attr => attr);
end if;
Add (Str => "abcde fghij klmno pqrst uvwxy z");
if once then
Switch_Character_Attribute (Attr => attr, On => False);
end if;
if skip /= 0 then
Add (Str => Ada.Strings.Fixed."*" (skip, ' '));
end if;
Add (Ch => '|');
if attr /= Normal_Video then
declare begin
if not subset (super => Supported_Attributes, sub => attr) then
Add (Str => " (N/A)");
elsif ncv > 0 and has_A_COLOR (Get_Background) then
declare
Color_Supported_Attributes :
constant Character_Attribute_Set := make_record (ncv);
begin
if intersect (Color_Supported_Attributes, attr) then
Add (Str => " (NCV) ");
end if;
end;
end if;
end;
end if;
return row + 2;
end show_attr;
procedure attr_getc (skip : out Integer; fg, bg : in out Color_Number;
result : out Boolean) is
ch : constant Key_Code := Getchar;
nc : constant Color_Number := Color_Number (Number_Of_Colors);
curscr : Window;
pragma Import (C, curscr, "curscr");
-- curscr is not implemented in the Ada binding
begin
result := True;
if Ada.Characters.Handling.Is_Digit (Character'Val (ch)) then
skip := ctoi (Code_To_Char (ch));
elsif ch = CTRL ('L') then
Touch;
Touch (curscr);
Refresh;
elsif Has_Colors then
case ch is
-- Note the mathematical elegance compared to the C version.
when Character'Pos ('f') => fg := (fg + 1) mod nc;
when Character'Pos ('F') => fg := (fg - 1) mod nc;
when Character'Pos ('b') => bg := (bg + 1) mod nc;
when Character'Pos ('B') => bg := (bg - 1) mod nc;
when others =>
result := False;
end case;
else
result := False;
end if;
end attr_getc;
-- pairs could be defined as array ( Color_Number(0) .. colors - 1) of
-- array (Color_Number(0).. colors - 1) of Boolean;
pairs : array (Color_Pair'Range) of Boolean := (others => False);
fg, bg : Color_Number := Black; -- = 0;
xmc : constant Integer := Get_Number ("xmc");
skip : Integer := xmc;
n : Integer;
use Int_IO;
begin
pairs (0) := True;
if skip < 0 then
skip := 0;
end if;
n := skip;
loop
declare
row : Line_Position := 2;
normal : Attributed_Character := Blank2;
-- ???
begin
-- row := 2; -- weird, row is set to 0 without this.
-- TODO delete the above line, it was a gdb quirk that confused me
if Has_Colors then declare
pair : constant Color_Pair :=
Color_Pair (fg * Color_Number (Number_Of_Colors) + bg);
begin
-- Go though each color pair. Assume that the number of
-- Redefinable_Color_Pairs is 8*8 with predefined Colors 0..7
if not pairs (pair) then
Init_Pair (pair, fg, bg);
pairs (pair) := True;
end if;
normal.Color := pair;
end;
end if;
Set_Background (Ch => normal);
Erase;
Add (Line => 0, Column => 20,
Str => "Character attribute test display");
row := show_attr (row, n, (Stand_Out => True, others => False),
"STANDOUT", True);
row := show_attr (row, n, (Reverse_Video => True, others => False),
"REVERSE", True);
row := show_attr (row, n, (Bold_Character => True, others => False),
"BOLD", True);
row := show_attr (row, n, (Under_Line => True, others => False),
"UNDERLINE", True);
row := show_attr (row, n, (Dim_Character => True, others => False),
"DIM", True);
row := show_attr (row, n, (Blink => True, others => False),
"BLINK", True);
-- row := show_attr (row, n, (Protected_Character => True,
-- others => False), "PROTECT", True);
row := show_attr (row, n, (Invisible_Character => True,
others => False), "INVISIBLE", True);
row := show_attr (row, n, Normal_Video, "NORMAL", False);
Move_Cursor (Line => row, Column => 8);
if xmc > -1 then
Add (Str => "This terminal does have the magic-cookie glitch");
else
Add (Str => "This terminal does not have the magic-cookie glitch");
end if;
Move_Cursor (Line => row + 1, Column => 8);
Add (Str => "Enter a digit to set gaps on each side of " &
"displayed attributes");
Move_Cursor (Line => row + 2, Column => 8);
Add (Str => "^L = repaint");
if Has_Colors then
declare tmp1 : String (1 .. 1);
begin
Add (Str => ". f/F/b/F toggle colors (");
Put (tmp1, Integer (fg));
Add (Str => tmp1);
Add (Ch => '/');
Put (tmp1, Integer (bg));
Add (Str => tmp1);
Add (Ch => ')');
end;
end if;
Refresh;
end;
declare result : Boolean; begin
attr_getc (n, fg, bg, result);
exit when not result;
end;
end loop;
Set_Background (Ch => Blank2);
Erase;
End_Windows;
end ncurses2.attr_test;
|
------------------------------------------------------------------------------
-- --
-- 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.
------------------------------------------------------------------------------
-- Style contains formatting properties that affect the appearance or style
-- of diagram elements, including diagram themselves.
------------------------------------------------------------------------------
package AMF.DI.Styles is
pragma Preelaborate;
type DI_Style is limited interface;
type DI_Style_Access is
access all DI_Style'Class;
for DI_Style_Access'Storage_Size use 0;
end AMF.DI.Styles;
|
pragma License (Unrestricted);
-- separated and auto-loaded by compiler
private generic
type Num is range <>;
package Ada.Wide_Wide_Text_IO.Integer_IO is
Default_Width : Field := Num'Width;
Default_Base : Number_Base := 10;
-- procedure Get (
-- File : File_Type; -- Input_File_Type
-- Item : out Num;
-- Width : Field := 0);
-- procedure Get (
-- Item : out Num;
-- Width : Field := 0);
-- procedure Put (
-- File : File_Type; -- Output_File_Type
-- Item : Num;
-- Width : Field := Default_Width;
-- Base : Number_Base := Default_Base);
-- procedure Put (
-- Item : Num;
-- Width : Field := Default_Width;
-- Base : Number_Base := Default_Base);
-- procedure Get (
-- From : String;
-- Item : out Num;
-- Last : out Positive);
-- procedure Put (
-- To : out String;
-- Item : Num;
-- Base : Number_Base := Default_Base);
end Ada.Wide_Wide_Text_IO.Integer_IO;
|
with Ada.Text_IO;
with Ada.Integer_Text_IO;
with Ada.Characters.Handling;
-- Copyright 2021 Melwyn Francis Carlo
procedure A096 is
use Ada.Text_IO;
use Ada.Integer_Text_IO;
use Ada.Characters.Handling;
File_Name : constant String := "problems/096/p096_sudoku.txt";
Last_Index : Natural;
Num_Str : String (1 .. 10);
FT : File_Type;
Sum : Integer := 0;
Index : Integer := 0;
Sub_Index : Integer := 1;
I, I2, J, J2 : Integer;
Duplicate_Found : Boolean;
Is_Fixed_Cell : array (Integer range 1 .. 9,
Integer range 1 .. 9) of Boolean;
Digit : array (Integer range 1 .. 9,
Integer range 1 .. 9,
Integer range 1 .. 9) of Boolean;
Sudoku : array (Integer range 1 .. 50,
Integer range 1 .. 9,
Integer range 1 .. 9) of Integer;
begin
Open (FT, In_File, File_Name);
while not End_Of_File (FT) loop
Get_Line (FT, Num_Str, Last_Index);
if not Is_Digit (Num_Str (1)) then
Sub_Index := 1;
Index := Index + 1;
goto Next_Line;
end if;
for K in 1 .. 9 loop
Sudoku (Index, Sub_Index, K) := Character'Pos (Num_Str (K))
- Character'Pos ('0');
end loop;
Sub_Index := Sub_Index + 1;
<<Next_Line>>
end loop;
Close (FT);
for Puzzle in 1 .. 50 loop
Is_Fixed_Cell := (others => (others => False));
for I in 1 .. 9 loop
for J in 1 .. 9 loop
if Sudoku (Puzzle, I, J) /= 0 then
Is_Fixed_Cell (I, J) := True;
end if;
end loop;
end loop;
Digit := (others => (others => (others => False)));
I := 1;
while I <= 9 loop
J := 1;
while J <= 9 loop
if Is_Fixed_Cell (I, J) then
J := J + 1;
goto Continue;
end if;
I2 := (Integer ((I - 1) / 3) * 3) + 1;
J2 := (Integer ((J - 1) / 3) * 3) + 1;
Duplicate_Found := True;
if not Digit (I, J, 1) or not Digit (I, J, 2)
or not Digit (I, J, 3) or not Digit (I, J, 4)
or not Digit (I, J, 5) or not Digit (I, J, 6)
or not Digit (I, J, 7) or not Digit (I, J, 8)
or not Digit (I, J, 9)
then
for K in 1 .. 9 loop
if Digit (I, J, K) then
goto Sub_Continue;
end if;
Duplicate_Found := False;
for L in 1 .. 9 loop
if L /= I then
if Sudoku (Puzzle, L, J) = K then
Duplicate_Found := True;
exit;
end if;
end if;
if L /= J then
if Sudoku (Puzzle, I, L) = K then
Duplicate_Found := True;
exit;
end if;
end if;
end loop;
if not Duplicate_Found then
if Sudoku (Puzzle, I2, J2) = K
or Sudoku (Puzzle, I2, J2 + 1) = K
or Sudoku (Puzzle, I2, J2 + 2) = K
or Sudoku (Puzzle, I2 + 1, J2) = K
or Sudoku (Puzzle, I2 + 1, J2 + 1) = K
or Sudoku (Puzzle, I2 + 1, J2 + 2) = K
or Sudoku (Puzzle, I2 + 2, J2) = K
or Sudoku (Puzzle, I2 + 2, J2 + 1) = K
or Sudoku (Puzzle, I2 + 2, J2 + 2) = K
then
Duplicate_Found := True;
end if;
end if;
if not Duplicate_Found then
Digit (I, J, K) := True;
Sudoku (Puzzle, I, J) := K;
exit;
end if;
<<Sub_Continue>>
end loop;
end if;
if Duplicate_Found then
for K in 1 .. 9 loop
Digit (I, J, K) := False;
end loop;
Sudoku (Puzzle, I, J) := 0;
J := J - 1;
if J = 0 then
J := 9;
I := I - 1;
end if;
while Is_Fixed_Cell (I, J) loop
J := J - 1;
if J = 0 then
J := 9;
I := I - 1;
end if;
end loop;
else
J := J + 1;
end if;
<<Continue>>
end loop;
I := I + 1;
end loop;
Sum := Sum + (Sudoku (Puzzle, 1, 1) * 100)
+ (Sudoku (Puzzle, 1, 2) * 10)
+ Sudoku (Puzzle, 1, 3);
end loop;
Put (Sum, Width => 0);
end A096;
|
-- CA5004B0.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- OBJECTIVE: See CA5004B2M.ADA
--
-- SPECIAL INSTRUCTIONS: See CA5004B2M.ADA
--
-- TEST FILES:
-- => CA5004B0.ADA
-- CA5004B1.ADA
-- CA5004B2M.ADA
-- PWN 05/31/96 Split test into files without duplicate unit names.
-- RLB 03/11/99 Split test into files so that units that will be replaced
-- and units that won't are not in the same source file.
-------------------------------------------------------------
PACKAGE HEADER IS
PROCEDURE WRONG (WHY : STRING);
END HEADER;
WITH REPORT; USE REPORT;
PRAGMA ELABORATE (REPORT);
PACKAGE BODY HEADER IS
PROCEDURE WRONG (WHY : STRING) IS
BEGIN
FAILED ("PACKAGE WITH " & WHY & " NOT ELABORATED " &
"CORRECTLY");
END WRONG;
BEGIN
TEST ("CA5004B", "PRAGMA ELABORATE IS ACCEPTED AND OBEYED " &
"EVEN WHEN THE BODY OF THE UNIT NAMED IS " &
"MISSING OR OBSOLETE");
END HEADER;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- SQL Database Access --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with Matreshka.Internals.SQL_Drivers.SQLite3.Databases;
package body Matreshka.Internals.SQL_Drivers.SQLite3.Factory is
type SQLite3_Factory is new Abstract_Factory with null record;
overriding function Create
(Self : not null access SQLite3_Factory) return not null Database_Access;
------------
-- Create --
------------
overriding function Create
(Self : not null access SQLite3_Factory) return not null Database_Access is
begin
return new Databases.SQLite3_Database;
end Create;
use type Interfaces.C.int;
Factory : aliased SQLite3_Factory;
begin
-- Initialize threadsafety.
if sqlite3_config (SQLITE_CONFIG_SERIALIZED) /= SQLITE_OK then
raise Program_Error
with "SQLite3 doesn't support serialized threading mode";
end if;
Register (League.Strings.To_Universal_String ("SQLITE3"), Factory'Access);
end Matreshka.Internals.SQL_Drivers.SQLite3.Factory;
|
pragma License (Unrestricted);
package GNAT.Calendar.Time_IO is
type Picture_String is new String;
ISO_Date : constant Picture_String := "%Y-%m-%d";
function Image (Date : Ada.Calendar.Time; Picture : Picture_String)
return String;
function Value (Date : String) return Ada.Calendar.Time;
end GNAT.Calendar.Time_IO;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . T A S K I N G --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2013, 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. 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. --
-- --
-- --
-- --
-- --
-- --
-- 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 Ravenscar/HI-E version of this package
-- Note: the compiler generates direct calls to this interface, via Rtsfind.
-- Any changes to this interface may require corresponding compiler changes.
pragma Restrictions (No_Elaboration_Code);
with Ada.Unchecked_Conversion;
with System.Storage_Elements;
with System.Parameters;
with System.Task_Info;
with System.Task_Primitives;
with System.Multiprocessors;
package System.Tasking is
pragma Preelaborate;
---------------------------------
-- Task_Id related definitions --
---------------------------------
type Ada_Task_Control_Block;
type Task_Id is access all Ada_Task_Control_Block;
function To_Task_Id is
new Ada.Unchecked_Conversion
(System.Task_Primitives.Task_Address, Task_Id);
function To_Address is
new Ada.Unchecked_Conversion
(Task_Id, System.Task_Primitives.Task_Address);
Null_Task : constant Task_Id := null;
type Task_List is array (Positive range <>) of Task_Id;
pragma Suppress_Initialization (Task_List);
function Self return Task_Id;
-- This is the compiler interface version of this function. Do not call
-- from the run-time system.
-----------------------
-- Enumeration types --
-----------------------
type Task_States is
(Unactivated,
-- Task was created but has not been activated. It cannot be executing
-- For all states from here down, the task has been activated. In
-- addition, for all states from here down, except for Terminated,
-- the task may be executing.
Runnable,
-- Task is not blocked for any reason known to Ada. (It may be waiting
-- for a mutex, though.) It is conceptually "executing" in normal mode.
Terminated,
-- The task is terminated, in the sense of ARM 9.3 (5)
Activator_Sleep,
-- Task is waiting for created tasks to complete activation
Acceptor_Sleep,
-- Task is waiting on an accept or selective wait statement
Entry_Caller_Sleep,
-- Task is waiting on an entry call
Async_Select_Sleep,
-- Task is waiting to start the abortable part of an asynchronous select
-- statement.
Delay_Sleep,
-- Task is waiting on a delay statement
Master_Completion_Sleep,
-- Master completion has two phases. In Phase 1 the task is sleeping
-- in Complete_Master having completed a master within itself, and is
-- waiting for the tasks dependent on that master to become terminated
-- or waiting on a terminate Phase.
Master_Phase_2_Sleep,
-- In Phase 2 the task is sleeping in Complete_Master waiting for tasks
-- on terminate alternatives to finish terminating.
Interrupt_Server_Idle_Sleep,
Interrupt_Server_Blocked_Interrupt_Sleep,
Timer_Server_Sleep,
AST_Server_Sleep,
-- Special uses of sleep, for server tasks within the run-time system
Asynchronous_Hold,
-- The task has been held by Asynchronous_Task_Control.Hold_Task
Interrupt_Server_Blocked_On_Event_Flag
-- The task has been blocked on a system call waiting for the
-- completion event.
);
-- The following status indicators are never used in a Ravenscar run time.
-- They Are defined for debugging purposes: The same code in GDB to get
-- the Current status of a task in a full run-time environment and in a
-- Ravenscar environment.
pragma Unreferenced (Activator_Sleep);
pragma Unreferenced (Acceptor_Sleep);
pragma Unreferenced (Async_Select_Sleep);
pragma Unreferenced (Master_Completion_Sleep);
pragma Unreferenced (Master_Phase_2_Sleep);
pragma Unreferenced (Interrupt_Server_Idle_Sleep);
pragma Unreferenced (Interrupt_Server_Blocked_Interrupt_Sleep);
pragma Unreferenced (Timer_Server_Sleep);
pragma Unreferenced (AST_Server_Sleep);
pragma Unreferenced (Asynchronous_Hold);
pragma Unreferenced (Interrupt_Server_Blocked_On_Event_Flag);
-------------------------------
-- Entry related definitions --
-------------------------------
-- These need comments ???
Null_Entry : constant := 0;
Max_Entry : constant := Integer'Last;
Interrupt_Entry : constant := -2;
Cancelled_Entry : constant := -1;
type Entry_Index is range Interrupt_Entry .. Max_Entry;
Null_Task_Entry : constant := Null_Entry;
Max_Task_Entry : constant := Max_Entry;
type Task_Entry_Index is new Entry_Index
range Null_Task_Entry .. Max_Task_Entry;
type Entry_Call_Record;
type Entry_Call_Link is access all Entry_Call_Record;
----------------------------------
-- Entry_Call_Record definition --
----------------------------------
type Entry_Call_Record is record
Self : Task_Id;
-- ID of the caller
Uninterpreted_Data : System.Address;
-- Data passed by the compiler
Next : Entry_Call_Link;
-- Entry_Call List
end record;
pragma Suppress_Initialization (Entry_Call_Record);
-------------------------------------------
-- Task termination procedure definition --
-------------------------------------------
-- We need to redefine this type (already defined in Ada.Task_Termination)
-- here to avoid circular dependencies.
type Termination_Handler is access protected procedure (T : Task_Id);
-- Represent a protected procedure to be executed when a task terminates
Fall_Back_Handler : Termination_Handler;
-- This is the fall-back handler that applies to all the tasks in the
-- partition (this is only for Ravenscar-compliant systems).
------------------------------------
-- Other Task-Related Definitions --
------------------------------------
type Activation_Chain is limited private;
type Activation_Chain_Access is access all Activation_Chain;
type Task_Procedure_Access is access procedure (Arg : System.Address);
type Access_Boolean is access all Boolean;
----------------------------------------------
-- Ada_Task_Control_Block (ATCB) definition --
----------------------------------------------
-- Notes on protection (synchronization) of TRTS data structures
-- Any field of the TCB can be written by the activator of a task when the
-- task is created, since no other task can access the new task's state
-- until creation is complete.
-- The protection for each field is described in a comment starting with
-- "Protection:".
-- When a lock is used to protect an ATCB field, this lock is simply named
-- Some protection is described in terms of tasks related to the ATCB being
-- protected. These are:
-- Self: The task which is controlled by this ATCB.
-- Activator: The task that created Self and initiated its activation.
-- Created: A task created and activated by Self.
type Stack_Info is record
Start_Address : System.Address := System.Null_Address;
Size : System.Storage_Elements.Storage_Offset;
end record;
pragma Suppress_Initialization (Stack_Info);
type TSD is record
Pri_Stack_Info : aliased Stack_Info;
-- Stack address and size of the task
Sec_Stack_Addr : Address;
-- Address of currently allocated secondary stack
end record;
pragma Suppress_Initialization (TSD);
type Common_ATCB is record
State : Task_States;
pragma Atomic (State);
-- Encodes some basic information about the state of a task, including
-- whether it has been activated, whether it is sleeping, and whether
-- it is terminated.
--
-- Protection: Only accessed by Self
Base_CPU : System.Multiprocessors.CPU_Range;
-- Protection: Only written during initialization, accessed by anyone
Base_Priority : System.Any_Priority;
-- Base priority
--
-- Protection: Only written by Self, accessed by anyone
Protected_Action_Nesting : Natural;
pragma Atomic (Protected_Action_Nesting);
-- The dynamic level of protected action nesting for this task. This
-- field is needed for checking whether potentially blocking operations
-- are invoked from protected actions. pragma Atomic is used because it
-- can be read/written from protected interrupt handlers.
LL : aliased Task_Primitives.Private_Data;
-- Control block used by underlying low-level tasking service (GNULLI)
--
-- Protection: This is used only by the GNULLI implementation, which
-- takes care of all of its synchronization.
Task_Arg : System.Address;
-- The argument to task procedure. Currently unused, this will provide
-- a handle for discriminant information.
--
-- Protection: Part of the synchronization between Self and Activator.
-- Activator writes it, once, before Self starts executing. Thereafter,
-- Self only reads it.
Task_Entry_Point : Task_Procedure_Access;
-- Information needed to call the procedure containing the code for
-- the body of this task.
--
-- Protection: Part of the synchronization between Self and Activator.
-- Activator writes it, once, before Self starts executing. Self reads
-- it, once, as part of its execution.
Compiler_Data : TSD;
-- Task-specific data needed by compiler to store per-task stuctures
--
-- Protection: Only accessed by Self
Activation_Link : Task_Id;
-- Used to link this task to a list of tasks to be activated
--
-- Protection: Only used by Activator. Once the task is activated, this
-- can also be reused by System.Tasking.Debug for the list of known
-- tasks.
Task_Info : System.Task_Info.Task_Info_Type;
-- System-specific attributes of the task as specified by the
-- Task_Info pragma.
end record;
pragma Suppress_Initialization (Common_ATCB);
type Ada_Task_Control_Block (Entry_Num : Task_Entry_Index) is record
-- The discriminant Entry_Num is not needed, but we keep it here for
-- compatibility reasons with the rest of the run times, so that the
-- expander does not need to know which run time is being used.
Common : Common_ATCB;
Entry_Call : aliased Entry_Call_Record;
-- Protection: This field is used on entry call queues associated with
-- protected objects, and is protected by the protected object lock.
end record;
pragma Suppress_Initialization (Ada_Task_Control_Block);
-- Why this pragma? comment needed???
--------------------------------
-- Master Related Definitions --
--------------------------------
subtype Master_Level is Integer;
subtype Master_ID is Master_Level;
Library_Task_Level : constant Master_Level := 3;
----------------------------------
-- Secondary Stack Manipulation --
----------------------------------
function Get_Sec_Stack return Address;
pragma Export (C, Get_Sec_Stack, "__gnat_get_secondary_stack");
-- Return the address of the task specific secondary stack, as expected by
-- System.Secondary_Stack.
procedure Set_Sec_Stack (Stk : Address);
-- Set the task specific secondary stack, as expected by
-- System.Secondary_Stack.
----------------------------------------
-- Task size, priority, affinity info --
----------------------------------------
function Storage_Size (T : Task_Id) return System.Parameters.Size_Type;
-- Retrieve from the TCB of the task the allocated size of its stack,
-- either the system default or the size specified by a pragma. This
-- is in general a non-static value that can depend on discriminants
-- of the task.
Unspecified_Priority : constant Integer := System.Priority'First - 1;
Unspecified_CPU : constant := -1;
-- No affinity specified
--------------------
-- Initialization --
--------------------
procedure Initialize;
-- This procedure constitutes the first part of the initialization of the
-- GNARL. This includes creating data structures to make the initial thread
-- into the environment task. The last part of the initialization is done
-- in System.Tasking.Initialization or System.Tasking.Restricted.Stages.
-- All the initializations used to be in Tasking.Initialization, but this
-- is no longer possible with the run time simplification (including
-- optimized PO and the restricted run time) since one cannot rely on
-- System.Tasking.Initialization being present, as was done before.
procedure Initialize_ATCB
(Task_Entry_Point : Task_Procedure_Access;
Task_Arg : System.Address;
Base_Priority : System.Any_Priority;
Base_CPU : System.Multiprocessors.CPU_Range;
Task_Info : System.Task_Info.Task_Info_Type;
Stack_Address : System.Address;
Stack_Size : System.Parameters.Size_Type;
T : Task_Id;
Success : out Boolean);
-- Initialize fields of a TCB and link into global TCB structures
-- Call this only with abort deferred and holding All_Tasks_L.
----------------------
-- Initialize_Slave --
----------------------
procedure Initialize_Slave (CPU_Id : System.Multiprocessors.CPU);
pragma Export (Asm, Initialize_Slave, "__gnat_initialize_slave");
-- Initialize a fake environment task for the current CPU. This fake task
-- is used to give a context during interrupt handling if the CPU doesn't
-- have regular task.
private
type Activation_Chain is limited record
T_ID : Task_Id;
end record;
end System.Tasking;
|
-- This spec has been automatically generated from STM32F429x.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.SAI is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype ACR1_MODE_Field is HAL.UInt2;
subtype ACR1_PRTCFG_Field is HAL.UInt2;
subtype ACR1_DS_Field is HAL.UInt3;
subtype ACR1_SYNCEN_Field is HAL.UInt2;
subtype ACR1_MCJDIV_Field is HAL.UInt4;
-- AConfiguration register 1
type ACR1_Register is record
-- Audio block mode
MODE : ACR1_MODE_Field := 16#0#;
-- Protocol configuration
PRTCFG : ACR1_PRTCFG_Field := 16#0#;
-- unspecified
Reserved_4_4 : HAL.Bit := 16#0#;
-- Data size
DS : ACR1_DS_Field := 16#2#;
-- Least significant bit first
LSBFIRST : Boolean := False;
-- Clock strobing edge
CKSTR : Boolean := False;
-- Synchronization enable
SYNCEN : ACR1_SYNCEN_Field := 16#0#;
-- Mono mode
MONO : Boolean := False;
-- Output drive
OutDri : Boolean := False;
-- unspecified
Reserved_14_15 : HAL.UInt2 := 16#0#;
-- Audio block A enable
SAIAEN : Boolean := False;
-- DMA enable
DMAEN : Boolean := False;
-- unspecified
Reserved_18_18 : HAL.Bit := 16#0#;
-- No divider
NODIV : Boolean := False;
-- Master clock divider
MCJDIV : ACR1_MCJDIV_Field := 16#0#;
-- unspecified
Reserved_24_31 : HAL.UInt8 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ACR1_Register use record
MODE at 0 range 0 .. 1;
PRTCFG at 0 range 2 .. 3;
Reserved_4_4 at 0 range 4 .. 4;
DS at 0 range 5 .. 7;
LSBFIRST at 0 range 8 .. 8;
CKSTR at 0 range 9 .. 9;
SYNCEN at 0 range 10 .. 11;
MONO at 0 range 12 .. 12;
OutDri at 0 range 13 .. 13;
Reserved_14_15 at 0 range 14 .. 15;
SAIAEN at 0 range 16 .. 16;
DMAEN at 0 range 17 .. 17;
Reserved_18_18 at 0 range 18 .. 18;
NODIV at 0 range 19 .. 19;
MCJDIV at 0 range 20 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
subtype ACR2_FTH_Field is HAL.UInt3;
subtype ACR2_MUTECN_Field is HAL.UInt6;
subtype ACR2_COMP_Field is HAL.UInt2;
-- AConfiguration register 2
type ACR2_Register is record
-- FIFO threshold
FTH : ACR2_FTH_Field := 16#0#;
-- FIFO flush
FFLUS : Boolean := False;
-- Tristate management on data line
TRIS : Boolean := False;
-- Mute
MUTE : Boolean := False;
-- Mute value
MUTEVAL : Boolean := False;
-- Mute counter
MUTECN : ACR2_MUTECN_Field := 16#0#;
-- Complement bit
CPL : Boolean := False;
-- Companding mode
COMP : ACR2_COMP_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ACR2_Register use record
FTH at 0 range 0 .. 2;
FFLUS at 0 range 3 .. 3;
TRIS at 0 range 4 .. 4;
MUTE at 0 range 5 .. 5;
MUTEVAL at 0 range 6 .. 6;
MUTECN at 0 range 7 .. 12;
CPL at 0 range 13 .. 13;
COMP at 0 range 14 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype AFRCR_FRL_Field is HAL.UInt8;
subtype AFRCR_FSALL_Field is HAL.UInt7;
-- AFRCR
type AFRCR_Register is record
-- Frame length
FRL : AFRCR_FRL_Field := 16#7#;
-- Frame synchronization active level length
FSALL : AFRCR_FSALL_Field := 16#0#;
-- unspecified
Reserved_15_15 : HAL.Bit := 16#0#;
-- Frame synchronization definition
FSDEF : Boolean := False;
-- Frame synchronization polarity
FSPOL : Boolean := False;
-- Frame synchronization offset
FSOFF : Boolean := False;
-- unspecified
Reserved_19_31 : HAL.UInt13 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for AFRCR_Register use record
FRL at 0 range 0 .. 7;
FSALL at 0 range 8 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
FSDEF at 0 range 16 .. 16;
FSPOL at 0 range 17 .. 17;
FSOFF at 0 range 18 .. 18;
Reserved_19_31 at 0 range 19 .. 31;
end record;
subtype ASLOTR_FBOFF_Field is HAL.UInt5;
subtype ASLOTR_SLOTSZ_Field is HAL.UInt2;
subtype ASLOTR_NBSLOT_Field is HAL.UInt4;
subtype ASLOTR_SLOTEN_Field is HAL.UInt16;
-- ASlot register
type ASLOTR_Register is record
-- First bit offset
FBOFF : ASLOTR_FBOFF_Field := 16#0#;
-- unspecified
Reserved_5_5 : HAL.Bit := 16#0#;
-- Slot size
SLOTSZ : ASLOTR_SLOTSZ_Field := 16#0#;
-- Number of slots in an audio frame
NBSLOT : ASLOTR_NBSLOT_Field := 16#0#;
-- unspecified
Reserved_12_15 : HAL.UInt4 := 16#0#;
-- Slot enable
SLOTEN : ASLOTR_SLOTEN_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ASLOTR_Register use record
FBOFF at 0 range 0 .. 4;
Reserved_5_5 at 0 range 5 .. 5;
SLOTSZ at 0 range 6 .. 7;
NBSLOT at 0 range 8 .. 11;
Reserved_12_15 at 0 range 12 .. 15;
SLOTEN at 0 range 16 .. 31;
end record;
-- AInterrupt mask register2
type AIM_Register is record
-- Overrun/underrun interrupt enable
OVRUDRIE : Boolean := False;
-- Mute detection interrupt enable
MUTEDET : Boolean := False;
-- Wrong clock configuration interrupt enable
WCKCFG : Boolean := False;
-- FIFO request interrupt enable
FREQIE : Boolean := False;
-- Codec not ready interrupt enable
CNRDYIE : Boolean := False;
-- Anticipated frame synchronization detection interrupt enable
AFSDETIE : Boolean := False;
-- Late frame synchronization detection interrupt enable
LFSDET : 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 AIM_Register use record
OVRUDRIE at 0 range 0 .. 0;
MUTEDET at 0 range 1 .. 1;
WCKCFG at 0 range 2 .. 2;
FREQIE at 0 range 3 .. 3;
CNRDYIE at 0 range 4 .. 4;
AFSDETIE at 0 range 5 .. 5;
LFSDET at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
subtype ASR_FLVL_Field is HAL.UInt3;
-- AStatus register
type ASR_Register is record
-- Overrun / underrun
OVRUDR : Boolean := False;
-- Mute detection
MUTEDET : Boolean := False;
-- Wrong clock configuration flag. This bit is read only.
WCKCFG : Boolean := False;
-- FIFO request
FREQ : Boolean := False;
-- Codec not ready
CNRDY : Boolean := False;
-- Anticipated frame synchronization detection
AFSDET : Boolean := False;
-- Late frame synchronization detection
LFSDET : Boolean := False;
-- unspecified
Reserved_7_15 : HAL.UInt9 := 16#0#;
-- FIFO level threshold
FLVL : ASR_FLVL_Field := 16#0#;
-- unspecified
Reserved_19_31 : HAL.UInt13 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ASR_Register use record
OVRUDR at 0 range 0 .. 0;
MUTEDET at 0 range 1 .. 1;
WCKCFG at 0 range 2 .. 2;
FREQ at 0 range 3 .. 3;
CNRDY at 0 range 4 .. 4;
AFSDET at 0 range 5 .. 5;
LFSDET at 0 range 6 .. 6;
Reserved_7_15 at 0 range 7 .. 15;
FLVL at 0 range 16 .. 18;
Reserved_19_31 at 0 range 19 .. 31;
end record;
-- AClear flag register
type ACLRFR_Register is record
-- Clear overrun / underrun
OVRUDR : Boolean := False;
-- Mute detection flag
MUTEDET : Boolean := False;
-- Clear wrong clock configuration flag
WCKCFG : Boolean := False;
-- unspecified
Reserved_3_3 : HAL.Bit := 16#0#;
-- Clear codec not ready flag
CNRDY : Boolean := False;
-- Clear anticipated frame synchronization detection flag.
CAFSDET : Boolean := False;
-- Clear late frame synchronization detection flag
LFSDET : 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 ACLRFR_Register use record
OVRUDR at 0 range 0 .. 0;
MUTEDET at 0 range 1 .. 1;
WCKCFG at 0 range 2 .. 2;
Reserved_3_3 at 0 range 3 .. 3;
CNRDY at 0 range 4 .. 4;
CAFSDET at 0 range 5 .. 5;
LFSDET at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
subtype BCR1_MODE_Field is HAL.UInt2;
subtype BCR1_PRTCFG_Field is HAL.UInt2;
subtype BCR1_DS_Field is HAL.UInt3;
subtype BCR1_SYNCEN_Field is HAL.UInt2;
subtype BCR1_MCJDIV_Field is HAL.UInt4;
-- BConfiguration register 1
type BCR1_Register is record
-- Audio block mode
MODE : BCR1_MODE_Field := 16#0#;
-- Protocol configuration
PRTCFG : BCR1_PRTCFG_Field := 16#0#;
-- unspecified
Reserved_4_4 : HAL.Bit := 16#0#;
-- Data size
DS : BCR1_DS_Field := 16#2#;
-- Least significant bit first
LSBFIRST : Boolean := False;
-- Clock strobing edge
CKSTR : Boolean := False;
-- Synchronization enable
SYNCEN : BCR1_SYNCEN_Field := 16#0#;
-- Mono mode
MONO : Boolean := False;
-- Output drive
OutDri : Boolean := False;
-- unspecified
Reserved_14_15 : HAL.UInt2 := 16#0#;
-- Audio block B enable
SAIBEN : Boolean := False;
-- DMA enable
DMAEN : Boolean := False;
-- unspecified
Reserved_18_18 : HAL.Bit := 16#0#;
-- No divider
NODIV : Boolean := False;
-- Master clock divider
MCJDIV : BCR1_MCJDIV_Field := 16#0#;
-- unspecified
Reserved_24_31 : HAL.UInt8 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BCR1_Register use record
MODE at 0 range 0 .. 1;
PRTCFG at 0 range 2 .. 3;
Reserved_4_4 at 0 range 4 .. 4;
DS at 0 range 5 .. 7;
LSBFIRST at 0 range 8 .. 8;
CKSTR at 0 range 9 .. 9;
SYNCEN at 0 range 10 .. 11;
MONO at 0 range 12 .. 12;
OutDri at 0 range 13 .. 13;
Reserved_14_15 at 0 range 14 .. 15;
SAIBEN at 0 range 16 .. 16;
DMAEN at 0 range 17 .. 17;
Reserved_18_18 at 0 range 18 .. 18;
NODIV at 0 range 19 .. 19;
MCJDIV at 0 range 20 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
subtype BCR2_FTH_Field is HAL.UInt3;
subtype BCR2_MUTECN_Field is HAL.UInt6;
subtype BCR2_COMP_Field is HAL.UInt2;
-- BConfiguration register 2
type BCR2_Register is record
-- FIFO threshold
FTH : BCR2_FTH_Field := 16#0#;
-- FIFO flush
FFLUS : Boolean := False;
-- Tristate management on data line
TRIS : Boolean := False;
-- Mute
MUTE : Boolean := False;
-- Mute value
MUTEVAL : Boolean := False;
-- Mute counter
MUTECN : BCR2_MUTECN_Field := 16#0#;
-- Complement bit
CPL : Boolean := False;
-- Companding mode
COMP : BCR2_COMP_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BCR2_Register use record
FTH at 0 range 0 .. 2;
FFLUS at 0 range 3 .. 3;
TRIS at 0 range 4 .. 4;
MUTE at 0 range 5 .. 5;
MUTEVAL at 0 range 6 .. 6;
MUTECN at 0 range 7 .. 12;
CPL at 0 range 13 .. 13;
COMP at 0 range 14 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype BFRCR_FRL_Field is HAL.UInt8;
subtype BFRCR_FSALL_Field is HAL.UInt7;
-- BFRCR
type BFRCR_Register is record
-- Frame length
FRL : BFRCR_FRL_Field := 16#7#;
-- Frame synchronization active level length
FSALL : BFRCR_FSALL_Field := 16#0#;
-- unspecified
Reserved_15_15 : HAL.Bit := 16#0#;
-- Frame synchronization definition
FSDEF : Boolean := False;
-- Frame synchronization polarity
FSPOL : Boolean := False;
-- Frame synchronization offset
FSOFF : Boolean := False;
-- unspecified
Reserved_19_31 : HAL.UInt13 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BFRCR_Register use record
FRL at 0 range 0 .. 7;
FSALL at 0 range 8 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
FSDEF at 0 range 16 .. 16;
FSPOL at 0 range 17 .. 17;
FSOFF at 0 range 18 .. 18;
Reserved_19_31 at 0 range 19 .. 31;
end record;
subtype BSLOTR_FBOFF_Field is HAL.UInt5;
subtype BSLOTR_SLOTSZ_Field is HAL.UInt2;
subtype BSLOTR_NBSLOT_Field is HAL.UInt4;
subtype BSLOTR_SLOTEN_Field is HAL.UInt16;
-- BSlot register
type BSLOTR_Register is record
-- First bit offset
FBOFF : BSLOTR_FBOFF_Field := 16#0#;
-- unspecified
Reserved_5_5 : HAL.Bit := 16#0#;
-- Slot size
SLOTSZ : BSLOTR_SLOTSZ_Field := 16#0#;
-- Number of slots in an audio frame
NBSLOT : BSLOTR_NBSLOT_Field := 16#0#;
-- unspecified
Reserved_12_15 : HAL.UInt4 := 16#0#;
-- Slot enable
SLOTEN : BSLOTR_SLOTEN_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BSLOTR_Register use record
FBOFF at 0 range 0 .. 4;
Reserved_5_5 at 0 range 5 .. 5;
SLOTSZ at 0 range 6 .. 7;
NBSLOT at 0 range 8 .. 11;
Reserved_12_15 at 0 range 12 .. 15;
SLOTEN at 0 range 16 .. 31;
end record;
-- BInterrupt mask register2
type BIM_Register is record
-- Overrun/underrun interrupt enable
OVRUDRIE : Boolean := False;
-- Mute detection interrupt enable
MUTEDET : Boolean := False;
-- Wrong clock configuration interrupt enable
WCKCFG : Boolean := False;
-- FIFO request interrupt enable
FREQIE : Boolean := False;
-- Codec not ready interrupt enable
CNRDYIE : Boolean := False;
-- Anticipated frame synchronization detection interrupt enable
AFSDETIE : Boolean := False;
-- Late frame synchronization detection interrupt enable
LFSDETIE : 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 BIM_Register use record
OVRUDRIE at 0 range 0 .. 0;
MUTEDET at 0 range 1 .. 1;
WCKCFG at 0 range 2 .. 2;
FREQIE at 0 range 3 .. 3;
CNRDYIE at 0 range 4 .. 4;
AFSDETIE at 0 range 5 .. 5;
LFSDETIE at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
subtype BSR_FLVL_Field is HAL.UInt3;
-- BStatus register
type BSR_Register is record
-- Read-only. Overrun / underrun
OVRUDR : Boolean;
-- Read-only. Mute detection
MUTEDET : Boolean;
-- Read-only. Wrong clock configuration flag
WCKCFG : Boolean;
-- Read-only. FIFO request
FREQ : Boolean;
-- Read-only. Codec not ready
CNRDY : Boolean;
-- Read-only. Anticipated frame synchronization detection
AFSDET : Boolean;
-- Read-only. Late frame synchronization detection
LFSDET : Boolean;
-- unspecified
Reserved_7_15 : HAL.UInt9;
-- Read-only. FIFO level threshold
FLVL : BSR_FLVL_Field;
-- unspecified
Reserved_19_31 : HAL.UInt13;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BSR_Register use record
OVRUDR at 0 range 0 .. 0;
MUTEDET at 0 range 1 .. 1;
WCKCFG at 0 range 2 .. 2;
FREQ at 0 range 3 .. 3;
CNRDY at 0 range 4 .. 4;
AFSDET at 0 range 5 .. 5;
LFSDET at 0 range 6 .. 6;
Reserved_7_15 at 0 range 7 .. 15;
FLVL at 0 range 16 .. 18;
Reserved_19_31 at 0 range 19 .. 31;
end record;
-- BClear flag register
type BCLRFR_Register is record
-- Write-only. Clear overrun / underrun
OVRUDR : Boolean := False;
-- Write-only. Mute detection flag
MUTEDET : Boolean := False;
-- Write-only. Clear wrong clock configuration flag
WCKCFG : Boolean := False;
-- unspecified
Reserved_3_3 : HAL.Bit := 16#0#;
-- Write-only. Clear codec not ready flag
CNRDY : Boolean := False;
-- Write-only. Clear anticipated frame synchronization detection flag
CAFSDET : Boolean := False;
-- Write-only. Clear late frame synchronization detection flag
LFSDET : 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 BCLRFR_Register use record
OVRUDR at 0 range 0 .. 0;
MUTEDET at 0 range 1 .. 1;
WCKCFG at 0 range 2 .. 2;
Reserved_3_3 at 0 range 3 .. 3;
CNRDY at 0 range 4 .. 4;
CAFSDET at 0 range 5 .. 5;
LFSDET at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Serial audio interface
type SAI_Peripheral is record
-- AConfiguration register 1
ACR1 : aliased ACR1_Register;
-- AConfiguration register 2
ACR2 : aliased ACR2_Register;
-- AFRCR
AFRCR : aliased AFRCR_Register;
-- ASlot register
ASLOTR : aliased ASLOTR_Register;
-- AInterrupt mask register2
AIM : aliased AIM_Register;
-- AStatus register
ASR : aliased ASR_Register;
-- AClear flag register
ACLRFR : aliased ACLRFR_Register;
-- AData register
ADR : aliased HAL.UInt32;
-- BConfiguration register 1
BCR1 : aliased BCR1_Register;
-- BConfiguration register 2
BCR2 : aliased BCR2_Register;
-- BFRCR
BFRCR : aliased BFRCR_Register;
-- BSlot register
BSLOTR : aliased BSLOTR_Register;
-- BInterrupt mask register2
BIM : aliased BIM_Register;
-- BStatus register
BSR : aliased BSR_Register;
-- BClear flag register
BCLRFR : aliased BCLRFR_Register;
-- BData register
BDR : aliased HAL.UInt32;
end record
with Volatile;
for SAI_Peripheral use record
ACR1 at 16#4# range 0 .. 31;
ACR2 at 16#8# range 0 .. 31;
AFRCR at 16#C# range 0 .. 31;
ASLOTR at 16#10# range 0 .. 31;
AIM at 16#14# range 0 .. 31;
ASR at 16#18# range 0 .. 31;
ACLRFR at 16#1C# range 0 .. 31;
ADR at 16#20# range 0 .. 31;
BCR1 at 16#24# range 0 .. 31;
BCR2 at 16#28# range 0 .. 31;
BFRCR at 16#2C# range 0 .. 31;
BSLOTR at 16#30# range 0 .. 31;
BIM at 16#34# range 0 .. 31;
BSR at 16#38# range 0 .. 31;
BCLRFR at 16#3C# range 0 .. 31;
BDR at 16#40# range 0 .. 31;
end record;
-- Serial audio interface
SAI_Periph : aliased SAI_Peripheral
with Import, Address => System'To_Address (16#40015800#);
end STM32_SVD.SAI;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- ADA.EXCEPTIONS.EXCEPTION_TRACES --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2005, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Unchecked_Conversion;
pragma Warnings (Off);
with Ada.Exceptions.Last_Chance_Handler;
pragma Warnings (On);
-- Bring last chance handler into closure
separate (Ada.Exceptions)
package body Exception_Traces is
Nline : constant String := String'(1 => ASCII.LF);
-- Convenient shortcut
type Exception_Action is access procedure (E : Exception_Occurrence);
Global_Action : Exception_Action := null;
pragma Export
(Ada, Global_Action, "__gnat_exception_actions_global_action");
-- Global action, executed whenever an exception is raised. Changing the
-- export name must be coordinated with code in g-excact.adb.
Raise_Hook_Initialized : Boolean := False;
pragma Export
(Ada, Raise_Hook_Initialized, "__gnat_exception_actions_initialized");
procedure Last_Chance_Handler
(Except : Exception_Occurrence);
pragma Import (C, Last_Chance_Handler, "__gnat_last_chance_handler");
pragma No_Return (Last_Chance_Handler);
-- Users can replace the default version of this routine,
-- Ada.Exceptions.Last_Chance_Handler.
function To_Action is new Unchecked_Conversion
(Raise_Action, Exception_Action);
-----------------------
-- Local Subprograms --
-----------------------
procedure Notify_Exception (Excep : EOA; Is_Unhandled : Boolean);
-- Factorizes the common processing for Notify_Handled_Exception and
-- Notify_Unhandled_Exception. Is_Unhandled is set to True only in the
-- latter case because Notify_Handled_Exception may be called for an
-- actually unhandled occurrence in the Front-End-SJLJ case.
---------------------------------
-- Debugger Interface Routines --
---------------------------------
-- The routines here are null routines that normally have no effect.
-- They are provided for the debugger to place breakpoints on their
-- entry points to get control on an exception.
procedure Unhandled_Exception;
pragma Export (C, Unhandled_Exception, "__gnat_unhandled_exception");
-- Hook for GDB to support "break exception unhandled"
-- For "break exception", GDB uses __gnat_raise_nodefer_with_msg, which
-- is not in this section because it functions as more than simply a
-- debugger interface.
--------------------------------
-- Import Run-Time C Routines --
--------------------------------
-- The purpose of the following pragma Import is to ensure that we
-- generate appropriate subprogram descriptors for all C routines in
-- the standard GNAT library that can raise exceptions. This ensures
-- that the exception propagation can properly find these routines
pragma Propagate_Exceptions;
----------------------
-- Notify_Exception --
----------------------
procedure Notify_Exception (Excep : EOA; Is_Unhandled : Boolean) is
begin
-- Output the exception information required by the Exception_Trace
-- configuration. Take care not to output information about internal
-- exceptions.
-- ??? In the Front-End ZCX case, the traceback entries we have at this
-- point only include the ones we stored while walking up the stack *up
-- to the handler*. All the frames above the subprogram in which the
-- handler is found are missing.
if not Excep.Id.Not_Handled_By_Others
and then
(Exception_Trace = Every_Raise
or else (Exception_Trace = Unhandled_Raise and then Is_Unhandled))
then
To_Stderr (Nline);
if Is_Unhandled then
To_Stderr ("Unhandled ");
end if;
To_Stderr ("Exception raised");
To_Stderr (Nline);
To_Stderr (Tailored_Exception_Information (Excep.all));
end if;
-- Call the user-specific actions
-- ??? We should presumably look at the reraise status here.
if Raise_Hook_Initialized
and then Exception_Data_Ptr (Excep.Id).Raise_Hook /= null
then
To_Action (Exception_Data_Ptr (Excep.Id).Raise_Hook) (Excep.all);
end if;
if Global_Action /= null then
Global_Action (Excep.all);
end if;
end Notify_Exception;
------------------------------
-- Notify_Handled_Exception --
------------------------------
procedure Notify_Handled_Exception is
begin
Notify_Exception (Get_Current_Excep.all, Is_Unhandled => False);
end Notify_Handled_Exception;
--------------------------------
-- Notify_Unhandled_Exception --
--------------------------------
procedure Notify_Unhandled_Exception is
Excep : constant EOA := Get_Current_Excep.all;
begin
-- Check whether there is any termination handler to be executed for
-- the environment task, and execute it if needed. Here we handle both
-- the Abnormal and Unhandled_Exception task termination. Normal
-- task termination routine is executed elsewhere (either in the
-- Task_Wrapper or in the Adafinal routine for the environment task).
Task_Termination_Handler.all (Excep.all);
Notify_Exception (Excep, Is_Unhandled => True);
Unhandled_Exception;
end Notify_Unhandled_Exception;
-------------------------
-- Unhandled_Exception --
-------------------------
procedure Unhandled_Exception is
begin
null;
end Unhandled_Exception;
-----------------------------------
-- Unhandled_Exception_Terminate --
-----------------------------------
procedure Unhandled_Exception_Terminate is
Excep : constant EOA := Save_Occurrence (Get_Current_Excep.all.all);
-- This occurrence will be used to display a message after finalization.
-- It is necessary to save a copy here, or else the designated value
-- could be overwritten if an exception is raised during finalization
-- (even if that exception is caught).
begin
Last_Chance_Handler (Excep.all);
end Unhandled_Exception_Terminate;
------------------------------------
-- Handling GNAT.Exception_Traces --
------------------------------------
-- The bulk of exception traces output is centralized in Notify_Exception,
-- for both the Handled and Unhandled cases. Extra task specific output is
-- triggered in the task wrapper for unhandled occurrences in tasks. It is
-- not performed in this unit to avoid dragging dependencies against the
-- tasking units here.
-- We used to rely on the output performed by Unhanded_Exception_Terminate
-- for the case of an unhandled occurrence in the environment thread, and
-- the task wrapper was responsible for the whole output in the tasking
-- case.
-- This initial scheme had a drawback: the output from Terminate only
-- occurs after finalization is done, which means possibly never if some
-- tasks keep hanging around.
-- The first "presumably obvious" fix consists in moving the Terminate
-- output before the finalization. It has not been retained because it
-- introduces annoying changes in output orders when the finalization
-- itself issues outputs, this also in "regular" cases not resorting to
-- Exception_Traces.
-- Today's solution has the advantage of simplicity and better isolates
-- the Exception_Traces machinery.
-- It currently outputs the information about unhandled exceptions twice
-- in the environment thread, once in the notification routine and once in
-- the termination routine. Avoiding the second output is possible but so
-- far has been considered undesirable. It would mean changing the order
-- of outputs between the two runs with or without exception traces, while
-- it seems preferrable to only have additional outputs in the former
-- case.
end Exception_Traces;
|
------------------------------------------------------------------------------
-- --
-- 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$
------------------------------------------------------------------------------
package body AMF.DC.Point_Collections.Internals is
---------------
-- To_Holder --
---------------
function To_Holder
(Item : AMF.DC.Sequence_OF_DC_Point) return League.Holders.Holder is
begin
return League.Holders.Empty_Holder;
end To_Holder;
end AMF.DC.Point_Collections.Internals;
|
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="15">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>colorthresholding_9_0_3_2160_3840_1_entry28</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>p_src_mat_rows</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName>FIFO_SRL</coreName>
<coreId>49</coreId>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>p_src_mat_cols</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName>FIFO_SRL</coreName>
<coreId>49</coreId>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>p_src_mat_rows_out</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName>FIFO_SRL</coreName>
<coreId>49</coreId>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_4">
<Value>
<Obj>
<type>1</type>
<id>4</id>
<name>p_src_mat_cols_out</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName>FIFO_SRL</coreName>
<coreId>52</coreId>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>7</id>
<name>p_src_mat_rows_read</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control>auto</control>
<opType>fifo</opType>
<implIndex>srl</implIndex>
<coreName>FIFO_SRL</coreName>
<coreId>81</coreId>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>18</item>
<item>19</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.40</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>0</coreId>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>p_src_mat_rows_out_write_ln0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control>auto</control>
<opType>fifo</opType>
<implIndex>srl</implIndex>
<coreName>FIFO_SRL</coreName>
<coreId>81</coreId>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>22</item>
<item>23</item>
<item>24</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.40</m_delay>
<m_topoIndex>3</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>p_src_mat_cols_read</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control>auto</control>
<opType>fifo</opType>
<implIndex>srl</implIndex>
<coreName>FIFO_SRL</coreName>
<coreId>81</coreId>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>25</item>
<item>26</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.40</m_delay>
<m_topoIndex>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>empty_50</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>132</coreId>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name>p_src_mat_cols_out_write_ln0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control>auto</control>
<opType>fifo</opType>
<implIndex>srl</implIndex>
<coreName>FIFO_SRL</coreName>
<coreId>81</coreId>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>28</item>
<item>29</item>
<item>30</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.40</m_delay>
<m_topoIndex>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>_ln0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>129</coreId>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>7</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
</nodes>
<consts class_id="11" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</consts>
<blocks class_id="12" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="13" tracking_level="1" version="0" object_id="_12">
<Obj>
<type>3</type>
<id>16</id>
<name>colorthresholding<9, 0, 3, 2160, 3840, 1>.entry28</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>1768189039</coreId>
</Obj>
<node_objs>
<count>7</count>
<item_version>0</item_version>
<item>7</item>
<item>8</item>
<item>10</item>
<item>11</item>
<item>12</item>
<item>14</item>
<item>15</item>
</node_objs>
</item>
</blocks>
<edges class_id="14" tracking_level="0" version="0">
<count>8</count>
<item_version>0</item_version>
<item class_id="15" tracking_level="1" version="0" object_id="_13">
<id>19</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>7</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="15" object_id="_14">
<id>20</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>8</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="15" object_id="_15">
<id>23</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>10</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="15" object_id="_16">
<id>24</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>10</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="15" object_id="_17">
<id>26</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>11</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="15" object_id="_18">
<id>27</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>12</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="15" object_id="_19">
<id>29</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="15" object_id="_20">
<id>30</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="16" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="17" tracking_level="1" version="0" object_id="_21">
<mId>1</mId>
<mTag>colorthresholding<9, 0, 3, 2160, 3840, 1>.entry28</mTag>
<mNormTag>colorthresholding_9_0_3_2160_3840_1_entry28</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>16</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="19" tracking_level="1" version="0" object_id="_22">
<states class_id="20" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="21" tracking_level="1" version="0" object_id="_23">
<id>1</id>
<operations class_id="22" tracking_level="0" version="0">
<count>11</count>
<item_version>0</item_version>
<item class_id="23" tracking_level="1" version="0" object_id="_24">
<id>5</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="23" object_id="_25">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="23" object_id="_26">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="23" object_id="_27">
<id>8</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="23" object_id="_28">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="23" object_id="_29">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="23" object_id="_30">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="23" object_id="_31">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="23" object_id="_32">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="23" object_id="_33">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="23" object_id="_34">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="24" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</transitions>
</fsm>
<res class_id="-1"></res>
<node_label_latency class_id="26" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="27" tracking_level="0" version="0">
<first>7</first>
<second class_id="28" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>8</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>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>0</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="29" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="0" version="0">
<first>16</first>
<second class_id="31" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="32" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</regions>
<dp_fu_nodes class_id="33" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="34" tracking_level="0" version="0">
<first>26</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</second>
</item>
<item>
<first>32</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>39</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>45</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>52</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>57</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="36" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="37" tracking_level="0" version="0">
<first>empty_50_fu_57</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>empty_fu_52</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>p_src_mat_cols_read_read_fu_39</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>p_src_mat_rows_read_read_fu_26</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</second>
</item>
<item>
<first>write_ln0_write_fu_32</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>write_ln0_write_fu_45</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</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="38" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_reg_nodes>
<dp_regname_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="39" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="40" tracking_level="0" version="0">
<first>p_src_mat_cols</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
</second>
</item>
<item>
<first>p_src_mat_cols_out</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
</second>
</item>
<item>
<first>p_src_mat_rows</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</second>
</item>
</second>
</item>
<item>
<first>p_src_mat_rows_out</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core>
<count>4</count>
<item_version>0</item_version>
<item>
<first>1</first>
<second>
<first>1150</first>
<second>10</second>
</second>
</item>
<item>
<first>2</first>
<second>
<first>1150</first>
<second>10</second>
</second>
</item>
<item>
<first>3</first>
<second>
<first>1151</first>
<second>10</second>
</second>
</item>
<item>
<first>4</first>
<second>
<first>1151</first>
<second>10</second>
</second>
</item>
</port2core>
<node2core>
<count>4</count>
<item_version>0</item_version>
<item>
<first>7</first>
<second>
<first>1150</first>
<second>10</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>1151</first>
<second>10</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>1150</first>
<second>10</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>1151</first>
<second>10</second>
</second>
</item>
</node2core>
</syndb>
</boost_serialization>
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Elements;
with AMF.Internals.Element_Collections;
with AMF.Internals.Helpers;
with AMF.Internals.Tables.OCL_Attributes;
with AMF.UML.Comments.Collections;
with AMF.UML.Dependencies.Collections;
with AMF.UML.Elements.Collections;
with AMF.UML.Named_Elements;
with AMF.UML.Namespaces.Collections;
with AMF.UML.Packages.Collections;
with AMF.UML.String_Expressions;
with AMF.UML.Types;
with AMF.Visitors.OCL_Iterators;
with AMF.Visitors.OCL_Visitors;
with League.Strings.Internals;
with Matreshka.Internals.Strings;
package body AMF.Internals.OCL_Invalid_Literal_Exps is
--------------
-- Get_Type --
--------------
overriding function Get_Type
(Self : not null access constant OCL_Invalid_Literal_Exp_Proxy)
return AMF.UML.Types.UML_Type_Access is
begin
return
AMF.UML.Types.UML_Type_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Type
(Self.Element)));
end Get_Type;
--------------
-- Set_Type --
--------------
overriding procedure Set_Type
(Self : not null access OCL_Invalid_Literal_Exp_Proxy;
To : AMF.UML.Types.UML_Type_Access) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Type
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Type;
---------------------------
-- Get_Client_Dependency --
---------------------------
overriding function Get_Client_Dependency
(Self : not null access constant OCL_Invalid_Literal_Exp_Proxy)
return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency is
begin
return
AMF.UML.Dependencies.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Client_Dependency
(Self.Element)));
end Get_Client_Dependency;
--------------
-- Get_Name --
--------------
overriding function Get_Name
(Self : not null access constant OCL_Invalid_Literal_Exp_Proxy)
return AMF.Optional_String is
begin
declare
use type Matreshka.Internals.Strings.Shared_String_Access;
Aux : constant Matreshka.Internals.Strings.Shared_String_Access
:= AMF.Internals.Tables.OCL_Attributes.Internal_Get_Name (Self.Element);
begin
if Aux = null then
return (Is_Empty => True);
else
return (False, League.Strings.Internals.Create (Aux));
end if;
end;
end Get_Name;
--------------
-- Set_Name --
--------------
overriding procedure Set_Name
(Self : not null access OCL_Invalid_Literal_Exp_Proxy;
To : AMF.Optional_String) is
begin
if To.Is_Empty then
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Name
(Self.Element, null);
else
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Name
(Self.Element,
League.Strings.Internals.Internal (To.Value));
end if;
end Set_Name;
-------------------------
-- Get_Name_Expression --
-------------------------
overriding function Get_Name_Expression
(Self : not null access constant OCL_Invalid_Literal_Exp_Proxy)
return AMF.UML.String_Expressions.UML_String_Expression_Access is
begin
return
AMF.UML.String_Expressions.UML_String_Expression_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Name_Expression
(Self.Element)));
end Get_Name_Expression;
-------------------------
-- Set_Name_Expression --
-------------------------
overriding procedure Set_Name_Expression
(Self : not null access OCL_Invalid_Literal_Exp_Proxy;
To : AMF.UML.String_Expressions.UML_String_Expression_Access) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Name_Expression
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Name_Expression;
-------------------
-- Get_Namespace --
-------------------
overriding function Get_Namespace
(Self : not null access constant OCL_Invalid_Literal_Exp_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access is
begin
return
AMF.UML.Namespaces.UML_Namespace_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Namespace
(Self.Element)));
end Get_Namespace;
------------------------
-- Get_Qualified_Name --
------------------------
overriding function Get_Qualified_Name
(Self : not null access constant OCL_Invalid_Literal_Exp_Proxy)
return AMF.Optional_String is
begin
declare
use type Matreshka.Internals.Strings.Shared_String_Access;
Aux : constant Matreshka.Internals.Strings.Shared_String_Access
:= AMF.Internals.Tables.OCL_Attributes.Internal_Get_Qualified_Name (Self.Element);
begin
if Aux = null then
return (Is_Empty => True);
else
return (False, League.Strings.Internals.Create (Aux));
end if;
end;
end Get_Qualified_Name;
--------------------
-- Get_Visibility --
--------------------
overriding function Get_Visibility
(Self : not null access constant OCL_Invalid_Literal_Exp_Proxy)
return AMF.UML.Optional_UML_Visibility_Kind is
begin
return
AMF.Internals.Tables.OCL_Attributes.Internal_Get_Visibility
(Self.Element);
end Get_Visibility;
--------------------
-- Set_Visibility --
--------------------
overriding procedure Set_Visibility
(Self : not null access OCL_Invalid_Literal_Exp_Proxy;
To : AMF.UML.Optional_UML_Visibility_Kind) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Visibility
(Self.Element, To);
end Set_Visibility;
-----------------------
-- Get_Owned_Comment --
-----------------------
overriding function Get_Owned_Comment
(Self : not null access constant OCL_Invalid_Literal_Exp_Proxy)
return AMF.UML.Comments.Collections.Set_Of_UML_Comment is
begin
return
AMF.UML.Comments.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owned_Comment
(Self.Element)));
end Get_Owned_Comment;
-----------------------
-- Get_Owned_Element --
-----------------------
overriding function Get_Owned_Element
(Self : not null access constant OCL_Invalid_Literal_Exp_Proxy)
return AMF.UML.Elements.Collections.Set_Of_UML_Element is
begin
return
AMF.UML.Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owned_Element
(Self.Element)));
end Get_Owned_Element;
---------------
-- Get_Owner --
---------------
overriding function Get_Owner
(Self : not null access constant OCL_Invalid_Literal_Exp_Proxy)
return AMF.UML.Elements.UML_Element_Access is
begin
return
AMF.UML.Elements.UML_Element_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owner
(Self.Element)));
end Get_Owner;
--------------------
-- All_Namespaces --
--------------------
overriding function All_Namespaces
(Self : not null access constant OCL_Invalid_Literal_Exp_Proxy)
return AMF.UML.Namespaces.Collections.Ordered_Set_Of_UML_Namespace is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "All_Namespaces unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Invalid_Literal_Exp_Proxy.All_Namespaces";
return All_Namespaces (Self);
end All_Namespaces;
-------------------------
-- All_Owning_Packages --
-------------------------
overriding function All_Owning_Packages
(Self : not null access constant OCL_Invalid_Literal_Exp_Proxy)
return AMF.UML.Packages.Collections.Set_Of_UML_Package is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "All_Owning_Packages unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Invalid_Literal_Exp_Proxy.All_Owning_Packages";
return All_Owning_Packages (Self);
end All_Owning_Packages;
-----------------------------
-- Is_Distinguishable_From --
-----------------------------
overriding function Is_Distinguishable_From
(Self : not null access constant OCL_Invalid_Literal_Exp_Proxy;
N : AMF.UML.Named_Elements.UML_Named_Element_Access;
Ns : AMF.UML.Namespaces.UML_Namespace_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Distinguishable_From unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Invalid_Literal_Exp_Proxy.Is_Distinguishable_From";
return Is_Distinguishable_From (Self, N, Ns);
end Is_Distinguishable_From;
---------------
-- Namespace --
---------------
overriding function Namespace
(Self : not null access constant OCL_Invalid_Literal_Exp_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Namespace unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Invalid_Literal_Exp_Proxy.Namespace";
return Namespace (Self);
end Namespace;
--------------------
-- Qualified_Name --
--------------------
overriding function Qualified_Name
(Self : not null access constant OCL_Invalid_Literal_Exp_Proxy)
return League.Strings.Universal_String is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Qualified_Name unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Invalid_Literal_Exp_Proxy.Qualified_Name";
return Qualified_Name (Self);
end Qualified_Name;
---------------
-- Separator --
---------------
overriding function Separator
(Self : not null access constant OCL_Invalid_Literal_Exp_Proxy)
return League.Strings.Universal_String is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Separator unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Invalid_Literal_Exp_Proxy.Separator";
return Separator (Self);
end Separator;
------------------------
-- All_Owned_Elements --
------------------------
overriding function All_Owned_Elements
(Self : not null access constant OCL_Invalid_Literal_Exp_Proxy)
return AMF.UML.Elements.Collections.Set_Of_UML_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "All_Owned_Elements unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Invalid_Literal_Exp_Proxy.All_Owned_Elements";
return All_Owned_Elements (Self);
end All_Owned_Elements;
-------------------
-- Must_Be_Owned --
-------------------
overriding function Must_Be_Owned
(Self : not null access constant OCL_Invalid_Literal_Exp_Proxy)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Must_Be_Owned unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Invalid_Literal_Exp_Proxy.Must_Be_Owned";
return Must_Be_Owned (Self);
end Must_Be_Owned;
-------------------
-- Enter_Element --
-------------------
overriding procedure Enter_Element
(Self : not null access constant OCL_Invalid_Literal_Exp_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.OCL_Visitors.OCL_Visitor'Class then
AMF.Visitors.OCL_Visitors.OCL_Visitor'Class
(Visitor).Enter_Invalid_Literal_Exp
(AMF.OCL.Invalid_Literal_Exps.OCL_Invalid_Literal_Exp_Access (Self),
Control);
end if;
end Enter_Element;
-------------------
-- Leave_Element --
-------------------
overriding procedure Leave_Element
(Self : not null access constant OCL_Invalid_Literal_Exp_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.OCL_Visitors.OCL_Visitor'Class then
AMF.Visitors.OCL_Visitors.OCL_Visitor'Class
(Visitor).Leave_Invalid_Literal_Exp
(AMF.OCL.Invalid_Literal_Exps.OCL_Invalid_Literal_Exp_Access (Self),
Control);
end if;
end Leave_Element;
-------------------
-- Visit_Element --
-------------------
overriding procedure Visit_Element
(Self : not null access constant OCL_Invalid_Literal_Exp_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Iterator in AMF.Visitors.OCL_Iterators.OCL_Iterator'Class then
AMF.Visitors.OCL_Iterators.OCL_Iterator'Class
(Iterator).Visit_Invalid_Literal_Exp
(Visitor,
AMF.OCL.Invalid_Literal_Exps.OCL_Invalid_Literal_Exp_Access (Self),
Control);
end if;
end Visit_Element;
end AMF.Internals.OCL_Invalid_Literal_Exps;
|
with Ada.Exceptions;
private with Ada.Finalization;
-- Provides routines that prefix the output with the name of the current
-- module.
--
-- Note:
-- If this is instantiated multiple times inside nested declarative regions
-- (e.g. nested subprograms) and the resulting package is "use"d, then calls on
-- Log, etc. in the inner statements will be ambiguious and will not compile.
-- Solution: Prefix the call with the instantiated package name.
generic
Module_Name : in string;
package Generic_Logging is
procedure Log (Message : in String);
procedure Log_Wide (Message : in Wide_String);
procedure Log_Exception (X : in Ada.Exceptions.Exception_Occurrence);
type Auto_Logger is limited private;
private
type Auto_Logger is new Ada.Finalization.Limited_Controlled with null record;
procedure Initialize (Self : in out Auto_Logger);
procedure Finalize (Self : in out Auto_Logger);
end Generic_Logging;
|
with Ada.Text_IO;
use Ada.Text_IO;
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with Gprslaves.DB;
with Gprslaves.DB.JSON;
with GNATCOLL.JSON;
with GNAT.Command_Line;
use GNAT.Command_Line;
with GNAT.String_Split;
with GNAT.Spitbol; use GNAT.Spitbol;
with GNAT.Spitbol.Table_VString; use GNAT.Spitbol.Table_VString;
with Gprslaves.Configuration;
use Gprslaves.Configuration;
procedure GPR_Tools.Gprslaves.Get is
use GNAT.String_Split;
use DB;
procedure Put (Self : GNAT.Spitbol.Table_VString.Table) is
J : GNATCOLL.JSON.JSON_Array;
V : constant GNATCOLL.JSON.JSON_Value := GNATCOLL.JSON.Create (J);
begin
Ada.Text_IO.Put_Line (GNATCOLL.JSON.Write (V, False));
end Put;
Keys : GNAT.Spitbol.Table_VString.Table (32);
procedure Help is
begin
Put_Line (Configuration.Command & " " & VERSION &
"-v --version displa");
end Help;
begin
Set (Keys, V ("GNAT"), V (Get_Gnat_Version));
loop
case Getopt ("D! -help h ? " &
"-version " &
"n= -nameserver= " &
"v") is
when ASCII.NUL => exit;
when '-' =>
if Full_Switch = "-version" then
Put_Line (VERSION);
elsif Full_Switch = "-nameserver" then
Configuration.Nameserver := V (Parameter);
end if;
when 'D' =>
declare
S : GNAT.String_Split.Slice_Set;
begin
Create (S, Parameter, "=");
if Slice_Count (S) = 2 then
Set (Keys, V (Slice (S, 1)), V (Slice (S, 2)));
end if;
end;
when 'v' =>
Configuration.Verbosity := Configuration.Verbosity + 1;
when 'n' =>
Configuration.Nameserver := V (Parameter);
when 'h' | '?' =>
Help;
return;
when others =>
null;
end case;
end loop;
Put_Line (S (Configuration.Nameserver));
Put (Keys);
end Gprslaves.Get;
|
with
ada.Text_IO,
ada.Exceptions;
package body openGL.Camera
is
use math.Algebra.linear,
math.Algebra.linear.d3,
ada.Text_IO;
---------
-- Forge
--
procedure define (Self : in out Item)
is
begin
Self.Culler .define;
Self.Impostorer.define;
Self.world_Transform := Identity_4x4;
Self. view_Transform := Identity_4x4;
Self.Viewport := (Min => (0, 0),
Max => (0, 0));
end define;
procedure destroy (Self : in out Item)
is
begin
Self.cull_Engine.stop;
end destroy;
--------------
-- Attributes
--
function to_World_Site (Self : in Item'Class; Window_Site : in math.Vector_3) return math.Vector_3
is
perspective_Transform : constant math.Matrix_4x4 := to_Perspective (FoVy => 60.0,
Aspect => Self.Aspect,
zNear => Self.near_Plane_Distance,
zFar => Self. far_Plane_Distance);
Viewport : constant Rectangle := Self.Viewport;
Position_window_space : constant Vector_3 := (Window_Site (1),
Real (Viewport.Max (2)) - Window_Site (2),
Window_Site (3));
Site_world_space : constant Vector_3 := unProject (Position_window_space,
Model => Self.view_Transform,
Projection => perspective_Transform,
Viewport => Viewport);
begin
return Site_world_space;
end to_World_Site;
procedure Site_is (Self : in out Item'Class; now : in math.Vector_3)
is
begin
Self.world_Transform := to_transform_Matrix ((Self.Spin,
now));
Self.update_View_Transform;
end Site_is;
function Site (Self : in Item'Class) return math.Vector_3
is
begin
return get_Translation (Self.world_Transform);
end Site;
procedure Position_is (Self : in out Item'Class; Site : in math.Vector_3;
Spin : in math.Matrix_3x3)
is
begin
Self.world_Transform := to_transform_Matrix ((Spin,
Site));
Self.update_View_Transform;
end Position_is;
procedure Spin_is (Self : in out Item'Class; now : in math.Matrix_3x3)
is
begin
set_Rotation (Self.world_Transform, to => now);
Self.update_View_Transform;
end Spin_is;
function Spin (Self : in Item'Class) return math.Matrix_3x3
is
begin
return get_Rotation (Self.world_Transform);
end Spin;
function World_Transform (Self : in Item) return math.Matrix_4x4
is
begin
return Self.world_Transform;
end World_Transform;
function FoVy (Self : in Item'Class) return math.Degrees
is
begin
return Self.FoVy;
end FOVy;
function Aspect (Self : in Item'Class) return math.Real
is
begin
return Self.Aspect;
end Aspect;
procedure Aspect_is (Self : in out Item'Class; now : in math.Real)
is
begin
Self.Aspect := now;
end Aspect_is;
function near_Plane_Distance (Self : in Item'Class) return math.Real
is
begin
return Self.near_Plane_Distance;
end near_Plane_Distance;
procedure near_Plane_Distance_is (Self : in out Item'Class; now : in math.Real)
is
begin
Self.near_Plane_Distance := now;
end near_Plane_Distance_is;
function far_Plane_Distance (Self : in Item'Class) return math.Real
is
begin
return Self.far_Plane_Distance;
end far_Plane_Distance;
procedure far_Plane_Distance_is (Self : in out Item'Class; now : in math.Real)
is
begin
Self.far_Plane_Distance := now;
end far_Plane_Distance_is;
function view_Transform (Self : in Item'Class) return math.Matrix_4x4
is
begin
return Self.view_Transform;
end view_Transform;
function projection_Transform (Self : in Item'Class) return math.Matrix_4x4
is
begin
return Self.projection_Transform;
end projection_Transform;
procedure Viewport_is (Self : in out Item'Class; Width, Height : in Positive)
is
use real_Functions;
half_FoV_max : Radians := to_Radians (0.5 * Self.FoVy);
Tan_of_half_FoV_max : constant Real := Tan (half_FoV_max);
begin
Self.Viewport.Min (1) := 0;
Self.Viewport.Min (2) := 0;
Self.Viewport.Max (1) := Width - 1;
Self.Viewport.Max (2) := Height - 1;
Self.Aspect := Real (Width) / Real (Height);
Self.near_plane_Height := Self.near_plane_Distance * Tan_of_half_FoV_max;
Self.near_plane_Width := Self.near_plane_Height * Self.Aspect;
Self.far_plane_Height := Self.far_plane_Distance * Tan_of_half_FoV_max;
Self.far_plane_Width := Self.far_plane_Height * Self.Aspect;
if Self.Aspect > 1.0
then -- X side angle broader than y side angle.
half_FoV_max := arcTan (Self.aspect * Tan_of_half_FoV_max); -- TODO: 'half_FoV_max' is not used after here. Why is it set ?
end if;
Self.projection_Transform := to_Perspective (FoVy => Self.FoVy,
Aspect => Self.Aspect,
zNear => Self.near_Plane_Distance,
zFar => Self. far_Plane_Distance);
end Viewport_is;
function Viewport (Self : in Item) return linear_Algebra_3d.Rectangle
is
begin
return Self.Viewport;
end Viewport;
procedure Renderer_is (Self : in out Item'Class; now : in Renderer.lean.view)
is
begin
Self.Renderer := now;
end Renderer_is;
function cull_completed (Self : in Item) return Boolean
is
begin
return Boolean (Self.cull_Completed);
end cull_completed;
procedure disable_cull (Self : in out Item)
is
begin
Self.is_Culling := False;
end disable_cull;
function vanish_Point_Size_min (Self : in Item'Class) return Real
is
begin
return Self.Culler.vanish_Point_Size_min;
end vanish_Point_Size_min;
procedure vanish_Point_Size_min_is (Self : in out Item'Class; now : in Real)
is
begin
Self.Culler.vanish_Point_Size_min_is (now);
end vanish_Point_Size_min_is;
-- Impostors
--
function Impostor_Size_min (Self : in Item) return Real
is
begin
return Self.Impostorer.Impostor_Size_min;
end Impostor_Size_min;
procedure Impostor_Size_min_is (Self : in out Item; now : in Real)
is
begin
Self.Impostorer.Impostor_Size_min_is (now);
end Impostor_Size_min_is;
procedure allow_Impostors (Self : in out Item; now : in Boolean := True)
is
begin
Self.Impostors_allowed := now;
end allow_Impostors;
----------
-- Engine
--
task body cull_Engine
is
Done : Boolean := False;
culling : Boolean;
all_Visuals : openGL.Visual.views (1 .. 20_000);
all_Visuals_last : Natural;
begin
loop
select
accept stop
do
Done := True;
end stop;
or
accept cull (the_Visuals : in Visual.views; do_cull : in Boolean)
do
all_Visuals (the_Visuals'Range) := the_Visuals;
all_visuals_Last := the_Visuals'Last;
culling := do_cull;
Self.Cull_completed := False;
end cull;
end select;
exit when Done;
declare
function get_Visuals return Visual.views
is
begin
if culling
then
return Self.Culler.cull (the_Visuals => all_Visuals (1 .. all_Visuals_last),
Camera_Frustum => Self.current_Planes,
Camera_Site => Self.Site);
else
return all_Visuals (1 .. all_visuals_Last);
end if;
end get_Visuals;
the_Visuals : Visual.views := get_Visuals;
begin
if Self.Impostors_allowed
then
Self.Impostorer.Renderer_is (Self.Renderer);
Self.Impostorer.substitute (the_Visuals,
Camera => Self);
end if;
Self.Renderer.queue_Visuals (the_Visuals, Self);
Self.Cull_completed := True;
end;
end loop;
Self.Impostorer.destruct;
exception
when E : others =>
new_Line;
put_Line ("Unhandled exception in openGL camera Cull engine.");
put_Line (ada.Exceptions.Exception_Information (E));
end cull_Engine;
--------------
-- Operations
--
procedure render (Self : in out Item; Visuals : in Visual.views;
to : in Surface.view := null)
is
pragma Unreferenced (To); -- TODO: Finish using surfaces.
begin
Self.cull_Engine.cull (Visuals, do_cull => Self.is_Culling);
end render;
function current_Planes (Self : in Item) return openGL.Frustum.Plane_array
is
use openGL.Frustum;
the_Planes : Frustum.Plane_array;
Projection : constant Matrix_4x4 := Self.projection_Transform;
Model : constant Matrix_4x4 := Self.view_Transform;
Clip : constant Matrix_4x4 := Model * Projection;
begin
-- Extract the Right plane.
--
the_Planes (Right)(1) := clip (1,4) - clip (1,1);
the_Planes (Right)(2) := clip (2,4) - clip (2,1);
the_Planes (Right)(3) := clip (3,4) - clip (3,1);
the_Planes (Right)(4) := clip (4,4) - clip (4,1);
-- Extract the Left plane.
--
the_Planes (Left)(1) := clip (1,4) + clip (1,1);
the_Planes (Left)(2) := clip (2,4) + clip (2,1);
the_Planes (Left)(3) := clip (3,4) + clip (3,1);
the_Planes (Left)(4) := clip (4,4) + clip (4,1);
-- Extract the Low plane.
--
the_Planes (Low)(1) := clip (1,4) + clip (1,2);
the_Planes (Low)(2) := clip (2,4) + clip (2,2);
the_Planes (Low)(3) := clip (3,4) + clip (3,2);
the_Planes (Low)(4) := clip (4,4) + clip (4,2);
-- Extract the High plane.
--
the_Planes (High)(1) := clip (1,4) - clip (1,2);
the_Planes (High)(2) := clip (2,4) - clip (2,2);
the_Planes (High)(3) := clip (3,4) - clip (3,2);
the_Planes (High)(4) := clip (4,4) - clip (4,2);
-- Extract the Far plane.
--
the_Planes (Far)(1) := clip (1,4) - clip (1,3);
the_Planes (Far)(2) := clip (2,4) - clip (2,3);
the_Planes (Far)(3) := clip (3,4) - clip (3,3);
the_Planes (Far)(4) := clip (4,4) - clip (4,3);
-- Extract the Near plane.
--
the_Planes (Near)(1) := clip (1,4) + clip (1,3);
the_Planes (Near)(2) := clip (2,4) + clip (2,3);
the_Planes (Near)(3) := clip (3,4) + clip (3,3);
the_Planes (Near)(4) := clip (4,4) + clip (4,3);
normalise (the_Planes);
return the_Planes;
end current_Planes;
procedure update_View_Transform (Self : in out Item)
is
begin
Self.view_Transform := inverse_Transform (Self.world_Transform);
end update_View_Transform;
end openGL.Camera;
|
--
-- Copyright (C) 2013 Reto Buerki <reet@codelabs.ch>
-- Copyright (C) 2013 Adrian-Ken Rueegsegger <ken@codelabs.ch>
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions
-- are met:
-- 1. Redistributions of source code must retain the above copyright
-- notice, this list of conditions and the following disclaimer.
-- 2. Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
-- 3. Neither the name of the University nor the names of its contributors
-- may be used to endorse or promote products derived from this software
-- without specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
-- ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
-- FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
-- DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
-- OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
-- HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
-- LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
-- OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
-- SUCH DAMAGE.
--
separate (Tkmrpc.Clients.Ike)
procedure Init
(Result : out Results.Result_Type;
Address : Interfaces.C.Strings.chars_ptr)
is
begin
declare
Socket_Address : constant String := Interfaces.C.Strings.Value
(Item => Address);
begin
Transport.Client.Connect (Address => Socket_Address);
Result := Results.Ok;
end;
exception
when others =>
Result := Results.Invalid_Operation;
end Init;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- T R E E _ I O --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-2001 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Debug; use Debug;
with Output; use Output;
with Unchecked_Conversion;
package body Tree_IO is
Debug_Flag_Tree : Boolean := False;
-- Debug flag for debug output from tree read/write
-------------------------------------------
-- Compression Scheme Used for Tree File --
-------------------------------------------
-- We don't just write the data directly, but instead do a mild form
-- of compression, since we expect lots of compressible zeroes and
-- blanks. The compression scheme is as follows:
-- 00nnnnnn followed by nnnnnn bytes (non compressed data)
-- 01nnnnnn indicates nnnnnn binary zero bytes
-- 10nnnnnn indicates nnnnnn ASCII space bytes
-- 11nnnnnn bbbbbbbb indicates nnnnnnnn occurrences of byte bbbbbbbb
-- Since we expect many zeroes in trees, and many spaces in sources,
-- this compression should be reasonably efficient. We can put in
-- something better later on.
-- Note that this compression applies to the Write_Tree_Data and
-- Read_Tree_Data calls, not to the calls to read and write single
-- scalar values, which are written in memory format without any
-- compression.
C_Noncomp : constant := 2#00_000000#;
C_Zeros : constant := 2#01_000000#;
C_Spaces : constant := 2#10_000000#;
C_Repeat : constant := 2#11_000000#;
-- Codes for compression sequences
Max_Count : constant := 63;
-- Maximum data length for one compression sequence
Max_Comp : constant := Max_Count + 1;
-- Maximum length of one compression sequence
-- The above compression scheme applies only to data written with the
-- Tree_Write routine and read with Tree_Read. Data written using the
-- Tree_Write_Char or Tree_Write_Int routines and read using the
-- corresponding input routines is not compressed.
type Int_Bytes is array (1 .. 4) of Byte;
for Int_Bytes'Size use 32;
function To_Int_Bytes is new Unchecked_Conversion (Int, Int_Bytes);
function To_Int is new Unchecked_Conversion (Int_Bytes, Int);
----------------------
-- Global Variables --
----------------------
Tree_FD : File_Descriptor;
-- File descriptor for tree
Buflen : constant Int := 8_192;
-- Length of buffer for read and write file data
Buf : array (Pos range 1 .. Buflen) of Byte;
-- Read/write file data buffer
Bufn : Nat;
-- Number of bytes read/written from/to buffer
Buft : Nat;
-- Total number of bytes in input buffer containing valid data. Used only
-- for input operations. There is data left to be processed in the buffer
-- if Buft > Bufn. A value of zero for Buft means that the buffer is empty.
-----------------------
-- Local Subprograms --
-----------------------
procedure Read_Buffer;
-- Reads data into buffer, setting Bufe appropriately
function Read_Byte return Byte;
pragma Inline (Read_Byte);
-- Returns next byte from input file, raises Tree_Format_Error if none left
procedure Write_Buffer;
-- Writes out current buffer contents
procedure Write_Byte (B : Byte);
pragma Inline (Write_Byte);
-- Write one byte to output buffer, checking for buffer-full condition
-----------------
-- Read_Buffer --
-----------------
procedure Read_Buffer is
begin
Buft := Int (Read (Tree_FD, Buf (1)'Address, Integer (Buflen)));
if Buft = 0 then
raise Tree_Format_Error;
else
Bufn := 0;
end if;
end Read_Buffer;
---------------
-- Read_Byte --
---------------
function Read_Byte return Byte is
begin
if Bufn = Buft then
Read_Buffer;
end if;
Bufn := Bufn + 1;
return Buf (Bufn);
end Read_Byte;
--------------------
-- Tree_Read_Bool --
--------------------
procedure Tree_Read_Bool (B : out Boolean) is
begin
B := Boolean'Val (Read_Byte);
if Debug_Flag_Tree then
if B then
Write_Str ("True");
else
Write_Str ("False");
end if;
Write_Eol;
end if;
end Tree_Read_Bool;
--------------------
-- Tree_Read_Char --
--------------------
procedure Tree_Read_Char (C : out Character) is
begin
C := Character'Val (Read_Byte);
if Debug_Flag_Tree then
Write_Str ("==> transmitting Character = ");
Write_Char (C);
Write_Eol;
end if;
end Tree_Read_Char;
--------------------
-- Tree_Read_Data --
--------------------
procedure Tree_Read_Data (Addr : Address; Length : Int) is
type S is array (Pos) of Byte;
-- This is a big array, for which we have to suppress the warning
type SP is access all S;
function To_SP is new Unchecked_Conversion (Address, SP);
Data : constant SP := To_SP (Addr);
-- Data buffer to be read as an indexable array of bytes
OP : Pos := 1;
-- Pointer to next byte of data buffer to be read into
B : Byte;
C : Byte;
L : Int;
begin
if Debug_Flag_Tree then
Write_Str ("==> transmitting ");
Write_Int (Length);
Write_Str (" data bytes");
Write_Eol;
end if;
-- Verify data length
Tree_Read_Int (L);
if L /= Length then
Write_Str ("==> transmitting, expected ");
Write_Int (Length);
Write_Str (" bytes, found length = ");
Write_Int (L);
Write_Eol;
raise Tree_Format_Error;
end if;
-- Loop to read data
while OP <= Length loop
-- Get compression control character
B := Read_Byte;
C := B and 2#00_111111#;
B := B and 2#11_000000#;
-- Non-repeat case
if B = C_Noncomp then
if Debug_Flag_Tree then
Write_Str ("==> uncompressed: ");
Write_Int (Int (C));
Write_Str (", starting at ");
Write_Int (OP);
Write_Eol;
end if;
for J in 1 .. C loop
Data (OP) := Read_Byte;
OP := OP + 1;
end loop;
-- Repeated zeroes
elsif B = C_Zeros then
if Debug_Flag_Tree then
Write_Str ("==> zeroes: ");
Write_Int (Int (C));
Write_Str (", starting at ");
Write_Int (OP);
Write_Eol;
end if;
for J in 1 .. C loop
Data (OP) := 0;
OP := OP + 1;
end loop;
-- Repeated spaces
elsif B = C_Spaces then
if Debug_Flag_Tree then
Write_Str ("==> spaces: ");
Write_Int (Int (C));
Write_Str (", starting at ");
Write_Int (OP);
Write_Eol;
end if;
for J in 1 .. C loop
Data (OP) := Character'Pos (' ');
OP := OP + 1;
end loop;
-- Specified repeated character
else -- B = C_Repeat
B := Read_Byte;
if Debug_Flag_Tree then
Write_Str ("==> other char: ");
Write_Int (Int (C));
Write_Str (" (");
Write_Int (Int (B));
Write_Char (')');
Write_Str (", starting at ");
Write_Int (OP);
Write_Eol;
end if;
for J in 1 .. C loop
Data (OP) := B;
OP := OP + 1;
end loop;
end if;
end loop;
-- At end of loop, data item must be exactly filled
if OP /= Length + 1 then
raise Tree_Format_Error;
end if;
end Tree_Read_Data;
--------------------------
-- Tree_Read_Initialize --
--------------------------
procedure Tree_Read_Initialize (Desc : File_Descriptor) is
begin
Buft := 0;
Bufn := 0;
Tree_FD := Desc;
Debug_Flag_Tree := Debug_Flag_5;
end Tree_Read_Initialize;
-------------------
-- Tree_Read_Int --
-------------------
procedure Tree_Read_Int (N : out Int) is
N_Bytes : Int_Bytes;
begin
for J in 1 .. 4 loop
N_Bytes (J) := Read_Byte;
end loop;
N := To_Int (N_Bytes);
if Debug_Flag_Tree then
Write_Str ("==> transmitting Int = ");
Write_Int (N);
Write_Eol;
end if;
end Tree_Read_Int;
-------------------
-- Tree_Read_Str --
-------------------
procedure Tree_Read_Str (S : out String_Ptr) is
N : Nat;
begin
Tree_Read_Int (N);
S := new String (1 .. Natural (N));
Tree_Read_Data (S.all (1)'Address, N);
end Tree_Read_Str;
-------------------------
-- Tree_Read_Terminate --
-------------------------
procedure Tree_Read_Terminate is
begin
-- Must be at end of input buffer, so we should get Tree_Format_Error
-- if we try to read one more byte, if not, we have a format error.
declare
B : Byte;
begin
B := Read_Byte;
exception
when Tree_Format_Error => return;
end;
raise Tree_Format_Error;
end Tree_Read_Terminate;
---------------------
-- Tree_Write_Bool --
---------------------
procedure Tree_Write_Bool (B : Boolean) is
begin
if Debug_Flag_Tree then
Write_Str ("==> transmitting Boolean = ");
if B then
Write_Str ("True");
else
Write_Str ("False");
end if;
Write_Eol;
end if;
Write_Byte (Boolean'Pos (B));
end Tree_Write_Bool;
---------------------
-- Tree_Write_Char --
---------------------
procedure Tree_Write_Char (C : Character) is
begin
if Debug_Flag_Tree then
Write_Str ("==> transmitting Character = ");
Write_Char (C);
Write_Eol;
end if;
Write_Byte (Character'Pos (C));
end Tree_Write_Char;
---------------------
-- Tree_Write_Data --
---------------------
procedure Tree_Write_Data (Addr : Address; Length : Int) is
type S is array (Pos) of Byte;
-- This is a big array, for which we have to suppress the warning
type SP is access all S;
function To_SP is new Unchecked_Conversion (Address, SP);
Data : constant SP := To_SP (Addr);
-- Pointer to data to be written, converted to array type
IP : Pos := 1;
-- Input buffer pointer, next byte to be processed
NC : Nat range 0 .. Max_Count := 0;
-- Number of bytes of non-compressible sequence
C : Byte;
procedure Write_Non_Compressed_Sequence;
-- Output currently collected sequence of non-compressible data
procedure Write_Non_Compressed_Sequence is
begin
if NC > 0 then
Write_Byte (C_Noncomp + Byte (NC));
if Debug_Flag_Tree then
Write_Str ("==> uncompressed: ");
Write_Int (NC);
Write_Str (", starting at ");
Write_Int (IP - NC);
Write_Eol;
end if;
for J in reverse 1 .. NC loop
Write_Byte (Data (IP - J));
end loop;
NC := 0;
end if;
end Write_Non_Compressed_Sequence;
-- Start of processing for Tree_Write_Data
begin
if Debug_Flag_Tree then
Write_Str ("==> transmitting ");
Write_Int (Length);
Write_Str (" data bytes");
Write_Eol;
end if;
-- We write the count at the start, so that we can check it on
-- the corresponding read to make sure that reads and writes match
Tree_Write_Int (Length);
-- Conversion loop
-- IP is index of next input character
-- NC is number of non-compressible bytes saved up
loop
-- If input is completely processed, then we are all done
if IP > Length then
Write_Non_Compressed_Sequence;
return;
end if;
-- Test for compressible sequence, must be at least three identical
-- bytes in a row to be worthwhile compressing.
if IP + 2 <= Length
and then Data (IP) = Data (IP + 1)
and then Data (IP) = Data (IP + 2)
then
Write_Non_Compressed_Sequence;
-- Count length of new compression sequence
C := 3;
IP := IP + 3;
while IP < Length
and then Data (IP) = Data (IP - 1)
and then C < Max_Count
loop
C := C + 1;
IP := IP + 1;
end loop;
-- Output compression sequence
if Data (IP - 1) = 0 then
if Debug_Flag_Tree then
Write_Str ("==> zeroes: ");
Write_Int (Int (C));
Write_Str (", starting at ");
Write_Int (IP - Int (C));
Write_Eol;
end if;
Write_Byte (C_Zeros + C);
elsif Data (IP - 1) = Character'Pos (' ') then
if Debug_Flag_Tree then
Write_Str ("==> spaces: ");
Write_Int (Int (C));
Write_Str (", starting at ");
Write_Int (IP - Int (C));
Write_Eol;
end if;
Write_Byte (C_Spaces + C);
else
if Debug_Flag_Tree then
Write_Str ("==> other char: ");
Write_Int (Int (C));
Write_Str (" (");
Write_Int (Int (Data (IP - 1)));
Write_Char (')');
Write_Str (", starting at ");
Write_Int (IP - Int (C));
Write_Eol;
end if;
Write_Byte (C_Repeat + C);
Write_Byte (Data (IP - 1));
end if;
-- No compression possible here
else
-- Output non-compressed sequence if at maximum length
if NC = Max_Count then
Write_Non_Compressed_Sequence;
end if;
NC := NC + 1;
IP := IP + 1;
end if;
end loop;
end Tree_Write_Data;
---------------------------
-- Tree_Write_Initialize --
---------------------------
procedure Tree_Write_Initialize (Desc : File_Descriptor) is
begin
Bufn := 0;
Tree_FD := Desc;
Set_Standard_Error;
Debug_Flag_Tree := Debug_Flag_5;
end Tree_Write_Initialize;
--------------------
-- Tree_Write_Int --
--------------------
procedure Tree_Write_Int (N : Int) is
N_Bytes : constant Int_Bytes := To_Int_Bytes (N);
begin
if Debug_Flag_Tree then
Write_Str ("==> transmitting Int = ");
Write_Int (N);
Write_Eol;
end if;
for J in 1 .. 4 loop
Write_Byte (N_Bytes (J));
end loop;
end Tree_Write_Int;
--------------------
-- Tree_Write_Str --
--------------------
procedure Tree_Write_Str (S : String_Ptr) is
begin
Tree_Write_Int (S'Length);
Tree_Write_Data (S (1)'Address, S'Length);
end Tree_Write_Str;
--------------------------
-- Tree_Write_Terminate --
--------------------------
procedure Tree_Write_Terminate is
begin
if Bufn > 0 then
Write_Buffer;
end if;
end Tree_Write_Terminate;
------------------
-- Write_Buffer --
------------------
procedure Write_Buffer is
begin
if Integer (Bufn) = Write (Tree_FD, Buf'Address, Integer (Bufn)) then
Bufn := 0;
else
Set_Standard_Error;
Write_Str ("fatal error: disk full");
OS_Exit (2);
end if;
end Write_Buffer;
----------------
-- Write_Byte --
----------------
procedure Write_Byte (B : Byte) is
begin
Bufn := Bufn + 1;
Buf (Bufn) := B;
if Bufn = Buflen then
Write_Buffer;
end if;
end Write_Byte;
end Tree_IO;
|
-----------------------------------------------------------------------
-- swagger-tests -- Unit tests for REST clients
-- Copyright (C) 2018 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.Strings.Unbounded;
with Util.Tests;
with Swagger.Credentials.OAuth;
with TestAPI.Clients;
package Swagger.Tests is
procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite);
type Test is new Util.Tests.Test with record
Server : Ada.Strings.Unbounded.Unbounded_String;
end record;
overriding
procedure Set_Up (T : in out Test);
procedure Configure (T : in out Test;
Client : in out TestAPI.Clients.Client_Type);
procedure Authenticate (T : in out Test;
Cred : in out Swagger.Credentials.OAuth.OAuth2_Credential_Type);
-- Test unauthorized operations.
procedure Test_Unauthorized (T : in out Test);
-- Test authorized operations.
procedure Test_Authorized (T : in out Test);
end Swagger.Tests;
|
------------------------------------------------------------------------------
-- Copyright (c) 2014, 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. --
------------------------------------------------------------------------------
------------------------------------------------------------------------------
-- Natools.S_Expressions.Templates.Integers is a common instance of --
-- Generic_Integers templates, instanciated for standard integers. --
------------------------------------------------------------------------------
with Natools.S_Expressions.Templates.Generic_Integers;
package Natools.S_Expressions.Templates.Integers
is new Natools.S_Expressions.Templates.Generic_Integers (Integer);
pragma Preelaborate (Natools.S_Expressions.Templates.Integers);
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . D I M . M K S _ I O --
-- --
-- S p e c --
-- --
-- Copyright (C) 2011-2019, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Provides output facilities for the MKS dimension system (see System.Dim.Mks
-- and System.Dim.Float_IO).
with System.Dim.Mks; use System.Dim.Mks;
with System.Dim.Float_IO;
package System.Dim.Mks_IO is new System.Dim.Float_IO (Mks_Type);
|
with Ada.Numerics.Generic_Elementary_Functions;
package body Generic_Quaternions is
package Elementary_Functions is
new Ada.Numerics.Generic_Elementary_Functions (Real);
use Elementary_Functions;
function "abs" (Left : Quaternion) return Real is
begin
return Sqrt (Left.A**2 + Left.B**2 + Left.C**2 + Left.D**2);
end "abs";
function Conj (Left : Quaternion) return Quaternion is
begin
return (A => Left.A, B => -Left.B, C => -Left.C, D => -Left.D);
end Conj;
function "-" (Left : Quaternion) return Quaternion is
begin
return (A => -Left.A, B => -Left.B, C => -Left.C, D => -Left.D);
end "-";
function "+" (Left, Right : Quaternion) return Quaternion is
begin
return
( A => Left.A + Right.A, B => Left.B + Right.B,
C => Left.C + Right.C, D => Left.D + Right.D
);
end "+";
function "-" (Left, Right : Quaternion) return Quaternion is
begin
return
( A => Left.A - Right.A, B => Left.B - Right.B,
C => Left.C - Right.C, D => Left.D - Right.D
);
end "-";
function "*" (Left : Quaternion; Right : Real) return Quaternion is
begin
return
( A => Left.A * Right, B => Left.B * Right,
C => Left.C * Right, D => Left.D * Right
);
end "*";
function "*" (Left : Real; Right : Quaternion) return Quaternion is
begin
return Right * Left;
end "*";
function "*" (Left, Right : Quaternion) return Quaternion is
begin
return
( A => Left.A * Right.A - Left.B * Right.B - Left.C * Right.C - Left.D * Right.D,
B => Left.A * Right.B + Left.B * Right.A + Left.C * Right.D - Left.D * Right.C,
C => Left.A * Right.C - Left.B * Right.D + Left.C * Right.A + Left.D * Right.B,
D => Left.A * Right.D + Left.B * Right.C - Left.C * Right.B + Left.D * Right.A
);
end "*";
function Image (Left : Quaternion) return String is
begin
return Real'Image (Left.A) & " +" &
Real'Image (Left.B) & "i +" &
Real'Image (Left.C) & "j +" &
Real'Image (Left.D) & "k";
end Image;
end Generic_Quaternions;
|
with External; use External;
package Receiver is
task type ReceiverTask(k: Natural) is
entry ReceiveMessage;
entry Ended;
end ReceiverTask;
type pReceiverTask is access ReceiverTask;
end Receiver;
|
with System.Machine_Code; use System.Machine_Code;
with System.Storage_Elements; use System.Storage_Elements;
with System; use System;
with Interfaces; use Interfaces;
with MSPGD.Board; use MSPGD.Board;
with MSP430_SVD; use MSP430_SVD;
with MSP430_SVD.FLASH; use MSP430_SVD.FLASH;
with MSP430_SVD.SYSTEM_CLOCK; use MSP430_SVD.SYSTEM_CLOCK;
procedure Main is
pragma Preelaborate;
Flash_Start : Unsigned_16
with Import, External_Name => "__flash_start";
Flash_Size : Unsigned_16
with Import, External_Name => "__flash_size";
Info_Start : Unsigned_16
with Import, External_Name => "__info_start";
Info_Size : Unsigned_16
with Import, External_Name => "__info_size";
Flash_Segment_Size : constant Unsigned_16 := 512;
Info_Segment_Size : constant Unsigned_16 := 64;
type Flash_Memory_Range is new Unsigned_16 range Flash_Start .. Flash_Start + Flash_Size - 2;
type Info_Memory_Range is new Unsigned_16 range Info_Start .. Info_Start + Info_Size - 2;
type Flash_Segment_Range is new Unsigned_16 range 1 .. Flash_Size / Flash_Segment_Size;
Flash_Memory : array (Flash_Memory_Range) of Unsigned_8
with Address => System'To_Address (Flash_Start);
Info_Memory : array (Info_Memory_Range) of Unsigned_8
with Address => System'To_Address (Info_Start);
Line : array (Unsigned_16 range 0 .. 47) of Unsigned_8;
Write_Addr : Flash_Memory_Range;
Count : Unsigned_8;
XON : constant Byte := 17;
XOFF : constant Byte := 19;
function "+" (Addr : Flash_Memory_Range; Offset : Unsigned_16) return Flash_Memory_Range is
begin
return Flash_Memory_Range (Unsigned_16 (Addr) + Offset);
end "+";
function Nibble (N : Unsigned_8) return Unsigned_8 is
begin
return (if N >= 65 then N - 65 + 10 else N - 48);
end Nibble;
function From_Hex (I : Unsigned_16) return Unsigned_8 is
begin
return 16 * Nibble (Line (I)) + Nibble (Line (I + 1));
end From_Hex;
procedure Unlock_Flash is
begin
FLASH_Periph.FCTL3 := (FWKEY => 16#A5#, LOCK => 0, others => 0);
end Unlock_Flash;
procedure Lock_Flash is
begin
FLASH_Periph.FCTL1 := (FWKEY => 16#A5#, Reserved_3_5 => 0, others => 0);
FLASH_Periph.FCTL3 := (FWKEY => 16#A5#, LOCK => 1, others => 0);
end Lock_Flash;
procedure Erase_Segment (Addr : Flash_Memory_Range) is
begin
Unlock_Flash;
FLASH_Periph.FCTL1 := (FWKEY => 16#A5#, Reserved_3_5 => 0, Erase => 1, others => 0);
Flash_Memory (Addr) := 0;
Lock_Flash;
end Erase_Segment;
procedure Erase_Flash is
Addr : Flash_Memory_Range := Flash_Memory_Range (Flash_Start);
R_Low : Unsigned_8 := Flash_Memory (16#FFFE#);
R_High : Unsigned_8 := Flash_Memory (16#FFFF#);
begin
Erase_Segment (16#FFE0#);
while Addr'Valid loop
Erase_Segment (Addr);
Addr := Addr + Flash_Segment_Size;
end loop;
Flash_Memory (16#FFFE#) := R_Low;
Flash_Memory (16#FFFF#) := R_High;
end Erase_Flash;
procedure Write_Flash is
begin
Unlock_Flash;
FLASH_Periph.FCTL1 := (FWKEY => 16#A5#, Reserved_3_5 => 0, WRT => 1, others => 0);
for I in Unsigned_8 range 0 .. Count loop
Flash_Memory (Write_Addr) := From_Hex (Unsigned_16 (I) * 2);
Write_Addr := Write_Addr + Unsigned_16 (1);
end loop;
Lock_Flash;
end Write_Flash;
procedure Reset is
begin
UART.Transmit (XON);
FLASH_Periph.FCTL1 := (FWKEY => 16#00#, Reserved_3_5 => 0, WRT => 0, others => 0);
end Reset;
procedure Read_Line is
Record_Type : Unsigned_8;
begin
UART.Transmit (XON);
for I in Line'Range loop
Line (I) := Unsigned_8 (UART.Receive);
exit when Line (I) = 10;
end loop;
UART.Transmit (XOFF);
Count := From_Hex (1);
Write_Addr := Flash_Memory_Range (Unsigned_16 (From_Hex (3)) * 256 + Unsigned_16 (From_Hex (5)));
Record_Type := From_Hex (7);
case Record_Type is
when 16#00# => Write_Flash;
when 16#01# => Reset;
when 16#80# => Erase_Flash;
when 16#81# => Erase_Segment (Write_Addr);
when others => null;
end case;
end Read_Line;
procedure Init is
CALDCO_8MHz : DCOCTL_Register with Import, Address => System'To_Address (16#10FC#);
CALBC1_8MHz : BCSCTL1_Register with Import, Address => System'To_Address (16#10FD#);
begin
BUTTON.Init;
SYSTEM_CLOCK_Periph.DCOCTL.MOD_k.Val := 0;
SYSTEM_CLOCK_Periph.DCOCTL.DCO.Val := 0;
SYSTEM_CLOCK_Periph.BCSCTL1 := CALBC1_8MHz;
SYSTEM_CLOCK_Periph.DCOCTL := CALDCO_8MHz;
RX.Init;
TX.Init;
UART.Init;
FLASH_Periph.FCTL2 := (FWKEY => 16#A5#, FSSEL => Fssel_1, FN => 20);
end Init;
begin
Init;
UART.Transmit (Character'Pos ('!'));
loop
Read_Line;
end loop;
end Main;
|
-- 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 => 107,
First_Nonterminal => 108,
Last_Nonterminal => 332,
EOI_ID => 107,
Accept_ID => 108,
Case_Insensitive => True,
New_Line_ID => 1,
String_1_ID => 106,
String_2_ID => 105,
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'("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 => 107);
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,
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 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 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;
|
with HWIF; use HWIF;
package Tasks is
task ButtonPressed is
entry Pressed(this : in Direction);
end ButtonPressed;
end Tasks;
|
with Ada.IO_Exceptions;
with Ada.Streams;
private with C.openssl.sha;
package Crypto.SHA1 is
pragma Preelaborate;
subtype Fingerprint is Ada.Streams.Stream_Element_Array (0 .. 19);
subtype Message_Digest is String (1 .. 40);
type Context (<>) is private;
function Initial return Context;
procedure Update (
Context : in out SHA1.Context;
Data : in Ada.Streams.Stream_Element_Array);
procedure Update (Context : in out SHA1.Context; Data : in String);
procedure Final (Context : in out SHA1.Context; Digest : out Fingerprint);
function Value (S : Message_Digest) return Fingerprint;
function Image (Digest : Fingerprint) return Message_Digest;
-- exceptions
Use_Error : exception
renames Ada.IO_Exceptions.Use_Error;
private
type Context is record
SHA : aliased C.openssl.sha.SHA_CTX;
end record;
pragma Suppress_Initialization (Context);
pragma Compile_Time_Error (
Fingerprint'Length /= C.openssl.sha.SHA_DIGEST_LENGTH,
"Fingerprint'Length is mismatch.");
end Crypto.SHA1;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- XML Processor --
-- --
-- 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 package provides implementation of SAX events handler to load XML
-- Catalogs data into internal representation.
------------------------------------------------------------------------------
private with League.Strings;
private with XML.SAX.Attributes;
with XML.SAX.Content_Handlers;
with XML.SAX.Error_Handlers;
with XML.SAX.Lexical_Handlers;
private with XML.SAX.Locators;
private with XML.SAX.Parse_Exceptions;
with Matreshka.XML_Catalogs.Entry_Files;
package Matreshka.XML_Catalogs.Handlers is
type XML_Catalog_Handler is
limited new XML.SAX.Content_Handlers.SAX_Content_Handler
and XML.SAX.Error_Handlers.SAX_Error_Handler
and XML.SAX.Lexical_Handlers.SAX_Lexical_Handler with private;
function Get_Catalog_Entry_File
(Self : XML_Catalog_Handler)
return Matreshka.XML_Catalogs.Entry_Files.Catalog_Entry_File_Access;
procedure Set_Default_Prefer_Mode
(Self : in out XML_Catalog_Handler'Class;
Mode : Matreshka.XML_Catalogs.Entry_Files.Prefer_Mode);
private
type XML_Catalog_Handler is
limited new XML.SAX.Content_Handlers.SAX_Content_Handler
and XML.SAX.Error_Handlers.SAX_Error_Handler
and XML.SAX.Lexical_Handlers.SAX_Lexical_Handler with
record
Default_Prefer_Mode : Matreshka.XML_Catalogs.Entry_Files.Prefer_Mode
:= Matreshka.XML_Catalogs.Entry_Files.Public;
-- Default prefer mode.
Current_Prefer_Mode : Matreshka.XML_Catalogs.Entry_Files.Prefer_Mode;
Previous_Prefer_Mode : Matreshka.XML_Catalogs.Entry_Files.Prefer_Mode;
-- Preference mode can be defined for two grouping elements: "catalog"
-- and "group". Current_Preference_Mode is active preference mode, and
-- Previous_Preference_Mode is used to save preference mode of "catalog"
-- element when "group" element is processed.
Entry_File :
Matreshka.XML_Catalogs.Entry_Files.Catalog_Entry_File_Access;
-- Constructed catalog entry file.
Locator : XML.SAX.Locators.SAX_Locator;
-- Document's locator. It is used to obtain base URI when necessary.
Diagnosis : League.Strings.Universal_String;
-- Error message of the last detected error.
end record;
overriding procedure End_Element
(Self : in out XML_Catalog_Handler;
Namespace_URI : League.Strings.Universal_String;
Local_Name : League.Strings.Universal_String;
Qualified_Name : League.Strings.Universal_String;
Success : in out Boolean);
-- The reader calls this function when it has parsed an end element tag
-- with the qualified name Qualified_Name, the local name Local_Name and
-- the namespace URI Namespace_URI. It is called even when element is
-- empty.
--
-- Namespace_URI and Local_Name is provided only when namespace handling
-- is enabled, otherwise they are an empty strings.
--
-- If this subprogram sets Success to False the reader stops parsing and
-- reports an error. The reader uses the function Error_String to get the
-- error message.
overriding procedure Error
(Self : in out XML_Catalog_Handler;
Occurrence : XML.SAX.Parse_Exceptions.SAX_Parse_Exception;
Success : in out Boolean);
overriding function Error_String
(Self : XML_Catalog_Handler) return League.Strings.Universal_String;
-- The reader calls this function to get an error string, e.g. if any of
-- the handler subprograms sets Success to False.
overriding procedure Fatal_Error
(Self : in out XML_Catalog_Handler;
Occurrence : XML.SAX.Parse_Exceptions.SAX_Parse_Exception);
overriding procedure Set_Document_Locator
(Self : in out XML_Catalog_Handler;
Locator : XML.SAX.Locators.SAX_Locator);
-- The reader calls this subprogram before is starts parsing the document.
-- Argument Locator is object which allows the application to get the
-- parsing position within the document.
--
-- The locator allows the application to determine the end position of any
-- document-related event, even if the parser is not reporting an error.
-- Typically, the application will use this information for reporting its
-- own errors (such as character content that does not match an
-- application's business rules). The information returned by the locator
-- is probably not sufficient for use with a search engine.
--
-- Note that the locator will return correct information only during the
-- invocation SAX event callbacks after Start_Document returns and before
-- End_Document is called. The application should not attempt to use it at
-- any other time.
overriding procedure Start_Document
(Self : in out XML_Catalog_Handler;
Success : in out Boolean);
-- The reader calls this subprogram when it starts parsing the document.
-- The reader calls this subprogram just once, after the call to
-- Set_Document_Locator, and before and other subprogram in this
-- interface or in the SAX_DTD_Handler interface are called.
--
-- If this subprogram sets Success to False the reader stops parsing and
-- reports an error. The reader uses the function Error_String to get the
-- error message.
overriding procedure Start_DTD
(Self : in out XML_Catalog_Handler;
Name : League.Strings.Universal_String;
Public_Id : League.Strings.Universal_String;
System_Id : League.Strings.Universal_String;
Success : in out Boolean);
-- The reader calls this subprogram to report the start of a DTD
-- declaration, if any. It reports the name of the document type in Name,
-- the public identifier in Public_Id and the system identifier in
-- System_Id.
--
-- If the public identifier is missing, Public_Id is set to an empty
-- string. If the system identifier is missing, System_Id is set to an
-- empty string. Note that it is not valid XML to have a public identifier
-- but no system identifier; in such cases a parse error will occur.
--
-- This subprogram is intended to report the beginning of the DOCTYPE
-- declaration; if the document has no DOCTYPE declaration, this subprogram
-- will not be invoked.
--
-- All declarations reported through SAX_DTD_Handler or SAX_Decl_Handler
-- appear between the Start_DTD and End_DTD calls. Declarations belong to
-- the internal DTD subsets unless they appear between Start_Entity and
-- End_Entity calls. Comments and processing instructions from the DTD also
-- are reported between the Start_DTD and End_DTD calls, in their original
-- order of (logical) occurrence; they are not appear in their correct
-- locations relative to others calls of SAX_DTD_Handler or
-- SAX_Decl_Handler, however.
--
-- Note that the Start_DTD/End_DTD calls will appear within the
-- Start_Document/End_Document calls from SAX_Content_Handler and before
-- the first Start_Element event.
--
-- If this subprogram sets Success to False the reader stops parsing and
-- reports an error. The reader uses the function Error_String to get the
-- error message.
overriding procedure Start_Element
(Self : in out XML_Catalog_Handler;
Namespace_URI : League.Strings.Universal_String;
Local_Name : League.Strings.Universal_String;
Qualified_Name : League.Strings.Universal_String;
Attributes : XML.SAX.Attributes.SAX_Attributes;
Success : in out Boolean);
-- The reader calls this subprogram when it has parsed a start element tag.
--
-- There is a corresponding End_Element call when the corresponding and
-- element tag is read. The Start_Element and End_Element calls are always
-- nested correctly. Empty element tags (e.g. <x/>) cause a Start_Element
-- call to be immediately followed by and End_Element call.
--
-- The attribute list provided only contains attributes with explicit
-- values (specified or defaulted): #IMPLIED attributes will be omitted.
-- The attribute list contains attributes used for namespace
-- declaration (i.e. attributes starting with xmlns) only if the
-- http://xml.org/sax/features/namespace-prefixes property of the reader is
-- true.
--
-- The argument Namespace_URI is the namespace URI, or an empty string if
-- the element has no namespace URI or if no namespace processing is done.
-- Local_Name is the local name (without prefix), or an empty string if no
-- namespace processing is done, Qualified_Name is the qualified name (with
-- prefix) and Attributes are the attributes attached to the element. If
-- there are no attributes, Attributes is an empty attributes object.
--
-- If this subprogram sets Success to False the reader stops parsing and
-- reports an error. The reader uses the function Error_String to get the
-- error message.
overriding procedure Warning
(Self : in out XML_Catalog_Handler;
Occurrence : XML.SAX.Parse_Exceptions.SAX_Parse_Exception;
Success : in out Boolean);
end Matreshka.XML_Catalogs.Handlers;
|
-----------------------------------------------------------------------
-- properties -- Generic name/value property management
-- Copyright (C) 2001, 2002, 2003, 2006, 2008, 2009, 2010, 2011, 2012, 2014 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Properties.Factories;
with Ada.Strings.Unbounded.Text_IO;
package body Util.Properties is
use Ada.Text_IO;
use Ada.Strings.Unbounded.Text_IO;
use Interface_P;
procedure Load_Property (Name : out Unbounded_String;
Value : out Unbounded_String;
File : in File_Type;
Prefix : in String := "";
Strip : in Boolean := False);
function Exists (Self : in Manager'Class;
Name : in String) return Boolean is
begin
-- There is not yet an implementation, no property
if Self.Impl = null then
return False;
end if;
return Exists (Self.Impl.all, +Name);
end Exists;
function Exists (Self : in Manager'Class;
Name : in Value) return Boolean is
begin
-- There is not yet an implementation, no property
if Self.Impl = null then
return False;
end if;
return Exists (Self.Impl.all, Name);
end Exists;
function Get (Self : in Manager'Class;
Name : in String) return Value is
begin
if Self.Impl = null then
raise NO_PROPERTY with "No property: '" & Name & "'";
end if;
return Get (Self.Impl.all, +Name);
end Get;
function Get (Self : in Manager'Class;
Name : in Value) return Value is
begin
if Self.Impl = null then
raise NO_PROPERTY with "No property: '" & To_String (Name) & "'";
end if;
return Get (Self.Impl.all, Name);
end Get;
function Get (Self : in Manager'Class;
Name : in String) return String is
begin
if Self.Impl = null then
raise NO_PROPERTY with "No property: '" & Name & "'";
end if;
return -Get (Self.Impl.all, +Name);
end Get;
function Get (Self : in Manager'Class;
Name : in Value) return String is
begin
if Self.Impl = null then
raise NO_PROPERTY;
end if;
return -Get (Self.Impl.all, Name);
end Get;
function Get (Self : in Manager'Class;
Name : in String;
Default : in String) return String is
Prop_Name : constant Value := +Name;
begin
if Exists (Self, Prop_Name) then
return Get (Self, Prop_Name);
else
return Default;
end if;
end Get;
procedure Check_And_Create_Impl (Self : in out Manager) is
begin
if Self.Impl = null then
Util.Properties.Factories.Initialize (Self);
elsif Util.Concurrent.Counters.Value (Self.Impl.Count) > 1 then
declare
Old : Interface_P.Manager_Access := Self.Impl;
Is_Zero : Boolean;
begin
Self.Impl := Create_Copy (Self.Impl.all);
Util.Concurrent.Counters.Increment (Self.Impl.Count);
Util.Concurrent.Counters.Decrement (Old.Count, Is_Zero);
if Is_Zero then
Delete (Old.all, Old);
end if;
end;
end if;
end Check_And_Create_Impl;
procedure Insert (Self : in out Manager'Class;
Name : in String;
Item : in String) is
begin
Check_And_Create_Impl (Self);
Insert (Self.Impl.all, +Name, +Item);
end Insert;
-- ------------------------------
-- Set the value of the property. The property is created if it
-- does not exists.
-- ------------------------------
procedure Set (Self : in out Manager'Class;
Name : in String;
Item : in String) is
begin
Check_And_Create_Impl (Self);
Set (Self.Impl.all, +Name, +Item);
end Set;
-- ------------------------------
-- Set the value of the property. The property is created if it
-- does not exists.
-- ------------------------------
procedure Set (Self : in out Manager'Class;
Name : in String;
Item : in Value) is
begin
Check_And_Create_Impl (Self);
Set (Self.Impl.all, +Name, Item);
end Set;
-- ------------------------------
-- Set the value of the property. The property is created if it
-- does not exists.
-- ------------------------------
procedure Set (Self : in out Manager'Class;
Name : in Unbounded_String;
Item : in Value) is
begin
Check_And_Create_Impl (Self);
Set (Self.Impl.all, Name, Item);
end Set;
-- ------------------------------
-- Remove the property given its name.
-- ------------------------------
procedure Remove (Self : in out Manager'Class;
Name : in String) is
begin
if Self.Impl = null then
raise NO_PROPERTY;
end if;
Check_And_Create_Impl (Self);
Remove (Self.Impl.all, +Name);
end Remove;
-- ------------------------------
-- Remove the property given its name.
-- ------------------------------
procedure Remove (Self : in out Manager'Class;
Name : in Value) is
begin
if Self.Impl = null then
raise NO_PROPERTY;
end if;
Check_And_Create_Impl (Self);
Remove (Self.Impl.all, Name);
end Remove;
-- ------------------------------
-- Iterate over the properties and execute the given procedure passing the
-- property name and its value.
-- ------------------------------
procedure Iterate (Self : in Manager'Class;
Process : access procedure (Name, Item : Value)) is
begin
if Self.Impl /= null then
Self.Impl.Iterate (Process);
end if;
end Iterate;
-- ------------------------------
-- Return the name of the properties defined in the manager.
-- When a prefix is specified, only the properties starting with
-- the prefix are returned.
-- ------------------------------
function Get_Names (Self : in Manager;
Prefix : in String := "") return Name_Array is
begin
if Self.Impl = null then
declare
Empty : Name_Array (1 .. 0);
begin
return Empty;
end;
else
return Get_Names (Self.Impl.all, Prefix);
end if;
end Get_Names;
procedure Adjust (Object : in out Manager) is
begin
if Object.Impl /= null then
Util.Concurrent.Counters.Increment (Object.Impl.Count);
end if;
end Adjust;
procedure Finalize (Object : in out Manager) is
Is_Zero : Boolean;
begin
if Object.Impl /= null then
Util.Concurrent.Counters.Decrement (Object.Impl.Count, Is_Zero);
if Is_Zero then
Delete (Object.Impl.all, Object.Impl);
end if;
end if;
end Finalize;
procedure Set_Property_Implementation (Self : in out Manager;
Impl : in Interface_P.Manager_Access) is
begin
if Self.Impl = null then
Self.Impl := Impl;
-- Self.Impl.Count := 1;
end if;
end Set_Property_Implementation;
procedure Load_Property (Name : out Unbounded_String;
Value : out Unbounded_String;
File : in File_Type;
Prefix : in String := "";
Strip : in Boolean := False) is
pragma Unreferenced (Strip);
Line : Unbounded_String;
Pos : Natural;
Len : Natural;
begin
while not End_Of_File (File) loop
Line := Get_Line (File);
Len := Length (Line);
if Len /= 0 and then Element (Line, 1) /= '#' then
Pos := Index (Line, "=");
if Pos > 0 and then Prefix'Length > 0 and then Index (Line, Prefix) = 1 then
Name := Unbounded_Slice (Line, Prefix'Length + 1, Pos - 1);
Value := Tail (Line, Len - Pos);
return;
elsif Pos > 0 and Prefix'Length = 0 then
Name := Head (Line, Pos - 1);
Value := Tail (Line, Len - Pos);
return;
end if;
end if;
end loop;
Name := Null_Unbounded_String;
Value := Null_Unbounded_String;
end Load_Property;
procedure Load_Properties (Self : in out Manager'Class;
File : in File_Type;
Prefix : in String := "";
Strip : in Boolean := False) is
Name, Value : Unbounded_String;
begin
loop
Load_Property (Name, Value, File, Prefix, Strip);
exit when Name = Null_Unbounded_String;
Set (Self, Name, Value);
end loop;
exception
when End_Error =>
return;
end Load_Properties;
procedure Load_Properties (Self : in out Manager'Class;
Path : in String;
Prefix : in String := "";
Strip : in Boolean := False) is
F : File_Type;
begin
Open (F, In_File, Path);
Load_Properties (Self, F, Prefix, Strip);
Close (F);
end Load_Properties;
-- ------------------------------
-- Copy the properties from FROM which start with a given prefix.
-- If the prefix is empty, all properties are copied. When <b>Strip</b> is True,
-- the prefix part is removed from the property name.
-- ------------------------------
procedure Copy (Self : in out Manager'Class;
From : in Manager'Class;
Prefix : in String := "";
Strip : in Boolean := False) is
Names : constant Name_Array := From.Get_Names;
begin
for I in Names'Range loop
declare
Name : Unbounded_String renames Names (I);
begin
if Prefix'Length = 0 or else Index (Name, Prefix) = 1 then
if Strip and Prefix'Length > 0 then
declare
S : constant String := Slice (Name, Prefix'Length + 1, Length (Name));
begin
Self.Set (+(S), From.Get (Name));
end;
else
Self.Set (Name, From.Get (Name));
end if;
end if;
end;
end loop;
end Copy;
end Util.Properties;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- G N A T . C P P _ E X C E P T I O N S --
-- --
-- B o d y --
-- --
-- Copyright (C) 2013-2019, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System;
with System.Storage_Elements;
with Interfaces.C; use Interfaces.C;
with Ada.Unchecked_Conversion;
with System.Standard_Library; use System.Standard_Library;
package body GNAT.CPP_Exceptions is
-- Note: all functions prefixed by __cxa are part of the c++ ABI for
-- exception handling. As they are provided by the c++ library, there
-- must be no dependencies on it in the compiled code of this unit, but
-- there can be dependencies in instances. This is required to be able
-- to build the shared library without the c++ library.
function To_Exception_Data_Ptr is new
Ada.Unchecked_Conversion
(Exception_Id, Exception_Data_Ptr);
-- Convert an Exception_Id to its non-private type. This is used to get
-- the RTTI of a C++ exception
function Get_Exception_Machine_Occurrence
(X : Exception_Occurrence) return System.Address;
pragma Import (Ada, Get_Exception_Machine_Occurrence,
"__gnat_get_exception_machine_occurrence");
-- Imported function (from Ada.Exceptions) that returns the machine
-- occurrence from an exception occurrence.
-------------------------
-- Raise_Cpp_Exception --
-------------------------
procedure Raise_Cpp_Exception (Id : Exception_Id; Value : T)
is
Id_Data : constant Exception_Data_Ptr := To_Exception_Data_Ptr (Id);
-- Get a non-private view on the exception
type T_Acc is access all T;
pragma Convention (C, T_Acc);
-- Access type to the object compatible with C
Occ : T_Acc;
-- The occurrence to propagate
function cxa_allocate_exception (Size : size_t) return T_Acc;
pragma Import (C, cxa_allocate_exception, "__cxa_allocate_exception");
-- The C++ function to allocate an occurrence
procedure cxa_throw (Obj : T_Acc; Tinfo : System.Address;
Dest : System.Address);
pragma Import (C, cxa_throw, "__cxa_throw");
pragma No_Return (cxa_throw);
-- The C++ function to raise an exception
begin
-- Check the exception was imported from C++
if Id_Data.Lang /= 'C' then
raise Constraint_Error;
end if;
-- Allocate the C++ occurrence
Occ := cxa_allocate_exception (T'Size / System.Storage_Unit);
-- Set the object
Occ.all := Value;
-- Throw the exception
cxa_throw (Occ, Id_Data.Foreign_Data, System.Null_Address);
end Raise_Cpp_Exception;
----------------
-- Get_Object --
----------------
function Get_Object (X : Exception_Occurrence) return T
is
use System;
use System.Storage_Elements;
Unwind_Exception_Size : Natural;
pragma Import (C, Unwind_Exception_Size, "__gnat_unwind_exception_size");
-- Size in bytes of _Unwind_Exception
Exception_Addr : constant Address :=
Get_Exception_Machine_Occurrence (X);
-- Machine occurrence of X
begin
-- Check the machine occurrence exists
if Exception_Addr = Null_Address then
raise Constraint_Error;
end if;
declare
-- Import the object from the occurrence
Result : T;
pragma Import (Ada, Result);
for Result'Address use
Exception_Addr + Storage_Offset (Unwind_Exception_Size);
begin
-- And return it
return Result;
end;
end Get_Object;
end GNAT.CPP_Exceptions;
|
type Five is range 0..4;
|
-- Copyright (C) 2020 Glen Cornell <glen.m.cornell@gmail.com>
--
-- 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 Aof.Core.Generic_Properties is
function Get (This : in Property'Class) return T is
begin
return This.Value;
end;
procedure Set (This : in out Property'Class;
Value : in T) is
begin
This.Value := Value;
This.On_Change_Signal.Emit(This.Value);
end;
procedure Connect (This : in out Property'Class;
Proc : in Signals_Pkg.Access_Procedure) is
begin
This.On_Change_Signal.Connect(Proc);
end;
procedure Notify (This : in out Property'Class) is
begin
This.On_Change_Signal.Emit(This.Value);
end;
end Aof.Core.Generic_Properties;
|
---------------------------------------------------------------------------
-- package body QR_Symmetric_Eigen, QR based eigen-decomposition
-- Copyright (C) 2018 Jonathan S. Parker
--
-- Permission to use, copy, modify, and/or distribute this software for any
-- purpose with or without fee is hereby granted, provided that the above
-- copyright notice and this permission notice appear in all copies.
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
-- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
-- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
-- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
---------------------------------------------------------------------------
with Ada.numerics.Generic_Elementary_Functions;
with Tridiagonal;
with Hypot;
package body QR_Symmetric_Eigen is
package Maths is new Ada.numerics.Generic_Elementary_Functions(Real); use Maths;
package Hypo is new Hypot (Real);
package Tridi is new Tridiagonal (Real, Index, Matrix);
Zero : constant Real := +0.0;
One : constant Real := +1.0;
Two : constant Real := +2.0;
--
-- Matrix
--
-- |a b|
-- |b c|
--
-- has eigenvals x satisfying:
--
-- x^2 - (a + c) * x + a*c - b*b = 0
-- x^2 - (a + c) * x + a_0 = 0
--
-- Solution (x) is always real:
--
-- x = (a + c)/2 +/- Sqrt (((a + c)/2)^2 - a_0)
-- x = (a + c)/2 +/- Sqrt (((a - c)/2)^2 + b*b)
--
-- Let y = x - c, and Beta = (a - c)/2. Then
--
-- y = (a - c)/2 +/- Sqrt (((a - c)/2)^2 + b*b)
-- y = Beta +/- Sqrt (Beta^2 + b*b)
--
-- General Soln:
--
-- Eig_Val - c = y = Beta * (1 +/- Sgn(Beta) * Sqrt (Beta^2 + b*b))
--
-- Use
--
-- Sqrt (Beta^2 + b*b) - 1 = b^2 / (Beta^2 + |Beta| * Sqrt (Beta^2 + b*b))
--
-- and
--
-- 1 + Sqrt (Beta^2 + b*b) = 2 + (Sqrt (Beta^2 + b*b) - 1)
--
-- to get
--
-- Eig_1 = a + Sgn(Beta) * b^2 / (|Beta| + Sqrt (Beta^2 + b*b))
-- Eig_2 = c - Sgn(Beta) * b^2 / (|Beta| + Sqrt (Beta^2 + b*b))
--
--
procedure Quadratic_Eigs
(a, b, c : in Real;
Eig_Val_1 : out Real;
Eig_Val_2 : out Real)
is
Beta : constant Real := 0.5 * (a - c);
begin
if b = Zero then
Eig_Val_1 := a;
Eig_Val_2 := c;
return;
end if;
if Beta = Zero then -- a = c
Eig_Val_1 := a + Abs b;
Eig_Val_2 := c - Abs b;
return;
end if;
-- Hypot = Sqrt (Beta^2 + b^2);
declare
Hypot : constant Real := Hypo.Hypotenuse (b, Beta);
Shift : Real := b * (b / (Hypot + Abs Beta));
begin
Shift := Real'Copy_Sign (Shift, Beta);
Eig_Val_1 := a + Shift;
Eig_Val_2 := c - Shift;
end;
-- -- test using: x^2 - (a + c) * x + a_0 = 0
--
-- declare
-- x, tst : Real;
-- Min_R : Real := Min_Allowed_Real;
-- a_0 : constant Real := a*c - b*b;
-- begin
-- x := Eig_Val_1;
-- tst := ((x - a)*(x - c) - b*b) / (x*x + b*b + Abs a_0 + Min_R);
-- if Abs tst > Real'Epsilon * 16.0 then
-- new_line; put(Real'Image(tst)); new_line;
-- null;
-- end if;
-- x := Eig_Val_2;
-- tst := ((x - a)*(x - c) - b*b) / (x*x + b*b + Abs a_0 + Min_R);
-- if Abs tst > Real'Epsilon * 16.0 then
-- new_line; put(Real'Image(tst)); new_line;
-- null;
-- end if;
-- end;
end Quadratic_Eigs;
procedure Swap (A, B : in out Real) is
tmp : constant Real := A;
begin
A := B; B := tmp;
end Swap;
---------------
-- Sort_Eigs --
---------------
procedure Sort_Eigs
(Eigenvals : in out Col_Vector;
Q : in out Matrix; -- Columns are the eigvectors
Start_Col : in Index := Index'First;
Final_Col : in Index := Index'Last;
Sort_Eigvecs_Also : in Boolean := False)
is
Max_Eig : Real;
Max_id : Index;
begin
if Start_Col < Final_Col then
for i in Start_Col .. Final_Col-1 loop
Max_Eig := Eigenvals(i); Max_id := i;
for j in i+1 .. Final_Col loop
if Eigenvals(j) > Max_Eig then
Max_Eig := Eigenvals(j); Max_id := j;
end if;
end loop;
-- swap i with Max_id:
Swap (Eigenvals(i), Eigenvals(Max_id));
if Sort_Eigvecs_Also then
for r in Start_Col .. Final_Col loop
Swap (Q(r, i), Q(r, Max_id));
end loop;
end if;
end loop;
end if;
end Sort_Eigs;
----------
-- Norm --
----------
function Norm
(Q : in Col_Vector;
Starting_Col : in Index := Index'First;
Final_Col : in Index := Index'Last)
return Real
is
Max : Real := Zero;
Sum, tst : Real := Zero;
Scale_Factor : Real := One;
Scaled : Boolean := False;
Scale_Exp : Integer;
Max_Exp : constant Integer := Real'Machine_Emax - 8;
Sqrt_Max_Allowed_Real : constant Real := Two**(Max_Exp / 2);
Min_Exp : constant Integer := Real'Machine_Emin + 8;
Sqrt_Min_Allowed_Real : constant Real := Two**(Min_Exp / 2);
begin
for i in Starting_Col .. Final_Col loop
tst := Abs (Q(i));
if tst > Max then Max := tst; end if;
end loop;
if Max > Sqrt_Max_Allowed_Real then
Scale_Exp := Integer'Min (Real'Exponent (Max), Real'Machine_Emax-4);
Scale_Factor := Two**(-Scale_Exp);
Scaled := True;
end if;
if Max < Sqrt_Min_Allowed_Real then
Scale_Exp := Integer'Max (Real'Exponent (Max), Real'Machine_Emin+4);
Scale_Factor := Two**(-Scale_Exp);
Scaled := True;
end if;
if Scaled then
for k in Starting_Col .. Final_Col loop
Sum := Sum + (Scale_Factor * Q(k))**2;
end loop;
else
for k in Starting_Col .. Final_Col loop
Sum := Sum + Q(k)**2;
end loop;
end if;
if Scaled then
return Sqrt (Abs Sum) * Two**Scale_Exp;
else
return Sqrt (Abs Sum);
end if;
end Norm;
---------------------
-- Eigen_Decompose --
---------------------
procedure Eigen_Decompose
(A : in out Matrix;
Q : out Matrix;
Eigenvals : out Col_Vector;
Start_Col : in Index := Index'First;
Final_Col : in Index := Index'Last;
Eigenvectors_Desired : in Boolean := False)
is
Shift, e1, e2 : Real;
N : constant Integer := Integer (Final_Col) - Integer (Start_Col) + 1;
Min_Exp : constant Integer := Real'Machine_Emin;
Min_Allowed_Real : constant Real := 2.0 ** (Min_Exp - Min_Exp/32);
begin
-- Q starts as Identity; is rotated into set of Eigenvectors of A.
Q := (others => (others => Zero));
for j in Index loop
Q(j,j) := One;
end loop;
Eigenvals := (others => Zero);
-- A_tridiag = Q_tr * A_true * Q.
--
-- A_true = Q * A_tridiag * Q_tr
Tridi.Tridiagonalize
(A => A, -- A = A_true is replaced with: A_tridiag
Q => Q, -- A_true = Q * A_tridiag * Q_tr
Starting_Col => Start_Col,
Final_Col => Final_Col,
Initial_Q => Q,
Q_Matrix_Desired => Eigenvectors_Desired);
-- A is now in Upper_Hessenberg form, thanks to Q:
--
-- A_true = Q A Q' = Q A_tridiag Q'
--
-- Procedure Upper_Hessenberg initialized "out" parameter Q as the new Z_r.
--
for i in reverse Start_Col+1 .. Final_Col loop
Iterate: for iter_id in 0 .. 30 + N / 4 loop -- 15 iters is very rare
if Abs A(i,i-1) < Min_Allowed_Real then
A(i,i-1) := Zero; A(i-1,i) := Zero;
end if;
--if Abs A(i,i-1) = Zero then
-- text_io.put(integer'image(iter_id)); exit;
--end if;
exit Iterate when Abs A(i,i-1) = Zero;
Quadratic_Eigs
(a => A(i-1,i-1),
b => A(i,i-1),
c => A(i,i),
Eig_Val_1 => e1,
Eig_Val_2 => e2);
if Abs(e2-A(i,i))<Abs(e1-A(i,i)) then Shift:=e2; else Shift:=e1; end if;
Tridi.Lower_Diagonal_QR_Iteration
(A => A,
Q => Q,
Shift => Shift,
--Final_Shift_Col => Final_Col,
Final_Shift_Col => i, -- short cut, hardly matters
Starting_Col => Start_Col,
Final_Col => Final_Col,
Q_Matrix_Desired => Eigenvectors_Desired);
end loop iterate;
end loop;
-- Eigenvectors of A are returned as the Columns of matrix Q.
--
-- so Q_tr * A * Q = D = Diagonal_Eigs
--
-- so Q * D * Q_tr = A = Original Matrix
for i in Index range Start_Col .. Final_Col loop
Eigenvals(i) := A(i,i);
end loop;
end Eigen_Decompose;
end QR_Symmetric_Eigen;
|
with AUnit;
with AUnit.Test_Cases;
package Day.Test is
type Test is new AUnit.Test_Cases.Test_Case with null record;
function Name (T : Test) return AUnit.Message_String;
procedure Register_Tests (T : in out Test);
-- Test routines
procedure Test_Part1 (T : in out AUnit.Test_Cases.Test_Case'Class);
procedure Test_Part2 (T : in out AUnit.Test_Cases.Test_Case'Class);
end Day.Test;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2014, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with Matreshka.Internals.Unicode.Ucd;
package Matreshka.CLDR.Collation_Data is
type Code_Point_Array is
array (Positive range <>) of Matreshka.Internals.Unicode.Code_Point;
type Code_Point_Array_Access is access all Code_Point_Array;
type Collation_Element is record
Is_Variable : Boolean;
Primary : Matreshka.Internals.Unicode.Ucd.Collation_Weight;
Secondary : Matreshka.Internals.Unicode.Ucd.Collation_Weight;
Trinary : Matreshka.Internals.Unicode.Ucd.Collation_Weight;
Code : Matreshka.Internals.Unicode.Code_Point;
end record;
type Collation_Element_Array is
array (Positive range <>) of Collation_Element;
type Collation_Element_Array_Access is access all Collation_Element_Array;
type Collation_Record;
type Collation_Record_Access is access Collation_Record;
type Collation_Record is record
Contractors : Code_Point_Array_Access;
Collations : Collation_Element_Array_Access;
Less_Or_Equal : Collation_Record_Access;
Greater_Or_Equal : Collation_Record_Access;
-- 'previous' and 'next' collation record in collation order.
Next : Collation_Record_Access;
-- Next collation record which starts from the same code point.
end record;
type Code_Point_Collations is
array (Matreshka.Internals.Unicode.Code_Point) of Collation_Record_Access;
type Collation_Information is record
Collations : Code_Point_Collations;
Lower_Record : Collation_Record_Access;
Greater_Record : Collation_Record_Access;
end record;
type Collation_Information_Access is access all Collation_Information;
type Collation_Operator is
(Identically,
Primary,
Secondary,
Trinary);
procedure Suppress_Contractions
(Data : in out Collation_Information;
Code : Matreshka.Internals.Unicode.Code_Point);
-- Turns off any existing contractions that begin with given character, as
-- well as any prefixes for given character.
procedure Reorder
(Data : in out Collation_Information;
Reset_Code : Matreshka.Internals.Unicode.Code_Point;
Operator : Collation_Operator;
Relation_Code : Matreshka.Internals.Unicode.Code_Point);
end Matreshka.CLDR.Collation_Data;
|
-- Copyright 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 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with Pck; use Pck;
procedure Foo is
type Multi is array (1 .. 1, 2 .. 3, 4 .. 6) of Integer;
M : Multi := (others => (others => (others => 0)));
-- Use a fake type for importing our C multi-dimensional array.
-- It's only to make sure the C unit gets linked in, regardless
-- of possible optimizations.
type Void_Star is access integer;
E : Void_Star;
pragma Import (C, E, "global_3dim_for_gdb_testing");
begin
Do_Nothing (M'Address); -- STOP
Do_Nothing (E'Address);
end Foo;
|
with Interfaces;
use Interfaces;
package STM32.F4.USART is
pragma Pure;
type Status_Register is record
PE: Boolean; -- Psrity error
FE: Boolean; -- Framing error
NF: Boolean; -- Noise detection flag
ORE: Boolean; -- Overrun error
IDLE: Boolean; -- IDLE line detected
RXNE: Boolean; -- Read data register not empty
TC: Boolean; -- Transmission complete
TXE: Boolean; -- Transmit data register empty
LBD: Boolean; -- LIN break detection flag
CTS: Boolean; -- CTS flag
Reserved: Integer range 0 .. 2**22 - 1;
end record with Size => 32;
for Status_Register use record
PE at 0 range 0 .. 0;
FE at 0 range 1 .. 1;
NF at 0 range 2 .. 2;
ORE at 0 range 3 .. 3;
IDLE at 0 range 4 .. 4;
RXNE at 0 range 5 .. 5;
TC at 0 range 6 .. 6;
TXE at 0 range 7 .. 7;
LBD at 0 range 8 .. 8;
CTS at 0 range 9 .. 9;
Reserved at 0 range 10 .. 31;
end record;
type Baud_Rate_Register is record
DIV_Fraction: Integer range 0 .. 2**4 - 1; -- Fraction of USARTDIV
DIV_Mantissa: Integer range 0 .. 2**12 - 1; -- Mantissa of USARTDIV
Reserved: Integer range 0 .. 2**16 - 1;
end record with Size => 32;
for Baud_Rate_Register use record
DIV_Fraction at 0 range 0 .. 3;
DIV_Mantissa at 0 range 4 .. 15;
Reserved at 0 range 16 .. 31;
end record;
-- Parity selection bit field
type Parity is (
Even_Parity, -- Parity bit is cleared when even number of data bits is set, set otherwise
Odd_Parity -- Parity bit is set when even number of data bits is set, cleared otherwise
);
for Parity use (
Even_Parity => 2#0#,
Odd_Parity => 2#1#
);
-- Wakeup method field
type Wakeup_Method is (
Idle_Line, -- Wakeup on IDLE line detect
Address_Mark -- Wakeup on address mark detect
);
for Wakeup_Method use (
Idle_Line => 2#0#,
Address_Mark => 2#1#
);
-- Data word length
type Word_Length is (
Word_8_Bits, -- Data word (with parity bit if enabled) consists of 8 bits
Word_9_Bits -- Data word (with parity bit if enabled) consists of 9 bits
);
for Word_Length use (
Word_8_Bits => 2#0#,
Word_9_Bits => 2#1#
);
type Control_Register_1 is record
SBK: Boolean; -- Send break
RWU: Boolean; -- Receiver wakeup
RE: Boolean; -- Receiver enable
TE: Boolean; -- Trnsmitter enable
IDLEIE: Boolean; -- IDLE interrupt enable
RXNEIE: Boolean; -- RXNE interrupt enable
TCIE: Boolean; -- Transmission complete interrupt enable
TXEIE: Boolean; -- TXE interrupt enable
PEIE: Boolean; -- PE interrupt enable
PS: Parity; -- Parity selection
PCE: Boolean; -- Parity control enable
WAKE: Wakeup_Method; -- Wakeup method
M: Word_Length; -- Word length
UE: Boolean; -- USART enable
Reserved_14: Integer range 0 .. 2**1 - 1;
OVER8: Boolean; -- Oversampling mode
Reserved: Integer range 0 .. 2**16 - 1;
end record with Size => 32;
for Control_Register_1 use record
SBK at 0 range 0 .. 0;
RWU at 0 range 1 .. 1;
RE at 0 range 2 .. 2;
TE at 0 range 3 .. 3;
IDLEIE at 0 range 4 .. 4;
RXNEIE at 0 range 5 .. 5;
TCIE at 0 range 6 .. 6;
TXEIE at 0 range 7 .. 7;
PEIE at 0 range 8 .. 8;
PS at 0 range 9 .. 9;
PCE at 0 range 10 .. 10;
WAKE at 0 range 11 .. 11;
M at 0 range 12 .. 12;
UE at 0 range 13 .. 13;
Reserved_14 at 0 range 14 .. 14;
OVER8 at 0 range 15 .. 15;
Reserved at 0 range 16 .. 31;
end record;
-- Line break detection length
type Lin_Break_Detection_Length is (
Lin_10_Bit_Break_Detection, -- 10 bits break is detected
Lin_11_Bit_Break_Detection -- 11 bits break is detected
);
for Lin_Break_Detection_Length use (
LIN_10_Bit_Break_Detection => 2#0#,
LIN_11_Bit_Break_Detection => 2#1#
);
type Clock_Phase is (
First_Edge_Capture, -- Data captured on first clock edge
Second_Edge_Capture -- Deta set on first clock edge, captured on second edge
);
for Clock_Phase use (
First_Edge_Capture => 2#0#,
Second_Edge_Capture => 2#1#
);
type Clock_Polarity is (
Positive_Pulse, -- Steady low value on CK outside transmission window
Negative_Pulse -- Steady high value on CK outside transmission window
);
for Clock_Polarity use (
Positive_Pulse => 2#0#,
Negative_Pulse => 2#1#
);
-- Number of stop bits
type Stop_Bit_Count is(
Stop_1_Bit, -- 1 stop bit
Stop_0_5_Bits, -- 0.5 stop bits
Stop_2_Bits, -- 2 stop bits
Stop_1_5_Bits -- 1.5 stop bits
);
for Stop_Bit_Count use (
Stop_1_Bit => 2#00#,
Stop_0_5_Bits => 2#01#,
Stop_2_Bits => 2#10#,
Stop_1_5_Bits => 2#11#
);
type Control_Register_2 is record
ADD: Integer range 0 .. 2**4 - 1; -- Address of the USART node
Reserved_4: Integer range 0 .. 1;
LBDL: LIN_Break_Detection_Length; -- LIN break detection length selection
LBDIE: Boolean; -- LIN break detection interrupt enable
Reserved_7: Integer range 0 .. 1;
LBCL: Boolean; -- Last bit clock pulse output (this bit is not available for UART4 and UART5)
CPHA: Clock_Phase; -- Clock phase
CPOL: Clock_Polarity; -- Clock polarity
CLKEN: Boolean; -- Clock enable
STOP: Stop_Bit_Count; -- STOP bits
LINEN: Boolean; -- LIN mode enable
Reserved: Integer range 0 .. 2**17 - 1;
end record with Size => 32;
for Control_Register_2 use record
ADD at 0 range 0 .. 3;
Reserved_4 at 0 range 4 .. 4;
LBDL at 0 range 5 .. 5;
LBDIE at 0 range 6 .. 6;
Reserved_7 at 0 range 7 .. 7;
LBCL at 0 range 8 .. 8;
CPHA at 0 range 9 .. 9;
CPOL at 0 range 10 .. 10;
CLKEN at 0 range 11 .. 11;
STOP at 0 range 12 .. 13;
LINEN at 0 range 14 .. 14;
Reserved at 0 range 15 .. 31;
end record;
type Control_Register_3 is record
EIE: Boolean; -- Error interrupt enable
IREN: Boolean; -- IrDA mode enable
IRLP: Boolean; -- IrDA low power
HDSEL: Boolean; -- Half duplex selection
NACK: Boolean; -- Smartcard NACK enable
SCEN: Boolean; -- Smartcard mode enable
DMAR: Boolean; -- DMA enable receiver
DMAT: Boolean; -- DMA enable transmitter
RTSE: Boolean; -- RTS enable
CTSE: Boolean; -- CTS enable
CTSIE: Boolean; -- CTS interrupt enable
ONEBIT: Boolean; -- One bit sampling enable
Reserved: Integer range 0 .. 2 ** 20 - 1;
end record with Size => 32;
for Control_Register_3 use record
EIE at 0 range 0 .. 0;
IREN at 0 range 1 .. 1;
IRLP at 0 range 2 .. 2;
HDSEL at 0 range 3 .. 3;
NACK at 0 range 4 .. 4;
SCEN at 0 range 5 .. 5;
DMAR at 0 range 6 .. 6;
DMAT at 0 range 7 .. 7;
RTSE at 0 range 8 .. 8;
CTSE at 0 range 9 .. 9;
CTSIE at 0 range 10 .. 10;
ONEBIT at 0 range 11 .. 11;
Reserved at 0 range 12 .. 31;
end record;
type Guard_Time_and_Prescaler_Register is record
PSC: Integer range 0 .. 2**8 - 1; -- Prescaler value
GT: Integer range 0 .. 2**8 - 1; -- Guard time value in baud clocks
Reserved: Integer range 0 .. 2**16 - 1;
end record with Size => 32;
for Guard_Time_and_Prescaler_Register use record
PSC at 0 range 0 .. 7;
GT at 0 range 8 .. 15;
Reserved at 0 range 16 .. 31;
end record;
type USART_Registers is record
SR: Status_Register; -- Status register
DR: Unsigned_32; -- Data register
BRR: Baud_Rate_Register; -- Baud rate register
CR1: Control_Register_1; -- Control register 1
CR2: Control_Register_2; -- Control register 2
CR3: Control_Register_3; -- Control register 3
GTPR: Guard_Time_and_Prescaler_Register; -- Guard time and prescaler register
end record with Volatile;
for USART_Registers use record
SR at 16#00# range 0 .. 31;
DR at 16#04# range 0 .. 31;
BRR at 16#08# range 0 .. 31;
CR1 at 16#0C# range 0 .. 31;
CR2 at 16#10# range 0 .. 31;
CR3 at 16#14# range 0 .. 31;
GTPR at 16#18# range 0 .. 31;
end record;
end STM32.F4.USART;
|
-- SPDX-FileCopyrightText: 2019 Max Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
package body Program.Nodes.Digits_Constraints is
function Create
(Digits_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Digits_Expression : not null Program.Elements.Expressions
.Expression_Access;
Range_Token : Program.Lexical_Elements.Lexical_Element_Access;
Real_Range_Constraint : Program.Elements.Constraints.Constraint_Access)
return Digits_Constraint is
begin
return Result : Digits_Constraint :=
(Digits_Token => Digits_Token, Digits_Expression => Digits_Expression,
Range_Token => Range_Token,
Real_Range_Constraint => Real_Range_Constraint,
Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
function Create
(Digits_Expression : not null Program.Elements.Expressions
.Expression_Access;
Real_Range_Constraint : Program.Elements.Constraints.Constraint_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_Digits_Constraint is
begin
return Result : Implicit_Digits_Constraint :=
(Digits_Expression => Digits_Expression,
Real_Range_Constraint => Real_Range_Constraint,
Is_Part_Of_Implicit => Is_Part_Of_Implicit,
Is_Part_Of_Inherited => Is_Part_Of_Inherited,
Is_Part_Of_Instance => Is_Part_Of_Instance, Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
overriding function Digits_Expression
(Self : Base_Digits_Constraint)
return not null Program.Elements.Expressions.Expression_Access is
begin
return Self.Digits_Expression;
end Digits_Expression;
overriding function Real_Range_Constraint
(Self : Base_Digits_Constraint)
return Program.Elements.Constraints.Constraint_Access is
begin
return Self.Real_Range_Constraint;
end Real_Range_Constraint;
overriding function Digits_Token
(Self : Digits_Constraint)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Digits_Token;
end Digits_Token;
overriding function Range_Token
(Self : Digits_Constraint)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Range_Token;
end Range_Token;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Digits_Constraint)
return Boolean is
begin
return Self.Is_Part_Of_Implicit;
end Is_Part_Of_Implicit;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Digits_Constraint)
return Boolean is
begin
return Self.Is_Part_Of_Inherited;
end Is_Part_Of_Inherited;
overriding function Is_Part_Of_Instance
(Self : Implicit_Digits_Constraint)
return Boolean is
begin
return Self.Is_Part_Of_Instance;
end Is_Part_Of_Instance;
procedure Initialize (Self : in out Base_Digits_Constraint'Class) is
begin
Set_Enclosing_Element (Self.Digits_Expression, Self'Unchecked_Access);
if Self.Real_Range_Constraint.Assigned then
Set_Enclosing_Element
(Self.Real_Range_Constraint, Self'Unchecked_Access);
end if;
null;
end Initialize;
overriding function Is_Digits_Constraint
(Self : Base_Digits_Constraint)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Digits_Constraint;
overriding function Is_Constraint
(Self : Base_Digits_Constraint)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Constraint;
overriding function Is_Definition
(Self : Base_Digits_Constraint)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Definition;
overriding procedure Visit
(Self : not null access Base_Digits_Constraint;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class) is
begin
Visitor.Digits_Constraint (Self);
end Visit;
overriding function To_Digits_Constraint_Text
(Self : in out Digits_Constraint)
return Program.Elements.Digits_Constraints
.Digits_Constraint_Text_Access is
begin
return Self'Unchecked_Access;
end To_Digits_Constraint_Text;
overriding function To_Digits_Constraint_Text
(Self : in out Implicit_Digits_Constraint)
return Program.Elements.Digits_Constraints
.Digits_Constraint_Text_Access is
pragma Unreferenced (Self);
begin
return null;
end To_Digits_Constraint_Text;
end Program.Nodes.Digits_Constraints;
|
-- This spec has been automatically generated from STM32F429x.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
with HAL;
with System;
package STM32_SVD.DMA2D is
pragma Preelaborate;
---------------
-- Registers --
---------------
-----------------
-- CR_Register --
-----------------
subtype CR_MODE_Field is HAL.UInt2;
-- control register
type CR_Register is record
-- Start
START : Boolean := False;
-- Suspend
SUSP : Boolean := False;
-- Abort
ABORT_k : Boolean := False;
-- unspecified
Reserved_3_7 : HAL.UInt5 := 16#0#;
-- Transfer error interrupt enable
TEIE : Boolean := False;
-- Transfer complete interrupt enable
TCIE : Boolean := False;
-- Transfer watermark interrupt enable
TWIE : Boolean := False;
-- CLUT access error interrupt enable
CAEIE : Boolean := False;
-- CLUT transfer complete interrupt enable
CTCIE : Boolean := False;
-- Configuration Error Interrupt Enable
CEIE : Boolean := False;
-- unspecified
Reserved_14_15 : HAL.UInt2 := 16#0#;
-- DMA2D mode
MODE : CR_MODE_Field := 16#0#;
-- unspecified
Reserved_18_31 : HAL.UInt14 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR_Register use record
START at 0 range 0 .. 0;
SUSP at 0 range 1 .. 1;
ABORT_k at 0 range 2 .. 2;
Reserved_3_7 at 0 range 3 .. 7;
TEIE at 0 range 8 .. 8;
TCIE at 0 range 9 .. 9;
TWIE at 0 range 10 .. 10;
CAEIE at 0 range 11 .. 11;
CTCIE at 0 range 12 .. 12;
CEIE at 0 range 13 .. 13;
Reserved_14_15 at 0 range 14 .. 15;
MODE at 0 range 16 .. 17;
Reserved_18_31 at 0 range 18 .. 31;
end record;
------------------
-- ISR_Register --
------------------
-- Interrupt Status Register
type ISR_Register is record
-- Read-only. Transfer error interrupt flag
TEIF : Boolean;
-- Read-only. Transfer complete interrupt flag
TCIF : Boolean;
-- Read-only. Transfer watermark interrupt flag
TWIF : Boolean;
-- Read-only. CLUT access error interrupt flag
CAEIF : Boolean;
-- Read-only. CLUT transfer complete interrupt flag
CTCIF : Boolean;
-- Read-only. Configuration error interrupt flag
CEIF : Boolean;
-- unspecified
Reserved_6_31 : HAL.UInt26;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ISR_Register use record
TEIF at 0 range 0 .. 0;
TCIF at 0 range 1 .. 1;
TWIF at 0 range 2 .. 2;
CAEIF at 0 range 3 .. 3;
CTCIF at 0 range 4 .. 4;
CEIF at 0 range 5 .. 5;
Reserved_6_31 at 0 range 6 .. 31;
end record;
-------------------
-- IFCR_Register --
-------------------
-- interrupt flag clear register
type IFCR_Register is record
-- Clear Transfer error interrupt flag
CTEIF : Boolean := False;
-- Clear transfer complete interrupt flag
CTCIF : Boolean := False;
-- Clear transfer watermark interrupt flag
CTWIF : Boolean := False;
-- Clear CLUT access error interrupt flag
CAECIF : Boolean := False;
-- Clear CLUT transfer complete interrupt flag
CCTCIF : Boolean := False;
-- Clear configuration error interrupt flag
CCEIF : Boolean := False;
-- unspecified
Reserved_6_31 : HAL.UInt26 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IFCR_Register use record
CTEIF at 0 range 0 .. 0;
CTCIF at 0 range 1 .. 1;
CTWIF at 0 range 2 .. 2;
CAECIF at 0 range 3 .. 3;
CCTCIF at 0 range 4 .. 4;
CCEIF at 0 range 5 .. 5;
Reserved_6_31 at 0 range 6 .. 31;
end record;
-------------------
-- FGOR_Register --
-------------------
subtype FGOR_LO_Field is HAL.UInt14;
-- foreground offset register
type FGOR_Register is record
-- Line offset
LO : FGOR_LO_Field := 16#0#;
-- unspecified
Reserved_14_31 : HAL.UInt18 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for FGOR_Register use record
LO at 0 range 0 .. 13;
Reserved_14_31 at 0 range 14 .. 31;
end record;
-------------------
-- BGOR_Register --
-------------------
subtype BGOR_LO_Field is HAL.UInt14;
-- background offset register
type BGOR_Register is record
-- Line offset
LO : BGOR_LO_Field := 16#0#;
-- unspecified
Reserved_14_31 : HAL.UInt18 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BGOR_Register use record
LO at 0 range 0 .. 13;
Reserved_14_31 at 0 range 14 .. 31;
end record;
----------------------
-- FGPFCCR_Register --
----------------------
subtype FGPFCCR_CM_Field is HAL.UInt4;
subtype FGPFCCR_CS_Field is HAL.Byte;
subtype FGPFCCR_AM_Field is HAL.UInt2;
subtype FGPFCCR_ALPHA_Field is HAL.Byte;
-- foreground PFC control register
type FGPFCCR_Register is record
-- Color mode
CM : FGPFCCR_CM_Field := 16#0#;
-- CLUT color mode
CCM : Boolean := False;
-- Start
START : Boolean := False;
-- unspecified
Reserved_6_7 : HAL.UInt2 := 16#0#;
-- CLUT size
CS : FGPFCCR_CS_Field := 16#0#;
-- Alpha mode
AM : FGPFCCR_AM_Field := 16#0#;
-- unspecified
Reserved_18_23 : HAL.UInt6 := 16#0#;
-- Alpha value
ALPHA : FGPFCCR_ALPHA_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for FGPFCCR_Register use record
CM at 0 range 0 .. 3;
CCM at 0 range 4 .. 4;
START at 0 range 5 .. 5;
Reserved_6_7 at 0 range 6 .. 7;
CS at 0 range 8 .. 15;
AM at 0 range 16 .. 17;
Reserved_18_23 at 0 range 18 .. 23;
ALPHA at 0 range 24 .. 31;
end record;
---------------------
-- FGCOLR_Register --
---------------------
subtype FGCOLR_BLUE_Field is HAL.Byte;
subtype FGCOLR_GREEN_Field is HAL.Byte;
subtype FGCOLR_RED_Field is HAL.Byte;
-- foreground color register
type FGCOLR_Register is record
-- Blue Value
BLUE : FGCOLR_BLUE_Field := 16#0#;
-- Green Value
GREEN : FGCOLR_GREEN_Field := 16#0#;
-- Red Value
RED : FGCOLR_RED_Field := 16#0#;
-- unspecified
Reserved_24_31 : HAL.Byte := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for FGCOLR_Register use record
BLUE at 0 range 0 .. 7;
GREEN at 0 range 8 .. 15;
RED at 0 range 16 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
----------------------
-- BGPFCCR_Register --
----------------------
subtype BGPFCCR_CM_Field is HAL.UInt4;
subtype BGPFCCR_CS_Field is HAL.Byte;
subtype BGPFCCR_AM_Field is HAL.UInt2;
subtype BGPFCCR_ALPHA_Field is HAL.Byte;
-- background PFC control register
type BGPFCCR_Register is record
-- Color mode
CM : BGPFCCR_CM_Field := 16#0#;
-- CLUT Color mode
CCM : Boolean := False;
-- Start
START : Boolean := False;
-- unspecified
Reserved_6_7 : HAL.UInt2 := 16#0#;
-- CLUT size
CS : BGPFCCR_CS_Field := 16#0#;
-- Alpha mode
AM : BGPFCCR_AM_Field := 16#0#;
-- unspecified
Reserved_18_23 : HAL.UInt6 := 16#0#;
-- Alpha value
ALPHA : BGPFCCR_ALPHA_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BGPFCCR_Register use record
CM at 0 range 0 .. 3;
CCM at 0 range 4 .. 4;
START at 0 range 5 .. 5;
Reserved_6_7 at 0 range 6 .. 7;
CS at 0 range 8 .. 15;
AM at 0 range 16 .. 17;
Reserved_18_23 at 0 range 18 .. 23;
ALPHA at 0 range 24 .. 31;
end record;
---------------------
-- BGCOLR_Register --
---------------------
subtype BGCOLR_BLUE_Field is HAL.Byte;
subtype BGCOLR_GREEN_Field is HAL.Byte;
subtype BGCOLR_RED_Field is HAL.Byte;
-- background color register
type BGCOLR_Register is record
-- Blue Value
BLUE : BGCOLR_BLUE_Field := 16#0#;
-- Green Value
GREEN : BGCOLR_GREEN_Field := 16#0#;
-- Red Value
RED : BGCOLR_RED_Field := 16#0#;
-- unspecified
Reserved_24_31 : HAL.Byte := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BGCOLR_Register use record
BLUE at 0 range 0 .. 7;
GREEN at 0 range 8 .. 15;
RED at 0 range 16 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
---------------------
-- OPFCCR_Register --
---------------------
subtype OPFCCR_CM_Field is HAL.UInt3;
-- output PFC control register
type OPFCCR_Register is record
-- Color mode
CM : OPFCCR_CM_Field := 16#0#;
-- unspecified
Reserved_3_31 : HAL.UInt29 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OPFCCR_Register use record
CM at 0 range 0 .. 2;
Reserved_3_31 at 0 range 3 .. 31;
end record;
--------------------
-- OCOLR_Register --
--------------------
subtype OCOLR_BLUE_Field is HAL.Byte;
subtype OCOLR_GREEN_Field is HAL.Byte;
subtype OCOLR_RED_Field is HAL.Byte;
subtype OCOLR_APLHA_Field is HAL.Byte;
-- output color register
type OCOLR_Register is record
-- Blue Value
BLUE : OCOLR_BLUE_Field := 16#0#;
-- Green Value
GREEN : OCOLR_GREEN_Field := 16#0#;
-- Red Value
RED : OCOLR_RED_Field := 16#0#;
-- Alpha Channel Value
APLHA : OCOLR_APLHA_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OCOLR_Register use record
BLUE at 0 range 0 .. 7;
GREEN at 0 range 8 .. 15;
RED at 0 range 16 .. 23;
APLHA at 0 range 24 .. 31;
end record;
------------------
-- OOR_Register --
------------------
subtype OOR_LO_Field is HAL.UInt14;
-- output offset register
type OOR_Register is record
-- Line Offset
LO : OOR_LO_Field := 16#0#;
-- unspecified
Reserved_14_31 : HAL.UInt18 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OOR_Register use record
LO at 0 range 0 .. 13;
Reserved_14_31 at 0 range 14 .. 31;
end record;
------------------
-- NLR_Register --
------------------
subtype NLR_NL_Field is HAL.Short;
subtype NLR_PL_Field is HAL.UInt14;
-- number of line register
type NLR_Register is record
-- Number of lines
NL : NLR_NL_Field := 16#0#;
-- Pixel per lines
PL : NLR_PL_Field := 16#0#;
-- unspecified
Reserved_30_31 : HAL.UInt2 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for NLR_Register use record
NL at 0 range 0 .. 15;
PL at 0 range 16 .. 29;
Reserved_30_31 at 0 range 30 .. 31;
end record;
------------------
-- LWR_Register --
------------------
subtype LWR_LW_Field is HAL.Short;
-- line watermark register
type LWR_Register is record
-- Line watermark
LW : LWR_LW_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.Short := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for LWR_Register use record
LW at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
--------------------
-- AMTCR_Register --
--------------------
subtype AMTCR_DT_Field is HAL.Byte;
-- AHB master timer configuration register
type AMTCR_Register is record
-- Enable
EN : Boolean := False;
-- unspecified
Reserved_1_7 : HAL.UInt7 := 16#0#;
-- Dead Time
DT : AMTCR_DT_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.Short := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for AMTCR_Register use record
EN at 0 range 0 .. 0;
Reserved_1_7 at 0 range 1 .. 7;
DT at 0 range 8 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
---------------------
-- FGCLUT_Register --
---------------------
subtype FGCLUT_BLUE_Field is HAL.Byte;
subtype FGCLUT_GREEN_Field is HAL.Byte;
subtype FGCLUT_RED_Field is HAL.Byte;
subtype FGCLUT_APLHA_Field is HAL.Byte;
-- FGCLUT
type FGCLUT_Register is record
-- BLUE
BLUE : FGCLUT_BLUE_Field := 16#0#;
-- GREEN
GREEN : FGCLUT_GREEN_Field := 16#0#;
-- RED
RED : FGCLUT_RED_Field := 16#0#;
-- APLHA
APLHA : FGCLUT_APLHA_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for FGCLUT_Register use record
BLUE at 0 range 0 .. 7;
GREEN at 0 range 8 .. 15;
RED at 0 range 16 .. 23;
APLHA at 0 range 24 .. 31;
end record;
---------------------
-- BGCLUT_Register --
---------------------
subtype BGCLUT_BLUE_Field is HAL.Byte;
subtype BGCLUT_GREEN_Field is HAL.Byte;
subtype BGCLUT_RED_Field is HAL.Byte;
subtype BGCLUT_APLHA_Field is HAL.Byte;
-- BGCLUT
type BGCLUT_Register is record
-- BLUE
BLUE : BGCLUT_BLUE_Field := 16#0#;
-- GREEN
GREEN : BGCLUT_GREEN_Field := 16#0#;
-- RED
RED : BGCLUT_RED_Field := 16#0#;
-- APLHA
APLHA : BGCLUT_APLHA_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BGCLUT_Register use record
BLUE at 0 range 0 .. 7;
GREEN at 0 range 8 .. 15;
RED at 0 range 16 .. 23;
APLHA at 0 range 24 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- DMA2D controller
type DMA2D_Peripheral is record
-- control register
CR : CR_Register;
-- Interrupt Status Register
ISR : ISR_Register;
-- interrupt flag clear register
IFCR : IFCR_Register;
-- foreground memory address register
FGMAR : HAL.Word;
-- foreground offset register
FGOR : FGOR_Register;
-- background memory address register
BGMAR : HAL.Word;
-- background offset register
BGOR : BGOR_Register;
-- foreground PFC control register
FGPFCCR : FGPFCCR_Register;
-- foreground color register
FGCOLR : FGCOLR_Register;
-- background PFC control register
BGPFCCR : BGPFCCR_Register;
-- background color register
BGCOLR : BGCOLR_Register;
-- foreground CLUT memory address register
FGCMAR : HAL.Word;
-- background CLUT memory address register
BGCMAR : HAL.Word;
-- output PFC control register
OPFCCR : OPFCCR_Register;
-- output color register
OCOLR : OCOLR_Register;
-- output memory address register
OMAR : HAL.Word;
-- output offset register
OOR : OOR_Register;
-- number of line register
NLR : NLR_Register;
-- line watermark register
LWR : LWR_Register;
-- AHB master timer configuration register
AMTCR : AMTCR_Register;
-- FGCLUT
FGCLUT : FGCLUT_Register;
-- BGCLUT
BGCLUT : BGCLUT_Register;
end record
with Volatile;
for DMA2D_Peripheral use record
CR at 0 range 0 .. 31;
ISR at 4 range 0 .. 31;
IFCR at 8 range 0 .. 31;
FGMAR at 12 range 0 .. 31;
FGOR at 16 range 0 .. 31;
BGMAR at 20 range 0 .. 31;
BGOR at 24 range 0 .. 31;
FGPFCCR at 28 range 0 .. 31;
FGCOLR at 32 range 0 .. 31;
BGPFCCR at 36 range 0 .. 31;
BGCOLR at 40 range 0 .. 31;
FGCMAR at 44 range 0 .. 31;
BGCMAR at 48 range 0 .. 31;
OPFCCR at 52 range 0 .. 31;
OCOLR at 56 range 0 .. 31;
OMAR at 60 range 0 .. 31;
OOR at 64 range 0 .. 31;
NLR at 68 range 0 .. 31;
LWR at 72 range 0 .. 31;
AMTCR at 76 range 0 .. 31;
FGCLUT at 1024 range 0 .. 31;
BGCLUT at 2048 range 0 .. 31;
end record;
-- DMA2D controller
DMA2D_Periph : aliased DMA2D_Peripheral
with Import, Address => DMA2D_Base;
end STM32_SVD.DMA2D;
|
------------------------------------------------------------------------------
-- 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
--
-- CRC implementations
------------------------------------------------------------------------------
with Ada.Streams;
with Interfaces;
package Flac.CRC with
SPARK_Mode => On,
Abstract_State => (Constant_State)
is
type Checksum_8 is new Interfaces.Unsigned_8;
type Checksum_16 is new interfaces.Unsigned_16;
---------------------------------------------------------------------------
-- CRC8
---------------------------------------------------------------------------
procedure CRC8 (CRC : in out Checksum_8;
Data : in Ada.Streams.Stream_Element_Array) with
Global => (Input => Constant_State),
Depends => (CRC => (CRC, Data, Constant_State));
---------------------------------------------------------------------------
-- CRC16
---------------------------------------------------------------------------
procedure CRC16 (CRC : in out Checksum_16;
Data : in Ada.Streams.Stream_Element_Array) with
Global => (Input => Constant_State),
Depends => (CRC => (CRC, Data, Constant_State));
end Flac.CRC;
|
-- Copyright 2008, 2009, 2010, 2011 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package Pck is
procedure Increment;
function Is_First return Boolean;
end Pck;
|
-- This package is intended to set up and tear down the test environment.
-- Once created by GNATtest, this package will never be overwritten
-- automatically. Contents of this package can be modified in any way
-- except for sections surrounded by a 'read only' marker.
with Ada.Environment_Variables; use Ada.Environment_Variables;
with Tcl.Info; use Tcl.Info;
package body Tk.Button.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);
Button: Tk_Button;
begin
if Value("DISPLAY", "")'Length = 0 then
return;
end if;
Button := Get_Widget(".mybutton");
if Button /= Null_Widget then
Destroy(Button);
end if;
end Tear_Down;
end Tk.Button.Test_Data;
|
package body Euler is
function Solve
( F : not null access function (T, Y : Number) return Number;
Y0 : Number;
T0, T1 : Number;
N : Positive
) return Waveform is
dT : constant Number := (T1 - T0) / Number (N);
begin
return Y : Waveform (0..N) do
Y (0) := Y0;
for I in 1..Y'Last loop
Y (I) := Y (I - 1) + dT * F (T0 + dT * Number (I - 1), Y (I - 1));
end loop;
end return;
end Solve;
end Euler;
|
-- This spec has been automatically generated from STM32F40x.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with System;
-- STM32F40x
package STM32_SVD is
pragma Preelaborate;
--------------------
-- Base addresses --
--------------------
RNG_Base : constant System.Address :=
System'To_Address (16#50060800#);
DCMI_Base : constant System.Address :=
System'To_Address (16#50050000#);
FSMC_Base : constant System.Address :=
System'To_Address (16#A0000000#);
DBG_Base : constant System.Address :=
System'To_Address (16#E0042000#);
DMA2_Base : constant System.Address :=
System'To_Address (16#40026400#);
DMA1_Base : constant System.Address :=
System'To_Address (16#40026000#);
RCC_Base : constant System.Address :=
System'To_Address (16#40023800#);
GPIOI_Base : constant System.Address :=
System'To_Address (16#40022000#);
GPIOH_Base : constant System.Address :=
System'To_Address (16#40021C00#);
GPIOG_Base : constant System.Address :=
System'To_Address (16#40021800#);
GPIOF_Base : constant System.Address :=
System'To_Address (16#40021400#);
GPIOE_Base : constant System.Address :=
System'To_Address (16#40021000#);
GPIOD_Base : constant System.Address :=
System'To_Address (16#40020C00#);
GPIOC_Base : constant System.Address :=
System'To_Address (16#40020800#);
GPIOB_Base : constant System.Address :=
System'To_Address (16#40020400#);
GPIOA_Base : constant System.Address :=
System'To_Address (16#40020000#);
SYSCFG_Base : constant System.Address :=
System'To_Address (16#40013800#);
SPI1_Base : constant System.Address :=
System'To_Address (16#40013000#);
SPI2_Base : constant System.Address :=
System'To_Address (16#40003800#);
SPI3_Base : constant System.Address :=
System'To_Address (16#40003C00#);
I2S2ext_Base : constant System.Address :=
System'To_Address (16#40003400#);
I2S3ext_Base : constant System.Address :=
System'To_Address (16#40004000#);
SDIO_Base : constant System.Address :=
System'To_Address (16#40012C00#);
ADC1_Base : constant System.Address :=
System'To_Address (16#40012000#);
ADC2_Base : constant System.Address :=
System'To_Address (16#40012100#);
ADC3_Base : constant System.Address :=
System'To_Address (16#40012200#);
USART6_Base : constant System.Address :=
System'To_Address (16#40011400#);
USART1_Base : constant System.Address :=
System'To_Address (16#40011000#);
USART2_Base : constant System.Address :=
System'To_Address (16#40004400#);
USART3_Base : constant System.Address :=
System'To_Address (16#40004800#);
DAC_Base : constant System.Address :=
System'To_Address (16#40007400#);
PWR_Base : constant System.Address :=
System'To_Address (16#40007000#);
I2C3_Base : constant System.Address :=
System'To_Address (16#40005C00#);
I2C2_Base : constant System.Address :=
System'To_Address (16#40005800#);
I2C1_Base : constant System.Address :=
System'To_Address (16#40005400#);
IWDG_Base : constant System.Address :=
System'To_Address (16#40003000#);
WWDG_Base : constant System.Address :=
System'To_Address (16#40002C00#);
RTC_Base : constant System.Address :=
System'To_Address (16#40002800#);
UART4_Base : constant System.Address :=
System'To_Address (16#40004C00#);
UART5_Base : constant System.Address :=
System'To_Address (16#40005000#);
C_ADC_Base : constant System.Address :=
System'To_Address (16#40012300#);
TIM1_Base : constant System.Address :=
System'To_Address (16#40010000#);
TIM8_Base : constant System.Address :=
System'To_Address (16#40010400#);
TIM2_Base : constant System.Address :=
System'To_Address (16#40000000#);
TIM3_Base : constant System.Address :=
System'To_Address (16#40000400#);
TIM4_Base : constant System.Address :=
System'To_Address (16#40000800#);
TIM5_Base : constant System.Address :=
System'To_Address (16#40000C00#);
TIM9_Base : constant System.Address :=
System'To_Address (16#40014000#);
TIM12_Base : constant System.Address :=
System'To_Address (16#40001800#);
TIM10_Base : constant System.Address :=
System'To_Address (16#40014400#);
TIM13_Base : constant System.Address :=
System'To_Address (16#40001C00#);
TIM14_Base : constant System.Address :=
System'To_Address (16#40002000#);
TIM11_Base : constant System.Address :=
System'To_Address (16#40014800#);
TIM6_Base : constant System.Address :=
System'To_Address (16#40001000#);
TIM7_Base : constant System.Address :=
System'To_Address (16#40001400#);
Ethernet_MAC_Base : constant System.Address :=
System'To_Address (16#40028000#);
Ethernet_MMC_Base : constant System.Address :=
System'To_Address (16#40028100#);
Ethernet_PTP_Base : constant System.Address :=
System'To_Address (16#40028700#);
Ethernet_DMA_Base : constant System.Address :=
System'To_Address (16#40029000#);
CRC_Base : constant System.Address :=
System'To_Address (16#40023000#);
OTG_FS_GLOBAL_Base : constant System.Address :=
System'To_Address (16#50000000#);
OTG_FS_HOST_Base : constant System.Address :=
System'To_Address (16#50000400#);
OTG_FS_DEVICE_Base : constant System.Address :=
System'To_Address (16#50000800#);
OTG_FS_PWRCLK_Base : constant System.Address :=
System'To_Address (16#50000E00#);
CAN1_Base : constant System.Address :=
System'To_Address (16#40006400#);
CAN2_Base : constant System.Address :=
System'To_Address (16#40006800#);
FLASH_Base : constant System.Address :=
System'To_Address (16#40023C00#);
EXTI_Base : constant System.Address :=
System'To_Address (16#40013C00#);
OTG_HS_GLOBAL_Base : constant System.Address :=
System'To_Address (16#40040000#);
OTG_HS_HOST_Base : constant System.Address :=
System'To_Address (16#40040400#);
OTG_HS_DEVICE_Base : constant System.Address :=
System'To_Address (16#40040800#);
OTG_HS_PWRCLK_Base : constant System.Address :=
System'To_Address (16#40040E00#);
NVIC_Base : constant System.Address :=
System'To_Address (16#E000E000#);
end STM32_SVD;
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.