content
stringlengths 23
1.05M
|
|---|
--
-- 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.
--
package Macros is
procedure Append (Name : in String);
-- This routine is called with the argument to each -D command-line option.
-- Add the macro defined to the azDefine array.
procedure Preprocess (Buffer : in out String;
Success : out Boolean);
-- Run the preprocessor over the input file text. The macro names are defined
-- to list by Append procedure above
-- This routine looks for "%ifdef" and "%ifndef" and "%endif" and
-- comments them out. Text in between is also commented out as appropriate.
end Macros;
|
-- SPDX-FileCopyrightText: 2020 Max Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
----------------------------------------------------------------
with Ada.Characters.Wide_Wide_Latin_1;
with Ada.Containers.Doubly_Linked_Lists;
with Ada.Containers.Hashed_Maps;
with Ada.Wide_Wide_Text_IO;
with GNAT.SHA256;
with Interfaces.C;
with League.Text_Codecs;
with League.Holders;
with League.JSON.Documents;
with League.JSON.Objects;
with League.JSON.Values;
with League.Stream_Element_Vectors;
with League.Strings;
with League.Strings.Hash;
with ZMQ.Contexts;
with ZMQ.Messages;
with ZMQ.Sockets;
with ZMQ.Low_Level;
procedure Jupyter.Start_Kernel
(Kernel : in out Jupyter.Kernels.Kernel'Class;
File : League.Strings.Universal_String)
is
function "+" (Text : Wide_Wide_String)
return League.Strings.Universal_String
renames League.Strings.To_Universal_String;
function "-" (Text : Wide_Wide_String) return League.JSON.Values.JSON_Value;
procedure Read_Connection_File
(Name : League.Strings.Universal_String;
Result : out League.JSON.Objects.JSON_Object);
procedure Bind
(Ctx : ZMQ.Contexts.Context;
Socket : in out ZMQ.Sockets.Socket;
CF : League.JSON.Objects.JSON_Object;
Port : Wide_Wide_String;
Kind : ZMQ.Sockets.Socket_Type);
type Frontend_Connection is record
Ctx : ZMQ.Contexts.Context;
Key : League.Strings.Universal_String;
Shell : ZMQ.Sockets.Socket;
Stdin : ZMQ.Sockets.Socket;
IOPub : ZMQ.Sockets.Socket;
Control : ZMQ.Sockets.Socket;
Ping : ZMQ.Sockets.Socket;
Msg_Id : Integer := -1;
end record;
package IO_Pubs is
type IO_Pub (Up : not null access Frontend_Connection) is
new Jupyter.Kernels.IO_Pub with
record
Request : League.JSON.Objects.JSON_Object;
Id : Positive;
Count : Positive;
end record;
overriding procedure Stream
(Self : in out IO_Pub;
Name : League.Strings.Universal_String;
Text : League.Strings.Universal_String);
overriding procedure Display_Data
(Self : in out IO_Pub;
Data : League.JSON.Objects.JSON_Object;
Metadata : League.JSON.Objects.JSON_Object;
Transient : League.JSON.Objects.JSON_Object);
overriding procedure Update_Display_Data
(Self : in out IO_Pub;
Data : League.JSON.Objects.JSON_Object;
Metadata : League.JSON.Objects.JSON_Object;
Transient : League.JSON.Objects.JSON_Object);
overriding procedure Execute_Result
(Self : in out IO_Pub;
Data : League.JSON.Objects.JSON_Object;
Metadata : League.JSON.Objects.JSON_Object;
Transient : League.JSON.Objects.JSON_Object);
overriding procedure Execute_Error
(Self : in out IO_Pub;
Value : Jupyter.Kernels.Execution_Error);
overriding procedure Clear_Output
(Self : in out IO_Pub;
Wait : Boolean);
overriding procedure Debug_Event
(Self : in out IO_Pub;
Content : League.JSON.Objects.JSON_Object);
end IO_Pubs;
package Address_Lists is new Ada.Containers.Doubly_Linked_Lists
(League.Stream_Element_Vectors.Stream_Element_Vector,
League.Stream_Element_Vectors."=");
function "-"
(Text : League.Strings.Universal_String) return Address_Lists.List;
procedure Send_Message
(Socket : in out ZMQ.Sockets.Socket;
Msg_Id : in out Integer;
To : Address_Lists.List;
Key : League.Strings.Universal_String;
Kind : Wide_Wide_String;
Parent : League.JSON.Objects.JSON_Object :=
League.JSON.Objects.Empty_JSON_Object;
Content : League.JSON.Objects.JSON_Object :=
League.JSON.Objects.Empty_JSON_Object);
package body IO_Pubs is separate;
type Message is record
From : Address_Lists.List;
Signature : League.Strings.Universal_String;
Header : League.JSON.Objects.JSON_Object;
Parent : League.JSON.Objects.JSON_Object;
Metadata : League.JSON.Objects.JSON_Object;
Content : League.JSON.Objects.JSON_Object;
end record;
procedure Read_Message
(Socket : ZMQ.Sockets.Socket;
Key : League.Strings.Universal_String;
Result : out Message);
procedure Process_Shell_Message
(Frontend : aliased in out Frontend_Connection;
Request : Message);
function Has_More (Message : ZMQ.Messages.Message) return Boolean;
type Session_Information is record
Id : Positive;
Count : Positive;
end record;
package Session_Maps is new Ada.Containers.Hashed_Maps
(Key_Type => League.Strings.Universal_String,
Element_Type => Session_Information,
Hash => League.Strings.Hash,
Equivalent_Keys => League.Strings."=");
Next_Id : Positive := 1;
Map : Session_Maps.Map;
---------
-- "-" --
---------
function "-" (Text : Wide_Wide_String)
return League.JSON.Values.JSON_Value is
begin
return League.JSON.Values.To_JSON_Value (+Text);
end "-";
---------
-- "-" --
---------
function "-"
(Text : League.Strings.Universal_String) return Address_Lists.List
is
Codec : constant League.Text_Codecs.Text_Codec :=
League.Text_Codecs.Codec_For_Application_Locale;
begin
return Result : Address_Lists.List do
Result.Append (Codec.Encode (Text));
end return;
end "-";
----------
-- Bind --
----------
procedure Bind
(Ctx : ZMQ.Contexts.Context;
Socket : in out ZMQ.Sockets.Socket;
CF : League.JSON.Objects.JSON_Object;
Port : Wide_Wide_String;
Kind : ZMQ.Sockets.Socket_Type)
is
Image : constant String := CF.Value (+Port).To_Integer'Img;
Address : constant String :=
CF.Value (+"transport").To_String.To_UTF_8_String &
"://" &
CF.Value (+"ip").To_String.To_UTF_8_String &
":" & Image (2 .. Image'Last);
begin
Socket.Initialize (Ctx, Kind);
Socket.Bind (Address);
end Bind;
--------------
-- Has_More --
--------------
function Has_More (Message : ZMQ.Messages.Message) return Boolean is
use type Interfaces.C.int;
begin
return ZMQ.Low_Level.zmq_msg_more (Message.GetImpl) /= 0;
end Has_More;
-------------
-- Process --
-------------
procedure Process_Shell_Message
(Frontend : aliased in out Frontend_Connection;
Request : Message)
is
use type League.Strings.Universal_String;
Topic : League.Strings.Universal_String;
Reply : League.JSON.Objects.JSON_Object;
Action : League.Strings.Universal_String :=
Request.Header.Value (+"msg_type").To_String;
begin
if Action.Ends_With ("_request") then
Action := Action.Head_To (Action.Length - 8);
Topic := Action & "_reply";
else
-- No _request in msg_type, ignore it
return;
end if;
declare
Content : League.JSON.Objects.JSON_Object;
begin
Content.Insert (+"execution_state", -"busy");
Send_Message
(Frontend.IOPub,
Frontend.Msg_Id,
-Topic,
Frontend.Key,
"status",
Parent => Request.Header,
Content => Content);
end;
if Action = +"kernel_info" then
Kernel.Kernel_Info (Reply);
Send_Message
(Frontend.Shell,
Frontend.Msg_Id,
Request.From,
Frontend.Key,
"kernel_info_reply",
Parent => Request.Header,
Content => Reply);
elsif Action = +"execute" then
declare
S : constant League.Strings.Universal_String :=
Request.Header.Value (+"session").To_String;
Input : League.JSON.Objects.JSON_Object := Request.Content;
Values : League.JSON.Objects.JSON_Object;
Error : Jupyter.Kernels.Execution_Error;
Object : Jupyter.Kernels.Session_Access;
Count : League.Holders.Universal_Integer;
IO_Pub : aliased IO_Pubs.IO_Pub :=
(Frontend'Unchecked_Access,
Request.Header,
others => <>);
begin
if not Map.Contains (S) then
IO_Pub.Id := Next_Id;
IO_Pub.Count := 1;
Count := 1;
Kernel.Create_Session (IO_Pub.Id, Object);
Map.Insert (S, (IO_Pub.Id, IO_Pub.Count));
Next_Id := Next_Id + 1;
else
Map (S).Count := Map (S).Count + 1;
IO_Pub.Id := Map (S).Id;
IO_Pub.Count := Map (S).Count;
Object := Kernel.Get_Session (IO_Pub.Id);
Count := League.Holders.Universal_Integer (IO_Pub.Count);
end if;
Input.Insert
(+"execution_count",
League.JSON.Values.To_JSON_Value (Count));
Send_Message
(Frontend.IOPub,
Frontend.Msg_Id,
-(+"execute_input"),
Frontend.Key,
"execute_input",
Parent => Request.Header,
Content => Input);
Object.Execute
(IO_Pub => IO_Pub'Unchecked_Access,
Execution_Counter => IO_Pub.Count,
Code => Input.Value (+"code").To_String,
Silent => Input.Value (+"silent").To_Boolean,
User_Expressions => Input.Value (+"user_expressions").To_Object,
Allow_Stdin => Input.Value (+"allow_stdin").To_Boolean,
Stop_On_Error => Input.Value (+"stop_on_error").To_Boolean,
Expression_Values => Values,
Error => Error);
Reply.Insert
(+"execution_count",
League.JSON.Values.To_JSON_Value (Count));
if Error.Name.Is_Empty then
Reply.Insert (+"status", -"ok");
Reply.Insert (+"user_expressions", Values.To_JSON_Value);
else
Reply.Insert (+"status", -"error");
Reply.Insert
(+"ename", League.JSON.Values.To_JSON_Value (Error.Name));
Reply.Insert
(+"evalue", League.JSON.Values.To_JSON_Value (Error.Value));
-- FIXME: Copy traceback
end if;
Send_Message
(Frontend.Shell,
Frontend.Msg_Id,
Request.From,
Frontend.Key,
"execute_reply",
Parent => Request.Header,
Content => Reply);
end;
end if;
declare
Content : League.JSON.Objects.JSON_Object;
begin
Content.Insert (+"execution_state", -"idle");
Send_Message
(Frontend.IOPub,
Frontend.Msg_Id,
-Topic,
Frontend.Key,
"status",
Parent => Request.Header,
Content => Content);
end;
end Process_Shell_Message;
--------------------------
-- Read_Connection_File --
--------------------------
procedure Read_Connection_File
(Name : League.Strings.Universal_String;
Result : out League.JSON.Objects.JSON_Object)
is
Input : Ada.Wide_Wide_Text_IO.File_Type;
Text : League.Strings.Universal_String;
Doc : League.JSON.Documents.JSON_Document;
begin
Ada.Wide_Wide_Text_IO.Open
(Input, Ada.Wide_Wide_Text_IO.In_File, Name.To_UTF_8_String);
while not Ada.Wide_Wide_Text_IO.End_Of_File (Input) loop
declare
Line : constant Wide_Wide_String :=
Ada.Wide_Wide_Text_IO.Get_Line (Input);
begin
Text.Append (Line);
Text.Append (Ada.Characters.Wide_Wide_Latin_1.LF);
end;
end loop;
Ada.Wide_Wide_Text_IO.Close (Input);
Doc := League.JSON.Documents.From_JSON (Text);
Result := Doc.To_JSON_Object;
end Read_Connection_File;
------------------
-- Read_Message --
------------------
procedure Read_Message
(Socket : ZMQ.Sockets.Socket;
Key : League.Strings.Universal_String;
Result : out Message)
is
procedure Read_Object
(Object : out League.JSON.Objects.JSON_Object;
More : out Boolean);
Digest : GNAT.SHA256.Context :=
GNAT.SHA256.HMAC_Initial_Context (Key.To_UTF_8_String);
-----------------
-- Read_Object --
-----------------
procedure Read_Object
(Object : out League.JSON.Objects.JSON_Object;
More : out Boolean)
is
MSG : ZMQ.Messages.Message;
begin
MSG.Initialize (0);
Socket.Recv (MSG);
declare
Text : constant String := MSG.GetData;
begin
More := Has_More (MSG);
GNAT.SHA256.Update (Digest, Text);
Object := League.JSON.Documents.From_JSON
(League.Strings.From_UTF_8_String (Text)).To_JSON_Object;
end;
end Read_Object;
More : Boolean;
begin
loop
declare
From : ZMQ.Messages.Message;
Item : League.Stream_Element_Vectors.Stream_Element_Vector;
begin
From.Initialize (0);
Socket.Recv (From);
exit when From.GetData = "<IDS|MSG>";
Item := League.Stream_Element_Vectors.To_Stream_Element_Vector
(From.GetData);
Result.From.Append (Item);
pragma Assert (Has_More (From));
end;
end loop;
Result.Signature := League.Strings.From_UTF_8_String (Socket.Recv);
Read_Object (Result.Header, More);
pragma Assert (More);
Read_Object (Result.Parent, More);
pragma Assert (More);
Read_Object (Result.Metadata, More);
pragma Assert (More);
Read_Object (Result.Content, More);
while More loop -- Skip buffers if any
declare
Temp : ZMQ.Messages.Message;
begin
Temp.Initialize (0);
Socket.Recv (Temp);
More := Has_More (Temp);
end;
end loop;
end Read_Message;
-----------------
-- Send_Status --
-----------------
procedure Send_Message
(Socket : in out ZMQ.Sockets.Socket;
Msg_Id : in out Integer;
To : Address_Lists.List;
Key : League.Strings.Universal_String;
Kind : Wide_Wide_String;
Parent : League.JSON.Objects.JSON_Object :=
League.JSON.Objects.Empty_JSON_Object;
Content : League.JSON.Objects.JSON_Object :=
League.JSON.Objects.Empty_JSON_Object)
is
use type League.Strings.Universal_String;
Image : constant Wide_Wide_String := Integer'Wide_Wide_Image (Msg_Id);
Object : League.JSON.Objects.JSON_Object;
Digest : GNAT.SHA256.Context :=
GNAT.SHA256.HMAC_Initial_Context (Key.To_UTF_8_String);
begin
Msg_Id := Msg_Id - 1;
Object.Insert (+"msg_id", League.JSON.Values.To_JSON_Value (+Image));
Object.Insert (+"session", Parent.Value (+"session"));
Object.Insert (+"username", Parent.Value (+"username"));
if Parent.Contains (+"date") then
Object.Insert (+"date", Parent.Value (+"date"));
end if;
Object.Insert (+"msg_type", -Kind);
Object.Insert (+"version", -"5.3");
GNAT.SHA256.Update
(Digest,
Object.To_JSON_Document.To_JSON.To_Stream_Element_Array);
GNAT.SHA256.Update
(Digest,
Parent.To_JSON_Document.To_JSON.To_Stream_Element_Array);
GNAT.SHA256.Update (Digest, "{}");
GNAT.SHA256.Update
(Digest,
Content.To_JSON_Document.To_JSON.To_Stream_Element_Array);
for X of To loop
Socket.Send (X.To_Stream_Element_Array, 2);
end loop;
Socket.Send ("<IDS|MSG>", 2);
Socket.Send (String'(GNAT.SHA256.Digest (Digest)), 2);
Socket.Send
(Object.To_JSON_Document.To_JSON.To_Stream_Element_Array,
2);
Socket.Send
(Parent.To_JSON_Document.To_JSON.To_Stream_Element_Array,
2);
Socket.Send ("{}", 2);
Socket.Send (Content.To_JSON_Document.To_JSON.To_Stream_Element_Array);
end Send_Message;
use type Interfaces.C.int;
use type Interfaces.C.long;
use type Interfaces.C.short;
CF : League.JSON.Objects.JSON_Object;
Frontend : aliased Frontend_Connection;
Poll : array (1 .. 4) of aliased ZMQ.Low_Level.zmq_pollitem_t;
begin
Read_Connection_File (File, CF);
Frontend.Key := CF.Value (+"key").To_String;
Bind (Frontend.Ctx, Frontend.Shell, CF, "shell_port", ZMQ.Sockets.ROUTER);
Bind (Frontend.Ctx, Frontend.Stdin, CF, "stdin_port", ZMQ.Sockets.ROUTER);
Bind (Frontend.Ctx, Frontend.IOPub, CF, "iopub_port", ZMQ.Sockets.PUB);
Bind (Frontend.Ctx, Frontend.Ping, CF, "hb_port", ZMQ.Sockets.ROUTER);
Bind
(Frontend.Ctx,
Frontend.Control,
CF,
"control_port",
ZMQ.Sockets.ROUTER);
loop
Poll :=
(1 => (socket => Frontend.Shell.Get_Impl,
fd => 0,
events => ZMQ.Low_Level.Defs.ZMQ_POLLIN,
revents => 0),
2 => (socket => Frontend.Stdin.Get_Impl,
fd => 0,
events => ZMQ.Low_Level.Defs.ZMQ_POLLIN,
revents => 0),
3 => (socket => Frontend.Ping.Get_Impl,
fd => 0,
events => ZMQ.Low_Level.Defs.ZMQ_POLLIN,
revents => 0),
4 => (socket => Frontend.Control.Get_Impl,
fd => 0,
events => ZMQ.Low_Level.Defs.ZMQ_POLLIN,
revents => 0));
if ZMQ.Low_Level.zmq_poll
(items_u => Poll (1)'Access,
nitems_u => 4,
timeout_u => -1) < 0
then
return;
end if;
if Poll (1).revents /= 0 then
declare
Msg : Message;
begin
Read_Message (Frontend.Shell, Frontend.Key, Msg);
Process_Shell_Message (Frontend, Msg);
end;
end if;
end loop;
end Jupyter.Start_Kernel;
|
with Ada.Streams; use Ada.Streams;
package body Zip.Headers is
-----------------------------------------------------------
-- Byte array < - > various integers, with Intel endianess --
-----------------------------------------------------------
-- Get numbers with correct trucmuche endian, to ensure
-- correct header loading on some non - Intel machines
generic
type Number is mod <>; -- range <> in Ada83 version (fake Interfaces)
function Intel_x86_number (b : Byte_Buffer) return Number;
function Intel_x86_number (b : Byte_Buffer) return Number is
n : Number := 0;
begin
for i in reverse b'Range loop
n := n * 256 + Number (b (i));
end loop;
return n;
end Intel_x86_number;
function Intel_nb is new Intel_x86_number (Unsigned_16);
function Intel_nb is new Intel_x86_number (Unsigned_32);
-- Put numbers with correct endianess as bytes
generic
type Number is mod <>; -- range <> in Ada83 version (fake Interfaces)
size : Positive;
function Intel_x86_buffer (n : Number) return Byte_Buffer;
function Intel_x86_buffer (n : Number) return Byte_Buffer is
b : Byte_Buffer (1 .. size);
m : Number := n;
begin
for i in b'Range loop
b (i) := Unsigned_8 (m and 255);
m := m / 256;
end loop;
return b;
end Intel_x86_buffer;
function Intel_bf is new Intel_x86_buffer (Unsigned_16, 2);
function Intel_bf is new Intel_x86_buffer (Unsigned_32, 4);
-------------------
-- PK signatures --
-------------------
function PK_signature (buf : Byte_Buffer; code : Unsigned_8) return Boolean is
(buf (1 .. 4) = (16#50#, 16#4B#, code, code + 1)); -- PK12, PK34, . ..
procedure PK_signature (buf : in out Byte_Buffer; code : Unsigned_8) is
begin
buf (1 .. 4) := (16#50#, 16#4B#, code, code + 1); -- PK12, PK34, . ..
end PK_signature;
-------------------------------------------------------
-- PKZIP file header, as in central directory - PK12 --
-------------------------------------------------------
procedure Read_and_check (stream : Zipstream_Class;
header : out Central_File_Header) is
chb : Byte_Buffer (1 .. 46);
begin
BlockRead (stream, chb);
if not PK_signature (chb, 1) then
raise bad_central_header;
end if;
header := (made_by_version => Intel_nb (chb (5 .. 6)),
short_info =>
(needed_extract_version => Intel_nb (chb (7 .. 8)),
bit_flag => Intel_nb (chb (9 .. 10)),
zip_type => Intel_nb (chb (11 .. 12)),
file_timedate => Zip_Streams.Calendar.Convert (Unsigned_32'(Intel_nb (chb (13 .. 16)))),
dd =>
(crc_32 => Intel_nb (chb (17 .. 20)),
compressed_size => Intel_nb (chb (21 .. 24)),
uncompressed_size => Intel_nb (chb (25 .. 28))),
filename_length => Intel_nb (chb (29 .. 30)),
extra_field_length => Intel_nb (chb (31 .. 32))),
comment_length => Intel_nb (chb (33 .. 34)),
disk_number_start => Intel_nb (chb (35 .. 36)),
internal_attributes => Intel_nb (chb (37 .. 38)),
external_attributes => Intel_nb (chb (39 .. 42)),
local_header_offset => Intel_nb (chb (43 .. 46)));
end Read_and_check;
procedure Write (stream : Zipstream_Class;
header : Central_File_Header) is
chb : Byte_Buffer (1 .. 46);
begin
PK_signature (chb, 1);
chb (5 .. 6) := Intel_bf (header.made_by_version);
chb (7 .. 8) := Intel_bf (header.short_info.needed_extract_version);
chb (9 .. 10) := Intel_bf (header.short_info.bit_flag);
chb (11 .. 12) := Intel_bf (header.short_info.zip_type);
chb (13 .. 16) := Intel_bf (Zip_Streams.Calendar.Convert (header.short_info.file_timedate));
chb (17 .. 20) := Intel_bf (header.short_info.dd.crc_32);
chb (21 .. 24) := Intel_bf (header.short_info.dd.compressed_size);
chb (25 .. 28) := Intel_bf (header.short_info.dd.uncompressed_size);
chb (29 .. 30) := Intel_bf (header.short_info.filename_length);
chb (31 .. 32) := Intel_bf (header.short_info.extra_field_length);
chb (33 .. 34) := Intel_bf (header.comment_length);
chb (35 .. 36) := Intel_bf (header.disk_number_start);
chb (37 .. 38) := Intel_bf (header.internal_attributes);
chb (39 .. 42) := Intel_bf (header.external_attributes);
chb (43 .. 46) := Intel_bf (header.local_header_offset);
BlockWrite (stream.all, chb);
end Write;
-----------------------------------------------------------------------
-- PKZIP local file header, in front of every file in archive - PK34 --
-----------------------------------------------------------------------
procedure Read_and_check (stream : Zipstream_Class;
header : out Local_File_Header) is
lhb : Byte_Buffer (1 .. 30);
begin
BlockRead (stream, lhb);
if not PK_signature (lhb, 3) then
raise bad_local_header;
end if;
header :=
(needed_extract_version => Intel_nb (lhb (5 .. 6)),
bit_flag => Intel_nb (lhb (7 .. 8)),
zip_type => Intel_nb (lhb (9 .. 10)),
file_timedate => Zip_Streams.Calendar.Convert (Unsigned_32'(Intel_nb (lhb (11 .. 14)))),
dd =>
(crc_32 => Intel_nb (lhb (15 .. 18)),
compressed_size => Intel_nb (lhb (19 .. 22)),
uncompressed_size => Intel_nb (lhb (23 .. 26))),
filename_length => Intel_nb (lhb (27 .. 28)),
extra_field_length => Intel_nb (lhb (29 .. 30)));
end Read_and_check;
procedure Write (stream : Zipstream_Class;
header : Local_File_Header) is
lhb : Byte_Buffer (1 .. 30);
begin
PK_signature (lhb, 3);
lhb (5 .. 6) := Intel_bf (header.needed_extract_version);
lhb (7 .. 8) := Intel_bf (header.bit_flag);
lhb (9 .. 10) := Intel_bf (header.zip_type);
lhb (11 .. 14) := Intel_bf (Zip_Streams.Calendar.Convert (header.file_timedate));
lhb (15 .. 18) := Intel_bf (header.dd.crc_32);
lhb (19 .. 22) := Intel_bf (header.dd.compressed_size);
lhb (23 .. 26) := Intel_bf (header.dd.uncompressed_size);
lhb (27 .. 28) := Intel_bf (header.filename_length);
lhb (29 .. 30) := Intel_bf (header.extra_field_length);
BlockWrite (stream.all, lhb);
end Write;
-------------------------------------------
-- PKZIP end - of - central - directory - PK56 --
-------------------------------------------
procedure Copy_and_check (buffer : Byte_Buffer;
the_end : out End_of_Central_Dir) is
begin
if not PK_signature (buffer, 5) then
raise bad_end;
end if;
the_end :=
(disknum => Intel_nb (buffer (5 .. 6)),
disknum_with_start => Intel_nb (buffer (7 .. 8)),
disk_total_entries => Intel_nb (buffer (9 .. 10)),
total_entries => Intel_nb (buffer (11 .. 12)),
central_dir_size => Intel_nb (buffer (13 .. 16)),
central_dir_offset => Intel_nb (buffer (17 .. 20)),
main_comment_length => Intel_nb (buffer (21 .. 22)),
offset_shifting => 0); -- Assuming single zip archive here
end Copy_and_check;
procedure Read_and_check (stream : Zipstream_Class;
the_end : out End_of_Central_Dir) is
eb : Byte_Buffer (1 .. 22);
begin
BlockRead (stream, eb);
Copy_and_check (eb, the_end);
end Read_and_check;
-- Some explanations - GdM 2001
-- The idea is that the .ZIP can be appended to an .EXE, for
-- self - extracting purposes. So, the most general infos are
-- at the end, and we crawl back for more precise infos:
-- 1) end - of - central directory
-- 2) central directory
-- 3) zipped files
procedure Load (stream : Zipstream_Class;
the_end : out End_of_Central_Dir) is
end_buffer : Byte_Buffer (1 .. 22);
min_end_start : Ada.Streams.Stream_IO.Count;
use Ada.Streams.Stream_IO;
max_comment : constant := 65_535;
begin
-- 20 - Jun - 2001 : abandon search below min_end_start
-- - read about max comment length in appnote
if Size (stream) <= max_comment then
min_end_start := 1;
else
min_end_start := Ada.Streams.Stream_IO.Count (Size (stream)) - max_comment;
end if;
-- Yes, we must _search_ for it .. .
-- because PKWARE put a variable - size comment _after_ it 8 - (
for i in reverse min_end_start .. Ada.Streams.Stream_IO.Count (Size (stream)) - 21 loop
Zip_Streams.Set_Index (stream, Positive (i));
begin
for j in end_buffer'Range loop
Byte'Read (stream, end_buffer (j));
-- 20 - Jun - 2001 : useless to read more if 1st character is not 'P'
if j = end_buffer'First and then
end_buffer (j) /= Character'Pos ('P')
then
raise bad_end;
end if;
end loop;
Copy_and_check (end_buffer, the_end);
-- at this point, the buffer was successfully read
-- (no exception raised).
the_end.offset_shifting :=
-- This is the real position of the end - of - central - directory block.
Unsigned_32 (Zip_Streams.Index (stream) - 22)
-
-- This is the theoretical position of the end - of - central - directory,
-- block. Should coincide with the real position if the zip file
-- is not appended.
(
1 +
the_end.central_dir_offset +
the_end.central_dir_size
);
return; -- the_end found and filled - > exit
exception
when bad_end =>
if i > min_end_start then
null; -- we will try 1 index before .. .
else
raise; -- definitely no "end - of - central - directory" here
end if;
end;
end loop;
end Load;
procedure Write (stream : Zipstream_Class;
the_end : End_of_Central_Dir) is
eb : Byte_Buffer (1 .. 22);
begin
PK_signature (eb, 5);
eb (5 .. 6) := Intel_bf (the_end.disknum);
eb (7 .. 8) := Intel_bf (the_end.disknum_with_start);
eb (9 .. 10) := Intel_bf (the_end.disk_total_entries);
eb (11 .. 12) := Intel_bf (the_end.total_entries);
eb (13 .. 16) := Intel_bf (the_end.central_dir_size);
eb (17 .. 20) := Intel_bf (the_end.central_dir_offset);
eb (21 .. 22) := Intel_bf (the_end.main_comment_length);
BlockWrite (stream.all, eb);
end Write;
------------------------------------------------------------------
-- PKZIP data descriptor, after streamed compressed data - PK78 --
------------------------------------------------------------------
procedure Copy_and_check (buffer : Byte_Buffer;
the_data_desc : out Data_descriptor) is
begin
if not PK_signature (buffer, 7) then
raise bad_data_descriptor;
end if;
the_data_desc.crc_32 := Intel_nb (buffer (5 .. 8));
the_data_desc.compressed_size := Intel_nb (buffer (9 .. 12));
the_data_desc.uncompressed_size := Intel_nb (buffer (13 .. 16));
end Copy_and_check;
procedure Read_and_check (stream : Zipstream_Class;
the_data_desc : out Data_descriptor) is
ddb : Byte_Buffer (1 .. 16);
begin
BlockRead (stream, ddb);
Copy_and_check (ddb, the_data_desc);
end Read_and_check;
procedure Write (stream : Zipstream_Class;
the_data_desc : Data_descriptor) is
ddb : Byte_Buffer (1 .. 16);
begin
PK_signature (ddb, 7);
ddb (5 .. 8) := Intel_bf (the_data_desc.crc_32);
ddb (9 .. 12) := Intel_bf (the_data_desc.compressed_size);
ddb (13 .. 16) := Intel_bf (the_data_desc.uncompressed_size);
BlockWrite (stream.all, ddb);
end Write;
end Zip.Headers;
|
-- --
-- package Copyright (c) Dmitry A. Kazakov --
-- Generic_Unbounded_Array Luebeck --
-- Interface Spring, 2002 --
-- --
-- Last revision : 13:51 30 May 2014 --
-- --
-- This library is free software; you can redistribute it and/or --
-- modify it under the terms of the GNU General Public License as --
-- published by the Free Software Foundation; either version 2 of --
-- the License, or (at your option) any later version. This library --
-- is distributed in the hope that it will be useful, but WITHOUT --
-- ANY WARRANTY; without even the implied warranty of --
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU --
-- General Public License for more details. You should have --
-- received a copy of the GNU General Public License along with --
-- this library; if not, write to the Free Software Foundation, --
-- Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from --
-- this unit, or you link this unit with other files to produce an --
-- executable, this unit does not by itself cause the resulting --
-- executable to be covered by the GNU General Public License. This --
-- exception does not however invalidate any other reasons why the --
-- executable file might be covered by the GNU Public License. --
--____________________________________________________________________--
--
-- This package defines a generic type Unbounded_Array. An instance of
-- Unbounded_Array is a dynamically expanded vector of elements. The
-- implementation keeps vector contiguous, so it might be very
-- inefficient to put complex data structures into the array. In many
-- cases it is better to put pointers to elements there. See also
-- Generic_Unbounded_Ptr_Array which instantiates Unbounded_Array for
-- this purpose. The type wraps the component Vector which is a pointer
-- to an array of elements. One can use Vector to access array elements
-- and query its present bounds, which are rather arbitrary. The unused
-- elements of the array vector are padded using a distinguished
-- null-element value. The package generic parameters are:
--
-- Index_Type - The array index type
-- Object_Type - The array element type
-- Object_Array_Type - The array type
-- Null_Element - To pad unused array elements
-- Minimal_Size - Minimal additionally allocated size
-- Increment - By which the vector is enlarged if necessary
--
-- The parameter Increment controls array vector size growth. When
-- there is no free space in the vector then it is enlarged by Size *
-- Increment / 100. Here Size is the current vector size. The allocated
-- amount of elements cannot be less than the parameter Minimal_Size
-- specifies. So it will be the initial vector size after the first
-- element is put in.
--
with Ada.Finalization;
generic
type Index_Type is (<>);
type Object_Type is private;
type Object_Array_Type is array (Index_Type range <>) of Object_Type;
Null_Element : Object_Type;
Minimal_Size : Positive := 64;
Increment : Natural := 50;
package Generic_Unbounded_Array is
type Object_Array_Ptr is access Object_Array_Type;
type Unbounded_Array is
new Ada.Finalization.Limited_Controlled with
record
Vector : Object_Array_Ptr := null;
end record;
--
-- Erase -- Delete all array items
--
-- Container - The array
--
-- This procedure makes Container empty.
--
procedure Erase (Container : in out Unbounded_Array);
--
-- Finalize -- Destructor
--
-- Container - The array
--
procedure Finalize (Container : in out Unbounded_Array);
--
-- Fetch -- Get an array element by its index
--
-- Container - The array
-- Index - Of the element
--
-- This function returns the element corresponding to Index. If the
-- container does not have it, the result is Null_Element.
--
-- Returns :
--
-- The element
--
function Fetch
( Container : Unbounded_Array;
Index : Index_Type
) return Object_Type;
--
-- Get -- Get an array element by its index
--
-- Container - The array
-- Index - Of the element
--
-- This an equivalent to Container.Vector (Index). However, subscript
-- checks cannot be suppressed for Get.
--
-- Returns :
--
-- The element
--
-- Exceptions :
--
-- Constraint_Error - Wrong index
--
function Get
( Container : Unbounded_Array;
Index : Index_Type
) return Object_Type;
--
-- Put -- Replace an array element by its index
--
-- Container - The array
-- Index - Of the element
-- Element - To put in
--
-- The array is expanded as necessary.
--
procedure Put
( Container : in out Unbounded_Array;
Index : Index_Type;
Element : Object_Type
);
private
pragma Inline (Fetch);
pragma Inline (Get);
end Generic_Unbounded_Array;
|
package ADMBase.Initial is
procedure create_data;
procedure create_grid;
end ADMBase.Initial;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- A L I --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2010, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING3. If not, go to --
-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package defines the internal data structures used for representation
-- of Ada Library Information (ALI) acquired from the ALI files generated
-- by the front end.
with Casing; use Casing;
with Gnatvsn; use Gnatvsn;
with Namet; use Namet;
with Rident; use Rident;
with Table;
with Types; use Types;
with GNAT.HTable; use GNAT.HTable;
package ALI is
--------------
-- Id Types --
--------------
-- The various entries are stored in tables with distinct subscript ranges.
-- The following type definitions show the ranges used for the subscripts
-- (Id values) for the various tables.
type ALI_Id is range 0 .. 999_999;
-- Id values used for ALIs table entries
type Unit_Id is range 1_000_000 .. 1_999_999;
-- Id values used for Unit table entries
type With_Id is range 2_000_000 .. 2_999_999;
-- Id values used for Withs table entries
type Arg_Id is range 3_000_000 .. 3_999_999;
-- Id values used for argument table entries
type Sdep_Id is range 4_000_000 .. 4_999_999;
-- Id values used for Sdep table entries
type Source_Id is range 5_000_000 .. 5_999_999;
-- Id values used for Source table entries
type Interrupt_State_Id is range 6_000_000 .. 6_999_999;
-- Id values used for Interrupt_State table entries
type Priority_Specific_Dispatching_Id is range 7_000_000 .. 7_999_999;
-- Id values used for Priority_Specific_Dispatching table entries
--------------------
-- ALI File Table --
--------------------
-- Each ALI file read generates an entry in the ALIs table
No_ALI_Id : constant ALI_Id := ALI_Id'First;
-- Special value indicating no ALI entry
First_ALI_Entry : constant ALI_Id := No_ALI_Id + 1;
-- Id of first actual entry in table
type Main_Program_Type is (None, Proc, Func);
-- Indicator of whether unit can be used as main program
type ALIs_Record is record
Afile : File_Name_Type;
-- Name of ALI file
Ofile_Full_Name : File_Name_Type;
-- Full name of object file corresponding to the ALI file
Sfile : File_Name_Type;
-- Name of source file that generates this ALI file (which is equal
-- to the name of the source file in the first unit table entry for
-- this ALI file, since the body if present is always first).
Ver : String (1 .. Ver_Len_Max);
-- Value of library version (V line in ALI file). Not set if
-- V lines are ignored as a result of the Ignore_Lines parameter.
Ver_Len : Natural;
-- Length of characters stored in Ver. Not set if V lines are ignored as
-- a result of the Ignore_Lines parameter.
SAL_Interface : Boolean;
-- Set True when this is an interface to a standalone library
First_Unit : Unit_Id;
-- Id of first Unit table entry for this file
Last_Unit : Unit_Id;
-- Id of last Unit table entry for this file
First_Sdep : Sdep_Id;
-- Id of first Sdep table entry for this file
Last_Sdep : Sdep_Id;
-- Id of last Sdep table entry for this file
Main_Program : Main_Program_Type;
-- Indicator of whether first unit can be used as main program. Not set
-- if 'M' appears in Ignore_Lines.
Main_Priority : Int;
-- Indicates priority value if Main_Program field indicates that this
-- can be a main program. A value of -1 (No_Main_Priority) indicates
-- that no parameter was found, or no M line was present. Not set if
-- 'M' appears in Ignore_Lines.
Main_CPU : Int;
-- Indicates processor if Main_Program field indicates that this can
-- be a main program. A value of -1 (No_Main_CPU) indicates that no C
-- parameter was found, or no M line was present. Not set if 'M' appears
-- in Ignore_Lines.
Time_Slice_Value : Int;
-- Indicates value of time slice parameter from T=xxx on main program
-- line. A value of -1 indicates that no T=xxx parameter was found, or
-- no M line was present. Not set if 'M' appears in Ignore_Lines.
Allocator_In_Body : Boolean;
-- Set True if an AB switch appears on the main program line. False
-- if no M line, or AB not present, or 'M appears in Ignore_Lines.
WC_Encoding : Character;
-- Wide character encoding if main procedure. Otherwise not relevant.
-- Not set if 'M' appears in Ignore_Lines.
Locking_Policy : Character;
-- Indicates locking policy for units in this file. Space means tasking
-- was not used, or that no Locking_Policy pragma was present or that
-- this is a language defined unit. Otherwise set to first character
-- (upper case) of policy name. Not set if 'P' appears in Ignore_Lines.
Queuing_Policy : Character;
-- Indicates queuing policy for units in this file. Space means tasking
-- was not used, or that no Queuing_Policy pragma was present or that
-- this is a language defined unit. Otherwise set to first character
-- (upper case) of policy name. Not set if 'P' appears in Ignore_Lines.
Task_Dispatching_Policy : Character;
-- Indicates task dispatching policy for units in this file. Space means
-- tasking was not used, or that no Task_Dispatching_Policy pragma was
-- present or that this is a language defined unit. Otherwise set to
-- first character (upper case) of policy name. Not set if 'P' appears
-- in Ignore_Lines.
Compile_Errors : Boolean;
-- Set to True if compile errors for unit. Note that No_Object will
-- always be set as well in this case. Not set if 'P' appears in
-- Ignore_Lines.
Float_Format : Character;
-- Set to float format (set to I if no float-format given). Not set if
-- 'P' appears in Ignore_Lines.
No_Object : Boolean;
-- Set to True if no object file generated. Not set if 'P' appears in
-- Ignore_Lines.
Normalize_Scalars : Boolean;
-- Set to True if file was compiled with Normalize_Scalars. Not set if
-- 'P' appears in Ignore_Lines.
Unit_Exception_Table : Boolean;
-- Set to True if unit exception table pointer generated. Not set if 'P'
-- appears in Ignore_Lines.
Zero_Cost_Exceptions : Boolean;
-- Set to True if file was compiled with zero cost exceptions. Not set
-- if 'P' appears in Ignore_Lines.
Restrictions : Restrictions_Info;
-- Restrictions information reconstructed from R lines
First_Interrupt_State : Interrupt_State_Id;
Last_Interrupt_State : Interrupt_State_Id'Base;
-- These point to the first and last entries in the interrupt state
-- table for this unit. If no entries, then Last_Interrupt_State =
-- First_Interrupt_State - 1 (that's why the 'Base reference is there,
-- it can be one less than the lower bound of the subtype). Not set if
-- 'I' appears in Ignore_Lines
First_Specific_Dispatching : Priority_Specific_Dispatching_Id;
Last_Specific_Dispatching : Priority_Specific_Dispatching_Id'Base;
-- These point to the first and last entries in the priority specific
-- dispatching table for this unit. If there are no entries, then
-- Last_Specific_Dispatching = First_Specific_Dispatching - 1. That
-- is why the 'Base reference is there, it can be one less than the
-- lower bound of the subtype. Not set if 'S' appears in Ignore_Lines.
end record;
No_Main_Priority : constant Int := -1;
-- Code for no main priority set
No_Main_CPU : constant Int := -1;
-- Code for no main cpu set
package ALIs is new Table.Table (
Table_Component_Type => ALIs_Record,
Table_Index_Type => ALI_Id,
Table_Low_Bound => First_ALI_Entry,
Table_Initial => 500,
Table_Increment => 200,
Table_Name => "ALIs");
----------------
-- Unit Table --
----------------
-- Each unit within an ALI file generates an entry in the unit table
No_Unit_Id : constant Unit_Id := Unit_Id'First;
-- Special value indicating no unit table entry
First_Unit_Entry : constant Unit_Id := No_Unit_Id + 1;
-- Id of first actual entry in table
type Unit_Type is (Is_Spec, Is_Body, Is_Spec_Only, Is_Body_Only);
-- Indicates type of entry, if both body and spec appear in the ALI file,
-- then the first unit is marked Is_Body, and the second is marked Is_Spec.
-- If only a spec appears, then it is marked as Is_Spec_Only, and if only
-- a body appears, then it is marked Is_Body_Only).
subtype Version_String is String (1 .. 8);
-- Version string, taken from unit record
type Unit_Record is record
My_ALI : ALI_Id;
-- Corresponding ALI entry
Uname : Unit_Name_Type;
-- Name of Unit
Sfile : File_Name_Type;
-- Name of source file
Preelab : Boolean;
-- Indicates presence of PR parameter for a preelaborated package
No_Elab : Boolean;
-- Indicates presence of NE parameter for a unit that has does not
-- have an elaboration routine (since it has no elaboration code).
Pure : Boolean;
-- Indicates presence of PU parameter for a package having pragma Pure
Dynamic_Elab : Boolean;
-- Set to True if the unit was compiled with dynamic elaboration checks
-- (i.e. either -gnatE or pragma Elaboration_Checks (RM) was used to
-- compile the unit).
Elaborate_Body : Boolean;
-- Indicates presence of EB parameter for a package which has a pragma
-- Elaborate_Body, and also for generic package instantiations.
Set_Elab_Entity : Boolean;
-- Indicates presence of EE parameter for a unit which has an
-- elaboration entity which must be set true as part of the
-- elaboration of the entity.
Has_RACW : Boolean;
-- Indicates presence of RA parameter for a package that declares at
-- least one Remote Access to Class_Wide (RACW) object.
Remote_Types : Boolean;
-- Indicates presence of RT parameter for a package which has a
-- pragma Remote_Types.
Shared_Passive : Boolean;
-- Indicates presence of SP parameter for a package which has a pragma
-- Shared_Passive.
RCI : Boolean;
-- Indicates presence of RC parameter for a package which has a pragma
-- Remote_Call_Interface.
Predefined : Boolean;
-- Indicates if unit is language predefined (or a child of such a unit)
Internal : Boolean;
-- Indicates if unit is an internal unit (or a child of such a unit)
First_With : With_Id;
-- Id of first withs table entry for this file
Last_With : With_Id;
-- Id of last withs table entry for this file
First_Arg : Arg_Id;
-- Id of first args table entry for this file
Last_Arg : Arg_Id;
-- Id of last args table entry for this file
Utype : Unit_Type;
-- Type of entry
Is_Generic : Boolean;
-- True for generic unit (i.e. a generic declaration, or a generic
-- body). False for a non-generic unit.
Unit_Kind : Character;
-- Indicates the nature of the unit. 'p' for Packages and 's' for
-- subprograms.
Version : Version_String;
-- Version of unit
Icasing : Casing_Type;
-- Indicates casing of identifiers in source file for this unit. This
-- is used for informational output, and also for constructing the main
-- unit if it is being built in Ada.
Kcasing : Casing_Type;
-- Indicates casing of keywords in source file for this unit. This is
-- used for informational output, and also for constructing the main
-- unit if it is being built in Ada.
Elab_Position : aliased Natural;
-- Initialized to zero. Set non-zero when a unit is chosen and
-- placed in the elaboration order. The value represents the
-- ordinal position in the elaboration order.
Init_Scalars : Boolean;
-- Set True if IS qualifier appears in ALI file, indicating that
-- an Initialize_Scalars pragma applies to the unit.
SAL_Interface : Boolean;
-- Set True when this is an interface to a standalone library
Directly_Scanned : Boolean;
-- True iff it is a unit from an ALI file specified to gnatbind
Body_Needed_For_SAL : Boolean;
-- Indicates that the source for the body of the unit (subprogram,
-- package, or generic unit) must be included in a standalone library.
Elaborate_Body_Desirable : Boolean;
-- Indicates that the front end elaboration circuitry decided that it
-- would be a good idea if this package had Elaborate_Body. The binder
-- will attempt, but does not promise, to place the elaboration call
-- for the body right after the call for the spec, or at least as close
-- together as possible.
Optimize_Alignment : Character;
-- Optimize_Alignment setting. Set to L/S/T/O for OL/OS/OT/OO present
end record;
package Units is new Table.Table (
Table_Component_Type => Unit_Record,
Table_Index_Type => Unit_Id,
Table_Low_Bound => First_Unit_Entry,
Table_Initial => 100,
Table_Increment => 200,
Table_Name => "Unit");
---------------------------
-- Interrupt State Table --
---------------------------
-- An entry is made in this table for each I (interrupt state) line
-- encountered in the input ALI file. The First/Last_Interrupt_Id
-- fields of the ALI file entry show the range of entries defined
-- within a particular ALI file.
type Interrupt_State_Record is record
Interrupt_Id : Nat;
-- Id from interrupt state entry
Interrupt_State : Character;
-- State from interrupt state entry ('u'/'r'/'s')
IS_Pragma_Line : Nat;
-- Line number of Interrupt_State pragma
end record;
package Interrupt_States is new Table.Table (
Table_Component_Type => Interrupt_State_Record,
Table_Index_Type => Interrupt_State_Id'Base,
Table_Low_Bound => Interrupt_State_Id'First,
Table_Initial => 100,
Table_Increment => 200,
Table_Name => "Interrupt_States");
-----------------------------------------
-- Priority Specific Dispatching Table --
-----------------------------------------
-- An entry is made in this table for each S (priority specific
-- dispatching) line encountered in the input ALI file. The
-- First/Last_Specific_Dispatching_Id fields of the ALI file
-- entry show the range of entries defined within a particular
-- ALI file.
type Specific_Dispatching_Record is record
Dispatching_Policy : Character;
-- First character (upper case) of the corresponding policy name
First_Priority : Nat;
-- Lower bound of the priority range to which the specified dispatching
-- policy applies.
Last_Priority : Nat;
-- Upper bound of the priority range to which the specified dispatching
-- policy applies.
PSD_Pragma_Line : Nat;
-- Line number of Priority_Specific_Dispatching pragma
end record;
package Specific_Dispatching is new Table.Table (
Table_Component_Type => Specific_Dispatching_Record,
Table_Index_Type => Priority_Specific_Dispatching_Id'Base,
Table_Low_Bound => Priority_Specific_Dispatching_Id'First,
Table_Initial => 100,
Table_Increment => 200,
Table_Name => "Priority_Specific_Dispatching");
--------------
-- Switches --
--------------
-- These switches record status information about ali files that
-- have been read, for quick reference without searching tables.
-- Note: a switch will be left set at its default value if the line
-- which might otherwise set it is ignored (from Ignore_Lines).
Dynamic_Elaboration_Checks_Specified : Boolean := False;
-- Set to False by Initialize_ALI. Set to True if Scan_ALI reads
-- a unit for which dynamic elaboration checking is enabled.
Float_Format_Specified : Character := ' ';
-- Set to blank by Initialize_ALI. Set to appropriate float format
-- character (V or I, see Opt.Float_Format) if an ali file that
-- is read contains an F line setting the floating point format.
Initialize_Scalars_Used : Boolean := False;
-- Set True if an ali file contains the Initialize_Scalars flag
Locking_Policy_Specified : Character := ' ';
-- Set to blank by Initialize_ALI. Set to the appropriate locking policy
-- character if an ali file contains a P line setting the locking policy.
No_Normalize_Scalars_Specified : Boolean := False;
-- Set to False by Initialize_ALI. Set to True if an ali file indicates
-- that the file was compiled without normalize scalars.
No_Object_Specified : Boolean := False;
-- Set to False by Initialize_ALI. Set to True if an ali file contains
-- the No_Object flag.
Normalize_Scalars_Specified : Boolean := False;
-- Set to False by Initialize_ALI. Set to True if an ali file indicates
-- that the file was compiled in Normalize_Scalars mode.
Queuing_Policy_Specified : Character := ' ';
-- Set to blank by Initialize_ALI. Set to the appropriate queuing policy
-- character if an ali file contains a P line setting the queuing policy.
Cumulative_Restrictions : Restrictions_Info := No_Restrictions;
-- This variable records the cumulative contributions of R lines in all
-- ali files, showing whether a restriction pragma exists anywhere, and
-- accumulating the aggregate knowledge of violations.
Stack_Check_Switch_Set : Boolean := False;
-- Set to True if at least one ALI file contains '-fstack-check' in its
-- argument list.
Static_Elaboration_Model_Used : Boolean := False;
-- Set to False by Initialize_ALI. Set to True if any ALI file for a
-- non-internal unit compiled with the static elaboration model is
-- encountered.
Task_Dispatching_Policy_Specified : Character := ' ';
-- Set to blank by Initialize_ALI. Set to the appropriate task dispatching
-- policy character if an ali file contains a P line setting the
-- task dispatching policy.
Unreserve_All_Interrupts_Specified : Boolean := False;
-- Set to False by Initialize_ALI. Set to True if an ali file is read that
-- has P line specifying unreserve all interrupts mode.
Zero_Cost_Exceptions_Specified : Boolean := False;
-- Set to False by Initialize_ALI. Set to True if an ali file is read that
-- has a P line specifying the generation of zero cost exceptions.
-----------------
-- Withs Table --
-----------------
-- Each With line (W line) in an ALI file generates a Withs table entry
-- Note: there will be no entries in this table if 'W' lines are ignored
No_With_Id : constant With_Id := With_Id'First;
-- Special value indicating no withs table entry
First_With_Entry : constant With_Id := No_With_Id + 1;
-- Id of first actual entry in table
type With_Record is record
Uname : Unit_Name_Type;
-- Name of Unit
Sfile : File_Name_Type;
-- Name of source file, set to No_File in generic case
Afile : File_Name_Type;
-- Name of ALI file, set to No_File in generic case
Elaborate : Boolean;
-- Indicates presence of E parameter
Elaborate_All : Boolean;
-- Indicates presence of EA parameter
Elab_All_Desirable : Boolean;
-- Indicates presence of AD parameter
Elab_Desirable : Boolean;
-- Indicates presence of ED parameter
SAL_Interface : Boolean := False;
-- True if the Unit is an Interface of a Stand-Alone Library
Limited_With : Boolean := False;
-- True if unit is named in a limited_with_clause
end record;
package Withs is new Table.Table (
Table_Component_Type => With_Record,
Table_Index_Type => With_Id,
Table_Low_Bound => First_With_Entry,
Table_Initial => 5000,
Table_Increment => 200,
Table_Name => "Withs");
---------------------
-- Arguments Table --
---------------------
-- Each Arg line (A line) in an ALI file generates an Args table entry
-- Note: there will be no entries in this table if 'A' lines are ignored
No_Arg_Id : constant Arg_Id := Arg_Id'First;
-- Special value indicating no args table entry
First_Arg_Entry : constant Arg_Id := No_Arg_Id + 1;
-- Id of first actual entry in table
package Args is new Table.Table (
Table_Component_Type => String_Ptr,
Table_Index_Type => Arg_Id,
Table_Low_Bound => First_Arg_Entry,
Table_Initial => 1000,
Table_Increment => 100,
Table_Name => "Args");
--------------------------
-- Linker_Options Table --
--------------------------
-- If an ALI file has one of more Linker_Options lines, then a single
-- entry is made in this table. If more than one Linker_Options lines
-- appears in a given ALI file, then the arguments are concatenated
-- to form the entry in this table, using a NUL character as the
-- separator, and a final NUL character is appended to the end.
-- Note: there will be no entries in this table if 'L' lines are ignored
type Linker_Option_Record is record
Name : Name_Id;
-- Name entry containing concatenated list of Linker_Options
-- arguments separated by NUL and ended by NUL as described above.
Unit : Unit_Id;
-- Unit_Id for the entry
Internal_File : Boolean;
-- Set True if the linker options are from an internal file. This is
-- used to insert certain standard entries after all the user entries
-- but before the entries from the run-time.
Original_Pos : Positive;
-- Keep track of original position in the linker options table. This
-- is used to implement a stable sort when we sort the linker options
-- table.
end record;
-- The indexes of active entries in this table range from 1 to the
-- value of Linker_Options.Last. The zero'th element is for sort call.
package Linker_Options is new Table.Table (
Table_Component_Type => Linker_Option_Record,
Table_Index_Type => Integer,
Table_Low_Bound => 0,
Table_Initial => 200,
Table_Increment => 400,
Table_Name => "Linker_Options");
-----------------
-- Notes Table --
-----------------
-- The notes table records entries from N lines
type Notes_Record is record
Pragma_Type : Character;
-- 'A', 'C', 'I', 'S', 'T' for Annotate/Comment/Ident/Subtitle/Title
Pragma_Line : Nat;
-- Line number of pragma
Pragma_Col : Nat;
-- Column number of pragma
Unit : Unit_Id;
-- Unit_Id for the entry
Pragma_Args : Name_Id;
-- Pragma arguments. No_Name if no arguments, otherwise a single
-- name table entry consisting of all the characters on the notes
-- line from the first non-blank character following the source
-- location to the last character on the line.
end record;
-- The indexes of active entries in this table range from 1 to the
-- value of Linker_Options.Last. The zero'th element is for convenience
-- if the table needs to be sorted.
package Notes is new Table.Table (
Table_Component_Type => Notes_Record,
Table_Index_Type => Integer,
Table_Low_Bound => 0,
Table_Initial => 200,
Table_Increment => 400,
Table_Name => "Notes");
-------------------------------------------
-- External Version Reference Hash Table --
-------------------------------------------
-- This hash table keeps track of external version reference strings
-- as read from E lines in the ali file. The stored values do not
-- include the terminating quote characters.
-- Note: there will be no entries in this table if 'E' lines are ignored
type Vindex is range 0 .. 98;
-- Type to define range of headers
function SHash (S : String_Ptr) return Vindex;
-- Hash function for this table
function SEq (F1, F2 : String_Ptr) return Boolean;
-- Equality function for this table
package Version_Ref is new Simple_HTable (
Header_Num => Vindex,
Element => Boolean,
No_Element => False,
Key => String_Ptr,
Hash => SHash,
Equal => SEq);
-------------------------
-- No_Dependency Table --
-------------------------
-- Each R line for a No_Dependency Restriction generates an entry in
-- this No_Dependency table.
type No_Dep_Record is record
ALI_File : ALI_Id;
-- ALI File containing the entry
No_Dep_Unit : Name_Id;
-- Id for names table entry including entire name, including periods
end record;
package No_Deps is new Table.Table (
Table_Component_Type => No_Dep_Record,
Table_Index_Type => Integer,
Table_Low_Bound => 0,
Table_Initial => 200,
Table_Increment => 400,
Table_Name => "No_Deps");
------------------------------------
-- Sdep (Source Dependency) Table --
------------------------------------
-- Each source dependency (D line) in an ALI file generates an entry in the
-- Sdep table.
-- Note: there will be no entries in this table if 'D' lines are ignored
No_Sdep_Id : constant Sdep_Id := Sdep_Id'First;
-- Special value indicating no Sdep table entry
First_Sdep_Entry : Sdep_Id := No_Sdep_Id + 1;
-- Id of first Sdep entry for current ali file. This is initialized to the
-- first Sdep entry in the table, and then incremented appropriately as
-- successive ALI files are scanned.
type Sdep_Record is record
Sfile : File_Name_Type;
-- Name of source file
Stamp : Time_Stamp_Type;
-- Time stamp value. Note that this will be all zero characters for the
-- dummy entries for missing or non-dependent files.
Checksum : Word;
-- Checksum value. Note that this will be all zero characters for the
-- dummy entries for missing or non-dependent files
Dummy_Entry : Boolean;
-- Set True for dummy entries that correspond to missing files or files
-- where no dependency relationship exists.
Subunit_Name : Name_Id;
-- Name_Id for subunit name if present, else No_Name
Rfile : File_Name_Type;
-- Reference file name. Same as Sfile unless a Source_Reference pragma
-- was used, in which case it reflects the name used in the pragma.
Start_Line : Nat;
-- Starting line number in file. Always 1, unless a Source_Reference
-- pragma was used, in which case it reflects the line number value
-- given in the pragma.
end record;
package Sdep is new Table.Table (
Table_Component_Type => Sdep_Record,
Table_Index_Type => Sdep_Id,
Table_Low_Bound => First_Sdep_Entry,
Table_Initial => 5000,
Table_Increment => 200,
Table_Name => "Sdep");
----------------------------
-- Use of Name Table Info --
----------------------------
-- All unit names and file names are entered into the Names table. The Info
-- fields of these entries are used as follows:
-- Unit name Info field has Unit_Id of unit table entry
-- ALI file name Info field has ALI_Id of ALI table entry
-- Source file name Info field has Source_Id of source table entry
--------------------------
-- Cross-Reference Data --
--------------------------
-- The following table records cross-reference sections, there is one entry
-- for each X header line in the ALI file for an xref section.
-- Note: there will be no entries in this table if 'X' lines are ignored
type Xref_Section_Record is record
File_Num : Sdep_Id;
-- Dependency number for file (entry in Sdep.Table)
File_Name : File_Name_Type;
-- Name of file
First_Entity : Nat;
-- First entry in Xref_Entity table
Last_Entity : Nat;
-- Last entry in Xref_Entity table
end record;
package Xref_Section is new Table.Table (
Table_Component_Type => Xref_Section_Record,
Table_Index_Type => Nat,
Table_Low_Bound => 1,
Table_Initial => 50,
Table_Increment => 300,
Table_Name => "Xref_Section");
-- The following is used to indicate whether a typeref field is present
-- for the entity, and if so what kind of typeref field.
type Tref_Kind is (
Tref_None, -- No typeref present
Tref_Access, -- Access type typeref (points to designated type)
Tref_Derived, -- Derived type typeref (points to parent type)
Tref_Type); -- All other cases
type Visibility_Kind is
(Global, -- Library level entity
Static, -- Static C/C++ entity
Other); -- Local and other entity
-- The following table records entities for which xrefs are recorded
type Xref_Entity_Record is record
Line : Pos;
-- Line number of definition
Etype : Character;
-- Set to the identification character for the entity. See section
-- "Cross-Reference Entity Identifiers" in lib-xref.ads for details.
Col : Pos;
-- Column number of definition
Visibility : Visibility_Kind;
-- Visibility of entity
Entity : Name_Id;
-- Name of entity
Iref_File_Num : Sdep_Id;
-- This field is set to the dependency reference for the file containing
-- the generic entity that this one instantiates, or to No_Sdep_Id if
-- the current entity is not an instantiation
Iref_Line : Nat;
-- This field is set to the line number in Iref_File_Num of the generic
-- entity that this one instantiates, or to zero if the current entity
-- is not an instantiation.
Rref_Line : Nat;
-- This field is set to the line number of a renaming reference if
-- one is present, or to zero if no renaming reference is present
Rref_Col : Nat;
-- This field is set to the column number of a renaming reference
-- if one is present, or to zero if no renaming reference is present.
Tref : Tref_Kind;
-- Indicates if a typeref is present, and if so what kind. Set to
-- Tref_None if no typeref field is present.
Tref_File_Num : Sdep_Id;
-- This field is set to No_Sdep_Id if no typeref is present, or
-- if the typeref refers to an entity in standard. Otherwise it
-- it is the dependency reference for the file containing the
-- declaration of the typeref entity.
Tref_Line : Nat;
-- This field is set to zero if no typeref is present, or if the
-- typeref refers to an entity in standard. Otherwise it contains
-- the line number of the declaration of the typeref entity.
Tref_Type : Character;
-- This field is set to blank if no typeref is present, or if the
-- typeref refers to an entity in standard. Otherwise it contains
-- the identification character for the typeref entity. See section
-- "Cross-Reference Entity Identifiers" in lib-xref.ads for details.
Tref_Col : Nat;
-- This field is set to zero if no typeref is present, or if the
-- typeref refers to an entity in standard. Otherwise it contains
-- the column number of the declaration of the parent type.
Tref_Standard_Entity : Name_Id;
-- This field is set to No_Name if no typeref is present or if the
-- typeref refers to a declared entity rather than an entity in
-- package Standard. If there is a typeref that references an
-- entity in package Standard, then this field is a Name_Id
-- reference for the entity name.
Oref_File_Num : Sdep_Id;
-- This field is set to No_Sdep_Id if the entity doesn't override any
-- other entity, or to the dependency reference for the overridden
-- entity.
Oref_Line : Nat;
Oref_Col : Nat;
-- These two fields are set to the line and column of the overridden
-- entity.
First_Xref : Nat;
-- Index into Xref table of first cross-reference
Last_Xref : Nat;
-- Index into Xref table of last cross-reference. The value in
-- Last_Xref can be less than the First_Xref value to indicate
-- that no entries are present in the Xref Table.
end record;
package Xref_Entity is new Table.Table (
Table_Component_Type => Xref_Entity_Record,
Table_Index_Type => Nat,
Table_Low_Bound => 1,
Table_Initial => 500,
Table_Increment => 300,
Table_Name => "Xref_Entity");
Array_Index_Reference : constant Character := '*';
Interface_Reference : constant Character := 'I';
-- Some special types of references. In the ALI file itself, these
-- are output as attributes of the entity, not as references, but
-- there is no provision in Xref_Entity_Record for storing multiple
-- such references.
-- The following table records actual cross-references
type Xref_Record is record
File_Num : Sdep_Id;
-- Set to the file dependency number for the cross-reference. Note
-- that if no file entry is present explicitly, this is just a copy
-- of the reference for the current cross-reference section.
Line : Nat;
-- Line number for the reference. This is zero when referencing a
-- predefined entity, but in this case Name is set.
Rtype : Character;
-- Indicates type of reference, using code used in ALI file:
-- r = reference
-- m = modification
-- b = body entity
-- c = completion of private or incomplete type
-- x = type extension
-- i = implicit reference
-- Array_Index_Reference = reference to the index of an array
-- Interface_Reference = reference to an interface implemented
-- by the type
-- See description in lib-xref.ads for further details
Col : Nat;
-- Column number for the reference
Name : Name_Id := No_Name;
-- This is only used when referencing a predefined entity. Currently,
-- this only occurs for array indexes.
-- Note: for instantiation references, Rtype is set to ' ', and Col is
-- set to zero. One or more such entries can follow any other reference.
-- When there is more than one such entry, this is to be read as:
-- e.g. ref1 ref2 ref3
-- ref1 is a reference to an entity that was instantied at ref2.
-- ref2 itself is also the result of an instantiation, that took
-- place at ref3
end record;
package Xref is new Table.Table (
Table_Component_Type => Xref_Record,
Table_Index_Type => Nat,
Table_Low_Bound => 1,
Table_Initial => 2000,
Table_Increment => 300,
Table_Name => "Xref");
--------------------------------------
-- Subprograms for Reading ALI File --
--------------------------------------
procedure Initialize_ALI;
-- Initialize the ALI tables. Also resets all switch values to defaults
function Scan_ALI
(F : File_Name_Type;
T : Text_Buffer_Ptr;
Ignore_ED : Boolean;
Err : Boolean;
Read_Xref : Boolean := False;
Read_Lines : String := "";
Ignore_Lines : String := "X";
Ignore_Errors : Boolean := False;
Directly_Scanned : Boolean := False) return ALI_Id;
-- Given the text, T, of an ALI file, F, scan and store the information
-- from the file, and return the Id of the resulting entry in the ALI
-- table. Switch settings may be modified as described above in the
-- switch description settings.
--
-- Ignore_ED is normally False. If set to True, it indicates that
-- all AD/ED (elaboration desirable) indications in the ALI file are
-- to be ignored. This parameter is obsolete now that the -f switch
-- is removed from gnatbind, and should be removed ???
--
-- Err determines the action taken on an incorrectly formatted file.
-- If Err is False, then an error message is output, and the program
-- is terminated. If Err is True, then no error message is output,
-- and No_ALI_Id is returned.
--
-- Ignore_Lines requests that Scan_ALI ignore any lines that start
-- with any given key character. The default value of X causes all
-- Xref lines to be ignored. The corresponding data in the ALI
-- tables will not be filled in this case. It is not possible
-- to ignore U (unit) lines, they are always read.
--
-- Read_Lines requests that Scan_ALI process only lines that start
-- with one of the given characters. The corresponding data in the
-- ALI file for any characters not given in the list will not be
-- set. The default value of the null string indicates that all
-- lines should be read (unless Ignore_Lines is specified). U
-- (unit) lines are always read regardless of the value of this
-- parameter.
--
-- Note: either Ignore_Lines or Read_Lines should be non-null, but not
-- both. If both are provided then only the Read_Lines value is used,
-- and the Ignore_Lines parameter is ignored.
--
-- Read_XREF is set True to read and acquire the cross-reference
-- information. If Read_XREF is set to True, then the effect is to ignore
-- all lines other than U, W, D and X lines and the Ignore_Lines and
-- Read_Lines parameters are ignored (i.e. the use of True for Read_XREF
-- is equivalent to specifying an argument of "UWDX" for Read_Lines.
--
-- Ignore_Errors is normally False. If it is set True, then Scan_ALI
-- will do its best to scan through a file and extract all information
-- it can, even if there are errors. In this case Err is only set if
-- Scan_ALI was completely unable to process the file (e.g. it did not
-- look like an ALI file at all). Ignore_Errors is intended to improve
-- the downward compatibility of new compilers with old tools.
--
-- Directly_Scanned is normally False. If it is set to True, then the
-- units (spec and/or body) corresponding to the ALI file are marked as
-- such. It is used to decide for what units gnatbind should generate
-- the symbols corresponding to 'Version or 'Body_Version in
-- Stand-Alone Libraries.
end ALI;
|
-- Copyright 2016-2021 Bartek thindil Jasicki
--
-- This file is part of Steam Sky.
--
-- Steam Sky is free software: you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation, either version 3 of the License, or
-- (at your option) any later version.
--
-- Steam Sky is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with Steam Sky. If not, see <http://www.gnu.org/licenses/>.
with Ada.Numerics.Elementary_Functions; use Ada.Numerics.Elementary_Functions;
with Messages; use Messages;
with Ships.Crew; use Ships.Crew;
with Events; use Events;
with Utils; use Utils;
with Goals; use Goals;
with Crafts; use Crafts;
with Config; use Config;
with BasesTypes; use BasesTypes;
with Maps; use Maps;
with Mobs; use Mobs;
package body Bases is
procedure Gain_Rep(Base_Index: Bases_Range; Points: Integer) is
New_Points: Integer;
begin
if Sky_Bases(Base_Index).Reputation(1) = -100 or
Sky_Bases(Base_Index).Reputation(1) = 100 then
return;
end if;
New_Points :=
Sky_Bases(Base_Index).Reputation(2) +
Integer(Float(Points) * Float(New_Game_Settings.Reputation_Bonus));
if Base_Index = Player_Ship.Home_Base then
New_Points := New_Points + Points;
end if;
Reduce_Reputation_Loop :
while New_Points < 0 loop
Sky_Bases(Base_Index).Reputation(1) :=
Sky_Bases(Base_Index).Reputation(1) - 1;
New_Points :=
New_Points + abs (Sky_Bases(Base_Index).Reputation(1) * 5);
if New_Points >= 0 then
Sky_Bases(Base_Index).Reputation(2) := New_Points;
return;
end if;
end loop Reduce_Reputation_Loop;
Raise_Reputation_Loop :
while New_Points > abs (Sky_Bases(Base_Index).Reputation(1) * 5) loop
New_Points :=
New_Points - abs (Sky_Bases(Base_Index).Reputation(1) * 5);
Sky_Bases(Base_Index).Reputation(1) :=
Sky_Bases(Base_Index).Reputation(1) + 1;
end loop Raise_Reputation_Loop;
Sky_Bases(Base_Index).Reputation(2) := New_Points;
if Sky_Bases(Base_Index).Reputation(1) = 100 then
UpdateGoal
(GType => REPUTATION, TargetIndex => Sky_Bases(Base_Index).Owner);
end if;
end Gain_Rep;
procedure Count_Price
(Price: in out Natural; Trader_Index: Crew_Container.Extended_Index;
Reduce: Boolean := True) is
Bonus: Integer := 0;
begin
if Price = 0 then
return;
end if;
if Trader_Index /= Crew_Container.No_Index then
Bonus :=
Integer
(Float'Floor
(Float(Price) *
(Float
(GetSkillLevel
(Member => Player_Ship.Crew(Trader_Index),
SkillIndex => Talking_Skill)) /
200.0)));
end if;
if SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).BaseIndex > 0 then
case Sky_Bases(SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).BaseIndex)
.Reputation
(1) is
when -24 .. -1 =>
Bonus := Bonus - Integer(Float'Floor(Float(Price) * 0.05));
when 26 .. 50 =>
Bonus := Bonus + Integer(Float'Floor(Float(Price) * 0.05));
when 51 .. 75 =>
Bonus := Bonus + Integer(Float'Floor(Float(Price) * 0.1));
when 76 .. 100 =>
Bonus := Bonus + Integer(Float'Floor(Float(Price) * 0.15));
when others =>
null;
end case;
end if;
if Bonus < 0 then
Bonus := 0;
end if;
if Reduce then
if Bonus >= Price then
Bonus := Price - 1;
end if;
Price := Price - Bonus;
else
Price := Price + Bonus;
end if;
end Count_Price;
function Generate_Base_Name
(Faction_Index: Unbounded_String) return Unbounded_String is
New_Name: Unbounded_String := Null_Unbounded_String;
begin
if Factions_List(Faction_Index).NamesType = ROBOTIC then
return Generate_Robotic_Name;
end if;
if Get_Random(Min => 1, Max => 100) < 16 then
New_Name :=
Base_Syllables_Pre
(Get_Random
(Min => Base_Syllables_Pre.First_Index,
Max => Base_Syllables_Pre.Last_Index)) &
" ";
end if;
New_Name :=
New_Name &
Base_Syllables_Start
(Get_Random
(Min => Base_Syllables_Start.First_Index,
Max => Base_Syllables_Start.Last_Index)) &
Base_Syllables_End
(Get_Random
(Min => Base_Syllables_End.First_Index,
Max => Base_Syllables_End.Last_Index));
if Get_Random(Min => 1, Max => 100) < 16 then
New_Name :=
New_Name & " " &
Base_Syllables_Post
(Get_Random
(Min => Base_Syllables_Post.First_Index,
Max => Base_Syllables_Post.Last_Index));
end if;
return New_Name;
end Generate_Base_Name;
procedure Generate_Recruits is
Base_Index: constant Bases_Range :=
SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).BaseIndex;
Recruit_Base: Bases_Range;
Base_Recruits: Recruit_Container.Vector;
Skills: Skills_Container.Vector;
Gender: Character;
Price, Payment: Natural;
Skill_Index: Integer range -1 .. Integer'Last;
Attributes: Mob_Attributes(1 .. Attributes_Amount);
Inventory, Temp_Tools: UnboundedString_Container.Vector;
Equipment: Equipment_Array;
Max_Skill_Level: Integer range -100 .. 100;
Skill_Level, Highest_Level: Skill_Range;
Recruit_Faction: Unbounded_String;
Max_Recruits, Recruits_Amount: Positive range 1 .. 30;
Local_Skills_Amount, Skill_Number, Highest_Skill: Skills_Amount_Range :=
1;
Max_Skill_Amount: Integer;
procedure Add_Inventory
(Items_Indexes: UnboundedString_Container.Vector;
Equip_Index: Positive) is
Item_Index: Unbounded_String;
begin
if Get_Random(Min => 1, Max => 100) > 80 then
return;
end if;
Item_Index :=
GetRandomItem
(ItemsIndexes => Items_Indexes, EquipIndex => Equip_Index,
HighestLevel => Highest_Level,
WeaponSkillLevel => Skills(1).Level,
FactionIndex => Recruit_Faction);
if Item_Index = Null_Unbounded_String then
return;
end if;
Inventory.Append(New_Item => Item_Index);
Equipment(Equip_Index) := Inventory.Last_Index;
Price :=
Price +
Get_Price
(Base_Type => Sky_Bases(Base_Index).Base_Type,
Item_Index => Item_Index);
Payment :=
Payment +
(Get_Price
(Base_Type => Sky_Bases(Base_Index).Base_Type,
Item_Index => Item_Index) /
10);
end Add_Inventory;
begin
if Days_Difference
(Date_To_Compare => Sky_Bases(Base_Index).Recruit_Date) <
30 or
Sky_Bases(Base_Index).Population = 0 then
return;
end if;
Max_Recruits :=
(if Sky_Bases(Base_Index).Population < 150 then 5
elsif Sky_Bases(Base_Index).Population < 300 then 10 else 15);
if Bases_Types_List(Sky_Bases(Base_Index).Base_Type).Flags.Contains
(Item => To_Unbounded_String(Source => "barracks")) then
Max_Recruits := Max_Recruits * 2;
end if;
if Max_Recruits > (Sky_Bases(Base_Index).Population / 10) then
Max_Recruits := (Sky_Bases(Base_Index).Population / 10) + 1;
end if;
Recruits_Amount := Get_Random(Min => 1, Max => Max_Recruits);
Max_Skill_Amount :=
Integer
(Float(SkillsData_Container.Length(Container => Skills_List)) *
(Float(Sky_Bases(Base_Index).Reputation(1)) / 100.0));
if Max_Skill_Amount < 5 then
Max_Skill_Amount := 5;
end if;
Generate_Recruits_Loop :
for I in 1 .. Recruits_Amount loop
Skills.Clear;
Attributes := (others => <>);
Price := 0;
Inventory.Clear;
Temp_Tools.Clear;
Equipment := (others => 0);
Payment := 0;
Recruit_Faction :=
(if Get_Random(Min => 1, Max => 100) < 99 then
Sky_Bases(Base_Index).Owner
else GetRandomFaction);
if not Factions_List(Recruit_Faction).Flags.Contains
(Item => To_Unbounded_String(Source => "nogender")) then
Gender :=
(if Get_Random(Min => 1, Max => 2) = 1 then 'M' else 'F');
else
Gender := 'M';
end if;
Local_Skills_Amount := Get_Random(Min => 1, Max => Skills_Amount);
if Local_Skills_Amount > Max_Skill_Amount then
Local_Skills_Amount := Max_Skill_Amount;
end if;
Highest_Level := 1;
Highest_Skill := 1;
Max_Skill_Level := Sky_Bases(Base_Index).Reputation(1);
if Max_Skill_Level < 20 then
Max_Skill_Level := 20;
end if;
if Get_Random(Min => 1, Max => 100) > 95 then
Max_Skill_Level := Get_Random(Min => Max_Skill_Level, Max => 100);
end if;
Generate_Skills_Loop :
for J in 1 .. Local_Skills_Amount loop
Skill_Number :=
(if J > 1 then Get_Random(Min => 1, Max => Skills_Amount)
else Factions_List(Recruit_Faction).WeaponSkill);
Skill_Level := Get_Random(Min => 1, Max => Max_Skill_Level);
if Skill_Level > Highest_Level then
Highest_Level := Skill_Level;
Highest_Skill := Skill_Number;
end if;
Skill_Index := 0;
Get_Skill_Index_Loop :
for C in Skills.Iterate loop
if Skills(C).Index = Skill_Number then
Skill_Index :=
(if Skills(C).Level < Skill_Level then
Skills_Container.To_Index(Position => C)
else -1);
exit Get_Skill_Index_Loop;
end if;
end loop Get_Skill_Index_Loop;
if Skill_Index = 0 then
Skills.Append
(New_Item =>
(Index => Skill_Number, Level => Skill_Level,
Experience => 0));
elsif Skill_Index > 0 then
Skills.Replace_Element
(Index => Skill_Index,
New_Item =>
(Index => Skill_Number, Level => Skill_Level,
Experience => 0));
end if;
end loop Generate_Skills_Loop;
Generate_Attributes_Loop :
for J in Attributes'Range loop
Attributes(J) :=
(Level => Get_Random(Min => 3, Max => (Max_Skill_Level / 3)),
Experience => 0);
end loop Generate_Attributes_Loop;
Update_Price_With_Skills_Loop :
for Skill of Skills loop
Price := Price + Skill.Level;
Payment := Payment + Skill.Level;
end loop Update_Price_With_Skills_Loop;
Update_Price_With_Stats_Loop :
for Stat of Attributes loop
Price := Price + (Stat.Level * 2);
Payment := Payment + (Stat.Level * 2);
end loop Update_Price_With_Stats_Loop;
Add_Inventory(Items_Indexes => Weapons_List, Equip_Index => 1);
Add_Inventory(Items_Indexes => Shields_List, Equip_Index => 2);
Add_Inventory(Items_Indexes => HeadArmors_List, Equip_Index => 3);
Add_Inventory(Items_Indexes => ChestArmors_List, Equip_Index => 4);
Add_Inventory(Items_Indexes => ArmsArmors_List, Equip_Index => 5);
Add_Inventory(Items_Indexes => LegsArmors_List, Equip_Index => 6);
Add_Tool_Loop :
for Recipe of Recipes_List loop
if Highest_Skill = Recipe.Skill then
Find_Tool_Loop :
for J in Items_List.Iterate loop
if Items_List(J).IType = Recipe.Tool then
Temp_Tools.Append
(New_Item => Objects_Container.Key(Position => J));
end if;
end loop Find_Tool_Loop;
Add_Inventory(Items_Indexes => Temp_Tools, Equip_Index => 7);
exit Add_Tool_Loop;
end if;
end loop Add_Tool_Loop;
if Bases_Types_List(Sky_Bases(Base_Index).Base_Type).Flags.Contains
(Item => To_Unbounded_String(Source => "barracks")) then
Price := Price / 2;
Payment := Payment / 2;
end if;
Price :=
Natural(Float(Price * 100) * Float(New_Game_Settings.Prices_Bonus));
if Price = 0 then
Price := 1;
end if;
Recruit_Base :=
(if Get_Random(Min => 1, Max => 100) < 99 then Base_Index
else Get_Random(Min => Sky_Bases'First, Max => Sky_Bases'Last));
Base_Recruits.Append
(New_Item =>
(Amount_Of_Attributes => Attributes_Amount,
Amount_Of_Skills => Local_Skills_Amount,
Name =>
GenerateMemberName
(Gender => Gender, FactionIndex => Recruit_Faction),
Gender => Gender, Price => Price, Skills => Skills,
Attributes => Attributes, Inventory => Inventory,
Equipment => Equipment, Payment => Payment,
Home_Base => Recruit_Base, Faction => Recruit_Faction));
end loop Generate_Recruits_Loop;
Sky_Bases(Base_Index).Recruit_Date := Game_Date;
Sky_Bases(Base_Index).Recruits := Base_Recruits;
end Generate_Recruits;
procedure Ask_For_Bases is
Base_Index: constant Natural :=
SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).BaseIndex;
Tmp_Base_Index: Extended_Base_Range;
Ship_Index: Unbounded_String;
Unknown_Bases: Extended_Base_Range := 0;
Trader_Index: constant Natural := FindMember(Order => Talk);
Amount: Natural range 0 .. 40;
Radius: Integer range -40 .. 40;
Temp_X, Temp_Y: Integer range -40 .. Bases_Range'Last + 40;
begin
if Trader_Index = 0 then
return;
end if;
if Base_Index > 0 then -- asking in base
if Sky_Bases(Base_Index).Population < 150 then
Amount := 10;
Radius := 10;
elsif Sky_Bases(Base_Index).Population < 300 then
Amount := 20;
Radius := 20;
else
Amount := 40;
Radius := 40;
end if;
Gain_Rep(Base_Index => Base_Index, Points => 1);
Sky_Bases(Base_Index).Asked_For_Bases := True;
AddMessage
(Message =>
To_String(Source => Player_Ship.Crew(Trader_Index).Name) &
" asked for directions to other bases in base '" &
To_String(Source => Sky_Bases(Base_Index).Name) & "'.",
MType => OrderMessage);
else -- asking friendly ship
Radius := 40;
Ship_Index :=
(Events_List
(SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).EventIndex)
.ShipIndex);
Amount :=
(if Proto_Ships_List(Ship_Index).Crew.Length < 5 then 3
elsif Proto_Ships_List(Ship_Index).Crew.Length < 10 then 5
else 10);
AddMessage
(Message =>
To_String(Source => Player_Ship.Crew(Trader_Index).Name) &
" asked ship '" &
To_String
(Source =>
Generate_Ship_Name
(Owner => Proto_Ships_List(Ship_Index).Owner)) &
"' for directions to other bases.",
MType => OrderMessage);
DeleteEvent
(EventIndex =>
SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).EventIndex);
UpdateOrders(Ship => Player_Ship);
end if;
Bases_X_Loop :
for X in -Radius .. Radius loop
Bases_Y_Loop :
for Y in -Radius .. Radius loop
Temp_X := Player_Ship.Sky_X + X;
NormalizeCoord(Coord => Temp_X);
Temp_Y := Player_Ship.Sky_Y + Y;
NormalizeCoord(Coord => Temp_Y, IsXAxis => False);
Tmp_Base_Index := SkyMap(Temp_X, Temp_Y).BaseIndex;
if Tmp_Base_Index > 0
and then not Sky_Bases(Tmp_Base_Index).Known then
Sky_Bases(Tmp_Base_Index).Known := True;
Amount := Amount - 1;
exit Bases_X_Loop when Amount = 0;
end if;
end loop Bases_Y_Loop;
end loop Bases_X_Loop;
if Amount > 0 then
if Base_Index > 0 then -- asking in base
if Sky_Bases(Base_Index).Population < 150 and then Amount > 1 then
Amount := 1;
elsif Sky_Bases(Base_Index).Population < 300
and then Amount > 2 then
Amount := 2;
elsif Amount > 4 then
Amount := 4;
end if;
else -- asking friendly ship
Amount :=
(if Proto_Ships_List(Ship_Index).Crew.Length < 5 then 1
elsif Proto_Ships_List(Ship_Index).Crew.Length < 10 then 2
else 4);
end if;
Count_Unknown_Bases_Loop :
for I in Sky_Bases'Range loop
if not Sky_Bases(I).Known then
Unknown_Bases := Unknown_Bases + 1;
end if;
exit Count_Unknown_Bases_Loop when Unknown_Bases >= Amount;
end loop Count_Unknown_Bases_Loop;
if Unknown_Bases >= Amount then
Reveal_Random_Bases_Loop :
loop
Tmp_Base_Index := Get_Random(Min => 1, Max => 1_024);
if not Sky_Bases(Tmp_Base_Index).Known then
Sky_Bases(Tmp_Base_Index).Known := True;
Amount := Amount - 1;
end if;
exit Reveal_Random_Bases_Loop when Amount = 0;
end loop Reveal_Random_Bases_Loop;
else
Reveal_Bases_Loop :
for I in Sky_Bases'Range loop
if not Sky_Bases(I).Known then
Sky_Bases(I).Known := True;
end if;
end loop Reveal_Bases_Loop;
end if;
end if;
GainExp
(Amount => 1, SkillNumber => Talking_Skill, CrewIndex => Trader_Index);
Update_Game(Minutes => 30);
end Ask_For_Bases;
procedure Ask_For_Events is
Base_Index: constant Extended_Base_Range :=
SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).BaseIndex;
Event_Time, Diff_X, Diff_Y: Positive;
Event: Events_Types;
Min_X, Min_Y, Max_X, Max_Y: Integer range -100 .. 1_124;
Enemies: UnboundedString_Container.Vector;
Attempts: Natural range 0 .. 10;
New_Item_Index, Ship_Index: Unbounded_String;
Trader_Index: constant Crew_Container.Extended_Index :=
FindMember(Order => Talk);
Max_Events, Events_Amount: Positive range 1 .. 15;
Tmp_Base_Index: Bases_Range;
Event_X, Event_Y: Positive range 1 .. 1_024;
Item_Index: Integer;
begin
if Trader_Index = 0 then
return;
end if;
if Base_Index > 0 then -- asking in base
Max_Events :=
(if Sky_Bases(Base_Index).Population < 150 then 5
elsif Sky_Bases(Base_Index).Population < 300 then 10 else 15);
Sky_Bases(Base_Index).Asked_For_Events := Game_Date;
AddMessage
(Message =>
To_String(Source => Player_Ship.Crew(Trader_Index).Name) &
" asked for recent events known at base '" &
To_String(Source => Sky_Bases(Base_Index).Name) & "'.",
MType => OrderMessage);
Gain_Rep(Base_Index => Base_Index, Points => 1);
else -- asking friendly ship
Ship_Index :=
Events_List(SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).EventIndex)
.ShipIndex;
Max_Events :=
(if Proto_Ships_List(Ship_Index).Crew.Length < 5 then 1
elsif Proto_Ships_List(Ship_Index).Crew.Length < 10 then 3 else 5);
AddMessage
(Message =>
To_String(Source => Player_Ship.Crew(Trader_Index).Name) &
" asked ship '" &
To_String
(Source =>
Generate_Ship_Name
(Owner => Proto_Ships_List(Ship_Index).Owner)) &
"' for recent events.",
MType => OrderMessage);
DeleteEvent
(EventIndex =>
SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).EventIndex);
UpdateOrders(Ship => Player_Ship);
end if;
Events_Amount := Get_Random(Min => 1, Max => Max_Events);
Min_X := Player_Ship.Sky_X - 100;
NormalizeCoord(Coord => Min_X);
Max_X := Player_Ship.Sky_X + 100;
NormalizeCoord(Coord => Max_X);
Min_Y := Player_Ship.Sky_Y - 100;
NormalizeCoord(Coord => Min_Y, IsXAxis => False);
Max_Y := Player_Ship.Sky_Y + 100;
NormalizeCoord(Coord => Max_Y, IsXAxis => False);
GenerateEnemies(Enemies => Enemies);
Generate_Events_Loop :
for I in 1 .. Events_Amount loop
Event := Events_Types'Val(Get_Random(Min => 1, Max => 5));
Attempts := 10;
Generate_Event_Location_Loop :
loop
if Event = EnemyShip then
Event_X := Get_Random(Min => Min_X, Max => Max_X);
Event_Y := Get_Random(Min => Min_Y, Max => Max_Y);
exit Generate_Event_Location_Loop when SkyMap(Event_X, Event_Y)
.BaseIndex =
0 and
Event_X /= Player_Ship.Sky_X and
Event_Y /= Player_Ship.Sky_Y and
SkyMap(Event_X, Event_Y).EventIndex = 0;
else
Tmp_Base_Index := Get_Random(Min => 1, Max => 1_024);
Event_X := Sky_Bases(Tmp_Base_Index).Sky_X;
Event_Y := Sky_Bases(Tmp_Base_Index).Sky_Y;
Attempts := Attempts - 1;
if Attempts = 0 then
Event := EnemyShip;
Regenerate_Event_Location_Loop :
loop
Event_X := Get_Random(Min => Min_X, Max => Max_X);
Event_Y := Get_Random(Min => Min_Y, Max => Max_Y);
exit Regenerate_Event_Location_Loop when SkyMap
(Event_X, Event_Y)
.BaseIndex =
0 and
Event_X /= Player_Ship.Sky_X and
Event_Y /= Player_Ship.Sky_Y and
SkyMap(Event_X, Event_Y).EventIndex = 0;
end loop Regenerate_Event_Location_Loop;
exit Generate_Event_Location_Loop;
end if;
if Event_X /= Player_Ship.Sky_X and
Event_Y /= Player_Ship.Sky_Y and
SkyMap(Event_X, Event_Y).EventIndex = 0 and
Sky_Bases(SkyMap(Event_X, Event_Y).BaseIndex).Known then
if Event = AttackOnBase and
Sky_Bases(SkyMap(Event_X, Event_Y).BaseIndex).Population /=
0 then
exit Generate_Event_Location_Loop;
end if;
if Event = DoublePrice and
IsFriendly
(SourceFaction => Player_Ship.Crew(1).Faction,
TargetFaction =>
Sky_Bases(SkyMap(Event_X, Event_Y).BaseIndex)
.Owner) then
exit Generate_Event_Location_Loop;
end if;
if Event = Disease and
not Factions_List
(Sky_Bases(SkyMap(Event_X, Event_Y).BaseIndex).Owner)
.Flags
.Contains
(Item =>
To_Unbounded_String(Source => "diseaseimmune")) and
IsFriendly
(SourceFaction => Player_Ship.Crew(1).Faction,
TargetFaction =>
Sky_Bases(SkyMap(Event_X, Event_Y).BaseIndex)
.Owner) then
exit Generate_Event_Location_Loop;
end if;
if Event = BaseRecovery and
Sky_Bases(SkyMap(Event_X, Event_Y).BaseIndex).Population =
0 then
exit Generate_Event_Location_Loop;
end if;
end if;
end if;
end loop Generate_Event_Location_Loop;
Diff_X := abs (Player_Ship.Sky_X - Event_X);
Diff_Y := abs (Player_Ship.Sky_Y - Event_Y);
Event_Time :=
Positive(60.0 * Sqrt(X => Float((Diff_X**2) + (Diff_Y**2))));
case Event is
when EnemyShip =>
Events_List.Append
(New_Item =>
(EType => EnemyShip, SkyX => Event_X, SkyY => Event_Y,
Time =>
Get_Random(Min => Event_Time, Max => Event_Time + 60),
ShipIndex =>
Enemies
(Get_Random
(Min => Enemies.First_Index,
Max => Enemies.Last_Index))));
when AttackOnBase =>
GenerateEnemies
(Enemies => Enemies,
Owner => To_Unbounded_String(Source => "Any"),
WithTraders => False);
Events_List.Append
(New_Item =>
(EType => AttackOnBase, SkyX => Event_X, SkyY => Event_Y,
Time =>
Get_Random(Min => Event_Time, Max => Event_Time + 120),
ShipIndex =>
Enemies
(Get_Random
(Min => Enemies.First_Index,
Max => Enemies.Last_Index))));
GenerateEnemies(Enemies => Enemies);
when Disease =>
Events_List.Append
(New_Item =>
(EType => Disease, SkyX => Event_X, SkyY => Event_Y,
Time => Get_Random(Min => 10_080, Max => 12_000),
Data => 1));
when DoublePrice =>
Set_Double_Price_Event_Loop :
loop
Item_Index :=
Get_Random(Min => 1, Max => Positive(Items_List.Length));
Find_Item_Index_Loop :
for J in Items_List.Iterate loop
Item_Index := Item_Index - 1;
if Item_Index <= 0
and then
Get_Price
(Base_Type =>
Sky_Bases(SkyMap(Event_X, Event_Y).BaseIndex)
.Base_Type,
Item_Index =>
Objects_Container.Key(Position => J)) >
0 then
New_Item_Index := Objects_Container.Key(Position => J);
exit Set_Double_Price_Event_Loop;
end if;
end loop Find_Item_Index_Loop;
end loop Set_Double_Price_Event_Loop;
Events_List.Append
(New_Item =>
(EType => DoublePrice, SkyX => Event_X, SkyY => Event_Y,
Time =>
Get_Random
(Min => (Event_Time * 3), Max => (Event_Time * 4)),
ItemIndex => New_Item_Index));
when BaseRecovery =>
RecoverBase(BaseIndex => SkyMap(Event_X, Event_Y).BaseIndex);
when others =>
null;
end case;
if Event /= BaseRecovery then
SkyMap(Event_X, Event_Y).EventIndex := Events_List.Last_Index;
end if;
end loop Generate_Events_Loop;
GainExp
(Amount => 1, SkillNumber => Talking_Skill, CrewIndex => Trader_Index);
Update_Game(Minutes => 30);
end Ask_For_Events;
procedure Update_Population is
Base_Index: constant Bases_Range :=
SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).BaseIndex;
Population_Diff: Integer;
begin
if Days_Difference
(Date_To_Compare => Sky_Bases(Base_Index).Recruit_Date) <
30 then
return;
end if;
if Sky_Bases(Base_Index).Population > 0 then
if Get_Random(Min => 1, Max => 100) > 30 then
return;
end if;
Population_Diff :=
(if Get_Random(Min => 1, Max => 100) < 20 then
-(Get_Random(Min => 1, Max => 10))
else Get_Random(Min => 1, Max => 10));
if Sky_Bases(Base_Index).Population + Population_Diff < 0 then
Population_Diff := -(Sky_Bases(Base_Index).Population);
end if;
Sky_Bases(Base_Index).Population :=
Sky_Bases(Base_Index).Population + Population_Diff;
if Sky_Bases(Base_Index).Population = 0 then
Sky_Bases(Base_Index).Reputation := (1 => 0, 2 => 0);
end if;
else
if Get_Random(Min => 1, Max => 100) > 5 then
return;
end if;
Sky_Bases(Base_Index).Population := Get_Random(Min => 5, Max => 10);
Sky_Bases(Base_Index).Owner := GetRandomFaction;
end if;
end Update_Population;
procedure Update_Prices is
Base_Index: constant Bases_Range :=
SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).BaseIndex;
Roll: Positive range 1 .. 100;
Chance: Positive;
begin
if Sky_Bases(Base_Index).Population = 0 then
return;
end if;
Chance :=
(if Sky_Bases(Base_Index).Population < 150 then 1
elsif Sky_Bases(Base_Index).Population < 300 then 2 else 5);
Chance :=
Chance +
(Days_Difference(Date_To_Compare => Sky_Bases(Base_Index).Visited) /
10);
if Get_Random(Min => 1, Max => 100) > Chance then
return;
end if;
Update_Prices_Loop :
for Item of Sky_Bases(Base_Index).Cargo loop
Roll := Get_Random(Min => 1, Max => 100);
if Roll < 30 and Item.Price > 1 then
Item.Price := Item.Price - 1;
elsif Roll < 60 and Item.Price > 0 then
Item.Price := Item.Price + 1;
end if;
end loop Update_Prices_Loop;
end Update_Prices;
end Bases;
|
generic
type Elem is private;
package Vermek is
type Verem is limited private;
Üres_A_Verem: exception;
procedure Push( V: in out Verem; E: in Elem );
procedure Pop( V: in out Verem; E: out Elem );
-- kiválthat Üres_A_Verem kivételt
function Top( V: Verem ) return Elem;
-- kiválthat Üres_A_Verem kivételt
function Is_Empty( V: Verem ) return Boolean;
function Is_Full( V: Verem ) return Boolean;
function Size( V: Verem ) return Natural;
private
type Csúcs;
type Mutató is access Csúcs;
type Csúcs is record
Adat: Elem;
Következő: Mutató := null;
end record;
type Verem is record
Méret: Natural := 0;
Veremtető: Mutató := null;
end record;
end Vermek;
|
-- ////////////////////////////////////////////////////////////
-- //
-- // SFML - Simple and Fast Multimedia Library
-- // Copyright (C) 2007-2009 Laurent Gomila (laurent.gom@gmail.com)
-- //
-- // This software is provided 'as-is', without any express or implied warranty.
-- // In no event will the authors be held liable for any damages arising from the use of this software.
-- //
-- // Permission is granted to anyone to use this software for any purpose,
-- // including commercial applications, and to alter it and redistribute it freely,
-- // subject to the following restrictions:
-- //
-- // 1. The origin of this software must not be misrepresented;
-- // you must not claim that you wrote the original software.
-- // If you use this software in a product, an acknowledgment
-- // in the product documentation would be appreciated but is not required.
-- //
-- // 2. Altered source versions must be plainly marked as such,
-- // and must not be misrepresented as being the original software.
-- //
-- // 3. This notice may not be removed or altered from any source distribution.
-- //
-- ////////////////////////////////////////////////////////////
-- ////////////////////////////////////////////////////////////
-- // Headers
-- ////////////////////////////////////////////////////////////
with Interfaces.C.Strings;
package body Sf.Window.Window is
use Interfaces.C.Strings;
-- ////////////////////////////////////////////////////////////
-- /// Construct a new window
-- ///
-- /// \param Mode : Video mode to use
-- /// \param Title : Title of the window
-- /// \param Style : Window style
-- /// \param Params : Creation settings
-- ///
-- ////////////////////////////////////////////////////////////
function sfWindow_Create
(Mode : sfVideoMode;
Title : String;
Style : sfUint32 := sfResize or sfClose;
Params : sfWindowSettings := (24, 8, 0))
return sfWindow_Ptr
is
function Internal
(Mode : sfVideoMode;
Title : chars_ptr;
Style : sfUint32;
Params : sfWindowSettings)
return sfWindow_Ptr;
pragma Import (C, Internal, "sfWindow_Create");
Temp : chars_ptr := New_String (Title);
R : sfWindow_Ptr := Internal (Mode, Temp, Style, Params);
begin
Free (Temp);
return R;
end sfWindow_Create;
end Sf.Window.Window;
|
------------------------------------------------------------------------------
-- --
-- GNAT EXAMPLE --
-- --
-- Copyright (C) 2014, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- 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 file provides register definitions for the STM32F4 (ARM Cortex M4F)
-- microcontrollers from ST Microelectronics.
pragma Restrictions (No_Elaboration_Code);
package STM32F4.GPIO is
-- MODER constants
Mode_IN : constant Bits_2 := 0;
Mode_OUT : constant Bits_2 := 1;
Mode_AF : constant Bits_2 := 2;
Mode_AN : constant Bits_2 := 3;
-- OTYPER constants
Type_PP : constant Bits_1 := 0; -- Push/pull
Type_OD : constant Bits_1 := 1; -- Open drain
-- OSPEEDR constants
Speed_2MHz : constant Bits_2 := 0; -- Low speed
Speed_25MHz : constant Bits_2 := 1; -- Medium speed
Speed_50MHz : constant Bits_2 := 2; -- Fast speed
Speed_100MHz : constant Bits_2 := 3; -- High speed on 30pF, 80MHz on 15
-- PUPDR constants
No_Pull : constant Bits_2 := 0;
Pull_Up : constant Bits_2 := 1;
Pull_Down : constant Bits_2 := 2;
-- AFL constants
AF_USART1 : constant Bits_4 := 7;
-- Reset constants
GPIOA_Reset : constant Word := 16#A800_0000#;
GPIOB_Reset : constant Word := 16#0000_0280#;
GPIO_Others_Reset : constant Word := 16#0000_0000#;
type GPIO_Register is record
MODER : Bits_16x2; -- mode register
OTYPER : Bits_32x1; -- output type register
OSPEEDR : Bits_16x2; -- output speed register
PUPDR : Bits_16x2; -- pull-up/pull-down register
IDR : Word; -- input data register
ODR : Word; -- output data register
BSRR : Word; -- bit set/reset register
LCKR : Word; -- configuration lock register
AFRL : Bits_8x4; -- alternate function low register
AFRH : Bits_8x4; -- alternate function high register
end record;
for GPIO_Register use record
MODER at 0 range 0 .. 31;
OTYPER at 4 range 0 .. 31;
OSPEEDR at 8 range 0 .. 31;
PUPDR at 12 range 0 .. 31;
IDR at 16 range 0 .. 31;
ODR at 20 range 0 .. 31;
BSRR at 24 range 0 .. 31;
LCKR at 28 range 0 .. 31;
AFRL at 32 range 0 .. 31;
AFRH at 36 range 0 .. 31;
end record;
end STM32F4.GPIO;
|
-- This package has been generated automatically by GNATtest.
-- You are allowed to add your code to the bodies of test routines.
-- Such changes will be kept during further regeneration of this file.
-- All code placed outside of test routine bodies will be lost. The
-- code intended to set up and tear down the test environment should be
-- placed into Statistics.Test_Data.
with AUnit.Assertions; use AUnit.Assertions;
with System.Assertions;
-- begin read only
-- id:2.2/00/
--
-- This section can be used to add with clauses if necessary.
--
-- end read only
with Ships; use Ships;
-- begin read only
-- end read only
package body Statistics.Test_Data.Tests is
-- begin read only
-- id:2.2/01/
--
-- This section can be used to add global variables and other elements.
--
-- end read only
-- begin read only
-- end read only
-- begin read only
procedure Wrap_Test_UpdateDestroyedShips_708ec3_001497
(ShipName: Unbounded_String) is
begin
begin
pragma Assert(ShipName /= Null_Unbounded_String);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(statistics.ads:0):Test_UpdateDestroyedShips test requirement violated");
end;
GNATtest_Generated.GNATtest_Standard.Statistics.UpdateDestroyedShips
(ShipName);
begin
pragma Assert(True);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(statistics.ads:0:):Test_UpdateDestroyedShips test commitment violated");
end;
end Wrap_Test_UpdateDestroyedShips_708ec3_001497;
-- end read only
-- begin read only
procedure Test_UpdateDestroyedShips_test_updatedestroyedships
(Gnattest_T: in out Test);
procedure Test_UpdateDestroyedShips_708ec3_001497
(Gnattest_T: in out Test) renames
Test_UpdateDestroyedShips_test_updatedestroyedships;
-- id:2.2/708ec30adf523180/UpdateDestroyedShips/1/0/test_updatedestroyedships/
procedure Test_UpdateDestroyedShips_test_updatedestroyedships
(Gnattest_T: in out Test) is
procedure UpdateDestroyedShips(ShipName: Unbounded_String) renames
Wrap_Test_UpdateDestroyedShips_708ec3_001497;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
UpdateDestroyedShips(To_Unbounded_String("Tiny pirates ship"));
Assert
(GameStats.DestroyedShips.Length = 1,
"Failed to add ship to destroyed ships list.");
UpdateDestroyedShips(To_Unbounded_String("Sfdsfdsf"));
Assert
(GameStats.DestroyedShips.Length = 1,
"Failed to not add non existing ship to destroyed ships list.");
-- begin read only
end Test_UpdateDestroyedShips_test_updatedestroyedships;
-- end read only
-- begin read only
procedure Wrap_Test_ClearGameStats_97edec_dc3936 is
begin
begin
pragma Assert(True);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(statistics.ads:0):Test_ClearGameStats test requirement violated");
end;
GNATtest_Generated.GNATtest_Standard.Statistics.ClearGameStats;
begin
pragma Assert(GameStats.Points = 0);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(statistics.ads:0:):Test_ClearGameStats test commitment violated");
end;
end Wrap_Test_ClearGameStats_97edec_dc3936;
-- end read only
-- begin read only
procedure Test_ClearGameStats_test_cleargamestats(Gnattest_T: in out Test);
procedure Test_ClearGameStats_97edec_dc3936(Gnattest_T: in out Test) renames
Test_ClearGameStats_test_cleargamestats;
-- id:2.2/97edec1268a24200/ClearGameStats/1/0/test_cleargamestats/
procedure Test_ClearGameStats_test_cleargamestats
(Gnattest_T: in out Test) is
procedure ClearGameStats renames Wrap_Test_ClearGameStats_97edec_dc3936;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
ClearGameStats;
Assert
(GameStats.DestroyedShips.Length = 0,
"Failed to clear game statistics.");
-- begin read only
end Test_ClearGameStats_test_cleargamestats;
-- end read only
-- begin read only
procedure Wrap_Test_UpdateFinishedGoals_9c0615_51796d
(Index: Unbounded_String) is
begin
begin
pragma Assert(Index /= Null_Unbounded_String);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(statistics.ads:0):Test_UpdateFinishedGoals test requirement violated");
end;
GNATtest_Generated.GNATtest_Standard.Statistics.UpdateFinishedGoals
(Index);
begin
pragma Assert(True);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(statistics.ads:0:):Test_UpdateFinishedGoals test commitment violated");
end;
end Wrap_Test_UpdateFinishedGoals_9c0615_51796d;
-- end read only
-- begin read only
procedure Test_UpdateFinishedGoals_test_updatefinishedgoals
(Gnattest_T: in out Test);
procedure Test_UpdateFinishedGoals_9c0615_51796d
(Gnattest_T: in out Test) renames
Test_UpdateFinishedGoals_test_updatefinishedgoals;
-- id:2.2/9c061556f3d17076/UpdateFinishedGoals/1/0/test_updatefinishedgoals/
procedure Test_UpdateFinishedGoals_test_updatefinishedgoals
(Gnattest_T: in out Test) is
procedure UpdateFinishedGoals(Index: Unbounded_String) renames
Wrap_Test_UpdateFinishedGoals_9c0615_51796d;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
UpdateFinishedGoals(To_Unbounded_String("1"));
Assert
(GameStats.FinishedGoals.Length = 1,
"Failed to add goal to finished goals list.");
UpdateFinishedGoals(To_Unbounded_String("Sfdsfdsf"));
Assert
(GameStats.FinishedGoals.Length = 1,
"Failed to not add non existing goal to finished goals list.");
-- begin read only
end Test_UpdateFinishedGoals_test_updatefinishedgoals;
-- end read only
-- begin read only
procedure Wrap_Test_UpdateFinishedMissions_cda9ad_a624ba
(MType: Unbounded_String) is
begin
begin
pragma Assert(MType /= Null_Unbounded_String);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(statistics.ads:0):Test_UpdateFinishedMissions test requirement violated");
end;
GNATtest_Generated.GNATtest_Standard.Statistics.UpdateFinishedMissions
(MType);
begin
pragma Assert(True);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(statistics.ads:0:):Test_UpdateFinishedMissions test commitment violated");
end;
end Wrap_Test_UpdateFinishedMissions_cda9ad_a624ba;
-- end read only
-- begin read only
procedure Test_UpdateFinishedMissions_test_updatefinishedmissions
(Gnattest_T: in out Test);
procedure Test_UpdateFinishedMissions_cda9ad_a624ba
(Gnattest_T: in out Test) renames
Test_UpdateFinishedMissions_test_updatefinishedmissions;
-- id:2.2/cda9ad2228e90d47/UpdateFinishedMissions/1/0/test_updatefinishedmissions/
procedure Test_UpdateFinishedMissions_test_updatefinishedmissions
(Gnattest_T: in out Test) is
procedure UpdateFinishedMissions(MType: Unbounded_String) renames
Wrap_Test_UpdateFinishedMissions_cda9ad_a624ba;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
UpdateFinishedMissions(To_Unbounded_String("DESTROY"));
Assert
(GameStats.FinishedMissions.Length = 1,
"Failed to add mission to finished missions list.");
UpdateFinishedMissions(To_Unbounded_String("Sfdsfdsf"));
Assert
(GameStats.FinishedGoals.Length = 1,
"Failed to not add non existing mission to finished missions list.");
-- begin read only
end Test_UpdateFinishedMissions_test_updatefinishedmissions;
-- end read only
-- begin read only
procedure Wrap_Test_UpdateCraftingOrders_24cc96_7fc6ac
(Index: Unbounded_String) is
begin
begin
pragma Assert(Index /= Null_Unbounded_String);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(statistics.ads:0):Test_UpdateCraftingOrders test requirement violated");
end;
GNATtest_Generated.GNATtest_Standard.Statistics.UpdateCraftingOrders
(Index);
begin
pragma Assert(True);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(statistics.ads:0:):Test_UpdateCraftingOrders test commitment violated");
end;
end Wrap_Test_UpdateCraftingOrders_24cc96_7fc6ac;
-- end read only
-- begin read only
procedure Test_UpdateCraftingOrders_test_updatecraftingorders
(Gnattest_T: in out Test);
procedure Test_UpdateCraftingOrders_24cc96_7fc6ac
(Gnattest_T: in out Test) renames
Test_UpdateCraftingOrders_test_updatecraftingorders;
-- id:2.2/24cc9698c39e0070/UpdateCraftingOrders/1/0/test_updatecraftingorders/
procedure Test_UpdateCraftingOrders_test_updatecraftingorders
(Gnattest_T: in out Test) is
procedure UpdateCraftingOrders(Index: Unbounded_String) renames
Wrap_Test_UpdateCraftingOrders_24cc96_7fc6ac;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
UpdateCraftingOrders(To_Unbounded_String("1"));
Assert
(GameStats.CraftingOrders.Length = 1,
"Failed to add finished crafting order to game statistics.");
-- begin read only
end Test_UpdateCraftingOrders_test_updatecraftingorders;
-- end read only
-- begin read only
procedure Wrap_Test_UpdateKilledMobs_0403d9_0ca136
(Mob: Member_Data; FractionName: Unbounded_String) is
begin
begin
pragma Assert(FractionName /= Null_Unbounded_String);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(statistics.ads:0):Test_UpdateKilledMobs test requirement violated");
end;
GNATtest_Generated.GNATtest_Standard.Statistics.UpdateKilledMobs
(Mob, FractionName);
begin
pragma Assert(True);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(statistics.ads:0:):Test_UpdateKilledMobs test commitment violated");
end;
end Wrap_Test_UpdateKilledMobs_0403d9_0ca136;
-- end read only
-- begin read only
procedure Test_UpdateKilledMobs_test_updatekilledmobs
(Gnattest_T: in out Test);
procedure Test_UpdateKilledMobs_0403d9_0ca136
(Gnattest_T: in out Test) renames
Test_UpdateKilledMobs_test_updatekilledmobs;
-- id:2.2/0403d9266b43dc2c/UpdateKilledMobs/1/0/test_updatekilledmobs/
procedure Test_UpdateKilledMobs_test_updatekilledmobs
(Gnattest_T: in out Test) is
procedure UpdateKilledMobs
(Mob: Member_Data; FractionName: Unbounded_String) renames
Wrap_Test_UpdateKilledMobs_0403d9_0ca136;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
UpdateKilledMobs(Player_Ship.Crew(2), To_Unbounded_String("POLEIS"));
Assert
(GameStats.KilledMobs.Length = 1,
"Failed to add killed mob to game statistics.");
-- begin read only
end Test_UpdateKilledMobs_test_updatekilledmobs;
-- end read only
-- begin read only
function Wrap_Test_GetGamePoints_e274aa_4eed1d return Natural is
begin
declare
Test_GetGamePoints_e274aa_4eed1d_Result: constant Natural :=
GNATtest_Generated.GNATtest_Standard.Statistics.GetGamePoints;
begin
return Test_GetGamePoints_e274aa_4eed1d_Result;
end;
end Wrap_Test_GetGamePoints_e274aa_4eed1d;
-- end read only
-- begin read only
procedure Test_GetGamePoints_test_getgamepoints(Gnattest_T: in out Test);
procedure Test_GetGamePoints_e274aa_4eed1d(Gnattest_T: in out Test) renames
Test_GetGamePoints_test_getgamepoints;
-- id:2.2/e274aadb0dece247/GetGamePoints/1/0/test_getgamepoints/
procedure Test_GetGamePoints_test_getgamepoints(Gnattest_T: in out Test) is
function GetGamePoints return Natural renames
Wrap_Test_GetGamePoints_e274aa_4eed1d;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
if GetGamePoints = 0 then
Assert(True, "This test can only crash.");
return;
end if;
Assert(True, "This test can only crash.");
-- begin read only
end Test_GetGamePoints_test_getgamepoints;
-- end read only
-- begin read only
-- id:2.2/02/
--
-- This section can be used to add elaboration code for the global state.
--
begin
-- end read only
null;
-- begin read only
-- end read only
end Statistics.Test_Data.Tests;
|
-----------------------------------------------------------------------
-- atlas-reviews-beans -- Beans for module reviews
-- Copyright (C) 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 ADO.Sessions;
with ADO.Queries;
with ADO.Utils;
with ADO.Datasets;
with AWA.Services.Contexts;
package body Atlas.Reviews.Beans is
package ASC renames AWA.Services.Contexts;
-- ------------------------------
-- Get the value identified by the name.
-- ------------------------------
overriding
function Get_Value (From : in Review_Bean;
Name : in String) return Util.Beans.Objects.Object is
begin
if From.Is_Null then
return Util.Beans.Objects.Null_Object;
else
return Atlas.Reviews.Models.Review_Bean (From).Get_Value (Name);
end if;
end Get_Value;
-- ------------------------------
-- Set the value identified by the name.
-- ------------------------------
overriding
procedure Set_Value (From : in out Review_Bean;
Name : in String;
Value : in Util.Beans.Objects.Object) is
begin
if Name = "title" then
From.Set_Title (Util.Beans.Objects.To_String (Value));
elsif Name = "site" then
From.Set_Site (Util.Beans.Objects.To_String (Value));
elsif Name = "text" then
From.Set_Text (Util.Beans.Objects.To_String (Value));
elsif Name = "id" and not Util.Beans.Objects.Is_Empty (Value) then
declare
Ctx : constant ASC.Service_Context_Access := AWA.Services.Contexts.Current;
DB : ADO.Sessions.Session := AWA.Services.Contexts.Get_Session (Ctx);
Id : constant ADO.Identifier := ADO.Utils.To_Identifier (Value);
Found : Boolean;
begin
From.Load (DB, Id, Found);
end;
end if;
end Set_Value;
overriding
procedure Save (Bean : in out Review_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is
pragma Unreferenced (Outcome);
begin
Bean.Module.Save (Bean);
end Save;
overriding
procedure Delete (Bean : in out Review_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is
pragma Unreferenced (Outcome);
begin
Bean.Module.Delete (Bean);
end Delete;
overriding
procedure Load (Bean : in out Review_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is
Session : ADO.Sessions.Session := Bean.Module.Get_Session;
begin
null;
end Load;
-- ------------------------------
-- Create the Review_Bean bean instance.
-- ------------------------------
function Create_Review_Bean (Module : in Atlas.Reviews.Modules.Review_Module_Access)
return Util.Beans.Basic.Readonly_Bean_Access is
Object : constant Review_Bean_Access := new Review_Bean;
begin
Object.Module := Module;
return Object.all'Access;
end Create_Review_Bean;
-- ------------------------------
-- Get the value identified by the name.
-- ------------------------------
overriding
function Get_Value (From : in Review_List_Bean;
Name : in String) return Util.Beans.Objects.Object is
begin
if Name = "page" then
return Util.Beans.Objects.To_Object (From.Page);
elsif Name = "page_size" then
return Util.Beans.Objects.To_Object (From.Page_Size);
elsif Name = "count" then
return Util.Beans.Objects.To_Object (From.Count);
elsif Name = "reviews" then
return Util.Beans.Objects.To_Object (Value => From.Reviews_Bean,
Storage => Util.Beans.Objects.STATIC);
else
return From.Reviews.Get_Value (Name);
end if;
end Get_Value;
-- ------------------------------
-- Set the value identified by the name.
-- ------------------------------
overriding
procedure Set_Value (From : in out Review_List_Bean;
Name : in String;
Value : in Util.Beans.Objects.Object) is
begin
if Name = "page" then
From.Page := Util.Beans.Objects.To_Integer (Value);
elsif Name = "page_size" then
From.Page_Size := Util.Beans.Objects.To_Integer (Value);
end if;
end Set_Value;
overriding
procedure Load (Into : in out Review_List_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is
Session : ADO.Sessions.Session := Into.Module.Get_Session;
Query : ADO.Queries.Context;
Count_Query : ADO.Queries.Context;
First : constant Natural := (Into.Page - 1) * Into.Page_Size;
Last : constant Positive := First + Into.Page_Size;
begin
Query.Set_Query (Atlas.Reviews.Models.Query_List);
Count_Query.Set_Count_Query (Atlas.Reviews.Models.Query_List);
Query.Bind_Param (Name => "first", Value => First);
Query.Bind_Param (Name => "last", Value => Last);
Atlas.Reviews.Models.List (Into.Reviews, Session, Query);
Into.Count := ADO.Datasets.Get_Count (Session, Count_Query);
end Load;
-- ------------------------------
-- Create the Review_List_Bean bean instance.
-- ------------------------------
function Create_Review_List_Bean (Module : in Atlas.Reviews.Modules.Review_Module_Access)
return Util.Beans.Basic.Readonly_Bean_Access is
Object : constant Review_List_Bean_Access := new Review_List_Bean;
begin
Object.Module := Module;
Object.Reviews_Bean := Object.Reviews'Access;
Object.Page_Size := 20;
Object.Page := 1;
Object.Count := 0;
return Object.all'Access;
end Create_Review_List_Bean;
end Atlas.Reviews.Beans;
|
package Math is
function Square (x : Integer) return Integer;
function Exponent (base, power : Integer) return Integer;
type Matrix_Type is
array (Positive range <>, Positive range <>) of Integer;
function Square (m : Matrix_Type) return Matrix_Type;
end Math;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . V A X _ F L O A T _ O P E R A T I O N S --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1997-2000 Free Software Foundation, Inc. --
-- (Version for Alpha OpenVMS) --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System.IO; use System.IO;
with System.Machine_Code; use System.Machine_Code;
package body System.Vax_Float_Operations is
-- Ensure this gets compiled with -O to avoid extra (and possibly
-- improper) memory stores.
pragma Optimize (Time);
-- Declare the functions that do the conversions between floating-point
-- formats. Call the operands IEEE float so they get passed in
-- FP registers.
function Cvt_G_T (X : T) return T;
function Cvt_T_G (X : T) return T;
function Cvt_T_F (X : T) return S;
pragma Import (C, Cvt_G_T, "OTS$CVT_FLOAT_G_T");
pragma Import (C, Cvt_T_G, "OTS$CVT_FLOAT_T_G");
pragma Import (C, Cvt_T_F, "OTS$CVT_FLOAT_T_F");
-- In each of the conversion routines that are done with OTS calls,
-- we define variables of the corresponding IEEE type so that they are
-- passed and kept in the proper register class.
------------
-- D_To_G --
------------
function D_To_G (X : D) return G is
A, B : T;
C : G;
begin
Asm ("ldg %0,%1", T'Asm_Output ("=f", A), D'Asm_Input ("m", X));
Asm ("cvtdg %1,%0", T'Asm_Output ("=f", B), T'Asm_Input ("f", A));
Asm ("stg %1,%0", G'Asm_Output ("=m", C), T'Asm_Input ("f", B));
return C;
end D_To_G;
------------
-- F_To_G --
------------
function F_To_G (X : F) return G is
A : T;
B : G;
begin
Asm ("ldf %0,%1", T'Asm_Output ("=f", A), F'Asm_Input ("m", X));
Asm ("stg %1,%0", G'Asm_Output ("=m", B), T'Asm_Input ("f", A));
return B;
end F_To_G;
------------
-- F_To_S --
------------
function F_To_S (X : F) return S is
A : T;
B : S;
begin
-- Because converting to a wider FP format is a no-op, we say
-- A is 64-bit even though we are loading 32 bits into it.
Asm ("ldf %0,%1", T'Asm_Output ("=f", A), F'Asm_Input ("m", X));
B := S (Cvt_G_T (A));
return B;
end F_To_S;
------------
-- G_To_D --
------------
function G_To_D (X : G) return D is
A, B : T;
C : D;
begin
Asm ("ldg %0,%1", T'Asm_Output ("=f", A), G'Asm_Input ("m", X));
Asm ("cvtgd %1,%0", T'Asm_Output ("=f", B), T'Asm_Input ("f", A));
Asm ("stg %1,%0", D'Asm_Output ("=m", C), T'Asm_Input ("f", B));
return C;
end G_To_D;
------------
-- G_To_F --
------------
function G_To_F (X : G) return F is
A : T;
B : S;
C : F;
begin
Asm ("ldg %0,%1", T'Asm_Output ("=f", A), G'Asm_Input ("m", X));
Asm ("cvtgf %1,%0", S'Asm_Output ("=f", B), T'Asm_Input ("f", A));
Asm ("stf %1,%0", F'Asm_Output ("=m", C), S'Asm_Input ("f", B));
return C;
end G_To_F;
------------
-- G_To_Q --
------------
function G_To_Q (X : G) return Q is
A : T;
B : Q;
begin
Asm ("ldg %0,%1", T'Asm_Output ("=f", A), G'Asm_Input ("m", X));
Asm ("cvtgq %1,%0", Q'Asm_Output ("=f", B), T'Asm_Input ("f", A));
return B;
end G_To_Q;
------------
-- G_To_T --
------------
function G_To_T (X : G) return T is
A, B : T;
begin
Asm ("ldg %0,%1", T'Asm_Output ("=f", A), G'Asm_Input ("m", X));
B := Cvt_G_T (A);
return B;
end G_To_T;
------------
-- F_To_Q --
------------
function F_To_Q (X : F) return Q is
begin
return G_To_Q (F_To_G (X));
end F_To_Q;
------------
-- Q_To_F --
------------
function Q_To_F (X : Q) return F is
A : S;
B : F;
begin
Asm ("cvtqf %1,%0", S'Asm_Output ("=f", A), Q'Asm_Input ("f", X));
Asm ("stf %1,%0", F'Asm_Output ("=m", B), S'Asm_Input ("f", A));
return B;
end Q_To_F;
------------
-- Q_To_G --
------------
function Q_To_G (X : Q) return G is
A : T;
B : G;
begin
Asm ("cvtqg %1,%0", T'Asm_Output ("=f", A), Q'Asm_Input ("f", X));
Asm ("stg %1,%0", G'Asm_Output ("=m", B), T'Asm_Input ("f", A));
return B;
end Q_To_G;
------------
-- S_To_F --
------------
function S_To_F (X : S) return F is
A : S;
B : F;
begin
A := Cvt_T_F (T (X));
Asm ("stf %1,%0", F'Asm_Output ("=m", B), S'Asm_Input ("f", A));
return B;
end S_To_F;
------------
-- T_To_D --
------------
function T_To_D (X : T) return D is
begin
return G_To_D (T_To_G (X));
end T_To_D;
------------
-- T_To_G --
------------
function T_To_G (X : T) return G is
A : T;
B : G;
begin
A := Cvt_T_G (X);
Asm ("stg %1,%0", G'Asm_Output ("=m", B), T'Asm_Input ("f", A));
return B;
end T_To_G;
-----------
-- Abs_F --
-----------
function Abs_F (X : F) return F is
A, B : S;
C : F;
begin
Asm ("ldf %0,%1", S'Asm_Output ("=f", A), F'Asm_Input ("m", X));
Asm ("cpys $f31,%1,%0", S'Asm_Output ("=f", B), S'Asm_Input ("f", A));
Asm ("stf %1,%0", F'Asm_Output ("=m", C), S'Asm_Input ("f", B));
return C;
end Abs_F;
-----------
-- Abs_G --
-----------
function Abs_G (X : G) return G is
A, B : T;
C : G;
begin
Asm ("ldg %0,%1", T'Asm_Output ("=f", A), G'Asm_Input ("m", X));
Asm ("cpys $f31,%1,%0", T'Asm_Output ("=f", B), T'Asm_Input ("f", A));
Asm ("stg %1,%0", G'Asm_Output ("=m", C), T'Asm_Input ("f", B));
return C;
end Abs_G;
-----------
-- Add_F --
-----------
function Add_F (X, Y : F) return F is
X1, Y1, R : S;
R1 : F;
begin
Asm ("ldf %0,%1", S'Asm_Output ("=f", X1), F'Asm_Input ("m", X));
Asm ("ldf %0,%1", S'Asm_Output ("=f", Y1), F'Asm_Input ("m", Y));
Asm ("addf %1,%2,%0", S'Asm_Output ("=f", R),
(S'Asm_Input ("f", X1), S'Asm_Input ("f", Y1)));
Asm ("stf %1,%0", F'Asm_Output ("=m", R1), S'Asm_Input ("f", R));
return R1;
end Add_F;
-----------
-- Add_G --
-----------
function Add_G (X, Y : G) return G is
X1, Y1, R : T;
R1 : G;
begin
Asm ("ldg %0,%1", T'Asm_Output ("=f", X1), G'Asm_Input ("m", X));
Asm ("ldg %0,%1", T'Asm_Output ("=f", Y1), G'Asm_Input ("m", Y));
Asm ("addg %1,%2,%0", T'Asm_Output ("=f", R),
(T'Asm_Input ("f", X1), T'Asm_Input ("f", Y1)));
Asm ("stg %1,%0", G'Asm_Output ("=m", R1), T'Asm_Input ("f", R));
return R1;
end Add_G;
--------------------
-- Debug_Output_D --
--------------------
procedure Debug_Output_D (Arg : D) is
begin
Put (D'Image (Arg));
end Debug_Output_D;
--------------------
-- Debug_Output_F --
--------------------
procedure Debug_Output_F (Arg : F) is
begin
Put (F'Image (Arg));
end Debug_Output_F;
--------------------
-- Debug_Output_G --
--------------------
procedure Debug_Output_G (Arg : G) is
begin
Put (G'Image (Arg));
end Debug_Output_G;
--------------------
-- Debug_String_D --
--------------------
Debug_String_Buffer : String (1 .. 32);
-- Buffer used by all Debug_String_x routines for returning result
function Debug_String_D (Arg : D) return System.Address is
Image_String : constant String := D'Image (Arg) & ASCII.NUL;
Image_Size : constant Integer := Image_String'Length;
begin
Debug_String_Buffer (1 .. Image_Size) := Image_String;
return Debug_String_Buffer (1)'Address;
end Debug_String_D;
--------------------
-- Debug_String_F --
--------------------
function Debug_String_F (Arg : F) return System.Address is
Image_String : constant String := F'Image (Arg) & ASCII.NUL;
Image_Size : constant Integer := Image_String'Length;
begin
Debug_String_Buffer (1 .. Image_Size) := Image_String;
return Debug_String_Buffer (1)'Address;
end Debug_String_F;
--------------------
-- Debug_String_G --
--------------------
function Debug_String_G (Arg : G) return System.Address is
Image_String : constant String := G'Image (Arg) & ASCII.NUL;
Image_Size : constant Integer := Image_String'Length;
begin
Debug_String_Buffer (1 .. Image_Size) := Image_String;
return Debug_String_Buffer (1)'Address;
end Debug_String_G;
-----------
-- Div_F --
-----------
function Div_F (X, Y : F) return F is
X1, Y1, R : S;
R1 : F;
begin
Asm ("ldf %0,%1", S'Asm_Output ("=f", X1), F'Asm_Input ("m", X));
Asm ("ldf %0,%1", S'Asm_Output ("=f", Y1), F'Asm_Input ("m", Y));
Asm ("divf %1,%2,%0", S'Asm_Output ("=f", R),
(S'Asm_Input ("f", X1), S'Asm_Input ("f", Y1)));
Asm ("stf %1,%0", F'Asm_Output ("=m", R1), S'Asm_Input ("f", R));
return R1;
end Div_F;
-----------
-- Div_G --
-----------
function Div_G (X, Y : G) return G is
X1, Y1, R : T;
R1 : G;
begin
Asm ("ldg %0,%1", T'Asm_Output ("=f", X1), G'Asm_Input ("m", X));
Asm ("ldg %0,%1", T'Asm_Output ("=f", Y1), G'Asm_Input ("m", Y));
Asm ("divg %1,%2,%0", T'Asm_Output ("=f", R),
(T'Asm_Input ("f", X1), T'Asm_Input ("f", Y1)));
Asm ("stg %1,%0", G'Asm_Output ("=m", R1), T'Asm_Input ("f", R));
return R1;
end Div_G;
----------
-- Eq_F --
----------
function Eq_F (X, Y : F) return Boolean is
X1, Y1, R : S;
begin
Asm ("ldf %0,%1", S'Asm_Output ("=f", X1), F'Asm_Input ("m", X));
Asm ("ldf %0,%1", S'Asm_Output ("=f", Y1), F'Asm_Input ("m", Y));
Asm ("cmpgeq %1,%2,%0", S'Asm_Output ("=f", R),
(S'Asm_Input ("f", X1), S'Asm_Input ("f", Y1)));
return R /= 0.0;
end Eq_F;
----------
-- Eq_G --
----------
function Eq_G (X, Y : G) return Boolean is
X1, Y1, R : T;
begin
Asm ("ldg %0,%1", T'Asm_Output ("=f", X1), G'Asm_Input ("m", X));
Asm ("ldg %0,%1", T'Asm_Output ("=f", Y1), G'Asm_Input ("m", Y));
Asm ("cmpgeq %1,%2,%0", T'Asm_Output ("=f", R),
(T'Asm_Input ("f", X1), T'Asm_Input ("f", Y1)));
return R /= 0.0;
end Eq_G;
----------
-- Le_F --
----------
function Le_F (X, Y : F) return Boolean is
X1, Y1, R : S;
begin
Asm ("ldf %0,%1", S'Asm_Output ("=f", X1), F'Asm_Input ("m", X));
Asm ("ldf %0,%1", S'Asm_Output ("=f", Y1), F'Asm_Input ("m", Y));
Asm ("cmpgle %1,%2,%0", S'Asm_Output ("=f", R),
(S'Asm_Input ("f", X1), S'Asm_Input ("f", Y1)));
return R /= 0.0;
end Le_F;
----------
-- Le_G --
----------
function Le_G (X, Y : G) return Boolean is
X1, Y1, R : T;
begin
Asm ("ldg %0,%1", T'Asm_Output ("=f", X1), G'Asm_Input ("m", X));
Asm ("ldg %0,%1", T'Asm_Output ("=f", Y1), G'Asm_Input ("m", Y));
Asm ("cmpgle %1,%2,%0", T'Asm_Output ("=f", R),
(T'Asm_Input ("f", X1), T'Asm_Input ("f", Y1)));
return R /= 0.0;
end Le_G;
----------
-- Lt_F --
----------
function Lt_F (X, Y : F) return Boolean is
X1, Y1, R : S;
begin
Asm ("ldf %0,%1", S'Asm_Output ("=f", X1), F'Asm_Input ("m", X));
Asm ("ldf %0,%1", S'Asm_Output ("=f", Y1), F'Asm_Input ("m", Y));
Asm ("cmpglt %1,%2,%0", S'Asm_Output ("=f", R),
(S'Asm_Input ("f", X1), S'Asm_Input ("f", Y1)));
return R /= 0.0;
end Lt_F;
----------
-- Lt_G --
----------
function Lt_G (X, Y : G) return Boolean is
X1, Y1, R : T;
begin
Asm ("ldg %0,%1", T'Asm_Output ("=f", X1), G'Asm_Input ("m", X));
Asm ("ldg %0,%1", T'Asm_Output ("=f", Y1), G'Asm_Input ("m", Y));
Asm ("cmpglt %1,%2,%0", T'Asm_Output ("=f", R),
(T'Asm_Input ("f", X1), T'Asm_Input ("f", Y1)));
return R /= 0.0;
end Lt_G;
-----------
-- Mul_F --
-----------
function Mul_F (X, Y : F) return F is
X1, Y1, R : S;
R1 : F;
begin
Asm ("ldf %0,%1", S'Asm_Output ("=f", X1), F'Asm_Input ("m", X));
Asm ("ldf %0,%1", S'Asm_Output ("=f", Y1), F'Asm_Input ("m", Y));
Asm ("mulf %1,%2,%0", S'Asm_Output ("=f", R),
(S'Asm_Input ("f", X1), S'Asm_Input ("f", Y1)));
Asm ("stf %1,%0", F'Asm_Output ("=m", R1), S'Asm_Input ("f", R));
return R1;
end Mul_F;
-----------
-- Mul_G --
-----------
function Mul_G (X, Y : G) return G is
X1, Y1, R : T;
R1 : G;
begin
Asm ("ldg %0,%1", T'Asm_Output ("=f", X1), G'Asm_Input ("m", X));
Asm ("ldg %0,%1", T'Asm_Output ("=f", Y1), G'Asm_Input ("m", Y));
Asm ("mulg %1,%2,%0", T'Asm_Output ("=f", R),
(T'Asm_Input ("f", X1), T'Asm_Input ("f", Y1)));
Asm ("stg %1,%0", G'Asm_Output ("=m", R1), T'Asm_Input ("f", R));
return R1;
end Mul_G;
-----------
-- Neg_F --
-----------
function Neg_F (X : F) return F is
A, B : S;
C : F;
begin
Asm ("ldf %0,%1", S'Asm_Output ("=f", A), F'Asm_Input ("m", X));
Asm ("cpysn %1,%1,%0", S'Asm_Output ("=f", B), S'Asm_Input ("f", A));
Asm ("stf %1,%0", F'Asm_Output ("=m", C), S'Asm_Input ("f", B));
return C;
end Neg_F;
-----------
-- Neg_G --
-----------
function Neg_G (X : G) return G is
A, B : T;
C : G;
begin
Asm ("ldg %0,%1", T'Asm_Output ("=f", A), G'Asm_Input ("m", X));
Asm ("cpysn %1,%1,%0", T'Asm_Output ("=f", B), T'Asm_Input ("f", A));
Asm ("stg %1,%0", G'Asm_Output ("=m", C), T'Asm_Input ("f", B));
return C;
end Neg_G;
--------
-- pd --
--------
procedure pd (Arg : D) is
begin
Put_Line (D'Image (Arg));
end pd;
--------
-- pf --
--------
procedure pf (Arg : F) is
begin
Put_Line (F'Image (Arg));
end pf;
--------
-- pg --
--------
procedure pg (Arg : G) is
begin
Put_Line (G'Image (Arg));
end pg;
-----------
-- Sub_F --
-----------
function Sub_F (X, Y : F) return F is
X1, Y1, R : S;
R1 : F;
begin
Asm ("ldf %0,%1", S'Asm_Output ("=f", X1), F'Asm_Input ("m", X));
Asm ("ldf %0,%1", S'Asm_Output ("=f", Y1), F'Asm_Input ("m", Y));
Asm ("subf %1,%2,%0", S'Asm_Output ("=f", R),
(S'Asm_Input ("f", X1), S'Asm_Input ("f", Y1)));
Asm ("stf %1,%0", F'Asm_Output ("=m", R1), S'Asm_Input ("f", R));
return R1;
end Sub_F;
-----------
-- Sub_G --
-----------
function Sub_G (X, Y : G) return G is
X1, Y1, R : T;
R1 : G;
begin
Asm ("ldg %0,%1", T'Asm_Output ("=f", X1), G'Asm_Input ("m", X));
Asm ("ldg %0,%1", T'Asm_Output ("=f", Y1), G'Asm_Input ("m", Y));
Asm ("subg %1,%2,%0", T'Asm_Output ("=f", R),
(T'Asm_Input ("f", X1), T'Asm_Input ("f", Y1)));
Asm ("stg %1,%0", G'Asm_Output ("=m", R1), T'Asm_Input ("f", R));
return R1;
end Sub_G;
end System.Vax_Float_Operations;
|
--//////////////////////////////////////////////////////////
-- SFML - Simple and Fast Multimedia Library
-- Copyright (C) 2007-2015 Laurent Gomila (laurent@sfml-dev.org)
-- This software is provided 'as-is', without any express or implied warranty.
-- In no event will the authors be held liable for any damages arising from the use of this software.
-- Permission is granted to anyone to use this software for any purpose,
-- including commercial applications, and to alter it and redistribute it freely,
-- subject to the following restrictions:
-- 1. The origin of this software must not be misrepresented;
-- you must not claim that you wrote the original software.
-- If you use this software in a product, an acknowledgment
-- in the product documentation would be appreciated but is not required.
-- 2. Altered source versions must be plainly marked as such,
-- and must not be misrepresented as being the original software.
-- 3. This notice may not be removed or altered from any source distribution.
--//////////////////////////////////////////////////////////
with Sf.System.Vector2;
with Sf.Graphics.Transform;
package Sf.Graphics.Transformable is
--//////////////////////////////////////////////////////////
--/ @brief Create a new transformable
--/
--/ @return A new sfTransformable object
--/
--//////////////////////////////////////////////////////////
function create return sfTransformable_Ptr;
--//////////////////////////////////////////////////////////
--/ @brief Copy an existing transformable
--/
--/ @param transformable Transformable to copy
--/
--/ @return Copied object
--/
--//////////////////////////////////////////////////////////
function copy (transformable : sfTransformable_Ptr) return sfTransformable_Ptr;
--//////////////////////////////////////////////////////////
--/ @brief Destroy an existing transformable
--/
--/ @param transformable Transformable to delete
--/
--//////////////////////////////////////////////////////////
procedure destroy (transformable : sfTransformable_Ptr);
--//////////////////////////////////////////////////////////
--/ @brief Set the position of a transformable
--/
--/ This function completely overwrites the previous position.
--/ See sfTransformable_move to apply an offset based on the previous position instead.
--/ The default position of a transformable Transformable object is (0, 0).
--/
--/ @param transformable Transformable object
--/ @param position New position
--/
--//////////////////////////////////////////////////////////
procedure setPosition (transformable : sfTransformable_Ptr; position : Sf.System.Vector2.sfVector2f);
--//////////////////////////////////////////////////////////
--/ @brief Set the orientation of a transformable
--/
--/ This function completely overwrites the previous rotation.
--/ See sfTransformable_rotate to add an angle based on the previous rotation instead.
--/ The default rotation of a transformable Transformable object is 0.
--/
--/ @param transformable Transformable object
--/ @param angle New rotation, in degrees
--/
--//////////////////////////////////////////////////////////
procedure setRotation (transformable : sfTransformable_Ptr; angle : float);
--//////////////////////////////////////////////////////////
--/ @brief Set the scale factors of a transformable
--/
--/ This function completely overwrites the previous scale.
--/ See sfTransformable_scale to add a factor based on the previous scale instead.
--/ The default scale of a transformable Transformable object is (1, 1).
--/
--/ @param transformable Transformable object
--/ @param scale New scale factors
--/
--//////////////////////////////////////////////////////////
procedure setScale (transformable : sfTransformable_Ptr; scale : Sf.System.Vector2.sfVector2f);
--//////////////////////////////////////////////////////////
--/ @brief Set the local origin of a transformable
--/
--/ The origin of an object defines the center point for
--/ all transformations (position, scale, rotation).
--/ The coordinates of this point must be relative to the
--/ top-left corner of the object, and ignore all
--/ transformations (position, scale, rotation).
--/ The default origin of a transformable Transformable object is (0, 0).
--/
--/ @param transformable Transformable object
--/ @param origin New origin
--/
--//////////////////////////////////////////////////////////
procedure setOrigin (transformable : sfTransformable_Ptr; origin : Sf.System.Vector2.sfVector2f);
--//////////////////////////////////////////////////////////
--/ @brief Get the position of a transformable
--/
--/ @param transformable Transformable object
--/
--/ @return Current position
--/
--//////////////////////////////////////////////////////////
function getPosition (transformable : sfTransformable_Ptr) return Sf.System.Vector2.sfVector2f;
--//////////////////////////////////////////////////////////
--/ @brief Get the orientation of a transformable
--/
--/ The rotation is always in the range [0, 360].
--/
--/ @param transformable Transformable object
--/
--/ @return Current rotation, in degrees
--/
--//////////////////////////////////////////////////////////
function getRotation (transformable : sfTransformable_Ptr) return float;
--//////////////////////////////////////////////////////////
--/ @brief Get the current scale of a transformable
--/
--/ @param transformable Transformable object
--/
--/ @return Current scale factors
--/
--//////////////////////////////////////////////////////////
function getScale (transformable : sfTransformable_Ptr) return Sf.System.Vector2.sfVector2f;
--//////////////////////////////////////////////////////////
--/ @brief Get the local origin of a transformable
--/
--/ @param transformable Transformable object
--/
--/ @return Current origin
--/
--//////////////////////////////////////////////////////////
function getOrigin (transformable : sfTransformable_Ptr) return Sf.System.Vector2.sfVector2f;
--//////////////////////////////////////////////////////////
--/ @brief Move a transformable by a given offset
--/
--/ This function adds to the current position of the object,
--/ unlike sfTransformable_setPosition which overwrites it.
--/
--/ @param transformable Transformable object
--/ @param offset Offset
--/
--//////////////////////////////////////////////////////////
procedure move (transformable : sfTransformable_Ptr; offset : Sf.System.Vector2.sfVector2f);
--//////////////////////////////////////////////////////////
--/ @brief Rotate a transformable
--/
--/ This function adds to the current rotation of the object,
--/ unlike sfTransformable_setRotation which overwrites it.
--/
--/ @param transformable Transformable object
--/ @param angle Angle of rotation, in degrees
--/
--//////////////////////////////////////////////////////////
procedure rotate (transformable : sfTransformable_Ptr; angle : float);
--//////////////////////////////////////////////////////////
--/ @brief Scale a transformable
--/
--/ This function multiplies the current scale of the object,
--/ unlike sfTransformable_setScale which overwrites it.
--/
--/ @param transformable Transformable object
--/ @param factors Scale factors
--/
--//////////////////////////////////////////////////////////
procedure scale (transformable : sfTransformable_Ptr; factors : Sf.System.Vector2.sfVector2f);
--//////////////////////////////////////////////////////////
--/ @brief Get the combined transform of a transformable
--/
--/ @param transformable Transformable object
--/
--/ @return Transform combining the position/rotation/scale/origin of the object
--/
--//////////////////////////////////////////////////////////
function getTransform (transformable : sfTransformable_Ptr) return Sf.Graphics.Transform.sfTransform;
--//////////////////////////////////////////////////////////
--/ @brief Get the inverse of the combined transform of a transformable
--/
--/ @param transformable Transformable object
--/
--/ @return Inverse of the combined transformations applied to the object
--/
--//////////////////////////////////////////////////////////
function getInverseTransform (transformable : sfTransformable_Ptr) return Sf.Graphics.Transform.sfTransform;
private
pragma Import (C, create, "sfTransformable_create");
pragma Import (C, copy, "sfTransformable_copy");
pragma Import (C, destroy, "sfTransformable_destroy");
pragma Import (C, setPosition, "sfTransformable_setPosition");
pragma Import (C, setRotation, "sfTransformable_setRotation");
pragma Import (C, setScale, "sfTransformable_setScale");
pragma Import (C, setOrigin, "sfTransformable_setOrigin");
pragma Import (C, getPosition, "sfTransformable_getPosition");
pragma Import (C, getRotation, "sfTransformable_getRotation");
pragma Import (C, getScale, "sfTransformable_getScale");
pragma Import (C, getOrigin, "sfTransformable_getOrigin");
pragma Import (C, move, "sfTransformable_move");
pragma Import (C, rotate, "sfTransformable_rotate");
pragma Import (C, scale, "sfTransformable_scale");
pragma Import (C, getTransform, "sfTransformable_getTransform");
pragma Import (C, getInverseTransform, "sfTransformable_getInverseTransform");
end Sf.Graphics.Transformable;
|
pragma Ada_2012;
with Ada.Strings.Maps.Constants; use Ada.Strings.Maps.Constants;
with Ada.Characters.Latin_9; use Ada.Characters.Latin_9;
with Ada.Text_Io; use Ada.Text_Io;
with Ada.Strings.Fixed;
with Ada.Characters.Handling;
with Ada.Containers.Indefinite_Ordered_Sets;
with Readable_Sequences.String_Sequences;
use Readable_Sequences;
with String_Sets; use String_Sets;
with Gnat.Os_Lib;
package body Protypo.Scanning is
use Ada.Strings.Unbounded;
use Ada.Strings.Maps;
package String_Sets is
new Ada.Containers.Indefinite_Ordered_Sets (String);
function Internal_Tokenize (Template : Protypo.Api.Interpreters.Template_Type;
Base_Dir : String;
Required_Files : in out String_Sets.Set)
return Token_List;
------------------------
-- Parenthesis_String --
------------------------
function Parenthesis_String
(Input : in out String_Sequences.Sequence;
Open : Character;
Close : Character;
Escape : Character)
return String
is
Buffer : String_Sequences.Sequence := String_Sequences.Empty_Sequence;
Parenthesis_Level : Natural := 1;
begin
while Parenthesis_Level > 0 loop
if Input.End_Of_Sequence then
raise Scanning_Error with "Unexpected EOF";
end if;
if Input.Read = Escape then
Input.Next;
Buffer.Append (Input.Next);
elsif Input.Read = Open then
Parenthesis_Level := Parenthesis_Level + 1;
Buffer.Append (Input.Next);
elsif Input.Read = Close then
Parenthesis_Level := Parenthesis_Level - 1;
if Parenthesis_Level > 0 then
Buffer.Append (Input.Read);
end if;
Input.Next;
else
Buffer.Append (Input.Next);
end if;
end loop;
return Buffer.Dump;
end Parenthesis_String;
type Error_Reason is
(Unexpected_Token_In_Code,
Unexpected_Code_End,
Bad_Float);
-----------
-- Error --
-----------
procedure Error (Reason : Error_Reason;
Position : String_Sequences.Position_Type)
is
begin
raise Scanning_Error with (case Reason is
when Unexpected_Token_In_Code =>
"Unexpected token code",
when Unexpected_Code_End =>
"Unexpected end code",
when Bad_Float =>
"Bad Float"
) & " at " & Tokens.Image (Position);
end Error;
Escape : constant Character := '#';
Begin_Of_Code : constant String := Escape & "{";
Template_Comment : constant String := Escape & "--";
Directive_Begin : constant Character := '(';
Directive_Marker : constant String := Escape & Directive_Begin;
-- Short_Code_Begin : constant Set_String := "#" & Letter_Set;
-- Transparent_Comment : constant String := "%#";
-- Target_Comment : constant String := "%";
function Does_It_Follow (Where : String_Sequences.Sequence;
Pattern : Set_String)
return Boolean;
-- Return true if a string matching Pattern is found at the current
-- position
function Does_It_Follow (Where : String_Sequences.Sequence;
What : String)
return Boolean;
-- Syntactic sugar for when the set contains only one string
function Peek_And_Eat (Where : in out String_Sequences.Sequence;
What : String)
return Boolean;
-- If What is at the current position, "eat it" and return true,
-- otherwise leave the position unchanged and return false.
-- Very convenient
function Does_It_Follow (Where : String_Sequences.Sequence;
Pattern : Set_String)
return Boolean
is (Match (Where.Dump (From => Where.Current_Position), Pattern));
--------------------
-- Does_It_Follow --
--------------------
function Does_It_Follow (Where : String_Sequences.Sequence;
What : String)
return Boolean
is (Does_It_Follow (Where, To_Set_String (What)));
-- Syntactic sugar for when the set contains only one string
------------------
-- Peek_And_Eat --
------------------
function Peek_And_Eat (Where : in out String_Sequences.Sequence;
What : String)
return Boolean
is
begin
if Does_It_Follow (Where, What) then
Where.Next (What'Length);
return True;
else
return False;
end if;
end Peek_And_Eat;
--------------------
-- At_End_Of_Line --
--------------------
Eol_Markers : constant Ada.Strings.Maps.Character_Set :=
Ada.Strings.Maps.To_Set ("" & Cr & Lf);
function At_End_Of_Line (Input : String_Sequences.Sequence) return Boolean
is (Input.End_Of_Sequence
or else Ada.Strings.Maps.Is_In (Input.Read, Eol_Markers));
------------------
-- Skip_Comment --
------------------
procedure Skip_To_End_Of_Line (Input : in out String_Sequences.Sequence) is
begin
while not At_End_Of_Line (Input) loop
Input.Next;
end loop;
end Skip_To_End_Of_Line;
------------------
-- Code_Scanner --
------------------
procedure Code_Scanner (Input : in out String_Sequences.Sequence;
Result : in out Token_List)
with Post => Result.Length > Result.Length'Old;
procedure Code_Scanner (Input : in out String_Sequences.Sequence;
Result : in out Token_List)
is
use Tokens;
function "+" (X : String) return Unbounded_String
renames To_Unbounded_String;
Simple_Tokens : constant array (Not_Keyword) of Unbounded_String :=
(
Plus => +"+",
Minus => +"-",
Mult => +"*",
Div => +"/",
Equal => +"=",
Different => +"/=",
Less_Than => +"<",
Greater_Than => +">",
Less_Or_Equal => +"<=",
Greater_Or_Equal => +">=",
Assign => +":=",
Dot => +".",
Open_Parenthesis => +"(",
Close_Parenthesis => +")",
Tokens.Comma => +",",
Label_Separator => +":",
End_Of_Statement => +";"
);
Keywords : constant array (Keyword_Tokens) of Unbounded_String :=
(Kw_If => +"if",
Kw_Then => +"then",
Kw_Elsif => +"elsif",
Kw_Else => +"else",
Kw_Case => +"case",
Kw_When => +"when",
Kw_For => +"for",
Kw_Loop => +"loop",
Kw_While => +"while",
Kw_Return => +"return",
Kw_Function => +"function",
Kw_Procedure => +"procedure",
Kw_Capture => +"capture",
Kw_Begin => +"begin",
Kw_Exit => +"exit",
Kw_End => +"end",
Kw_And => +"and",
Kw_Or => +"or",
Kw_Xor => +"xor",
Kw_Not => +"not",
Kw_Mod => +"mod",
Kw_In => +"in",
Kw_Is => +"is",
Kw_Of => +"of");
Builder : Tokens.Token_Builder;
procedure Skip_Spaces
with
Pre => not Builder.Is_Position_Set,
Post => not Builder.Is_Position_Set;
procedure Scan_Identifier
with
Pre => Builder.Is_Position_Set,
Post => not Builder.Is_Position_Set;
procedure Scan_Number
with
Pre => Builder.Is_Position_Set,
Post => not Builder.Is_Position_Set;
procedure Scan_Text
with
Pre => Builder.Is_Position_Set,
Post => not Builder.Is_Position_Set;
procedure Scan_Embedded_Text
with
Pre => Builder.Is_Position_Set,
Post => not Builder.Is_Position_Set;
procedure Skip_Spaces is
Whitespace : constant Character_Set := To_Set (" " & Ht & Lf & Cr);
begin
while (not Input.End_Of_Sequence) and then Is_In (Input.Read, Whitespace) loop
Input.Next;
end loop;
end Skip_Spaces;
procedure Scan_Identifier is
function Is_A_Keyword (Id : String;
Keyword : out Keyword_Tokens)
return Boolean
is
begin
for Tk in Keywords'Range loop
if To_String (Keywords (Tk)) = Id then
Keyword := Tk;
return True;
end if;
end loop;
Keyword := Keyword_Tokens'First; -- Just to avoid warnings
return false;
end Is_A_Keyword;
Id : String_Sequences.Sequence := String_Sequences.Empty_Sequence;
begin
while Is_In (Input.Read, Id_Charset) loop
Id.Append (Input.Next);
-- Input.Next;
end loop;
if Is_In (Input.Read, End_Id_Set) then
-- If the current char belongs to Id_End_Charset (just '?')
-- at the moment, it is still part of the identifier
Id.Append (Input.Next);
end if;
declare
Id_Image : constant String := Id.Dump;
Keyword : Keyword_Tokens;
begin
if Is_A_Keyword (Id_Image, Keyword) then
-- for Tk in Keywords'Range loop
-- if To_String (Keywords (Tk)) = Id_image then
Result.Append (Builder.Make_Token (Keyword));
return;
elsif Id_Image = "@here" then
Result.Append (Builder.Make_Token
(Class => Text,
Value => Image (Builder.Peek_Position)));
return;
else
Result.Append (Builder.Make_Token (Identifier, Id_Image));
return;
end if;
end;
end Scan_Identifier;
procedure Scan_Number is
Buffer : String_Sequences.Sequence := String_Sequences.Empty_Sequence;
begin
while Is_In (Input.Read, Decimal_Digit_Set) loop
Buffer.Append (Input.Next);
end loop;
if Input.Read /= '.' then
Result.Append (Builder.Make_Token (Int, Buffer.Dump));
return;
end if;
Buffer.Append (Input.Next);
while Is_In (Input.Read, Decimal_Digit_Set) loop
Buffer.Append (Input.Next);
end loop;
if Input.Read = 'e' or Input.Read = 'E' then
Buffer.Append (Input.Next);
if Input.Read = '+' or Input.Read = '-' then
Buffer.Append (Input.Next);
end if;
if not Is_In (Input.Read, Decimal_Digit_Set) then
Error (Bad_Float, String_Sequences.Position (Input));
end if;
while Is_In (Input.Read, Decimal_Digit_Set) loop
Buffer.Append (Input.Next);
end loop;
end if;
Result.Append (Builder.Make_Token (Real, Buffer.Dump));
end Scan_Number;
procedure Scan_Text is
Buffer : String_Sequences.Sequence := String_Sequences.Empty_Sequence;
begin
Buffer.Clear;
loop
if Peek_And_Eat (Input, """") then
if Input.Read /= '"' then
Result.Append (Builder.Make_Token (Text, Buffer.Dump));
return;
end if;
end if;
Buffer.Append (Input.Next);
end loop;
end Scan_Text;
procedure Scan_Embedded_Text is
Content : constant String := Parenthesis_String (Input => Input,
Open => '[',
Close => ']',
Escape => '\');
begin
-- Buffer.Clear;
--
-- loop
-- if Peek_And_Eat (Input, "]") then
-- exit when Input.Read /= ']';
-- end if;
--
-- Buffer.Append (Input.Next);
-- end loop;
Result.Append (Builder.Make_Token (Identifier, String (Consume_With_Escape_Procedure_Name)));
Result.Append (Make_Unanchored_Token (Open_Parenthesis));
Result.Append (Make_Unanchored_Token (Text, Content));
Result.Append (Make_Unanchored_Token (Close_Parenthesis));
Result.Append (Make_Unanchored_Token (End_Of_Statement));
end Scan_Embedded_Text;
begin
loop
Skip_Spaces;
Builder.Set_Position (Input.Position);
exit when Peek_And_Eat (Input, "}#");
if Peek_And_Eat (Input, "--") then
Builder.Clear_Position;
Skip_To_End_Of_Line (Input);
elsif Is_In (Input.Read, Begin_Id_Set) then
Scan_Identifier;
elsif Is_In (Input.Read, Decimal_Digit_Set) then
Scan_Number;
elsif Peek_And_Eat (Input, """") then
Scan_Text;
elsif Peek_And_Eat (Input, "[") then
Scan_Embedded_Text;
else
declare
Best_Match_Len : Natural := 0;
Best_Match : Not_Keyword;
This_Match_Len : Natural;
begin
for Tk in Simple_Tokens'Range loop
if Does_It_Follow (Input, To_String (Simple_Tokens (Tk))) then
This_Match_Len := Length (Simple_Tokens (Tk));
if This_Match_Len = Best_Match_Len then
-- This should never happen
raise Program_Error;
elsif This_Match_Len > Best_Match_Len then
Best_Match_Len := This_Match_Len;
Best_Match := Tk;
end if;
end if;
end loop;
if Best_Match_Len > 0 then
Result.Append (Builder.Make_Token (Best_Match));
Input.Next (Best_Match_Len);
else
-- Put_Line ("[" & Input.Read & "]"
-- & String_Sequences.Line (Input.Position)'Image
-- & String_Sequences.Char (Input.Position)'Image);
Error (Unexpected_Token_In_Code, String_Sequences.Position (Input));
end if;
end;
end if;
pragma Assert (not Builder.Is_Position_Set);
end loop;
exception
when String_Sequences.Beyond_End =>
Error (Unexpected_Code_End, String_Sequences.Position (Input));
end Code_Scanner;
-----------------
-- Dump_Buffer --
-----------------
procedure Dump_Buffer (Buffer : in out String_Sequences.Sequence;
Result : in out Token_List)
with
Post =>
Buffer.Length = 0
and Result.Length = Result.Length'Old + (if Buffer.Length'Old > 0 then 5 else 0);
procedure Dump_Buffer (Buffer : in out String_Sequences.Sequence;
Result : in out Token_List)
is
use Tokens;
begin
if Buffer.Length > 0 then
Result.Append (Make_Unanchored_Token (Identifier, String (Consume_Procedure_Name)));
Result.Append (Make_Unanchored_Token (Open_Parenthesis));
Result.Append (Make_Unanchored_Token (Text, Buffer.Dump));
Result.Append (Make_Unanchored_Token (Close_Parenthesis));
Result.Append (Make_Unanchored_Token (End_Of_Statement));
Buffer.Clear;
end if;
end Dump_Buffer;
procedure Process_Directive (Input : in out String_Sequences.Sequence;
Result : in out Token_List;
Base_Dir : String;
Required_Files : in out String_Sets.Set)
is
use Ada.Strings.Fixed;
use Ada.Strings;
use Ada.Characters.Handling;
type Directive_Name is new String;
Include_Once : constant Directive_Name := "with";
Include_Always : constant Directive_Name := "include";
Raw : constant String := Parenthesis_String (Input => Input,
Open => '(',
Close => ')',
Escape => '\');
Trimmed : constant String := Trim (Raw, Left);
End_Directive_Pos : constant Natural := Index (Source => Trimmed,
Pattern => " ");
Directive : constant Directive_Name :=
Directive_Name
(To_Lower (if (End_Directive_Pos = 0) then
Trimmed
else
Trimmed (Trimmed'First .. End_Directive_Pos - 1)));
Parameter : constant String :=
Trim ((if End_Directive_Pos < Trimmed'Last then
Trimmed (End_Directive_Pos + 1 .. Trimmed'Last)
else
""), Left);
begin
if Directive = Include_Always or Directive = Include_Once then
declare
use Gnat.Os_Lib;
use Api;
Filename : constant String :=
Normalize_Pathname (Name => Parameter,
Directory => Base_Dir);
begin
if Directive = Include_Always or not Required_Files.Contains (Filename) then
if Directive = Include_Once then
Required_Files.Include (Filename);
end if;
Result.Append
(Internal_Tokenize (Template => Interpreters.Slurp (Filename),
Base_Dir => Base_Dir,
Required_Files => Required_Files));
end if;
end;
else
Put_Line (Standard_Error, "Directive '" & String (Directive) & "' unknown");
end if;
end Process_Directive;
-----------------------
-- Internal_Tokenize --
-----------------------
function Internal_Tokenize (Template : Protypo.Api.Interpreters.Template_Type;
Base_Dir : String;
Required_Files : in out String_Sets.Set)
return Token_List is
use Tokens;
Input : String_Sequences.Sequence :=
String_Sequences.Create (String (Template));
Buffer : String_Sequences.Sequence :=
String_Sequences.Empty_Sequence;
procedure Handle_Escape (Result : in out Token_List)
with Pre => Input.Read = Escape and Input.Remaining > 1;
procedure Handle_Escape (Result : in out Token_List) is
begin
if Does_It_Follow (Input, Begin_Of_Code) then
Dump_Buffer (Buffer, Result);
Input.Next (Begin_Of_Code'Length);
Code_Scanner (Input, Result);
elsif Does_It_Follow (Input, Directive_Marker) then
Dump_Buffer (Buffer, Result);
Input.Next (Directive_Marker'Length);
Process_Directive (Input, Result, Base_Dir, Required_Files);
elsif Does_It_Follow (Input, Template_Comment) then
Skip_To_End_Of_Line (Input);
else
Buffer.Append (Input.Next);
Buffer.Append (Input.Next);
end if;
end Handle_Escape;
begin
return Result : Token_List :=
Token_Sequences.Create (Make_Unanchored_Token (End_Of_Text))
do
while not Input.End_Of_Sequence loop
if Input.Read = Escape and Input.Remaining > 1 then
Handle_Escape (Result);
else
Buffer.Append (Input.Next);
end if;
end loop;
Dump_Buffer (Buffer, Result);
end return;
end Internal_Tokenize;
--------------
-- Tokenize --
--------------
function Tokenize (Template : Protypo.Api.Interpreters.Template_Type;
Base_Dir : String) return Token_List
is
Required_Files : String_Sets.Set;
begin
Required_Files.Clear;
return Internal_Tokenize (Template, Base_Dir, Required_Files);
end Tokenize;
----------
-- Dump --
----------
procedure Dump (Item : Token_List)
is
use Tokens;
procedure Print (X : Token) is
begin
Put_Line (Image (X));
end Print;
begin
Item.Process (Print'Access);
end Dump;
end Protypo.Scanning;
|
with Ada.Text_IO;
with Futures;
package body App is
procedure Show_Search
(Self : in out Object;
Target : String )
is
function Callable_String
return String
is
begin
-- delay 10.0; -- for triggering timeout...
return Self.Searcher.Search(Target);
end Callable_String;
package Future_String is
new Futures(String);
Future : Future_String.Object := Future_String.Create(Callable_String'Access);
begin
Self.Executor.Execute(Future.Promise);
Self.Display_Other_Things;
Self.Display_Text(Future.Get);
exception
when Future_String.Execution_Exception =>
Ada.Text_IO.Put_Line("***Operation timed out");
Self.Clean_Up;
end Show_Search;
procedure Display_Other_Things
(Self : in out Object)
is
begin
Ada.Text_IO.Put_Line("Display_Other_Things");
end Display_Other_Things;
procedure Display_Text
(Self : in out Object;
Text : in String)
is
begin
Ada.Text_IO.Put_Line("Display_Text: " & Text);
end Display_Text;
procedure Clean_Up
(Self : in out Object)
is
begin
null;
end Clean_Up;
end App;
|
with Generic_Ulam, Ada.Text_IO, Prime_Numbers;
procedure Ulam is
package P is new Prime_Numbers(Natural, 0, 1, 2);
function Vis(N: Natural) return String is
(if P.Is_Prime(N) then " <>" else " ");
function Num(N: Natural) return String is
(if P.Is_Prime(N) then
(if N < 10 then " " elsif N < 100 then " " else "") & Natural'Image(N)
else " ---");
procedure NL is
begin
Ada.Text_IO.New_Line;
end NL;
package Numeric is new Generic_Ulam(29, Num, Ada.Text_IO.Put, NL);
package Visual is new Generic_Ulam(10, Vis, Ada.Text_IO.Put, NL);
begin
Numeric.Print_Spiral;
NL;
Visual.Print_Spiral;
end Ulam;
|
with Interfaces; use Interfaces;
package body Natools.S_Expressions.Printers.Pretty.Config.Quoted_Cmd is
P : constant array (0 .. 2) of Natural :=
(1, 4, 10);
T1 : constant array (0 .. 2) of Unsigned_8 :=
(11, 3, 3);
T2 : constant array (0 .. 2) of Unsigned_8 :=
(14, 19, 16);
G : constant array (0 .. 22) of Unsigned_8 :=
(2, 0, 0, 10, 0, 0, 0, 1, 0, 0, 5, 9, 0, 0, 1, 10, 0, 3, 0, 7, 0, 6, 0);
function Hash (S : String) return Natural is
F : constant Natural := S'First - 1;
L : constant Natural := S'Length;
F1, F2 : Natural := 0;
J : Natural;
begin
for K in P'Range loop
exit when L < P (K);
J := Character'Pos (S (P (K) + F));
F1 := (F1 + Natural (T1 (K)) * J) mod 23;
F2 := (F2 + Natural (T2 (K)) * J) mod 23;
end loop;
return (Natural (G (F1)) + Natural (G (F2))) mod 11;
end Hash;
end Natools.S_Expressions.Printers.Pretty.Config.Quoted_Cmd;
|
with Ada.Text_Io; use Ada.Text_Io;
with vectores; use vectores;
with esta_en_vector;
procedure prueba_esta_en_vector is
-- este programa hace llamadas a la funcion esta_en_vector y es util
-- para comprobar si su funcionamiento es correcto
procedure escribir_booleano(valor: in Boolean) is
begin
if(valor) then
put("True");
else
put("False");
end if;
end escribir_booleano;
Vector1: Vector_De_Enteros(1..10);
Vector2: Vector_De_Enteros(800..804);
rdo: boolean;
begin
vector1 := (1, 3, 5, 7, 19, 6, 13, 15, 17, 9);
put_line("Caso 1: el valor esta en medio");
put_line(" esta_en_vector(13, (1, 3, 5, 7, 19, 6, 13, 15, 17, 9))");
put_line(" debe ser True y el resultado es ");
rdo:=esta_en_vector(13, vector1);
escribir_booleano(rdo);
new_line(3);
put_line("Pulsa return para continuar");
skip_line;
new_line(3);
vector1 := (1, 3, 5, 7, 19, 6, 13, 15, 17, 9);
put_line("Caso 2: el valor esta al final");
put_line(" esta_en_vector(9, (1, 3, 5, 7, 19, 6, 13, 15, 17, 9))");
put_line(" debe ser True y el resultado es ");
rdo:=esta_en_vector(9, vector1);
escribir_booleano(rdo);
new_line(3);
put_line("Pulsa return para continuar");
skip_line;
new_line(3);
vector1 := (1, 3, 5, 7, 19, 6, 13, 15, 17, 9);
put_line("Caso 3: el valor no esta, se debe recorrer todo el vector");
put_line(" esta_en_vector(45, (1, 3, 5, 7, 19, 6, 13, 15, 17, 9))");
put_line(" debe ser False y el resultado es ");
rdo:=esta_en_vector(45, vector1);
escribir_booleano(rdo);
new_line(3);
put_line("Pulsa return para continuar");
skip_line;
new_line(3);
-- mis casos de prueba
vector2 := (0, 1, 3, 5, 7);
put_line("Caso 3: vector corto, el valor esta al final");
put_line(" esta_en_vector(7, (1, 3, 5, 7))");
put_line(" debe ser True y el resultado es ");
rdo:=esta_en_vector(7, vector1);
escribir_booleano(rdo);
new_line(3);
put_line("Pulsa return para continuar");
skip_line;
new_line(3);
vector2 := (0, 13, 15, 17, 9);
put_line("Caso 3: vector corto, el valor no esta, se debe recorrer todo el vector");
put_line(" esta_en_vector(45, (13, 15, 17, 9))");
put_line(" debe ser False y el resultado es ");
rdo:=esta_en_vector(45, vector1);
escribir_booleano(rdo);
new_line(3);
put_line("Pulsa return para continuar");
skip_line;
new_line(3);
end prueba_esta_en_vector;
|
-----------------------------------------------------------------------
-- Util.Serialize.Mappers.Record_Mapper -- Mapper for record types
-- Copyright (C) 2010, 2011 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.Unchecked_Deallocation;
with Util.Serialize.Contexts;
with Util.Strings.Transforms;
with Util.Log.Loggers;
package body Util.Serialize.Mappers.Record_Mapper is
use Util.Log;
Key : Util.Serialize.Contexts.Data_Key;
-- The logger
Log : constant Loggers.Logger := Loggers.Create ("Util.Serialize.Mappers.Record_Mapper",
Util.Log.WARN_LEVEL);
-- -----------------------
-- Get the element object.
-- -----------------------
function Get_Element (Data : in Element_Data) return Element_Type_Access is
begin
return Data.Element;
end Get_Element;
-- -----------------------
-- Set the element object. When <b>Release</b> is set, the element <b>Element</b>
-- will be freed when the reader context is deleted (by <b>Finalize</b>).
-- -----------------------
procedure Set_Element (Data : in out Element_Data;
Element : in Element_Type_Access;
Release : in Boolean := False) is
begin
Data.Element := Element;
Data.Release := Release;
end Set_Element;
-- -----------------------
-- Finalize the object when it is removed from the reader context.
-- If the
-- -----------------------
overriding
procedure Finalize (Data : in out Element_Data) is
procedure Free is
new Ada.Unchecked_Deallocation (Object => Element_Type,
Name => Element_Type_Access);
begin
if Data.Release then
Free (Data.Element);
end if;
end Finalize;
-- -----------------------
-- Execute the mapping operation on the object associated with the current context.
-- The object is extracted from the context and the <b>Execute</b> operation is called.
-- -----------------------
procedure Execute (Handler : in Mapper;
Map : in Mapping'Class;
Ctx : in out Util.Serialize.Contexts.Context'Class;
Value : in Util.Beans.Objects.Object) is
D : constant Contexts.Data_Access := Ctx.Get_Data (Key);
begin
if not (D.all in Element_Data'Class) then
raise Util.Serialize.Contexts.No_Data;
end if;
declare
DE : constant Element_Data_Access := Element_Data'Class (D.all)'Access;
begin
if DE.Element = null then
raise Util.Serialize.Contexts.No_Data;
end if;
Handler.Execute (Map, DE.Element.all, Value);
end;
end Execute;
-- -----------------------
-- Add a mapping for setting a member. When the attribute rule defined by <b>Path</b>
-- is matched, the <b>Set_Member</b> procedure will be called with the value and the
-- <b>Field</b> identification.
-- -----------------------
procedure Add_Mapping (Into : in out Mapper;
Path : in String;
Field : in Fields) is
Map : constant Attribute_Mapping_Access := new Attribute_Mapping;
begin
Map.Index := Field;
Into.Add_Mapping (Path, Map.all'Unchecked_Access);
end Add_Mapping;
-- -----------------------
-- Add a mapping associated with the path and described by a mapper object.
-- The <b>Proxy</b> procedure is in charge of giving access to the target
-- object used by the <b>Map</b> mapper.
-- -----------------------
procedure Add_Mapping (Into : in out Mapper;
Path : in String;
Map : in Util.Serialize.Mappers.Mapper_Access;
Proxy : in Proxy_Object) is
M : constant Proxy_Mapper_Access := new Proxy_Mapper;
begin
M.Mapper := Map;
M.Execute := Proxy;
M.Is_Proxy_Mapper := True;
Into.Add_Mapping (Path, M.all'Unchecked_Access);
end Add_Mapping;
--
procedure Bind (Into : in out Mapper;
Getter : in Get_Member_Access) is
begin
Into.Get_Member := Getter;
end Bind;
procedure Bind (Into : in out Mapper;
From : in Mapper_Access) is
begin
Into.Get_Member := From.Get_Member;
end Bind;
function Get_Getter (From : in Mapper) return Get_Member_Access is
begin
return From.Get_Member;
end Get_Getter;
procedure Set_Member (Attr : in Attribute_Mapping;
Element : in out Element_Type;
Value : in Util.Beans.Objects.Object) is
begin
Set_Member (Element, Attr.Index, Value);
end Set_Member;
-- -----------------------
-- Set the attribute member described by the <b>Attr</b> mapping
-- into the value passed in <b>Element</b>. This operation will call
-- the package parameter function of the same name.
-- -----------------------
procedure Set_Member (Attr : in Mapping'Class;
Element : in out Element_Type;
Value : in Util.Beans.Objects.Object) is
begin
if not (Attr in Attribute_Mapping) then
Log.Error ("Mapping is not an Attribute_Mapping");
raise Mapping_Error;
end if;
Attribute_Mapping (Attr).Set_Member (Element, Value);
end Set_Member;
-- -----------------------
-- Set the element in the context. When <b>Release</b> is set, the element <b>Element</b>
-- will be freed when the reader context is deleted (by <b>Finalize</b>).
-- -----------------------
procedure Set_Context (Ctx : in out Util.Serialize.Contexts.Context'Class;
Element : in Element_Type_Access;
Release : in Boolean := False) is
Data_Context : constant Element_Data_Access := new Element_Data;
begin
Data_Context.Element := Element;
Data_Context.Release := Release;
Ctx.Set_Data (Key => Key, Content => Data_Context.all'Unchecked_Access);
end Set_Context;
-- -----------------------
-- Find the mapper associated with the given name.
-- Returns null if there is no mapper.
-- -----------------------
overriding
function Find_Mapper (Controller : in Proxy_Mapper;
Name : in String;
Attribute : in Boolean := False) return Mappers.Mapper_Access is
Result : constant Mappers.Mapper_Access := Controller.Mapper.Find_Mapper (Name, Attribute);
begin
if Result /= null then
return Result;
else
return Util.Serialize.Mappers.Mapper (Controller).Find_Mapper (Name, Attribute);
end if;
end Find_Mapper;
-- -----------------------
-- Build a default mapping based on the <b>Fields</b> enumeration.
-- The enumeration name is used for the mapping name with the optional <b>FIELD_</b>
-- prefix stripped.
-- -----------------------
procedure Add_Default_Mapping (Into : in out Mapper) is
use Util.Strings.Transforms;
begin
for Field in Fields'Range loop
declare
Name : constant String := To_Lower_Case (Fields'Image (Field));
begin
if Name (Name'First .. Name'First + 5) = "field_" then
Into.Add_Mapping (Name (Name'First + 6 .. Name'Last), Field);
else
Into.Add_Mapping (Name, Field);
end if;
end;
end loop;
end Add_Default_Mapping;
-- -----------------------
-- Write the element on the stream using the mapper description.
-- -----------------------
procedure Write (Handler : in Mapper;
Stream : in out Util.Serialize.IO.Output_Stream'Class;
Element : in Element_Type) is
begin
if Handler.Get_Member = null then
Log.Error ("The mapper has a null Get_Member function");
raise Mapping_Error with "The mapper has a null Get_Member function";
end if;
Write (Handler, Handler.Get_Member, Stream, Element);
end Write;
-- -----------------------
-- Write the element on the stream using the mapper description.
-- -----------------------
procedure Write (Handler : in Util.Serialize.Mappers.Mapper'Class;
Getter : in Get_Member_Access;
Stream : in out Util.Serialize.IO.Output_Stream'Class;
Element : in Element_Type) is
use Ada.Strings.Unbounded;
procedure Write (Map : in Util.Serialize.Mappers.Mapper'Class);
procedure Write (Map : in Util.Serialize.Mappers.Mapper'Class) is
Name : constant String := To_String (Map.Name);
begin
if Map.Mapping /= null then
declare
M : constant Attribute_Mapping_Access
:= Attribute_Mapping'Class (Map.Mapping.all)'Access;
Val : constant Util.Beans.Objects.Object := Getter (Element, M.Index);
begin
if M.Is_Attribute then
Stream.Write_Attribute (Name => Name, Value => Val);
else
Stream.Write_Entity (Name => Name, Value => Val);
end if;
end;
else
Stream.Start_Entity (Name);
Map.Iterate (Write'Access);
Stream.End_Entity (Name);
end if;
end Write;
begin
Handler.Iterate (Write'Access);
end Write;
-- -----------------------
-- Clone the <b>Handler</b> instance and get a copy of that single object.
-- -----------------------
function Clone (Handler : in Mapper) return Util.Serialize.Mappers.Mapper_Access is
Result : constant Mapper_Access := new Mapper;
begin
Result.Name := Handler.Name;
Result.Mapper := Handler.Mapper;
Result.Mapping := Handler.Mapping;
Result.Is_Proxy_Mapper := Handler.Is_Proxy_Mapper;
Result.Is_Wildcard := Handler.Is_Wildcard;
Result.Is_Deep_Wildcard := Handler.Is_Deep_Wildcard;
Result.Get_Member := Handler.Get_Member;
Result.Execute := Handler.Execute;
return Result.all'Unchecked_Access;
end Clone;
begin
-- Allocate the unique data key.
Util.Serialize.Contexts.Allocate (Key);
end Util.Serialize.Mappers.Record_Mapper;
|
with Ada.Containers.Indefinite_Doubly_Linked_Lists;
with Ada.Text_IO;
procedure Multisplit is
package String_Lists is new Ada.Containers.Indefinite_Doubly_Linked_Lists
(Element_Type => String);
use type String_Lists.Cursor;
function Split
(Source : String;
Separators : String_Lists.List)
return String_Lists.List
is
Result : String_Lists.List;
Next_Position : Natural := Source'First;
Prev_Position : Natural := Source'First;
Separator_Position : String_Lists.Cursor;
Separator_Length : Natural;
Changed : Boolean;
begin
loop
Changed := False;
Separator_Position := Separators.First;
while Separator_Position /= String_Lists.No_Element loop
Separator_Length :=
String_Lists.Element (Separator_Position)'Length;
if Next_Position + Separator_Length - 1 <= Source'Last
and then Source
(Next_Position .. Next_Position + Separator_Length - 1) =
String_Lists.Element (Separator_Position)
then
if Next_Position > Prev_Position then
Result.Append
(Source (Prev_Position .. Next_Position - 1));
end if;
Result.Append (String_Lists.Element (Separator_Position));
Next_Position := Next_Position + Separator_Length;
Prev_Position := Next_Position;
Changed := True;
exit;
end if;
Separator_Position := String_Lists.Next (Separator_Position);
end loop;
if not Changed then
Next_Position := Next_Position + 1;
end if;
if Next_Position > Source'Last then
Result.Append (Source (Prev_Position .. Source'Last));
exit;
end if;
end loop;
return Result;
end Split;
Test_Input : constant String := "a!===b=!=c";
Test_Separators : String_Lists.List;
Test_Result : String_Lists.List;
Pos : String_Lists.Cursor;
begin
Test_Separators.Append ("==");
Test_Separators.Append ("!=");
Test_Separators.Append ("=");
Test_Result := Split (Test_Input, Test_Separators);
Pos := Test_Result.First;
while Pos /= String_Lists.No_Element loop
Ada.Text_IO.Put (" " & String_Lists.Element (Pos));
Pos := String_Lists.Next (Pos);
end loop;
Ada.Text_IO.New_Line;
-- other order of separators
Test_Separators.Clear;
Test_Separators.Append ("=");
Test_Separators.Append ("!=");
Test_Separators.Append ("==");
Test_Result := Split (Test_Input, Test_Separators);
Pos := Test_Result.First;
while Pos /= String_Lists.No_Element loop
Ada.Text_IO.Put (" " & String_Lists.Element (Pos));
Pos := String_Lists.Next (Pos);
end loop;
end Multisplit;
|
-- part of AdaYaml, (c) 2017 Felix Krause
-- released under the terms of the MIT license, see the file "copying.txt"
with Interfaces.C;
with System;
package Yaml.Destination.C_String is
type Instance is new Destination.Instance with private;
function As_Destination (Raw : System.Address;
Size : Interfaces.C.size_t;
Size_Written : access Interfaces.C.size_t)
return Pointer;
overriding procedure Write_Data (D : in out Instance;
Buffer : String);
private
type Instance is new Destination.Instance with record
Raw : System.Address;
Size : Integer;
Size_Written : access Interfaces.C.size_t;
end record;
end Yaml.Destination.C_String;
|
with Ada.Text_IO;
procedure Hello_World is
use Ada.Text_IO;
begin
Put_line ("Hello, World!");
end Hello_World;
|
with
openGL.Geometry,
openGL.Texture;
package openGL.Model.hexagon_Column.lit_colored_faceted
--
-- Models a lit, colored and textured column with 6 faceted shaft sides.
--
is
type Item is new Model.hexagon_Column.Item with private;
type View is access all Item'Class;
---------
--- Faces
--
type hex_Face is
record
center_Color : lucid_Color; -- The color of the center of the hex.
Colors : lucid_Colors (1 .. 6); -- The color of each of the faces 4 vertices.
end record;
type shaft_Face is
record
Color : lucid_Color; -- The color of the shaft.
end record;
---------
--- Forge
--
function new_hexagon_Column (Radius : in Real;
Height : in Real;
Upper,
Lower : in hex_Face;
Shaft : in shaft_Face) return View;
--------------
--- Attributes
--
overriding
function to_GL_Geometries (Self : access Item; Textures : access Texture.name_Map_of_texture'Class;
Fonts : in Font.font_id_Map_of_font) return Geometry.views;
private
type Item is new Model.hexagon_Column.item with
record
upper_Face,
lower_Face : hex_Face;
Shaft : shaft_Face;
end record;
end openGL.Model.hexagon_Column.lit_colored_faceted;
|
-----------------------------------------------------------------------
-- wi2wic-rest -- REST entry points
-- Copyright (C) 2020 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Servlet.Core;
private with Wiki.Documents;
private with Servlet.Requests;
private with Servlet.Responses;
private with Servlet.Rest;
private with Servlet.Streams;
package Wi2wic.Rest is
procedure Register (Server : in out Servlet.Core.Servlet_Registry'Class);
private
function Get_Syntax (Name : in String) return Wiki.Wiki_Syntax;
procedure Render_Html (Doc : in out Wiki.Documents.Document;
Output : in out Servlet.Rest.Output_Stream'Class);
procedure Render_Doc (Doc : in out Wiki.Documents.Document;
Syntax : in Wiki.Wiki_Syntax;
Output : in out Servlet.Rest.Output_Stream'Class);
procedure Import_Doc (Doc : in out Wiki.Documents.Document;
Syntax : in Wiki.Wiki_Syntax;
Stream : in out Servlet.Streams.Input_Stream'Class);
-- Import an HTML content by getting the HTML content from a URL
-- and convert to the target wiki syntax.
procedure Import (Req : in out Servlet.Requests.Request'Class;
Reply : in out Servlet.Responses.Response'Class;
Stream : in out Servlet.Rest.Output_Stream'Class);
-- Convert a Wiki text from one format to another.
procedure Convert (Req : in out Servlet.Requests.Request'Class;
Reply : in out Servlet.Responses.Response'Class;
Stream : in out Servlet.Rest.Output_Stream'Class);
-- Render the Wiki content in HTML.
procedure Render (Req : in out Servlet.Requests.Request'Class;
Reply : in out Servlet.Responses.Response'Class;
Stream : in out Servlet.Rest.Output_Stream'Class);
end Wi2wic.Rest;
|
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
package Program.Elements.Paths is
pragma Pure (Program.Elements.Paths);
type Path is limited interface and Program.Elements.Element;
type Path_Access is access all Path'Class with Storage_Size => 0;
end Program.Elements.Paths;
|
package body OpenGL.Buffer is
procedure Clear (Mask : in Buffer_Mask_t) is
begin
Thin.Clear (Thin.Bitfield_t (Mask));
end Clear;
procedure Clear_Color
(Red : in OpenGL.Types.Clamped_Float_t;
Green : in OpenGL.Types.Clamped_Float_t;
Blue : in OpenGL.Types.Clamped_Float_t;
Alpha : in OpenGL.Types.Clamped_Float_t) is
begin
Thin.Clear_Color
(Red => Thin.Float_t (Red),
Green => Thin.Float_t (Green),
Blue => Thin.Float_t (Blue),
Alpha => Thin.Float_t (Alpha));
end Clear_Color;
end OpenGL.Buffer;
|
with impact.d3.Object,
impact.d3.Manifold,
impact.d3.Joint,
impact.d3.contact_solver_Info,
impact.d3.Dispatcher;
package impact.d3.constraint_Solver
--
-- impact.d3.constraint_Solver provides solver interface.
--
is
type Item is abstract tagged private;
type View is access all Item'Class;
procedure destruct (Self : in out Item) is null;
procedure prepareSolve (Self : in out Item; numBodies : in Integer;
numManifolds : in Integer)
is null;
function solveGroup (Self : access Item; bodies : access impact.d3.Object.Vector;
manifold : access impact.d3.Manifold.Vector;
constraints : access impact.d3.Joint.Vector;
info : in impact.d3.contact_solver_Info.Item'Class;
dispatcher : in impact.d3.Dispatcher.item'Class) return math.Real
is abstract;
--
-- Solve a group of constraints.
procedure allSolved (Self : in out Item; info : in impact.d3.contact_solver_Info.Item'Class)
is null;
procedure reset (Self : in out Item)
is abstract;
--
-- Clear internal cached data and reset random seed.
private
type Item is abstract tagged null record;
end impact.d3.constraint_Solver;
|
with Ada.Exceptions; use Ada.Exceptions;
package Noreturn1 is
procedure Error (E : in Exception_Occurrence);
pragma No_Return (Error);
end Noreturn1;
|
package Discr42_Pkg is
type Rec (D : Boolean := False) is record
case D is
when True => N : Natural;
when False => null;
end case;
end record;
function F (Pos : in out Natural) return Rec;
end Discr42_Pkg;
|
pragma Ada_2020;
with Ada.Streams; use Ada.Streams;
with AUnit.Assertions; use AUnit.Assertions;
with AUnit.Test_Caller;
with Base64.URLSafe; use Base64.URLSafe;
package body Test_URLSafe is
package Caller is new AUnit.Test_Caller (Test);
Test_Suite : aliased AUnit.Test_Suites.Test_Suite;
Big_Raw : constant Stream_Element_Array :=
(16#00#, 16#01#, 16#02#, 16#03#, 16#04#, 16#05#, 16#06#, 16#07#, 16#08#,
16#09#, 16#0a#, 16#0b#, 16#0c#, 16#0d#, 16#0e#, 16#0f#, 16#10#, 16#11#,
16#12#, 16#13#, 16#14#, 16#15#, 16#16#, 16#17#, 16#18#, 16#19#, 16#1a#,
16#1b#, 16#1c#, 16#1d#, 16#1e#, 16#1f#, 16#20#, 16#21#, 16#22#, 16#23#,
16#24#, 16#25#, 16#26#, 16#27#, 16#28#, 16#29#, 16#2a#, 16#2b#, 16#2c#,
16#2d#, 16#2e#, 16#2f#, 16#30#, 16#31#, 16#32#, 16#33#, 16#34#, 16#35#,
16#36#, 16#37#, 16#38#, 16#39#, 16#3a#, 16#3b#, 16#3c#, 16#3d#, 16#3e#,
16#3f#, 16#40#, 16#41#, 16#42#, 16#43#, 16#44#, 16#45#, 16#46#, 16#47#,
16#48#, 16#49#, 16#4a#, 16#4b#, 16#4c#, 16#4d#, 16#4e#, 16#4f#, 16#50#,
16#51#, 16#52#, 16#53#, 16#54#, 16#55#, 16#56#, 16#57#, 16#58#, 16#59#,
16#5a#, 16#5b#, 16#5c#, 16#5d#, 16#5e#, 16#5f#, 16#60#, 16#61#, 16#62#,
16#63#, 16#64#, 16#65#, 16#66#, 16#67#, 16#68#, 16#69#, 16#6a#, 16#6b#,
16#6c#, 16#6d#, 16#6e#, 16#6f#, 16#70#, 16#71#, 16#72#, 16#73#, 16#74#,
16#75#, 16#76#, 16#77#, 16#78#, 16#79#, 16#7a#, 16#7b#, 16#7c#, 16#7d#,
16#7e#, 16#7f#);
Big_Base64 : constant String :=
"AAECAwQFBgcICQoLDA0ODxAREhMUFRYXGBkaGxwdHh8gISIjJCUmJygpKissLS4vMDEyMz" &
"Q1Njc4OTo7PD0-P0BBQkNERUZHSElKS0xNTk9QUVJTVFVWV1hZWltcXV5fYGFiY2RlZmdo" &
"aWprbG1ub3BxcnN0dXZ3eHl6e3x9fn8=";
function Suite return AUnit.Test_Suites.Access_Test_Suite is
Name : constant String := "(URLSafe) ";
begin
Test_Suite.Add_Test
(Caller.Create
(Name & "encoding empty input", Test_Encoding_Empty'Access));
Test_Suite.Add_Test
(Caller.Create
(Name & "encoding data, 2 padding characters",
Test_Encoding_Pad2'Access));
Test_Suite.Add_Test
(Caller.Create
(Name & "encoding data, 1 padding character",
Test_Encoding_Pad1'Access));
Test_Suite.Add_Test
(Caller.Create
(Name & "encoding data, no padding", Test_Encoding_Pad0'Access));
Test_Suite.Add_Test
(Caller.Create (Name & "encoding big data", Test_Encoding_Big'Access));
Test_Suite.Add_Test
(Caller.Create
(Name & "encoding RFC4648", Test_Encoding_RFC4648'Access));
Test_Suite.Add_Test
(Caller.Create
(Name & "decoding empty input", Test_Decoding_Empty'Access));
Test_Suite.Add_Test
(Caller.Create
(Name & "decoding data, 2 padding characters",
Test_Decoding_Pad2'Access));
Test_Suite.Add_Test
(Caller.Create
(Name & "decoding data, 1 padding character",
Test_Decoding_Pad1'Access));
Test_Suite.Add_Test
(Caller.Create
(Name & "decoding data, no padding", Test_Decoding_Pad0'Access));
Test_Suite.Add_Test
(Caller.Create (Name & "decoding big data", Test_Decoding_Big'Access));
Test_Suite.Add_Test
(Caller.Create
(Name & "decoding RFC4648", Test_Decoding_RFC4648'Access));
return Test_Suite'Access;
end Suite;
procedure Test_Encoding_Empty (Object : in out Test) is
Input : constant Stream_Element_Array (1 .. 0) := (others => 0);
begin
Assert (Encode (Input) = "", "Result is not empty");
end Test_Encoding_Empty;
procedure Test_Encoding_Pad2 (Object : in out Test) is
Input : constant Stream_Element_Array (1 .. 1) :=
(others => Character'Pos ('a'));
Result : constant String := Encode (Input);
Expected : constant String := "YQ==";
begin
Assert (Result, Expected, "Result is not correct");
end Test_Encoding_Pad2;
procedure Test_Encoding_Pad1 (Object : in out Test) is
Input : constant Stream_Element_Array (1 .. 2) :=
(others => Character'Pos ('a'));
Result : constant String := Encode (Input);
Expected : constant String := "YWE=";
begin
Assert (Result, Expected, "Result is not correct");
end Test_Encoding_Pad1;
procedure Test_Encoding_Pad0 (Object : in out Test) is
Input : constant Stream_Element_Array (1 .. 3) :=
(others => Character'Pos ('a'));
Result : constant String := Encode (Input);
Expected : constant String := "YWFh";
begin
Assert (Result, Expected, "Result is not correct");
end Test_Encoding_Pad0;
procedure Test_Encoding_Big (Object : in out Test) is
Result : constant String := Encode (Big_Raw);
begin
Assert (Result, Big_Base64, "Result is not correct");
end Test_Encoding_Big;
procedure Test_Encoding_RFC4648 (Object : in out Test) is
begin
declare
Input : constant Stream_Element_Array (1 .. 1) :=
(others => Character'Pos ('f'));
Result : constant String := Encode (Input);
Expected : constant String := "Zg==";
begin
Assert (Result, Expected, "Result is not correct");
end;
declare
Input : constant Stream_Element_Array (1 .. 2) :=
(Character'Pos ('f'), Character'Pos ('o'));
Result : constant String := Encode (Input);
Expected : constant String := "Zm8=";
begin
Assert (Result, Expected, "Result is not correct");
end;
declare
Input : constant Stream_Element_Array (1 .. 3) :=
(Character'Pos ('f'), Character'Pos ('o'), Character'Pos ('o'));
Result : constant String := Encode (Input);
Expected : constant String := "Zm9v";
begin
Assert (Result, Expected, "Result is not correct");
end;
declare
Input : constant Stream_Element_Array (1 .. 4) :=
(Character'Pos ('f'), Character'Pos ('o'), Character'Pos ('o'),
Character'Pos ('b'));
Result : constant String := Encode (Input);
Expected : constant String := "Zm9vYg==";
begin
Assert (Result, Expected, "Result is not correct");
end;
declare
Input : constant Stream_Element_Array (1 .. 5) :=
(Character'Pos ('f'), Character'Pos ('o'), Character'Pos ('o'),
Character'Pos ('b'), Character'Pos ('a'));
Result : constant String := Encode (Input);
Expected : constant String := "Zm9vYmE=";
begin
Assert (Result, Expected, "Result is not correct");
end;
declare
Input : constant Stream_Element_Array (1 .. 6) :=
(Character'Pos ('f'), Character'Pos ('o'), Character'Pos ('o'),
Character'Pos ('b'), Character'Pos ('a'), Character'Pos ('r'));
Result : constant String := Encode (Input);
Expected : constant String := "Zm9vYmFy";
begin
Assert (Result, Expected, "Result is not correct");
end;
end Test_Encoding_RFC4648;
procedure Test_Decoding_Empty (Object : in out Test) is
begin
Assert (Decode ("")'Length = 0, "Result is not empty");
end Test_Decoding_Empty;
procedure Test_Decoding_Pad2 (Object : in out Test) is
Input : constant String := "YQ==";
Result : constant Stream_Element_Array := Decode (Input);
Expected : constant Stream_Element_Array (1 .. 1) :=
(others => Character'Pos ('a'));
begin
Assert (Result'Image, Expected'Image, "Result is not correct");
end Test_Decoding_Pad2;
procedure Test_Decoding_Pad1 (Object : in out Test) is
Input : constant String := "YWE=";
Result : constant Stream_Element_Array := Decode (Input);
Expected : constant Stream_Element_Array (1 .. 2) :=
(others => Character'Pos ('a'));
begin
Assert (Result'Image, Expected'Image, "Result is not correct");
end Test_Decoding_Pad1;
procedure Test_Decoding_Pad0 (Object : in out Test) is
Input : constant String := "YWFh";
Result : constant Stream_Element_Array := Decode (Input);
Expected : constant Stream_Element_Array (1 .. 3) :=
(others => Character'Pos ('a'));
begin
Assert (Result'Image, Expected'Image, "Result is not correct");
end Test_Decoding_Pad0;
procedure Test_Decoding_Big (Object : in out Test) is
Result : constant Stream_Element_Array := Decode (Big_Base64);
begin
Assert (Result = Big_Raw, "Result is not correct");
end Test_Decoding_Big;
procedure Test_Decoding_RFC4648 (Object : in out Test) is
begin
declare
Input : constant String := "Zg==";
Result : constant Stream_Element_Array := Decode (Input);
Expected : constant Stream_Element_Array (1 .. 1) :=
(others => Character'Pos ('f'));
begin
Assert (Result'Image, Expected'Image, "Result is not correct");
end;
declare
Input : constant String := "Zm8=";
Result : constant Stream_Element_Array := Decode (Input);
Expected : constant Stream_Element_Array (1 .. 2) :=
(Character'Pos ('f'), Character'Pos ('o'));
begin
Assert (Result'Image, Expected'Image, "Result is not correct");
end;
declare
Input : constant String := "Zm9v";
Result : constant Stream_Element_Array := Decode (Input);
Expected : constant Stream_Element_Array (1 .. 3) :=
(Character'Pos ('f'), Character'Pos ('o'), Character'Pos ('o'));
begin
Assert (Result'Image, Expected'Image, "Result is not correct");
end;
declare
Input : constant String := "Zm9vYg==";
Result : constant Stream_Element_Array := Decode (Input);
Expected : constant Stream_Element_Array (1 .. 4) :=
(Character'Pos ('f'), Character'Pos ('o'), Character'Pos ('o'),
Character'Pos ('b'));
begin
Assert (Result'Image, Expected'Image, "Result is not correct");
end;
declare
Input : constant String := "Zm9vYmE=";
Result : constant Stream_Element_Array := Decode (Input);
Expected : constant Stream_Element_Array (1 .. 5) :=
(Character'Pos ('f'), Character'Pos ('o'), Character'Pos ('o'),
Character'Pos ('b'), Character'Pos ('a'));
begin
Assert (Result'Image, Expected'Image, "Result is not correct");
end;
declare
Input : constant String := "Zm9vYmFy";
Result : constant Stream_Element_Array := Decode (Input);
Expected : constant Stream_Element_Array (1 .. 6) :=
(Character'Pos ('f'), Character'Pos ('o'), Character'Pos ('o'),
Character'Pos ('b'), Character'Pos ('a'), Character'Pos ('r'));
begin
Assert (Result'Image, Expected'Image, "Result is not correct");
end;
end Test_Decoding_RFC4648;
end Test_URLSafe;
|
with Last_Chance_Handler; pragma Unreferenced (Last_Chance_Handler);
with Ada.Synchronous_Task_Control; use Ada.Synchronous_Task_Control;
with STM32GD.Board; use STM32GD.Board;
with STM32GD.GPIO; use STM32GD.GPIO;
with STM32GD.GPIO.Pin;
with STM32GD.EXTI;
with STM32_SVD.RCC;
with Button_Irq;
procedure Main is
begin
Init;
BUTTON.Configure_Trigger (STM32GD.EXTI.Interrupt_Falling_Edge);
LED2.Set;
LED.Set;
loop
Suspend_Until_True (Button_Irq.Button_Pressed);
LED.Toggle;
end loop;
end Main;
|
-- Shoot'n'loot
-- Copyright (c) 2020 Fabien Chouteau
with HAL; use HAL;
with GESTE_Config; use GESTE_Config;
with GESTE.Sprite;
with GESTE.Tile_Bank;
with Game_Assets.Tileset;
with Game_Assets.Tileset_Collisions;
with Game_Assets.Misc_Objects;
use Game_Assets;
package body Score_Display is
Tile_Bank : aliased GESTE.Tile_Bank.Instance
(Tileset.Tiles'Access,
Tileset_Collisions.Tiles'Access,
Palette'Access);
Digit_Sprites : array (1 .. 6) of aliased GESTE.Sprite.Instance
(Tile_Bank'Access, Misc_Objects.Item.D0.Tile_Id);
Tiles : constant array (0 .. 9) of Tile_Index :=
(
0 => Misc_Objects.Item.D0.Tile_ID,
1 => Misc_Objects.Item.D1.Tile_ID,
2 => Misc_Objects.Item.D2.Tile_ID,
3 => Misc_Objects.Item.D3.Tile_ID,
4 => Misc_Objects.Item.D4.Tile_ID,
5 => Misc_Objects.Item.D5.Tile_ID,
6 => Misc_Objects.Item.D6.Tile_ID,
7 => Misc_Objects.Item.D7.Tile_ID,
8 => Misc_Objects.Item.D8.Tile_ID,
9 => Misc_Objects.Item.D9.Tile_ID);
----------
-- Init --
----------
procedure Init (Pos : GESTE.Pix_Point) is
X : Integer := Pos.X;
begin
for Digit of Digit_Sprites loop
Digit.Move ((X, Pos.Y));
GESTE.Add (Digit'Unchecked_Access, 50);
X := X + 8;
end loop;
end Init;
------------
-- Update --
------------
procedure Update (Time_In_Game : PyGamer.Time.Time_Ms) is
Tmp : PyGamer.Time.Time_Ms := Time_In_Game / 10;
Cnt : Natural := 1;
begin
for Digit of reverse Digit_Sprites loop
if Cnt = 3 then
Digit.Set_Tile (Misc_Objects.Item.Dot.Tile_Id);
else
Digit.Set_Tile (Tiles (Integer (Tmp mod 10)));
Tmp := Tmp / 10;
end if;
Cnt := Cnt + 1;
end loop;
end Update;
end Score_Display;
|
-----------------------------------------------------------------------
-- applications.messages-factory -- Application Message Factory
-- Copyright (C) 2011, 2012 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.Exceptions;
with Util.Log.Loggers;
with Util.Properties.Bundles;
with Util.Beans.Objects;
with Util.Locales;
with ASF.Locales;
with ASF.Applications.Main;
package body ASF.Applications.Messages.Factory is
use Util.Log;
Log : constant Loggers.Logger := Loggers.Create ("ASF.Applications.Messages.Factory");
-- ------------------------------
-- Get a localized message. The message identifier is composed of a resource bundle name
-- prefix and a bundle key. The prefix and key are separated by the first '.'.
-- If the message identifier does not contain any prefix, the default bundle is "messages".
-- ------------------------------
function Get_Message (Context : in ASF.Contexts.Faces.Faces_Context'Class;
Message_Id : in String) return String is
Pos : constant Natural := Util.Strings.Index (Message_Id, '.');
Locale : constant Util.Locales.Locale := Context.Get_Locale;
App : constant access ASF.Applications.Main.Application'Class := Context.Get_Application;
Bundle : ASF.Locales.Bundle;
begin
if Pos > 0 then
App.Load_Bundle (Name => Message_Id (Message_Id'First .. Pos - 1),
Locale => Util.Locales.To_String (Locale),
Bundle => Bundle);
return Bundle.Get (Message_Id (Pos + 1 .. Message_Id'Last),
Message_Id (Pos + 1 .. Message_Id'Last));
else
App.Load_Bundle (Name => "messages",
Locale => Util.Locales.To_String (Locale),
Bundle => Bundle);
return Bundle.Get (Message_Id, Message_Id);
end if;
exception
when E : Util.Properties.Bundles.NO_BUNDLE =>
Log.Error ("Cannot localize {0}: {1}", Message_Id, Ada.Exceptions.Exception_Message (E));
return Message_Id;
end Get_Message;
-- ------------------------------
-- Build a localized message.
-- ------------------------------
function Get_Message (Context : in ASF.Contexts.Faces.Faces_Context'Class;
Message_Id : in String;
Severity : in Messages.Severity := ERROR) return Message is
Msg : constant String := Get_Message (Context, Message_Id);
Result : Message;
begin
Result.Summary := Ada.Strings.Unbounded.To_Unbounded_String (Msg);
Result.Kind := Severity;
return Result;
end Get_Message;
-- ------------------------------
-- Build a localized message and format the message with one argument.
-- ------------------------------
function Get_Message (Context : in ASF.Contexts.Faces.Faces_Context'Class;
Message_Id : in String;
Param1 : in String;
Severity : in Messages.Severity := ERROR) return Message is
Args : ASF.Utils.Object_Array (1 .. 1);
begin
Args (1) := Util.Beans.Objects.To_Object (Param1);
return Get_Message (Context, Message_Id, Args, Severity);
end Get_Message;
-- ------------------------------
-- Build a localized message and format the message with two argument.
-- ------------------------------
function Get_Message (Context : in ASF.Contexts.Faces.Faces_Context'Class;
Message_Id : in String;
Param1 : in String;
Param2 : in String;
Severity : in Messages.Severity := ERROR) return Message is
Args : ASF.Utils.Object_Array (1 .. 2);
begin
Args (1) := Util.Beans.Objects.To_Object (Param1);
Args (2) := Util.Beans.Objects.To_Object (Param2);
return Get_Message (Context, Message_Id, Args, Severity);
end Get_Message;
-- ------------------------------
-- Build a localized message and format the message with some arguments.
-- ------------------------------
function Get_Message (Context : in ASF.Contexts.Faces.Faces_Context'Class;
Message_Id : in String;
Args : in ASF.Utils.Object_Array;
Severity : in Messages.Severity := ERROR) return Message is
Msg : constant String := Get_Message (Context, Message_Id);
Result : Message;
begin
Result.Kind := Severity;
ASF.Utils.Formats.Format (Msg, Args, Result.Summary);
return Result;
end Get_Message;
-- ------------------------------
-- Add a localized global message in the faces context.
-- ------------------------------
procedure Add_Message (Context : in out ASF.Contexts.Faces.Faces_Context'Class;
Message_Id : in String;
Param1 : in String;
Severity : in Messages.Severity := ERROR) is
Msg : constant Message := Get_Message (Context, Message_Id, Param1, Severity);
begin
Context.Add_Message (Client_Id => "", Message => Msg);
end Add_Message;
-- ------------------------------
-- Add a localized global message in the faces context.
-- ------------------------------
procedure Add_Message (Context : in out ASF.Contexts.Faces.Faces_Context'Class;
Message_Id : in String;
Severity : in Messages.Severity := ERROR) is
Msg : constant Message := Get_Message (Context, Message_Id, Severity);
begin
Context.Add_Message (Client_Id => "", Message => Msg);
end Add_Message;
-- ------------------------------
-- Add a localized global message in the current faces context.
-- ------------------------------
procedure Add_Message (Message_Id : in String;
Severity : in Messages.Severity := ERROR) is
Context : constant ASF.Contexts.Faces.Faces_Context_Access := ASF.Contexts.Faces.Current;
begin
Add_Message (Context.all, Message_Id, Severity);
end Add_Message;
end ASF.Applications.Messages.Factory;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUNTIME COMPONENTS --
-- --
-- S Y S T E M . W C H _ C N V --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
-- This package contains generic subprograms used for converting between
-- sequences of Character and Wide_Character. All access to wide character
-- sequences is isolated in this unit.
with Interfaces; use Interfaces;
with System.WCh_Con; use System.WCh_Con;
with System.WCh_JIS; use System.WCh_JIS;
package body System.WCh_Cnv is
--------------------------------
-- Char_Sequence_To_Wide_Char --
--------------------------------
function Char_Sequence_To_Wide_Char
(C : Character;
EM : WC_Encoding_Method)
return Wide_Character
is
B1 : Integer;
C1 : Character;
U : Unsigned_16;
W : Unsigned_16;
procedure Get_Hex (N : Character);
-- If N is a hex character, then set B1 to 16 * B1 + character N.
-- Raise Constraint_Error if character N is not a hex character.
-------------
-- Get_Hex --
-------------
procedure Get_Hex (N : Character) is
B2 : constant Integer := Character'Pos (N);
begin
if B2 in Character'Pos ('0') .. Character'Pos ('9') then
B1 := B1 * 16 + B2 - Character'Pos ('0');
elsif B2 in Character'Pos ('A') .. Character'Pos ('F') then
B1 := B1 * 16 + B2 - (Character'Pos ('A') - 10);
elsif B2 in Character'Pos ('a') .. Character'Pos ('f') then
B1 := B1 * 16 + B2 - (Character'Pos ('a') - 10);
else
raise Constraint_Error;
end if;
end Get_Hex;
-- Start of processing for Char_Sequence_To_Wide_Char
begin
case EM is
when WCEM_Hex =>
if C /= ASCII.ESC then
return Wide_Character'Val (Character'Pos (C));
else
B1 := 0;
Get_Hex (In_Char);
Get_Hex (In_Char);
Get_Hex (In_Char);
Get_Hex (In_Char);
return Wide_Character'Val (B1);
end if;
when WCEM_Upper =>
if C > ASCII.DEL then
return
Wide_Character'Val
(Integer (256 * Character'Pos (C)) +
Character'Pos (In_Char));
else
return Wide_Character'Val (Character'Pos (C));
end if;
when WCEM_Shift_JIS =>
if C > ASCII.DEL then
return Shift_JIS_To_JIS (C, In_Char);
else
return Wide_Character'Val (Character'Pos (C));
end if;
when WCEM_EUC =>
if C > ASCII.DEL then
return EUC_To_JIS (C, In_Char);
else
return Wide_Character'Val (Character'Pos (C));
end if;
when WCEM_UTF8 =>
if C > ASCII.DEL then
-- 16#0080#-16#07ff#: 2#110xxxxx# 2#10xxxxxx#
-- 16#0800#-16#ffff#: 2#1110xxxx# 2#10xxxxxx# 2#10xxxxxx#
U := Unsigned_16 (Character'Pos (C));
if (U and 2#11100000#) = 2#11000000# then
W := Shift_Left (U and 2#00011111#, 6);
U := Unsigned_16 (Character'Pos (In_Char));
if (U and 2#11000000#) /= 2#10000000# then
raise Constraint_Error;
end if;
W := W or (U and 2#00111111#);
elsif (U and 2#11110000#) = 2#11100000# then
W := Shift_Left (U and 2#00001111#, 12);
U := Unsigned_16 (Character'Pos (In_Char));
if (U and 2#11000000#) /= 2#10000000# then
raise Constraint_Error;
end if;
W := W or Shift_Left (U and 2#00111111#, 6);
U := Unsigned_16 (Character'Pos (In_Char));
if (U and 2#11000000#) /= 2#10000000# then
raise Constraint_Error;
end if;
W := W or (U and 2#00111111#);
else
raise Constraint_Error;
end if;
return Wide_Character'Val (W);
else
return Wide_Character'Val (Character'Pos (C));
end if;
when WCEM_Brackets =>
if C /= '[' then
return Wide_Character'Val (Character'Pos (C));
end if;
if In_Char /= '"' then
raise Constraint_Error;
end if;
B1 := 0;
Get_Hex (In_Char);
Get_Hex (In_Char);
C1 := In_Char;
if C1 /= '"' then
Get_Hex (C1);
Get_Hex (In_Char);
C1 := In_Char;
if C1 /= '"' then
raise Constraint_Error;
end if;
end if;
if In_Char /= ']' then
raise Constraint_Error;
end if;
return Wide_Character'Val (B1);
end case;
end Char_Sequence_To_Wide_Char;
--------------------------------
-- Wide_Char_To_Char_Sequence --
--------------------------------
procedure Wide_Char_To_Char_Sequence
(WC : Wide_Character;
EM : WC_Encoding_Method)
is
Val : constant Natural := Wide_Character'Pos (WC);
Hexc : constant array (0 .. 15) of Character := "0123456789ABCDEF";
C1, C2 : Character;
U : Unsigned_16;
begin
case EM is
when WCEM_Hex =>
if Val < 256 then
Out_Char (Character'Val (Val));
else
Out_Char (ASCII.ESC);
Out_Char (Hexc (Val / (16**3)));
Out_Char (Hexc ((Val / (16**2)) mod 16));
Out_Char (Hexc ((Val / 16) mod 16));
Out_Char (Hexc (Val mod 16));
end if;
when WCEM_Upper =>
if Val < 128 then
Out_Char (Character'Val (Val));
elsif Val < 16#8000# then
raise Constraint_Error;
else
Out_Char (Character'Val (Val / 256));
Out_Char (Character'Val (Val mod 256));
end if;
when WCEM_Shift_JIS =>
if Val < 128 then
Out_Char (Character'Val (Val));
else
JIS_To_Shift_JIS (WC, C1, C2);
Out_Char (C1);
Out_Char (C2);
end if;
when WCEM_EUC =>
if Val < 128 then
Out_Char (Character'Val (Val));
else
JIS_To_EUC (WC, C1, C2);
Out_Char (C1);
Out_Char (C2);
end if;
when WCEM_UTF8 =>
U := Unsigned_16 (Val);
-- 16#0000#-16#007f#: 2#0xxxxxxx#
-- 16#0080#-16#07ff#: 2#110xxxxx# 2#10xxxxxx#
-- 16#0800#-16#ffff#: 2#1110xxxx# 2#10xxxxxx# 2#10xxxxxx#
if U < 16#80# then
Out_Char (Character'Val (U));
elsif U < 16#0800# then
Out_Char (Character'Val (2#11000000# or Shift_Right (U, 6)));
Out_Char (Character'Val (2#10000000# or (U and 2#00111111#)));
else
Out_Char (Character'Val (2#11100000# or Shift_Right (U, 12)));
Out_Char (Character'Val (2#10000000# or (Shift_Right (U, 6)
and 2#00111111#)));
Out_Char (Character'Val (2#10000000# or (U and 2#00111111#)));
end if;
when WCEM_Brackets =>
if Val < 256 then
Out_Char (Character'Val (Val));
else
Out_Char ('[');
Out_Char ('"');
Out_Char (Hexc (Val / (16**3)));
Out_Char (Hexc ((Val / (16**2)) mod 16));
Out_Char (Hexc ((Val / 16) mod 16));
Out_Char (Hexc (Val mod 16));
Out_Char ('"');
Out_Char (']');
end if;
end case;
end Wide_Char_To_Char_Sequence;
end System.WCh_Cnv;
|
with ada.text_io, ada.Integer_text_IO, Ada.Text_IO.Text_Streams, Ada.Strings.Fixed, Interfaces.C;
use ada.text_io, ada.Integer_text_IO, Ada.Strings, Ada.Strings.Fixed, Interfaces.C;
procedure euler19 is
type stringptr is access all char_array;
procedure PString(s : stringptr) is
begin
String'Write (Text_Streams.Stream (Current_Output), To_Ada(s.all));
end;
procedure PInt(i : in Integer) is
begin
String'Write (Text_Streams.Stream (Current_Output), Trim(Integer'Image(i), Left));
end;
function is_leap(year : in Integer) return Boolean is
begin
return year rem 400 = 0 or else (year rem 100 /= 0 and then year rem 4 = 0);
end;
function ndayinmonth(month : in Integer; year : in Integer) return Integer is
begin
if month = 0
then
return 31;
else
if month = 1
then
if is_leap(year)
then
return 29;
else
return 28;
end if;
else
if month = 2
then
return 31;
else
if month = 3
then
return 30;
else
if month = 4
then
return 31;
else
if month = 5
then
return 30;
else
if month = 6
then
return 31;
else
if month = 7
then
return 31;
else
if month = 8
then
return 30;
else
if month = 9
then
return 31;
else
if month = 10
then
return 30;
else
if month = 11
then
return 31;
end if;
end if;
end if;
end if;
end if;
end if;
end if;
end if;
end if;
end if;
end if;
end if;
return 0;
end;
year : Integer;
ndays : Integer;
month : Integer;
dayofweek : Integer;
count : Integer;
begin
month := 0;
year := 1901;
dayofweek := 1;
-- 01-01-1901 : mardi
count := 0;
while year /= 2001 loop
ndays := ndayinmonth(month, year);
dayofweek := (dayofweek + ndays) rem 7;
month := month + 1;
if month = 12
then
month := 0;
year := year + 1;
end if;
if dayofweek rem 7 = 6
then
count := count + 1;
end if;
end loop;
PInt(count);
PString(new char_array'( To_C("" & Character'Val(10))));
end;
|
pragma Ada_2012;
package body AdaCar is
---------
-- "*" --
---------
function "*"
(A : Unidades_AI; Distancia : Unidades_Distancia)
return Unidades_Distancia
is
Valor_Distancia: Unidades_Distancia;
begin
Valor_Distancia:= Unidades_Distancia(A)*Distancia;
return Valor_Distancia;
end "*";
---------
-- "*" --
---------
function "*"
(Distancia: Unidades_Distancia; D: Duration)
return Unidades_Distancia
is
Valor_Distancia: Unidades_Distancia;
begin
Valor_Distancia:= Unidades_Distancia(D)*Distancia;
return Valor_Distancia;
end "*";
end AdaCar;
|
with SOCI;
with SOCI.PostgreSQL;
with Ada.Text_IO;
with Ada.Calendar;
with Ada.Exceptions;
with Ada.Numerics.Discrete_Random;
with Ada.Command_Line;
procedure PostgreSQL_Test is
procedure Test_1 (Connection_String : in String) is
begin
Ada.Text_IO.Put_Line ("testing basic constructor function");
declare
S : SOCI.Session := SOCI.Make_Session (Connection_String);
begin
null;
end;
exception
when E : SOCI.Database_Error =>
Ada.Text_IO.Put_Line ("Database_Error: ");
Ada.Text_IO.Put_Line (Ada.Exceptions.Exception_Message (E));
end Test_1;
procedure Test_2 (Connection_String : in String) is
S : SOCI.Session;
begin
Ada.Text_IO.Put_Line ("testing open/close");
S.Close;
S.Open (Connection_String);
S.Close;
end Test_2;
procedure Test_3 (Connection_String : in String) is
begin
Ada.Text_IO.Put_Line ("testing empty start/commit");
declare
S : SOCI.Session := SOCI.Make_Session (Connection_String);
begin
S.Start;
S.Commit;
end;
end Test_3;
procedure Test_4 (Connection_String : in String) is
begin
Ada.Text_IO.Put_Line ("testing simple statements");
declare
SQL : SOCI.Session := SOCI.Make_Session (Connection_String);
begin
SQL.Execute ("create table ada_test ( i integer )");
SQL.Execute ("drop table ada_test");
end;
end Test_4;
procedure Test_5 (Connection_String : in String) is
begin
Ada.Text_IO.Put_Line ("testing independent statements");
declare
SQL : SOCI.Session := SOCI.Make_Session (Connection_String);
St_1 : SOCI.Statement := SOCI.Make_Statement (SQL);
St_2 : SOCI.Statement := SOCI.Make_Statement (SQL);
begin
St_1.Prepare ("create table ada_test ( i integer )");
St_2.Prepare ("drop table ada_test");
St_1.Execute;
St_2.Execute;
end;
end Test_5;
procedure Test_6 (Connection_String : in String) is
begin
Ada.Text_IO.Put_Line ("testing data types and into elements");
declare
SQL : SOCI.Session := SOCI.Make_Session (Connection_String);
begin
declare
St : SOCI.Statement := SOCI.Make_Statement (SQL);
Pos : SOCI.Into_Position;
begin
Pos := St.Into_String;
St.Prepare ("select 'Hello'");
St.Execute (True);
pragma Assert (St.Get_Into_String (Pos) = "Hello");
end;
declare
St : SOCI.Statement := SOCI.Make_Statement (SQL);
Pos : SOCI.Into_Position;
Value : SOCI.DB_Integer;
use type SOCI.DB_Integer;
begin
Pos := St.Into_Integer;
St.Prepare ("select 123");
St.Execute (True);
Value := St.Get_Into_Integer (Pos);
pragma Assert (Value = 123);
end;
declare
St : SOCI.Statement := SOCI.Make_Statement (SQL);
Pos : SOCI.Into_Position;
Value : SOCI.DB_Long_Long_Integer;
use type SOCI.DB_Long_Long_Integer;
begin
Pos := St.Into_Long_Long_Integer;
St.Prepare ("select 10000000000");
St.Execute (True);
Value := St.Get_Into_Long_Long_Integer (Pos);
pragma Assert (Value = 10_000_000_000);
end;
declare
St : SOCI.Statement := SOCI.Make_Statement (SQL);
Pos : SOCI.Into_Position;
Value : SOCI.DB_Long_Float;
use type SOCI.DB_Long_Float;
begin
Pos := St.Into_Long_Float;
St.Prepare ("select 3.625");
St.Execute (True);
Value := St.Get_Into_Long_Float (Pos);
pragma Assert (Value = SOCI.DB_Long_Float (3.625));
end;
declare
St : SOCI.Statement := SOCI.Make_Statement (SQL);
Pos : SOCI.Into_Position;
Value : Ada.Calendar.Time;
begin
Pos := St.Into_Time;
St.Prepare ("select timestamp '2008-06-30 21:01:02'");
St.Execute (True);
Value := St.Get_Into_Time (Pos);
pragma Assert (Ada.Calendar.Year (Value) = 2008);
pragma Assert (Ada.Calendar.Month (Value) = 6);
pragma Assert (Ada.Calendar.Day (Value) = 30);
pragma Assert
(Ada.Calendar.Seconds (Value) =
Ada.Calendar.Day_Duration (21 * 3_600 + 1 * 60 + 2));
end;
end;
end Test_6;
procedure Test_7 (Connection_String : in String) is
begin
Ada.Text_IO.Put_Line ("testing types with into vectors");
declare
SQL : SOCI.Session := SOCI.Make_Session (Connection_String);
St : SOCI.Statement := SOCI.Make_Statement (SQL);
Pos_Id : SOCI.Into_Position;
Pos_Str : SOCI.Into_Position;
Pos_LL : SOCI.Into_Position;
Pos_LF : SOCI.Into_Position;
Pos_TM : SOCI.Into_Position;
use type SOCI.Data_State;
use type Ada.Calendar.Time;
use type SOCI.DB_Integer;
use type SOCI.DB_Long_Long_Integer;
use type SOCI.DB_Long_Float;
begin
SQL.Execute ("create table soci_test (" &
" id integer," &
" str varchar (20)," &
" ll bigint," &
" lf double precision," &
" tm timestamp" &
")");
SQL.Execute ("insert into soci_test (id, str, ll, lf, tm)" &
" values (1, 'abc', 10000000000, 3.0, timestamp '2008-06-30 21:01:02')");
SQL.Execute ("insert into soci_test (id, str, ll, lf, tm)" &
" values (2, 'xyz', -10000000001, -3.125, timestamp '2008-07-01 21:01:03')");
SQL.Execute ("insert into soci_test (id, str, ll, lf, tm)" &
" values (3, null, null, null, null)");
Pos_Id := St.Into_Vector_Integer;
Pos_Str := St.Into_Vector_String;
Pos_LL := St.Into_Vector_Long_Long_Integer;
Pos_LF := St.Into_Vector_Long_Float;
Pos_TM := St.Into_Vector_Time;
St.Into_Vectors_Resize (10); -- arbitrary batch size
St.Prepare ("select id, str, ll, lf, tm from soci_test order by id");
St.Execute (True);
pragma Assert (St.Get_Into_Vectors_Size = 3);
pragma Assert (St.Get_Into_Vector_Integer (Pos_Id, 0) = 1);
pragma Assert (St.Get_Into_Vector_State (Pos_Str, 0) = SOCI.Data_Not_Null);
pragma Assert (St.Get_Into_Vector_String (Pos_Str, 0) = "abc");
pragma Assert (St.Get_Into_Vector_Long_Long_Integer (Pos_LL, 0) = 10_000_000_000);
pragma Assert (St.Get_Into_Vector_Long_Float (Pos_LF, 0) = SOCI.DB_Long_Float (3.0));
pragma Assert (St.Get_Into_Vector_Time (Pos_TM, 0) =
Ada.Calendar.Time_Of (2008, 6, 30,
Duration (21 * 3_600 + 1 * 60 + 2)));
pragma Assert (St.Get_Into_Vector_Integer (Pos_Id, 1) = 2);
pragma Assert (St.Get_Into_Vector_State (Pos_Str, 1) = SOCI.Data_Not_Null);
pragma Assert (St.Get_Into_Vector_String (Pos_Str, 1) = "xyz");
pragma Assert (St.Get_Into_Vector_Long_Long_Integer (Pos_LL, 1) = -10_000_000_001);
pragma Assert (St.Get_Into_Vector_Long_Float (Pos_LF, 1) = SOCI.DB_Long_Float (-3.125));
pragma Assert (St.Get_Into_Vector_Time (Pos_TM, 1) =
Ada.Calendar.Time_Of (2008, 7, 1,
Duration (21 * 3_600 + 1 * 60 + 3)));
pragma Assert (St.Get_Into_Vector_Integer (Pos_Id, 2) = 3);
pragma Assert (St.Get_Into_Vector_State (Pos_Str, 2) = SOCI.Data_Null);
pragma Assert (St.Get_Into_Vector_State (Pos_LL, 2) = SOCI.Data_Null);
pragma Assert (St.Get_Into_Vector_State (Pos_LF, 2) = SOCI.Data_Null);
pragma Assert (St.Get_Into_Vector_State (Pos_TM, 2) = SOCI.Data_Null);
SQL.Execute ("drop table soci_test");
end;
end Test_7;
procedure Test_8 (Connection_String : in String) is
begin
Ada.Text_IO.Put_Line ("testing multi-batch operation with into vectors");
declare
SQL : SOCI.Session := SOCI.Make_Session (Connection_String);
St : SOCI.Statement := SOCI.Make_Statement (SQL);
Pos_Id : SOCI.Into_Position;
Got_Data : Boolean;
use type SOCI.DB_Integer;
begin
SQL.Execute ("create table soci_test (" &
" id integer" &
")");
SQL.Execute ("insert into soci_test (id) values (1)");
SQL.Execute ("insert into soci_test (id) values (2)");
SQL.Execute ("insert into soci_test (id) values (3)");
SQL.Execute ("insert into soci_test (id) values (4)");
SQL.Execute ("insert into soci_test (id) values (5)");
SQL.Execute ("insert into soci_test (id) values (6)");
SQL.Execute ("insert into soci_test (id) values (7)");
SQL.Execute ("insert into soci_test (id) values (8)");
SQL.Execute ("insert into soci_test (id) values (9)");
SQL.Execute ("insert into soci_test (id) values (10)");
Pos_Id := St.Into_Vector_Integer;
St.Into_Vectors_Resize (4); -- batch of 4 elements
St.Prepare ("select id from soci_test order by id");
St.Execute;
Got_Data := St.Fetch;
pragma Assert (Got_Data);
pragma Assert (St.Get_Into_Vectors_Size = 4);
pragma Assert (St.Get_Into_Vector_Integer (Pos_Id, 0) = 1);
pragma Assert (St.Get_Into_Vector_Integer (Pos_Id, 1) = 2);
pragma Assert (St.Get_Into_Vector_Integer (Pos_Id, 2) = 3);
pragma Assert (St.Get_Into_Vector_Integer (Pos_Id, 3) = 4);
Got_Data := St.Fetch;
pragma Assert (Got_Data);
pragma Assert (St.Get_Into_Vectors_Size = 4);
pragma Assert (St.Get_Into_Vector_Integer (Pos_Id, 0) = 5);
pragma Assert (St.Get_Into_Vector_Integer (Pos_Id, 1) = 6);
pragma Assert (St.Get_Into_Vector_Integer (Pos_Id, 2) = 7);
pragma Assert (St.Get_Into_Vector_Integer (Pos_Id, 3) = 8);
Got_Data := St.Fetch;
pragma Assert (Got_Data);
pragma Assert (St.Get_Into_Vectors_Size = 2);
pragma Assert (St.Get_Into_Vector_Integer (Pos_Id, 0) = 9);
pragma Assert (St.Get_Into_Vector_Integer (Pos_Id, 1) = 10);
Got_Data := St.Fetch;
pragma Assert (not Got_Data);
pragma Assert (St.Get_Into_Vectors_Size = 0);
SQL.Execute ("drop table soci_test");
end;
end Test_8;
procedure Test_9 (Connection_String : in String) is
begin
Ada.Text_IO.Put_Line ("testing data types and use elements");
declare
SQL : SOCI.Session := SOCI.Make_Session (Connection_String);
use type SOCI.DB_Integer;
use type SOCI.DB_Long_Long_Integer;
use type SOCI.DB_Long_Float;
begin
declare
St : SOCI.Statement := SOCI.Make_Statement (SQL);
Pos : SOCI.Into_Position;
begin
St.Use_String ("value");
St.Set_Use_String ("value", "123");
Pos := St.Into_Integer;
St.Prepare ("select cast(:value as integer)");
St.Execute (True);
pragma Assert (St.Get_Into_Integer (Pos) = 123);
end;
declare
St : SOCI.Statement := SOCI.Make_Statement (SQL);
Pos : SOCI.Into_Position;
begin
St.Use_Integer ("value");
St.Set_Use_Integer ("value", 123);
Pos := St.Into_String;
St.Prepare ("select cast(:value as text)");
St.Execute (True);
pragma Assert (St.Get_Into_String (Pos) = "123");
end;
declare
St : SOCI.Statement := SOCI.Make_Statement (SQL);
Pos : SOCI.Into_Position;
begin
St.Use_Long_Long_Integer ("value");
St.Set_Use_Long_Long_Integer ("value", 10_000_000_000);
Pos := St.Into_String;
St.Prepare ("select cast(:value as text)");
St.Execute (True);
pragma Assert (St.Get_Into_String (Pos) = "10000000000");
end;
declare
St : SOCI.Statement := SOCI.Make_Statement (SQL);
Pos : SOCI.Into_Position;
begin
St.Use_Long_Float ("value");
St.Set_Use_Long_Float ("value", SOCI.DB_Long_Float (5.625));
Pos := St.Into_String;
St.Prepare ("select cast(:value as text)");
St.Execute (True);
pragma Assert (St.Get_Into_String (Pos) = "5.625");
end;
declare
St : SOCI.Statement := SOCI.Make_Statement (SQL);
Pos : SOCI.Into_Position;
begin
St.Use_Time ("value");
St.Set_Use_Time ("value", Ada.Calendar.Time_Of
(2008, 7, 1, Ada.Calendar.Day_Duration (3723)));
Pos := St.Into_String;
St.Prepare ("select cast(:value as text)");
St.Execute (True);
pragma Assert (St.Get_Into_String (Pos) = "2008-07-01 01:02:03");
end;
declare
St : SOCI.Statement := SOCI.Make_Statement (SQL);
Pos : SOCI.Into_Position;
use type SOCI.Data_State;
begin
St.Use_Integer ("value");
St.Set_Use_State ("value", SOCI.Data_Null);
Pos := St.Into_Integer;
St.Prepare ("select cast(:value as integer)");
St.Execute (True);
pragma Assert (St.Get_Into_State (Pos) = SOCI.Data_Null);
end;
end;
end Test_9;
procedure Test_10 (Connection_String : in String) is
begin
Ada.Text_IO.Put_Line ("testing vector use elements and row traversal with single into elements");
declare
SQL : SOCI.Session := SOCI.Make_Session (Connection_String);
Time_1 : constant Ada.Calendar.Time := Ada.Calendar.Time_Of
(2008, 7, 1, Ada.Calendar.Day_Duration (1));
Time_2 : constant Ada.Calendar.Time := Ada.Calendar.Time_Of
(2008, 7, 2, Ada.Calendar.Day_Duration (2));
Time_3 : constant Ada.Calendar.Time := Ada.Calendar.Time_Of
(2008, 7, 3, Ada.Calendar.Day_Duration (3));
Time_4 : constant Ada.Calendar.Time := Ada.Calendar.Time_Of
(2008, 7, 4, Ada.Calendar.Day_Duration (4));
Time_5 : constant Ada.Calendar.Time := Ada.Calendar.Time_Of
(2008, 7, 5, Ada.Calendar.Day_Duration (5));
begin
SQL.Execute ("create table soci_test (" &
" id integer," &
" str varchar (20)," &
" ll bigint," &
" lf double precision," &
" tm timestamp" &
")");
declare
St : SOCI.Statement := SOCI.Make_Statement (SQL);
begin
St.Use_Vector_Integer ("id");
St.Use_Vector_String ("str");
St.Use_Vector_Long_Long_Integer ("ll");
St.Use_Vector_Long_Float ("lf");
St.Use_Vector_Time ("tm");
St.Use_Vectors_Resize (6);
St.Set_Use_Vector_Integer ("id", 0, 1);
St.Set_Use_Vector_Integer ("id", 1, 2);
St.Set_Use_Vector_Integer ("id", 2, 3);
St.Set_Use_Vector_Integer ("id", 3, 4);
St.Set_Use_Vector_Integer ("id", 4, 5);
St.Set_Use_Vector_Integer ("id", 5, 6);
St.Set_Use_Vector_String ("str", 0, "abc");
St.Set_Use_Vector_String ("str", 1, "def");
St.Set_Use_Vector_String ("str", 2, "ghi");
St.Set_Use_Vector_String ("str", 3, "jklm");
St.Set_Use_Vector_String ("str", 4, "no");
St.Set_Use_Vector_State ("str", 5, SOCI.Data_Null);
St.Set_Use_Vector_Long_Long_Integer ("ll", 0, 10_000_000_000);
St.Set_Use_Vector_Long_Long_Integer ("ll", 1, 10_000_000_001);
St.Set_Use_Vector_Long_Long_Integer ("ll", 2, 10_000_000_002);
St.Set_Use_Vector_Long_Long_Integer ("ll", 3, 10_000_000_003);
St.Set_Use_Vector_Long_Long_Integer ("ll", 4, 10_000_000_004);
St.Set_Use_Vector_State ("ll", 5, SOCI.Data_Null);
St.Set_Use_Vector_Long_Float ("lf", 0, SOCI.DB_Long_Float (0.0));
St.Set_Use_Vector_Long_Float ("lf", 1, SOCI.DB_Long_Float (0.125));
St.Set_Use_Vector_Long_Float ("lf", 2, SOCI.DB_Long_Float (0.25));
St.Set_Use_Vector_Long_Float ("lf", 3, SOCI.DB_Long_Float (0.5));
St.Set_Use_Vector_Long_Float ("lf", 4, SOCI.DB_Long_Float (0.625));
St.Set_Use_Vector_State ("lf", 5, SOCI.Data_Null);
St.Set_Use_Vector_Time ("tm", 0, Time_1);
St.Set_Use_Vector_Time ("tm", 1, Time_2);
St.Set_Use_Vector_Time ("tm", 2, Time_3);
St.Set_Use_Vector_Time ("tm", 3, Time_4);
St.Set_Use_Vector_Time ("tm", 4, Time_5);
St.Set_Use_Vector_State ("tm", 5, SOCI.Data_Null);
St.Prepare ("insert into soci_test (id, str, ll, lf, tm)" &
" values (:id, :str, :ll, :lf, :tm)");
St.Execute (True);
end;
declare
St : SOCI.Statement := SOCI.Make_Statement (SQL);
Pos_Id : SOCI.Into_Position;
Pos_Str : SOCI.Into_Position;
Pos_LL : SOCI.Into_Position;
Pos_LF : SOCI.Into_Position;
Pos_TM : SOCI.Into_Position;
Got_Data : Boolean;
use type Ada.Calendar.Time;
use type SOCI.Data_State;
use type SOCI.DB_Integer;
use type SOCI.DB_Long_Long_Integer;
use type SOCI.DB_Long_Float;
begin
Pos_Id := St.Into_Integer;
Pos_Str := St.Into_String;
Pos_LL := St.Into_Long_Long_Integer;
Pos_LF := St.Into_Long_Float;
Pos_TM := St.Into_Time;
St.Prepare ("select id, str, ll, lf, tm from soci_test order by id");
St.Execute;
Got_Data := St.Fetch;
pragma Assert (Got_Data);
pragma Assert (St.Get_Into_Integer (Pos_Id) = 1);
pragma Assert (St.Get_Into_String (Pos_Str) = "abc");
pragma Assert (St.Get_Into_Long_Long_Integer (Pos_LL) = 10_000_000_000);
pragma Assert (St.Get_Into_Long_Float (Pos_LF) = SOCI.DB_Long_Float (0.0));
pragma Assert (St.Get_Into_Time (Pos_TM) = Time_1);
Got_Data := St.Fetch;
pragma Assert (Got_Data);
pragma Assert (St.Get_Into_Integer (Pos_Id) = 2);
pragma Assert (St.Get_Into_String (Pos_Str) = "def");
pragma Assert (St.Get_Into_Long_Long_Integer (Pos_LL) = 10_000_000_001);
pragma Assert (St.Get_Into_Long_Float (Pos_LF) = SOCI.DB_Long_Float (0.125));
pragma Assert (St.Get_Into_Time (Pos_TM) = Time_2);
Got_Data := St.Fetch;
pragma Assert (Got_Data);
pragma Assert (St.Get_Into_Integer (Pos_Id) = 3);
pragma Assert (St.Get_Into_String (Pos_Str) = "ghi");
pragma Assert (St.Get_Into_Long_Long_Integer (Pos_LL) = 10_000_000_002);
pragma Assert (St.Get_Into_Long_Float (Pos_LF) = SOCI.DB_Long_Float (0.25));
pragma Assert (St.Get_Into_Time (Pos_TM) = Time_3);
Got_Data := St.Fetch;
pragma Assert (Got_Data);
pragma Assert (St.Get_Into_Integer (Pos_Id) = 4);
pragma Assert (St.Get_Into_String (Pos_Str) = "jklm");
pragma Assert (St.Get_Into_Long_Long_Integer (Pos_LL) = 10_000_000_003);
pragma Assert (St.Get_Into_Long_Float (Pos_LF) = SOCI.DB_Long_Float (0.5));
pragma Assert (St.Get_Into_Time (Pos_TM) = Time_4);
Got_Data := St.Fetch;
pragma Assert (Got_Data);
pragma Assert (St.Get_Into_Integer (Pos_Id) = 5);
pragma Assert (St.Get_Into_String (Pos_Str) = "no");
pragma Assert (St.Get_Into_Long_Long_Integer (Pos_LL) = 10_000_000_004);
pragma Assert (St.Get_Into_Long_Float (Pos_LF) = SOCI.DB_Long_Float (0.625));
pragma Assert (St.Get_Into_Time (Pos_TM) = Time_5);
Got_Data := St.Fetch;
pragma Assert (Got_Data);
pragma Assert (St.Get_Into_State (Pos_Id) = SOCI.Data_Not_Null);
pragma Assert (St.Get_Into_Integer (Pos_Id) = 6);
pragma Assert (St.Get_Into_State (Pos_Str) = SOCI.Data_Null);
pragma Assert (St.Get_Into_State (Pos_LL) = SOCI.Data_Null);
pragma Assert (St.Get_Into_State (Pos_LF) = SOCI.Data_Null);
pragma Assert (St.Get_Into_State (Pos_TM) = SOCI.Data_Null);
Got_Data := St.Fetch;
pragma Assert (not Got_Data);
end;
SQL.Execute ("drop table soci_test");
end;
end Test_10;
procedure Test_11 (Connection_String : in String) is
-- test parameters:
Pool_Size : constant := 3;
Number_Of_Tasks : constant := 10;
Iterations_Per_Task : constant := 1000;
type Small_Integer is mod 20;
package My_Random is new Ada.Numerics.Discrete_Random (Small_Integer);
Rand : My_Random.Generator;
Pool : SOCI.Connection_Pool (Pool_Size);
begin
Ada.Text_IO.Put_Line ("testing connection pool");
My_Random.Reset (Rand);
for I in 1 .. Pool_Size loop
Pool.Open (I, Connection_String);
end loop;
declare
SQL : SOCI.Session := SOCI.Make_Session (Connection_String);
begin
SQL.Execute ("create table soci_test ( id integer )");
end;
declare
task type Worker;
task body Worker is
begin
for I in 1 .. Iterations_Per_Task loop
declare
SQL : SOCI.Session;
V : Small_Integer;
begin
Pool.Lease (SQL);
V := My_Random.Random (Rand);
SQL.Execute ("insert into soci_test (id) values (" &
Small_Integer'Image (V) & ")");
end;
end loop;
exception
when others =>
Ada.Text_IO.Put_Line ("An exception occured in the worker task.");
end Worker;
W : array (1 .. Number_Of_Tasks) of Worker;
begin
Ada.Text_IO.Put_Line ("--> waiting for the tasks to complete (might take a while)");
end;
declare
SQL : SOCI.Session := SOCI.Make_Session (Connection_String);
begin
SQL.Execute ("drop table soci_test");
end;
end Test_11;
begin
if Ada.Command_Line.Argument_Count /= 1 then
Ada.Text_IO.Put_Line ("Expecting one argument: connection string");
return;
end if;
declare
Connection_String : String := Ada.Command_Line.Argument (1);
begin
Ada.Text_IO.Put_Line ("testing with " & Connection_String);
SOCI.PostgreSQL.Register_Factory_PostgreSQL;
Test_1 (Connection_String);
Test_2 (Connection_String);
Test_3 (Connection_String);
Test_4 (Connection_String);
Test_5 (Connection_String);
Test_6 (Connection_String);
Test_7 (Connection_String);
Test_8 (Connection_String);
Test_9 (Connection_String);
Test_10 (Connection_String);
Test_11 (Connection_String);
end;
end PostgreSQL_Test;
|
package body Math_2D.Trigonometry is
function To_Radians (Degrees : in Degrees_t) return Radians_t is
begin
return Radians_t (Degrees * (Ada.Numerics.Pi / 180.0));
end To_Radians;
function To_Degrees (Radians : in Radians_t) return Degrees_t is
begin
return Degrees_t (Radians * (180.0 / Ada.Numerics.Pi));
end To_Degrees;
end Math_2D.Trigonometry;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- I N T E R F A C E S . C _ S T R E A M S --
-- --
-- S p e c --
-- --
-- Copyright (C) 1995-2005, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
--
--
--
--
--
--
--
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package is a thin binding to selected functions in the C
-- library that provide a complete interface for handling C streams.
with System.CRTL;
package Interfaces.C_Streams is
pragma Preelaborate;
subtype chars is System.CRTL.chars;
subtype FILEs is System.CRTL.FILEs;
subtype int is System.CRTL.int;
subtype long is System.CRTL.long;
subtype size_t is System.CRTL.size_t;
subtype voids is System.Address;
NULL_Stream : constant FILEs;
-- Value returned (NULL in C) to indicate an fdopen/fopen/tmpfile error
----------------------------------
-- Constants Defined in stdio.h --
----------------------------------
EOF : constant int;
-- Used by a number of routines to indicate error or end of file
IOFBF : constant int;
IOLBF : constant int;
IONBF : constant int;
-- Used to indicate buffering mode for setvbuf call
L_tmpnam : constant int;
-- Maximum length of file name that can be returned by tmpnam
SEEK_CUR : constant int;
SEEK_END : constant int;
SEEK_SET : constant int;
-- Used to indicate origin for fseek call
function stdin return FILEs;
function stdout return FILEs;
function stderr return FILEs;
-- Streams associated with standard files
--------------------------
-- Standard C functions --
--------------------------
-- The functions selected below are ones that are available in DOS,
-- OS/2, UNIX and Xenix (but not necessarily in ANSI C). These are
-- very thin interfaces which copy exactly the C headers. For more
-- documentation on these functions, see the Microsoft C "Run-Time
-- Library Reference" (Microsoft Press, 1990, ISBN 1-55615-225-6),
-- which includes useful information on system compatibility.
procedure clearerr (stream : FILEs) renames System.CRTL.clearerr;
function fclose (stream : FILEs) return int renames System.CRTL.fclose;
function fdopen (handle : int; mode : chars) return FILEs
renames System.CRTL.fdopen;
function feof (stream : FILEs) return int;
function ferror (stream : FILEs) return int;
function fflush (stream : FILEs) return int renames System.CRTL.fflush;
function fgetc (stream : FILEs) return int renames System.CRTL.fgetc;
function fgets (strng : chars; n : int; stream : FILEs) return chars
renames System.CRTL.fgets;
function fileno (stream : FILEs) return int;
function fopen (filename : chars; Mode : chars) return FILEs
renames System.CRTL.fopen;
-- Note: to maintain target independence, use text_translation_required,
-- a boolean variable defined in a-sysdep.c to deal with the target
-- dependent text translation requirement. If this variable is set,
-- then b/t should be appended to the standard mode argument to set
-- the text translation mode off or on as required.
function fputc (C : int; stream : FILEs) return int
renames System.CRTL.fputc;
function fputs (Strng : chars; Stream : FILEs) return int
renames System.CRTL.fputs;
function fread
(buffer : voids;
size : size_t;
count : size_t;
stream : FILEs) return size_t;
function fread
(buffer : voids;
index : size_t;
size : size_t;
count : size_t;
stream : FILEs) return size_t;
-- Same as normal fread, but has a parameter 'index' that indicates
-- the starting index for the read within 'buffer' (which must be the
-- address of the beginning of a whole array object with an assumed
-- zero base). This is needed for systems that do not support taking
-- the address of an element within an array.
function freopen
(filename : chars;
mode : chars;
stream : FILEs)
return FILEs renames System.CRTL.freopen;
function fseek
(stream : FILEs;
offset : long;
origin : int)
return int renames System.CRTL.fseek;
function ftell (stream : FILEs) return long
renames System.CRTL.ftell;
function fwrite
(buffer : voids;
size : size_t;
count : size_t;
stream : FILEs)
return size_t;
function isatty (handle : int) return int renames System.CRTL.isatty;
procedure mktemp (template : chars) renames System.CRTL.mktemp;
-- The return value (which is just a pointer to template) is discarded
procedure rewind (stream : FILEs) renames System.CRTL.rewind;
function setvbuf
(stream : FILEs;
buffer : chars;
mode : int;
size : size_t)
return int;
procedure tmpnam (string : chars) renames System.CRTL.tmpnam;
-- The parameter must be a pointer to a string buffer of at least L_tmpnam
-- bytes (the call with a null parameter is not supported). The returned
-- value, which is just a copy of the input argument, is discarded.
function tmpfile return FILEs renames System.CRTL.tmpfile;
function ungetc (c : int; stream : FILEs) return int
renames System.CRTL.ungetc;
function unlink (filename : chars) return int
renames System.CRTL.unlink;
---------------------
-- Extra functions --
---------------------
-- These functions supply slightly thicker bindings than those above.
-- They are derived from functions in the C Run-Time Library, but may
-- do a bit more work than just directly calling one of the Library
-- functions.
function file_exists (name : chars) return int;
-- Tests if given name corresponds to an existing file
function is_regular_file (handle : int) return int;
-- Tests if given handle is for a regular file (result 1) or for a
-- non-regular file (pipe or device, result 0).
---------------------------------
-- Control of Text/Binary Mode --
---------------------------------
-- If text_translation_required is true, then the following functions may
-- be used to dynamically switch a file from binary to text mode or vice
-- versa. These functions have no effect if text_translation_required is
-- false (i.e. in normal unix mode). Use fileno to get a stream handle.
procedure set_binary_mode (handle : int);
procedure set_text_mode (handle : int);
----------------------------
-- Full Path Name support --
----------------------------
procedure full_name (nam : chars; buffer : chars);
-- Given a NUL terminated string representing a file name, returns in
-- buffer a NUL terminated string representing the full path name for
-- the file name. On systems where it is relevant the drive is also part
-- of the full path name. It is the responsibility of the caller to
-- pass an actual parameter for buffer that is big enough for any full
-- path name. Use max_path_len given below as the size of buffer.
max_path_len : Integer;
-- Maximum length of an allowable full path name on the system,
-- including a terminating NUL character.
private
-- The following functions are specialized in the body depending on the
-- operating system.
pragma Inline (fread);
pragma Inline (fwrite);
pragma Inline (setvbuf);
pragma Import (C, file_exists, "__gnat_file_exists");
pragma Import (C, is_regular_file, "__gnat_is_regular_file_fd");
pragma Import (C, set_binary_mode, "__gnat_set_binary_mode");
pragma Import (C, set_text_mode, "__gnat_set_text_mode");
pragma Import (C, max_path_len, "__gnat_max_path_len");
pragma Import (C, full_name, "__gnat_full_name");
-- The following may be implemented as macros, and so are supported
-- via an interface function in the a-cstrea.c file.
pragma Import (C, feof, "__gnat_feof");
pragma Import (C, ferror, "__gnat_ferror");
pragma Import (C, fileno, "__gnat_fileno");
pragma Import (C, EOF, "__gnat_constant_eof");
pragma Import (C, IOFBF, "__gnat_constant_iofbf");
pragma Import (C, IOLBF, "__gnat_constant_iolbf");
pragma Import (C, IONBF, "__gnat_constant_ionbf");
pragma Import (C, SEEK_CUR, "__gnat_constant_seek_cur");
pragma Import (C, SEEK_END, "__gnat_constant_seek_end");
pragma Import (C, SEEK_SET, "__gnat_constant_seek_set");
pragma Import (C, L_tmpnam, "__gnat_constant_l_tmpnam");
pragma Import (C, stderr, "__gnat_constant_stderr");
pragma Import (C, stdin, "__gnat_constant_stdin");
pragma Import (C, stdout, "__gnat_constant_stdout");
NULL_Stream : constant FILEs := System.Null_Address;
end Interfaces.C_Streams;
|
-- This spec has been automatically generated from STM32L151.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.OPAMP is
pragma Preelaborate;
---------------
-- Registers --
---------------
-- CSR_ANAWSEL array
type CSR_ANAWSEL_Field_Array is array (1 .. 3) of Boolean
with Component_Size => 1, Size => 3;
-- Type definition for CSR_ANAWSEL
type CSR_ANAWSEL_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- ANAWSEL as a value
Val : HAL.UInt3;
when True =>
-- ANAWSEL as an array
Arr : CSR_ANAWSEL_Field_Array;
end case;
end record
with Unchecked_Union, Size => 3;
for CSR_ANAWSEL_Field use record
Val at 0 range 0 .. 2;
Arr at 0 range 0 .. 2;
end record;
-- control/status register
type CSR_Register is record
-- OPAMP1 power down
OPA1PD : Boolean := True;
-- Switch 3 for OPAMP1 enable
S3SEL1 : Boolean := False;
-- Switch 4 for OPAMP1 enable
S4SEL1 : Boolean := False;
-- Switch 5 for OPAMP1 enable
S5SEL1 : Boolean := False;
-- Switch 6 for OPAMP1 enable
S6SEL1 : Boolean := False;
-- OPAMP1 offset calibration for P differential pair
OPA1CAL_L : Boolean := False;
-- OPAMP1 offset calibration for N differential pair
OPA1CAL_H : Boolean := False;
-- OPAMP1 low power mode
OPA1LPM : Boolean := False;
-- OPAMP2 power down
OPA2PD : Boolean := True;
-- Switch 3 for OPAMP2 enable
S3SEL2 : Boolean := False;
-- Switch 4 for OPAMP2 enable
S4SEL2 : Boolean := False;
-- Switch 5 for OPAMP2 enable
S5SEL2 : Boolean := False;
-- Switch 6 for OPAMP2 enable
S6SEL2 : Boolean := False;
-- OPAMP2 offset Calibration for P differential pair
OPA2CAL_L : Boolean := False;
-- OPAMP2 offset calibration for N differential pair
OPA2CAL_H : Boolean := False;
-- OPAMP2 low power mode
OPA2LPM : Boolean := False;
-- OPAMP3 power down
OPA3PD : Boolean := True;
-- Switch 3 for OPAMP3 Enable
S3SEL3 : Boolean := False;
-- Switch 4 for OPAMP3 enable
S4SEL3 : Boolean := False;
-- Switch 5 for OPAMP3 enable
S5SEL3 : Boolean := False;
-- Switch 6 for OPAMP3 enable
S6SEL3 : Boolean := False;
-- OPAMP3 offset Calibration for P differential pair
OPA3CAL_L : Boolean := False;
-- OPAMP3 offset calibration for N differential pair
OPA3CAL_H : Boolean := False;
-- OPAMP3 low power mode
OPA3LPM : Boolean := False;
-- Switch SanA enable for OPAMP1
ANAWSEL : CSR_ANAWSEL_Field := (As_Array => False, Val => 16#0#);
-- Switch 7 for OPAMP2 enable
S7SEL2 : Boolean := False;
-- Power range selection
AOP_RANGE : Boolean := False;
-- OPAMP1 calibration output
OPA1CALOUT : Boolean := False;
-- OPAMP2 calibration output
OPA2CALOUT : Boolean := False;
-- OPAMP3 calibration output
OPA3CALOUT : Boolean := False;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CSR_Register use record
OPA1PD at 0 range 0 .. 0;
S3SEL1 at 0 range 1 .. 1;
S4SEL1 at 0 range 2 .. 2;
S5SEL1 at 0 range 3 .. 3;
S6SEL1 at 0 range 4 .. 4;
OPA1CAL_L at 0 range 5 .. 5;
OPA1CAL_H at 0 range 6 .. 6;
OPA1LPM at 0 range 7 .. 7;
OPA2PD at 0 range 8 .. 8;
S3SEL2 at 0 range 9 .. 9;
S4SEL2 at 0 range 10 .. 10;
S5SEL2 at 0 range 11 .. 11;
S6SEL2 at 0 range 12 .. 12;
OPA2CAL_L at 0 range 13 .. 13;
OPA2CAL_H at 0 range 14 .. 14;
OPA2LPM at 0 range 15 .. 15;
OPA3PD at 0 range 16 .. 16;
S3SEL3 at 0 range 17 .. 17;
S4SEL3 at 0 range 18 .. 18;
S5SEL3 at 0 range 19 .. 19;
S6SEL3 at 0 range 20 .. 20;
OPA3CAL_L at 0 range 21 .. 21;
OPA3CAL_H at 0 range 22 .. 22;
OPA3LPM at 0 range 23 .. 23;
ANAWSEL at 0 range 24 .. 26;
S7SEL2 at 0 range 27 .. 27;
AOP_RANGE at 0 range 28 .. 28;
OPA1CALOUT at 0 range 29 .. 29;
OPA2CALOUT at 0 range 30 .. 30;
OPA3CALOUT at 0 range 31 .. 31;
end record;
subtype OTR_AO1_OPT_OFFSET_TRIM_Field is HAL.UInt10;
subtype OTR_AO2_OPT_OFFSET_TRIM_Field is HAL.UInt10;
subtype OTR_AO3_OPT_OFFSET_TRIM_Field is HAL.UInt10;
-- offset trimming register for normal mode
type OTR_Register is record
-- OPAMP1, 10-bit offset trim value for normal mode
AO1_OPT_OFFSET_TRIM : OTR_AO1_OPT_OFFSET_TRIM_Field := 16#0#;
-- OPAMP2, 10-bit offset trim value for normal mode
AO2_OPT_OFFSET_TRIM : OTR_AO2_OPT_OFFSET_TRIM_Field := 16#0#;
-- OPAMP3, 10-bit offset trim value for normal mode
AO3_OPT_OFFSET_TRIM : OTR_AO3_OPT_OFFSET_TRIM_Field := 16#0#;
-- unspecified
Reserved_30_30 : HAL.Bit := 16#0#;
-- Select user or factory trimming value
OT_USER : Boolean := False;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OTR_Register use record
AO1_OPT_OFFSET_TRIM at 0 range 0 .. 9;
AO2_OPT_OFFSET_TRIM at 0 range 10 .. 19;
AO3_OPT_OFFSET_TRIM at 0 range 20 .. 29;
Reserved_30_30 at 0 range 30 .. 30;
OT_USER at 0 range 31 .. 31;
end record;
subtype LPOTR_AO1_OPT_OFFSET_TRIM_LP_Field is HAL.UInt10;
subtype LPOTR_AO2_OPT_OFFSET_TRIM_LP_Field is HAL.UInt10;
subtype LPOTR_AO3_OPT_OFFSET_TRIM_LP_Field is HAL.UInt10;
-- OPAMP offset trimming register for low power mode
type LPOTR_Register is record
-- OPAMP1, 10-bit offset trim value for low power mode
AO1_OPT_OFFSET_TRIM_LP : LPOTR_AO1_OPT_OFFSET_TRIM_LP_Field := 16#0#;
-- OPAMP2, 10-bit offset trim value for low power mode
AO2_OPT_OFFSET_TRIM_LP : LPOTR_AO2_OPT_OFFSET_TRIM_LP_Field := 16#0#;
-- OPAMP3, 10-bit offset trim value for low power mode
AO3_OPT_OFFSET_TRIM_LP : LPOTR_AO3_OPT_OFFSET_TRIM_LP_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 LPOTR_Register use record
AO1_OPT_OFFSET_TRIM_LP at 0 range 0 .. 9;
AO2_OPT_OFFSET_TRIM_LP at 0 range 10 .. 19;
AO3_OPT_OFFSET_TRIM_LP at 0 range 20 .. 29;
Reserved_30_31 at 0 range 30 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Operational amplifiers
type OPAMP_Peripheral is record
-- control/status register
CSR : aliased CSR_Register;
-- offset trimming register for normal mode
OTR : aliased OTR_Register;
-- OPAMP offset trimming register for low power mode
LPOTR : aliased LPOTR_Register;
end record
with Volatile;
for OPAMP_Peripheral use record
CSR at 16#0# range 0 .. 31;
OTR at 16#4# range 0 .. 31;
LPOTR at 16#8# range 0 .. 31;
end record;
-- Operational amplifiers
OPAMP_Periph : aliased OPAMP_Peripheral
with Import, Address => System'To_Address (16#40007C5C#);
end STM32_SVD.OPAMP;
|
package Namet is
Hash_Num : constant Integer := 2**12;
subtype Hash_Index_Type is Integer range 0 .. Hash_Num - 1;
Name_Buffer : String (1 .. 16*1024);
Name_Len : Natural;
end Namet;
|
with Date_Package; use Date_Package;
with Ada.Text_IO; use Ada.Text_IO;
procedure Lab4 is
type Dates is array (1..10) of Date_Type;
procedure Sort(Arrayen_Med_Talen: in out Dates) is
procedure Swap(Tal_1,Tal_2: in out Date_Type) is
Tal_B : Date_Type; -- Temporary buffer
begin
Tal_B := Tal_1;
Tal_1 := Tal_2;
Tal_2 := Tal_B;
-- DEBUG New_Line; Put("SWAP IS RUNNING! INDEXES INPUT: "); Put(Tal_1); Put("+"); Put(Tal_2); New_Line;
end Swap;
Minsta_Talet: Date_Type;
Minsta_Talet_Index: Integer;
begin
--Minsta_Talet.Year := 0;
--Minsta_Talet.Month := 0;
--Minsta_Talet.Day := 0;
-- -- Loopa antalet gånger som arrayens längd
for IOuter in Arrayen_Med_Talen'Range loop
-- -- DEBUG Put("> "); Put(IOuter); Put(" <"); New_Line;
-- -- Loopa arrayen med start från yttra loopens värde varje gång. 1..20, 2..20, ... , 20..20
for I in IOuter..Arrayen_Med_Talen'Last loop
-- --DEBUG Put(">>>"); Put(I); New_Line;
if I = IOuter or Arrayen_Med_Talen(I) < Minsta_Talet then
Minsta_Talet := Arrayen_Med_Talen(I);
Minsta_Talet_Index := I;
end if;
end loop;
--
Swap(Arrayen_Med_Talen(IOuter), Arrayen_Med_Talen(Minsta_Talet_Index));
-- --DEBUG New_Line; Put("Vi swappar "); Put(Iouter); Put(" och "); Put(Minsta_Talet_Index); New_Line;
end loop;
end Sort;
procedure Test_Get(Date: out Date_Type) is
begin
loop
begin
Get(Date);
exit;
exception
when YEAR_ERROR => Put_Line("FEL: YEAR_ERROR");
when MONTH_ERROR => Put_Line("FEL: MONTH_ERROR");
when DAY_ERROR => Put_Line("FEL: DAY_ERROR");
when FORMAT_ERROR => Put_Line("FEL: FORMAT_ERROR");
end;
end loop;
end Test_Get;
Date: Date_Type;
Date2: Date_Type;
Dates_Array: Dates;
begin
Test_Get(Date);
Test_Get(Date2);
Put(Date); New_Line;
Put(Date2); New_Line;
for I in Dates'Range loop
Get(Dates_Array(I));
end loop;
for I in Dates'Range loop
Put(Dates_Array(I));
New_Line;
end loop;
Sort(Dates_Array);
New_Line;
for I in Dates'Range loop
Put(Dates_Array(I));
New_Line;
end loop;
Get(Date);
Get(Date2);
Put(Date); New_Line;
Put(Date2); New_Line;
if Date = Date2 then
Put("Lika"); New_Line;
else
Put("Olika"); New_Line;
end if;
if Date > Date2 then
Put(Date); Put(" > "); Put(Date2); New_Line;
else
Put(Date); Put(" !!> "); Put(Date2); New_Line;
end if;
if Date < Date2 then
Put(Date); Put(" < "); Put(Date2); New_Line;
else
Put(Date); Put(" !!< "); Put(Date2); New_Line;
end if;
-- Date := Previous_Date(Date);
-- Put(Date); New_Line;
-- Date := Next_Date(Date);
-- Put(Date); New_Line;
--for I in 1..368 loop
-- Date := Previous_Date(Date);
-- Put(Date); New_Line;
--end loop;
--Test_Leap_Years;
end Lab4;
|
-- SPDX-FileCopyrightText: 2019 Max Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
with Program.Compilation_Units;
with Program.Compilation_Unit_Vectors;
limited with Program.Library_Unit_Declarations;
package Program.Library_Items is
pragma Pure;
type Library_Item is limited interface
and Program.Compilation_Units.Compilation_Unit;
-- A library_item is a compilation unit that is the declaration, body, or
-- renaming of a library unit. Each library unit (except Standard) has a
-- parent unit, which is a library package or generic library package. A
-- library unit is a child of its parent unit. The root library units are
-- the children of the predefined library package Standard.
type Library_Item_Access is access all Library_Item'Class
with Storage_Size => 0;
not overriding function Parent (Self : access Library_Item)
return Program.Library_Unit_Declarations.Library_Unit_Declaration_Access
is abstract;
-- Returns the parent unit of the given library unit.
--
-- Returns a null if the Library_Unit argument represents package Standard.
-- Root Library_Unit arguments return the package Standard.
end Program.Library_Items;
|
package body AOC.AOC_2019.Day05 is
use Intcode;
function Run_Diagnostics (D : Day_05; Input : Element) return Element is
Instance : Instances.Instance := D.Compiler.Instantiate;
begin
Instance.Inputs.Append (Input);
Instance.Run;
return Instance.Outputs.Last_Element;
end Run_Diagnostics;
procedure Init (D : in out Day_05; Root : String) is
begin
D.Compiler.Compile (Root & "/input/2019/day05.txt");
end Init;
function Part_1 (D : Day_05) return String is
begin
return D.Run_Diagnostics (1)'Image;
end Part_1;
function Part_2 (D : Day_05) return String is
begin
return D.Run_Diagnostics (5)'Image;
end Part_2;
end AOC.AOC_2019.Day05;
|
package body openGL.Model.box
is
--------------
--- Attributes
--
function vertex_Sites (Self : in Item'Class) return Sites
is
left_Offset : constant Real := -0.5;
right_Offset : constant Real := 0.5;
lower_Offset : constant Real := -0.5;
upper_Offset : constant Real := 0.5;
front_Offset : constant Real := 0.5;
rear_Offset : constant Real := -0.5;
begin
return (Left_Lower_Front => Scaled (( left_Offset, lower_Offset, front_Offset), by => Self.Size),
Right_Lower_Front => Scaled ((right_Offset, lower_Offset, front_Offset), by => Self.Size),
Right_Upper_Front => Scaled ((right_Offset, upper_Offset, front_Offset), by => Self.Size),
Left_Upper_Front => Scaled (( left_Offset, upper_Offset, front_Offset), by => Self.Size),
Right_Lower_Rear => Scaled ((right_Offset, lower_Offset, rear_Offset), by => Self.Size),
Left_Lower_Rear => Scaled (( left_Offset, lower_Offset, rear_Offset), by => Self.Size),
Left_Upper_Rear => Scaled (( left_Offset, upper_Offset, rear_Offset), by => Self.Size),
Right_Upper_Rear => Scaled ((right_Offset, upper_Offset, rear_Offset), by => Self.Size));
end vertex_Sites;
function Size (Self : in Item) return Vector_3
is
begin
return Self.Size;
end Size;
end openGL.Model.box;
|
with Globals_Example1;
package Md_Example7 is
type T is tagged record
Attribute : Globals_Example1.Itype;
end record;
type T2 is new T with record
Child_Attribute : Globals_Example1.Itype;
end record;
type T3 is new T2 with null record;
end Md_Example7;
|
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Command_Line;
with Ada.Assertions;
with GNAT.Exception_Actions;
procedure Fuzzme is
Length : Integer := 3;
Input : String (1 .. Length);
Fd : File_Type;
Filename : aliased String := Ada.Command_Line.Argument(1);
procedure FuzzTest (Input : String) is
Zero : Integer := 0;
One : Integer := 1;
Answer : Integer := 0;
begin
if Input (Input'First .. Input'First) = "b" then
if Input (Input'First + 1 .. Input'First + 1) = "u" then
if Input (Input'First + 2 .. Input'First + 2) = "g" then
raise Ada.Assertions.Assertion_Error;
-- Answer := One / Zero;
end if;
end if;
end if;
end FuzzTest;
begin
Open (File => Fd,
Mode => In_File,
Name => Filename);
Get_Line (Fd, Input, Length);
FuzzTest(Input);
exception
when Occurence : others =>
GNAT.Exception_Actions.Core_Dump (Occurence);
end Fuzzme;
|
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Ada.Streams;
package Slim.Players.Displays is
type Display (Size : Ada.Streams.Stream_Element_Offset) is private;
procedure Clear (Self : in out Display);
procedure Draw_Text
(Self : in out Display;
X, Y : Positive;
Font : Slim.Fonts.Font;
Text : League.Strings.Universal_String);
procedure Draw_Pixel
(Self : in out Display;
X, Y : Positive;
Set : Boolean := True) with Inline;
type Transition_Kind is (None, Left, Right, Up, Down);
procedure Send_Message
(Self : Display;
Transition : Transition_Kind := None;
Offset : Natural := 0);
procedure Initialize
(Self : in out Display;
Player : Players.Player);
-- For internal purposes
private
type Display (Size : Ada.Streams.Stream_Element_Offset) is record
Socket : GNAT.Sockets.Socket_Type;
Buffer : Ada.Streams.Stream_Element_Array (1 .. Size);
end record;
end Slim.Players.Displays;
|
package AUnit.Assertions.Generic_Helpers is
procedure Assert_Error
(Message : String;
Source : String := GNAT.Source_Info.File;
Line : Natural := GNAT.Source_Info.Line);
generic
type Object_Type is private;
procedure Assert_Private
(Actual : Object_Type;
Expected : Object_Type;
Message : String;
Source : String := GNAT.Source_Info.File;
Line : Natural := GNAT.Source_Info.Line);
generic
type Object_Type is private;
with function Image (Item : Object_Type) return String is <>;
procedure Assert_Private_Image
(Actual : Object_Type;
Expected : Object_Type;
Source : String := GNAT.Source_Info.File;
Line : Natural := GNAT.Source_Info.Line);
generic
type Object_Type is limited private;
with function Equal (L, R : Object_Type) return Boolean;
procedure Assert_Limited_Private
(Actual : Object_Type;
Expected : Object_Type;
Message : String;
Source : String := GNAT.Source_Info.File;
Line : Natural := GNAT.Source_Info.Line);
generic
type Object_Type is limited private;
with function Equal (L, R : Object_Type) return Boolean;
with function Image (Item : Object_Type) return String is <>;
procedure Assert_Limited_Private_Image
(Actual : Object_Type;
Expected : Object_Type;
Source : String := GNAT.Source_Info.File;
Line : Natural := GNAT.Source_Info.Line);
Default_Tolerance : constant := 1.0E-5;
generic
type Num is digits <>;
procedure Assert_Float
(Actual : Num;
Expected : Num;
Tolerance : Num := Default_Tolerance;
Message : String;
Source : String := GNAT.Source_Info.File;
Line : Natural := GNAT.Source_Info.Line);
generic
type Num is digits <>;
procedure Assert_Float_Image
(Actual : Num;
Expected : Num;
Tolerance : Num := Default_Tolerance;
Source : String := GNAT.Source_Info.File;
Line : Natural := GNAT.Source_Info.Line);
generic
type Num is range <>;
procedure Assert_Integer
(Actual : Num;
Expected : Num;
Message : String;
Source : String := GNAT.Source_Info.File;
Line : Natural := GNAT.Source_Info.Line);
generic
type Num is range <>;
procedure Assert_Integer_Image
(Actual : Num;
Expected : Num;
Source : String := GNAT.Source_Info.File;
Line : Natural := GNAT.Source_Info.Line);
generic
type Num is mod <>;
procedure Assert_Modular
(Actual : Num;
Expected : Num;
Message : String;
Source : String := GNAT.Source_Info.File;
Line : Natural := GNAT.Source_Info.Line);
generic
type Num is mod <>;
procedure Assert_Modular_Image
(Actual : Num;
Expected : Num;
Source : String := GNAT.Source_Info.File;
Line : Natural := GNAT.Source_Info.Line);
generic
type Enum is (<>);
procedure Assert_Enumeration
(Actual : Enum;
Expected : Enum;
Message : String;
Source : String := GNAT.Source_Info.File;
Line : Natural := GNAT.Source_Info.Line);
generic
type Enum is (<>);
procedure Assert_Enumeration_Image
(Actual : Enum;
Expected : Enum;
Source : String := GNAT.Source_Info.File;
Line : Natural := GNAT.Source_Info.Line);
end AUnit.Assertions.Generic_Helpers;
|
------------------------------------------------------------------------------
-- --
-- WAVEFILES --
-- --
-- Wavefile benchmarking --
-- --
-- The MIT License (MIT) --
-- --
-- Copyright (c) 2020 Gustavo A. Hoffmann --
-- --
-- Permission is hereby granted, free of charge, to any person obtaining --
-- a copy of this software and associated documentation files (the --
-- "Software"), to deal in the Software without restriction, including --
-- without limitation the rights to use, copy, modify, merge, publish, --
-- distribute, sublicense, and / or sell copies of the Software, and to --
-- permit persons to whom the Software is furnished to do so, subject to --
-- the following conditions: --
-- --
-- The above copyright notice and this permission notice shall be --
-- included in all copies or substantial portions of the Software. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, --
-- EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF --
-- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. --
-- IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY --
-- CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, --
-- TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE --
-- SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. --
------------------------------------------------------------------------------
with Ada.Command_Line; use Ada.Command_Line;
with Ada.Text_IO; use Ada.Text_IO;
with System.Multiprocessors;
with System.Multiprocessors.Dispatching_Domains;
with Wavefile_Benchmarking; use Wavefile_Benchmarking;
with Wavefile_Benchmarking.Statistics; use Wavefile_Benchmarking.Statistics;
procedure Simple_Benchmarking is
CPU_MHz : Float := 2650.0;
Verbose : constant Boolean := True;
Results : Wavefile_Benchmark_Infos (1 .. 5);
task type Wavefile_Benchmark
with CPU => 1
is
entry Finish (Res : out Wavefile_Benchmark_Infos);
end Wavefile_Benchmark;
task body Wavefile_Benchmark is
Local_Results : Wavefile_Benchmark_Infos (Results'Range);
begin
if Verbose then
Display_Current_CPU : declare
use System.Multiprocessors;
use System.Multiprocessors.Dispatching_Domains;
begin
Put_Line ("Current CPU : " & CPU_Range'Image (Get_CPU));
end Display_Current_CPU;
end if;
Benchm_CPU_Time (CPU_MHz, Local_Results);
accept Finish (Res : out Wavefile_Benchmark_Infos) do
Res := Local_Results;
end Finish;
end Wavefile_Benchmark;
Benchmark_Using_Tasking : constant Boolean := False;
begin
if Argument_Count >= 1 then
CPU_MHz := Float'Value (Argument (1));
end if;
if Verbose then
Put_Line ("Using CPU @ " & Float'Image (CPU_MHz) & " MHz");
end if;
if Benchmark_Using_Tasking then
declare
Wav_Benchmark : Wavefile_Benchmark;
begin
Wav_Benchmark.Finish (Results);
end;
else
Benchm_CPU_Time (CPU_MHz, Results);
end if;
Calc_Statistics : declare
Stats : Wavefile_Benchmark_Statistics;
begin
Calculate_Statistics (Results, Stats);
Display (Stats);
end Calc_Statistics;
end Simple_Benchmarking;
|
-- { dg-do compile }
procedure type_conv is
type Str is new String;
generic
package G is private end;
package body G is
Name : constant String := "it";
Full_Name : Str := Str (Name & " works");
end G;
package Inst is new G;
begin
null;
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;
|
package Vulkan is
function VkEnumerateInstanceVersion return Integer;
Vulkan_Error : exception;
end Vulkan;
|
package Problem_55 is
-- If we take 47, reverse and add, 47 + 74 = 121, which is palindromic.
--
-- Not all numbers produce palindromes so quickly. For example,
-- 349 + 943 = 1292,
-- 1292 + 2921 = 4213
-- 4213 + 3124 = 7337
-- That is, 349 took three iterations to arrive at a palindrome.
--
-- Although no one has proved it yet, it is thought that some numbers,
-- like 196, never produce a palindrome. A number that never forms a
-- palindrome through the reverse and add process is called a Lychrel number.
-- Due to the theoretical nature of these numbers, and for the purpose of
-- this problem, we shall assume that a number is Lychrel until proven
-- otherwise. In addition you are given that for every number below
-- ten-thousand, it will either (i) become a palindrome in less than fifty
-- iterations, or, (ii) no one, with all the computing power that exists,
-- has managed so far to map it to a palindrome. In fact, 10677 is the first
-- number to be shown to require over fifty iterations before producing a
-- palindrome: 4668731596684224866951378664 (53 iterations, 28-digits).
--
-- Surprisingly, there are palindromic numbers that are themselves Lychrel
-- numbers; the first example is 4994.
--
-- How many Lychrel numbers are there below ten-thousand?
procedure Solve;
end Problem_55;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2017, 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 Interfaces.C.Pointers;
with League.Strings.Internals;
with Matreshka.Internals.Strings.C;
package body Services is
subtype LPWSTR is Matreshka.Internals.Strings.C.Utf16_Code_Unit_Access;
type LPWSTR_Array is array (Positive range <>) of aliased LPWSTR;
package LPWSTR_Pointers is new Interfaces.C.Pointers
(Positive, LPWSTR, LPWSTR_Array, null);
type LPSERVICE_MAIN_FUNCTION is access
procedure (dwArgc : DWORD; lpszArgv : LPWSTR_Pointers.Pointer)
with Convention => Stdcall;
type LPHANDLER_FUNCTION_EX is access
function
(dwControl : DWORD;
dwEventType : DWORD;
lpEventData : System.Address;
lpContext : access Service'Class) return DWORD
with Convention => Stdcall;
type SERVICE_TABLE_ENTRY is record
lpServiceName : LPWSTR;
lpServiceProc : LPSERVICE_MAIN_FUNCTION;
end record;
procedure Service_Main (dwArgc : DWORD; lpszArgv : LPWSTR_Pointers.Pointer)
with Convention => Stdcall;
function Handler_Ex
(dwControl : DWORD;
dwEventType : DWORD;
lpEventData : System.Address;
lpContext : access Service'Class) return DWORD
with Convention => Stdcall;
function To_LPWSTR (Value : League.Strings.Universal_String) return LPWSTR;
Service_List : array (1 .. 1) of Service_Access;
--------------
-- Dispatch --
--------------
procedure Dispatch (Service : Service_Access) is
use type DWORD;
TABLE : constant array (1 .. 2) of aliased SERVICE_TABLE_ENTRY :=
(1 => (To_LPWSTR (Service.Name), Service_Main'Access),
2 => (null, null));
function StartServiceCtrlDispatcher
(lpServiceTable : access constant SERVICE_TABLE_ENTRY)
return DWORD
with Import,
Convention => Stdcall,
External_Name => "StartServiceCtrlDispatcherW";
begin
Service_List (1) := Service;
if StartServiceCtrlDispatcher (TABLE (TABLE'First)'Access)
/= NO_ERROR
then
raise Program_Error;
end if;
end Dispatch;
----------------
-- Handler_Ex --
----------------
function Handler_Ex
(dwControl : DWORD;
dwEventType : DWORD;
lpEventData : System.Address;
lpContext : access Service'Class) return DWORD
is
pragma Unreferenced (dwEventType, lpEventData);
Value : Control_Kind;
begin
case dwControl is
when SERVICE_CONTROL_CONTINUE =>
Value := Continue;
when SERVICE_CONTROL_INTERROGATE =>
Value := Interrogate;
when SERVICE_CONTROL_PAUSE =>
Value := Pause;
when SERVICE_CONTROL_PRESHUTDOWN =>
Value := Pre_Shutdown;
when SERVICE_CONTROL_SHUTDOWN =>
Value := Shutdown;
when SERVICE_CONTROL_STOP =>
Value := Stop;
when others =>
return NO_ERROR;
end case;
lpContext.Control
(Control => Value,
Status => lpContext.Listener'Access);
return NO_ERROR;
end Handler_Ex;
------------------
-- Service_Main --
------------------
procedure Service_Main
(dwArgc : DWORD;
lpszArgv : LPWSTR_Pointers.Pointer)
is
function RegisterServiceCtrlHandlerEx
(lpServiceName : LPWSTR;
lpHandlerProc : LPHANDLER_FUNCTION_EX;
lpContext : access Service'Class)
return HANDLE
with Import,
Convention => Stdcall,
External_Name => "RegisterServiceCtrlHandlerExW";
Service : Service_Access renames Service_List (1);
Args : League.String_Vectors.Universal_String_Vector;
Argv : constant LPWSTR_Array := LPWSTR_Pointers.Value
(lpszArgv, Length => Interfaces.C.ptrdiff_t (dwArgc));
begin
for Arg of Argv loop
Args.Append
(Matreshka.Internals.Strings.C.To_Valid_Universal_String (Arg));
end loop;
Service.Listener.StatusHandle := RegisterServiceCtrlHandlerEx
(lpServiceName => To_LPWSTR (Service.Name),
lpHandlerProc => Handler_Ex'Access,
lpContext => Service);
Service.Listener.Set_Status (Start_Pending);
Service.Run (Args, Service.Listener'Access);
exception
when others =>
Service.Listener.Set_Status (Stopped);
end Service_Main;
----------------
-- Set_Status --
----------------
not overriding procedure Set_Status
(Self : in out Status_Listener;
Value : Service_Status)
is
use type DWORD;
procedure SetServiceStatus
(hServiceStatus : HANDLE;
lpServiceStatus : access C_SERVICE_STATUS)
with Import,
Convention => Stdcall,
External_Name => "SetServiceStatus";
Map : constant array (Service_Status) of DWORD :=
(Stopped => SERVICE_STOPPED,
Start_Pending => SERVICE_START_PENDING,
Stop_Pending => SERVICE_STOP_PENDING,
Running => SERVICE_RUNNING,
Continue_Pending => SERVICE_CONTINUE_PENDING,
Pause_Pending => SERVICE_PAUSE_PENDING,
Paused => SERVICE_PAUSED);
begin
Self.Status.dwCurrentState := Map (Value);
Self.Status.dwCheckPoint := Self.Status.dwCheckPoint + 1;
SetServiceStatus (Self.StatusHandle, Self.Status'Access);
end Set_Status;
---------------
-- To_LPWSTR --
---------------
function To_LPWSTR (Value : League.Strings.Universal_String)
return LPWSTR is
begin
return League.Strings.Internals.Internal (Value).Value (0)'Access;
end To_LPWSTR;
end Services;
|
with Ada.Assertions; use Ada.Assertions;
with Ada.Strings.Fixed; use Ada.Strings.Fixed;
with Rejuvenation.Finder; use Rejuvenation.Finder;
with Rejuvenation.Utils; use Rejuvenation.Utils;
with String_Vectors; use String_Vectors;
with String_Vectors_Utils; use String_Vectors_Utils;
package body Rejuvenation.Replacer is
function Is_Empty
(Node : Ada_Node'Class; Replacements : Map) return Boolean
with
Pre => not Node.Is_Null;
function Is_Empty
(Node : Ada_Node'Class; Replacements : Map) return Boolean
is
begin
return
Is_Placeholder (Node)
and then Replacements.Element (Get_Placeholder_Name (Node)) = "";
end Is_Empty;
function Present_And_Empty
(Node : Ada_Node'Class; Replacements : Map) return Boolean is
(not Node.Is_Null and then Is_Empty (Node, Replacements));
function Is_Empty_List
(List : Ada_List'Class; Replacements : Map) return Boolean;
function Is_Empty_List
(List : Ada_List'Class; Replacements : Map) return Boolean
is
begin
return
(for all Child of List.Children => Is_Empty (Child, Replacements));
end Is_Empty_List;
function Is_Replacement_Node
(Node : Ada_Node'Class; Replacements : Map) return Boolean;
function Is_Replacement_Node
(Node : Ada_Node'Class; Replacements : Map) return Boolean
is
begin
if Is_Placeholder (Node) then
return True;
end if;
case Node.Kind is
when Ada_Object_Decl =>
declare
O_D : constant Object_Decl := Node.As_Object_Decl;
begin
return
Is_Empty_List (O_D.F_Ids, Replacements)
or else Present_And_Empty (O_D.F_Default_Expr, Replacements);
end;
when Ada_Call_Expr =>
declare
C_E : constant Call_Expr := Node.As_Call_Expr;
Suffix : constant Ada_Node := C_E.F_Suffix;
begin
return
Suffix.Kind = Ada_Assoc_List
and then Is_Empty_List
(C_E.F_Suffix.As_Ada_List, Replacements);
end;
when Ada_If_Stmt =>
declare
I_S : constant If_Stmt := Node.As_If_Stmt;
begin
return Is_Empty_List (I_S.F_Else_Stmts, Replacements);
end;
when Ada_Decl_Block =>
declare
D_B : constant Decl_Block := Node.As_Decl_Block;
Decls : constant Declarative_Part := D_B.F_Decls;
begin
-- Check for empty declarative part: "declare begin .. end;"
return
not Decls.Is_Null
and then
(for all Child of Decls.F_Decls =>
Child.Kind = Ada_Object_Decl
and then Is_Empty_List
(Child.As_Object_Decl.F_Ids, Replacements));
end;
when Ada_Param_Assoc =>
declare
P_A : constant Param_Assoc := Node.As_Param_Assoc;
begin
return Present_And_Empty (P_A.F_Designator, Replacements);
end;
when Ada_Stmt_List => -- TODO: can lists be combined?
declare
S_L : constant Stmt_List := Node.As_Stmt_List;
begin
-- An empty stmt within a statement list is fine
-- Only a completely empty statement list is problematic in some contexts
-- including
-- * if then else <empty> end if
-- * when others => <empty>
-- * begin <empty> end;
return Is_Empty_List (S_L, Replacements);
end;
when Ada_Assoc_List | Ada_Aspect_Assoc_List =>
declare
A_L : constant Ada_List := Node.As_Ada_List;
begin
-- When a child is empty, also a separator must be removed
return
(for some Child of A_L.Children =>
Is_Empty (Child, Replacements));
end;
when Ada_Aspect_Spec =>
declare
A_S : constant Aspect_Spec := Node.As_Aspect_Spec;
begin
-- When the list of aspects is empty, also the 'with' keyword must be removed
return Is_Empty_List (A_S.F_Aspect_Assocs, Replacements);
end;
when others =>
return False;
end case;
end Is_Replacement_Node;
function Get_Replacement_For_Node
(Node : Ada_Node'Class; Replacements : Map) return String;
function Get_Replacement_For_Node
(Node : Ada_Node'Class; Replacements : Map) return String
is
begin
if Is_Placeholder (Node) then
return Replacements.Element (Get_Placeholder_Name (Node));
end if;
case Node.Kind is
when Ada_Object_Decl =>
declare
O_D : constant Object_Decl := Node.As_Object_Decl;
Ids : String_Vectors.Vector;
begin
for Id of O_D.F_Ids loop
declare
Value : constant String := Replace (Id, Replacements);
begin
if Value /= "" then
Ids.Append (Value);
end if;
end;
end loop;
if Ids.Is_Empty then
return "";
else
declare
Start : constant String :=
Join (Ids, ", ") & " : " &
(if O_D.F_Has_Aliased then "aliased " else "") &
(if O_D.F_Has_Constant then "constant " else "") &
Replace (O_D.F_Type_Expr, Replacements) & " ";
Default_Expr : constant String :=
Replace (O_D.F_Default_Expr, Replacements);
Default_Expr_Tokens : constant String :=
(if Default_Expr = "" then ""
else ":= " & Default_Expr & " ");
Aspects : constant String :=
Replace (O_D.F_Aspects, Replacements);
begin
return Start & Default_Expr_Tokens & Aspects & ";";
end;
end if;
end;
when Ada_Call_Expr =>
declare
C_E : constant Call_Expr := Node.As_Call_Expr;
Name : constant String := Replace (C_E.F_Name, Replacements);
Suffix : constant String :=
(if C_E.F_Suffix.Kind = Ada_Assoc_List then
(if Is_Empty_List (C_E.F_Suffix.As_Ada_List, Replacements)
then ""
else "(" & Replace (C_E.F_Suffix, Replacements) & ")")
else Replace (C_E.F_Suffix, Replacements));
begin
return Name & Suffix;
end;
when Ada_If_Stmt =>
declare
I_S : constant If_Stmt := Node.As_If_Stmt;
Cond_Expr : constant String :=
Replace (I_S.F_Cond_Expr, Replacements);
Then_Stmts : constant String :=
Replace (I_S.F_Then_Stmts, Replacements);
Else_Stmts : constant String :=
(if Is_Empty_List (I_S.F_Else_Stmts, Replacements) then ""
else " else " & Replace (I_S.F_Else_Stmts, Replacements));
Alternatives : String_Vectors.Vector;
begin
for Alternative of I_S.F_Alternatives loop
Alternatives.Append (Replace (Alternative, Replacements));
end loop;
return
"if " & Cond_Expr & " then " & Then_Stmts &
Join (Alternatives) & Else_Stmts & " end if;";
end;
when Ada_Decl_Block =>
declare
D_B : constant Decl_Block := Node.As_Decl_Block;
Decls : String_Vectors.Vector;
begin
for Decl of D_B.F_Decls.F_Decls loop
declare
Value : constant String := Replace (Decl, Replacements);
begin
if Value /= "" then
Decls.Append (Value);
end if;
end;
end loop;
return
(if Decls.Is_Empty then "" else "declare " & Join (Decls)) &
" begin " & Replace (D_B.F_Stmts, Replacements) & " end;";
end;
when Ada_Param_Assoc =>
declare
P_A : constant Param_Assoc := Node.As_Param_Assoc;
Designator : constant String :=
Replace (P_A.F_Designator, Replacements);
R_Expr : constant String :=
Replace (P_A.F_R_Expr, Replacements);
Designator_Tokens : constant String :=
(if Designator = "" then "" else Designator & " => ");
begin
return Designator_Tokens & R_Expr;
end;
when Ada_Aspect_Spec =>
declare
A_S : constant Aspect_Spec := Node.As_Aspect_Spec;
Aspect_Assocs : String_Vectors.Vector;
begin
for Aspect_Assoc of A_S.F_Aspect_Assocs loop
declare
Value : constant String :=
Replace (Aspect_Assoc, Replacements);
begin
if Value /= "" then
Aspect_Assocs.Append (Value);
end if;
end;
end loop;
return
(if Aspect_Assocs.Is_Empty then ""
else "with " & Join (Aspect_Assocs, ", "));
end;
when Ada_Stmt_List =>
declare
S_L : constant Stmt_List := Node.As_Stmt_List;
Stmts : String_Vectors.Vector;
begin
for Child of S_L.Children loop
declare
Value : constant String := Replace (Child, Replacements);
begin
if Value /= "" then
Stmts.Append (Value);
end if;
end;
end loop;
return
(if Stmts.Is_Empty then "null;"
else Join (Stmts, (1 => ASCII.LF)));
end;
when Ada_Assoc_List | Ada_Aspect_Assoc_List =>
declare
A_L : constant Ada_List := Node.As_Ada_List;
Values : String_Vectors.Vector;
begin
for Child of A_L.Children loop
declare
Value : constant String := Replace (Child, Replacements);
begin
if Value /= "" then
Values.Append (Value);
end if;
end;
end loop;
return Join (Values, ", ");
end;
when others =>
Assert
(Check => False,
Message =>
"Get_Replacement_For_Node: Unexpected kind " &
Node.Kind'Image);
return "";
end case;
end Get_Replacement_For_Node;
function Get_Nodes_To_Be_Replaced
(Node : Ada_Node'Class; Replacements : Map) return Node_List.Vector;
function Get_Nodes_To_Be_Replaced
(Node : Ada_Node'Class; Replacements : Map) return Node_List.Vector
is
function Predicate (Node : Ada_Node'Class) return Boolean is
(Is_Replacement_Node (Node, Replacements));
begin
return Find_Non_Contained (Node, Predicate'Access);
end Get_Nodes_To_Be_Replaced;
function Tail (V : Node_List.Vector) return Node_List.Vector;
function Tail (V : Node_List.Vector) return Node_List.Vector
is
Return_Value : Node_List.Vector := V.Copy;
begin
Node_List.Delete_First (Return_Value);
return Return_Value;
end Tail;
function Replace
(Original : String; Nodes_To_Be_Replaced : Node_List.Vector;
Replacements : Map) return String;
function Replace
(Original : String; Nodes_To_Be_Replaced : Node_List.Vector;
Replacements : Map) return String
is
begin
if Nodes_To_Be_Replaced.Is_Empty then
return Original;
end if;
declare
Node_To_Be_Replaced : constant Ada_Node'Class :=
Nodes_To_Be_Replaced.First_Element;
R_S : constant String := Raw_Signature (Node_To_Be_Replaced);
First : constant Natural := Index (Original, R_S);
Last : constant Natural := First + R_S'Length - 1;
Replacement_Nodes_Tail : constant Node_List.Vector :=
Tail (Nodes_To_Be_Replaced);
begin
Assert
(Check => First /= 0,
Message => "Replacement_Node unexpectedly not found");
declare
Prefix : String renames Original (Original'First .. First - 1);
Remainder : String renames Original (Last + 1 .. Original'Last);
Insert : constant String :=
Get_Replacement_For_Node (Node_To_Be_Replaced, Replacements);
Tail : constant String :=
Replace (Remainder, Replacement_Nodes_Tail, Replacements);
begin
return Prefix & Insert & Tail;
end;
end;
end Replace;
function Replace (Node : Ada_Node'Class; Replacements : Map) return String
is
Nodes_To_Be_Replaced : constant Node_List.Vector :=
Get_Nodes_To_Be_Replaced (Node, Replacements);
begin
return
Replace (Raw_Signature (Node), Nodes_To_Be_Replaced, Replacements);
end Replace;
end Rejuvenation.Replacer;
|
--//////////////////////////////////////////////////////////
-- SFML - Simple and Fast Multimedia Library
-- Copyright (C) 2007-2015 Laurent Gomila (laurent@sfml-dev.org)
-- This software is provided 'as-is', without any express or implied warranty.
-- In no event will the authors be held liable for any damages arising from the use of this software.
-- Permission is granted to anyone to use this software for any purpose,
-- including commercial applications, and to alter it and redistribute it freely,
-- subject to the following restrictions:
-- 1. The origin of this software must not be misrepresented;
-- you must not claim that you wrote the original software.
-- If you use this software in a product, an acknowledgment
-- in the product documentation would be appreciated but is not required.
-- 2. Altered source versions must be plainly marked as such,
-- and must not be misrepresented as being the original software.
-- 3. This notice may not be removed or altered from any source distribution.
--//////////////////////////////////////////////////////////
with Sf.System.Vector3;
package Sf.Audio.Listener is
--//////////////////////////////////////////////////////////
--/ @brief Change the global volume of all the sounds and musics
--/
--/ The volume is a number between 0 and 100; it is combined with
--/ the individual volume of each sound / music.
--/ The default value for the volume is 100 (maximum).
--/
--/ @param volume New global volume, in the range [0, 100]
--/
--//////////////////////////////////////////////////////////
procedure setGlobalVolume (volume : float);
--//////////////////////////////////////////////////////////
--/ @brief Get the current value of the global volume
--/
--/ @return Current global volume, in the range [0, 100]
--/
--//////////////////////////////////////////////////////////
function getGlobalVolume return float;
--//////////////////////////////////////////////////////////
--/ @brief Set the position of the listener in the scene
--/
--/ The default listener's position is (0, 0, 0).
--/
--/ @param position New position of the listener
--/
--//////////////////////////////////////////////////////////
procedure setPosition (position : Sf.System.Vector3.sfVector3f);
--//////////////////////////////////////////////////////////
--/ @brief Get the current position of the listener in the scene
--/
--/ @return The listener's position
--/
--//////////////////////////////////////////////////////////
function getPosition return Sf.System.Vector3.sfVector3f;
--//////////////////////////////////////////////////////////
--/ @brief Set the orientation of the forward vector in the scene
--/
--/ The direction (also called "at vector") is the vector
--/ pointing forward from the listener's perspective. Together
--/ with the up vector, it defines the 3D orientation of the
--/ listener in the scene. The direction vector doesn't
--/ have to be normalized.
--/ The default listener's direction is (0, 0, -1).
--/
--/ @param direction New listener's direction
--/
--//////////////////////////////////////////////////////////
procedure setDirection (direction : Sf.System.Vector3.sfVector3f);
--//////////////////////////////////////////////////////////
--/ @brief Get the current forward vector of the listener in the scene
--/
--/ @return Listener's forward vector (not normalized)
--/
--//////////////////////////////////////////////////////////
function getDirection return Sf.System.Vector3.sfVector3f;
--//////////////////////////////////////////////////////////
--/ @brief Set the upward vector of the listener in the scene
--/
--/ The up vector is the vector that points upward from the
--/ listener's perspective. Together with the direction, it
--/ defines the 3D orientation of the listener in the scene.
--/ The up vector doesn't have to be normalized.
--/ The default listener's up vector is (0, 1, 0). It is usually
--/ not necessary to change it, especially in 2D scenarios.
--/
--/ @param upVector New listener's up vector
--/
--//////////////////////////////////////////////////////////
procedure setUpVector (upVector : Sf.System.Vector3.sfVector3f);
--//////////////////////////////////////////////////////////
--/ @brief Get the current upward vector of the listener in the scene
--/
--/ @return Listener's upward vector (not normalized)
--/
--//////////////////////////////////////////////////////////
function getUpVector return Sf.System.Vector3.sfVector3f;
private
pragma Import (C, setGlobalVolume, "sfListener_setGlobalVolume");
pragma Import (C, getGlobalVolume, "sfListener_getGlobalVolume");
pragma Import (C, setPosition, "sfListener_setPosition");
pragma Import (C, getPosition, "sfListener_getPosition");
pragma Import (C, setDirection, "sfListener_setDirection");
pragma Import (C, getDirection, "sfListener_getDirection");
pragma Import (C, setUpVector, "sfListener_setUpVector");
pragma Import (C, getUpVector, "sfListener_getUpVector");
end Sf.Audio.Listener;
|
--
-- 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 Types;
package Web_IO is
subtype HTML_String is String;
function Help_Image return HTML_String;
function Jobs_Image return HTML_String;
function Job_Image (Job : in Types.Job_Id)
return HTML_String;
end Web_IO;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . V X W O R K S . E X T --
-- --
-- B o d y --
-- --
-- Copyright (C) 2008-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/>. --
-- --
------------------------------------------------------------------------------
-- This package provides vxworks specific support functions needed
-- by System.OS_Interface.
-- This is a version for VxWorks 5 based systems with no interrupts:
-- HI-Ravenscar for VxWorks 5, VxWorks 653 vThreads (not ravenscar-cert)
package body System.VxWorks.Ext is
ERROR : constant := -1;
--------------
-- Int_Lock --
--------------
function Int_Lock return int is
begin
return ERROR;
end Int_Lock;
----------------
-- Int_Unlock --
----------------
function Int_Unlock (Old : int) return int is
pragma Unreferenced (Old);
begin
return ERROR;
end Int_Unlock;
-----------------------
-- Interrupt_Connect --
-----------------------
function Interrupt_Connect
(Vector : Interrupt_Vector;
Handler : Interrupt_Handler;
Parameter : System.Address := System.Null_Address) return int
is
pragma Unreferenced (Vector, Handler, Parameter);
begin
return ERROR;
end Interrupt_Connect;
-----------------------
-- Interrupt_Context --
-----------------------
function Interrupt_Context return int is
begin
-- For VxWorks 653 vThreads, never in an interrupt context
return 0;
end Interrupt_Context;
--------------------------------
-- Interrupt_Number_To_Vector --
--------------------------------
function Interrupt_Number_To_Vector
(intNum : int) return Interrupt_Vector
is
pragma Unreferenced (intNum);
begin
return 0;
end Interrupt_Number_To_Vector;
---------------
-- semDelete --
---------------
function semDelete (Sem : SEM_ID) return int is
function Os_Sem_Delete (Sem : SEM_ID) return int;
pragma Import (C, Os_Sem_Delete, "semDelete");
begin
return Os_Sem_Delete (Sem);
end semDelete;
------------------------
-- taskCpuAffinitySet --
------------------------
function taskCpuAffinitySet (tid : t_id; CPU : int) return int is
pragma Unreferenced (tid, CPU);
begin
return ERROR;
end taskCpuAffinitySet;
-------------------------
-- taskMaskAffinitySet --
-------------------------
function taskMaskAffinitySet (tid : t_id; CPU_Set : unsigned) return int is
pragma Unreferenced (tid, CPU_Set);
begin
return ERROR;
end taskMaskAffinitySet;
end System.VxWorks.Ext;
|
-- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2021 onox <denkpadje@gmail.com>
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
with Ada.Unchecked_Conversion;
with EGL.API;
with EGL.Errors;
package body EGL.Objects.Surfaces is
Color_Space : constant Int := 16#309D#;
Color_Space_sRGB : constant Int := 16#3089#;
Color_Space_Linear : constant Int := 16#308A#;
function Create_Surface
(Display : Displays.Display;
Config : Configs.Config;
Window : Native_Window_Ptr;
sRGB : Boolean) return Surface
is
No_Surface : constant ID_Type := ID_Type (System.Null_Address);
Attributes : constant Int_Array :=
(Color_Space,
(if sRGB then Color_Space_sRGB else Color_Space_Linear),
None);
ID : constant ID_Type :=
API.Create_Platform_Window_Surface.Ref
(Display.ID, Config.ID, Window, Attributes);
begin
if ID = No_Surface then
Errors.Raise_Exception_On_EGL_Error;
end if;
return Result : Surface (Display.Platform) do
Result.Reference.ID := ID;
Result.Display := Display;
end return;
end Create_Surface;
function Width (Object : Surface) return Natural is
Result : Int;
begin
if not Boolean (API.Query_Surface (Object.Display.ID, Object.ID, Width, Result)) then
Errors.Raise_Exception_On_EGL_Error;
end if;
return Natural (Result);
end Width;
function Height (Object : Surface) return Natural is
Result : Int;
begin
if not Boolean (API.Query_Surface (Object.Display.ID, Object.ID, Height, Result)) then
Errors.Raise_Exception_On_EGL_Error;
end if;
return Natural (Result);
end Height;
function Behavior (Object : Surface) return Swap_Behavior is
Result : Int;
function Convert is new Ada.Unchecked_Conversion
(Source => Int, Target => Swap_Behavior);
begin
if not Boolean (API.Query_Surface
(Object.Display.ID, Object.ID, EGL.Swap_Behavior, Result))
then
Errors.Raise_Exception_On_EGL_Error;
end if;
return Convert (Result);
end Behavior;
procedure Swap_Buffers (Object : Surface) is
begin
if not Boolean (API.Swap_Buffers (Object.Display.ID, Object.ID)) then
Errors.Raise_Exception_On_EGL_Error;
end if;
end Swap_Buffers;
overriding procedure Pre_Finalize (Object : in out Surface) is
No_Surface : constant ID_Type := ID_Type (System.Null_Address);
begin
pragma Assert (Object.ID /= No_Surface);
if not Boolean (API.Destroy_Surface (Object.Display.ID, Object.ID)) then
Errors.Raise_Exception_On_EGL_Error;
end if;
Object.Reference.ID := No_Surface;
end Pre_Finalize;
end EGL.Objects.Surfaces;
|
------------------------------------------------------------------------------
-- --
-- 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.
------------------------------------------------------------------------------
package AMF.Internals.Tables.Utp_Metamodel.Properties is
procedure Initialize;
private
procedure Initialize_1;
procedure Initialize_2;
procedure Initialize_3;
procedure Initialize_4;
procedure Initialize_5;
procedure Initialize_6;
procedure Initialize_7;
procedure Initialize_8;
procedure Initialize_9;
procedure Initialize_10;
procedure Initialize_11;
procedure Initialize_12;
procedure Initialize_13;
procedure Initialize_14;
procedure Initialize_15;
procedure Initialize_16;
procedure Initialize_17;
procedure Initialize_18;
procedure Initialize_19;
procedure Initialize_20;
procedure Initialize_21;
procedure Initialize_22;
procedure Initialize_23;
procedure Initialize_24;
procedure Initialize_25;
procedure Initialize_26;
procedure Initialize_27;
procedure Initialize_28;
procedure Initialize_29;
procedure Initialize_30;
procedure Initialize_31;
procedure Initialize_32;
procedure Initialize_33;
procedure Initialize_34;
procedure Initialize_35;
procedure Initialize_36;
procedure Initialize_37;
procedure Initialize_38;
procedure Initialize_39;
procedure Initialize_40;
procedure Initialize_41;
procedure Initialize_42;
procedure Initialize_43;
procedure Initialize_44;
procedure Initialize_45;
procedure Initialize_46;
procedure Initialize_47;
procedure Initialize_48;
procedure Initialize_49;
procedure Initialize_50;
procedure Initialize_51;
procedure Initialize_52;
procedure Initialize_53;
procedure Initialize_54;
procedure Initialize_55;
procedure Initialize_56;
procedure Initialize_57;
procedure Initialize_58;
procedure Initialize_59;
procedure Initialize_60;
procedure Initialize_61;
procedure Initialize_62;
procedure Initialize_63;
procedure Initialize_64;
procedure Initialize_65;
procedure Initialize_66;
procedure Initialize_67;
procedure Initialize_68;
procedure Initialize_69;
procedure Initialize_70;
procedure Initialize_71;
procedure Initialize_72;
procedure Initialize_73;
procedure Initialize_74;
procedure Initialize_75;
procedure Initialize_76;
procedure Initialize_77;
procedure Initialize_78;
procedure Initialize_79;
procedure Initialize_80;
procedure Initialize_81;
procedure Initialize_82;
procedure Initialize_83;
procedure Initialize_84;
procedure Initialize_85;
procedure Initialize_86;
procedure Initialize_87;
procedure Initialize_88;
procedure Initialize_89;
procedure Initialize_90;
procedure Initialize_91;
procedure Initialize_92;
procedure Initialize_93;
procedure Initialize_94;
procedure Initialize_95;
procedure Initialize_96;
procedure Initialize_97;
procedure Initialize_98;
procedure Initialize_99;
procedure Initialize_100;
procedure Initialize_101;
procedure Initialize_102;
procedure Initialize_103;
procedure Initialize_104;
procedure Initialize_105;
procedure Initialize_106;
procedure Initialize_107;
procedure Initialize_108;
procedure Initialize_109;
procedure Initialize_110;
procedure Initialize_111;
procedure Initialize_112;
procedure Initialize_113;
procedure Initialize_114;
procedure Initialize_115;
procedure Initialize_116;
procedure Initialize_117;
procedure Initialize_118;
procedure Initialize_119;
procedure Initialize_120;
procedure Initialize_121;
procedure Initialize_122;
procedure Initialize_123;
procedure Initialize_124;
procedure Initialize_125;
procedure Initialize_126;
procedure Initialize_127;
procedure Initialize_128;
procedure Initialize_129;
procedure Initialize_130;
procedure Initialize_131;
procedure Initialize_132;
procedure Initialize_133;
procedure Initialize_134;
procedure Initialize_135;
procedure Initialize_136;
procedure Initialize_137;
procedure Initialize_138;
procedure Initialize_139;
procedure Initialize_140;
procedure Initialize_141;
procedure Initialize_142;
procedure Initialize_143;
procedure Initialize_144;
procedure Initialize_145;
procedure Initialize_146;
procedure Initialize_147;
procedure Initialize_148;
procedure Initialize_149;
procedure Initialize_150;
procedure Initialize_151;
procedure Initialize_152;
procedure Initialize_153;
procedure Initialize_154;
procedure Initialize_155;
procedure Initialize_156;
procedure Initialize_157;
procedure Initialize_158;
procedure Initialize_159;
procedure Initialize_160;
procedure Initialize_161;
procedure Initialize_162;
procedure Initialize_163;
procedure Initialize_164;
procedure Initialize_165;
procedure Initialize_166;
procedure Initialize_167;
procedure Initialize_168;
procedure Initialize_169;
procedure Initialize_170;
procedure Initialize_171;
procedure Initialize_172;
end AMF.Internals.Tables.Utp_Metamodel.Properties;
|
package body Vecteurs is
function To_String (P : Point2D) return String is
begin
return "(X => " & Float'Image(P (1)) & "; Y => " & Float'Image(P (2)) & ")";
end;
function To_String_3D (P : Point3D) return String is
begin
return "(X => " & Float'Image(P (1)) & "; Y => " & Float'Image(P (2)) & "; Z => " & Float'Image(P (3)) & ")";
end;
function "+" (A : Vecteur ; B : Vecteur) return Vecteur is
R : Vecteur(A'Range);
begin
for I in R'Range loop
-- B n'a pas a priori le même indiçage que A
R(I) := A(I) + B(B'First - A'First + I);
end loop;
return R;
end;
function "-" (A : Vecteur ; B : Vecteur) return Vecteur is
R : Vecteur(A'Range);
begin
for I in R'Range loop
-- B n'a pas a priori le même indiçage que A
R(I) := A(I) - B(B'First - A'First + I);
end loop;
return R;
end;
function "*" (Facteur : Float ; V : Vecteur) return Vecteur is
R : Vecteur(V'Range);
begin
for I in R'Range loop
R(I) := Facteur * V(I);
end loop;
return R;
end;
-- expo scalaire vecteur
function "**" (V : Vecteur; Facteur : Positive) return Vecteur is
R : Vecteur(V'Range);
begin
for I in R'Range loop
R(I) := V(I) ** Facteur;
end loop;
return R;
end;
function "/" (V : Vecteur; Facteur : Float) return Vecteur is
R : Vecteur(V'Range);
begin
for I in R'Range loop
R(I) := V(I) / Facteur;
end loop;
return R;
end;
end Vecteurs;
|
with Ada.Strings; use Ada.Strings;
with Ada.Strings.Fixed; use Ada.Strings.Fixed;
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Characters.Latin_1; use Ada.Characters.Latin_1;
with Display_Warning; use Display_Warning;
with Texaco; -- For GetKey input function
with Extools; use Extools;
package body Process_Menu is
procedure Open_Menu (Function_Number : Column_Position; Menu_Array : Menu_Type; Win : Window := Standard_Window) is
menu_win : Window;
Ch :Character;
Current_Line : Integer := 1;
c : Key_Code;
Lines : Line_Position;
Columns : Column_Position;
procedure HiLite (Win : Window; Menu_Array : Menu_Type; Item_Num : Integer) is
begin
Set_Character_Attributes(Win, (Reverse_Video => True,others => False));
Add (Win => Win,
Line => Line_Position(Item_Num),
Column => 1,
Str => Menu_Array(Item_Num).Prompt.all);
Refrosh(Win);
end HiLite;
procedure LoLite (Win : Window; Menu_Array : Menu_Type; Item_Num : Integer) is
begin
Set_Character_Attributes(Win, Normal_Video);
Add (Win => Win,
Line => Line_Position(Item_Num),
Column => 1,
Str => Menu_Array(Item_Num).Prompt.all);
Refrosh(Win);
end LoLite;
begin
Get_Size(Number_Of_Lines => Lines,Number_Of_Columns => Columns,Win => Win);
menu_win := Sub_Window(Win => Win, -- Standard_Window,
Number_Of_Lines => 10,
Number_Of_Columns => 20,
First_Line_Position => Lines -12,
First_Column_Position => (Function_Number-1)*10);
Clear(menu_win);
Box(menu_win);
for i in Menu_Array'Range loop
Add (Win => menu_win,
Line => Line_Position(i),
Column => 1,
Str => Menu_Array(i).Prompt.all);
end loop;
Refrosh(Win => menu_win);
loop
HiLite(menu_win,Menu_Array,Current_Line);
c := Texaco.GetKey; --Get_Keystroke;
if c in Special_Key_Code'Range then
case c is
when Key_Cursor_Down =>
if (Current_Line < Menu_Array'Last) then
LoLite(menu_win,Menu_Array,Current_Line);
Current_Line := Current_Line +1;
end if;
when Key_Cursor_Up =>
if (Current_Line > Menu_Array'First) then
LoLite(menu_win,Menu_Array,Current_Line);
Current_Line := Current_Line -1;
end if;
when others => exit;
end case;
elsif c in Real_Key_Code'Range then
Ch := Character'Val (c);
case Ch is
when LF | CR =>
begin
Clear(Win => menu_win);
Refrosh(menu_win);
Menu_Array(Current_Line).Func.all;
exit;
end;
when ESC =>
begin
exit;
end;
when others => null;
end case;
end if;
end loop;
Clear(Win => menu_win);
Refrosh(menu_win);
Delete (Win => menu_win);
end Open_Menu;
end Process_Menu;
|
-----------------------------------------------------------------------
-- sqlbench -- SQL Benchmark
-- 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 ADO.Sessions;
with ADO.Sessions.Factory;
private with Util.Measures;
private with Util.Properties;
private with Ada.Containers.Indefinite_Vectors;
package Sqlbench is
Benchmark_Error : exception;
type Context_Type is tagged limited private;
type Repeat_Type is new Positive range 1 .. 1_000_000;
subtype Repeat_Factor_Type is Repeat_Type range 1 .. 100;
type Benchmark_Handler is access not null procedure (Context : in out Context_Type);
-- Register a benchmark handler under the given name.
procedure Register (Context : in out Context_Type;
Handler : in Benchmark_Handler;
Title : in String;
Factor : in Repeat_Factor_Type := 100)
with Pre => Title'Length > 0;
-- Get the database session to make SQL requests on the database.
function Get_Session (Context : in Context_Type) return ADO.Sessions.Master_Session;
-- Get a benchmark configuration parameter.
function Get_Parameter (Context : in Context_Type;
Name : in String) return String
with Pre => Name'Length > 0;
-- Get a SQL configuration file path that depends on the database driver.
-- The file is of the form: <config-directory>/<database-driver>-<name>
function Get_Config_Path (Context : in Context_Type;
Name : in String) return String
with Pre => Name'Length > 0;
-- Get the database driver name.
function Get_Driver_Name (Context : in Context_Type) return String
with Post => Get_Driver_Name'Result'Length > 0;
private
type Benchmark_Test (Len : Natural) is record
Handler : Benchmark_Handler;
Title : String (1 .. Len);
Factor : Repeat_Factor_Type := 1;
end record;
package Benchmark_Test_Vectors is
new Ada.Containers.Indefinite_Vectors (Index_Type => Positive,
Element_Type => Benchmark_Test,
"=" => "=");
subtype Benchmark_Vector is Benchmark_Test_Vectors.Vector;
subtype Benchmark_Cursor is Benchmark_Test_Vectors.Cursor;
type Context_Type is tagged limited record
Perf : Util.Measures.Measure_Set;
Repeat : Repeat_Type := 1;
Session : ADO.Sessions.Master_Session;
Factory : ADO.Sessions.Factory.Session_Factory;
Tests : Benchmark_Vector;
Config : Util.Properties.Manager;
end record;
end Sqlbench;
|
pragma Ada_2012;
package body DDS.Request_Reply.Requester.Impl is
-----------------------------
-- Get_Request_Data_Writer --
-----------------------------
function Get_Request_Data_Writer
(Self : not null access Ref) return DDS.DataWriter.Ref_Access
is
begin
pragma Compile_Time_Warning (Standard.True,
"Get_Request_Data_Writer unimplemented");
return raise Program_Error
with "Unimplemented function Get_Request_Data_Writer";
end Get_Request_Data_Writer;
---------------------------
-- Get_Reply_Data_Reader --
---------------------------
function Get_Reply_Data_Reader
(Self : not null access Ref) return DDS.DataReader.Ref_Access
is
begin
pragma Compile_Time_Warning (Standard.True,
"Get_Reply_Data_Reader unimplemented");
return raise Program_Error
with "Unimplemented function Get_Reply_Data_Reader";
end Get_Reply_Data_Reader;
-------------------
-- Touch_Samples --
-------------------
function Touch_Samples
(Self : not null access Ref; Max_Count : DDS.Integer;
Read_Condition : DDS.ReadCondition.Ref_Access) return Integer
is
begin
pragma Compile_Time_Warning (Standard.True,
"Touch_Samples unimplemented");
return raise Program_Error with "Unimplemented function Touch_Samples";
end Touch_Samples;
-------------------------
-- Wait_For_Any_Sample --
-------------------------
function Wait_For_Any_Sample
(Self : not null access Ref; Max_Wait : DDS.Duration_T;
Min_Sample_Count : DDS.Integer) return DDS.ReturnCode_T
is
begin
pragma Compile_Time_Warning (Standard.True,
"Wait_For_Any_Sample unimplemented");
return raise Program_Error
with "Unimplemented function Wait_For_Any_Sample";
end Wait_For_Any_Sample;
end DDS.Requester.Impl;
|
-- { dg-do compile }
package body Discr14 is
procedure ASSIGN( TARGET : in out SW_TYPE_INFO ;
SOURCE : in SW_TYPE_INFO ) is
begin
TARGET := new T_SW_TYPE_DESCRIPTOR( SOURCE.SW_TYPE, SOURCE.DIMENSION );
end ASSIGN;
end Discr14;
|
with card_dir;
use card_dir;
package Coords is
--variable(s)
type Coord is Private;
--1,
function Get_X(C: Coord) return Integer;
function Get_Y(C: Coord) return Integer;
--2,
procedure Set_X(C: in out Coord;I:Integer);
procedure Set_Y(C: in out Coord;I:Integer);
--3,
function Get_Distance(C:Coord;C2:Coord) return Integer;
--4,
procedure Change_To_Direction(C: in out Coord;D:Cardinal_Direction);
--5, Map indexed with integers and contains Items
generic
type Item is private;
type Map is array(Integer range <>, Integer range<>) of Item;
function Coord_With_Array(C:Coord;M:Map) return Item;
Private
type Coord Is Record
x:Integer;
y:Integer;
end Record;
end Coords;
|
procedure Print_Logic(A : Boolean; B : Boolean) is
begin
Put_Line("A and B is " & Boolean'Image(A and B));
Put_Line("A or B is " & Boolean'Image(A or B));
Put_Line("A xor B is " & Boolean'Image(A xor B));
Put_Line("not A is " & Boolean'Image(not A));
end Print_Logic;
|
package Giza.Bitmap_Fonts.FreeSans8pt7b is
Font : constant Giza.Font.Ref_Const;
private
FreeSans8pt7bBitmaps : aliased constant Font_Bitmap := (
16#FF#, 16#D0#, 16#B6#, 16#D0#, 16#13#, 16#09#, 16#04#, 16#8F#, 16#F3#,
16#21#, 16#10#, 16#99#, 16#FE#, 16#24#, 16#12#, 16#19#, 16#00#, 16#10#,
16#FB#, 16#5C#, 16#99#, 16#1A#, 16#0E#, 16#0B#, 16#13#, 16#27#, 16#5B#,
16#E1#, 16#00#, 16#78#, 16#43#, 16#31#, 16#08#, 16#48#, 16#21#, 16#60#,
16#CD#, 16#01#, 16#EC#, 16#00#, 16#27#, 16#81#, 16#B3#, 16#04#, 16#84#,
16#23#, 16#30#, 16#87#, 16#80#, 16#38#, 16#22#, 16#11#, 16#0D#, 16#83#,
16#83#, 16#83#, 16#65#, 16#1E#, 16#86#, 16#67#, 16#9E#, 16#60#, 16#F0#,
16#29#, 16#29#, 16#24#, 16#92#, 16#24#, 16#88#, 16#89#, 16#22#, 16#49#,
16#24#, 16#A4#, 16#A0#, 16#25#, 16#5C#, 16#A5#, 16#00#, 16#10#, 16#20#,
16#47#, 16#F1#, 16#02#, 16#04#, 16#00#, 16#E0#, 16#F0#, 16#80#, 16#11#,
16#22#, 16#22#, 16#44#, 16#44#, 16#88#, 16#38#, 16#8A#, 16#0C#, 16#18#,
16#30#, 16#60#, 16#C1#, 16#82#, 16#88#, 16#E0#, 16#2F#, 16#92#, 16#49#,
16#24#, 16#80#, 16#7D#, 16#8E#, 16#08#, 16#10#, 16#21#, 16#8E#, 16#30#,
16#41#, 16#03#, 16#F8#, 16#7D#, 16#8E#, 16#08#, 16#10#, 16#63#, 16#81#,
16#81#, 16#83#, 16#8D#, 16#F0#, 16#04#, 16#0C#, 16#1C#, 16#14#, 16#24#,
16#64#, 16#C4#, 16#FF#, 16#04#, 16#04#, 16#04#, 16#7E#, 16#81#, 16#04#,
16#0F#, 16#D8#, 16#C0#, 16#81#, 16#83#, 16#89#, 16#E0#, 16#38#, 16#8A#,
16#0C#, 16#0B#, 16#D8#, 16#E0#, 16#C1#, 16#82#, 16#88#, 16#E0#, 16#FE#,
16#08#, 16#10#, 16#41#, 16#02#, 16#08#, 16#10#, 16#20#, 16#81#, 16#00#,
16#7D#, 16#8E#, 16#0C#, 16#1C#, 16#6F#, 16#B1#, 16#C1#, 16#83#, 16#8D#,
16#F0#, 16#38#, 16#8A#, 16#0C#, 16#18#, 16#38#, 16#DE#, 16#81#, 16#03#,
16#89#, 16#E0#, 16#80#, 16#80#, 16#81#, 16#C0#, 16#01#, 16#07#, 16#38#,
16#E0#, 16#C0#, 16#38#, 16#0E#, 16#03#, 16#FF#, 16#00#, 16#00#, 16#FF#,
16#00#, 16#E0#, 16#38#, 16#06#, 16#07#, 16#1C#, 16#E0#, 16#80#, 16#7D#,
16#8E#, 16#08#, 16#10#, 16#61#, 16#86#, 16#08#, 16#10#, 16#00#, 16#00#,
16#80#, 16#07#, 16#C0#, 16#61#, 16#C2#, 16#01#, 16#90#, 16#02#, 16#47#,
16#66#, 16#23#, 16#99#, 16#0C#, 16#64#, 16#31#, 16#90#, 16#8E#, 16#66#,
16#64#, 16#EF#, 16#18#, 16#00#, 16#30#, 16#00#, 16#3F#, 16#00#, 16#0C#,
16#03#, 16#80#, 16#A0#, 16#6C#, 16#13#, 16#0C#, 16#43#, 16#18#, 16#FE#,
16#60#, 16#98#, 16#34#, 16#0F#, 16#01#, 16#FE#, 16#41#, 16#A0#, 16#50#,
16#28#, 16#14#, 16#1B#, 16#F9#, 16#03#, 16#80#, 16#C0#, 16#60#, 16#7F#,
16#E0#, 16#1E#, 16#30#, 16#90#, 16#30#, 16#08#, 16#04#, 16#02#, 16#01#,
16#00#, 16#80#, 16#A0#, 16#58#, 16#43#, 16#C0#, 16#FE#, 16#41#, 16#A0#,
16#50#, 16#18#, 16#0C#, 16#06#, 16#03#, 16#01#, 16#80#, 16#C0#, 16#A0#,
16#DF#, 16#C0#, 16#FF#, 16#80#, 16#80#, 16#80#, 16#80#, 16#80#, 16#FE#,
16#80#, 16#80#, 16#80#, 16#80#, 16#FF#, 16#FF#, 16#02#, 16#04#, 16#08#,
16#10#, 16#3F#, 16#C0#, 16#81#, 16#02#, 16#04#, 16#00#, 16#1F#, 16#08#,
16#24#, 16#07#, 16#00#, 16#80#, 16#20#, 16#08#, 16#3E#, 16#01#, 16#80#,
16#50#, 16#32#, 16#1C#, 16#79#, 16#80#, 16#C0#, 16#60#, 16#30#, 16#18#,
16#0C#, 16#07#, 16#FF#, 16#01#, 16#80#, 16#C0#, 16#60#, 16#30#, 16#10#,
16#FF#, 16#F0#, 16#04#, 16#10#, 16#41#, 16#04#, 16#10#, 16#41#, 16#86#,
16#1C#, 16#DE#, 16#83#, 16#43#, 16#23#, 16#13#, 16#09#, 16#05#, 16#83#,
16#61#, 16#18#, 16#84#, 16#43#, 16#20#, 16#D0#, 16#20#, 16#81#, 16#02#,
16#04#, 16#08#, 16#10#, 16#20#, 16#40#, 16#81#, 16#02#, 16#07#, 16#F0#,
16#C0#, 16#78#, 16#0F#, 16#83#, 16#D0#, 16#5A#, 16#0B#, 16#63#, 16#64#,
16#4C#, 16#89#, 16#9B#, 16#31#, 16#46#, 16#38#, 16#C7#, 16#10#, 16#C0#,
16#E0#, 16#78#, 16#36#, 16#19#, 16#0C#, 16#C6#, 16#33#, 16#09#, 16#86#,
16#C1#, 16#E0#, 16#70#, 16#30#, 16#1E#, 16#18#, 16#44#, 16#0A#, 16#01#,
16#80#, 16#60#, 16#18#, 16#06#, 16#01#, 16#80#, 16#50#, 16#26#, 16#10#,
16#78#, 16#FE#, 16#83#, 16#81#, 16#81#, 16#81#, 16#83#, 16#FE#, 16#80#,
16#80#, 16#80#, 16#80#, 16#80#, 16#1E#, 16#18#, 16#44#, 16#0A#, 16#01#,
16#80#, 16#60#, 16#18#, 16#06#, 16#01#, 16#80#, 16#50#, 16#A6#, 16#18#,
16#7E#, 16#00#, 16#40#, 16#FF#, 16#20#, 16#68#, 16#0A#, 16#02#, 16#81#,
16#BF#, 16#C8#, 16#1A#, 16#02#, 16#80#, 16#A0#, 16#28#, 16#0A#, 16#03#,
16#3C#, 16#C3#, 16#81#, 16#80#, 16#C0#, 16#78#, 16#1E#, 16#03#, 16#81#,
16#81#, 16#42#, 16#3C#, 16#FF#, 16#84#, 16#02#, 16#01#, 16#00#, 16#80#,
16#40#, 16#20#, 16#10#, 16#08#, 16#04#, 16#02#, 16#01#, 16#00#, 16#80#,
16#C0#, 16#60#, 16#30#, 16#18#, 16#0C#, 16#06#, 16#03#, 16#01#, 16#80#,
16#C0#, 16#50#, 16#47#, 16#C0#, 16#C0#, 16#D0#, 16#36#, 16#09#, 16#86#,
16#21#, 16#8C#, 16#41#, 16#30#, 16#4C#, 16#1A#, 16#03#, 16#80#, 16#E0#,
16#30#, 16#C1#, 16#06#, 16#87#, 16#09#, 16#0E#, 16#13#, 16#14#, 16#66#,
16#68#, 16#C4#, 16#99#, 16#09#, 16#12#, 16#12#, 16#2C#, 16#38#, 16#78#,
16#30#, 16#E0#, 16#60#, 16#C0#, 16#C1#, 16#80#, 16#60#, 16#D8#, 16#63#,
16#10#, 16#6C#, 16#1E#, 16#03#, 16#00#, 16#E0#, 16#68#, 16#13#, 16#0C#,
16#66#, 16#19#, 16#03#, 16#C1#, 16#E0#, 16#98#, 16#C4#, 16#43#, 16#60#,
16#A0#, 16#20#, 16#10#, 16#08#, 16#04#, 16#02#, 16#01#, 16#00#, 16#7F#,
16#80#, 16#C0#, 16#C0#, 16#60#, 16#60#, 16#60#, 16#30#, 16#30#, 16#30#,
16#10#, 16#18#, 16#1F#, 16#F0#, 16#F2#, 16#49#, 16#24#, 16#92#, 16#49#,
16#38#, 16#88#, 16#44#, 16#44#, 16#22#, 16#22#, 16#11#, 16#E4#, 16#92#,
16#49#, 16#24#, 16#92#, 16#78#, 16#30#, 16#C5#, 16#12#, 16#8A#, 16#30#,
16#FF#, 16#80#, 16#44#, 16#7C#, 16#82#, 16#02#, 16#02#, 16#3E#, 16#E2#,
16#82#, 16#86#, 16#7B#, 16#81#, 16#02#, 16#05#, 16#CC#, 16#50#, 16#60#,
16#C1#, 16#83#, 16#07#, 16#15#, 16#C0#, 16#3C#, 16#8E#, 16#0C#, 16#08#,
16#10#, 16#20#, 16#A3#, 16#3C#, 16#01#, 16#01#, 16#01#, 16#3D#, 16#43#,
16#81#, 16#81#, 16#81#, 16#81#, 16#81#, 16#43#, 16#3D#, 16#3C#, 16#42#,
16#81#, 16#81#, 16#FF#, 16#80#, 16#80#, 16#43#, 16#3E#, 16#69#, 16#74#,
16#92#, 16#49#, 16#20#, 16#3A#, 16#8E#, 16#0C#, 16#18#, 16#30#, 16#60#,
16#A3#, 16#3A#, 16#06#, 16#13#, 16#E0#, 16#82#, 16#08#, 16#2E#, 16#C6#,
16#18#, 16#61#, 16#86#, 16#18#, 16#61#, 16#9F#, 16#F0#, 16#41#, 16#55#,
16#55#, 16#5C#, 16#81#, 16#02#, 16#04#, 16#69#, 16#96#, 16#3C#, 16#68#,
16#99#, 16#12#, 16#34#, 16#20#, 16#FF#, 16#F0#, 16#B9#, 16#D8#, 16#C6#,
16#10#, 16#C2#, 16#18#, 16#43#, 16#08#, 16#61#, 16#0C#, 16#21#, 16#84#,
16#20#, 16#BB#, 16#18#, 16#61#, 16#86#, 16#18#, 16#61#, 16#84#, 16#3C#,
16#42#, 16#81#, 16#81#, 16#81#, 16#81#, 16#81#, 16#42#, 16#3C#, 16#B9#,
16#8A#, 16#0C#, 16#18#, 16#30#, 16#60#, 16#E2#, 16#B9#, 16#02#, 16#04#,
16#00#, 16#3D#, 16#43#, 16#81#, 16#81#, 16#81#, 16#81#, 16#81#, 16#43#,
16#3D#, 16#01#, 16#01#, 16#01#, 16#BC#, 16#88#, 16#88#, 16#88#, 16#80#,
16#7B#, 16#18#, 16#20#, 16#60#, 16#70#, 16#61#, 16#78#, 16#4B#, 16#A4#,
16#92#, 16#49#, 16#80#, 16#86#, 16#18#, 16#61#, 16#86#, 16#18#, 16#63#,
16#74#, 16#C3#, 16#42#, 16#46#, 16#66#, 16#24#, 16#2C#, 16#38#, 16#18#,
16#18#, 16#C6#, 16#38#, 16#C5#, 16#39#, 16#A5#, 16#26#, 16#B4#, 16#D2#,
16#8E#, 16#71#, 16#8C#, 16#31#, 16#80#, 16#42#, 16#C8#, 16#B0#, 16#C1#,
16#87#, 16#0B#, 16#33#, 16#C2#, 16#C2#, 16#42#, 16#46#, 16#64#, 16#24#,
16#2C#, 16#38#, 16#18#, 16#18#, 16#10#, 16#10#, 16#60#, 16#7E#, 16#0C#,
16#30#, 16#41#, 16#86#, 16#08#, 16#20#, 16#FE#, 16#69#, 16#24#, 16#94#,
16#49#, 16#24#, 16#98#, 16#FF#, 16#FE#, 16#C9#, 16#24#, 16#91#, 16#49#,
16#24#, 16#B0#, 16#61#, 16#24#, 16#38#);
FreeSans8pt7bGlyphs : aliased constant Glyph_Array := (
(0, 0, 0, 4, 0, 1), -- 0x20 ' '
(0, 1, 12, 5, 2, -11), -- 0x21 '!'
(2, 3, 4, 5, 1, -10), -- 0x22 '"'
(4, 9, 11, 9, 0, -10), -- 0x23 '#'
(17, 7, 13, 9, 1, -11), -- 0x24 '$'
(29, 14, 11, 14, 0, -10), -- 0x25 '%'
(49, 9, 11, 11, 1, -10), -- 0x26 '&'
(62, 1, 4, 3, 1, -10), -- 0x27 '''
(63, 3, 15, 5, 1, -11), -- 0x28 '('
(69, 3, 15, 5, 1, -11), -- 0x29 ')'
(75, 5, 5, 6, 1, -11), -- 0x2A '*'
(79, 7, 7, 9, 1, -6), -- 0x2B '+'
(86, 1, 3, 4, 1, 0), -- 0x2C ','
(87, 4, 1, 5, 1, -4), -- 0x2D '-'
(88, 1, 1, 4, 1, 0), -- 0x2E '.'
(89, 4, 12, 4, 0, -11), -- 0x2F '/'
(95, 7, 11, 9, 1, -10), -- 0x30 '0'
(105, 3, 11, 9, 2, -10), -- 0x31 '1'
(110, 7, 11, 9, 1, -10), -- 0x32 '2'
(120, 7, 11, 9, 1, -10), -- 0x33 '3'
(130, 8, 11, 9, 0, -10), -- 0x34 '4'
(141, 7, 11, 9, 1, -10), -- 0x35 '5'
(151, 7, 11, 9, 1, -10), -- 0x36 '6'
(161, 7, 11, 9, 1, -10), -- 0x37 '7'
(171, 7, 11, 9, 1, -10), -- 0x38 '8'
(181, 7, 11, 9, 1, -10), -- 0x39 '9'
(191, 1, 9, 4, 1, -8), -- 0x3A ':'
(193, 1, 10, 4, 1, -7), -- 0x3B ';'
(195, 8, 8, 9, 1, -7), -- 0x3C '<'
(203, 8, 4, 9, 1, -5), -- 0x3D '='
(207, 8, 8, 9, 1, -7), -- 0x3E '>'
(215, 7, 12, 9, 1, -11), -- 0x3F '?'
(226, 14, 14, 16, 1, -11), -- 0x40 '@'
(251, 10, 12, 11, 0, -11), -- 0x41 'A'
(266, 9, 12, 11, 1, -11), -- 0x42 'B'
(280, 9, 12, 11, 1, -11), -- 0x43 'C'
(294, 9, 12, 11, 1, -11), -- 0x44 'D'
(308, 8, 12, 10, 1, -11), -- 0x45 'E'
(320, 7, 12, 10, 1, -11), -- 0x46 'F'
(331, 10, 12, 12, 1, -11), -- 0x47 'G'
(346, 9, 12, 12, 1, -11), -- 0x48 'H'
(360, 1, 12, 4, 2, -11), -- 0x49 'I'
(362, 6, 12, 8, 1, -11), -- 0x4A 'J'
(371, 9, 12, 11, 1, -11), -- 0x4B 'K'
(385, 7, 12, 9, 1, -11), -- 0x4C 'L'
(396, 11, 12, 14, 1, -11), -- 0x4D 'M'
(413, 9, 12, 12, 1, -11), -- 0x4E 'N'
(427, 10, 12, 13, 1, -11), -- 0x4F 'O'
(442, 8, 12, 11, 1, -11), -- 0x50 'P'
(454, 10, 13, 13, 1, -11), -- 0x51 'Q'
(471, 10, 12, 11, 1, -11), -- 0x52 'R'
(486, 8, 12, 11, 1, -11), -- 0x53 'S'
(498, 9, 12, 10, 0, -11), -- 0x54 'T'
(512, 9, 12, 12, 1, -11), -- 0x55 'U'
(526, 10, 12, 10, 0, -11), -- 0x56 'V'
(541, 15, 12, 15, 0, -11), -- 0x57 'W'
(564, 10, 12, 11, 0, -11), -- 0x58 'X'
(579, 9, 12, 11, 1, -11), -- 0x59 'Y'
(593, 9, 12, 10, 0, -11), -- 0x5A 'Z'
(607, 3, 15, 4, 1, -11), -- 0x5B '['
(613, 4, 12, 4, 0, -11), -- 0x5C '\'
(619, 3, 15, 4, 0, -11), -- 0x5D ']'
(625, 6, 6, 7, 1, -10), -- 0x5E '^'
(630, 9, 1, 9, 0, 3), -- 0x5F '_'
(632, 3, 2, 4, 0, -11), -- 0x60 '`'
(633, 8, 9, 9, 0, -8), -- 0x61 'a'
(642, 7, 12, 9, 1, -11), -- 0x62 'b'
(653, 7, 9, 8, 0, -8), -- 0x63 'c'
(661, 8, 12, 9, 0, -11), -- 0x64 'd'
(673, 8, 9, 9, 0, -8), -- 0x65 'e'
(682, 3, 12, 4, 0, -11), -- 0x66 'f'
(687, 7, 12, 9, 0, -8), -- 0x67 'g'
(698, 6, 12, 9, 1, -11), -- 0x68 'h'
(707, 1, 12, 4, 1, -11), -- 0x69 'i'
(709, 2, 15, 4, 0, -11), -- 0x6A 'j'
(713, 7, 12, 8, 1, -11), -- 0x6B 'k'
(724, 1, 12, 3, 1, -11), -- 0x6C 'l'
(726, 11, 9, 13, 1, -8), -- 0x6D 'm'
(739, 6, 9, 9, 1, -8), -- 0x6E 'n'
(746, 8, 9, 9, 0, -8), -- 0x6F 'o'
(755, 7, 12, 9, 1, -8), -- 0x70 'p'
(766, 8, 12, 9, 0, -8), -- 0x71 'q'
(778, 4, 9, 5, 1, -8), -- 0x72 'r'
(783, 6, 9, 8, 1, -8), -- 0x73 's'
(790, 3, 11, 4, 0, -10), -- 0x74 't'
(795, 6, 9, 9, 1, -8), -- 0x75 'u'
(802, 8, 9, 8, 0, -8), -- 0x76 'v'
(811, 11, 9, 12, 0, -8), -- 0x77 'w'
(824, 7, 9, 8, 0, -8), -- 0x78 'x'
(832, 8, 12, 8, 0, -8), -- 0x79 'y'
(844, 7, 9, 8, 0, -8), -- 0x7A 'z'
(852, 3, 15, 5, 1, -11), -- 0x7B '{'
(858, 1, 15, 4, 2, -11), -- 0x7C '|'
(860, 3, 15, 5, 1, -11), -- 0x7D '}'
(866, 7, 3, 8, 1, -6)); -- 0x7E '~'
Font_D : aliased constant Bitmap_Font :=
(FreeSans8pt7bBitmaps'Access,
FreeSans8pt7bGlyphs'Access,
19);
Font : constant Giza.Font.Ref_Const := Font_D'Access;
end Giza.Bitmap_Fonts.FreeSans8pt7b;
|
-- --
-- package GNAT.Sockets.Server Copyright (c) Dmitry A. Kazakov --
-- Implementation Luebeck --
-- Winter, 2012 --
-- --
-- Last revision : 14:53 29 Feb 2020 --
-- --
-- This library is free software; you can redistribute it and/or --
-- modify it under the terms of the GNU General Public License as --
-- published by the Free Software Foundation; either version 2 of --
-- the License, or (at your option) any later version. This library --
-- is distributed in the hope that it will be useful, but WITHOUT --
-- ANY WARRANTY; without even the implied warranty of --
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU --
-- General Public License for more details. You should have --
-- received a copy of the GNU General Public License along with --
-- this library; if not, write to the Free Software Foundation, --
-- Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from --
-- this unit, or you link this unit with other files to produce an --
-- executable, this unit does not by itself cause the resulting --
-- executable to be covered by the GNU General Public License. This --
-- exception does not however invalidate any other reasons why the --
-- executable file might be covered by the GNU Public License. --
--____________________________________________________________________--
with Ada.Calendar; use Ada.Calendar;
with Ada.Characters.Handling; use Ada.Characters.Handling;
with Ada.IO_Exceptions; use Ada.IO_Exceptions;
with Strings_Edit; use Strings_Edit;
with Strings_Edit.Integers; use Strings_Edit.Integers;
with Ada.Unchecked_Conversion;
with Ada.Unchecked_Deallocation;
package body GNAT.Sockets.Server is
Receive_Masks : constant array (IO_Tracing_Mode) of Factory_Flags :=
( Trace_None => 0,
Trace_Encoded => Trace_Encoded_Received,
Trace_Decoded => Trace_Decoded_Received,
Trace_Any => Trace_Encoded_Received
or Trace_Decoded_Received
);
Sent_Masks : constant array (IO_Tracing_Mode) of Factory_Flags :=
( Trace_None => 0,
Trace_Encoded => Trace_Encoded_Sent,
Trace_Decoded => Trace_Decoded_Sent,
Trace_Any => Trace_Encoded_Sent
or Trace_Decoded_Sent
);
procedure Free is
new Ada.Unchecked_Deallocation (Encoder'Class, Encoder_Ptr);
procedure Activated (Client : in out Connection) is
begin
null;
end Activated;
procedure Append
( List : in out Connection_Ptr;
Item : Connection_Ptr;
Count : in out Integer
) is
begin
if Item.Successor = null then
if List = null then
List := Item;
Item.Successor := Item;
Item.Predecessor := Item;
else
Item.Successor := List;
Item.Predecessor := List.Predecessor;
List.Predecessor := Item;
Item.Predecessor.Successor := Item;
end if;
Count := Count + 1;
end if;
end Append;
function Available_To_Process (Client : Connection)
return Stream_Element_Count is
begin
return Used (Client.Read);
end Available_To_Process;
function Available_To_Send (Client : Connection)
return Stream_Element_Count is
begin
return Free (Client.Written);
end Available_To_Send;
procedure Clear (Client : in out Connection'Class) is
begin
Client.Failed := False; -- Clean I/O state
Client.External_Action := False;
Client.Data_Sent := False;
Client.Dont_Block := False;
Client.Read.Expected := 0;
Client.Read.First_Read := 0;
Client.Read.Free_To_Read := 0;
Client.Written.First_Written := 0;
Client.Written.Free_To_Write := 0;
Client.Written.Send_Blocked := False;
Free (Client.Transport);
end Clear;
procedure Close (Socket : in out Socket_Type) is
begin
if Socket /= No_Socket then
begin
Shutdown_Socket (Socket);
exception
when others =>
null;
end;
begin
Close_Socket (Socket);
exception
when others =>
null;
end;
Socket := No_Socket;
end if;
end Close;
procedure Connect
( Listener : in out Connections_Server;
Client : Connection_Ptr;
Host : String;
Port : Port_Type;
Max_Connect_No : Positive := Positive'Last;
Overlapped : Stream_Element_Count :=
Stream_Element_Count'Last
) is
Address : Sock_Addr_Type renames Client.Client_Address;
Option : Request_Type := (Non_Blocking_IO, True);
begin
if Client.Socket /= No_Socket then
Raise_Exception
( Use_Error'Identity,
"Connection " & Image (Address) & " is already in use"
);
end if;
Address.Addr := To_Addr (Host);
Address.Port := Port;
Create_Socket (Client.Socket);
Set_Socket_Option
( Client.Socket,
Socket_Level,
(Reuse_Address, True)
);
Control_Socket (Client.Socket, Option);
Connect_Parameters_Set
( Client.all,
Host,
Address,
Max_Connect_No
);
Client.Session := Session_Disconnected;
Client.Client := True;
Client.Connect_No := 0;
Client.Max_Connect_No := Max_Connect_No;
Client.Socket_Listener := Listener'Unchecked_Access;
Client.Overlapped_Read := Stream_Element_Count'Min
( Overlapped,
Client.Output_Size
);
Increment_Count (Client.all);
Listener.Request.Connect (Client);
end Connect;
procedure Connect_Error
( Client : in out Connection;
Error : Error_Type
) is
begin
null;
end Connect_Error;
procedure Connect_Parameters_Set
( Client : in out Connection;
Host : String;
Address : Sock_Addr_Type;
Max_Connect_No : Positive
) is
begin
null;
end Connect_Parameters_Set;
procedure Connected (Client : in out Connection) is
begin
null;
end Connected;
procedure Connected
( Listener : in out Connections_Server;
Client : in out Connection'Class
) is
begin
Client.Session := Session_Active;
end Connected;
function Create
( Factory : access Connections_Factory;
Listener : access Connections_Server'Class;
From : Sock_Addr_Type
) return Connection_Ptr is
begin
return null;
end Create;
procedure Create_Socket
( Listener : in out Connections_Server;
Socket : in out Socket_Type;
Address : Sock_Addr_Type
) is
begin
Create_Socket (Socket);
Set_Socket_Option (Socket, Socket_Level, (Reuse_Address, True));
Bind_Socket (Socket, Address);
Listen_Socket (Socket);
end Create_Socket;
function Create_Transport
( Factory : access Connections_Factory;
Listener : access Connections_Server'Class;
Client : access Connection'Class
) return Encoder_Ptr is
begin
return null;
end Create_Transport;
procedure Create_Transport (Client : in out Connection) is
begin
if Client.Transport /= null then
Raise_Exception
( Status_Error'Identity,
"Connection already has a transport layer"
);
end if;
Client.Transport :=
Create_Transport
( Client.Socket_Listener.Factory,
Client.Socket_Listener,
Client'Unchecked_Access
);
if Client.Transport = null then
Raise_Exception
( Status_Error'Identity,
"Connection transport layer is not supported"
);
end if;
Client.Session := Session_Handshaking;
if Client.Client then
Append
( Client.Socket_Listener.Postponed,
Client'Unchecked_Access,
Client.Socket_Listener.Postponed_Count
);
end if;
end Create_Transport;
procedure Data_Sent
( Listener : in out Connections_Server;
Client : Connection_Ptr
) is
begin
Client.Data_Sent := False;
Sent (Client.all);
end Data_Sent;
procedure Disconnected (Client : in out Connection) is
begin
null;
end Disconnected;
procedure Disconnected
( Listener : in out Connections_Server;
Client : in out Connection'Class
) is
begin
Client.Session := Session_Disconnected;
Remove (Listener.Postponed, Client, Listener.Postponed_Count);
end Disconnected;
procedure Downed
( Listener : in out Connections_Server;
Client : in out Connection'Class
) is
begin
Client.Session := Session_Down;
end Downed;
procedure Downed (Client : in out Connection) is
begin
null;
end Downed;
procedure Do_Connect
( Listener : in out Connections_Server'Class;
Client : in out Connection_Ptr
) is
Status : Selector_Status;
begin
Client.Connect_No := Client.Connect_No + 1;
Client.Session := Session_Connecting;
if Client.Connect_No > Client.Max_Connect_No then
Client.Try_To_Reconnect := False; -- Ensure connection killed
Save_Occurrence (Client.Last_Error, Null_Occurrence);
Stop (Listener, Client);
else
Clear (Client.all);
Connect_Socket
( Socket => Client.Socket,
Server => Client.Client_Address,
Timeout => 0.0,
Selector => Listener.Selector'Unchecked_Access,
Status => Status
);
if Status = Completed then
Set (Listener.Read_Sockets, Client.Socket);
On_Connected (Listener, Client.all);
end if;
end if;
exception
when Connection_Error =>
Client.Try_To_Reconnect := False; -- Ensure connection killed
Save_Occurrence (Client.Last_Error, Null_Occurrence);
Stop (Listener, Client);
when Error : Socket_Error =>
if Resolve_Exception (Error) = Operation_Now_In_Progress then
Trace_Sending
( Listener.Factory.all,
Client.all,
False,
", connecting to ..."
);
else
Trace_Error
( Listener.Factory.all,
"Connect socket",
Error
);
Client.Try_To_Reconnect := False; -- Ensure object killed
Save_Occurrence (Client.Last_Error, Error);
Stop (Listener, Client);
end if;
when Error : others =>
Trace_Error
( Listener.Factory.all,
"Connect socket",
Error
);
Client.Try_To_Reconnect := False; -- Ensure connection killed
Save_Occurrence (Client.Last_Error, Error);
Stop (Listener, Client);
end Do_Connect;
procedure Elevated (Client : in out Connection) is
begin
null;
end Elevated;
procedure Fill_From_Stream
( Buffer : in out Output_Buffer;
Stream : in out Root_Stream_Type'Class;
Count : Stream_Element_Count;
Reserve : Stream_Element_Count;
Last : out Stream_Element_Offset;
Next : out Stream_Element_Offset;
Done : out Boolean
) is
begin
if Reserve >= Buffer.Written'Length then
Raise_Exception
( Data_Error'Identity,
( "Output buffer is too small for prefix and suffix ("
& Image (Reserve)
& ")"
) );
end if;
if Buffer.First_Written <= Buffer.Free_To_Write then
--
-- [ XXXXXXXXXXXXXXX ]
-- | |
-- First_Written Free_To_Write
--
declare
Tail : constant Stream_Element_Offset :=
Reserve + Buffer.Written'First - Buffer.First_Written;
begin
if Tail > 0 then
if Buffer.Free_To_Write + Tail = Buffer.Written'Last then
Done := False;
else
Next := Buffer.Written'Last - Tail;
if Count < Next - Buffer.Free_To_Write then
Next := Buffer.Free_To_Write + Count - 1;
end if;
Read
( Stream,
Buffer.Written (Buffer.Free_To_Write..Next),
Last
);
Done := Last < Next;
Next := Last + 1;
end if;
else
Next := Buffer.Written'Last;
if Count < Next - Buffer.Free_To_Write then
Next := Buffer.Free_To_Write + Count - 1;
end if;
Read
( Stream,
Buffer.Written (Buffer.Free_To_Write..Next),
Last
);
Done := Last < Next;
if Last < Buffer.Written'Last then
Next := Last + 1;
else
Next := Buffer.Written'First;
end if;
end if;
end;
else
--
-- [XXXXX XXXXXXX]
-- | |
-- Free_To_Write First_Written
--
if Buffer.Free_To_Write + Reserve >= Buffer.First_Written then
Done := False;
else
Next := Buffer.First_Written - Reserve;
if Count < Next - Buffer.Free_To_Write then
Next := Buffer.Free_To_Write + Count - 1;
end if;
Read
( Stream,
Buffer.Written (Buffer.Free_To_Write..Next),
Last
);
Done := Last < Next;
Next := Last + 1;
end if;
end if;
end Fill_From_Stream;
procedure Finalize (Listener : in out Connections_Server) is
procedure Free is
new Ada.Unchecked_Deallocation (Worker, Worker_Ptr);
begin
if Listener.Doer /= null then
Listener.Finalizing := True;
Abort_Selector (Listener.Selector);
while not Listener.Doer'Terminated loop
delay 0.001;
end loop;
Free (Listener.Doer);
end if;
Close_Selector (Listener.Selector);
end Finalize;
procedure Finalize (Client : in out Connection) is
begin
Close (Client.Socket);
Free (Client.Transport);
Object.Finalize (Object.Entity (Client));
end Finalize;
function Free (Buffer : Output_Buffer) return Stream_Element_Count is
begin
return Buffer.Written'Length - Used (Buffer) - 1;
end Free;
function From_String (Data : String) return Stream_Element_Array is
Result : Stream_Element_Array (1..Data'Length);
Pointer : Stream_Element_Offset := Result'First;
begin
for Index in Data'Range loop
Result (Pointer) := Character'Pos (Data (Index));
Pointer := Pointer + 1;
end loop;
return Result;
end From_String;
function Get_Client_Address (Client : Connection)
return Sock_Addr_Type is
begin
return Client.Client_Address;
end Get_Client_Address;
function Get_Clients_Count (Listener : Connections_Server)
return Natural is
begin
return Listener.Clients;
end Get_Clients_Count;
function Get_Client_Name
( Factory : Connections_Factory;
Client : Connection'Class
) return String is
begin
return Image (Client.Client_Address);
end Get_Client_Name;
function Get_Connections_Server (Client : Connection)
return Connections_Server_Ptr is
begin
return Client.Socket_Listener;
end Get_Connections_Server;
function Get_IO_Timeout (Factory : Connections_Factory)
return Duration is
begin
return 0.02;
end Get_IO_Timeout;
procedure Get_Occurrence
( Client : Connection;
Source : out Exception_Occurrence
) is
begin
Save_Occurrence (Source, Client.Last_Error);
end Get_Occurrence;
function Get_Overlapped_Size (Client : Connection)
return Stream_Element_Count is
begin
return Client.Overlapped_Read;
end Get_Overlapped_Size;
function Get_Polling_Timeout (Factory : Connections_Factory)
return Duration is
begin
return 0.5;
end Get_Polling_Timeout;
function Get_Server_Address
( Listener : Connections_Server
) return Sock_Addr_Type is
Address : Sock_Addr_Type;
begin
Address.Addr := Any_Inet_Addr;
Address.Port := Listener.Port;
return Address;
end Get_Server_Address;
function Get_Session_State (Client : Connection)
return Session_State is
Result : constant Session_State := Client.Session;
begin
if Result = Session_Down then
if Client.Socket = No_Socket then
return Session_Down;
else
return Session_Disconnected; -- Almost here
end if;
else
return Result;
end if;
end Get_Session_State;
function Get_Socket (Client : Connection) return Socket_Type is
begin
return Client.Socket;
end Get_Socket;
function Has_Data (Buffer : Input_Buffer) return Boolean is
begin
return
( Buffer.Free_To_Read /= Buffer.First_Read
and then
( Buffer.Expected = 0
or else
Used (Buffer) >= Buffer.Size - 1
) );
end Has_Data;
function Has_Data (Client : Connection) return Boolean is
begin
return Has_Data (Client.Read);
end Has_Data;
function Image (Code : Error_Type) return String is
Result : String := Error_Type'Image (Code);
begin
for Index in Result'First + 1..Result'Last loop
if Result (Index) = '_' then
Result (Index) := ' ';
else
Result (Index) := To_Lower (Result (Index));
end if;
end loop;
return Result;
end Image;
function Image
( Data : Stream_Element_Array;
Hexadecimal : Boolean := False
) return String is
begin
if Hexadecimal then
declare
Result : String (1..Data'Length * 3);
Pointer : Integer := 1;
begin
for Index in Data'Range loop
Put
( Destination => Result,
Pointer => Pointer,
Value => Integer (Data (Index)),
Base => 16,
Field => 2,
Fill => '0',
Justify => Right
);
Put
( Destination => Result,
Pointer => Pointer,
Value => " "
);
end loop;
return Result;
end;
else
declare
Length : Natural := 0;
begin
for Index in Data'Range loop
case Data (Index) is
when 32..36 | 38..126 =>
Length := Length + 1;
when others =>
Length := Length + 3;
end case;
end loop;
declare
Result : String (1..Length);
Pointer : Integer := 1;
begin
for Index in Data'Range loop
case Data (Index) is
when 32..36 | 38..126 =>
Put
( Destination => Result,
Pointer => Pointer,
Value => Character'Val (Data (Index))
);
when others =>
Put
( Destination => Result,
Pointer => Pointer,
Value => '%'
);
Put
( Destination => Result,
Pointer => Pointer,
Value => Integer (Data (Index)),
Base => 16,
Field => 2,
Fill => '0',
Justify => Right
);
end case;
end loop;
return Result;
end;
end;
end if;
end Image;
procedure Initialize (Listener : in out Connections_Server) is
begin
Listener.IO_Timeout := Get_IO_Timeout (Listener.Factory.all);
Listener.Polling_Timeout :=
Get_Polling_Timeout (Listener.Factory.all);
Create_Selector (Listener.Selector);
Listener.Doer := new Worker (Listener'Unchecked_Access);
end Initialize;
function Is_Connected (Client : Connection) return Boolean is
begin
return Client.Session in Session_Active..Session_Busy;
end Is_Connected;
function Is_Down (Client : Connection) return Boolean is
begin
return
( Client.Session = Session_Down
and then
Client.Socket = No_Socket
);
end Is_Down;
function Is_Elevated (Client : Connection) return Boolean is
begin
return Client.Transport /= null;
end Is_Elevated;
function Is_Incoming (Client : Connection) return Boolean is
begin
return not Client.Client;
end Is_Incoming;
function Is_Opportunistic (Client : Connection) return Boolean is
begin
return False;
end Is_Opportunistic;
function Is_TLS_Capable
( Factory : Connections_Factory
) return Boolean is
begin
return False;
end Is_TLS_Capable;
function Is_Trace_Received_On
( Factory : Connections_Factory;
Encoded : IO_Tracing_Mode
) return Boolean is
begin
return 0 /= (Factory.Trace_Flags and Receive_Masks (Encoded));
end Is_Trace_Received_On;
function Is_Trace_Sent_On
( Factory : Connections_Factory;
Encoded : IO_Tracing_Mode
) return Boolean is
begin
return 0 /= (Factory.Trace_Flags and Sent_Masks (Encoded));
end Is_Trace_Sent_On;
function Is_Unblock_Send_Queued
( Listener : Connections_Server
) return Boolean is
begin
return Listener.Unblock_Send;
end Is_Unblock_Send_Queued;
procedure Keep_On_Sending (Client : in out Connection) is
begin
Client.Dont_Block := True;
end Keep_On_Sending;
procedure On_Connected
( Listener : in out Connections_Server'Class;
Client : in out Connection'Class
) is
begin
Trace_Sending
( Listener.Factory.all,
Client,
False,
", connected"
);
Free (Client.Transport);
if not Is_Opportunistic (Client) then
Client.Transport :=
Create_Transport
( Listener.Factory,
Listener'Unchecked_Access,
Client'Unchecked_Access
);
end if;
Set (Listener.Read_Sockets, Client.Socket);
if Client.Transport = null then -- No handshaking
declare
Saved : constant Session_State := Client.Session;
begin
Client.Session := Session_Connected;
Connected (Client);
Connected (Listener, Client);
Client.Session := Session_Active;
Activated (Client);
exception
when others =>
if Client.Session in Session_Connected
.. Session_Active
then
Client.Session := Saved;
end if;
raise;
end;
else
Client.Session := Session_Handshaking;
Append
( Listener.Postponed,
Client'Unchecked_Access,
Listener.Postponed_Count
);
end if;
end On_Connected;
procedure On_Worker_Start (Listener : in out Connections_Server) is
begin
null;
end On_Worker_Start;
procedure Process
( Buffer : in out Input_Buffer;
Receiver : in out Connection'Class;
Data_Left : out Boolean
) is
Last : Stream_Element_Offset;
Pointer : Stream_Element_Offset;
begin
while Has_Data (Buffer) loop
if Buffer.Free_To_Read < Buffer.First_Read then
--
-- [XXXXXXXXXXXXXX XXXXX]
-- Free_To_Read | First_Read |
--
if Buffer.First_Read > Buffer.Read'Last then
--
-- [XXXXXXXXXXXXXX ]
-- Free_To_Read | First_Read |
--
Buffer.First_Read := Buffer.Read'First; -- Wrap
Last := Buffer.Free_To_Read - 1;
else
Last := Buffer.Read'Last;
end if;
else
--
-- [ XXXXXXXXX ]
-- First_Read | | Free_To_Read
--
Last := Buffer.Free_To_Read - 1;
end if;
Pointer := Last + 1;
Received
( Receiver,
Buffer.Read (Buffer.First_Read..Last),
Pointer
);
if Pointer < Buffer.First_Read or else Pointer > Last + 1 then
Raise_Exception
( Layout_Error'Identity,
( "Subscript error, pointer "
& Image (Pointer)
& " out of range "
& Image (Buffer.First_Read)
& ".."
& Image (Last)
& "+"
) );
elsif Pointer > Buffer.Read'Last then
if Buffer.Free_To_Read <= Buffer.Read'Last then
Buffer.First_Read := Buffer.Read'First; -- Wrap
else
Buffer.First_Read := Pointer; -- Not yet
end if;
else
Buffer.First_Read := Pointer;
end if;
if Pointer <= Last then -- Some input left unprocessed
Data_Left := True;
return;
end if;
end loop;
Data_Left := False;
end Process;
procedure Process
( Listener : in out Connections_Server;
Client : Connection_Ptr;
Data_Left : out Boolean
) is
begin
if Client.Transport = null then
Process (Client.Read, Client.all, Data_Left);
else
Process
( Client.Transport.all,
Listener,
Client.all,
Data_Left
);
end if;
end Process;
procedure Process_Packet (Client : in out Connection) is
begin
null;
end Process_Packet;
procedure Pull
( Buffer : in out Input_Buffer;
Data : in out Stream_Element_Array;
Pointer : in out Stream_Element_Offset
) is
Last : Stream_Element_Offset;
Offset : Stream_Element_Offset;
begin
while Pointer <= Data'Last and then Has_Data (Buffer) loop
if Buffer.Free_To_Read < Buffer.First_Read then
--
-- [XXXXXXXXXXXXXX XXXXX]
-- Free_To_Read | First_Read |
--
if Buffer.First_Read > Buffer.Read'Last then
--
-- [XXXXXXXXXXXXXX ]
-- Free_To_Read | First_Read |
--
Buffer.First_Read := Buffer.Read'First; -- Wrap
Last := Buffer.Free_To_Read - 1;
else
Last := Buffer.Read'Last;
end if;
else
--
-- [ XXXXXXXXX ]
-- First_Read | | Free_To_Read
--
Last := Buffer.Free_To_Read - 1;
end if;
Offset := Last - Buffer.First_Read;
if Offset > Data'Last - Pointer then
Offset := Data'Last - Pointer;
Last := Buffer.First_Read + Offset;
end if;
Data (Pointer..Pointer + Offset) :=
Buffer.Read (Buffer.First_Read..Last);
Pointer := Pointer + Offset + 1;
if Last >= Buffer.Read'Last then
if Buffer.Free_To_Read <= Buffer.Read'Last then
Buffer.First_Read := Buffer.Read'First; -- Wrap
else
Buffer.First_Read := Last + 1; -- Not yet
end if;
else
Buffer.First_Read := Last + 1;
end if;
end loop;
end Pull;
procedure Push
( Client : in out Connection;
Data : Stream_Element_Array;
Last : out Stream_Element_Offset
) is
begin
if Client.Transport = null then
Send_Socket (Client.Socket_Listener.all, Client, Data, Last);
else
Encode (Client.Transport.all, Client, Data, Last);
end if;
if Last + 1 /= Data'First then
Client.Data_Sent := True;
if ( 0
/= ( Client.Socket_Listener.Factory.Trace_Flags
and
Trace_Decoded_Sent
) )
then
Trace_Sent
( Factory => Client.Socket_Listener.Factory.all,
Client => Client,
Data => Data,
From => Data'First,
To => Last,
Encoded => False
);
end if;
end if;
end Push;
procedure Queue
( Client : in out Connection;
Data : Stream_Element_Array;
Pointer : in out Stream_Element_Offset
) is
Buffer : Output_Buffer renames Client.Written;
Free : Stream_Element_Offset;
Count : Stream_Element_Offset := Data'Last - Pointer + 1;
begin
if Buffer.First_Written = Buffer.Free_To_Write then
--
-- Moving First_Written as far back as possible to diminish
-- buffer fragmenting. We cannot move it further than the
-- number of elements we put there, because of race condition,
-- when Free_To_Write is not yet set. But when Free_To_Write
-- points into the elements written everything is OK
--
-- [ ............ ]
-- |<--Count-->|
-- | Free_To_Write = First_Written
-- new First_Written
--
Count :=
Stream_Element_Offset'Min
( Buffer.Written'Length - 1,
Count
);
Free := Stream_Element_Offset'Max
( Buffer.Written'First,
Buffer.Free_To_Write - Count
);
Buffer.Written (Free..Free + Count - 1) :=
Data (Pointer..Pointer + Count - 1);
Pointer := Pointer + Count;
Buffer.First_Written := Free;
Buffer.Free_To_Write := Free + Count;
return;
elsif Buffer.First_Written < Buffer.Free_To_Write then
--
-- [ XXXXXXXXXXXXXXX ]
-- | |
-- First_Written Free_To_Write
--
Free :=
( Buffer.Written'Length
- Buffer.Free_To_Write
+ Buffer.First_Written
- 1 -- Last element is never written
);
if Free <= 0 then
return;
end if;
declare
Tail : constant Stream_Element_Offset :=
Stream_Element_Offset'Min
( Buffer.Written'Last - Buffer.Free_To_Write + 1,
Free
);
begin
if Count <= Tail then -- Can queue all Count elements
Buffer.Written
( Buffer.Free_To_Write
.. Buffer.Free_To_Write + Count - 1
) := Data (Pointer..Data'Last);
Pointer := Data'Last + 1;
Free := Buffer.Free_To_Write + Count;
if Free > Buffer.Written'Last then
Buffer.Free_To_Write := Buffer.Written'First;
else
Buffer.Free_To_Write := Free;
end if;
return;
end if; -- Can queue only Tail elements
Buffer.Written
( Buffer.Free_To_Write
.. Buffer.Free_To_Write + Tail - 1
) := Data (Pointer..Pointer + Tail - 1);
Pointer := Pointer + Tail;
Count := Count - Tail;
Free := Free - Tail;
if Buffer.Free_To_Write + Tail > Buffer.Written'Last then
Buffer.Free_To_Write := Buffer.Written'First;
else
Buffer.Free_To_Write := Buffer.Free_To_Write + Tail;
end if;
end;
else
--
-- [XXXXX XXXXXXXX]
-- | |
-- Free_To_Write First_Written
--
Free :=
( Buffer.First_Written
+ Buffer.Free_To_Write
- 1 -- Last element is never written
);
end if;
if Free <= 0 then
return;
end if;
Count := Stream_Element_Offset'Min (Count, Free);
Buffer.Written
( Buffer.Free_To_Write
.. Buffer.Free_To_Write + Count - 1
) := Data (Pointer..Pointer + Count - 1);
Pointer := Pointer + Count;
Buffer.Free_To_Write := Buffer.Free_To_Write + Count;
end Queue;
function Queued_To_Send (Client : Connection)
return Stream_Element_Count is
begin
return Used (Client.Written);
end Queued_To_Send;
procedure Read
( Client : in out Connection;
Factory : in out Connections_Factory'Class
) is
Buffer : Input_Buffer renames Client.Read;
Last : Stream_Element_Offset;
begin
if Client.Overlapped_Read < Queued_To_Send (Client) then
return; -- Not ready to read yet
elsif Buffer.Free_To_Read < Buffer.First_Read then
--
-- [XXXXXXXXXXXXXX XXXXX]
-- Free_To_Read | First_Read |
--
Last := Buffer.First_Read - 2;
if Last <= Buffer.First_Read then -- Read buffer is full
return;
end if;
else
--
-- [ XXXXXXXXX ]
-- First_Read | | Free_To_Read
--
if ( Buffer.Free_To_Read - Buffer.First_Read
>= Buffer.Read'Length
)
then -- Read buffer is full
return;
elsif Buffer.Free_To_Read > Buffer.Read'Last then -- Wrap
Buffer.Free_To_Read := Buffer.Read'First;
Last := Buffer.First_Read - 2;
else
Last := Buffer.Read'Last;
end if;
end if;
Receive_Socket
( Client.Socket_Listener.all,
Client,
Buffer.Read (Buffer.Free_To_Read..Last),
Last
);
Received
( Factory,
Client,
Buffer.Read,
Buffer.Free_To_Read,
Last
);
if Last = Buffer.Free_To_Read - 1 then -- Nothing read
raise Connection_Error;
end if;
Buffer.Expected :=
Stream_Element_Offset'Max
( Buffer.Expected - (Last - Buffer.Free_To_Read + 1),
0
);
Buffer.Free_To_Read := Last + 1;
exception
when Error : Socket_Error | Layout_Error =>
Receive_Error (Client, Error);
raise Connection_Error;
end Read;
procedure Receive_Socket
( Listener : in out Connections_Server;
Client : in out Connection'Class;
Data : in out Stream_Element_Array;
Last : out Stream_Element_Offset
) is
begin
Receive_Socket (Client.Socket, Data, Last);
end Receive_Socket;
procedure Received
( Factory : in out Connections_Factory;
Client : in out Connection'Class;
Data : Stream_Element_Array;
From : Stream_Element_Offset;
To : Stream_Element_Offset
) is
begin
if Client.Transport = null then
if 0 /= (Factory.Trace_Flags and Trace_Decoded_Received) then
Trace_Received
( Factory => Connections_Factory'Class (Factory),
Client => Client,
Data => Data,
From => From,
To => To,
Encoded => False
);
end if;
else
if 0 /= (Factory.Trace_Flags and Trace_Encoded_Received) then
Trace_Received
( Factory => Connections_Factory'Class (Factory),
Client => Client,
Data => Data,
From => From,
To => To,
Encoded => True
);
end if;
end if;
end Received;
procedure Reconnect (Client : in out Connection) is
begin
if Client.Socket = No_Socket then
Raise_Exception
( Use_Error'Identity,
"No connection"
);
elsif not Client.Client then
Raise_Exception
( Mode_Error'Identity,
"Server connection"
);
elsif Client.Session /= Session_Down then
if Client.Socket_Listener /= null then
Request_Disconnect
( Client.Socket_Listener.all,
Client,
True
);
return;
end if;
Client.Session := Session_Down;
end if;
Raise_Exception
( Status_Error'Identity,
"Downed connection"
);
end Reconnect;
procedure Received
( Client : in out Connection;
Data : Stream_Element_Array;
Pointer : in out Stream_Element_Offset
) is
begin
raise Connection_Error;
end Received;
procedure Released (Client : in out Connection) is
begin
null;
end Released;
procedure Remove
( List : in out Connection_Ptr;
Item : in out Connection'Class;
Count : in out Integer
) is
begin
if Item.Successor /= null then
Count := Count - 1;
if List = Item.Successor.Predecessor then -- First in the list
if List = List.Successor then -- The single item of the list
List := null;
Item.Successor := null;
return;
else
List := Item.Successor;
end if;
end if;
Item.Predecessor.Successor := Item.Successor;
Item.Successor.Predecessor := Item.Predecessor;
Item.Successor := null;
end if;
end Remove;
procedure Receive_Error
( Client : in out Connection;
Occurrence : Exception_Occurrence
) is
begin
null;
end Receive_Error;
procedure Request_Disconnect
( Listener : in out Connections_Server;
Client : in out Connection'Class;
Reconnect : Boolean
) is
begin
Client.Failed := True;
if Reconnect then
Client.Try_To_Reconnect := True;
Client.Action_Request := Reconnect_Connection;
else
Client.Try_To_Reconnect := False;
Client.Action_Request := Shutdown_Connection;
end if;
Client.Socket_Listener.Shutdown_Request := True;
if Client.Socket_Listener.Doer /= null then
Abort_Selector (Client.Socket_Listener.Selector);
end if;
end Request_Disconnect;
procedure Save_Occurrence
( Client : in out Connection;
Source : Exception_Occurrence
) is
begin
Save_Occurrence (Client.Last_Error, Source);
end Save_Occurrence;
procedure Send
( Client : in out Connection;
Data : Stream_Element_Array;
Pointer : in out Stream_Element_Offset
) is
Buffer : Output_Buffer renames Client.Written;
begin
if ( Pointer < Data'First
or else
( Pointer > Data'Last
and then
Pointer - 1 > Data'Last
) )
then
Raise_Exception (Layout_Error'Identity, "Subscript error");
end if;
Queue (Client, Data, Pointer);
if Buffer.Free_To_Write /= Buffer.First_Written then
Unblock_Send (Client.Socket_Listener.all, Client);
end if;
end Send;
procedure Send
( Client : in out Connection;
Data : String;
Pointer : in out Integer
) is
Buffer : Output_Buffer renames Client.Written;
begin
Pointer := Data'Last + 1;
for Index in Data'Range loop
if Used (Buffer) + 1 >= Buffer.Written'Length then
Pointer := Index;
exit;
end if;
Buffer.Written (Buffer.Free_To_Write) :=
Stream_Element (Character'Pos (Data (Index)));
if Buffer.Free_To_Write = Buffer.Written'Last then
Buffer.Free_To_Write := Buffer.Written'First;
else
Buffer.Free_To_Write := Buffer.Free_To_Write + 1;
end if;
end loop;
if Buffer.Free_To_Write /= Buffer.First_Written then
Unblock_Send (Client.Socket_Listener.all, Client);
end if;
end Send;
procedure Send
( Client : in out Connection;
Stream : in out Root_Stream_Type'Class;
End_Of_Stream : out Boolean
) is
Buffer : Output_Buffer renames Client.Written;
Last : Stream_Element_Offset;
Next : Stream_Element_Offset;
begin
Fill_From_Stream
( Buffer => Buffer,
Stream => Stream,
Count => Stream_Element_Count'Last,
Reserve => 1,
Last => Last,
Next => Next,
Done => End_Of_Stream
);
Buffer.Free_To_Write := Next;
if Buffer.Free_To_Write /= Buffer.First_Written then
Unblock_Send (Client.Socket_Listener.all, Client);
end if;
end Send;
procedure Send
( Client : in out Connection;
Stream : in out Root_Stream_Type'Class;
Count : in out Stream_Element_Count;
End_Of_Stream : out Boolean
) is
Buffer : Output_Buffer renames Client.Written;
Last : Stream_Element_Offset;
Next : Stream_Element_Offset;
begin
Fill_From_Stream
( Buffer => Buffer,
Stream => Stream,
Count => Count,
Reserve => 1,
Last => Last,
Next => Next,
Done => End_Of_Stream
);
Count := Count - (Last + 1 - Buffer.Free_To_Write);
Buffer.Free_To_Write := Next;
if Buffer.Free_To_Write /= Buffer.First_Written then
Unblock_Send (Client.Socket_Listener.all, Client);
end if;
end Send;
procedure Send
( Client : in out Connection;
Stream : in out Root_Stream_Type'Class;
Reserve : Stream_Element_Count;
Get_Prefix : Create_Stream_Element_Array;
Get_Suffix : Create_Stream_Element_Array;
End_Of_Stream : out Boolean
) is
Count : Stream_Element_Count := Stream_Element_Count'Last;
begin
Send
( Client => Client,
Stream => Stream,
Count => Count,
Reserve => Reserve,
Get_Prefix => Get_Prefix,
Get_Suffix => Get_Suffix,
End_Of_Stream => End_Of_Stream
);
end Send;
procedure Send
( Client : in out Connection;
Stream : in out Root_Stream_Type'Class;
Count : in out Stream_Element_Count;
Reserve : Stream_Element_Count;
Get_Prefix : Create_Stream_Element_Array;
Get_Suffix : Create_Stream_Element_Array;
End_Of_Stream : out Boolean
) is
Buffer : Output_Buffer renames Client.Written;
Last : Stream_Element_Offset;
Next : Stream_Element_Offset;
begin
if Buffer.Free_To_Write = Buffer.First_Written then
if Buffer.Written'Length <= Reserve then
Raise_Exception
( Data_Error'Identity,
( "Output buffer size"
& Stream_Element_Count'Image (Buffer.Written'Length)
& " is less than required"
& Stream_Element_Count'Image (Reserve + 1)
& " elements"
) );
end if;
Fill_From_Stream
( Buffer => Buffer,
Stream => Stream,
Count => Count,
Reserve => Reserve + 1,
Last => Last,
Next => Next,
Done => End_Of_Stream
);
Count := Count - (Last + 1 - Buffer.Free_To_Write);
declare
Header : constant Stream_Element_Array :=
Get_Prefix.all
( Client'Unchecked_Access,
Buffer.Written (Buffer.Free_To_Write..Last),
End_Of_Stream
);
Tail : constant Stream_Element_Array :=
Get_Suffix.all
( Client'Unchecked_Access,
Buffer.Written (Buffer.Free_To_Write..Last),
End_Of_Stream
);
begin
if Header'Length + Tail'Length > Reserve then
Raise_Exception
( Data_Error'Identity,
( "Prefix returns more than"
& Stream_Element_Count'Image (Reserve)
& " elements"
) );
elsif Header'Length > 0 then
Last := Buffer.First_Written;
for Index in reverse Header'Range loop
if Last = Buffer.Written'First then
Last := Buffer.Written'Last;
else
Last := Last - 1;
end if;
Buffer.Written (Last) := Header (Index);
end loop;
end if;
Buffer.First_Written := Last;
Buffer.Free_To_Write := Next;
if Tail'Length > 0 then
Last := Tail'First;
Queue (Client, Tail, Last);
end if;
end;
else
End_Of_Stream := False;
end if;
if Buffer.Free_To_Write /= Buffer.First_Written then
Unblock_Send (Client.Socket_Listener.all, Client);
end if;
end Send;
procedure Send
( Client : in out Connection;
Stream : in out Root_Stream_Type'Class;
Count : in out Stream_Element_Count;
Reserve : Natural;
Get_Prefix : Create_String;
Get_Suffix : Create_String;
End_Of_Stream : out Boolean
) is
Buffer : Output_Buffer renames Client.Written;
Last : Stream_Element_Offset;
Next : Stream_Element_Offset;
begin
if Buffer.Free_To_Write = Buffer.First_Written then
if Buffer.Written'Length <= Reserve then
Raise_Exception
( Data_Error'Identity,
( "Output buffer size"
& Stream_Element_Count'Image (Buffer.Written'Length)
& " is less than required"
& Integer'Image (Reserve + 1)
& " elements"
) );
end if;
Fill_From_Stream
( Buffer => Buffer,
Stream => Stream,
Count => Count,
Reserve => Stream_Element_Count (Reserve) + 1,
Last => Last,
Next => Next,
Done => End_Of_Stream
);
Count := Count - (Last + 1 - Buffer.Free_To_Write);
declare
Header : constant String :=
Get_Prefix.all
( Client'Unchecked_Access,
Buffer.Written (Buffer.Free_To_Write..Last),
End_Of_Stream
);
Tail : constant String :=
Get_Suffix.all
( Client'Unchecked_Access,
Buffer.Written (Buffer.Free_To_Write..Last),
End_Of_Stream
);
begin
if Header'Length + Tail'Length > Reserve then
Raise_Exception
( Data_Error'Identity,
( "Prefix returns more than"
& Integer'Image (Reserve)
& " elements"
) );
elsif Header'Length > 0 then
Last := Buffer.First_Written;
for Index in reverse Header'Range loop
if Last = Buffer.Written'First then
Last := Buffer.Written'Last;
else
Last := Last - 1;
end if;
Buffer.Written (Last) :=
Stream_Element (Character'Pos (Header (Index)));
end loop;
end if;
Buffer.First_Written := Last;
Buffer.Free_To_Write := Next;
if Tail'Length > 0 then
declare
Pointer : Integer := Tail'First;
begin
Send (Client, Tail, Pointer);
end;
end if;
end;
else
End_Of_Stream := False;
end if;
if Buffer.Free_To_Write /= Buffer.First_Written then
Unblock_Send (Client.Socket_Listener.all, Client);
end if;
end Send;
procedure Send
( Client : in out Connection;
Stream : in out Root_Stream_Type'Class;
Reserve : Natural;
Get_Prefix : Create_String;
Get_Suffix : Create_String;
End_Of_Stream : out Boolean
) is
Count : Stream_Element_Count := Stream_Element_Count'Last;
begin
Send
( Client => Client,
Stream => Stream,
Count => Count,
Reserve => Reserve,
Get_Prefix => Get_Prefix,
Get_Suffix => Get_Suffix,
End_Of_Stream => End_Of_Stream
);
end Send;
procedure Send_Error
( Client : in out Connection;
Occurrence : Exception_Occurrence
) is
begin
null;
end Send_Error;
procedure Send_Socket
( Listener : in out Connections_Server;
Client : in out Connection'Class;
Data : Stream_Element_Array;
Last : out Stream_Element_Offset
) is
begin
Send_Socket (Client.Socket, Data, Last);
end Send_Socket;
procedure Sent (Client : in out Connection) is
begin
null;
end Sent;
procedure Set_Client_Data
( Client : in out Connection;
Address : Sock_Addr_Type;
Listener : Connections_Server_Ptr
) is
begin
if Client.Socket_Listener /= null then
Raise_Exception
( Constraint_Error'Identity,
"The client has a connections server set"
);
end if;
Client.Client_Address := Address;
Client.Socket_Listener := Listener;
end Set_Client_Data;
procedure Set_Expected_Count
( Client : in out Connection;
Count : Stream_Element_Count
) is
begin
Client.Read.Expected := Count;
end Set_Expected_Count;
procedure Service_Postponed (Listener : in out Connections_Server) is
Leftover : Connection_Ptr;
Client : Connection_Ptr;
Data_Left : Boolean;
begin
loop
Client := Listener.Postponed;
exit when Client = null;
Remove
( Listener.Postponed,
Client.all,
Listener.Postponed_Count
);
begin
Process
( Connections_Server'Class (Listener),
Client,
Data_Left
);
if Data_Left then
Append (Leftover, Client, Listener.Postponed_Count);
end if;
exception
when Connection_Error =>
Stop (Listener, Client);
when Error : others =>
Trace_Error
( Listener.Factory.all,
"Postponed service",
Error
);
Stop (Listener, Client);
end;
end loop;
Listener.Postponed := Leftover;
end Service_Postponed;
procedure Set_Failed
( Client : in out Connection;
Error : Exception_Occurrence
) is
begin
Save_Occurrence (Client.Last_Error, Error);
Client.Failed := True;
end Set_Failed;
procedure Set_Overlapped_Size
( Client : in out Connection;
Size : Stream_Element_Count
) is
begin
Client.Overlapped_Read := Size;
end Set_Overlapped_Size;
procedure Shutdown (Client : in out Connection) is
begin
if Client.Session /= Session_Down then
if Client.Socket_Listener = null then
Client.Session := Session_Down;
else
Request_Disconnect
( Client.Socket_Listener.all,
Client,
False
);
Shutdown (Client.Socket_Listener.all, Client);
end if;
end if;
end Shutdown;
procedure Shutdown
( Listener : in out Connections_Server;
Client : in out Connection'Class
) is
begin
null;
end Shutdown;
procedure Stop
( Listener : in out Connections_Server'Class;
Client : in out Connection_Ptr
) is
Old_Socket : constant Socket_Type := Client.Socket;
Reconnect : Boolean :=
Client.Action_Request /= Shutdown_Connection;
begin
Trace_Sending
( Listener.Factory.all,
Client.all,
False,
", dropping connection"
);
Client.Action_Request := Keep_Connection;
Clear (Listener.Read_Sockets, Client.Socket);
Clear (Listener.Blocked_Sockets, Client.Socket);
Clear (Listener.Ready_To_Read, Client.Socket);
Clear (Listener.Ready_To_Write, Client.Socket);
Clear (Listener.Write_Sockets, Client.Socket);
Clear (Listener.Ready_To_Write, Client.Socket);
Free (Client.Transport);
if Client.Session in Session_Connected..Session_Busy then
begin
Disconnected (Listener, Client.all);
exception
when Connection_Error =>
Reconnect := False;
when Error : others =>
Trace_Error
( Listener.Factory.all,
"Disconnected (server)",
Error
);
end;
begin -- Disconnected
Client.Session := Session_Disconnected;
Disconnected (Client.all);
exception
when Connection_Error =>
Reconnect := False;
when Error : others =>
Trace_Error
( Listener.Factory.all,
"Disconnected (client)",
Error
);
end;
end if;
if Client.Client then -- Try to reconnect
if ( Reconnect
and then
not Listener.Finalizing
and then
Client.Try_To_Reconnect
and then
Client.Session /= Session_Down
and then
Client.Action_Request /= Shutdown_Connection
)
then
begin
Close (Client.Socket);
declare
Option : Request_Type := (Non_Blocking_IO, True);
begin
Create_Socket (Client.Socket);
Set_Socket_Option
( Client.Socket,
Socket_Level,
(Reuse_Address, True)
);
end;
if Old_Socket /= Client.Socket then -- Move client
Put (Listener.Connections, Client.Socket, Client);
Put (Listener.Connections, Old_Socket, null);
end if;
Set (Listener.Write_Sockets, Client.Socket);
Do_Connect (Listener, Client);
return;
exception
when Error : Socket_Error => -- Kill the object
Trace_Error
( Listener.Factory.all,
"Reconnecting",
Error
);
end;
end if;
Listener.Servers := Listener.Servers - 1;
else
Listener.Clients := Listener.Clients - 1;
end if;
Close (Client.Socket);
Client.Session := Session_Down;
Client.Failed := False;
Client.Action_Request := Keep_Connection;
begin
Downed (Listener, Client.all);
exception
when Error : others =>
Trace_Error
( Listener.Factory.all,
"Downed (server)",
Error
);
end;
begin
Downed (Client.all);
exception
when Error : others =>
Trace_Error
( Listener.Factory.all,
"Downed (client)",
Error
);
end;
begin
Released (Client.all);
exception
when others =>
null;
end;
if Get (Listener.Connections, Old_Socket) = Client then
Put (Listener.Connections, Old_Socket, null);
end if;
Client := null;
exception
when Error : others =>
Trace_Error (Listener.Factory.all, "Stopping", Error);
raise;
end Stop;
function To_Addr (Host : String) return Inet_Addr_Type is
begin
for Index in Host'Range loop
case Host (Index) is
when '.' | '0'..'9' =>
null;
when others =>
return Addresses (Get_Host_By_Name (Host), 1);
end case;
end loop;
return Inet_Addr (Host);
end To_Addr;
function To_String (Data : Stream_Element_Array) return String is
Result : String (1..Data'Length);
Index : Integer := Result'First;
begin
for Item in Data'Range loop
Result (Index) := Character'Val (Data (Item));
Index := Index + 1;
end loop;
return Result;
end To_String;
procedure Trace
( Factory : in out Connections_Factory;
Message : String
) is
use Ada.Text_IO;
begin
if 0 /= (Factory.Trace_Flags and Standard_Output) then
Put_Line (Message);
end if;
if Is_Open (Factory.Trace_File) then
Put_Line (Factory.Trace_File, Message);
end if;
end Trace;
procedure Trace_Error
( Factory : in out Connections_Factory;
Context : String;
Occurrence : Exception_Occurrence
) is
begin
Trace
( Connections_Factory'Class (Factory),
Context & ": " & Exception_Information (Occurrence)
);
end Trace_Error;
procedure Trace_Off (Factory : in out Connections_Factory) is
use Ada.Text_IO;
begin
if Is_Open (Factory.Trace_File) then
Close (Factory.Trace_File);
end if;
Factory.Trace_Flags :=
Factory.Trace_Flags and not Standard_Output;
end Trace_Off;
procedure Trace_On
( Factory : in out Connections_Factory;
Received : IO_Tracing_Mode := Trace_None;
Sent : IO_Tracing_Mode := Trace_None
) is
Flags : Factory_Flags := Standard_Output;
begin
case Received is
when Trace_Any =>
Flags := Flags
or Trace_Decoded_Received
or Trace_Encoded_Received;
when Trace_Decoded =>
Flags := Flags or Trace_Decoded_Received;
when Trace_Encoded =>
Flags := Flags or Trace_Encoded_Received;
when Trace_None =>
null;
end case;
case Sent is
when Trace_Any =>
Flags := Flags or Trace_Decoded_Sent or Trace_Encoded_Sent;
when Trace_Decoded =>
Flags := Flags or Trace_Decoded_Sent;
when Trace_Encoded =>
Flags := Flags or Trace_Encoded_Sent;
when Trace_None =>
null;
end case;
Factory.Trace_Flags := Flags;
end Trace_On;
procedure Trace_On
( Factory : in out Connections_Factory;
Name : String;
Received : IO_Tracing_Mode := Trace_None;
Sent : IO_Tracing_Mode := Trace_None
) is
use Ada.Text_IO;
Flags : Factory_Flags := 0;
begin
if Is_Open (Factory.Trace_File) then
Close (Factory.Trace_File);
end if;
Create (File => Factory.Trace_File, Name => Name);
case Received is
when Trace_Any =>
Flags := Flags
or Trace_Decoded_Received
or Trace_Encoded_Received;
when Trace_Decoded =>
Flags := Flags or Trace_Decoded_Received;
when Trace_Encoded =>
Flags := Flags or Trace_Encoded_Received;
when Trace_None =>
null;
end case;
case Sent is
when Trace_Any =>
Flags := Flags or Trace_Decoded_Sent or Trace_Encoded_Sent;
when Trace_Decoded =>
Flags := Flags or Trace_Decoded_Sent;
when Trace_Encoded =>
Flags := Flags or Trace_Encoded_Sent;
when Trace_None =>
null;
end case;
Factory.Trace_Flags := Flags;
end Trace_On;
procedure Trace_Received
( Factory : in out Connections_Factory;
Client : Connection'Class;
Data : Stream_Element_Array;
From : Stream_Element_Offset;
To : Stream_Element_Offset;
Encoded : Boolean := False
) is
This : Connections_Factory'Class renames
Connections_Factory'Class (Factory);
begin
if Encoded then
Trace
( This,
( Get_Client_Name (This, Client)
& " encoded> |"
& Image (Data (From..To))
& "| "
& Image (From)
& ".."
& Image (To)
) );
else
Trace
( This,
( Get_Client_Name (This, Client)
& " > |"
& Image (Data (From..To))
& "| "
& Image (From)
& ".."
& Image (To)
) );
end if;
end Trace_Received;
procedure Trace_Sending
( Factory : in out Connections_Factory;
Client : Connection'Class;
Enabled : Boolean;
Reason : String
) is
This : Connections_Factory'Class renames
Connections_Factory'Class (Factory);
begin
if Enabled then
Trace
( This,
( Get_Client_Name (This, Client)
& " < +++ Resume polling"
& Reason
) );
else
Trace
( This,
( Get_Client_Name (This, Client)
& " < --- Stop polling"
& Reason
) );
end if;
end Trace_Sending;
procedure Trace_Sent
( Factory : in out Connections_Factory;
Client : Connection'Class;
Data : Stream_Element_Array;
From : Stream_Element_Offset;
To : Stream_Element_Offset;
Encoded : Boolean := False
) is
This : Connections_Factory'Class renames
Connections_Factory'Class (Factory);
begin
if Encoded then
Trace
( This,
( Get_Client_Name (This, Client)
& " <encoded |"
& Image (Data (From..To))
& "| "
& Image (From)
& ".."
& Image (To)
) );
else
Trace
( This,
( Get_Client_Name (This, Client)
& " < |"
& Image (Data (From..To))
& "| "
& Image (From)
& ".."
& Image (To)
) );
end if;
end Trace_Sent;
procedure Trace_Service_Loop
( Factory : in out Connections_Factory;
Stage : Service_Loop_Stage;
Server : in out Connections_Server'Class
) is
begin
null;
end Trace_Service_Loop;
procedure Unblock_Send
( Listener : in out Connections_Server;
Client : in out Connection'Class
) is
Buffer : Output_Buffer renames Client.Written;
begin
if Buffer.Send_Blocked then -- Request socket unblocking
Buffer.Send_Blocked := False;
Listener.Unblock_Send := True;
if Listener.Doer /= null then
Abort_Selector (Listener.Selector);
end if;
end if;
end Unblock_Send;
procedure Unblock_Send (Client : in out Connection) is
begin
Unblock_Send (Client.Socket_Listener.all, Client);
end Unblock_Send;
function Used (Buffer : Input_Buffer) return Stream_Element_Count is
Diff : constant Stream_Element_Offset :=
Buffer.Free_To_Read - Buffer.First_Read;
begin
if Diff < 0 then
return Buffer.Read'Length - Diff;
else
return Diff;
end if;
end Used;
function Used (Buffer : Output_Buffer) return Stream_Element_Count is
begin
if Buffer.Free_To_Write >= Buffer.First_Written then
return Buffer.Free_To_Write - Buffer.First_Written;
else
return Buffer.Written'Length - Buffer.First_Written +
Buffer.Free_To_Write;
end if;
end Used;
procedure Write
( Client : in out Connection;
Factory : in out Connections_Factory'Class;
Blocked : out Boolean
) is
Buffer : Output_Buffer renames Client.Written;
Next : Stream_Element_Count;
begin
Blocked := Buffer.First_Written = Buffer.Free_To_Write;
if Blocked then
if Client.Dont_Block then
Blocked := False;
Client.Data_Sent := True;
Client.Dont_Block := False;
end if;
else
loop
if Buffer.First_Written > Buffer.Free_To_Write then
--
-- [XXXXX XXXXXXX]
-- | |
-- Free_To_Write First_Written
--
if Client.Transport = null then
Send_Socket
( Client.Socket_Listener.all,
Client,
Buffer.Written
( Buffer.First_Written
.. Buffer.Written'Last
),
Next
);
else
Encode
( Client.Transport.all,
Client,
Buffer.Written
( Buffer.First_Written
.. Buffer.Written'Last
),
Next
);
end if;
Next := Next + 1;
if Next = Buffer.First_Written then
exit; -- Cannot send anything right now
elsif Next <= Buffer.Written'Last then
if 0 /= (Factory.Trace_Flags and Trace_Decoded_Sent)
then
Trace_Sent
( Factory => Factory,
Client => Client,
Data => Buffer.Written,
From => Buffer.First_Written,
To => Next - 1,
Encoded => False
);
end if;
Buffer.First_Written := Next;
Client.Data_Sent := True;
exit;
end if;
if 0 /= (Factory.Trace_Flags and Trace_Decoded_Sent) then
Trace_Sent
( Factory => Factory,
Client => Client,
Data => Buffer.Written,
From => Buffer.First_Written,
To => Next - 1,
Encoded => False
);
end if;
Buffer.First_Written := 0;
Client.Data_Sent := True;
else
--
-- [ XXXXXXXXXXXXXXX ]
-- | |
-- First_Written Free_To_Write
--
if Client.Transport = null then
Send_Socket
( Client.Socket_Listener.all,
Client,
Buffer.Written
( Buffer.First_Written
.. Buffer.Free_To_Write - 1
),
Next
);
else
Encode
( Client.Transport.all,
Client,
Buffer.Written
( Buffer.First_Written
.. Buffer.Free_To_Write - 1
),
Next
);
end if;
Next := Next + 1;
if Next = Buffer.First_Written then
exit;
elsif Next <= Buffer.Free_To_Write then
if 0 /= (Factory.Trace_Flags and Trace_Decoded_Sent)
then
Trace_Sent
( Factory => Factory,
Client => Client,
Data => Buffer.Written,
From => Buffer.First_Written,
To => Next - 1,
Encoded => False
);
end if;
Buffer.First_Written := Next;
Client.Data_Sent := True;
exit;
end if;
if 0 /= (Factory.Trace_Flags and Trace_Decoded_Sent) then
Trace_Sent
( Factory => Factory,
Client => Client,
Data => Buffer.Written,
From => Buffer.First_Written,
To => Next - 1,
Encoded => False
);
end if;
Buffer.First_Written := Next;
Client.Data_Sent := True;
end if;
exit when Buffer.First_Written = Buffer.Free_To_Write;
end loop;
end if;
end Write;
task body Worker is
Address : Sock_Addr_Type :=
Get_Server_Address (Listener.all);
Server_Socket : Socket_Type := No_Socket;
Client_Socket : Socket_Type;
That_Time : Time := Clock;
This_Time : Time;
Status : Selector_Status;
function Set_Image (Socket : Socket_Type) return String is
begin
return
( Image (Socket)
& ", listener"
& " read: " & Image (Listener.Read_Sockets)
& ", write: " & Image (Listener.Write_Sockets)
& ", blocked: " & Image (Listener.Blocked_Sockets)
& ", ready"
& " read: " & Image (Listener.Ready_To_Read)
& ", write: " & Image (Listener.Ready_To_Write)
);
end Set_Image;
procedure Check (Sockets : Socket_Set_Type) is
Socket : Socket_Type;
List : Socket_Set_Type := Sockets;
begin
loop
Get (List, Socket);
exit when Socket = No_Socket;
if Socket /= Server_Socket then
declare
Client : Connection_Ptr :=
Get (Listener.Connections, Socket);
begin
if Client = null then
Trace
( Listener.Factory.all,
( "Missing client when checking socket "
& Set_Image (Socket)
) );
Clear (Listener.Read_Sockets, Socket);
Clear (Listener.Write_Sockets, Socket);
Clear (Listener.Blocked_Sockets, Socket);
elsif Client.Failed then
if ( Client.Action_Request = Keep_Connection
and then
( Exception_Identity (Client.Last_Error)
/= Connection_Error'Identity
) )
then
Trace_Error
( Listener.Factory.all,
"Dropping connection on request",
Client.Last_Error
);
end if;
Stop (Listener.all, Client);
end if;
end;
end if;
end loop;
end Check;
procedure Unblock (Requested_Only : Boolean) is
Socket : Socket_Type;
begin
while not Listener.Finalizing loop
Get (Listener.Blocked_Sockets, Socket);
exit when Socket = No_Socket;
if Socket /= Server_Socket then
declare
Client : Connection_Ptr :=
Get (Listener.Connections, Socket);
begin
if Client = null then
Trace
( Listener.Factory.all,
( "Missing client when unblocking socket "
& Set_Image (Socket)
) );
Clear (Listener.Read_Sockets, Socket);
Clear (Listener.Write_Sockets, Socket);
Clear (Listener.Ready_To_Write, Socket);
elsif Client.Failed then
if ( Client.Session /= Session_Down
and then
Client.Action_Request = Keep_Connection
and then
( Exception_Identity (Client.Last_Error)
/= Connection_Error'Identity
) )
then
Trace_Error
( Listener.Factory.all,
"Unblocking socket",
Client.Last_Error
);
end if;
Stop (Listener.all, Client);
elsif ( Requested_Only
and then
Client.Written.Send_Blocked
) then -- Keep it blocked
Set (Listener.Ready_To_Read, Client.Socket);
else -- Unblock
Set (Listener.Write_Sockets, Client.Socket);
Set (Listener.Ready_To_Write, Client.Socket);
Status := Completed; -- Make sure it written later
Client.Written.Send_Blocked := False;
Client.Data_Sent := True;
if ( 0
/= ( Listener.Factory.Trace_Flags
and
(Trace_Encoded_Sent or Trace_Decoded_Sent)
) )
then
if Requested_Only then
Trace_Sending
( Listener.Factory.all,
Client.all,
True,
", some data to send"
);
else
Trace_Sending
( Listener.Factory.all,
Client.all,
True,
", blocking timeout expired"
);
end if;
end if;
end if;
end;
end if;
end loop;
end Unblock;
Exit_Error : exception;
begin
On_Worker_Start (Listener.all);
if Address.Port /= 0 then
Create_Socket (Listener.all, Server_Socket, Address);
if Server_Socket = No_Socket then
raise Exit_Error;
end if;
Set (Listener.Read_Sockets, Server_Socket);
end if;
Listener.Request.Activate;
loop
Trace_Service_Loop
( Listener.Factory.all,
Service_Loop_Begin,
Listener.all
);
if Listener.Shutdown_Request then
Listener.Shutdown_Request := False;
Check (Listener.Read_Sockets);
end if;
if Listener.Connect_Request then
declare
Client : Connection_Ptr;
begin
loop
Listener.Request.Get (Client);
exit when Client = null;
Set (Listener.Write_Sockets, Client.Socket);
Put (Listener.Connections, Client.Socket, Client);
declare
use Object;
Ptr : Entity_Ptr := Client.all'Unchecked_Access;
begin
Release (Ptr);
end;
Listener.Servers := Listener.Servers + 1;
Do_Connect (Listener.all, Client);
end loop;
end;
end if;
Copy (Listener.Read_Sockets, Listener.Ready_To_Read);
Copy (Listener.Write_Sockets, Listener.Ready_To_Write);
Check_Selector
( Selector => Listener.Selector,
R_Socket_Set => Listener.Ready_To_Read,
W_Socket_Set => Listener.Ready_To_Write,
Status => Status,
Timeout => Listener.IO_Timeout
);
exit when Listener.Finalizing;
if Status = Completed then
Trace_Service_Loop
( Listener.Factory.all,
Service_Loop_Reading,
Listener.all
);
loop -- Reading from sockets
Get (Listener.Ready_To_Read, Client_Socket);
exit when Client_Socket = No_Socket;
if Client_Socket = Server_Socket then
Accept_Socket
( Server_Socket,
Client_Socket,
Address
);
declare
Client : Connection_Ptr;
begin
Client :=
Create (Listener.Factory, Listener, Address);
if Client = null then
Close (Client_Socket);
else
declare
This : Connection'Class renames Client.all;
begin
This.Client := False;
This.Connect_No := 0;
This.Client_Address := Address;
This.Socket := Client_Socket;
This.Try_To_Reconnect := False;
Clear (This);
This.Socket_Listener :=
Listener.all'Unchecked_Access;
Set (Listener.Read_Sockets, Client_Socket);
Set (Listener.Write_Sockets, Client_Socket);
Put
( Listener.Connections,
Client_Socket,
Client
);
Listener.Clients := Listener.Clients + 1;
if not Is_Opportunistic (This) then
This.Transport :=
Create_Transport
( Listener.Factory,
Listener,
Client
);
end if;
if This.Transport = null then -- Ready
This.Session := Session_Connected;
Connected (This);
Connected (Listener.all, This);
This.Session := Session_Active;
Activated (This);
else
This.Session := Session_Handshaking;
end if;
end;
end if;
exception
when Connection_Error =>
if Client /= null then
Stop (Listener.all, Client);
end if;
when Error : others =>
Trace_Error
( Listener.Factory.all,
"Accept socket",
Error
);
if Client /= null then
Stop (Listener.all, Client);
end if;
end;
else
declare
Client : Connection_Ptr :=
Get (Listener.Connections, Client_Socket);
begin
if Client = null then
Trace
( Listener.Factory.all,
( "Missing client when reading from socket "
& Set_Image (Client_Socket)
) );
Clear (Listener.Read_Sockets, Client_Socket);
Clear (Listener.Write_Sockets, Client_Socket);
Clear (Listener.Blocked_Sockets, Client_Socket);
Clear (Listener.Ready_To_Write, Client_Socket);
elsif Client.Failed then
if ( Client.Session /= Session_Down
and then
Client.Action_Request = Keep_Connection
and then
( Exception_Identity (Client.Last_Error)
/= Connection_Error'Identity
) )
then
Trace_Error
( Listener.Factory.all,
"Preparing to receive",
Client.Last_Error
);
end if;
Stop (Listener.all, Client);
else
begin
Read (Client.all, Listener.Factory.all);
exception
when Connection_Error =>
Stop (Listener.all, Client);
when Error : Socket_Error =>
Send_Error (Client.all, Error);
Stop (Listener.all, Client);
when Error : others =>
Trace_Error
( Listener.Factory.all,
"Receive socket",
Error
);
Stop (Listener.all, Client);
end;
declare
Data_Left : Boolean;
begin
if Client /= null then
Process (Listener.all, Client, Data_Left);
if Data_Left then
Append
( Listener.Postponed,
Client,
Listener.Postponed_Count
);
end if;
end if;
exception
when Connection_Error =>
Stop (Listener.all, Client);
when Error : others =>
Trace_Error
( Listener.Factory.all,
"Processing received",
Error
);
Stop (Listener.all, Client);
end;
end if;
end;
end if;
end loop;
else
Empty (Listener.Ready_To_Read); -- Clear the set
end if;
Trace_Service_Loop
( Listener.Factory.all,
Service_Loop_Unblocking,
Listener.all
);
This_Time := Clock;
if This_Time - That_Time > Listener.Polling_Timeout then
-- Unblock everything now
That_Time := This_Time;
Unblock (False);
if ( Server_Socket /= No_Socket
and then
not Is_Set (Listener.Read_Sockets, Server_Socket)
)
then
Trace
( Listener.Factory.all,
"Server socket fell out of the read sockets list"
);
Set (Listener.Read_Sockets, Server_Socket);
end if;
else
-- Checking for explicit unblocking requests
while Listener.Unblock_Send loop
Listener.Unblock_Send := False;
Unblock (True); -- Still blocked are now in Ready_To_Read
Copy (Listener.Ready_To_Read, Listener.Blocked_Sockets);
Empty (Listener.Ready_To_Read); -- Clear the set
end loop;
end if;
if Status = Completed then
Trace_Service_Loop
( Listener.Factory.all,
Service_Loop_Writing,
Listener.all
);
loop -- Writing sockets
Get (Listener.Ready_To_Write, Client_Socket);
exit when Client_Socket = No_Socket;
if Client_Socket /= Server_Socket then
declare
Client : Connection_Ptr :=
Get (Listener.Connections, Client_Socket);
begin
if Client = null then
Trace
( Listener.Factory.all,
( "Missing client when writing to socket "
& Set_Image (Client_Socket)
) );
Clear (Listener.Read_Sockets, Client_Socket);
Clear (Listener.Write_Sockets, Client_Socket);
Clear (Listener.Blocked_Sockets, Client_Socket);
elsif Client.Failed then
if ( Client.Session /= Session_Down
and then
Client.Action_Request = Keep_Connection
and then
( Exception_Identity (Client.Last_Error)
/= Connection_Error'Identity
) )
then
Trace_Error
( Listener.Factory.all,
"Preparing to send",
Client.Last_Error
);
end if;
Stop (Listener.all, Client);
elsif Client.Session = Session_Connecting then
declare
This : Connection'Class renames Client.all;
Code : constant Error_Type :=
Get_Socket_Option
( Client.Socket,
Socket_Level,
Error
) .Error;
begin
if Code = Success then -- Connected
On_Connected (Listener.all, This);
Set
( Listener.Read_Sockets,
Client_Socket
);
else -- Connect error
Trace_Sending
( Listener.Factory.all,
This,
False,
( ", failed to connect to "
& Image (This.Client_Address)
& ": " & Image (Code)
) );
Connect_Error (This, Code);
Do_Connect (Listener.all, Client);
end if;
exception
when Connection_Error =>
if Client /= null then
Client.Try_To_Reconnect := False;
Stop (Listener.all, Client);
end if;
when Error : others =>
Trace_Error
( Listener.Factory.all,
"Connect socket",
Error
);
if Client /= null then
Client.Try_To_Reconnect := False;
Stop (Listener.all, Client);
end if;
end;
else -- Have space to write
declare
Block : Boolean;
begin
Write
( Client.all,
Listener.Factory.all,
Block
);
if ( Block
and then
not Client.Written.Send_Blocked
)
then
Client.Written.Send_Blocked := True;
Set
( Client.Socket_Listener.Blocked_Sockets,
Client.Socket
);
Clear
( Client.Socket_Listener.Write_Sockets,
Client.Socket
);
if ( 0
/= ( Listener.Factory.Trace_Flags
and
( Trace_Encoded_Sent
or Trace_Decoded_Sent
) ) )
then
Trace_Sending
( Listener.Factory.all,
Client.all,
False,
", nothing to send"
);
end if;
end if;
exception
when Connection_Error =>
Stop (Listener.all, Client);
when Error : Socket_Error =>
Send_Error (Client.all, Error);
Stop (Listener.all, Client);
when Error : others =>
Trace_Error
( Listener.Factory.all,
"Send socket",
Error
);
Stop (Listener.all, Client);
end;
begin
if Client /= null and then Client.Data_Sent
then
Data_Sent (Listener.all, Client);
end if;
exception
when Connection_Error =>
Stop (Listener.all, Client);
when Error : others =>
Trace_Error
( Listener.Factory.all,
"Processing sent notification",
Error
);
Stop (Listener.all, Client);
end;
end if;
end;
end if;
end loop;
else
Empty (Listener.Ready_To_Write); -- Clear the set
end if;
exit when Listener.Finalizing;
Trace_Service_Loop
( Listener.Factory.all,
Service_Loop_Postponed,
Listener.all
);
Service_Postponed (Listener.all);
end loop;
declare
Client : Connection_Ptr;
begin
loop
Listener.Request.Get (Client);
exit when Client = null;
declare
use Object;
Ptr : Entity_Ptr := Client.all'Unchecked_Access;
begin
Release (Ptr);
end;
end loop;
end;
Close (Server_Socket);
Trace (Listener.Factory.all, "Worker task exiting");
exception
when Exit_Error =>
Trace (Listener.Factory.all, "Worker task exiting");
when Error : others =>
Close (Server_Socket);
Trace_Error (Listener.Factory.all, "Worker task", Error);
end Worker;
protected body Box is
entry Connect (Client : Connection_Ptr)
when Active and then Pending = null is
begin
if Client /= null then
Pending := Client;
Client.Socket_Listener.Connect_Request := True;
Abort_Selector (Listener.Selector);
end if;
end Connect;
procedure Activate is
begin
Active := True;
end Activate;
procedure Get (Client : out Connection_Ptr) is
begin
if Pending = null then
Client := null;
else
Client := Pending;
Pending := null;
Client.Socket_Listener.Connect_Request := False;
end if;
end Get;
end Box;
end GNAT.Sockets.Server;
|
with Interfaces.C; use Interfaces.C;
with System;
private with GStreamer.GST_Low_Level.Gstreamer_0_10_Gst_Rtsp_Gstrtsptransport_H;
with Ada.Finalization;
package GStreamer.Rtsp.Transport is
type GstRTSPTransport_Record is tagged private;
type GstRTSPTransport is access all GstRTSPTransport_Record'Class;
type GstRTSPTransMode is
(UNKNOWN,
RTP,
RDT);
--*
-- * GstRTSPProfile:
-- * @PROFILE_UNKNOWN: invalid profile
-- * @PROFILE_AVP: the Audio/Visual profile
-- * @PROFILE_SAVP: the secure Audio/Visual profile
-- *
-- * The transfer profile to use.
--
type GstRTSPProfile is
(PROFILE_UNKNOWN,
PROFILE_AVP,
PROFILE_SAVP);
--*
-- * GstRTSPLowerTrans:
-- * @LOWER_TRANS_UNKNOWN: invalid transport flag
-- * @LOWER_TRANS_UDP: stream data over UDP
-- * @LOWER_TRANS_UDP_MCAST: stream data over UDP multicast
-- * @LOWER_TRANS_TCP: stream data over TCP
-- * @LOWER_TRANS_HTTP: stream data tunneled over HTTP. Since: 0.10.23
-- *
-- * The different transport methods.
--
subtype GstRTSPLowerTrans is Unsigned;
LOWER_TRANS_UNKNOWN : constant GstRTSPLowerTrans := 0;
LOWER_TRANS_UDP : constant GstRTSPLowerTrans := 1;
LOWER_TRANS_UDP_MCAST : constant GstRTSPLowerTrans := 2;
LOWER_TRANS_TCP : constant GstRTSPLowerTrans := 4;
LOWER_TRANS_HTTP : constant GstRTSPLowerTrans := 16;
function Get_Type return GLIB.GType;
type GstRTSPRange;
--subtype GstRTSPRange is u_GstRTSPRange;
--subtype GstRTSPTransport is u_GstRTSPTransport;
--*
-- * GstRTSPRange:
-- * @min: minimum value of the range
-- * @max: maximum value of the range
-- *
-- * A type to specify a range.
--
type GstRTSPRange is record
Min : aliased GLIB.Gint;
Max : aliased GLIB.Gint;
end record;
pragma Convention (C_Pass_By_Copy, GstRTSPRange);
procedure Parse (Str : String;
Transport : out GstRTSPTransport_Record);
function As_Text (Transport : GstRTSPTransport) return String;
function Get_Mime (Trans : GstRTSPTransMode) return String;
function Get_Manager
(Trans : GstRTSPTransMode;
Manager : System.Address;
Option : GLIB.Guint) return GstRTSPResult;
function Free (Transport : access GstRTSPTransport) return GstRTSPResult;
private
function Gst_New (Transport : System.Address) return GstRTSPResult;
function Init (Transport : access GstRTSPTransport) return GstRTSPResult;
type GstRTSPTransport_Record is new Ada.Finalization.Controlled with record
Data : access GStreamer.GST_Low_Level.Gstreamer_0_10_Gst_Rtsp_Gstrtsptransport_H.GstRTSPTransport;
end record;
procedure Initialize (Object : in out GstRTSPTransport_Record);
procedure Finalize (Object : in out GstRTSPTransport_Record);
end GStreamer.Rtsp.Transport;
|
-- { dg-do compile }
with Aggr16_Pkg; use Aggr16_Pkg;
package body Aggr16 is
type Arr is array (1 .. 4) of Time;
type Change_Type is (One, Two, Three);
type Change (D : Change_Type) is record
case D is
when Three =>
A : Arr;
when Others =>
B : Boolean;
end case;
end record;
procedure Proc is
C : Change (Three);
begin
C.A := (others => Null_Time);
end;
end Aggr16;
|
with Zstandard.Functions; use Zstandard.Functions;
with Ada.Text_IO; use Ada.Text_IO;
procedure Demo_Ada
is
message : constant String :=
"Lorem ipsum dolor sit amet, consectetur adipiscing elit. Vivamus " &
"tempor erat quis metus faucibus, a elementum odio varius. Donec " &
"ultrices posuere nisl. Aliquam molestie, nibh a ultrices dictum, " &
"neque nisi pellentesque sapien, a molestie urna quam eu leo. Morbi " &
"nec finibus odio, vel maximus lorem. Proin eget viverra tellus, eu " &
"vestibulum est. Aliquam pharetra vulputate porttitor. Integer eu " &
"varius dui. Vivamus non metus id metus cursus auctor. Integer erat " &
"augue, pharetra in nisl a, aliquet tempor leo.";
begin
Put_Line ("Zstandard version: " & Zstd_Version);
Put_Line ("");
Put_Line ("message:");
Put_Line (message);
declare
nominal : Boolean;
compacted : constant String := Compress (source_data => message,
successful => nominal,
quality => 1);
begin
if not nominal then
Put_Line ("FAILURE!");
Put_Line (compacted);
return;
end if;
Put_Line ("");
Put_Line (" original length:" & message'Length'Img);
Put_Line ("compressed length:" & compacted'Length'Img);
Put_Line ("");
Put_Line ("Testing decompression ...");
declare
vessel : String := Decompress (source_data => compacted,
successful => nominal);
begin
if not nominal then
Put_Line ("FAILURE!");
Put_Line (vessel);
return;
end if;
if message = vessel then
Put_Line ("SUCCESS! Decompressed text is the same as the original");
else
Put_Line ("ERROR! Return value different");
Put_Line (vessel);
end if;
end;
end;
end Demo_Ada;
|
-- Abstract :
--
-- Ada language specific indent options and functions
--
-- [1] ada.wy
-- [2] ada-indent-user-options.el
--
-- Copyright (C) 2017 - 2020 Free Software Foundation, Inc.
--
-- This library is free software; you can redistribute it and/or modify it
-- under terms of the GNU General Public License as published by the Free
-- Software Foundation; either version 3, or (at your option) any later
-- version. This library is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHAN-
-- TABILITY or FITNESS FOR A PARTICULAR PURPOSE.
-- As a special exception under Section 7 of GPL version 3, you are granted
-- additional permissions described in the GCC Runtime Library Exception,
-- version 3.1, as published by the Free Software Foundation.
pragma License (Modified_GPL);
package Wisi.Ada is
Language_Protocol_Version : constant String := "3";
-- Defines the data passed to Initialize in Params.
--
-- This value must match ada-mode.el
-- ada-wisi-language-protocol-version.
--
-- Only changes once per ada-mode release. Increment as soon as
-- required, record new version in NEWS-ada-mode.text.
-- Indent parameters from [2]
Ada_Indent : Integer := 3;
Ada_Indent_Broken : Integer := 2;
Ada_Indent_Comment_Col_0 : Boolean := False;
Ada_Indent_Comment_GNAT : Boolean := False;
Ada_Indent_Label : Integer := -3;
Ada_Indent_Record_Rel_Type : Integer := 3;
Ada_Indent_Renames : Integer := 2;
Ada_Indent_Return : Integer := 0;
Ada_Indent_Use : Integer := 2;
Ada_Indent_When : Integer := 3;
Ada_Indent_With : Integer := 2;
Ada_Indent_Hanging_Rel_Exp : Boolean := False;
-- Other parameters
End_Names_Optional : Boolean := False;
type Parse_Data_Type is new Wisi.Parse_Data_Type with null record;
overriding
procedure Initialize
(Data : in out Parse_Data_Type;
Lexer : in WisiToken.Lexer.Handle;
Descriptor : access constant WisiToken.Descriptor;
Base_Terminals : in WisiToken.Base_Token_Array_Access;
Post_Parse_Action : in Post_Parse_Action_Type;
Begin_Line : in WisiToken.Line_Number_Type;
End_Line : in WisiToken.Line_Number_Type;
Begin_Indent : in Integer;
Params : in String);
-- Call Wisi_Runtime.Initialize, then:
--
-- If Params /= "", set all language-specific parameters from Params,
-- in declaration order; otherwise keep default values. Boolean is
-- represented by 0 | 1. Parameter values are space delimited.
--
-- Also do any other initialization that Data needs.
overriding
function Indent_Hanging_1
(Data : in out Parse_Data_Type;
Tree : in WisiToken.Syntax_Trees.Tree;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array;
Tree_Indenting : in WisiToken.Syntax_Trees.Valid_Node_Index;
Indenting_Comment : in Boolean;
Delta_1 : in Simple_Indent_Param;
Delta_2 : in Simple_Indent_Param;
Option : in Boolean;
Accumulate : in Boolean)
return Delta_Type;
overriding
procedure Refactor
(Data : in out Parse_Data_Type;
Tree : in WisiToken.Syntax_Trees.Tree;
Action : in Positive;
Edit_Begin : in WisiToken.Buffer_Pos);
----------
-- The following are declared in ada.wy %elisp_indent, and must match
-- Language_Indent_Function.
function Ada_Indent_Aggregate
(Data : in out Wisi.Parse_Data_Type'Class;
Tree : in WisiToken.Syntax_Trees.Tree;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array;
Tree_Indenting : in WisiToken.Syntax_Trees.Valid_Node_Index;
Indenting_Comment : in Boolean;
Args : in Wisi.Indent_Arg_Arrays.Vector)
return Wisi.Delta_Type;
-- [1] ada-indent-aggregate
function Ada_Indent_Renames_0
(Data : in out Wisi.Parse_Data_Type'Class;
Tree : in WisiToken.Syntax_Trees.Tree;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array;
Tree_Indenting : in WisiToken.Syntax_Trees.Valid_Node_Index;
Indenting_Comment : in Boolean;
Args : in Wisi.Indent_Arg_Arrays.Vector)
return Wisi.Delta_Type;
-- [1] ada-indent-renames
function Ada_Indent_Return_0
(Data : in out Wisi.Parse_Data_Type'Class;
Tree : in WisiToken.Syntax_Trees.Tree;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array;
Tree_Indenting : in WisiToken.Syntax_Trees.Valid_Node_Index;
Indenting_Comment : in Boolean;
Args : in Wisi.Indent_Arg_Arrays.Vector)
return Wisi.Delta_Type;
-- [1] ada-indent-return
function Ada_Indent_Record_0
(Data : in out Wisi.Parse_Data_Type'Class;
Tree : in WisiToken.Syntax_Trees.Tree;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array;
Tree_Indenting : in WisiToken.Syntax_Trees.Valid_Node_Index;
Indenting_Comment : in Boolean;
Args : in Wisi.Indent_Arg_Arrays.Vector)
return Wisi.Delta_Type;
-- [1] ada-indent-record
function Ada_Indent_Record_1
(Data : in out Wisi.Parse_Data_Type'Class;
Tree : in WisiToken.Syntax_Trees.Tree;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array;
Tree_Indenting : in WisiToken.Syntax_Trees.Valid_Node_Index;
Indenting_Comment : in Boolean;
Args : in Wisi.Indent_Arg_Arrays.Vector)
return Wisi.Delta_Type;
-- [1] ada-indent-record*
end Wisi.Ada;
|
package App is
procedure Run_Local;
procedure Run_Remote;
end App;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S E M _ U T I L --
-- --
-- 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 Treepr; -- ???For debugging code below
with Aspects; use Aspects;
with Atree; use Atree;
with Casing; use Casing;
with Checks; use Checks;
with Debug; use Debug;
with Elists; use Elists;
with Errout; use Errout;
with Exp_Ch11; use Exp_Ch11;
with Exp_Disp; use Exp_Disp;
with Exp_Util; use Exp_Util;
with Fname; use Fname;
with Freeze; use Freeze;
with Lib; use Lib;
with Lib.Xref; use Lib.Xref;
with Namet.Sp; use Namet.Sp;
with Nlists; use Nlists;
with Nmake; use Nmake;
with Output; use Output;
with Restrict; use Restrict;
with Rident; use Rident;
with Rtsfind; use Rtsfind;
with Sem; use Sem;
with Sem_Aux; use Sem_Aux;
with Sem_Attr; use Sem_Attr;
with Sem_Ch6; use Sem_Ch6;
with Sem_Ch8; use Sem_Ch8;
with Sem_Disp; use Sem_Disp;
with Sem_Eval; use Sem_Eval;
with Sem_Prag; use Sem_Prag;
with Sem_Res; use Sem_Res;
with Sem_Warn; use Sem_Warn;
with Sem_Type; use Sem_Type;
with Sinfo; use Sinfo;
with Sinput; use Sinput;
with Stand; use Stand;
with Style;
with Stringt; use Stringt;
with Targparm; use Targparm;
with Tbuild; use Tbuild;
with Ttypes; use Ttypes;
with Uname; use Uname;
with GNAT.HTable; use GNAT.HTable;
package body Sem_Util is
-----------------------
-- Local Subprograms --
-----------------------
function Build_Component_Subtype
(C : List_Id;
Loc : Source_Ptr;
T : Entity_Id) return Node_Id;
-- This function builds the subtype for Build_Actual_Subtype_Of_Component
-- and Build_Discriminal_Subtype_Of_Component. C is a list of constraints,
-- Loc is the source location, T is the original subtype.
function Has_Enabled_Property
(Item_Id : Entity_Id;
Property : Name_Id) return Boolean;
-- Subsidiary to routines Async_xxx_Enabled and Effective_xxx_Enabled.
-- Determine whether an abstract state or a variable denoted by entity
-- Item_Id has enabled property Property.
function Has_Null_Extension (T : Entity_Id) return Boolean;
-- T is a derived tagged type. Check whether the type extension is null.
-- If the parent type is fully initialized, T can be treated as such.
function Is_Fully_Initialized_Variant (Typ : Entity_Id) return Boolean;
-- Subsidiary to Is_Fully_Initialized_Type. For an unconstrained type
-- with discriminants whose default values are static, examine only the
-- components in the selected variant to determine whether all of them
-- have a default.
function Old_Requires_Transient_Scope (Id : Entity_Id) return Boolean;
function New_Requires_Transient_Scope (Id : Entity_Id) return Boolean;
-- ???We retain the old and new algorithms for Requires_Transient_Scope for
-- the time being. New_Requires_Transient_Scope is used by default; the
-- debug switch -gnatdQ can be used to do Old_Requires_Transient_Scope
-- instead. The intent is to use this temporarily to measure before/after
-- efficiency. Note: when this temporary code is removed, the documentation
-- of dQ in debug.adb should be removed.
procedure Results_Differ
(Id : Entity_Id;
Old_Val : Boolean;
New_Val : Boolean);
-- ???Debugging code. Called when the Old_Val and New_Val differ. This
-- routine will be removed eventially when New_Requires_Transient_Scope
-- becomes Requires_Transient_Scope and Old_Requires_Transient_Scope is
-- eliminated.
------------------------------
-- Abstract_Interface_List --
------------------------------
function Abstract_Interface_List (Typ : Entity_Id) return List_Id is
Nod : Node_Id;
begin
if Is_Concurrent_Type (Typ) then
-- If we are dealing with a synchronized subtype, go to the base
-- type, whose declaration has the interface list.
-- Shouldn't this be Declaration_Node???
Nod := Parent (Base_Type (Typ));
if Nkind (Nod) = N_Full_Type_Declaration then
return Empty_List;
end if;
elsif Ekind (Typ) = E_Record_Type_With_Private then
if Nkind (Parent (Typ)) = N_Full_Type_Declaration then
Nod := Type_Definition (Parent (Typ));
elsif Nkind (Parent (Typ)) = N_Private_Type_Declaration then
if Present (Full_View (Typ))
and then
Nkind (Parent (Full_View (Typ))) = N_Full_Type_Declaration
then
Nod := Type_Definition (Parent (Full_View (Typ)));
-- If the full-view is not available we cannot do anything else
-- here (the source has errors).
else
return Empty_List;
end if;
-- Support for generic formals with interfaces is still missing ???
elsif Nkind (Parent (Typ)) = N_Formal_Type_Declaration then
return Empty_List;
else
pragma Assert
(Nkind (Parent (Typ)) = N_Private_Extension_Declaration);
Nod := Parent (Typ);
end if;
elsif Ekind (Typ) = E_Record_Subtype then
Nod := Type_Definition (Parent (Etype (Typ)));
elsif Ekind (Typ) = E_Record_Subtype_With_Private then
-- Recurse, because parent may still be a private extension. Also
-- note that the full view of the subtype or the full view of its
-- base type may (both) be unavailable.
return Abstract_Interface_List (Etype (Typ));
else pragma Assert ((Ekind (Typ)) = E_Record_Type);
if Nkind (Parent (Typ)) = N_Formal_Type_Declaration then
Nod := Formal_Type_Definition (Parent (Typ));
else
Nod := Type_Definition (Parent (Typ));
end if;
end if;
return Interface_List (Nod);
end Abstract_Interface_List;
--------------------------------
-- Add_Access_Type_To_Process --
--------------------------------
procedure Add_Access_Type_To_Process (E : Entity_Id; A : Entity_Id) is
L : Elist_Id;
begin
Ensure_Freeze_Node (E);
L := Access_Types_To_Process (Freeze_Node (E));
if No (L) then
L := New_Elmt_List;
Set_Access_Types_To_Process (Freeze_Node (E), L);
end if;
Append_Elmt (A, L);
end Add_Access_Type_To_Process;
--------------------------
-- Add_Block_Identifier --
--------------------------
procedure Add_Block_Identifier (N : Node_Id; Id : out Entity_Id) is
Loc : constant Source_Ptr := Sloc (N);
begin
pragma Assert (Nkind (N) = N_Block_Statement);
-- The block already has a label, return its entity
if Present (Identifier (N)) then
Id := Entity (Identifier (N));
-- Create a new block label and set its attributes
else
Id := New_Internal_Entity (E_Block, Current_Scope, Loc, 'B');
Set_Etype (Id, Standard_Void_Type);
Set_Parent (Id, N);
Set_Identifier (N, New_Occurrence_Of (Id, Loc));
Set_Block_Node (Id, Identifier (N));
end if;
end Add_Block_Identifier;
----------------------------
-- Add_Global_Declaration --
----------------------------
procedure Add_Global_Declaration (N : Node_Id) is
Aux_Node : constant Node_Id := Aux_Decls_Node (Cunit (Current_Sem_Unit));
begin
if No (Declarations (Aux_Node)) then
Set_Declarations (Aux_Node, New_List);
end if;
Append_To (Declarations (Aux_Node), N);
Analyze (N);
end Add_Global_Declaration;
--------------------------------
-- Address_Integer_Convert_OK --
--------------------------------
function Address_Integer_Convert_OK (T1, T2 : Entity_Id) return Boolean is
begin
if Allow_Integer_Address
and then ((Is_Descendant_Of_Address (T1)
and then Is_Private_Type (T1)
and then Is_Integer_Type (T2))
or else
(Is_Descendant_Of_Address (T2)
and then Is_Private_Type (T2)
and then Is_Integer_Type (T1)))
then
return True;
else
return False;
end if;
end Address_Integer_Convert_OK;
-------------------
-- Address_Value --
-------------------
function Address_Value (N : Node_Id) return Node_Id is
Expr : Node_Id := N;
begin
loop
-- For constant, get constant expression
if Is_Entity_Name (Expr)
and then Ekind (Entity (Expr)) = E_Constant
then
Expr := Constant_Value (Entity (Expr));
-- For unchecked conversion, get result to convert
elsif Nkind (Expr) = N_Unchecked_Type_Conversion then
Expr := Expression (Expr);
-- For (common case) of To_Address call, get argument
elsif Nkind (Expr) = N_Function_Call
and then Is_Entity_Name (Name (Expr))
and then Is_RTE (Entity (Name (Expr)), RE_To_Address)
then
Expr := First (Parameter_Associations (Expr));
if Nkind (Expr) = N_Parameter_Association then
Expr := Explicit_Actual_Parameter (Expr);
end if;
-- We finally have the real expression
else
exit;
end if;
end loop;
return Expr;
end Address_Value;
-----------------
-- Addressable --
-----------------
-- For now, just 8/16/32/64
function Addressable (V : Uint) return Boolean is
begin
return V = Uint_8 or else
V = Uint_16 or else
V = Uint_32 or else
V = Uint_64;
end Addressable;
function Addressable (V : Int) return Boolean is
begin
return V = 8 or else
V = 16 or else
V = 32 or else
V = 64;
end Addressable;
---------------------------------
-- Aggregate_Constraint_Checks --
---------------------------------
procedure Aggregate_Constraint_Checks
(Exp : Node_Id;
Check_Typ : Entity_Id)
is
Exp_Typ : constant Entity_Id := Etype (Exp);
begin
if Raises_Constraint_Error (Exp) then
return;
end if;
-- Ada 2005 (AI-230): Generate a conversion to an anonymous access
-- component's type to force the appropriate accessibility checks.
-- Ada 2005 (AI-231): Generate conversion to the null-excluding type to
-- force the corresponding run-time check
if Is_Access_Type (Check_Typ)
and then Is_Local_Anonymous_Access (Check_Typ)
then
Rewrite (Exp, Convert_To (Check_Typ, Relocate_Node (Exp)));
Analyze_And_Resolve (Exp, Check_Typ);
Check_Unset_Reference (Exp);
end if;
-- What follows is really expansion activity, so check that expansion
-- is on and is allowed. In GNATprove mode, we also want check flags to
-- be added in the tree, so that the formal verification can rely on
-- those to be present. In GNATprove mode for formal verification, some
-- treatment typically only done during expansion needs to be performed
-- on the tree, but it should not be applied inside generics. Otherwise,
-- this breaks the name resolution mechanism for generic instances.
if not Expander_Active
and (Inside_A_Generic or not Full_Analysis or not GNATprove_Mode)
then
return;
end if;
if Is_Access_Type (Check_Typ)
and then Can_Never_Be_Null (Check_Typ)
and then not Can_Never_Be_Null (Exp_Typ)
then
Install_Null_Excluding_Check (Exp);
end if;
-- First check if we have to insert discriminant checks
if Has_Discriminants (Exp_Typ) then
Apply_Discriminant_Check (Exp, Check_Typ);
-- Next emit length checks for array aggregates
elsif Is_Array_Type (Exp_Typ) then
Apply_Length_Check (Exp, Check_Typ);
-- Finally emit scalar and string checks. If we are dealing with a
-- scalar literal we need to check by hand because the Etype of
-- literals is not necessarily correct.
elsif Is_Scalar_Type (Exp_Typ)
and then Compile_Time_Known_Value (Exp)
then
if Is_Out_Of_Range (Exp, Base_Type (Check_Typ)) then
Apply_Compile_Time_Constraint_Error
(Exp, "value not in range of}??", CE_Range_Check_Failed,
Ent => Base_Type (Check_Typ),
Typ => Base_Type (Check_Typ));
elsif Is_Out_Of_Range (Exp, Check_Typ) then
Apply_Compile_Time_Constraint_Error
(Exp, "value not in range of}??", CE_Range_Check_Failed,
Ent => Check_Typ,
Typ => Check_Typ);
elsif not Range_Checks_Suppressed (Check_Typ) then
Apply_Scalar_Range_Check (Exp, Check_Typ);
end if;
-- Verify that target type is also scalar, to prevent view anomalies
-- in instantiations.
elsif (Is_Scalar_Type (Exp_Typ)
or else Nkind (Exp) = N_String_Literal)
and then Is_Scalar_Type (Check_Typ)
and then Exp_Typ /= Check_Typ
then
if Is_Entity_Name (Exp)
and then Ekind (Entity (Exp)) = E_Constant
then
-- If expression is a constant, it is worthwhile checking whether
-- it is a bound of the type.
if (Is_Entity_Name (Type_Low_Bound (Check_Typ))
and then Entity (Exp) = Entity (Type_Low_Bound (Check_Typ)))
or else
(Is_Entity_Name (Type_High_Bound (Check_Typ))
and then Entity (Exp) = Entity (Type_High_Bound (Check_Typ)))
then
return;
else
Rewrite (Exp, Convert_To (Check_Typ, Relocate_Node (Exp)));
Analyze_And_Resolve (Exp, Check_Typ);
Check_Unset_Reference (Exp);
end if;
-- Could use a comment on this case ???
else
Rewrite (Exp, Convert_To (Check_Typ, Relocate_Node (Exp)));
Analyze_And_Resolve (Exp, Check_Typ);
Check_Unset_Reference (Exp);
end if;
end if;
end Aggregate_Constraint_Checks;
-----------------------
-- Alignment_In_Bits --
-----------------------
function Alignment_In_Bits (E : Entity_Id) return Uint is
begin
return Alignment (E) * System_Storage_Unit;
end Alignment_In_Bits;
--------------------------------------
-- All_Composite_Constraints_Static --
--------------------------------------
function All_Composite_Constraints_Static
(Constr : Node_Id) return Boolean
is
begin
if No (Constr) or else Error_Posted (Constr) then
return True;
end if;
case Nkind (Constr) is
when N_Subexpr =>
if Nkind (Constr) in N_Has_Entity
and then Present (Entity (Constr))
then
if Is_Type (Entity (Constr)) then
return
not Is_Discrete_Type (Entity (Constr))
or else Is_OK_Static_Subtype (Entity (Constr));
end if;
elsif Nkind (Constr) = N_Range then
return
Is_OK_Static_Expression (Low_Bound (Constr))
and then
Is_OK_Static_Expression (High_Bound (Constr));
elsif Nkind (Constr) = N_Attribute_Reference
and then Attribute_Name (Constr) = Name_Range
then
return
Is_OK_Static_Expression
(Type_Low_Bound (Etype (Prefix (Constr))))
and then
Is_OK_Static_Expression
(Type_High_Bound (Etype (Prefix (Constr))));
end if;
return
not Present (Etype (Constr)) -- previous error
or else not Is_Discrete_Type (Etype (Constr))
or else Is_OK_Static_Expression (Constr);
when N_Discriminant_Association =>
return All_Composite_Constraints_Static (Expression (Constr));
when N_Range_Constraint =>
return
All_Composite_Constraints_Static (Range_Expression (Constr));
when N_Index_Or_Discriminant_Constraint =>
declare
One_Cstr : Entity_Id;
begin
One_Cstr := First (Constraints (Constr));
while Present (One_Cstr) loop
if not All_Composite_Constraints_Static (One_Cstr) then
return False;
end if;
Next (One_Cstr);
end loop;
end;
return True;
when N_Subtype_Indication =>
return
All_Composite_Constraints_Static (Subtype_Mark (Constr))
and then
All_Composite_Constraints_Static (Constraint (Constr));
when others =>
raise Program_Error;
end case;
end All_Composite_Constraints_Static;
---------------------------------
-- Append_Inherited_Subprogram --
---------------------------------
procedure Append_Inherited_Subprogram (S : Entity_Id) is
Par : constant Entity_Id := Alias (S);
-- The parent subprogram
Scop : constant Entity_Id := Scope (Par);
-- The scope of definition of the parent subprogram
Typ : constant Entity_Id := Defining_Entity (Parent (S));
-- The derived type of which S is a primitive operation
Decl : Node_Id;
Next_E : Entity_Id;
begin
if Ekind (Current_Scope) = E_Package
and then In_Private_Part (Current_Scope)
and then Has_Private_Declaration (Typ)
and then Is_Tagged_Type (Typ)
and then Scop = Current_Scope
then
-- The inherited operation is available at the earliest place after
-- the derived type declaration ( RM 7.3.1 (6/1)). This is only
-- relevant for type extensions. If the parent operation appears
-- after the type extension, the operation is not visible.
Decl := First
(Visible_Declarations
(Package_Specification (Current_Scope)));
while Present (Decl) loop
if Nkind (Decl) = N_Private_Extension_Declaration
and then Defining_Entity (Decl) = Typ
then
if Sloc (Decl) > Sloc (Par) then
Next_E := Next_Entity (Par);
Set_Next_Entity (Par, S);
Set_Next_Entity (S, Next_E);
return;
else
exit;
end if;
end if;
Next (Decl);
end loop;
end if;
-- If partial view is not a type extension, or it appears before the
-- subprogram declaration, insert normally at end of entity list.
Append_Entity (S, Current_Scope);
end Append_Inherited_Subprogram;
-----------------------------------------
-- Apply_Compile_Time_Constraint_Error --
-----------------------------------------
procedure Apply_Compile_Time_Constraint_Error
(N : Node_Id;
Msg : String;
Reason : RT_Exception_Code;
Ent : Entity_Id := Empty;
Typ : Entity_Id := Empty;
Loc : Source_Ptr := No_Location;
Rep : Boolean := True;
Warn : Boolean := False)
is
Stat : constant Boolean := Is_Static_Expression (N);
R_Stat : constant Node_Id :=
Make_Raise_Constraint_Error (Sloc (N), Reason => Reason);
Rtyp : Entity_Id;
begin
if No (Typ) then
Rtyp := Etype (N);
else
Rtyp := Typ;
end if;
Discard_Node
(Compile_Time_Constraint_Error (N, Msg, Ent, Loc, Warn => Warn));
-- In GNATprove mode, do not replace the node with an exception raised.
-- In such a case, either the call to Compile_Time_Constraint_Error
-- issues an error which stops analysis, or it issues a warning in
-- a few cases where a suitable check flag is set for GNATprove to
-- generate a check message.
if not Rep or GNATprove_Mode then
return;
end if;
-- Now we replace the node by an N_Raise_Constraint_Error node
-- This does not need reanalyzing, so set it as analyzed now.
Rewrite (N, R_Stat);
Set_Analyzed (N, True);
Set_Etype (N, Rtyp);
Set_Raises_Constraint_Error (N);
-- Now deal with possible local raise handling
Possible_Local_Raise (N, Standard_Constraint_Error);
-- If the original expression was marked as static, the result is
-- still marked as static, but the Raises_Constraint_Error flag is
-- always set so that further static evaluation is not attempted.
if Stat then
Set_Is_Static_Expression (N);
end if;
end Apply_Compile_Time_Constraint_Error;
---------------------------
-- Async_Readers_Enabled --
---------------------------
function Async_Readers_Enabled (Id : Entity_Id) return Boolean is
begin
return Has_Enabled_Property (Id, Name_Async_Readers);
end Async_Readers_Enabled;
---------------------------
-- Async_Writers_Enabled --
---------------------------
function Async_Writers_Enabled (Id : Entity_Id) return Boolean is
begin
return Has_Enabled_Property (Id, Name_Async_Writers);
end Async_Writers_Enabled;
--------------------------------------
-- Available_Full_View_Of_Component --
--------------------------------------
function Available_Full_View_Of_Component (T : Entity_Id) return Boolean is
ST : constant Entity_Id := Scope (T);
SCT : constant Entity_Id := Scope (Component_Type (T));
begin
return In_Open_Scopes (ST)
and then In_Open_Scopes (SCT)
and then Scope_Depth (ST) >= Scope_Depth (SCT);
end Available_Full_View_Of_Component;
-------------------
-- Bad_Attribute --
-------------------
procedure Bad_Attribute
(N : Node_Id;
Nam : Name_Id;
Warn : Boolean := False)
is
begin
Error_Msg_Warn := Warn;
Error_Msg_N ("unrecognized attribute&<<", N);
-- Check for possible misspelling
Error_Msg_Name_1 := First_Attribute_Name;
while Error_Msg_Name_1 <= Last_Attribute_Name loop
if Is_Bad_Spelling_Of (Nam, Error_Msg_Name_1) then
Error_Msg_N -- CODEFIX
("\possible misspelling of %<<", N);
exit;
end if;
Error_Msg_Name_1 := Error_Msg_Name_1 + 1;
end loop;
end Bad_Attribute;
--------------------------------
-- Bad_Predicated_Subtype_Use --
--------------------------------
procedure Bad_Predicated_Subtype_Use
(Msg : String;
N : Node_Id;
Typ : Entity_Id;
Suggest_Static : Boolean := False)
is
Gen : Entity_Id;
begin
-- Avoid cascaded errors
if Error_Posted (N) then
return;
end if;
if Inside_A_Generic then
Gen := Current_Scope;
while Present (Gen) and then Ekind (Gen) /= E_Generic_Package loop
Gen := Scope (Gen);
end loop;
if No (Gen) then
return;
end if;
if Is_Generic_Formal (Typ) and then Is_Discrete_Type (Typ) then
Set_No_Predicate_On_Actual (Typ);
end if;
elsif Has_Predicates (Typ) then
if Is_Generic_Actual_Type (Typ) then
-- The restriction on loop parameters is only that the type
-- should have no dynamic predicates.
if Nkind (Parent (N)) = N_Loop_Parameter_Specification
and then not Has_Dynamic_Predicate_Aspect (Typ)
and then Is_OK_Static_Subtype (Typ)
then
return;
end if;
Gen := Current_Scope;
while not Is_Generic_Instance (Gen) loop
Gen := Scope (Gen);
end loop;
pragma Assert (Present (Gen));
if Ekind (Gen) = E_Package and then In_Package_Body (Gen) then
Error_Msg_Warn := SPARK_Mode /= On;
Error_Msg_FE (Msg & "<<", N, Typ);
Error_Msg_F ("\Program_Error [<<", N);
Insert_Action (N,
Make_Raise_Program_Error (Sloc (N),
Reason => PE_Bad_Predicated_Generic_Type));
else
Error_Msg_FE (Msg & "<<", N, Typ);
end if;
else
Error_Msg_FE (Msg, N, Typ);
end if;
-- Emit an optional suggestion on how to remedy the error if the
-- context warrants it.
if Suggest_Static and then Has_Static_Predicate (Typ) then
Error_Msg_FE ("\predicate of & should be marked static", N, Typ);
end if;
end if;
end Bad_Predicated_Subtype_Use;
-----------------------------------------
-- Bad_Unordered_Enumeration_Reference --
-----------------------------------------
function Bad_Unordered_Enumeration_Reference
(N : Node_Id;
T : Entity_Id) return Boolean
is
begin
return Is_Enumeration_Type (T)
and then Warn_On_Unordered_Enumeration_Type
and then not Is_Generic_Type (T)
and then Comes_From_Source (N)
and then not Has_Pragma_Ordered (T)
and then not In_Same_Extended_Unit (N, T);
end Bad_Unordered_Enumeration_Reference;
--------------------------
-- Build_Actual_Subtype --
--------------------------
function Build_Actual_Subtype
(T : Entity_Id;
N : Node_Or_Entity_Id) return Node_Id
is
Loc : Source_Ptr;
-- Normally Sloc (N), but may point to corresponding body in some cases
Constraints : List_Id;
Decl : Node_Id;
Discr : Entity_Id;
Hi : Node_Id;
Lo : Node_Id;
Subt : Entity_Id;
Disc_Type : Entity_Id;
Obj : Node_Id;
begin
Loc := Sloc (N);
if Nkind (N) = N_Defining_Identifier then
Obj := New_Occurrence_Of (N, Loc);
-- If this is a formal parameter of a subprogram declaration, and
-- we are compiling the body, we want the declaration for the
-- actual subtype to carry the source position of the body, to
-- prevent anomalies in gdb when stepping through the code.
if Is_Formal (N) then
declare
Decl : constant Node_Id := Unit_Declaration_Node (Scope (N));
begin
if Nkind (Decl) = N_Subprogram_Declaration
and then Present (Corresponding_Body (Decl))
then
Loc := Sloc (Corresponding_Body (Decl));
end if;
end;
end if;
else
Obj := N;
end if;
if Is_Array_Type (T) then
Constraints := New_List;
for J in 1 .. Number_Dimensions (T) loop
-- Build an array subtype declaration with the nominal subtype and
-- the bounds of the actual. Add the declaration in front of the
-- local declarations for the subprogram, for analysis before any
-- reference to the formal in the body.
Lo :=
Make_Attribute_Reference (Loc,
Prefix =>
Duplicate_Subexpr_No_Checks (Obj, Name_Req => True),
Attribute_Name => Name_First,
Expressions => New_List (
Make_Integer_Literal (Loc, J)));
Hi :=
Make_Attribute_Reference (Loc,
Prefix =>
Duplicate_Subexpr_No_Checks (Obj, Name_Req => True),
Attribute_Name => Name_Last,
Expressions => New_List (
Make_Integer_Literal (Loc, J)));
Append (Make_Range (Loc, Lo, Hi), Constraints);
end loop;
-- If the type has unknown discriminants there is no constrained
-- subtype to build. This is never called for a formal or for a
-- lhs, so returning the type is ok ???
elsif Has_Unknown_Discriminants (T) then
return T;
else
Constraints := New_List;
-- Type T is a generic derived type, inherit the discriminants from
-- the parent type.
if Is_Private_Type (T)
and then No (Full_View (T))
-- T was flagged as an error if it was declared as a formal
-- derived type with known discriminants. In this case there
-- is no need to look at the parent type since T already carries
-- its own discriminants.
and then not Error_Posted (T)
then
Disc_Type := Etype (Base_Type (T));
else
Disc_Type := T;
end if;
Discr := First_Discriminant (Disc_Type);
while Present (Discr) loop
Append_To (Constraints,
Make_Selected_Component (Loc,
Prefix =>
Duplicate_Subexpr_No_Checks (Obj),
Selector_Name => New_Occurrence_Of (Discr, Loc)));
Next_Discriminant (Discr);
end loop;
end if;
Subt := Make_Temporary (Loc, 'S', Related_Node => N);
Set_Is_Internal (Subt);
Decl :=
Make_Subtype_Declaration (Loc,
Defining_Identifier => Subt,
Subtype_Indication =>
Make_Subtype_Indication (Loc,
Subtype_Mark => New_Occurrence_Of (T, Loc),
Constraint =>
Make_Index_Or_Discriminant_Constraint (Loc,
Constraints => Constraints)));
Mark_Rewrite_Insertion (Decl);
return Decl;
end Build_Actual_Subtype;
---------------------------------------
-- Build_Actual_Subtype_Of_Component --
---------------------------------------
function Build_Actual_Subtype_Of_Component
(T : Entity_Id;
N : Node_Id) return Node_Id
is
Loc : constant Source_Ptr := Sloc (N);
P : constant Node_Id := Prefix (N);
D : Elmt_Id;
Id : Node_Id;
Index_Typ : Entity_Id;
Desig_Typ : Entity_Id;
-- This is either a copy of T, or if T is an access type, then it is
-- the directly designated type of this access type.
function Build_Actual_Array_Constraint return List_Id;
-- If one or more of the bounds of the component depends on
-- discriminants, build actual constraint using the discriminants
-- of the prefix.
function Build_Actual_Record_Constraint return List_Id;
-- Similar to previous one, for discriminated components constrained
-- by the discriminant of the enclosing object.
-----------------------------------
-- Build_Actual_Array_Constraint --
-----------------------------------
function Build_Actual_Array_Constraint return List_Id is
Constraints : constant List_Id := New_List;
Indx : Node_Id;
Hi : Node_Id;
Lo : Node_Id;
Old_Hi : Node_Id;
Old_Lo : Node_Id;
begin
Indx := First_Index (Desig_Typ);
while Present (Indx) loop
Old_Lo := Type_Low_Bound (Etype (Indx));
Old_Hi := Type_High_Bound (Etype (Indx));
if Denotes_Discriminant (Old_Lo) then
Lo :=
Make_Selected_Component (Loc,
Prefix => New_Copy_Tree (P),
Selector_Name => New_Occurrence_Of (Entity (Old_Lo), Loc));
else
Lo := New_Copy_Tree (Old_Lo);
-- The new bound will be reanalyzed in the enclosing
-- declaration. For literal bounds that come from a type
-- declaration, the type of the context must be imposed, so
-- insure that analysis will take place. For non-universal
-- types this is not strictly necessary.
Set_Analyzed (Lo, False);
end if;
if Denotes_Discriminant (Old_Hi) then
Hi :=
Make_Selected_Component (Loc,
Prefix => New_Copy_Tree (P),
Selector_Name => New_Occurrence_Of (Entity (Old_Hi), Loc));
else
Hi := New_Copy_Tree (Old_Hi);
Set_Analyzed (Hi, False);
end if;
Append (Make_Range (Loc, Lo, Hi), Constraints);
Next_Index (Indx);
end loop;
return Constraints;
end Build_Actual_Array_Constraint;
------------------------------------
-- Build_Actual_Record_Constraint --
------------------------------------
function Build_Actual_Record_Constraint return List_Id is
Constraints : constant List_Id := New_List;
D : Elmt_Id;
D_Val : Node_Id;
begin
D := First_Elmt (Discriminant_Constraint (Desig_Typ));
while Present (D) loop
if Denotes_Discriminant (Node (D)) then
D_Val := Make_Selected_Component (Loc,
Prefix => New_Copy_Tree (P),
Selector_Name => New_Occurrence_Of (Entity (Node (D)), Loc));
else
D_Val := New_Copy_Tree (Node (D));
end if;
Append (D_Val, Constraints);
Next_Elmt (D);
end loop;
return Constraints;
end Build_Actual_Record_Constraint;
-- Start of processing for Build_Actual_Subtype_Of_Component
begin
-- Why the test for Spec_Expression mode here???
if In_Spec_Expression then
return Empty;
-- More comments for the rest of this body would be good ???
elsif Nkind (N) = N_Explicit_Dereference then
if Is_Composite_Type (T)
and then not Is_Constrained (T)
and then not (Is_Class_Wide_Type (T)
and then Is_Constrained (Root_Type (T)))
and then not Has_Unknown_Discriminants (T)
then
-- If the type of the dereference is already constrained, it is an
-- actual subtype.
if Is_Array_Type (Etype (N))
and then Is_Constrained (Etype (N))
then
return Empty;
else
Remove_Side_Effects (P);
return Build_Actual_Subtype (T, N);
end if;
else
return Empty;
end if;
end if;
if Ekind (T) = E_Access_Subtype then
Desig_Typ := Designated_Type (T);
else
Desig_Typ := T;
end if;
if Ekind (Desig_Typ) = E_Array_Subtype then
Id := First_Index (Desig_Typ);
while Present (Id) loop
Index_Typ := Underlying_Type (Etype (Id));
if Denotes_Discriminant (Type_Low_Bound (Index_Typ))
or else
Denotes_Discriminant (Type_High_Bound (Index_Typ))
then
Remove_Side_Effects (P);
return
Build_Component_Subtype
(Build_Actual_Array_Constraint, Loc, Base_Type (T));
end if;
Next_Index (Id);
end loop;
elsif Is_Composite_Type (Desig_Typ)
and then Has_Discriminants (Desig_Typ)
and then not Has_Unknown_Discriminants (Desig_Typ)
then
if Is_Private_Type (Desig_Typ)
and then No (Discriminant_Constraint (Desig_Typ))
then
Desig_Typ := Full_View (Desig_Typ);
end if;
D := First_Elmt (Discriminant_Constraint (Desig_Typ));
while Present (D) loop
if Denotes_Discriminant (Node (D)) then
Remove_Side_Effects (P);
return
Build_Component_Subtype (
Build_Actual_Record_Constraint, Loc, Base_Type (T));
end if;
Next_Elmt (D);
end loop;
end if;
-- If none of the above, the actual and nominal subtypes are the same
return Empty;
end Build_Actual_Subtype_Of_Component;
-----------------------------
-- Build_Component_Subtype --
-----------------------------
function Build_Component_Subtype
(C : List_Id;
Loc : Source_Ptr;
T : Entity_Id) return Node_Id
is
Subt : Entity_Id;
Decl : Node_Id;
begin
-- Unchecked_Union components do not require component subtypes
if Is_Unchecked_Union (T) then
return Empty;
end if;
Subt := Make_Temporary (Loc, 'S');
Set_Is_Internal (Subt);
Decl :=
Make_Subtype_Declaration (Loc,
Defining_Identifier => Subt,
Subtype_Indication =>
Make_Subtype_Indication (Loc,
Subtype_Mark => New_Occurrence_Of (Base_Type (T), Loc),
Constraint =>
Make_Index_Or_Discriminant_Constraint (Loc,
Constraints => C)));
Mark_Rewrite_Insertion (Decl);
return Decl;
end Build_Component_Subtype;
---------------------------
-- Build_Default_Subtype --
---------------------------
function Build_Default_Subtype
(T : Entity_Id;
N : Node_Id) return Entity_Id
is
Loc : constant Source_Ptr := Sloc (N);
Disc : Entity_Id;
Bas : Entity_Id;
-- The base type that is to be constrained by the defaults
begin
if not Has_Discriminants (T) or else Is_Constrained (T) then
return T;
end if;
Bas := Base_Type (T);
-- If T is non-private but its base type is private, this is the
-- completion of a subtype declaration whose parent type is private
-- (see Complete_Private_Subtype in Sem_Ch3). The proper discriminants
-- are to be found in the full view of the base. Check that the private
-- status of T and its base differ.
if Is_Private_Type (Bas)
and then not Is_Private_Type (T)
and then Present (Full_View (Bas))
then
Bas := Full_View (Bas);
end if;
Disc := First_Discriminant (T);
if No (Discriminant_Default_Value (Disc)) then
return T;
end if;
declare
Act : constant Entity_Id := Make_Temporary (Loc, 'S');
Constraints : constant List_Id := New_List;
Decl : Node_Id;
begin
while Present (Disc) loop
Append_To (Constraints,
New_Copy_Tree (Discriminant_Default_Value (Disc)));
Next_Discriminant (Disc);
end loop;
Decl :=
Make_Subtype_Declaration (Loc,
Defining_Identifier => Act,
Subtype_Indication =>
Make_Subtype_Indication (Loc,
Subtype_Mark => New_Occurrence_Of (Bas, Loc),
Constraint =>
Make_Index_Or_Discriminant_Constraint (Loc,
Constraints => Constraints)));
Insert_Action (N, Decl);
-- If the context is a component declaration the subtype declaration
-- will be analyzed when the enclosing type is frozen, otherwise do
-- it now.
if Ekind (Current_Scope) /= E_Record_Type then
Analyze (Decl);
end if;
return Act;
end;
end Build_Default_Subtype;
--------------------------------------------
-- Build_Discriminal_Subtype_Of_Component --
--------------------------------------------
function Build_Discriminal_Subtype_Of_Component
(T : Entity_Id) return Node_Id
is
Loc : constant Source_Ptr := Sloc (T);
D : Elmt_Id;
Id : Node_Id;
function Build_Discriminal_Array_Constraint return List_Id;
-- If one or more of the bounds of the component depends on
-- discriminants, build actual constraint using the discriminants
-- of the prefix.
function Build_Discriminal_Record_Constraint return List_Id;
-- Similar to previous one, for discriminated components constrained by
-- the discriminant of the enclosing object.
----------------------------------------
-- Build_Discriminal_Array_Constraint --
----------------------------------------
function Build_Discriminal_Array_Constraint return List_Id is
Constraints : constant List_Id := New_List;
Indx : Node_Id;
Hi : Node_Id;
Lo : Node_Id;
Old_Hi : Node_Id;
Old_Lo : Node_Id;
begin
Indx := First_Index (T);
while Present (Indx) loop
Old_Lo := Type_Low_Bound (Etype (Indx));
Old_Hi := Type_High_Bound (Etype (Indx));
if Denotes_Discriminant (Old_Lo) then
Lo := New_Occurrence_Of (Discriminal (Entity (Old_Lo)), Loc);
else
Lo := New_Copy_Tree (Old_Lo);
end if;
if Denotes_Discriminant (Old_Hi) then
Hi := New_Occurrence_Of (Discriminal (Entity (Old_Hi)), Loc);
else
Hi := New_Copy_Tree (Old_Hi);
end if;
Append (Make_Range (Loc, Lo, Hi), Constraints);
Next_Index (Indx);
end loop;
return Constraints;
end Build_Discriminal_Array_Constraint;
-----------------------------------------
-- Build_Discriminal_Record_Constraint --
-----------------------------------------
function Build_Discriminal_Record_Constraint return List_Id is
Constraints : constant List_Id := New_List;
D : Elmt_Id;
D_Val : Node_Id;
begin
D := First_Elmt (Discriminant_Constraint (T));
while Present (D) loop
if Denotes_Discriminant (Node (D)) then
D_Val :=
New_Occurrence_Of (Discriminal (Entity (Node (D))), Loc);
else
D_Val := New_Copy_Tree (Node (D));
end if;
Append (D_Val, Constraints);
Next_Elmt (D);
end loop;
return Constraints;
end Build_Discriminal_Record_Constraint;
-- Start of processing for Build_Discriminal_Subtype_Of_Component
begin
if Ekind (T) = E_Array_Subtype then
Id := First_Index (T);
while Present (Id) loop
if Denotes_Discriminant (Type_Low_Bound (Etype (Id)))
or else
Denotes_Discriminant (Type_High_Bound (Etype (Id)))
then
return Build_Component_Subtype
(Build_Discriminal_Array_Constraint, Loc, T);
end if;
Next_Index (Id);
end loop;
elsif Ekind (T) = E_Record_Subtype
and then Has_Discriminants (T)
and then not Has_Unknown_Discriminants (T)
then
D := First_Elmt (Discriminant_Constraint (T));
while Present (D) loop
if Denotes_Discriminant (Node (D)) then
return Build_Component_Subtype
(Build_Discriminal_Record_Constraint, Loc, T);
end if;
Next_Elmt (D);
end loop;
end if;
-- If none of the above, the actual and nominal subtypes are the same
return Empty;
end Build_Discriminal_Subtype_Of_Component;
------------------------------
-- Build_Elaboration_Entity --
------------------------------
procedure Build_Elaboration_Entity (N : Node_Id; Spec_Id : Entity_Id) is
Loc : constant Source_Ptr := Sloc (N);
Decl : Node_Id;
Elab_Ent : Entity_Id;
procedure Set_Package_Name (Ent : Entity_Id);
-- Given an entity, sets the fully qualified name of the entity in
-- Name_Buffer, with components separated by double underscores. This
-- is a recursive routine that climbs the scope chain to Standard.
----------------------
-- Set_Package_Name --
----------------------
procedure Set_Package_Name (Ent : Entity_Id) is
begin
if Scope (Ent) /= Standard_Standard then
Set_Package_Name (Scope (Ent));
declare
Nam : constant String := Get_Name_String (Chars (Ent));
begin
Name_Buffer (Name_Len + 1) := '_';
Name_Buffer (Name_Len + 2) := '_';
Name_Buffer (Name_Len + 3 .. Name_Len + Nam'Length + 2) := Nam;
Name_Len := Name_Len + Nam'Length + 2;
end;
else
Get_Name_String (Chars (Ent));
end if;
end Set_Package_Name;
-- Start of processing for Build_Elaboration_Entity
begin
-- Ignore call if already constructed
if Present (Elaboration_Entity (Spec_Id)) then
return;
-- Ignore in ASIS mode, elaboration entity is not in source and plays
-- no role in analysis.
elsif ASIS_Mode then
return;
-- See if we need elaboration entity.
-- We always need an elaboration entity when preserving control flow, as
-- we want to remain explicit about the unit's elaboration order.
elsif Opt.Suppress_Control_Flow_Optimizations then
null;
-- We always need an elaboration entity for the dynamic elaboration
-- model, since it is needed to properly generate the PE exception for
-- access before elaboration.
elsif Dynamic_Elaboration_Checks then
null;
-- For the static model, we don't need the elaboration counter if this
-- unit is sure to have no elaboration code, since that means there
-- is no elaboration unit to be called. Note that we can't just decide
-- after the fact by looking to see whether there was elaboration code,
-- because that's too late to make this decision.
elsif Restriction_Active (No_Elaboration_Code) then
return;
-- Similarly, for the static model, we can skip the elaboration counter
-- if we have the No_Multiple_Elaboration restriction, since for the
-- static model, that's the only purpose of the counter (to avoid
-- multiple elaboration).
elsif Restriction_Active (No_Multiple_Elaboration) then
return;
end if;
-- Here we need the elaboration entity
-- Construct name of elaboration entity as xxx_E, where xxx is the unit
-- name with dots replaced by double underscore. We have to manually
-- construct this name, since it will be elaborated in the outer scope,
-- and thus will not have the unit name automatically prepended.
Set_Package_Name (Spec_Id);
Add_Str_To_Name_Buffer ("_E");
-- Create elaboration counter
Elab_Ent := Make_Defining_Identifier (Loc, Chars => Name_Find);
Set_Elaboration_Entity (Spec_Id, Elab_Ent);
Decl :=
Make_Object_Declaration (Loc,
Defining_Identifier => Elab_Ent,
Object_Definition =>
New_Occurrence_Of (Standard_Short_Integer, Loc),
Expression => Make_Integer_Literal (Loc, Uint_0));
Push_Scope (Standard_Standard);
Add_Global_Declaration (Decl);
Pop_Scope;
-- Reset True_Constant indication, since we will indeed assign a value
-- to the variable in the binder main. We also kill the Current_Value
-- and Last_Assignment fields for the same reason.
Set_Is_True_Constant (Elab_Ent, False);
Set_Current_Value (Elab_Ent, Empty);
Set_Last_Assignment (Elab_Ent, Empty);
-- We do not want any further qualification of the name (if we did not
-- do this, we would pick up the name of the generic package in the case
-- of a library level generic instantiation).
Set_Has_Qualified_Name (Elab_Ent);
Set_Has_Fully_Qualified_Name (Elab_Ent);
end Build_Elaboration_Entity;
--------------------------------
-- Build_Explicit_Dereference --
--------------------------------
procedure Build_Explicit_Dereference
(Expr : Node_Id;
Disc : Entity_Id)
is
Loc : constant Source_Ptr := Sloc (Expr);
I : Interp_Index;
It : Interp;
begin
-- An entity of a type with a reference aspect is overloaded with
-- both interpretations: with and without the dereference. Now that
-- the dereference is made explicit, set the type of the node properly,
-- to prevent anomalies in the backend. Same if the expression is an
-- overloaded function call whose return type has a reference aspect.
if Is_Entity_Name (Expr) then
Set_Etype (Expr, Etype (Entity (Expr)));
-- The designated entity will not be examined again when resolving
-- the dereference, so generate a reference to it now.
Generate_Reference (Entity (Expr), Expr);
elsif Nkind (Expr) = N_Function_Call then
-- If the name of the indexing function is overloaded, locate the one
-- whose return type has an implicit dereference on the desired
-- discriminant, and set entity and type of function call.
if Is_Overloaded (Name (Expr)) then
Get_First_Interp (Name (Expr), I, It);
while Present (It.Nam) loop
if Ekind ((It.Typ)) = E_Record_Type
and then First_Entity ((It.Typ)) = Disc
then
Set_Entity (Name (Expr), It.Nam);
Set_Etype (Name (Expr), Etype (It.Nam));
exit;
end if;
Get_Next_Interp (I, It);
end loop;
end if;
-- Set type of call from resolved function name.
Set_Etype (Expr, Etype (Name (Expr)));
end if;
Set_Is_Overloaded (Expr, False);
-- The expression will often be a generalized indexing that yields a
-- container element that is then dereferenced, in which case the
-- generalized indexing call is also non-overloaded.
if Nkind (Expr) = N_Indexed_Component
and then Present (Generalized_Indexing (Expr))
then
Set_Is_Overloaded (Generalized_Indexing (Expr), False);
end if;
Rewrite (Expr,
Make_Explicit_Dereference (Loc,
Prefix =>
Make_Selected_Component (Loc,
Prefix => Relocate_Node (Expr),
Selector_Name => New_Occurrence_Of (Disc, Loc))));
Set_Etype (Prefix (Expr), Etype (Disc));
Set_Etype (Expr, Designated_Type (Etype (Disc)));
end Build_Explicit_Dereference;
-----------------------------------
-- Cannot_Raise_Constraint_Error --
-----------------------------------
function Cannot_Raise_Constraint_Error (Expr : Node_Id) return Boolean is
begin
if Compile_Time_Known_Value (Expr) then
return True;
elsif Do_Range_Check (Expr) then
return False;
elsif Raises_Constraint_Error (Expr) then
return False;
else
case Nkind (Expr) is
when N_Identifier =>
return True;
when N_Expanded_Name =>
return True;
when N_Selected_Component =>
return not Do_Discriminant_Check (Expr);
when N_Attribute_Reference =>
if Do_Overflow_Check (Expr) then
return False;
elsif No (Expressions (Expr)) then
return True;
else
declare
N : Node_Id;
begin
N := First (Expressions (Expr));
while Present (N) loop
if Cannot_Raise_Constraint_Error (N) then
Next (N);
else
return False;
end if;
end loop;
return True;
end;
end if;
when N_Type_Conversion =>
if Do_Overflow_Check (Expr)
or else Do_Length_Check (Expr)
or else Do_Tag_Check (Expr)
then
return False;
else
return Cannot_Raise_Constraint_Error (Expression (Expr));
end if;
when N_Unchecked_Type_Conversion =>
return Cannot_Raise_Constraint_Error (Expression (Expr));
when N_Unary_Op =>
if Do_Overflow_Check (Expr) then
return False;
else
return Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
end if;
when N_Op_Divide
| N_Op_Mod
| N_Op_Rem
=>
if Do_Division_Check (Expr)
or else
Do_Overflow_Check (Expr)
then
return False;
else
return
Cannot_Raise_Constraint_Error (Left_Opnd (Expr))
and then
Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
end if;
when N_Op_Add
| N_Op_And
| N_Op_Concat
| N_Op_Eq
| N_Op_Expon
| N_Op_Ge
| N_Op_Gt
| N_Op_Le
| N_Op_Lt
| N_Op_Multiply
| N_Op_Ne
| N_Op_Or
| N_Op_Rotate_Left
| N_Op_Rotate_Right
| N_Op_Shift_Left
| N_Op_Shift_Right
| N_Op_Shift_Right_Arithmetic
| N_Op_Subtract
| N_Op_Xor
=>
if Do_Overflow_Check (Expr) then
return False;
else
return
Cannot_Raise_Constraint_Error (Left_Opnd (Expr))
and then
Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
end if;
when others =>
return False;
end case;
end if;
end Cannot_Raise_Constraint_Error;
-----------------------------
-- Check_Part_Of_Reference --
-----------------------------
procedure Check_Part_Of_Reference (Var_Id : Entity_Id; Ref : Node_Id) is
Conc_Typ : constant Entity_Id := Encapsulating_State (Var_Id);
Decl : Node_Id;
OK_Use : Boolean := False;
Par : Node_Id;
Prag_Nam : Name_Id;
Spec_Id : Entity_Id;
begin
-- Traverse the parent chain looking for a suitable context for the
-- reference to the concurrent constituent.
Par := Parent (Ref);
while Present (Par) loop
if Nkind (Par) = N_Pragma then
Prag_Nam := Pragma_Name (Par);
-- A concurrent constituent is allowed to appear in pragmas
-- Initial_Condition and Initializes as this is part of the
-- elaboration checks for the constituent (SPARK RM 9.3).
if Nam_In (Prag_Nam, Name_Initial_Condition, Name_Initializes) then
OK_Use := True;
exit;
-- When the reference appears within pragma Depends or Global,
-- check whether the pragma applies to a single task type. Note
-- that the pragma is not encapsulated by the type definition,
-- but this is still a valid context.
elsif Nam_In (Prag_Nam, Name_Depends, Name_Global) then
Decl := Find_Related_Declaration_Or_Body (Par);
if Nkind (Decl) = N_Object_Declaration
and then Defining_Entity (Decl) = Conc_Typ
then
OK_Use := True;
exit;
end if;
end if;
-- The reference appears somewhere in the definition of the single
-- protected/task type (SPARK RM 9.3).
elsif Nkind_In (Par, N_Single_Protected_Declaration,
N_Single_Task_Declaration)
and then Defining_Entity (Par) = Conc_Typ
then
OK_Use := True;
exit;
-- The reference appears within the expanded declaration or the body
-- of the single protected/task type (SPARK RM 9.3).
elsif Nkind_In (Par, N_Protected_Body,
N_Protected_Type_Declaration,
N_Task_Body,
N_Task_Type_Declaration)
then
Spec_Id := Unique_Defining_Entity (Par);
if Present (Anonymous_Object (Spec_Id))
and then Anonymous_Object (Spec_Id) = Conc_Typ
then
OK_Use := True;
exit;
end if;
-- The reference has been relocated within an internally generated
-- package or subprogram. Assume that the reference is legal as the
-- real check was already performed in the original context of the
-- reference.
elsif Nkind_In (Par, N_Package_Body,
N_Package_Declaration,
N_Subprogram_Body,
N_Subprogram_Declaration)
and then not Comes_From_Source (Par)
then
OK_Use := True;
exit;
-- The reference has been relocated to an inlined body for GNATprove.
-- Assume that the reference is legal as the real check was already
-- performed in the original context of the reference.
elsif GNATprove_Mode
and then Nkind (Par) = N_Subprogram_Body
and then Chars (Defining_Entity (Par)) = Name_uParent
then
OK_Use := True;
exit;
end if;
Par := Parent (Par);
end loop;
-- The reference is illegal as it appears outside the definition or
-- body of the single protected/task type.
if not OK_Use then
Error_Msg_NE
("reference to variable & cannot appear in this context",
Ref, Var_Id);
Error_Msg_Name_1 := Chars (Var_Id);
if Ekind (Conc_Typ) = E_Protected_Type then
Error_Msg_NE
("\% is constituent of single protected type &", Ref, Conc_Typ);
else
Error_Msg_NE
("\% is constituent of single task type &", Ref, Conc_Typ);
end if;
end if;
end Check_Part_Of_Reference;
-----------------------------------------
-- Check_Dynamically_Tagged_Expression --
-----------------------------------------
procedure Check_Dynamically_Tagged_Expression
(Expr : Node_Id;
Typ : Entity_Id;
Related_Nod : Node_Id)
is
begin
pragma Assert (Is_Tagged_Type (Typ));
-- In order to avoid spurious errors when analyzing the expanded code,
-- this check is done only for nodes that come from source and for
-- actuals of generic instantiations.
if (Comes_From_Source (Related_Nod)
or else In_Generic_Actual (Expr))
and then (Is_Class_Wide_Type (Etype (Expr))
or else Is_Dynamically_Tagged (Expr))
and then Is_Tagged_Type (Typ)
and then not Is_Class_Wide_Type (Typ)
then
Error_Msg_N ("dynamically tagged expression not allowed!", Expr);
end if;
end Check_Dynamically_Tagged_Expression;
--------------------------
-- Check_Fully_Declared --
--------------------------
procedure Check_Fully_Declared (T : Entity_Id; N : Node_Id) is
begin
if Ekind (T) = E_Incomplete_Type then
-- Ada 2005 (AI-50217): If the type is available through a limited
-- with_clause, verify that its full view has been analyzed.
if From_Limited_With (T)
and then Present (Non_Limited_View (T))
and then Ekind (Non_Limited_View (T)) /= E_Incomplete_Type
then
-- The non-limited view is fully declared
null;
else
Error_Msg_NE
("premature usage of incomplete}", N, First_Subtype (T));
end if;
-- Need comments for these tests ???
elsif Has_Private_Component (T)
and then not Is_Generic_Type (Root_Type (T))
and then not In_Spec_Expression
then
-- Special case: if T is the anonymous type created for a single
-- task or protected object, use the name of the source object.
if Is_Concurrent_Type (T)
and then not Comes_From_Source (T)
and then Nkind (N) = N_Object_Declaration
then
Error_Msg_NE
("type of& has incomplete component",
N, Defining_Identifier (N));
else
Error_Msg_NE
("premature usage of incomplete}",
N, First_Subtype (T));
end if;
end if;
end Check_Fully_Declared;
-------------------------------------------
-- Check_Function_With_Address_Parameter --
-------------------------------------------
procedure Check_Function_With_Address_Parameter (Subp_Id : Entity_Id) is
F : Entity_Id;
T : Entity_Id;
begin
F := First_Formal (Subp_Id);
while Present (F) loop
T := Etype (F);
if Is_Private_Type (T) and then Present (Full_View (T)) then
T := Full_View (T);
end if;
if Is_Descendant_Of_Address (T) or else Is_Limited_Type (T) then
Set_Is_Pure (Subp_Id, False);
exit;
end if;
Next_Formal (F);
end loop;
end Check_Function_With_Address_Parameter;
-------------------------------------
-- Check_Function_Writable_Actuals --
-------------------------------------
procedure Check_Function_Writable_Actuals (N : Node_Id) is
Writable_Actuals_List : Elist_Id := No_Elist;
Identifiers_List : Elist_Id := No_Elist;
Aggr_Error_Node : Node_Id := Empty;
Error_Node : Node_Id := Empty;
procedure Collect_Identifiers (N : Node_Id);
-- In a single traversal of subtree N collect in Writable_Actuals_List
-- all the actuals of functions with writable actuals, and in the list
-- Identifiers_List collect all the identifiers that are not actuals of
-- functions with writable actuals. If a writable actual is referenced
-- twice as writable actual then Error_Node is set to reference its
-- second occurrence, the error is reported, and the tree traversal
-- is abandoned.
function Get_Function_Id (Call : Node_Id) return Entity_Id;
-- Return the entity associated with the function call
procedure Preanalyze_Without_Errors (N : Node_Id);
-- Preanalyze N without reporting errors. Very dubious, you can't just
-- go analyzing things more than once???
-------------------------
-- Collect_Identifiers --
-------------------------
procedure Collect_Identifiers (N : Node_Id) is
function Check_Node (N : Node_Id) return Traverse_Result;
-- Process a single node during the tree traversal to collect the
-- writable actuals of functions and all the identifiers which are
-- not writable actuals of functions.
function Contains (List : Elist_Id; N : Node_Id) return Boolean;
-- Returns True if List has a node whose Entity is Entity (N)
----------------
-- Check_Node --
----------------
function Check_Node (N : Node_Id) return Traverse_Result is
Is_Writable_Actual : Boolean := False;
Id : Entity_Id;
begin
if Nkind (N) = N_Identifier then
-- No analysis possible if the entity is not decorated
if No (Entity (N)) then
return Skip;
-- Don't collect identifiers of packages, called functions, etc
elsif Ekind_In (Entity (N), E_Package,
E_Function,
E_Procedure,
E_Entry)
then
return Skip;
-- For rewritten nodes, continue the traversal in the original
-- subtree. Needed to handle aggregates in original expressions
-- extracted from the tree by Remove_Side_Effects.
elsif Is_Rewrite_Substitution (N) then
Collect_Identifiers (Original_Node (N));
return Skip;
-- For now we skip aggregate discriminants, since they require
-- performing the analysis in two phases to identify conflicts:
-- first one analyzing discriminants and second one analyzing
-- the rest of components (since at run time, discriminants are
-- evaluated prior to components): too much computation cost
-- to identify a corner case???
elsif Nkind (Parent (N)) = N_Component_Association
and then Nkind_In (Parent (Parent (N)),
N_Aggregate,
N_Extension_Aggregate)
then
declare
Choice : constant Node_Id := First (Choices (Parent (N)));
begin
if Ekind (Entity (N)) = E_Discriminant then
return Skip;
elsif Expression (Parent (N)) = N
and then Nkind (Choice) = N_Identifier
and then Ekind (Entity (Choice)) = E_Discriminant
then
return Skip;
end if;
end;
-- Analyze if N is a writable actual of a function
elsif Nkind (Parent (N)) = N_Function_Call then
declare
Call : constant Node_Id := Parent (N);
Actual : Node_Id;
Formal : Node_Id;
begin
Id := Get_Function_Id (Call);
-- In case of previous error, no check is possible
if No (Id) then
return Abandon;
end if;
if Ekind_In (Id, E_Function, E_Generic_Function)
and then Has_Out_Or_In_Out_Parameter (Id)
then
Formal := First_Formal (Id);
Actual := First_Actual (Call);
while Present (Actual) and then Present (Formal) loop
if Actual = N then
if Ekind_In (Formal, E_Out_Parameter,
E_In_Out_Parameter)
then
Is_Writable_Actual := True;
end if;
exit;
end if;
Next_Formal (Formal);
Next_Actual (Actual);
end loop;
end if;
end;
end if;
if Is_Writable_Actual then
-- Skip checking the error in non-elementary types since
-- RM 6.4.1(6.15/3) is restricted to elementary types, but
-- store this actual in Writable_Actuals_List since it is
-- needed to perform checks on other constructs that have
-- arbitrary order of evaluation (for example, aggregates).
if not Is_Elementary_Type (Etype (N)) then
if not Contains (Writable_Actuals_List, N) then
Append_New_Elmt (N, To => Writable_Actuals_List);
end if;
-- Second occurrence of an elementary type writable actual
elsif Contains (Writable_Actuals_List, N) then
-- Report the error on the second occurrence of the
-- identifier. We cannot assume that N is the second
-- occurrence (according to their location in the
-- sources), since Traverse_Func walks through Field2
-- last (see comment in the body of Traverse_Func).
declare
Elmt : Elmt_Id;
begin
Elmt := First_Elmt (Writable_Actuals_List);
while Present (Elmt)
and then Entity (Node (Elmt)) /= Entity (N)
loop
Next_Elmt (Elmt);
end loop;
if Sloc (N) > Sloc (Node (Elmt)) then
Error_Node := N;
else
Error_Node := Node (Elmt);
end if;
Error_Msg_NE
("value may be affected by call to & "
& "because order of evaluation is arbitrary",
Error_Node, Id);
return Abandon;
end;
-- First occurrence of a elementary type writable actual
else
Append_New_Elmt (N, To => Writable_Actuals_List);
end if;
else
if Identifiers_List = No_Elist then
Identifiers_List := New_Elmt_List;
end if;
Append_Unique_Elmt (N, Identifiers_List);
end if;
end if;
return OK;
end Check_Node;
--------------
-- Contains --
--------------
function Contains
(List : Elist_Id;
N : Node_Id) return Boolean
is
pragma Assert (Nkind (N) in N_Has_Entity);
Elmt : Elmt_Id;
begin
if List = No_Elist then
return False;
end if;
Elmt := First_Elmt (List);
while Present (Elmt) loop
if Entity (Node (Elmt)) = Entity (N) then
return True;
else
Next_Elmt (Elmt);
end if;
end loop;
return False;
end Contains;
------------------
-- Do_Traversal --
------------------
procedure Do_Traversal is new Traverse_Proc (Check_Node);
-- The traversal procedure
-- Start of processing for Collect_Identifiers
begin
if Present (Error_Node) then
return;
end if;
if Nkind (N) in N_Subexpr and then Is_OK_Static_Expression (N) then
return;
end if;
Do_Traversal (N);
end Collect_Identifiers;
---------------------
-- Get_Function_Id --
---------------------
function Get_Function_Id (Call : Node_Id) return Entity_Id is
Nam : constant Node_Id := Name (Call);
Id : Entity_Id;
begin
if Nkind (Nam) = N_Explicit_Dereference then
Id := Etype (Nam);
pragma Assert (Ekind (Id) = E_Subprogram_Type);
elsif Nkind (Nam) = N_Selected_Component then
Id := Entity (Selector_Name (Nam));
elsif Nkind (Nam) = N_Indexed_Component then
Id := Entity (Selector_Name (Prefix (Nam)));
else
Id := Entity (Nam);
end if;
return Id;
end Get_Function_Id;
-------------------------------
-- Preanalyze_Without_Errors --
-------------------------------
procedure Preanalyze_Without_Errors (N : Node_Id) is
Status : constant Boolean := Get_Ignore_Errors;
begin
Set_Ignore_Errors (True);
Preanalyze (N);
Set_Ignore_Errors (Status);
end Preanalyze_Without_Errors;
-- Start of processing for Check_Function_Writable_Actuals
begin
-- The check only applies to Ada 2012 code on which Check_Actuals has
-- been set, and only to constructs that have multiple constituents
-- whose order of evaluation is not specified by the language.
if Ada_Version < Ada_2012
or else not Check_Actuals (N)
or else (not (Nkind (N) in N_Op)
and then not (Nkind (N) in N_Membership_Test)
and then not Nkind_In (N, N_Range,
N_Aggregate,
N_Extension_Aggregate,
N_Full_Type_Declaration,
N_Function_Call,
N_Procedure_Call_Statement,
N_Entry_Call_Statement))
or else (Nkind (N) = N_Full_Type_Declaration
and then not Is_Record_Type (Defining_Identifier (N)))
-- In addition, this check only applies to source code, not to code
-- generated by constraint checks.
or else not Comes_From_Source (N)
then
return;
end if;
-- If a construct C has two or more direct constituents that are names
-- or expressions whose evaluation may occur in an arbitrary order, at
-- least one of which contains a function call with an in out or out
-- parameter, then the construct is legal only if: for each name N that
-- is passed as a parameter of mode in out or out to some inner function
-- call C2 (not including the construct C itself), there is no other
-- name anywhere within a direct constituent of the construct C other
-- than the one containing C2, that is known to refer to the same
-- object (RM 6.4.1(6.17/3)).
case Nkind (N) is
when N_Range =>
Collect_Identifiers (Low_Bound (N));
Collect_Identifiers (High_Bound (N));
when N_Membership_Test
| N_Op
=>
declare
Expr : Node_Id;
begin
Collect_Identifiers (Left_Opnd (N));
if Present (Right_Opnd (N)) then
Collect_Identifiers (Right_Opnd (N));
end if;
if Nkind_In (N, N_In, N_Not_In)
and then Present (Alternatives (N))
then
Expr := First (Alternatives (N));
while Present (Expr) loop
Collect_Identifiers (Expr);
Next (Expr);
end loop;
end if;
end;
when N_Full_Type_Declaration =>
declare
function Get_Record_Part (N : Node_Id) return Node_Id;
-- Return the record part of this record type definition
function Get_Record_Part (N : Node_Id) return Node_Id is
Type_Def : constant Node_Id := Type_Definition (N);
begin
if Nkind (Type_Def) = N_Derived_Type_Definition then
return Record_Extension_Part (Type_Def);
else
return Type_Def;
end if;
end Get_Record_Part;
Comp : Node_Id;
Def_Id : Entity_Id := Defining_Identifier (N);
Rec : Node_Id := Get_Record_Part (N);
begin
-- No need to perform any analysis if the record has no
-- components
if No (Rec) or else No (Component_List (Rec)) then
return;
end if;
-- Collect the identifiers starting from the deepest
-- derivation. Done to report the error in the deepest
-- derivation.
loop
if Present (Component_List (Rec)) then
Comp := First (Component_Items (Component_List (Rec)));
while Present (Comp) loop
if Nkind (Comp) = N_Component_Declaration
and then Present (Expression (Comp))
then
Collect_Identifiers (Expression (Comp));
end if;
Next (Comp);
end loop;
end if;
exit when No (Underlying_Type (Etype (Def_Id)))
or else Base_Type (Underlying_Type (Etype (Def_Id)))
= Def_Id;
Def_Id := Base_Type (Underlying_Type (Etype (Def_Id)));
Rec := Get_Record_Part (Parent (Def_Id));
end loop;
end;
when N_Entry_Call_Statement
| N_Subprogram_Call
=>
declare
Id : constant Entity_Id := Get_Function_Id (N);
Formal : Node_Id;
Actual : Node_Id;
begin
Formal := First_Formal (Id);
Actual := First_Actual (N);
while Present (Actual) and then Present (Formal) loop
if Ekind_In (Formal, E_Out_Parameter,
E_In_Out_Parameter)
then
Collect_Identifiers (Actual);
end if;
Next_Formal (Formal);
Next_Actual (Actual);
end loop;
end;
when N_Aggregate
| N_Extension_Aggregate
=>
declare
Assoc : Node_Id;
Choice : Node_Id;
Comp_Expr : Node_Id;
begin
-- Handle the N_Others_Choice of array aggregates with static
-- bounds. There is no need to perform this analysis in
-- aggregates without static bounds since we cannot evaluate
-- if the N_Others_Choice covers several elements. There is
-- no need to handle the N_Others choice of record aggregates
-- since at this stage it has been already expanded by
-- Resolve_Record_Aggregate.
if Is_Array_Type (Etype (N))
and then Nkind (N) = N_Aggregate
and then Present (Aggregate_Bounds (N))
and then Compile_Time_Known_Bounds (Etype (N))
and then Expr_Value (High_Bound (Aggregate_Bounds (N)))
>
Expr_Value (Low_Bound (Aggregate_Bounds (N)))
then
declare
Count_Components : Uint := Uint_0;
Num_Components : Uint;
Others_Assoc : Node_Id;
Others_Choice : Node_Id := Empty;
Others_Box_Present : Boolean := False;
begin
-- Count positional associations
if Present (Expressions (N)) then
Comp_Expr := First (Expressions (N));
while Present (Comp_Expr) loop
Count_Components := Count_Components + 1;
Next (Comp_Expr);
end loop;
end if;
-- Count the rest of elements and locate the N_Others
-- choice (if any)
Assoc := First (Component_Associations (N));
while Present (Assoc) loop
Choice := First (Choices (Assoc));
while Present (Choice) loop
if Nkind (Choice) = N_Others_Choice then
Others_Assoc := Assoc;
Others_Choice := Choice;
Others_Box_Present := Box_Present (Assoc);
-- Count several components
elsif Nkind_In (Choice, N_Range,
N_Subtype_Indication)
or else (Is_Entity_Name (Choice)
and then Is_Type (Entity (Choice)))
then
declare
L, H : Node_Id;
begin
Get_Index_Bounds (Choice, L, H);
pragma Assert
(Compile_Time_Known_Value (L)
and then Compile_Time_Known_Value (H));
Count_Components :=
Count_Components
+ Expr_Value (H) - Expr_Value (L) + 1;
end;
-- Count single component. No other case available
-- since we are handling an aggregate with static
-- bounds.
else
pragma Assert (Is_OK_Static_Expression (Choice)
or else Nkind (Choice) = N_Identifier
or else Nkind (Choice) = N_Integer_Literal);
Count_Components := Count_Components + 1;
end if;
Next (Choice);
end loop;
Next (Assoc);
end loop;
Num_Components :=
Expr_Value (High_Bound (Aggregate_Bounds (N))) -
Expr_Value (Low_Bound (Aggregate_Bounds (N))) + 1;
pragma Assert (Count_Components <= Num_Components);
-- Handle the N_Others choice if it covers several
-- components
if Present (Others_Choice)
and then (Num_Components - Count_Components) > 1
then
if not Others_Box_Present then
-- At this stage, if expansion is active, the
-- expression of the others choice has not been
-- analyzed. Hence we generate a duplicate and
-- we analyze it silently to have available the
-- minimum decoration required to collect the
-- identifiers.
if not Expander_Active then
Comp_Expr := Expression (Others_Assoc);
else
Comp_Expr :=
New_Copy_Tree (Expression (Others_Assoc));
Preanalyze_Without_Errors (Comp_Expr);
end if;
Collect_Identifiers (Comp_Expr);
if Writable_Actuals_List /= No_Elist then
-- As suggested by Robert, at current stage we
-- report occurrences of this case as warnings.
Error_Msg_N
("writable function parameter may affect "
& "value in other component because order "
& "of evaluation is unspecified??",
Node (First_Elmt (Writable_Actuals_List)));
end if;
end if;
end if;
end;
-- For an array aggregate, a discrete_choice_list that has
-- a nonstatic range is considered as two or more separate
-- occurrences of the expression (RM 6.4.1(20/3)).
elsif Is_Array_Type (Etype (N))
and then Nkind (N) = N_Aggregate
and then Present (Aggregate_Bounds (N))
and then not Compile_Time_Known_Bounds (Etype (N))
then
-- Collect identifiers found in the dynamic bounds
declare
Count_Components : Natural := 0;
Low, High : Node_Id;
begin
Assoc := First (Component_Associations (N));
while Present (Assoc) loop
Choice := First (Choices (Assoc));
while Present (Choice) loop
if Nkind_In (Choice, N_Range,
N_Subtype_Indication)
or else (Is_Entity_Name (Choice)
and then Is_Type (Entity (Choice)))
then
Get_Index_Bounds (Choice, Low, High);
if not Compile_Time_Known_Value (Low) then
Collect_Identifiers (Low);
if No (Aggr_Error_Node) then
Aggr_Error_Node := Low;
end if;
end if;
if not Compile_Time_Known_Value (High) then
Collect_Identifiers (High);
if No (Aggr_Error_Node) then
Aggr_Error_Node := High;
end if;
end if;
-- The RM rule is violated if there is more than
-- a single choice in a component association.
else
Count_Components := Count_Components + 1;
if No (Aggr_Error_Node)
and then Count_Components > 1
then
Aggr_Error_Node := Choice;
end if;
if not Compile_Time_Known_Value (Choice) then
Collect_Identifiers (Choice);
end if;
end if;
Next (Choice);
end loop;
Next (Assoc);
end loop;
end;
end if;
-- Handle ancestor part of extension aggregates
if Nkind (N) = N_Extension_Aggregate then
Collect_Identifiers (Ancestor_Part (N));
end if;
-- Handle positional associations
if Present (Expressions (N)) then
Comp_Expr := First (Expressions (N));
while Present (Comp_Expr) loop
if not Is_OK_Static_Expression (Comp_Expr) then
Collect_Identifiers (Comp_Expr);
end if;
Next (Comp_Expr);
end loop;
end if;
-- Handle discrete associations
if Present (Component_Associations (N)) then
Assoc := First (Component_Associations (N));
while Present (Assoc) loop
if not Box_Present (Assoc) then
Choice := First (Choices (Assoc));
while Present (Choice) loop
-- For now we skip discriminants since it requires
-- performing the analysis in two phases: first one
-- analyzing discriminants and second one analyzing
-- the rest of components since discriminants are
-- evaluated prior to components: too much extra
-- work to detect a corner case???
if Nkind (Choice) in N_Has_Entity
and then Present (Entity (Choice))
and then Ekind (Entity (Choice)) = E_Discriminant
then
null;
elsif Box_Present (Assoc) then
null;
else
if not Analyzed (Expression (Assoc)) then
Comp_Expr :=
New_Copy_Tree (Expression (Assoc));
Set_Parent (Comp_Expr, Parent (N));
Preanalyze_Without_Errors (Comp_Expr);
else
Comp_Expr := Expression (Assoc);
end if;
Collect_Identifiers (Comp_Expr);
end if;
Next (Choice);
end loop;
end if;
Next (Assoc);
end loop;
end if;
end;
when others =>
return;
end case;
-- No further action needed if we already reported an error
if Present (Error_Node) then
return;
end if;
-- Check violation of RM 6.20/3 in aggregates
if Present (Aggr_Error_Node)
and then Writable_Actuals_List /= No_Elist
then
Error_Msg_N
("value may be affected by call in other component because they "
& "are evaluated in unspecified order",
Node (First_Elmt (Writable_Actuals_List)));
return;
end if;
-- Check if some writable argument of a function is referenced
if Writable_Actuals_List /= No_Elist
and then Identifiers_List /= No_Elist
then
declare
Elmt_1 : Elmt_Id;
Elmt_2 : Elmt_Id;
begin
Elmt_1 := First_Elmt (Writable_Actuals_List);
while Present (Elmt_1) loop
Elmt_2 := First_Elmt (Identifiers_List);
while Present (Elmt_2) loop
if Entity (Node (Elmt_1)) = Entity (Node (Elmt_2)) then
case Nkind (Parent (Node (Elmt_2))) is
when N_Aggregate
| N_Component_Association
| N_Component_Declaration
=>
Error_Msg_N
("value may be affected by call in other "
& "component because they are evaluated "
& "in unspecified order",
Node (Elmt_2));
when N_In
| N_Not_In
=>
Error_Msg_N
("value may be affected by call in other "
& "alternative because they are evaluated "
& "in unspecified order",
Node (Elmt_2));
when others =>
Error_Msg_N
("value of actual may be affected by call in "
& "other actual because they are evaluated "
& "in unspecified order",
Node (Elmt_2));
end case;
end if;
Next_Elmt (Elmt_2);
end loop;
Next_Elmt (Elmt_1);
end loop;
end;
end if;
end Check_Function_Writable_Actuals;
--------------------------------
-- Check_Implicit_Dereference --
--------------------------------
procedure Check_Implicit_Dereference (N : Node_Id; Typ : Entity_Id) is
Disc : Entity_Id;
Desig : Entity_Id;
Nam : Node_Id;
begin
if Nkind (N) = N_Indexed_Component
and then Present (Generalized_Indexing (N))
then
Nam := Generalized_Indexing (N);
else
Nam := N;
end if;
if Ada_Version < Ada_2012
or else not Has_Implicit_Dereference (Base_Type (Typ))
then
return;
elsif not Comes_From_Source (N)
and then Nkind (N) /= N_Indexed_Component
then
return;
elsif Is_Entity_Name (Nam) and then Is_Type (Entity (Nam)) then
null;
else
Disc := First_Discriminant (Typ);
while Present (Disc) loop
if Has_Implicit_Dereference (Disc) then
Desig := Designated_Type (Etype (Disc));
Add_One_Interp (Nam, Disc, Desig);
-- If the node is a generalized indexing, add interpretation
-- to that node as well, for subsequent resolution.
if Nkind (N) = N_Indexed_Component then
Add_One_Interp (N, Disc, Desig);
end if;
-- If the operation comes from a generic unit and the context
-- is a selected component, the selector name may be global
-- and set in the instance already. Remove the entity to
-- force resolution of the selected component, and the
-- generation of an explicit dereference if needed.
if In_Instance
and then Nkind (Parent (Nam)) = N_Selected_Component
then
Set_Entity (Selector_Name (Parent (Nam)), Empty);
end if;
exit;
end if;
Next_Discriminant (Disc);
end loop;
end if;
end Check_Implicit_Dereference;
----------------------------------
-- Check_Internal_Protected_Use --
----------------------------------
procedure Check_Internal_Protected_Use (N : Node_Id; Nam : Entity_Id) is
S : Entity_Id;
Prot : Entity_Id;
begin
S := Current_Scope;
while Present (S) loop
if S = Standard_Standard then
return;
elsif Ekind (S) = E_Function
and then Ekind (Scope (S)) = E_Protected_Type
then
Prot := Scope (S);
exit;
end if;
S := Scope (S);
end loop;
if Scope (Nam) = Prot and then Ekind (Nam) /= E_Function then
-- An indirect function call (e.g. a callback within a protected
-- function body) is not statically illegal. If the access type is
-- anonymous and is the type of an access parameter, the scope of Nam
-- will be the protected type, but it is not a protected operation.
if Ekind (Nam) = E_Subprogram_Type
and then
Nkind (Associated_Node_For_Itype (Nam)) = N_Function_Specification
then
null;
elsif Nkind (N) = N_Subprogram_Renaming_Declaration then
Error_Msg_N
("within protected function cannot use protected "
& "procedure in renaming or as generic actual", N);
elsif Nkind (N) = N_Attribute_Reference then
Error_Msg_N
("within protected function cannot take access of "
& " protected procedure", N);
else
Error_Msg_N
("within protected function, protected object is constant", N);
Error_Msg_N
("\cannot call operation that may modify it", N);
end if;
end if;
end Check_Internal_Protected_Use;
---------------------------------------
-- Check_Later_Vs_Basic_Declarations --
---------------------------------------
procedure Check_Later_Vs_Basic_Declarations
(Decls : List_Id;
During_Parsing : Boolean)
is
Body_Sloc : Source_Ptr;
Decl : Node_Id;
function Is_Later_Declarative_Item (Decl : Node_Id) return Boolean;
-- Return whether Decl is considered as a declarative item.
-- When During_Parsing is True, the semantics of Ada 83 is followed.
-- When During_Parsing is False, the semantics of SPARK is followed.
-------------------------------
-- Is_Later_Declarative_Item --
-------------------------------
function Is_Later_Declarative_Item (Decl : Node_Id) return Boolean is
begin
if Nkind (Decl) in N_Later_Decl_Item then
return True;
elsif Nkind (Decl) = N_Pragma then
return True;
elsif During_Parsing then
return False;
-- In SPARK, a package declaration is not considered as a later
-- declarative item.
elsif Nkind (Decl) = N_Package_Declaration then
return False;
-- In SPARK, a renaming is considered as a later declarative item
elsif Nkind (Decl) in N_Renaming_Declaration then
return True;
else
return False;
end if;
end Is_Later_Declarative_Item;
-- Start of processing for Check_Later_Vs_Basic_Declarations
begin
Decl := First (Decls);
-- Loop through sequence of basic declarative items
Outer : while Present (Decl) loop
if not Nkind_In (Decl, N_Subprogram_Body, N_Package_Body, N_Task_Body)
and then Nkind (Decl) not in N_Body_Stub
then
Next (Decl);
-- Once a body is encountered, we only allow later declarative
-- items. The inner loop checks the rest of the list.
else
Body_Sloc := Sloc (Decl);
Inner : while Present (Decl) loop
if not Is_Later_Declarative_Item (Decl) then
if During_Parsing then
if Ada_Version = Ada_83 then
Error_Msg_Sloc := Body_Sloc;
Error_Msg_N
("(Ada 83) decl cannot appear after body#", Decl);
end if;
else
Error_Msg_Sloc := Body_Sloc;
Check_SPARK_05_Restriction
("decl cannot appear after body#", Decl);
end if;
end if;
Next (Decl);
end loop Inner;
end if;
end loop Outer;
end Check_Later_Vs_Basic_Declarations;
---------------------------
-- Check_No_Hidden_State --
---------------------------
procedure Check_No_Hidden_State (Id : Entity_Id) is
function Has_Null_Abstract_State (Pkg : Entity_Id) return Boolean;
-- Determine whether the entity of a package denoted by Pkg has a null
-- abstract state.
-----------------------------
-- Has_Null_Abstract_State --
-----------------------------
function Has_Null_Abstract_State (Pkg : Entity_Id) return Boolean is
States : constant Elist_Id := Abstract_States (Pkg);
begin
-- Check first available state of related package. A null abstract
-- state always appears as the sole element of the state list.
return
Present (States)
and then Is_Null_State (Node (First_Elmt (States)));
end Has_Null_Abstract_State;
-- Local variables
Context : Entity_Id := Empty;
Not_Visible : Boolean := False;
Scop : Entity_Id;
-- Start of processing for Check_No_Hidden_State
begin
pragma Assert (Ekind_In (Id, E_Abstract_State, E_Variable));
-- Find the proper context where the object or state appears
Scop := Scope (Id);
while Present (Scop) loop
Context := Scop;
-- Keep track of the context's visibility
Not_Visible := Not_Visible or else In_Private_Part (Context);
-- Prevent the search from going too far
if Context = Standard_Standard then
return;
-- Objects and states that appear immediately within a subprogram or
-- inside a construct nested within a subprogram do not introduce a
-- hidden state. They behave as local variable declarations.
elsif Is_Subprogram (Context) then
return;
-- When examining a package body, use the entity of the spec as it
-- carries the abstract state declarations.
elsif Ekind (Context) = E_Package_Body then
Context := Spec_Entity (Context);
end if;
-- Stop the traversal when a package subject to a null abstract state
-- has been found.
if Ekind_In (Context, E_Generic_Package, E_Package)
and then Has_Null_Abstract_State (Context)
then
exit;
end if;
Scop := Scope (Scop);
end loop;
-- At this point we know that there is at least one package with a null
-- abstract state in visibility. Emit an error message unconditionally
-- if the entity being processed is a state because the placement of the
-- related package is irrelevant. This is not the case for objects as
-- the intermediate context matters.
if Present (Context)
and then (Ekind (Id) = E_Abstract_State or else Not_Visible)
then
Error_Msg_N ("cannot introduce hidden state &", Id);
Error_Msg_NE ("\package & has null abstract state", Id, Context);
end if;
end Check_No_Hidden_State;
----------------------------------------
-- Check_Nonvolatile_Function_Profile --
----------------------------------------
procedure Check_Nonvolatile_Function_Profile (Func_Id : Entity_Id) is
Formal : Entity_Id;
begin
-- Inspect all formal parameters
Formal := First_Formal (Func_Id);
while Present (Formal) loop
if Is_Effectively_Volatile (Etype (Formal)) then
Error_Msg_NE
("nonvolatile function & cannot have a volatile parameter",
Formal, Func_Id);
end if;
Next_Formal (Formal);
end loop;
-- Inspect the return type
if Is_Effectively_Volatile (Etype (Func_Id)) then
Error_Msg_NE
("nonvolatile function & cannot have a volatile return type",
Result_Definition (Parent (Func_Id)), Func_Id);
end if;
end Check_Nonvolatile_Function_Profile;
------------------------------------------
-- Check_Potentially_Blocking_Operation --
------------------------------------------
procedure Check_Potentially_Blocking_Operation (N : Node_Id) is
S : Entity_Id;
begin
-- N is one of the potentially blocking operations listed in 9.5.1(8).
-- When pragma Detect_Blocking is active, the run time will raise
-- Program_Error. Here we only issue a warning, since we generally
-- support the use of potentially blocking operations in the absence
-- of the pragma.
-- Indirect blocking through a subprogram call cannot be diagnosed
-- statically without interprocedural analysis, so we do not attempt
-- to do it here.
S := Scope (Current_Scope);
while Present (S) and then S /= Standard_Standard loop
if Is_Protected_Type (S) then
Error_Msg_N
("potentially blocking operation in protected operation??", N);
return;
end if;
S := Scope (S);
end loop;
end Check_Potentially_Blocking_Operation;
---------------------------------
-- Check_Result_And_Post_State --
---------------------------------
procedure Check_Result_And_Post_State (Subp_Id : Entity_Id) is
procedure Check_Result_And_Post_State_In_Pragma
(Prag : Node_Id;
Result_Seen : in out Boolean);
-- Determine whether pragma Prag mentions attribute 'Result and whether
-- the pragma contains an expression that evaluates differently in pre-
-- and post-state. Prag is a [refined] postcondition or a contract-cases
-- pragma. Result_Seen is set when the pragma mentions attribute 'Result
function Has_In_Out_Parameter (Subp_Id : Entity_Id) return Boolean;
-- Determine whether subprogram Subp_Id contains at least one IN OUT
-- formal parameter.
-------------------------------------------
-- Check_Result_And_Post_State_In_Pragma --
-------------------------------------------
procedure Check_Result_And_Post_State_In_Pragma
(Prag : Node_Id;
Result_Seen : in out Boolean)
is
procedure Check_Expression (Expr : Node_Id);
-- Perform the 'Result and post-state checks on a given expression
function Is_Function_Result (N : Node_Id) return Traverse_Result;
-- Attempt to find attribute 'Result in a subtree denoted by N
function Is_Trivial_Boolean (N : Node_Id) return Boolean;
-- Determine whether source node N denotes "True" or "False"
function Mentions_Post_State (N : Node_Id) return Boolean;
-- Determine whether a subtree denoted by N mentions any construct
-- that denotes a post-state.
procedure Check_Function_Result is
new Traverse_Proc (Is_Function_Result);
----------------------
-- Check_Expression --
----------------------
procedure Check_Expression (Expr : Node_Id) is
begin
if not Is_Trivial_Boolean (Expr) then
Check_Function_Result (Expr);
if not Mentions_Post_State (Expr) then
if Pragma_Name (Prag) = Name_Contract_Cases then
Error_Msg_NE
("contract case does not check the outcome of calling "
& "&?T?", Expr, Subp_Id);
elsif Pragma_Name (Prag) = Name_Refined_Post then
Error_Msg_NE
("refined postcondition does not check the outcome of "
& "calling &?T?", Prag, Subp_Id);
else
Error_Msg_NE
("postcondition does not check the outcome of calling "
& "&?T?", Prag, Subp_Id);
end if;
end if;
end if;
end Check_Expression;
------------------------
-- Is_Function_Result --
------------------------
function Is_Function_Result (N : Node_Id) return Traverse_Result is
begin
if Is_Attribute_Result (N) then
Result_Seen := True;
return Abandon;
-- Continue the traversal
else
return OK;
end if;
end Is_Function_Result;
------------------------
-- Is_Trivial_Boolean --
------------------------
function Is_Trivial_Boolean (N : Node_Id) return Boolean is
begin
return
Comes_From_Source (N)
and then Is_Entity_Name (N)
and then (Entity (N) = Standard_True
or else
Entity (N) = Standard_False);
end Is_Trivial_Boolean;
-------------------------
-- Mentions_Post_State --
-------------------------
function Mentions_Post_State (N : Node_Id) return Boolean is
Post_State_Seen : Boolean := False;
function Is_Post_State (N : Node_Id) return Traverse_Result;
-- Attempt to find a construct that denotes a post-state. If this
-- is the case, set flag Post_State_Seen.
-------------------
-- Is_Post_State --
-------------------
function Is_Post_State (N : Node_Id) return Traverse_Result is
Ent : Entity_Id;
begin
if Nkind_In (N, N_Explicit_Dereference, N_Function_Call) then
Post_State_Seen := True;
return Abandon;
elsif Nkind_In (N, N_Expanded_Name, N_Identifier) then
Ent := Entity (N);
-- The entity may be modifiable through an implicit
-- dereference.
if No (Ent)
or else Ekind (Ent) in Assignable_Kind
or else (Is_Access_Type (Etype (Ent))
and then Nkind (Parent (N)) =
N_Selected_Component)
then
Post_State_Seen := True;
return Abandon;
end if;
elsif Nkind (N) = N_Attribute_Reference then
if Attribute_Name (N) = Name_Old then
return Skip;
elsif Attribute_Name (N) = Name_Result then
Post_State_Seen := True;
return Abandon;
end if;
end if;
return OK;
end Is_Post_State;
procedure Find_Post_State is new Traverse_Proc (Is_Post_State);
-- Start of processing for Mentions_Post_State
begin
Find_Post_State (N);
return Post_State_Seen;
end Mentions_Post_State;
-- Local variables
Expr : constant Node_Id :=
Get_Pragma_Arg
(First (Pragma_Argument_Associations (Prag)));
Nam : constant Name_Id := Pragma_Name (Prag);
CCase : Node_Id;
-- Start of processing for Check_Result_And_Post_State_In_Pragma
begin
-- Examine all consequences
if Nam = Name_Contract_Cases then
CCase := First (Component_Associations (Expr));
while Present (CCase) loop
Check_Expression (Expression (CCase));
Next (CCase);
end loop;
-- Examine the expression of a postcondition
else pragma Assert (Nam_In (Nam, Name_Postcondition,
Name_Refined_Post));
Check_Expression (Expr);
end if;
end Check_Result_And_Post_State_In_Pragma;
--------------------------
-- Has_In_Out_Parameter --
--------------------------
function Has_In_Out_Parameter (Subp_Id : Entity_Id) return Boolean is
Formal : Entity_Id;
begin
-- Traverse the formals looking for an IN OUT parameter
Formal := First_Formal (Subp_Id);
while Present (Formal) loop
if Ekind (Formal) = E_In_Out_Parameter then
return True;
end if;
Next_Formal (Formal);
end loop;
return False;
end Has_In_Out_Parameter;
-- Local variables
Items : constant Node_Id := Contract (Subp_Id);
Subp_Decl : constant Node_Id := Unit_Declaration_Node (Subp_Id);
Case_Prag : Node_Id := Empty;
Post_Prag : Node_Id := Empty;
Prag : Node_Id;
Seen_In_Case : Boolean := False;
Seen_In_Post : Boolean := False;
Spec_Id : Entity_Id;
-- Start of processing for Check_Result_And_Post_State
begin
-- The lack of attribute 'Result or a post-state is classified as a
-- suspicious contract. Do not perform the check if the corresponding
-- swich is not set.
if not Warn_On_Suspicious_Contract then
return;
-- Nothing to do if there is no contract
elsif No (Items) then
return;
end if;
-- Retrieve the entity of the subprogram spec (if any)
if Nkind (Subp_Decl) = N_Subprogram_Body
and then Present (Corresponding_Spec (Subp_Decl))
then
Spec_Id := Corresponding_Spec (Subp_Decl);
elsif Nkind (Subp_Decl) = N_Subprogram_Body_Stub
and then Present (Corresponding_Spec_Of_Stub (Subp_Decl))
then
Spec_Id := Corresponding_Spec_Of_Stub (Subp_Decl);
else
Spec_Id := Subp_Id;
end if;
-- Examine all postconditions for attribute 'Result and a post-state
Prag := Pre_Post_Conditions (Items);
while Present (Prag) loop
if Nam_In (Pragma_Name_Unmapped (Prag),
Name_Postcondition, Name_Refined_Post)
and then not Error_Posted (Prag)
then
Post_Prag := Prag;
Check_Result_And_Post_State_In_Pragma (Prag, Seen_In_Post);
end if;
Prag := Next_Pragma (Prag);
end loop;
-- Examine the contract cases of the subprogram for attribute 'Result
-- and a post-state.
Prag := Contract_Test_Cases (Items);
while Present (Prag) loop
if Pragma_Name (Prag) = Name_Contract_Cases
and then not Error_Posted (Prag)
then
Case_Prag := Prag;
Check_Result_And_Post_State_In_Pragma (Prag, Seen_In_Case);
end if;
Prag := Next_Pragma (Prag);
end loop;
-- Do not emit any errors if the subprogram is not a function
if not Ekind_In (Spec_Id, E_Function, E_Generic_Function) then
null;
-- Regardless of whether the function has postconditions or contract
-- cases, or whether they mention attribute 'Result, an IN OUT formal
-- parameter is always treated as a result.
elsif Has_In_Out_Parameter (Spec_Id) then
null;
-- The function has both a postcondition and contract cases and they do
-- not mention attribute 'Result.
elsif Present (Case_Prag)
and then not Seen_In_Case
and then Present (Post_Prag)
and then not Seen_In_Post
then
Error_Msg_N
("neither postcondition nor contract cases mention function "
& "result?T?", Post_Prag);
-- The function has contract cases only and they do not mention
-- attribute 'Result.
elsif Present (Case_Prag) and then not Seen_In_Case then
Error_Msg_N ("contract cases do not mention result?T?", Case_Prag);
-- The function has postconditions only and they do not mention
-- attribute 'Result.
elsif Present (Post_Prag) and then not Seen_In_Post then
Error_Msg_N
("postcondition does not mention function result?T?", Post_Prag);
end if;
end Check_Result_And_Post_State;
-----------------------------
-- Check_State_Refinements --
-----------------------------
procedure Check_State_Refinements
(Context : Node_Id;
Is_Main_Unit : Boolean := False)
is
procedure Check_Package (Pack : Node_Id);
-- Verify that all abstract states of a [generic] package denoted by its
-- declarative node Pack have proper refinement. Recursively verify the
-- visible and private declarations of the [generic] package for other
-- nested packages.
procedure Check_Packages_In (Decls : List_Id);
-- Seek out [generic] package declarations within declarative list Decls
-- and verify the status of their abstract state refinement.
function SPARK_Mode_Is_Off (N : Node_Id) return Boolean;
-- Determine whether construct N is subject to pragma SPARK_Mode Off
-------------------
-- Check_Package --
-------------------
procedure Check_Package (Pack : Node_Id) is
Body_Id : constant Entity_Id := Corresponding_Body (Pack);
Spec : constant Node_Id := Specification (Pack);
States : constant Elist_Id :=
Abstract_States (Defining_Entity (Pack));
State_Elmt : Elmt_Id;
State_Id : Entity_Id;
begin
-- Do not verify proper state refinement when the package is subject
-- to pragma SPARK_Mode Off because this disables the requirement for
-- state refinement.
if SPARK_Mode_Is_Off (Pack) then
null;
-- State refinement can only occur in a completing packge body. Do
-- not verify proper state refinement when the body is subject to
-- pragma SPARK_Mode Off because this disables the requirement for
-- state refinement.
elsif Present (Body_Id)
and then SPARK_Mode_Is_Off (Unit_Declaration_Node (Body_Id))
then
null;
-- Do not verify proper state refinement when the package is an
-- instance as this check was already performed in the generic.
elsif Present (Generic_Parent (Spec)) then
null;
-- Otherwise examine the contents of the package
else
if Present (States) then
State_Elmt := First_Elmt (States);
while Present (State_Elmt) loop
State_Id := Node (State_Elmt);
-- Emit an error when a non-null state lacks any form of
-- refinement.
if not Is_Null_State (State_Id)
and then not Has_Null_Refinement (State_Id)
and then not Has_Non_Null_Refinement (State_Id)
then
Error_Msg_N ("state & requires refinement", State_Id);
end if;
Next_Elmt (State_Elmt);
end loop;
end if;
Check_Packages_In (Visible_Declarations (Spec));
Check_Packages_In (Private_Declarations (Spec));
end if;
end Check_Package;
-----------------------
-- Check_Packages_In --
-----------------------
procedure Check_Packages_In (Decls : List_Id) is
Decl : Node_Id;
begin
if Present (Decls) then
Decl := First (Decls);
while Present (Decl) loop
if Nkind_In (Decl, N_Generic_Package_Declaration,
N_Package_Declaration)
then
Check_Package (Decl);
end if;
Next (Decl);
end loop;
end if;
end Check_Packages_In;
-----------------------
-- SPARK_Mode_Is_Off --
-----------------------
function SPARK_Mode_Is_Off (N : Node_Id) return Boolean is
Prag : constant Node_Id := SPARK_Pragma (Defining_Entity (N));
begin
return
Present (Prag) and then Get_SPARK_Mode_From_Annotation (Prag) = Off;
end SPARK_Mode_Is_Off;
-- Start of processing for Check_State_Refinements
begin
-- A block may declare a nested package
if Nkind (Context) = N_Block_Statement then
Check_Packages_In (Declarations (Context));
-- An entry, protected, subprogram, or task body may declare a nested
-- package.
elsif Nkind_In (Context, N_Entry_Body,
N_Protected_Body,
N_Subprogram_Body,
N_Task_Body)
then
-- Do not verify proper state refinement when the body is subject to
-- pragma SPARK_Mode Off because this disables the requirement for
-- state refinement.
if not SPARK_Mode_Is_Off (Context) then
Check_Packages_In (Declarations (Context));
end if;
-- A package body may declare a nested package
elsif Nkind (Context) = N_Package_Body then
Check_Package (Unit_Declaration_Node (Corresponding_Spec (Context)));
-- Do not verify proper state refinement when the body is subject to
-- pragma SPARK_Mode Off because this disables the requirement for
-- state refinement.
if not SPARK_Mode_Is_Off (Context) then
Check_Packages_In (Declarations (Context));
end if;
-- A library level [generic] package may declare a nested package
elsif Nkind_In (Context, N_Generic_Package_Declaration,
N_Package_Declaration)
and then Is_Main_Unit
then
Check_Package (Context);
end if;
end Check_State_Refinements;
------------------------------
-- Check_Unprotected_Access --
------------------------------
procedure Check_Unprotected_Access
(Context : Node_Id;
Expr : Node_Id)
is
Cont_Encl_Typ : Entity_Id;
Pref_Encl_Typ : Entity_Id;
function Enclosing_Protected_Type (Obj : Node_Id) return Entity_Id;
-- Check whether Obj is a private component of a protected object.
-- Return the protected type where the component resides, Empty
-- otherwise.
function Is_Public_Operation return Boolean;
-- Verify that the enclosing operation is callable from outside the
-- protected object, to minimize false positives.
------------------------------
-- Enclosing_Protected_Type --
------------------------------
function Enclosing_Protected_Type (Obj : Node_Id) return Entity_Id is
begin
if Is_Entity_Name (Obj) then
declare
Ent : Entity_Id := Entity (Obj);
begin
-- The object can be a renaming of a private component, use
-- the original record component.
if Is_Prival (Ent) then
Ent := Prival_Link (Ent);
end if;
if Is_Protected_Type (Scope (Ent)) then
return Scope (Ent);
end if;
end;
end if;
-- For indexed and selected components, recursively check the prefix
if Nkind_In (Obj, N_Indexed_Component, N_Selected_Component) then
return Enclosing_Protected_Type (Prefix (Obj));
-- The object does not denote a protected component
else
return Empty;
end if;
end Enclosing_Protected_Type;
-------------------------
-- Is_Public_Operation --
-------------------------
function Is_Public_Operation return Boolean is
S : Entity_Id;
E : Entity_Id;
begin
S := Current_Scope;
while Present (S) and then S /= Pref_Encl_Typ loop
if Scope (S) = Pref_Encl_Typ then
E := First_Entity (Pref_Encl_Typ);
while Present (E)
and then E /= First_Private_Entity (Pref_Encl_Typ)
loop
if E = S then
return True;
end if;
Next_Entity (E);
end loop;
end if;
S := Scope (S);
end loop;
return False;
end Is_Public_Operation;
-- Start of processing for Check_Unprotected_Access
begin
if Nkind (Expr) = N_Attribute_Reference
and then Attribute_Name (Expr) = Name_Unchecked_Access
then
Cont_Encl_Typ := Enclosing_Protected_Type (Context);
Pref_Encl_Typ := Enclosing_Protected_Type (Prefix (Expr));
-- Check whether we are trying to export a protected component to a
-- context with an equal or lower access level.
if Present (Pref_Encl_Typ)
and then No (Cont_Encl_Typ)
and then Is_Public_Operation
and then Scope_Depth (Pref_Encl_Typ) >=
Object_Access_Level (Context)
then
Error_Msg_N
("??possible unprotected access to protected data", Expr);
end if;
end if;
end Check_Unprotected_Access;
------------------------------
-- Check_Unused_Body_States --
------------------------------
procedure Check_Unused_Body_States (Body_Id : Entity_Id) is
procedure Process_Refinement_Clause
(Clause : Node_Id;
States : Elist_Id);
-- Inspect all constituents of refinement clause Clause and remove any
-- matches from body state list States.
procedure Report_Unused_Body_States (States : Elist_Id);
-- Emit errors for each abstract state or object found in list States
-------------------------------
-- Process_Refinement_Clause --
-------------------------------
procedure Process_Refinement_Clause
(Clause : Node_Id;
States : Elist_Id)
is
procedure Process_Constituent (Constit : Node_Id);
-- Remove constituent Constit from body state list States
-------------------------
-- Process_Constituent --
-------------------------
procedure Process_Constituent (Constit : Node_Id) is
Constit_Id : Entity_Id;
begin
-- Guard against illegal constituents. Only abstract states and
-- objects can appear on the right hand side of a refinement.
if Is_Entity_Name (Constit) then
Constit_Id := Entity_Of (Constit);
if Present (Constit_Id)
and then Ekind_In (Constit_Id, E_Abstract_State,
E_Constant,
E_Variable)
then
Remove (States, Constit_Id);
end if;
end if;
end Process_Constituent;
-- Local variables
Constit : Node_Id;
-- Start of processing for Process_Refinement_Clause
begin
if Nkind (Clause) = N_Component_Association then
Constit := Expression (Clause);
-- Multiple constituents appear as an aggregate
if Nkind (Constit) = N_Aggregate then
Constit := First (Expressions (Constit));
while Present (Constit) loop
Process_Constituent (Constit);
Next (Constit);
end loop;
-- Various forms of a single constituent
else
Process_Constituent (Constit);
end if;
end if;
end Process_Refinement_Clause;
-------------------------------
-- Report_Unused_Body_States --
-------------------------------
procedure Report_Unused_Body_States (States : Elist_Id) is
Posted : Boolean := False;
State_Elmt : Elmt_Id;
State_Id : Entity_Id;
begin
if Present (States) then
State_Elmt := First_Elmt (States);
while Present (State_Elmt) loop
State_Id := Node (State_Elmt);
-- Constants are part of the hidden state of a package, but the
-- compiler cannot determine whether they have variable input
-- (SPARK RM 7.1.1(2)) and cannot classify them properly as a
-- hidden state. Do not emit an error when a constant does not
-- participate in a state refinement, even though it acts as a
-- hidden state.
if Ekind (State_Id) = E_Constant then
null;
-- Generate an error message of the form:
-- body of package ... has unused hidden states
-- abstract state ... defined at ...
-- variable ... defined at ...
else
if not Posted then
Posted := True;
SPARK_Msg_N
("body of package & has unused hidden states", Body_Id);
end if;
Error_Msg_Sloc := Sloc (State_Id);
if Ekind (State_Id) = E_Abstract_State then
SPARK_Msg_NE
("\abstract state & defined #", Body_Id, State_Id);
else
SPARK_Msg_NE ("\variable & defined #", Body_Id, State_Id);
end if;
end if;
Next_Elmt (State_Elmt);
end loop;
end if;
end Report_Unused_Body_States;
-- Local variables
Prag : constant Node_Id := Get_Pragma (Body_Id, Pragma_Refined_State);
Spec_Id : constant Entity_Id := Spec_Entity (Body_Id);
Clause : Node_Id;
States : Elist_Id;
-- Start of processing for Check_Unused_Body_States
begin
-- Inspect the clauses of pragma Refined_State and determine whether all
-- visible states declared within the package body participate in the
-- refinement.
if Present (Prag) then
Clause := Expression (Get_Argument (Prag, Spec_Id));
States := Collect_Body_States (Body_Id);
-- Multiple non-null state refinements appear as an aggregate
if Nkind (Clause) = N_Aggregate then
Clause := First (Component_Associations (Clause));
while Present (Clause) loop
Process_Refinement_Clause (Clause, States);
Next (Clause);
end loop;
-- Various forms of a single state refinement
else
Process_Refinement_Clause (Clause, States);
end if;
-- Ensure that all abstract states and objects declared in the
-- package body state space are utilized as constituents.
Report_Unused_Body_States (States);
end if;
end Check_Unused_Body_States;
-----------------
-- Choice_List --
-----------------
function Choice_List (N : Node_Id) return List_Id is
begin
if Nkind (N) = N_Iterated_Component_Association then
return Discrete_Choices (N);
else
return Choices (N);
end if;
end Choice_List;
-------------------------
-- Collect_Body_States --
-------------------------
function Collect_Body_States (Body_Id : Entity_Id) return Elist_Id is
function Is_Visible_Object (Obj_Id : Entity_Id) return Boolean;
-- Determine whether object Obj_Id is a suitable visible state of a
-- package body.
procedure Collect_Visible_States
(Pack_Id : Entity_Id;
States : in out Elist_Id);
-- Gather the entities of all abstract states and objects declared in
-- the visible state space of package Pack_Id.
----------------------------
-- Collect_Visible_States --
----------------------------
procedure Collect_Visible_States
(Pack_Id : Entity_Id;
States : in out Elist_Id)
is
Item_Id : Entity_Id;
begin
-- Traverse the entity chain of the package and inspect all visible
-- items.
Item_Id := First_Entity (Pack_Id);
while Present (Item_Id) and then not In_Private_Part (Item_Id) loop
-- Do not consider internally generated items as those cannot be
-- named and participate in refinement.
if not Comes_From_Source (Item_Id) then
null;
elsif Ekind (Item_Id) = E_Abstract_State then
Append_New_Elmt (Item_Id, States);
elsif Ekind_In (Item_Id, E_Constant, E_Variable)
and then Is_Visible_Object (Item_Id)
then
Append_New_Elmt (Item_Id, States);
-- Recursively gather the visible states of a nested package
elsif Ekind (Item_Id) = E_Package then
Collect_Visible_States (Item_Id, States);
end if;
Next_Entity (Item_Id);
end loop;
end Collect_Visible_States;
-----------------------
-- Is_Visible_Object --
-----------------------
function Is_Visible_Object (Obj_Id : Entity_Id) return Boolean is
begin
-- Objects that map generic formals to their actuals are not visible
-- from outside the generic instantiation.
if Present (Corresponding_Generic_Association
(Declaration_Node (Obj_Id)))
then
return False;
-- Constituents of a single protected/task type act as components of
-- the type and are not visible from outside the type.
elsif Ekind (Obj_Id) = E_Variable
and then Present (Encapsulating_State (Obj_Id))
and then Is_Single_Concurrent_Object (Encapsulating_State (Obj_Id))
then
return False;
else
return True;
end if;
end Is_Visible_Object;
-- Local variables
Body_Decl : constant Node_Id := Unit_Declaration_Node (Body_Id);
Decl : Node_Id;
Item_Id : Entity_Id;
States : Elist_Id := No_Elist;
-- Start of processing for Collect_Body_States
begin
-- Inspect the declarations of the body looking for source objects,
-- packages and package instantiations. Note that even though this
-- processing is very similar to Collect_Visible_States, a package
-- body does not have a First/Next_Entity list.
Decl := First (Declarations (Body_Decl));
while Present (Decl) loop
-- Capture source objects as internally generated temporaries cannot
-- be named and participate in refinement.
if Nkind (Decl) = N_Object_Declaration then
Item_Id := Defining_Entity (Decl);
if Comes_From_Source (Item_Id)
and then Is_Visible_Object (Item_Id)
then
Append_New_Elmt (Item_Id, States);
end if;
-- Capture the visible abstract states and objects of a source
-- package [instantiation].
elsif Nkind (Decl) = N_Package_Declaration then
Item_Id := Defining_Entity (Decl);
if Comes_From_Source (Item_Id) then
Collect_Visible_States (Item_Id, States);
end if;
end if;
Next (Decl);
end loop;
return States;
end Collect_Body_States;
------------------------
-- Collect_Interfaces --
------------------------
procedure Collect_Interfaces
(T : Entity_Id;
Ifaces_List : out Elist_Id;
Exclude_Parents : Boolean := False;
Use_Full_View : Boolean := True)
is
procedure Collect (Typ : Entity_Id);
-- Subsidiary subprogram used to traverse the whole list
-- of directly and indirectly implemented interfaces
-------------
-- Collect --
-------------
procedure Collect (Typ : Entity_Id) is
Ancestor : Entity_Id;
Full_T : Entity_Id;
Id : Node_Id;
Iface : Entity_Id;
begin
Full_T := Typ;
-- Handle private types and subtypes
if Use_Full_View
and then Is_Private_Type (Typ)
and then Present (Full_View (Typ))
then
Full_T := Full_View (Typ);
if Ekind (Full_T) = E_Record_Subtype then
Full_T := Etype (Typ);
if Present (Full_View (Full_T)) then
Full_T := Full_View (Full_T);
end if;
end if;
end if;
-- Include the ancestor if we are generating the whole list of
-- abstract interfaces.
if Etype (Full_T) /= Typ
-- Protect the frontend against wrong sources. For example:
-- package P is
-- type A is tagged null record;
-- type B is new A with private;
-- type C is new A with private;
-- private
-- type B is new C with null record;
-- type C is new B with null record;
-- end P;
and then Etype (Full_T) /= T
then
Ancestor := Etype (Full_T);
Collect (Ancestor);
if Is_Interface (Ancestor) and then not Exclude_Parents then
Append_Unique_Elmt (Ancestor, Ifaces_List);
end if;
end if;
-- Traverse the graph of ancestor interfaces
if Is_Non_Empty_List (Abstract_Interface_List (Full_T)) then
Id := First (Abstract_Interface_List (Full_T));
while Present (Id) loop
Iface := Etype (Id);
-- Protect against wrong uses. For example:
-- type I is interface;
-- type O is tagged null record;
-- type Wrong is new I and O with null record; -- ERROR
if Is_Interface (Iface) then
if Exclude_Parents
and then Etype (T) /= T
and then Interface_Present_In_Ancestor (Etype (T), Iface)
then
null;
else
Collect (Iface);
Append_Unique_Elmt (Iface, Ifaces_List);
end if;
end if;
Next (Id);
end loop;
end if;
end Collect;
-- Start of processing for Collect_Interfaces
begin
pragma Assert (Is_Tagged_Type (T) or else Is_Concurrent_Type (T));
Ifaces_List := New_Elmt_List;
Collect (T);
end Collect_Interfaces;
----------------------------------
-- Collect_Interface_Components --
----------------------------------
procedure Collect_Interface_Components
(Tagged_Type : Entity_Id;
Components_List : out Elist_Id)
is
procedure Collect (Typ : Entity_Id);
-- Subsidiary subprogram used to climb to the parents
-------------
-- Collect --
-------------
procedure Collect (Typ : Entity_Id) is
Tag_Comp : Entity_Id;
Parent_Typ : Entity_Id;
begin
-- Handle private types
if Present (Full_View (Etype (Typ))) then
Parent_Typ := Full_View (Etype (Typ));
else
Parent_Typ := Etype (Typ);
end if;
if Parent_Typ /= Typ
-- Protect the frontend against wrong sources. For example:
-- package P is
-- type A is tagged null record;
-- type B is new A with private;
-- type C is new A with private;
-- private
-- type B is new C with null record;
-- type C is new B with null record;
-- end P;
and then Parent_Typ /= Tagged_Type
then
Collect (Parent_Typ);
end if;
-- Collect the components containing tags of secondary dispatch
-- tables.
Tag_Comp := Next_Tag_Component (First_Tag_Component (Typ));
while Present (Tag_Comp) loop
pragma Assert (Present (Related_Type (Tag_Comp)));
Append_Elmt (Tag_Comp, Components_List);
Tag_Comp := Next_Tag_Component (Tag_Comp);
end loop;
end Collect;
-- Start of processing for Collect_Interface_Components
begin
pragma Assert (Ekind (Tagged_Type) = E_Record_Type
and then Is_Tagged_Type (Tagged_Type));
Components_List := New_Elmt_List;
Collect (Tagged_Type);
end Collect_Interface_Components;
-----------------------------
-- Collect_Interfaces_Info --
-----------------------------
procedure Collect_Interfaces_Info
(T : Entity_Id;
Ifaces_List : out Elist_Id;
Components_List : out Elist_Id;
Tags_List : out Elist_Id)
is
Comps_List : Elist_Id;
Comp_Elmt : Elmt_Id;
Comp_Iface : Entity_Id;
Iface_Elmt : Elmt_Id;
Iface : Entity_Id;
function Search_Tag (Iface : Entity_Id) return Entity_Id;
-- Search for the secondary tag associated with the interface type
-- Iface that is implemented by T.
----------------
-- Search_Tag --
----------------
function Search_Tag (Iface : Entity_Id) return Entity_Id is
ADT : Elmt_Id;
begin
if not Is_CPP_Class (T) then
ADT := Next_Elmt (Next_Elmt (First_Elmt (Access_Disp_Table (T))));
else
ADT := Next_Elmt (First_Elmt (Access_Disp_Table (T)));
end if;
while Present (ADT)
and then Is_Tag (Node (ADT))
and then Related_Type (Node (ADT)) /= Iface
loop
-- Skip secondary dispatch table referencing thunks to user
-- defined primitives covered by this interface.
pragma Assert (Has_Suffix (Node (ADT), 'P'));
Next_Elmt (ADT);
-- Skip secondary dispatch tables of Ada types
if not Is_CPP_Class (T) then
-- Skip secondary dispatch table referencing thunks to
-- predefined primitives.
pragma Assert (Has_Suffix (Node (ADT), 'Y'));
Next_Elmt (ADT);
-- Skip secondary dispatch table referencing user-defined
-- primitives covered by this interface.
pragma Assert (Has_Suffix (Node (ADT), 'D'));
Next_Elmt (ADT);
-- Skip secondary dispatch table referencing predefined
-- primitives.
pragma Assert (Has_Suffix (Node (ADT), 'Z'));
Next_Elmt (ADT);
end if;
end loop;
pragma Assert (Is_Tag (Node (ADT)));
return Node (ADT);
end Search_Tag;
-- Start of processing for Collect_Interfaces_Info
begin
Collect_Interfaces (T, Ifaces_List);
Collect_Interface_Components (T, Comps_List);
-- Search for the record component and tag associated with each
-- interface type of T.
Components_List := New_Elmt_List;
Tags_List := New_Elmt_List;
Iface_Elmt := First_Elmt (Ifaces_List);
while Present (Iface_Elmt) loop
Iface := Node (Iface_Elmt);
-- Associate the primary tag component and the primary dispatch table
-- with all the interfaces that are parents of T
if Is_Ancestor (Iface, T, Use_Full_View => True) then
Append_Elmt (First_Tag_Component (T), Components_List);
Append_Elmt (Node (First_Elmt (Access_Disp_Table (T))), Tags_List);
-- Otherwise search for the tag component and secondary dispatch
-- table of Iface
else
Comp_Elmt := First_Elmt (Comps_List);
while Present (Comp_Elmt) loop
Comp_Iface := Related_Type (Node (Comp_Elmt));
if Comp_Iface = Iface
or else Is_Ancestor (Iface, Comp_Iface, Use_Full_View => True)
then
Append_Elmt (Node (Comp_Elmt), Components_List);
Append_Elmt (Search_Tag (Comp_Iface), Tags_List);
exit;
end if;
Next_Elmt (Comp_Elmt);
end loop;
pragma Assert (Present (Comp_Elmt));
end if;
Next_Elmt (Iface_Elmt);
end loop;
end Collect_Interfaces_Info;
---------------------
-- Collect_Parents --
---------------------
procedure Collect_Parents
(T : Entity_Id;
List : out Elist_Id;
Use_Full_View : Boolean := True)
is
Current_Typ : Entity_Id := T;
Parent_Typ : Entity_Id;
begin
List := New_Elmt_List;
-- No action if the if the type has no parents
if T = Etype (T) then
return;
end if;
loop
Parent_Typ := Etype (Current_Typ);
if Is_Private_Type (Parent_Typ)
and then Present (Full_View (Parent_Typ))
and then Use_Full_View
then
Parent_Typ := Full_View (Base_Type (Parent_Typ));
end if;
Append_Elmt (Parent_Typ, List);
exit when Parent_Typ = Current_Typ;
Current_Typ := Parent_Typ;
end loop;
end Collect_Parents;
----------------------------------
-- Collect_Primitive_Operations --
----------------------------------
function Collect_Primitive_Operations (T : Entity_Id) return Elist_Id is
B_Type : constant Entity_Id := Base_Type (T);
B_Decl : constant Node_Id := Original_Node (Parent (B_Type));
B_Scope : Entity_Id := Scope (B_Type);
Op_List : Elist_Id;
Formal : Entity_Id;
Is_Prim : Boolean;
Is_Type_In_Pkg : Boolean;
Formal_Derived : Boolean := False;
Id : Entity_Id;
function Match (E : Entity_Id) return Boolean;
-- True if E's base type is B_Type, or E is of an anonymous access type
-- and the base type of its designated type is B_Type.
-----------
-- Match --
-----------
function Match (E : Entity_Id) return Boolean is
Etyp : Entity_Id := Etype (E);
begin
if Ekind (Etyp) = E_Anonymous_Access_Type then
Etyp := Designated_Type (Etyp);
end if;
-- In Ada 2012 a primitive operation may have a formal of an
-- incomplete view of the parent type.
return Base_Type (Etyp) = B_Type
or else
(Ada_Version >= Ada_2012
and then Ekind (Etyp) = E_Incomplete_Type
and then Full_View (Etyp) = B_Type);
end Match;
-- Start of processing for Collect_Primitive_Operations
begin
-- For tagged types, the primitive operations are collected as they
-- are declared, and held in an explicit list which is simply returned.
if Is_Tagged_Type (B_Type) then
return Primitive_Operations (B_Type);
-- An untagged generic type that is a derived type inherits the
-- primitive operations of its parent type. Other formal types only
-- have predefined operators, which are not explicitly represented.
elsif Is_Generic_Type (B_Type) then
if Nkind (B_Decl) = N_Formal_Type_Declaration
and then Nkind (Formal_Type_Definition (B_Decl)) =
N_Formal_Derived_Type_Definition
then
Formal_Derived := True;
else
return New_Elmt_List;
end if;
end if;
Op_List := New_Elmt_List;
if B_Scope = Standard_Standard then
if B_Type = Standard_String then
Append_Elmt (Standard_Op_Concat, Op_List);
elsif B_Type = Standard_Wide_String then
Append_Elmt (Standard_Op_Concatw, Op_List);
else
null;
end if;
-- Locate the primitive subprograms of the type
else
-- The primitive operations appear after the base type, except
-- if the derivation happens within the private part of B_Scope
-- and the type is a private type, in which case both the type
-- and some primitive operations may appear before the base
-- type, and the list of candidates starts after the type.
if In_Open_Scopes (B_Scope)
and then Scope (T) = B_Scope
and then In_Private_Part (B_Scope)
then
Id := Next_Entity (T);
-- In Ada 2012, If the type has an incomplete partial view, there
-- may be primitive operations declared before the full view, so
-- we need to start scanning from the incomplete view, which is
-- earlier on the entity chain.
elsif Nkind (Parent (B_Type)) = N_Full_Type_Declaration
and then Present (Incomplete_View (Parent (B_Type)))
then
Id := Defining_Entity (Incomplete_View (Parent (B_Type)));
-- If T is a derived from a type with an incomplete view declared
-- elsewhere, that incomplete view is irrelevant, we want the
-- operations in the scope of T.
if Scope (Id) /= Scope (B_Type) then
Id := Next_Entity (B_Type);
end if;
else
Id := Next_Entity (B_Type);
end if;
-- Set flag if this is a type in a package spec
Is_Type_In_Pkg :=
Is_Package_Or_Generic_Package (B_Scope)
and then
Nkind (Parent (Declaration_Node (First_Subtype (T)))) /=
N_Package_Body;
while Present (Id) loop
-- Test whether the result type or any of the parameter types of
-- each subprogram following the type match that type when the
-- type is declared in a package spec, is a derived type, or the
-- subprogram is marked as primitive. (The Is_Primitive test is
-- needed to find primitives of nonderived types in declarative
-- parts that happen to override the predefined "=" operator.)
-- Note that generic formal subprograms are not considered to be
-- primitive operations and thus are never inherited.
if Is_Overloadable (Id)
and then (Is_Type_In_Pkg
or else Is_Derived_Type (B_Type)
or else Is_Primitive (Id))
and then Nkind (Parent (Parent (Id)))
not in N_Formal_Subprogram_Declaration
then
Is_Prim := False;
if Match (Id) then
Is_Prim := True;
else
Formal := First_Formal (Id);
while Present (Formal) loop
if Match (Formal) then
Is_Prim := True;
exit;
end if;
Next_Formal (Formal);
end loop;
end if;
-- For a formal derived type, the only primitives are the ones
-- inherited from the parent type. Operations appearing in the
-- package declaration are not primitive for it.
if Is_Prim
and then (not Formal_Derived or else Present (Alias (Id)))
then
-- In the special case of an equality operator aliased to
-- an overriding dispatching equality belonging to the same
-- type, we don't include it in the list of primitives.
-- This avoids inheriting multiple equality operators when
-- deriving from untagged private types whose full type is
-- tagged, which can otherwise cause ambiguities. Note that
-- this should only happen for this kind of untagged parent
-- type, since normally dispatching operations are inherited
-- using the type's Primitive_Operations list.
if Chars (Id) = Name_Op_Eq
and then Is_Dispatching_Operation (Id)
and then Present (Alias (Id))
and then Present (Overridden_Operation (Alias (Id)))
and then Base_Type (Etype (First_Entity (Id))) =
Base_Type (Etype (First_Entity (Alias (Id))))
then
null;
-- Include the subprogram in the list of primitives
else
Append_Elmt (Id, Op_List);
end if;
end if;
end if;
Next_Entity (Id);
-- For a type declared in System, some of its operations may
-- appear in the target-specific extension to System.
if No (Id)
and then B_Scope = RTU_Entity (System)
and then Present_System_Aux
then
B_Scope := System_Aux_Id;
Id := First_Entity (System_Aux_Id);
end if;
end loop;
end if;
return Op_List;
end Collect_Primitive_Operations;
-----------------------------------
-- Compile_Time_Constraint_Error --
-----------------------------------
function Compile_Time_Constraint_Error
(N : Node_Id;
Msg : String;
Ent : Entity_Id := Empty;
Loc : Source_Ptr := No_Location;
Warn : Boolean := False) return Node_Id
is
Msgc : String (1 .. Msg'Length + 3);
-- Copy of message, with room for possible ?? or << and ! at end
Msgl : Natural;
Wmsg : Boolean;
Eloc : Source_Ptr;
-- Start of processing for Compile_Time_Constraint_Error
begin
-- If this is a warning, convert it into an error if we are in code
-- subject to SPARK_Mode being set On, unless Warn is True to force a
-- warning. The rationale is that a compile-time constraint error should
-- lead to an error instead of a warning when SPARK_Mode is On, but in
-- a few cases we prefer to issue a warning and generate both a suitable
-- run-time error in GNAT and a suitable check message in GNATprove.
-- Those cases are those that likely correspond to deactivated SPARK
-- code, so that this kind of code can be compiled and analyzed instead
-- of being rejected.
Error_Msg_Warn := Warn or SPARK_Mode /= On;
-- A static constraint error in an instance body is not a fatal error.
-- we choose to inhibit the message altogether, because there is no
-- obvious node (for now) on which to post it. On the other hand the
-- offending node must be replaced with a constraint_error in any case.
-- No messages are generated if we already posted an error on this node
if not Error_Posted (N) then
if Loc /= No_Location then
Eloc := Loc;
else
Eloc := Sloc (N);
end if;
-- Copy message to Msgc, converting any ? in the message into
-- < instead, so that we have an error in GNATprove mode.
Msgl := Msg'Length;
for J in 1 .. Msgl loop
if Msg (J) = '?' and then (J = 1 or else Msg (J - 1) /= ''') then
Msgc (J) := '<';
else
Msgc (J) := Msg (J);
end if;
end loop;
-- Message is a warning, even in Ada 95 case
if Msg (Msg'Last) = '?' or else Msg (Msg'Last) = '<' then
Wmsg := True;
-- In Ada 83, all messages are warnings. In the private part and
-- the body of an instance, constraint_checks are only warnings.
-- We also make this a warning if the Warn parameter is set.
elsif Warn
or else (Ada_Version = Ada_83 and then Comes_From_Source (N))
then
Msgl := Msgl + 1;
Msgc (Msgl) := '<';
Msgl := Msgl + 1;
Msgc (Msgl) := '<';
Wmsg := True;
elsif In_Instance_Not_Visible then
Msgl := Msgl + 1;
Msgc (Msgl) := '<';
Msgl := Msgl + 1;
Msgc (Msgl) := '<';
Wmsg := True;
-- Otherwise we have a real error message (Ada 95 static case)
-- and we make this an unconditional message. Note that in the
-- warning case we do not make the message unconditional, it seems
-- quite reasonable to delete messages like this (about exceptions
-- that will be raised) in dead code.
else
Wmsg := False;
Msgl := Msgl + 1;
Msgc (Msgl) := '!';
end if;
-- One more test, skip the warning if the related expression is
-- statically unevaluated, since we don't want to warn about what
-- will happen when something is evaluated if it never will be
-- evaluated.
if not Is_Statically_Unevaluated (N) then
if Present (Ent) then
Error_Msg_NEL (Msgc (1 .. Msgl), N, Ent, Eloc);
else
Error_Msg_NEL (Msgc (1 .. Msgl), N, Etype (N), Eloc);
end if;
if Wmsg then
-- Check whether the context is an Init_Proc
if Inside_Init_Proc then
declare
Conc_Typ : constant Entity_Id :=
Corresponding_Concurrent_Type
(Entity (Parameter_Type (First
(Parameter_Specifications
(Parent (Current_Scope))))));
begin
-- Don't complain if the corresponding concurrent type
-- doesn't come from source (i.e. a single task/protected
-- object).
if Present (Conc_Typ)
and then not Comes_From_Source (Conc_Typ)
then
Error_Msg_NEL
("\& [<<", N, Standard_Constraint_Error, Eloc);
else
if GNATprove_Mode then
Error_Msg_NEL
("\& would have been raised for objects of this "
& "type", N, Standard_Constraint_Error, Eloc);
else
Error_Msg_NEL
("\& will be raised for objects of this type??",
N, Standard_Constraint_Error, Eloc);
end if;
end if;
end;
else
Error_Msg_NEL ("\& [<<", N, Standard_Constraint_Error, Eloc);
end if;
else
Error_Msg ("\static expression fails Constraint_Check", Eloc);
Set_Error_Posted (N);
end if;
end if;
end if;
return N;
end Compile_Time_Constraint_Error;
-----------------------
-- Conditional_Delay --
-----------------------
procedure Conditional_Delay (New_Ent, Old_Ent : Entity_Id) is
begin
if Has_Delayed_Freeze (Old_Ent) and then not Is_Frozen (Old_Ent) then
Set_Has_Delayed_Freeze (New_Ent);
end if;
end Conditional_Delay;
----------------------------
-- Contains_Refined_State --
----------------------------
function Contains_Refined_State (Prag : Node_Id) return Boolean is
function Has_State_In_Dependency (List : Node_Id) return Boolean;
-- Determine whether a dependency list mentions a state with a visible
-- refinement.
function Has_State_In_Global (List : Node_Id) return Boolean;
-- Determine whether a global list mentions a state with a visible
-- refinement.
function Is_Refined_State (Item : Node_Id) return Boolean;
-- Determine whether Item is a reference to an abstract state with a
-- visible refinement.
-----------------------------
-- Has_State_In_Dependency --
-----------------------------
function Has_State_In_Dependency (List : Node_Id) return Boolean is
Clause : Node_Id;
Output : Node_Id;
begin
-- A null dependency list does not mention any states
if Nkind (List) = N_Null then
return False;
-- Dependency clauses appear as component associations of an
-- aggregate.
elsif Nkind (List) = N_Aggregate
and then Present (Component_Associations (List))
then
Clause := First (Component_Associations (List));
while Present (Clause) loop
-- Inspect the outputs of a dependency clause
Output := First (Choices (Clause));
while Present (Output) loop
if Is_Refined_State (Output) then
return True;
end if;
Next (Output);
end loop;
-- Inspect the outputs of a dependency clause
if Is_Refined_State (Expression (Clause)) then
return True;
end if;
Next (Clause);
end loop;
-- If we get here, then none of the dependency clauses mention a
-- state with visible refinement.
return False;
-- An illegal pragma managed to sneak in
else
raise Program_Error;
end if;
end Has_State_In_Dependency;
-------------------------
-- Has_State_In_Global --
-------------------------
function Has_State_In_Global (List : Node_Id) return Boolean is
Item : Node_Id;
begin
-- A null global list does not mention any states
if Nkind (List) = N_Null then
return False;
-- Simple global list or moded global list declaration
elsif Nkind (List) = N_Aggregate then
-- The declaration of a simple global list appear as a collection
-- of expressions.
if Present (Expressions (List)) then
Item := First (Expressions (List));
while Present (Item) loop
if Is_Refined_State (Item) then
return True;
end if;
Next (Item);
end loop;
-- The declaration of a moded global list appears as a collection
-- of component associations where individual choices denote
-- modes.
else
Item := First (Component_Associations (List));
while Present (Item) loop
if Has_State_In_Global (Expression (Item)) then
return True;
end if;
Next (Item);
end loop;
end if;
-- If we get here, then the simple/moded global list did not
-- mention any states with a visible refinement.
return False;
-- Single global item declaration
elsif Is_Entity_Name (List) then
return Is_Refined_State (List);
-- An illegal pragma managed to sneak in
else
raise Program_Error;
end if;
end Has_State_In_Global;
----------------------
-- Is_Refined_State --
----------------------
function Is_Refined_State (Item : Node_Id) return Boolean is
Elmt : Node_Id;
Item_Id : Entity_Id;
begin
if Nkind (Item) = N_Null then
return False;
-- States cannot be subject to attribute 'Result. This case arises
-- in dependency relations.
elsif Nkind (Item) = N_Attribute_Reference
and then Attribute_Name (Item) = Name_Result
then
return False;
-- Multiple items appear as an aggregate. This case arises in
-- dependency relations.
elsif Nkind (Item) = N_Aggregate
and then Present (Expressions (Item))
then
Elmt := First (Expressions (Item));
while Present (Elmt) loop
if Is_Refined_State (Elmt) then
return True;
end if;
Next (Elmt);
end loop;
-- If we get here, then none of the inputs or outputs reference a
-- state with visible refinement.
return False;
-- Single item
else
Item_Id := Entity_Of (Item);
return
Present (Item_Id)
and then Ekind (Item_Id) = E_Abstract_State
and then Has_Visible_Refinement (Item_Id);
end if;
end Is_Refined_State;
-- Local variables
Arg : constant Node_Id :=
Get_Pragma_Arg (First (Pragma_Argument_Associations (Prag)));
Nam : constant Name_Id := Pragma_Name (Prag);
-- Start of processing for Contains_Refined_State
begin
if Nam = Name_Depends then
return Has_State_In_Dependency (Arg);
else pragma Assert (Nam = Name_Global);
return Has_State_In_Global (Arg);
end if;
end Contains_Refined_State;
-------------------------
-- Copy_Component_List --
-------------------------
function Copy_Component_List
(R_Typ : Entity_Id;
Loc : Source_Ptr) return List_Id
is
Comp : Node_Id;
Comps : constant List_Id := New_List;
begin
Comp := First_Component (Underlying_Type (R_Typ));
while Present (Comp) loop
if Comes_From_Source (Comp) then
declare
Comp_Decl : constant Node_Id := Declaration_Node (Comp);
begin
Append_To (Comps,
Make_Component_Declaration (Loc,
Defining_Identifier =>
Make_Defining_Identifier (Loc, Chars (Comp)),
Component_Definition =>
New_Copy_Tree
(Component_Definition (Comp_Decl), New_Sloc => Loc)));
end;
end if;
Next_Component (Comp);
end loop;
return Comps;
end Copy_Component_List;
-------------------------
-- Copy_Parameter_List --
-------------------------
function Copy_Parameter_List (Subp_Id : Entity_Id) return List_Id is
Loc : constant Source_Ptr := Sloc (Subp_Id);
Plist : List_Id;
Formal : Entity_Id;
begin
if No (First_Formal (Subp_Id)) then
return No_List;
else
Plist := New_List;
Formal := First_Formal (Subp_Id);
while Present (Formal) loop
Append_To (Plist,
Make_Parameter_Specification (Loc,
Defining_Identifier =>
Make_Defining_Identifier (Sloc (Formal), Chars (Formal)),
In_Present => In_Present (Parent (Formal)),
Out_Present => Out_Present (Parent (Formal)),
Parameter_Type =>
New_Occurrence_Of (Etype (Formal), Loc),
Expression =>
New_Copy_Tree (Expression (Parent (Formal)))));
Next_Formal (Formal);
end loop;
end if;
return Plist;
end Copy_Parameter_List;
----------------------------
-- Copy_SPARK_Mode_Aspect --
----------------------------
procedure Copy_SPARK_Mode_Aspect (From : Node_Id; To : Node_Id) is
pragma Assert (not Has_Aspects (To));
Asp : Node_Id;
begin
if Has_Aspects (From) then
Asp := Find_Aspect (Defining_Entity (From), Aspect_SPARK_Mode);
if Present (Asp) then
Set_Aspect_Specifications (To, New_List (New_Copy_Tree (Asp)));
Set_Has_Aspects (To, True);
end if;
end if;
end Copy_SPARK_Mode_Aspect;
--------------------------
-- Copy_Subprogram_Spec --
--------------------------
function Copy_Subprogram_Spec (Spec : Node_Id) return Node_Id is
Def_Id : Node_Id;
Formal_Spec : Node_Id;
Result : Node_Id;
begin
-- The structure of the original tree must be replicated without any
-- alterations. Use New_Copy_Tree for this purpose.
Result := New_Copy_Tree (Spec);
-- Create a new entity for the defining unit name
Def_Id := Defining_Unit_Name (Result);
Set_Defining_Unit_Name (Result,
Make_Defining_Identifier (Sloc (Def_Id), Chars (Def_Id)));
-- Create new entities for the formal parameters
if Present (Parameter_Specifications (Result)) then
Formal_Spec := First (Parameter_Specifications (Result));
while Present (Formal_Spec) loop
Def_Id := Defining_Identifier (Formal_Spec);
Set_Defining_Identifier (Formal_Spec,
Make_Defining_Identifier (Sloc (Def_Id), Chars (Def_Id)));
Next (Formal_Spec);
end loop;
end if;
return Result;
end Copy_Subprogram_Spec;
--------------------------------
-- Corresponding_Generic_Type --
--------------------------------
function Corresponding_Generic_Type (T : Entity_Id) return Entity_Id is
Inst : Entity_Id;
Gen : Entity_Id;
Typ : Entity_Id;
begin
if not Is_Generic_Actual_Type (T) then
return Any_Type;
-- If the actual is the actual of an enclosing instance, resolution
-- was correct in the generic.
elsif Nkind (Parent (T)) = N_Subtype_Declaration
and then Is_Entity_Name (Subtype_Indication (Parent (T)))
and then
Is_Generic_Actual_Type (Entity (Subtype_Indication (Parent (T))))
then
return Any_Type;
else
Inst := Scope (T);
if Is_Wrapper_Package (Inst) then
Inst := Related_Instance (Inst);
end if;
Gen :=
Generic_Parent
(Specification (Unit_Declaration_Node (Inst)));
-- Generic actual has the same name as the corresponding formal
Typ := First_Entity (Gen);
while Present (Typ) loop
if Chars (Typ) = Chars (T) then
return Typ;
end if;
Next_Entity (Typ);
end loop;
return Any_Type;
end if;
end Corresponding_Generic_Type;
--------------------
-- Current_Entity --
--------------------
-- The currently visible definition for a given identifier is the
-- one most chained at the start of the visibility chain, i.e. the
-- one that is referenced by the Node_Id value of the name of the
-- given identifier.
function Current_Entity (N : Node_Id) return Entity_Id is
begin
return Get_Name_Entity_Id (Chars (N));
end Current_Entity;
-----------------------------
-- Current_Entity_In_Scope --
-----------------------------
function Current_Entity_In_Scope (N : Node_Id) return Entity_Id is
E : Entity_Id;
CS : constant Entity_Id := Current_Scope;
Transient_Case : constant Boolean := Scope_Is_Transient;
begin
E := Get_Name_Entity_Id (Chars (N));
while Present (E)
and then Scope (E) /= CS
and then (not Transient_Case or else Scope (E) /= Scope (CS))
loop
E := Homonym (E);
end loop;
return E;
end Current_Entity_In_Scope;
-------------------
-- Current_Scope --
-------------------
function Current_Scope return Entity_Id is
begin
if Scope_Stack.Last = -1 then
return Standard_Standard;
else
declare
C : constant Entity_Id :=
Scope_Stack.Table (Scope_Stack.Last).Entity;
begin
if Present (C) then
return C;
else
return Standard_Standard;
end if;
end;
end if;
end Current_Scope;
----------------------------
-- Current_Scope_No_Loops --
----------------------------
function Current_Scope_No_Loops return Entity_Id is
S : Entity_Id;
begin
-- Examine the scope stack starting from the current scope and skip any
-- internally generated loops.
S := Current_Scope;
while Present (S) and then S /= Standard_Standard loop
if Ekind (S) = E_Loop and then not Comes_From_Source (S) then
S := Scope (S);
else
exit;
end if;
end loop;
return S;
end Current_Scope_No_Loops;
------------------------
-- Current_Subprogram --
------------------------
function Current_Subprogram return Entity_Id is
Scop : constant Entity_Id := Current_Scope;
begin
if Is_Subprogram_Or_Generic_Subprogram (Scop) then
return Scop;
else
return Enclosing_Subprogram (Scop);
end if;
end Current_Subprogram;
----------------------------------
-- Deepest_Type_Access_Level --
----------------------------------
function Deepest_Type_Access_Level (Typ : Entity_Id) return Uint is
begin
if Ekind (Typ) = E_Anonymous_Access_Type
and then not Is_Local_Anonymous_Access (Typ)
and then Nkind (Associated_Node_For_Itype (Typ)) = N_Object_Declaration
then
-- Typ is the type of an Ada 2012 stand-alone object of an anonymous
-- access type.
return
Scope_Depth (Enclosing_Dynamic_Scope
(Defining_Identifier
(Associated_Node_For_Itype (Typ))));
-- For generic formal type, return Int'Last (infinite).
-- See comment preceding Is_Generic_Type call in Type_Access_Level.
elsif Is_Generic_Type (Root_Type (Typ)) then
return UI_From_Int (Int'Last);
else
return Type_Access_Level (Typ);
end if;
end Deepest_Type_Access_Level;
---------------------
-- Defining_Entity --
---------------------
function Defining_Entity
(N : Node_Id;
Empty_On_Errors : Boolean := False) return Entity_Id
is
Err : Entity_Id := Empty;
begin
case Nkind (N) is
when N_Abstract_Subprogram_Declaration
| N_Expression_Function
| N_Formal_Subprogram_Declaration
| N_Generic_Package_Declaration
| N_Generic_Subprogram_Declaration
| N_Package_Declaration
| N_Subprogram_Body
| N_Subprogram_Body_Stub
| N_Subprogram_Declaration
| N_Subprogram_Renaming_Declaration
=>
return Defining_Entity (Specification (N));
when N_Component_Declaration
| N_Defining_Program_Unit_Name
| N_Discriminant_Specification
| N_Entry_Body
| N_Entry_Declaration
| N_Entry_Index_Specification
| N_Exception_Declaration
| N_Exception_Renaming_Declaration
| N_Formal_Object_Declaration
| N_Formal_Package_Declaration
| N_Formal_Type_Declaration
| N_Full_Type_Declaration
| N_Implicit_Label_Declaration
| N_Incomplete_Type_Declaration
| N_Iterator_Specification
| N_Loop_Parameter_Specification
| N_Number_Declaration
| N_Object_Declaration
| N_Object_Renaming_Declaration
| N_Package_Body_Stub
| N_Parameter_Specification
| N_Private_Extension_Declaration
| N_Private_Type_Declaration
| N_Protected_Body
| N_Protected_Body_Stub
| N_Protected_Type_Declaration
| N_Single_Protected_Declaration
| N_Single_Task_Declaration
| N_Subtype_Declaration
| N_Task_Body
| N_Task_Body_Stub
| N_Task_Type_Declaration
=>
return Defining_Identifier (N);
when N_Subunit =>
return Defining_Entity (Proper_Body (N));
when N_Function_Instantiation
| N_Function_Specification
| N_Generic_Function_Renaming_Declaration
| N_Generic_Package_Renaming_Declaration
| N_Generic_Procedure_Renaming_Declaration
| N_Package_Body
| N_Package_Instantiation
| N_Package_Renaming_Declaration
| N_Package_Specification
| N_Procedure_Instantiation
| N_Procedure_Specification
=>
declare
Nam : constant Node_Id := Defining_Unit_Name (N);
begin
if Nkind (Nam) in N_Entity then
return Nam;
-- For Error, make up a name and attach to declaration so we
-- can continue semantic analysis.
elsif Nam = Error then
if Empty_On_Errors then
return Empty;
else
Err := Make_Temporary (Sloc (N), 'T');
Set_Defining_Unit_Name (N, Err);
return Err;
end if;
-- If not an entity, get defining identifier
else
return Defining_Identifier (Nam);
end if;
end;
when N_Block_Statement
| N_Loop_Statement
=>
return Entity (Identifier (N));
when others =>
if Empty_On_Errors then
return Empty;
else
raise Program_Error;
end if;
end case;
end Defining_Entity;
--------------------------
-- Denotes_Discriminant --
--------------------------
function Denotes_Discriminant
(N : Node_Id;
Check_Concurrent : Boolean := False) return Boolean
is
E : Entity_Id;
begin
if not Is_Entity_Name (N) or else No (Entity (N)) then
return False;
else
E := Entity (N);
end if;
-- If we are checking for a protected type, the discriminant may have
-- been rewritten as the corresponding discriminal of the original type
-- or of the corresponding concurrent record, depending on whether we
-- are in the spec or body of the protected type.
return Ekind (E) = E_Discriminant
or else
(Check_Concurrent
and then Ekind (E) = E_In_Parameter
and then Present (Discriminal_Link (E))
and then
(Is_Concurrent_Type (Scope (Discriminal_Link (E)))
or else
Is_Concurrent_Record_Type (Scope (Discriminal_Link (E)))));
end Denotes_Discriminant;
-------------------------
-- Denotes_Same_Object --
-------------------------
function Denotes_Same_Object (A1, A2 : Node_Id) return Boolean is
Obj1 : Node_Id := A1;
Obj2 : Node_Id := A2;
function Has_Prefix (N : Node_Id) return Boolean;
-- Return True if N has attribute Prefix
function Is_Renaming (N : Node_Id) return Boolean;
-- Return true if N names a renaming entity
function Is_Valid_Renaming (N : Node_Id) return Boolean;
-- For renamings, return False if the prefix of any dereference within
-- the renamed object_name is a variable, or any expression within the
-- renamed object_name contains references to variables or calls on
-- nonstatic functions; otherwise return True (RM 6.4.1(6.10/3))
----------------
-- Has_Prefix --
----------------
function Has_Prefix (N : Node_Id) return Boolean is
begin
return
Nkind_In (N,
N_Attribute_Reference,
N_Expanded_Name,
N_Explicit_Dereference,
N_Indexed_Component,
N_Reference,
N_Selected_Component,
N_Slice);
end Has_Prefix;
-----------------
-- Is_Renaming --
-----------------
function Is_Renaming (N : Node_Id) return Boolean is
begin
return Is_Entity_Name (N)
and then Present (Renamed_Entity (Entity (N)));
end Is_Renaming;
-----------------------
-- Is_Valid_Renaming --
-----------------------
function Is_Valid_Renaming (N : Node_Id) return Boolean is
function Check_Renaming (N : Node_Id) return Boolean;
-- Recursive function used to traverse all the prefixes of N
function Check_Renaming (N : Node_Id) return Boolean is
begin
if Is_Renaming (N)
and then not Check_Renaming (Renamed_Entity (Entity (N)))
then
return False;
end if;
if Nkind (N) = N_Indexed_Component then
declare
Indx : Node_Id;
begin
Indx := First (Expressions (N));
while Present (Indx) loop
if not Is_OK_Static_Expression (Indx) then
return False;
end if;
Next_Index (Indx);
end loop;
end;
end if;
if Has_Prefix (N) then
declare
P : constant Node_Id := Prefix (N);
begin
if Nkind (N) = N_Explicit_Dereference
and then Is_Variable (P)
then
return False;
elsif Is_Entity_Name (P)
and then Ekind (Entity (P)) = E_Function
then
return False;
elsif Nkind (P) = N_Function_Call then
return False;
end if;
-- Recursion to continue traversing the prefix of the
-- renaming expression
return Check_Renaming (P);
end;
end if;
return True;
end Check_Renaming;
-- Start of processing for Is_Valid_Renaming
begin
return Check_Renaming (N);
end Is_Valid_Renaming;
-- Start of processing for Denotes_Same_Object
begin
-- Both names statically denote the same stand-alone object or parameter
-- (RM 6.4.1(6.5/3))
if Is_Entity_Name (Obj1)
and then Is_Entity_Name (Obj2)
and then Entity (Obj1) = Entity (Obj2)
then
return True;
end if;
-- For renamings, the prefix of any dereference within the renamed
-- object_name is not a variable, and any expression within the
-- renamed object_name contains no references to variables nor
-- calls on nonstatic functions (RM 6.4.1(6.10/3)).
if Is_Renaming (Obj1) then
if Is_Valid_Renaming (Obj1) then
Obj1 := Renamed_Entity (Entity (Obj1));
else
return False;
end if;
end if;
if Is_Renaming (Obj2) then
if Is_Valid_Renaming (Obj2) then
Obj2 := Renamed_Entity (Entity (Obj2));
else
return False;
end if;
end if;
-- No match if not same node kind (such cases are handled by
-- Denotes_Same_Prefix)
if Nkind (Obj1) /= Nkind (Obj2) then
return False;
-- After handling valid renamings, one of the two names statically
-- denoted a renaming declaration whose renamed object_name is known
-- to denote the same object as the other (RM 6.4.1(6.10/3))
elsif Is_Entity_Name (Obj1) then
if Is_Entity_Name (Obj2) then
return Entity (Obj1) = Entity (Obj2);
else
return False;
end if;
-- Both names are selected_components, their prefixes are known to
-- denote the same object, and their selector_names denote the same
-- component (RM 6.4.1(6.6/3)).
elsif Nkind (Obj1) = N_Selected_Component then
return Denotes_Same_Object (Prefix (Obj1), Prefix (Obj2))
and then
Entity (Selector_Name (Obj1)) = Entity (Selector_Name (Obj2));
-- Both names are dereferences and the dereferenced names are known to
-- denote the same object (RM 6.4.1(6.7/3))
elsif Nkind (Obj1) = N_Explicit_Dereference then
return Denotes_Same_Object (Prefix (Obj1), Prefix (Obj2));
-- Both names are indexed_components, their prefixes are known to denote
-- the same object, and each of the pairs of corresponding index values
-- are either both static expressions with the same static value or both
-- names that are known to denote the same object (RM 6.4.1(6.8/3))
elsif Nkind (Obj1) = N_Indexed_Component then
if not Denotes_Same_Object (Prefix (Obj1), Prefix (Obj2)) then
return False;
else
declare
Indx1 : Node_Id;
Indx2 : Node_Id;
begin
Indx1 := First (Expressions (Obj1));
Indx2 := First (Expressions (Obj2));
while Present (Indx1) loop
-- Indexes must denote the same static value or same object
if Is_OK_Static_Expression (Indx1) then
if not Is_OK_Static_Expression (Indx2) then
return False;
elsif Expr_Value (Indx1) /= Expr_Value (Indx2) then
return False;
end if;
elsif not Denotes_Same_Object (Indx1, Indx2) then
return False;
end if;
Next (Indx1);
Next (Indx2);
end loop;
return True;
end;
end if;
-- Both names are slices, their prefixes are known to denote the same
-- object, and the two slices have statically matching index constraints
-- (RM 6.4.1(6.9/3))
elsif Nkind (Obj1) = N_Slice
and then Denotes_Same_Object (Prefix (Obj1), Prefix (Obj2))
then
declare
Lo1, Lo2, Hi1, Hi2 : Node_Id;
begin
Get_Index_Bounds (Etype (Obj1), Lo1, Hi1);
Get_Index_Bounds (Etype (Obj2), Lo2, Hi2);
-- Check whether bounds are statically identical. There is no
-- attempt to detect partial overlap of slices.
return Denotes_Same_Object (Lo1, Lo2)
and then
Denotes_Same_Object (Hi1, Hi2);
end;
-- In the recursion, literals appear as indexes
elsif Nkind (Obj1) = N_Integer_Literal
and then
Nkind (Obj2) = N_Integer_Literal
then
return Intval (Obj1) = Intval (Obj2);
else
return False;
end if;
end Denotes_Same_Object;
-------------------------
-- Denotes_Same_Prefix --
-------------------------
function Denotes_Same_Prefix (A1, A2 : Node_Id) return Boolean is
begin
if Is_Entity_Name (A1) then
if Nkind_In (A2, N_Selected_Component, N_Indexed_Component)
and then not Is_Access_Type (Etype (A1))
then
return Denotes_Same_Object (A1, Prefix (A2))
or else Denotes_Same_Prefix (A1, Prefix (A2));
else
return False;
end if;
elsif Is_Entity_Name (A2) then
return Denotes_Same_Prefix (A1 => A2, A2 => A1);
elsif Nkind_In (A1, N_Selected_Component, N_Indexed_Component, N_Slice)
and then
Nkind_In (A2, N_Selected_Component, N_Indexed_Component, N_Slice)
then
declare
Root1, Root2 : Node_Id;
Depth1, Depth2 : Nat := 0;
begin
Root1 := Prefix (A1);
while not Is_Entity_Name (Root1) loop
if not Nkind_In
(Root1, N_Selected_Component, N_Indexed_Component)
then
return False;
else
Root1 := Prefix (Root1);
end if;
Depth1 := Depth1 + 1;
end loop;
Root2 := Prefix (A2);
while not Is_Entity_Name (Root2) loop
if not Nkind_In (Root2, N_Selected_Component,
N_Indexed_Component)
then
return False;
else
Root2 := Prefix (Root2);
end if;
Depth2 := Depth2 + 1;
end loop;
-- If both have the same depth and they do not denote the same
-- object, they are disjoint and no warning is needed.
if Depth1 = Depth2 then
return False;
elsif Depth1 > Depth2 then
Root1 := Prefix (A1);
for J in 1 .. Depth1 - Depth2 - 1 loop
Root1 := Prefix (Root1);
end loop;
return Denotes_Same_Object (Root1, A2);
else
Root2 := Prefix (A2);
for J in 1 .. Depth2 - Depth1 - 1 loop
Root2 := Prefix (Root2);
end loop;
return Denotes_Same_Object (A1, Root2);
end if;
end;
else
return False;
end if;
end Denotes_Same_Prefix;
----------------------
-- Denotes_Variable --
----------------------
function Denotes_Variable (N : Node_Id) return Boolean is
begin
return Is_Variable (N) and then Paren_Count (N) = 0;
end Denotes_Variable;
-----------------------------
-- Depends_On_Discriminant --
-----------------------------
function Depends_On_Discriminant (N : Node_Id) return Boolean is
L : Node_Id;
H : Node_Id;
begin
Get_Index_Bounds (N, L, H);
return Denotes_Discriminant (L) or else Denotes_Discriminant (H);
end Depends_On_Discriminant;
-------------------------
-- Designate_Same_Unit --
-------------------------
function Designate_Same_Unit
(Name1 : Node_Id;
Name2 : Node_Id) return Boolean
is
K1 : constant Node_Kind := Nkind (Name1);
K2 : constant Node_Kind := Nkind (Name2);
function Prefix_Node (N : Node_Id) return Node_Id;
-- Returns the parent unit name node of a defining program unit name
-- or the prefix if N is a selected component or an expanded name.
function Select_Node (N : Node_Id) return Node_Id;
-- Returns the defining identifier node of a defining program unit
-- name or the selector node if N is a selected component or an
-- expanded name.
-----------------
-- Prefix_Node --
-----------------
function Prefix_Node (N : Node_Id) return Node_Id is
begin
if Nkind (N) = N_Defining_Program_Unit_Name then
return Name (N);
else
return Prefix (N);
end if;
end Prefix_Node;
-----------------
-- Select_Node --
-----------------
function Select_Node (N : Node_Id) return Node_Id is
begin
if Nkind (N) = N_Defining_Program_Unit_Name then
return Defining_Identifier (N);
else
return Selector_Name (N);
end if;
end Select_Node;
-- Start of processing for Designate_Same_Unit
begin
if Nkind_In (K1, N_Identifier, N_Defining_Identifier)
and then
Nkind_In (K2, N_Identifier, N_Defining_Identifier)
then
return Chars (Name1) = Chars (Name2);
elsif Nkind_In (K1, N_Expanded_Name,
N_Selected_Component,
N_Defining_Program_Unit_Name)
and then
Nkind_In (K2, N_Expanded_Name,
N_Selected_Component,
N_Defining_Program_Unit_Name)
then
return
(Chars (Select_Node (Name1)) = Chars (Select_Node (Name2)))
and then
Designate_Same_Unit (Prefix_Node (Name1), Prefix_Node (Name2));
else
return False;
end if;
end Designate_Same_Unit;
------------------------------------------
-- function Dynamic_Accessibility_Level --
------------------------------------------
function Dynamic_Accessibility_Level (Expr : Node_Id) return Node_Id is
E : Entity_Id;
Loc : constant Source_Ptr := Sloc (Expr);
function Make_Level_Literal (Level : Uint) return Node_Id;
-- Construct an integer literal representing an accessibility level
-- with its type set to Natural.
------------------------
-- Make_Level_Literal --
------------------------
function Make_Level_Literal (Level : Uint) return Node_Id is
Result : constant Node_Id := Make_Integer_Literal (Loc, Level);
begin
Set_Etype (Result, Standard_Natural);
return Result;
end Make_Level_Literal;
-- Start of processing for Dynamic_Accessibility_Level
begin
if Is_Entity_Name (Expr) then
E := Entity (Expr);
if Present (Renamed_Object (E)) then
return Dynamic_Accessibility_Level (Renamed_Object (E));
end if;
if Is_Formal (E) or else Ekind_In (E, E_Variable, E_Constant) then
if Present (Extra_Accessibility (E)) then
return New_Occurrence_Of (Extra_Accessibility (E), Loc);
end if;
end if;
end if;
-- Unimplemented: Ptr.all'Access, where Ptr has Extra_Accessibility ???
case Nkind (Expr) is
-- For access discriminant, the level of the enclosing object
when N_Selected_Component =>
if Ekind (Entity (Selector_Name (Expr))) = E_Discriminant
and then Ekind (Etype (Entity (Selector_Name (Expr)))) =
E_Anonymous_Access_Type
then
return Make_Level_Literal (Object_Access_Level (Expr));
end if;
when N_Attribute_Reference =>
case Get_Attribute_Id (Attribute_Name (Expr)) is
-- For X'Access, the level of the prefix X
when Attribute_Access =>
return Make_Level_Literal
(Object_Access_Level (Prefix (Expr)));
-- Treat the unchecked attributes as library-level
when Attribute_Unchecked_Access
| Attribute_Unrestricted_Access
=>
return Make_Level_Literal (Scope_Depth (Standard_Standard));
-- No other access-valued attributes
when others =>
raise Program_Error;
end case;
when N_Allocator =>
-- Unimplemented: depends on context. As an actual parameter where
-- formal type is anonymous, use
-- Scope_Depth (Current_Scope) + 1.
-- For other cases, see 3.10.2(14/3) and following. ???
null;
when N_Type_Conversion =>
if not Is_Local_Anonymous_Access (Etype (Expr)) then
-- Handle type conversions introduced for a rename of an
-- Ada 2012 stand-alone object of an anonymous access type.
return Dynamic_Accessibility_Level (Expression (Expr));
end if;
when others =>
null;
end case;
return Make_Level_Literal (Type_Access_Level (Etype (Expr)));
end Dynamic_Accessibility_Level;
-----------------------------------
-- Effective_Extra_Accessibility --
-----------------------------------
function Effective_Extra_Accessibility (Id : Entity_Id) return Entity_Id is
begin
if Present (Renamed_Object (Id))
and then Is_Entity_Name (Renamed_Object (Id))
then
return Effective_Extra_Accessibility (Entity (Renamed_Object (Id)));
else
return Extra_Accessibility (Id);
end if;
end Effective_Extra_Accessibility;
-----------------------------
-- Effective_Reads_Enabled --
-----------------------------
function Effective_Reads_Enabled (Id : Entity_Id) return Boolean is
begin
return Has_Enabled_Property (Id, Name_Effective_Reads);
end Effective_Reads_Enabled;
------------------------------
-- Effective_Writes_Enabled --
------------------------------
function Effective_Writes_Enabled (Id : Entity_Id) return Boolean is
begin
return Has_Enabled_Property (Id, Name_Effective_Writes);
end Effective_Writes_Enabled;
------------------------------
-- Enclosing_Comp_Unit_Node --
------------------------------
function Enclosing_Comp_Unit_Node (N : Node_Id) return Node_Id is
Current_Node : Node_Id;
begin
Current_Node := N;
while Present (Current_Node)
and then Nkind (Current_Node) /= N_Compilation_Unit
loop
Current_Node := Parent (Current_Node);
end loop;
if Nkind (Current_Node) /= N_Compilation_Unit then
return Empty;
else
return Current_Node;
end if;
end Enclosing_Comp_Unit_Node;
--------------------------
-- Enclosing_CPP_Parent --
--------------------------
function Enclosing_CPP_Parent (Typ : Entity_Id) return Entity_Id is
Parent_Typ : Entity_Id := Typ;
begin
while not Is_CPP_Class (Parent_Typ)
and then Etype (Parent_Typ) /= Parent_Typ
loop
Parent_Typ := Etype (Parent_Typ);
if Is_Private_Type (Parent_Typ) then
Parent_Typ := Full_View (Base_Type (Parent_Typ));
end if;
end loop;
pragma Assert (Is_CPP_Class (Parent_Typ));
return Parent_Typ;
end Enclosing_CPP_Parent;
---------------------------
-- Enclosing_Declaration --
---------------------------
function Enclosing_Declaration (N : Node_Id) return Node_Id is
Decl : Node_Id := N;
begin
while Present (Decl)
and then not (Nkind (Decl) in N_Declaration
or else
Nkind (Decl) in N_Later_Decl_Item)
loop
Decl := Parent (Decl);
end loop;
return Decl;
end Enclosing_Declaration;
----------------------------
-- Enclosing_Generic_Body --
----------------------------
function Enclosing_Generic_Body
(N : Node_Id) return Node_Id
is
P : Node_Id;
Decl : Node_Id;
Spec : Node_Id;
begin
P := Parent (N);
while Present (P) loop
if Nkind (P) = N_Package_Body
or else Nkind (P) = N_Subprogram_Body
then
Spec := Corresponding_Spec (P);
if Present (Spec) then
Decl := Unit_Declaration_Node (Spec);
if Nkind (Decl) = N_Generic_Package_Declaration
or else Nkind (Decl) = N_Generic_Subprogram_Declaration
then
return P;
end if;
end if;
end if;
P := Parent (P);
end loop;
return Empty;
end Enclosing_Generic_Body;
----------------------------
-- Enclosing_Generic_Unit --
----------------------------
function Enclosing_Generic_Unit
(N : Node_Id) return Node_Id
is
P : Node_Id;
Decl : Node_Id;
Spec : Node_Id;
begin
P := Parent (N);
while Present (P) loop
if Nkind (P) = N_Generic_Package_Declaration
or else Nkind (P) = N_Generic_Subprogram_Declaration
then
return P;
elsif Nkind (P) = N_Package_Body
or else Nkind (P) = N_Subprogram_Body
then
Spec := Corresponding_Spec (P);
if Present (Spec) then
Decl := Unit_Declaration_Node (Spec);
if Nkind (Decl) = N_Generic_Package_Declaration
or else Nkind (Decl) = N_Generic_Subprogram_Declaration
then
return Decl;
end if;
end if;
end if;
P := Parent (P);
end loop;
return Empty;
end Enclosing_Generic_Unit;
-------------------------------
-- Enclosing_Lib_Unit_Entity --
-------------------------------
function Enclosing_Lib_Unit_Entity
(E : Entity_Id := Current_Scope) return Entity_Id
is
Unit_Entity : Entity_Id;
begin
-- Look for enclosing library unit entity by following scope links.
-- Equivalent to, but faster than indexing through the scope stack.
Unit_Entity := E;
while (Present (Scope (Unit_Entity))
and then Scope (Unit_Entity) /= Standard_Standard)
and not Is_Child_Unit (Unit_Entity)
loop
Unit_Entity := Scope (Unit_Entity);
end loop;
return Unit_Entity;
end Enclosing_Lib_Unit_Entity;
-----------------------------
-- Enclosing_Lib_Unit_Node --
-----------------------------
function Enclosing_Lib_Unit_Node (N : Node_Id) return Node_Id is
Encl_Unit : Node_Id;
begin
Encl_Unit := Enclosing_Comp_Unit_Node (N);
while Present (Encl_Unit)
and then Nkind (Unit (Encl_Unit)) = N_Subunit
loop
Encl_Unit := Library_Unit (Encl_Unit);
end loop;
pragma Assert (Nkind (Encl_Unit) = N_Compilation_Unit);
return Encl_Unit;
end Enclosing_Lib_Unit_Node;
-----------------------
-- Enclosing_Package --
-----------------------
function Enclosing_Package (E : Entity_Id) return Entity_Id is
Dynamic_Scope : constant Entity_Id := Enclosing_Dynamic_Scope (E);
begin
if Dynamic_Scope = Standard_Standard then
return Standard_Standard;
elsif Dynamic_Scope = Empty then
return Empty;
elsif Ekind_In (Dynamic_Scope, E_Package, E_Package_Body,
E_Generic_Package)
then
return Dynamic_Scope;
else
return Enclosing_Package (Dynamic_Scope);
end if;
end Enclosing_Package;
-------------------------------------
-- Enclosing_Package_Or_Subprogram --
-------------------------------------
function Enclosing_Package_Or_Subprogram (E : Entity_Id) return Entity_Id is
S : Entity_Id;
begin
S := Scope (E);
while Present (S) loop
if Is_Package_Or_Generic_Package (S)
or else Ekind (S) = E_Package_Body
then
return S;
elsif Is_Subprogram_Or_Generic_Subprogram (S)
or else Ekind (S) = E_Subprogram_Body
then
return S;
else
S := Scope (S);
end if;
end loop;
return Empty;
end Enclosing_Package_Or_Subprogram;
--------------------------
-- Enclosing_Subprogram --
--------------------------
function Enclosing_Subprogram (E : Entity_Id) return Entity_Id is
Dynamic_Scope : constant Entity_Id := Enclosing_Dynamic_Scope (E);
begin
if Dynamic_Scope = Standard_Standard then
return Empty;
elsif Dynamic_Scope = Empty then
return Empty;
elsif Ekind (Dynamic_Scope) = E_Subprogram_Body then
return Corresponding_Spec (Parent (Parent (Dynamic_Scope)));
elsif Ekind (Dynamic_Scope) = E_Block
or else Ekind (Dynamic_Scope) = E_Return_Statement
then
return Enclosing_Subprogram (Dynamic_Scope);
elsif Ekind (Dynamic_Scope) = E_Task_Type then
return Get_Task_Body_Procedure (Dynamic_Scope);
elsif Ekind (Dynamic_Scope) = E_Limited_Private_Type
and then Present (Full_View (Dynamic_Scope))
and then Ekind (Full_View (Dynamic_Scope)) = E_Task_Type
then
return Get_Task_Body_Procedure (Full_View (Dynamic_Scope));
-- No body is generated if the protected operation is eliminated
elsif Convention (Dynamic_Scope) = Convention_Protected
and then not Is_Eliminated (Dynamic_Scope)
and then Present (Protected_Body_Subprogram (Dynamic_Scope))
then
return Protected_Body_Subprogram (Dynamic_Scope);
else
return Dynamic_Scope;
end if;
end Enclosing_Subprogram;
------------------------
-- Ensure_Freeze_Node --
------------------------
procedure Ensure_Freeze_Node (E : Entity_Id) is
FN : Node_Id;
begin
if No (Freeze_Node (E)) then
FN := Make_Freeze_Entity (Sloc (E));
Set_Has_Delayed_Freeze (E);
Set_Freeze_Node (E, FN);
Set_Access_Types_To_Process (FN, No_Elist);
Set_TSS_Elist (FN, No_Elist);
Set_Entity (FN, E);
end if;
end Ensure_Freeze_Node;
----------------
-- Enter_Name --
----------------
procedure Enter_Name (Def_Id : Entity_Id) is
C : constant Entity_Id := Current_Entity (Def_Id);
E : constant Entity_Id := Current_Entity_In_Scope (Def_Id);
S : constant Entity_Id := Current_Scope;
begin
Generate_Definition (Def_Id);
-- Add new name to current scope declarations. Check for duplicate
-- declaration, which may or may not be a genuine error.
if Present (E) then
-- Case of previous entity entered because of a missing declaration
-- or else a bad subtype indication. Best is to use the new entity,
-- and make the previous one invisible.
if Etype (E) = Any_Type then
Set_Is_Immediately_Visible (E, False);
-- Case of renaming declaration constructed for package instances.
-- if there is an explicit declaration with the same identifier,
-- the renaming is not immediately visible any longer, but remains
-- visible through selected component notation.
elsif Nkind (Parent (E)) = N_Package_Renaming_Declaration
and then not Comes_From_Source (E)
then
Set_Is_Immediately_Visible (E, False);
-- The new entity may be the package renaming, which has the same
-- same name as a generic formal which has been seen already.
elsif Nkind (Parent (Def_Id)) = N_Package_Renaming_Declaration
and then not Comes_From_Source (Def_Id)
then
Set_Is_Immediately_Visible (E, False);
-- For a fat pointer corresponding to a remote access to subprogram,
-- we use the same identifier as the RAS type, so that the proper
-- name appears in the stub. This type is only retrieved through
-- the RAS type and never by visibility, and is not added to the
-- visibility list (see below).
elsif Nkind (Parent (Def_Id)) = N_Full_Type_Declaration
and then Ekind (Def_Id) = E_Record_Type
and then Present (Corresponding_Remote_Type (Def_Id))
then
null;
-- Case of an implicit operation or derived literal. The new entity
-- hides the implicit one, which is removed from all visibility,
-- i.e. the entity list of its scope, and homonym chain of its name.
elsif (Is_Overloadable (E) and then Is_Inherited_Operation (E))
or else Is_Internal (E)
then
declare
Decl : constant Node_Id := Parent (E);
Prev : Entity_Id;
Prev_Vis : Entity_Id;
begin
-- If E is an implicit declaration, it cannot be the first
-- entity in the scope.
Prev := First_Entity (Current_Scope);
while Present (Prev) and then Next_Entity (Prev) /= E loop
Next_Entity (Prev);
end loop;
if No (Prev) then
-- If E is not on the entity chain of the current scope,
-- it is an implicit declaration in the generic formal
-- part of a generic subprogram. When analyzing the body,
-- the generic formals are visible but not on the entity
-- chain of the subprogram. The new entity will become
-- the visible one in the body.
pragma Assert
(Nkind (Parent (Decl)) = N_Generic_Subprogram_Declaration);
null;
else
Set_Next_Entity (Prev, Next_Entity (E));
if No (Next_Entity (Prev)) then
Set_Last_Entity (Current_Scope, Prev);
end if;
if E = Current_Entity (E) then
Prev_Vis := Empty;
else
Prev_Vis := Current_Entity (E);
while Homonym (Prev_Vis) /= E loop
Prev_Vis := Homonym (Prev_Vis);
end loop;
end if;
if Present (Prev_Vis) then
-- Skip E in the visibility chain
Set_Homonym (Prev_Vis, Homonym (E));
else
Set_Name_Entity_Id (Chars (E), Homonym (E));
end if;
end if;
end;
-- This section of code could use a comment ???
elsif Present (Etype (E))
and then Is_Concurrent_Type (Etype (E))
and then E = Def_Id
then
return;
-- If the homograph is a protected component renaming, it should not
-- be hiding the current entity. Such renamings are treated as weak
-- declarations.
elsif Is_Prival (E) then
Set_Is_Immediately_Visible (E, False);
-- In this case the current entity is a protected component renaming.
-- Perform minimal decoration by setting the scope and return since
-- the prival should not be hiding other visible entities.
elsif Is_Prival (Def_Id) then
Set_Scope (Def_Id, Current_Scope);
return;
-- Analogous to privals, the discriminal generated for an entry index
-- parameter acts as a weak declaration. Perform minimal decoration
-- to avoid bogus errors.
elsif Is_Discriminal (Def_Id)
and then Ekind (Discriminal_Link (Def_Id)) = E_Entry_Index_Parameter
then
Set_Scope (Def_Id, Current_Scope);
return;
-- In the body or private part of an instance, a type extension may
-- introduce a component with the same name as that of an actual. The
-- legality rule is not enforced, but the semantics of the full type
-- with two components of same name are not clear at this point???
elsif In_Instance_Not_Visible then
null;
-- When compiling a package body, some child units may have become
-- visible. They cannot conflict with local entities that hide them.
elsif Is_Child_Unit (E)
and then In_Open_Scopes (Scope (E))
and then not Is_Immediately_Visible (E)
then
null;
-- Conversely, with front-end inlining we may compile the parent body
-- first, and a child unit subsequently. The context is now the
-- parent spec, and body entities are not visible.
elsif Is_Child_Unit (Def_Id)
and then Is_Package_Body_Entity (E)
and then not In_Package_Body (Current_Scope)
then
null;
-- Case of genuine duplicate declaration
else
Error_Msg_Sloc := Sloc (E);
-- If the previous declaration is an incomplete type declaration
-- this may be an attempt to complete it with a private type. The
-- following avoids confusing cascaded errors.
if Nkind (Parent (E)) = N_Incomplete_Type_Declaration
and then Nkind (Parent (Def_Id)) = N_Private_Type_Declaration
then
Error_Msg_N
("incomplete type cannot be completed with a private " &
"declaration", Parent (Def_Id));
Set_Is_Immediately_Visible (E, False);
Set_Full_View (E, Def_Id);
-- An inherited component of a record conflicts with a new
-- discriminant. The discriminant is inserted first in the scope,
-- but the error should be posted on it, not on the component.
elsif Ekind (E) = E_Discriminant
and then Present (Scope (Def_Id))
and then Scope (Def_Id) /= Current_Scope
then
Error_Msg_Sloc := Sloc (Def_Id);
Error_Msg_N ("& conflicts with declaration#", E);
return;
-- If the name of the unit appears in its own context clause, a
-- dummy package with the name has already been created, and the
-- error emitted. Try to continue quietly.
elsif Error_Posted (E)
and then Sloc (E) = No_Location
and then Nkind (Parent (E)) = N_Package_Specification
and then Current_Scope = Standard_Standard
then
Set_Scope (Def_Id, Current_Scope);
return;
else
Error_Msg_N ("& conflicts with declaration#", Def_Id);
-- Avoid cascaded messages with duplicate components in
-- derived types.
if Ekind_In (E, E_Component, E_Discriminant) then
return;
end if;
end if;
if Nkind (Parent (Parent (Def_Id))) =
N_Generic_Subprogram_Declaration
and then Def_Id =
Defining_Entity (Specification (Parent (Parent (Def_Id))))
then
Error_Msg_N ("\generic units cannot be overloaded", Def_Id);
end if;
-- If entity is in standard, then we are in trouble, because it
-- means that we have a library package with a duplicated name.
-- That's hard to recover from, so abort.
if S = Standard_Standard then
raise Unrecoverable_Error;
-- Otherwise we continue with the declaration. Having two
-- identical declarations should not cause us too much trouble.
else
null;
end if;
end if;
end if;
-- If we fall through, declaration is OK, at least OK enough to continue
-- If Def_Id is a discriminant or a record component we are in the midst
-- of inheriting components in a derived record definition. Preserve
-- their Ekind and Etype.
if Ekind_In (Def_Id, E_Discriminant, E_Component) then
null;
-- If a type is already set, leave it alone (happens when a type
-- declaration is reanalyzed following a call to the optimizer).
elsif Present (Etype (Def_Id)) then
null;
-- Otherwise, the kind E_Void insures that premature uses of the entity
-- will be detected. Any_Type insures that no cascaded errors will occur
else
Set_Ekind (Def_Id, E_Void);
Set_Etype (Def_Id, Any_Type);
end if;
-- Inherited discriminants and components in derived record types are
-- immediately visible. Itypes are not.
-- Unless the Itype is for a record type with a corresponding remote
-- type (what is that about, it was not commented ???)
if Ekind_In (Def_Id, E_Discriminant, E_Component)
or else
((not Is_Record_Type (Def_Id)
or else No (Corresponding_Remote_Type (Def_Id)))
and then not Is_Itype (Def_Id))
then
Set_Is_Immediately_Visible (Def_Id);
Set_Current_Entity (Def_Id);
end if;
Set_Homonym (Def_Id, C);
Append_Entity (Def_Id, S);
Set_Public_Status (Def_Id);
-- Declaring a homonym is not allowed in SPARK ...
if Present (C) and then Restriction_Check_Required (SPARK_05) then
declare
Enclosing_Subp : constant Node_Id := Enclosing_Subprogram (Def_Id);
Enclosing_Pack : constant Node_Id := Enclosing_Package (Def_Id);
Other_Scope : constant Node_Id := Enclosing_Dynamic_Scope (C);
begin
-- ... unless the new declaration is in a subprogram, and the
-- visible declaration is a variable declaration or a parameter
-- specification outside that subprogram.
if Present (Enclosing_Subp)
and then Nkind_In (Parent (C), N_Object_Declaration,
N_Parameter_Specification)
and then not Scope_Within_Or_Same (Other_Scope, Enclosing_Subp)
then
null;
-- ... or the new declaration is in a package, and the visible
-- declaration occurs outside that package.
elsif Present (Enclosing_Pack)
and then not Scope_Within_Or_Same (Other_Scope, Enclosing_Pack)
then
null;
-- ... or the new declaration is a component declaration in a
-- record type definition.
elsif Nkind (Parent (Def_Id)) = N_Component_Declaration then
null;
-- Don't issue error for non-source entities
elsif Comes_From_Source (Def_Id)
and then Comes_From_Source (C)
then
Error_Msg_Sloc := Sloc (C);
Check_SPARK_05_Restriction
("redeclaration of identifier &#", Def_Id);
end if;
end;
end if;
-- Warn if new entity hides an old one
if Warn_On_Hiding and then Present (C)
-- Don't warn for record components since they always have a well
-- defined scope which does not confuse other uses. Note that in
-- some cases, Ekind has not been set yet.
and then Ekind (C) /= E_Component
and then Ekind (C) /= E_Discriminant
and then Nkind (Parent (C)) /= N_Component_Declaration
and then Ekind (Def_Id) /= E_Component
and then Ekind (Def_Id) /= E_Discriminant
and then Nkind (Parent (Def_Id)) /= N_Component_Declaration
-- Don't warn for one character variables. It is too common to use
-- such variables as locals and will just cause too many false hits.
and then Length_Of_Name (Chars (C)) /= 1
-- Don't warn for non-source entities
and then Comes_From_Source (C)
and then Comes_From_Source (Def_Id)
-- Don't warn unless entity in question is in extended main source
and then In_Extended_Main_Source_Unit (Def_Id)
-- Finally, the hidden entity must be either immediately visible or
-- use visible (i.e. from a used package).
and then
(Is_Immediately_Visible (C)
or else
Is_Potentially_Use_Visible (C))
then
Error_Msg_Sloc := Sloc (C);
Error_Msg_N ("declaration hides &#?h?", Def_Id);
end if;
end Enter_Name;
---------------
-- Entity_Of --
---------------
function Entity_Of (N : Node_Id) return Entity_Id is
Id : Entity_Id;
begin
Id := Empty;
if Is_Entity_Name (N) then
Id := Entity (N);
-- Follow a possible chain of renamings to reach the root renamed
-- object.
while Present (Id)
and then Is_Object (Id)
and then Present (Renamed_Object (Id))
loop
if Is_Entity_Name (Renamed_Object (Id)) then
Id := Entity (Renamed_Object (Id));
else
Id := Empty;
exit;
end if;
end loop;
end if;
return Id;
end Entity_Of;
--------------------------
-- Explain_Limited_Type --
--------------------------
procedure Explain_Limited_Type (T : Entity_Id; N : Node_Id) is
C : Entity_Id;
begin
-- For array, component type must be limited
if Is_Array_Type (T) then
Error_Msg_Node_2 := T;
Error_Msg_NE
("\component type& of type& is limited", N, Component_Type (T));
Explain_Limited_Type (Component_Type (T), N);
elsif Is_Record_Type (T) then
-- No need for extra messages if explicit limited record
if Is_Limited_Record (Base_Type (T)) then
return;
end if;
-- Otherwise find a limited component. Check only components that
-- come from source, or inherited components that appear in the
-- source of the ancestor.
C := First_Component (T);
while Present (C) loop
if Is_Limited_Type (Etype (C))
and then
(Comes_From_Source (C)
or else
(Present (Original_Record_Component (C))
and then
Comes_From_Source (Original_Record_Component (C))))
then
Error_Msg_Node_2 := T;
Error_Msg_NE ("\component& of type& has limited type", N, C);
Explain_Limited_Type (Etype (C), N);
return;
end if;
Next_Component (C);
end loop;
-- The type may be declared explicitly limited, even if no component
-- of it is limited, in which case we fall out of the loop.
return;
end if;
end Explain_Limited_Type;
---------------------------------------
-- Expression_Of_Expression_Function --
---------------------------------------
function Expression_Of_Expression_Function
(Subp : Entity_Id) return Node_Id
is
Expr_Func : Node_Id;
begin
pragma Assert (Is_Expression_Function_Or_Completion (Subp));
if Nkind (Original_Node (Subprogram_Spec (Subp))) =
N_Expression_Function
then
Expr_Func := Original_Node (Subprogram_Spec (Subp));
elsif Nkind (Original_Node (Subprogram_Body (Subp))) =
N_Expression_Function
then
Expr_Func := Original_Node (Subprogram_Body (Subp));
else
pragma Assert (False);
null;
end if;
return Original_Node (Expression (Expr_Func));
end Expression_Of_Expression_Function;
-------------------------------
-- Extensions_Visible_Status --
-------------------------------
function Extensions_Visible_Status
(Id : Entity_Id) return Extensions_Visible_Mode
is
Arg : Node_Id;
Decl : Node_Id;
Expr : Node_Id;
Prag : Node_Id;
Subp : Entity_Id;
begin
-- When a formal parameter is subject to Extensions_Visible, the pragma
-- is stored in the contract of related subprogram.
if Is_Formal (Id) then
Subp := Scope (Id);
elsif Is_Subprogram_Or_Generic_Subprogram (Id) then
Subp := Id;
-- No other construct carries this pragma
else
return Extensions_Visible_None;
end if;
Prag := Get_Pragma (Subp, Pragma_Extensions_Visible);
-- In certain cases analysis may request the Extensions_Visible status
-- of an expression function before the pragma has been analyzed yet.
-- Inspect the declarative items after the expression function looking
-- for the pragma (if any).
if No (Prag) and then Is_Expression_Function (Subp) then
Decl := Next (Unit_Declaration_Node (Subp));
while Present (Decl) loop
if Nkind (Decl) = N_Pragma
and then Pragma_Name (Decl) = Name_Extensions_Visible
then
Prag := Decl;
exit;
-- A source construct ends the region where Extensions_Visible may
-- appear, stop the traversal. An expanded expression function is
-- no longer a source construct, but it must still be recognized.
elsif Comes_From_Source (Decl)
or else
(Nkind_In (Decl, N_Subprogram_Body,
N_Subprogram_Declaration)
and then Is_Expression_Function (Defining_Entity (Decl)))
then
exit;
end if;
Next (Decl);
end loop;
end if;
-- Extract the value from the Boolean expression (if any)
if Present (Prag) then
Arg := First (Pragma_Argument_Associations (Prag));
if Present (Arg) then
Expr := Get_Pragma_Arg (Arg);
-- When the associated subprogram is an expression function, the
-- argument of the pragma may not have been analyzed.
if not Analyzed (Expr) then
Preanalyze_And_Resolve (Expr, Standard_Boolean);
end if;
-- Guard against cascading errors when the argument of pragma
-- Extensions_Visible is not a valid static Boolean expression.
if Error_Posted (Expr) then
return Extensions_Visible_None;
elsif Is_True (Expr_Value (Expr)) then
return Extensions_Visible_True;
else
return Extensions_Visible_False;
end if;
-- Otherwise the aspect or pragma defaults to True
else
return Extensions_Visible_True;
end if;
-- Otherwise aspect or pragma Extensions_Visible is not inherited or
-- directly specified. In SPARK code, its value defaults to "False".
elsif SPARK_Mode = On then
return Extensions_Visible_False;
-- In non-SPARK code, aspect or pragma Extensions_Visible defaults to
-- "True".
else
return Extensions_Visible_True;
end if;
end Extensions_Visible_Status;
-----------------
-- Find_Actual --
-----------------
procedure Find_Actual
(N : Node_Id;
Formal : out Entity_Id;
Call : out Node_Id)
is
Context : constant Node_Id := Parent (N);
Actual : Node_Id;
Call_Nam : Node_Id;
begin
if Nkind_In (Context, N_Indexed_Component, N_Selected_Component)
and then N = Prefix (Context)
then
Find_Actual (Context, Formal, Call);
return;
elsif Nkind (Context) = N_Parameter_Association
and then N = Explicit_Actual_Parameter (Context)
then
Call := Parent (Context);
elsif Nkind_In (Context, N_Entry_Call_Statement,
N_Function_Call,
N_Procedure_Call_Statement)
then
Call := Context;
else
Formal := Empty;
Call := Empty;
return;
end if;
-- If we have a call to a subprogram look for the parameter. Note that
-- we exclude overloaded calls, since we don't know enough to be sure
-- of giving the right answer in this case.
if Nkind_In (Call, N_Entry_Call_Statement,
N_Function_Call,
N_Procedure_Call_Statement)
then
Call_Nam := Name (Call);
-- A call to a protected or task entry appears as a selected
-- component rather than an expanded name.
if Nkind (Call_Nam) = N_Selected_Component then
Call_Nam := Selector_Name (Call_Nam);
end if;
if Is_Entity_Name (Call_Nam)
and then Present (Entity (Call_Nam))
and then Is_Overloadable (Entity (Call_Nam))
and then not Is_Overloaded (Call_Nam)
then
-- If node is name in call it is not an actual
if N = Call_Nam then
Formal := Empty;
Call := Empty;
return;
end if;
-- Fall here if we are definitely a parameter
Actual := First_Actual (Call);
Formal := First_Formal (Entity (Call_Nam));
while Present (Formal) and then Present (Actual) loop
if Actual = N then
return;
-- An actual that is the prefix in a prefixed call may have
-- been rewritten in the call, after the deferred reference
-- was collected. Check if sloc and kinds and names match.
elsif Sloc (Actual) = Sloc (N)
and then Nkind (Actual) = N_Identifier
and then Nkind (Actual) = Nkind (N)
and then Chars (Actual) = Chars (N)
then
return;
else
Actual := Next_Actual (Actual);
Formal := Next_Formal (Formal);
end if;
end loop;
end if;
end if;
-- Fall through here if we did not find matching actual
Formal := Empty;
Call := Empty;
end Find_Actual;
---------------------------
-- Find_Body_Discriminal --
---------------------------
function Find_Body_Discriminal
(Spec_Discriminant : Entity_Id) return Entity_Id
is
Tsk : Entity_Id;
Disc : Entity_Id;
begin
-- If expansion is suppressed, then the scope can be the concurrent type
-- itself rather than a corresponding concurrent record type.
if Is_Concurrent_Type (Scope (Spec_Discriminant)) then
Tsk := Scope (Spec_Discriminant);
else
pragma Assert (Is_Concurrent_Record_Type (Scope (Spec_Discriminant)));
Tsk := Corresponding_Concurrent_Type (Scope (Spec_Discriminant));
end if;
-- Find discriminant of original concurrent type, and use its current
-- discriminal, which is the renaming within the task/protected body.
Disc := First_Discriminant (Tsk);
while Present (Disc) loop
if Chars (Disc) = Chars (Spec_Discriminant) then
return Discriminal (Disc);
end if;
Next_Discriminant (Disc);
end loop;
-- That loop should always succeed in finding a matching entry and
-- returning. Fatal error if not.
raise Program_Error;
end Find_Body_Discriminal;
-------------------------------------
-- Find_Corresponding_Discriminant --
-------------------------------------
function Find_Corresponding_Discriminant
(Id : Node_Id;
Typ : Entity_Id) return Entity_Id
is
Par_Disc : Entity_Id;
Old_Disc : Entity_Id;
New_Disc : Entity_Id;
begin
Par_Disc := Original_Record_Component (Original_Discriminant (Id));
-- The original type may currently be private, and the discriminant
-- only appear on its full view.
if Is_Private_Type (Scope (Par_Disc))
and then not Has_Discriminants (Scope (Par_Disc))
and then Present (Full_View (Scope (Par_Disc)))
then
Old_Disc := First_Discriminant (Full_View (Scope (Par_Disc)));
else
Old_Disc := First_Discriminant (Scope (Par_Disc));
end if;
if Is_Class_Wide_Type (Typ) then
New_Disc := First_Discriminant (Root_Type (Typ));
else
New_Disc := First_Discriminant (Typ);
end if;
while Present (Old_Disc) and then Present (New_Disc) loop
if Old_Disc = Par_Disc then
return New_Disc;
end if;
Next_Discriminant (Old_Disc);
Next_Discriminant (New_Disc);
end loop;
-- Should always find it
raise Program_Error;
end Find_Corresponding_Discriminant;
----------------------------------
-- Find_Enclosing_Iterator_Loop --
----------------------------------
function Find_Enclosing_Iterator_Loop (Id : Entity_Id) return Entity_Id is
Constr : Node_Id;
S : Entity_Id;
begin
-- Traverse the scope chain looking for an iterator loop. Such loops are
-- usually transformed into blocks, hence the use of Original_Node.
S := Id;
while Present (S) and then S /= Standard_Standard loop
if Ekind (S) = E_Loop
and then Nkind (Parent (S)) = N_Implicit_Label_Declaration
then
Constr := Original_Node (Label_Construct (Parent (S)));
if Nkind (Constr) = N_Loop_Statement
and then Present (Iteration_Scheme (Constr))
and then Nkind (Iterator_Specification
(Iteration_Scheme (Constr))) =
N_Iterator_Specification
then
return S;
end if;
end if;
S := Scope (S);
end loop;
return Empty;
end Find_Enclosing_Iterator_Loop;
------------------------------------
-- Find_Loop_In_Conditional_Block --
------------------------------------
function Find_Loop_In_Conditional_Block (N : Node_Id) return Node_Id is
Stmt : Node_Id;
begin
Stmt := N;
if Nkind (Stmt) = N_If_Statement then
Stmt := First (Then_Statements (Stmt));
end if;
pragma Assert (Nkind (Stmt) = N_Block_Statement);
-- Inspect the statements of the conditional block. In general the loop
-- should be the first statement in the statement sequence of the block,
-- but the finalization machinery may have introduced extra object
-- declarations.
Stmt := First (Statements (Handled_Statement_Sequence (Stmt)));
while Present (Stmt) loop
if Nkind (Stmt) = N_Loop_Statement then
return Stmt;
end if;
Next (Stmt);
end loop;
-- The expansion of attribute 'Loop_Entry produced a malformed block
raise Program_Error;
end Find_Loop_In_Conditional_Block;
--------------------------
-- Find_Overlaid_Entity --
--------------------------
procedure Find_Overlaid_Entity
(N : Node_Id;
Ent : out Entity_Id;
Off : out Boolean)
is
Expr : Node_Id;
begin
-- We are looking for one of the two following forms:
-- for X'Address use Y'Address
-- or
-- Const : constant Address := expr;
-- ...
-- for X'Address use Const;
-- In the second case, the expr is either Y'Address, or recursively a
-- constant that eventually references Y'Address.
Ent := Empty;
Off := False;
if Nkind (N) = N_Attribute_Definition_Clause
and then Chars (N) = Name_Address
then
Expr := Expression (N);
-- This loop checks the form of the expression for Y'Address,
-- using recursion to deal with intermediate constants.
loop
-- Check for Y'Address
if Nkind (Expr) = N_Attribute_Reference
and then Attribute_Name (Expr) = Name_Address
then
Expr := Prefix (Expr);
exit;
-- Check for Const where Const is a constant entity
elsif Is_Entity_Name (Expr)
and then Ekind (Entity (Expr)) = E_Constant
then
Expr := Constant_Value (Entity (Expr));
-- Anything else does not need checking
else
return;
end if;
end loop;
-- This loop checks the form of the prefix for an entity, using
-- recursion to deal with intermediate components.
loop
-- Check for Y where Y is an entity
if Is_Entity_Name (Expr) then
Ent := Entity (Expr);
return;
-- Check for components
elsif
Nkind_In (Expr, N_Selected_Component, N_Indexed_Component)
then
Expr := Prefix (Expr);
Off := True;
-- Anything else does not need checking
else
return;
end if;
end loop;
end if;
end Find_Overlaid_Entity;
-------------------------
-- Find_Parameter_Type --
-------------------------
function Find_Parameter_Type (Param : Node_Id) return Entity_Id is
begin
if Nkind (Param) /= N_Parameter_Specification then
return Empty;
-- For an access parameter, obtain the type from the formal entity
-- itself, because access to subprogram nodes do not carry a type.
-- Shouldn't we always use the formal entity ???
elsif Nkind (Parameter_Type (Param)) = N_Access_Definition then
return Etype (Defining_Identifier (Param));
else
return Etype (Parameter_Type (Param));
end if;
end Find_Parameter_Type;
-----------------------------------
-- Find_Placement_In_State_Space --
-----------------------------------
procedure Find_Placement_In_State_Space
(Item_Id : Entity_Id;
Placement : out State_Space_Kind;
Pack_Id : out Entity_Id)
is
Context : Entity_Id;
begin
-- Assume that the item does not appear in the state space of a package
Placement := Not_In_Package;
Pack_Id := Empty;
-- Climb the scope stack and examine the enclosing context
Context := Scope (Item_Id);
while Present (Context) and then Context /= Standard_Standard loop
if Ekind (Context) = E_Package then
Pack_Id := Context;
-- A package body is a cut off point for the traversal as the item
-- cannot be visible to the outside from this point on. Note that
-- this test must be done first as a body is also classified as a
-- private part.
if In_Package_Body (Context) then
Placement := Body_State_Space;
return;
-- The private part of a package is a cut off point for the
-- traversal as the item cannot be visible to the outside from
-- this point on.
elsif In_Private_Part (Context) then
Placement := Private_State_Space;
return;
-- When the item appears in the visible state space of a package,
-- continue to climb the scope stack as this may not be the final
-- state space.
else
Placement := Visible_State_Space;
-- The visible state space of a child unit acts as the proper
-- placement of an item.
if Is_Child_Unit (Context) then
return;
end if;
end if;
-- The item or its enclosing package appear in a construct that has
-- no state space.
else
Placement := Not_In_Package;
return;
end if;
Context := Scope (Context);
end loop;
end Find_Placement_In_State_Space;
------------------------
-- Find_Specific_Type --
------------------------
function Find_Specific_Type (CW : Entity_Id) return Entity_Id is
Typ : Entity_Id := Root_Type (CW);
begin
if Ekind (Typ) = E_Incomplete_Type then
if From_Limited_With (Typ) then
Typ := Non_Limited_View (Typ);
else
Typ := Full_View (Typ);
end if;
end if;
if Is_Private_Type (Typ)
and then not Is_Tagged_Type (Typ)
and then Present (Full_View (Typ))
then
return Full_View (Typ);
else
return Typ;
end if;
end Find_Specific_Type;
-----------------------------
-- Find_Static_Alternative --
-----------------------------
function Find_Static_Alternative (N : Node_Id) return Node_Id is
Expr : constant Node_Id := Expression (N);
Val : constant Uint := Expr_Value (Expr);
Alt : Node_Id;
Choice : Node_Id;
begin
Alt := First (Alternatives (N));
Search : loop
if Nkind (Alt) /= N_Pragma then
Choice := First (Discrete_Choices (Alt));
while Present (Choice) loop
-- Others choice, always matches
if Nkind (Choice) = N_Others_Choice then
exit Search;
-- Range, check if value is in the range
elsif Nkind (Choice) = N_Range then
exit Search when
Val >= Expr_Value (Low_Bound (Choice))
and then
Val <= Expr_Value (High_Bound (Choice));
-- Choice is a subtype name. Note that we know it must
-- be a static subtype, since otherwise it would have
-- been diagnosed as illegal.
elsif Is_Entity_Name (Choice)
and then Is_Type (Entity (Choice))
then
exit Search when Is_In_Range (Expr, Etype (Choice),
Assume_Valid => False);
-- Choice is a subtype indication
elsif Nkind (Choice) = N_Subtype_Indication then
declare
C : constant Node_Id := Constraint (Choice);
R : constant Node_Id := Range_Expression (C);
begin
exit Search when
Val >= Expr_Value (Low_Bound (R))
and then
Val <= Expr_Value (High_Bound (R));
end;
-- Choice is a simple expression
else
exit Search when Val = Expr_Value (Choice);
end if;
Next (Choice);
end loop;
end if;
Next (Alt);
pragma Assert (Present (Alt));
end loop Search;
-- The above loop *must* terminate by finding a match, since we know the
-- case statement is valid, and the value of the expression is known at
-- compile time. When we fall out of the loop, Alt points to the
-- alternative that we know will be selected at run time.
return Alt;
end Find_Static_Alternative;
------------------
-- First_Actual --
------------------
function First_Actual (Node : Node_Id) return Node_Id is
N : Node_Id;
begin
if No (Parameter_Associations (Node)) then
return Empty;
end if;
N := First (Parameter_Associations (Node));
if Nkind (N) = N_Parameter_Association then
return First_Named_Actual (Node);
else
return N;
end if;
end First_Actual;
-------------
-- Fix_Msg --
-------------
function Fix_Msg (Id : Entity_Id; Msg : String) return String is
Is_Task : constant Boolean :=
Ekind_In (Id, E_Task_Body, E_Task_Type)
or else Is_Single_Task_Object (Id);
Msg_Last : constant Natural := Msg'Last;
Msg_Index : Natural;
Res : String (Msg'Range) := (others => ' ');
Res_Index : Natural;
begin
-- Copy all characters from the input message Msg to result Res with
-- suitable replacements.
Msg_Index := Msg'First;
Res_Index := Res'First;
while Msg_Index <= Msg_Last loop
-- Replace "subprogram" with a different word
if Msg_Index <= Msg_Last - 10
and then Msg (Msg_Index .. Msg_Index + 9) = "subprogram"
then
if Ekind_In (Id, E_Entry, E_Entry_Family) then
Res (Res_Index .. Res_Index + 4) := "entry";
Res_Index := Res_Index + 5;
elsif Is_Task then
Res (Res_Index .. Res_Index + 8) := "task type";
Res_Index := Res_Index + 9;
else
Res (Res_Index .. Res_Index + 9) := "subprogram";
Res_Index := Res_Index + 10;
end if;
Msg_Index := Msg_Index + 10;
-- Replace "protected" with a different word
elsif Msg_Index <= Msg_Last - 9
and then Msg (Msg_Index .. Msg_Index + 8) = "protected"
and then Is_Task
then
Res (Res_Index .. Res_Index + 3) := "task";
Res_Index := Res_Index + 4;
Msg_Index := Msg_Index + 9;
-- Otherwise copy the character
else
Res (Res_Index) := Msg (Msg_Index);
Msg_Index := Msg_Index + 1;
Res_Index := Res_Index + 1;
end if;
end loop;
return Res (Res'First .. Res_Index - 1);
end Fix_Msg;
-----------------------
-- Gather_Components --
-----------------------
procedure Gather_Components
(Typ : Entity_Id;
Comp_List : Node_Id;
Governed_By : List_Id;
Into : Elist_Id;
Report_Errors : out Boolean)
is
Assoc : Node_Id;
Variant : Node_Id;
Discrete_Choice : Node_Id;
Comp_Item : Node_Id;
Discrim : Entity_Id;
Discrim_Name : Node_Id;
Discrim_Value : Node_Id;
begin
Report_Errors := False;
if No (Comp_List) or else Null_Present (Comp_List) then
return;
elsif Present (Component_Items (Comp_List)) then
Comp_Item := First (Component_Items (Comp_List));
else
Comp_Item := Empty;
end if;
while Present (Comp_Item) loop
-- Skip the tag of a tagged record, the interface tags, as well
-- as all items that are not user components (anonymous types,
-- rep clauses, Parent field, controller field).
if Nkind (Comp_Item) = N_Component_Declaration then
declare
Comp : constant Entity_Id := Defining_Identifier (Comp_Item);
begin
if not Is_Tag (Comp) and then Chars (Comp) /= Name_uParent then
Append_Elmt (Comp, Into);
end if;
end;
end if;
Next (Comp_Item);
end loop;
if No (Variant_Part (Comp_List)) then
return;
else
Discrim_Name := Name (Variant_Part (Comp_List));
Variant := First_Non_Pragma (Variants (Variant_Part (Comp_List)));
end if;
-- Look for the discriminant that governs this variant part.
-- The discriminant *must* be in the Governed_By List
Assoc := First (Governed_By);
Find_Constraint : loop
Discrim := First (Choices (Assoc));
exit Find_Constraint when Chars (Discrim_Name) = Chars (Discrim)
or else (Present (Corresponding_Discriminant (Entity (Discrim)))
and then
Chars (Corresponding_Discriminant (Entity (Discrim))) =
Chars (Discrim_Name))
or else Chars (Original_Record_Component (Entity (Discrim)))
= Chars (Discrim_Name);
if No (Next (Assoc)) then
if not Is_Constrained (Typ)
and then Is_Derived_Type (Typ)
and then Present (Stored_Constraint (Typ))
then
-- If the type is a tagged type with inherited discriminants,
-- use the stored constraint on the parent in order to find
-- the values of discriminants that are otherwise hidden by an
-- explicit constraint. Renamed discriminants are handled in
-- the code above.
-- If several parent discriminants are renamed by a single
-- discriminant of the derived type, the call to obtain the
-- Corresponding_Discriminant field only retrieves the last
-- of them. We recover the constraint on the others from the
-- Stored_Constraint as well.
declare
D : Entity_Id;
C : Elmt_Id;
begin
D := First_Discriminant (Etype (Typ));
C := First_Elmt (Stored_Constraint (Typ));
while Present (D) and then Present (C) loop
if Chars (Discrim_Name) = Chars (D) then
if Is_Entity_Name (Node (C))
and then Entity (Node (C)) = Entity (Discrim)
then
-- D is renamed by Discrim, whose value is given in
-- Assoc.
null;
else
Assoc :=
Make_Component_Association (Sloc (Typ),
New_List
(New_Occurrence_Of (D, Sloc (Typ))),
Duplicate_Subexpr_No_Checks (Node (C)));
end if;
exit Find_Constraint;
end if;
Next_Discriminant (D);
Next_Elmt (C);
end loop;
end;
end if;
end if;
if No (Next (Assoc)) then
Error_Msg_NE (" missing value for discriminant&",
First (Governed_By), Discrim_Name);
Report_Errors := True;
return;
end if;
Next (Assoc);
end loop Find_Constraint;
Discrim_Value := Expression (Assoc);
if not Is_OK_Static_Expression (Discrim_Value) then
-- If the variant part is governed by a discriminant of the type
-- this is an error. If the variant part and the discriminant are
-- inherited from an ancestor this is legal (AI05-120) unless the
-- components are being gathered for an aggregate, in which case
-- the caller must check Report_Errors.
if Scope (Original_Record_Component
((Entity (First (Choices (Assoc)))))) = Typ
then
Error_Msg_FE
("value for discriminant & must be static!",
Discrim_Value, Discrim);
Why_Not_Static (Discrim_Value);
end if;
Report_Errors := True;
return;
end if;
Search_For_Discriminant_Value : declare
Low : Node_Id;
High : Node_Id;
UI_High : Uint;
UI_Low : Uint;
UI_Discrim_Value : constant Uint := Expr_Value (Discrim_Value);
begin
Find_Discrete_Value : while Present (Variant) loop
Discrete_Choice := First (Discrete_Choices (Variant));
while Present (Discrete_Choice) loop
exit Find_Discrete_Value when
Nkind (Discrete_Choice) = N_Others_Choice;
Get_Index_Bounds (Discrete_Choice, Low, High);
UI_Low := Expr_Value (Low);
UI_High := Expr_Value (High);
exit Find_Discrete_Value when
UI_Low <= UI_Discrim_Value
and then
UI_High >= UI_Discrim_Value;
Next (Discrete_Choice);
end loop;
Next_Non_Pragma (Variant);
end loop Find_Discrete_Value;
end Search_For_Discriminant_Value;
-- The case statement must include a variant that corresponds to the
-- value of the discriminant, unless the discriminant type has a
-- static predicate. In that case the absence of an others_choice that
-- would cover this value becomes a run-time error (3.8,1 (21.1/2)).
if No (Variant)
and then not Has_Static_Predicate (Etype (Discrim_Name))
then
Error_Msg_NE
("value of discriminant & is out of range", Discrim_Value, Discrim);
Report_Errors := True;
return;
end if;
-- If we have found the corresponding choice, recursively add its
-- components to the Into list. The nested components are part of
-- the same record type.
if Present (Variant) then
Gather_Components
(Typ, Component_List (Variant), Governed_By, Into, Report_Errors);
end if;
end Gather_Components;
------------------------
-- Get_Actual_Subtype --
------------------------
function Get_Actual_Subtype (N : Node_Id) return Entity_Id is
Typ : constant Entity_Id := Etype (N);
Utyp : Entity_Id := Underlying_Type (Typ);
Decl : Node_Id;
Atyp : Entity_Id;
begin
if No (Utyp) then
Utyp := Typ;
end if;
-- If what we have is an identifier that references a subprogram
-- formal, or a variable or constant object, then we get the actual
-- subtype from the referenced entity if one has been built.
if Nkind (N) = N_Identifier
and then
(Is_Formal (Entity (N))
or else Ekind (Entity (N)) = E_Constant
or else Ekind (Entity (N)) = E_Variable)
and then Present (Actual_Subtype (Entity (N)))
then
return Actual_Subtype (Entity (N));
-- Actual subtype of unchecked union is always itself. We never need
-- the "real" actual subtype. If we did, we couldn't get it anyway
-- because the discriminant is not available. The restrictions on
-- Unchecked_Union are designed to make sure that this is OK.
elsif Is_Unchecked_Union (Base_Type (Utyp)) then
return Typ;
-- Here for the unconstrained case, we must find actual subtype
-- No actual subtype is available, so we must build it on the fly.
-- Checking the type, not the underlying type, for constrainedness
-- seems to be necessary. Maybe all the tests should be on the type???
elsif (not Is_Constrained (Typ))
and then (Is_Array_Type (Utyp)
or else (Is_Record_Type (Utyp)
and then Has_Discriminants (Utyp)))
and then not Has_Unknown_Discriminants (Utyp)
and then not (Ekind (Utyp) = E_String_Literal_Subtype)
then
-- Nothing to do if in spec expression (why not???)
if In_Spec_Expression then
return Typ;
elsif Is_Private_Type (Typ) and then not Has_Discriminants (Typ) then
-- If the type has no discriminants, there is no subtype to
-- build, even if the underlying type is discriminated.
return Typ;
-- Else build the actual subtype
else
Decl := Build_Actual_Subtype (Typ, N);
Atyp := Defining_Identifier (Decl);
-- If Build_Actual_Subtype generated a new declaration then use it
if Atyp /= Typ then
-- The actual subtype is an Itype, so analyze the declaration,
-- but do not attach it to the tree, to get the type defined.
Set_Parent (Decl, N);
Set_Is_Itype (Atyp);
Analyze (Decl, Suppress => All_Checks);
Set_Associated_Node_For_Itype (Atyp, N);
Set_Has_Delayed_Freeze (Atyp, False);
-- We need to freeze the actual subtype immediately. This is
-- needed, because otherwise this Itype will not get frozen
-- at all, and it is always safe to freeze on creation because
-- any associated types must be frozen at this point.
Freeze_Itype (Atyp, N);
return Atyp;
-- Otherwise we did not build a declaration, so return original
else
return Typ;
end if;
end if;
-- For all remaining cases, the actual subtype is the same as
-- the nominal type.
else
return Typ;
end if;
end Get_Actual_Subtype;
-------------------------------------
-- Get_Actual_Subtype_If_Available --
-------------------------------------
function Get_Actual_Subtype_If_Available (N : Node_Id) return Entity_Id is
Typ : constant Entity_Id := Etype (N);
begin
-- If what we have is an identifier that references a subprogram
-- formal, or a variable or constant object, then we get the actual
-- subtype from the referenced entity if one has been built.
if Nkind (N) = N_Identifier
and then
(Is_Formal (Entity (N))
or else Ekind (Entity (N)) = E_Constant
or else Ekind (Entity (N)) = E_Variable)
and then Present (Actual_Subtype (Entity (N)))
then
return Actual_Subtype (Entity (N));
-- Otherwise the Etype of N is returned unchanged
else
return Typ;
end if;
end Get_Actual_Subtype_If_Available;
------------------------
-- Get_Body_From_Stub --
------------------------
function Get_Body_From_Stub (N : Node_Id) return Node_Id is
begin
return Proper_Body (Unit (Library_Unit (N)));
end Get_Body_From_Stub;
---------------------
-- Get_Cursor_Type --
---------------------
function Get_Cursor_Type
(Aspect : Node_Id;
Typ : Entity_Id) return Entity_Id
is
Assoc : Node_Id;
Func : Entity_Id;
First_Op : Entity_Id;
Cursor : Entity_Id;
begin
-- If error already detected, return
if Error_Posted (Aspect) then
return Any_Type;
end if;
-- The cursor type for an Iterable aspect is the return type of a
-- non-overloaded First primitive operation. Locate association for
-- First.
Assoc := First (Component_Associations (Expression (Aspect)));
First_Op := Any_Id;
while Present (Assoc) loop
if Chars (First (Choices (Assoc))) = Name_First then
First_Op := Expression (Assoc);
exit;
end if;
Next (Assoc);
end loop;
if First_Op = Any_Id then
Error_Msg_N ("aspect Iterable must specify First operation", Aspect);
return Any_Type;
end if;
Cursor := Any_Type;
-- Locate function with desired name and profile in scope of type
-- In the rare case where the type is an integer type, a base type
-- is created for it, check that the base type of the first formal
-- of First matches the base type of the domain.
Func := First_Entity (Scope (Typ));
while Present (Func) loop
if Chars (Func) = Chars (First_Op)
and then Ekind (Func) = E_Function
and then Present (First_Formal (Func))
and then Base_Type (Etype (First_Formal (Func))) = Base_Type (Typ)
and then No (Next_Formal (First_Formal (Func)))
then
if Cursor /= Any_Type then
Error_Msg_N
("Operation First for iterable type must be unique", Aspect);
return Any_Type;
else
Cursor := Etype (Func);
end if;
end if;
Next_Entity (Func);
end loop;
-- If not found, no way to resolve remaining primitives.
if Cursor = Any_Type then
Error_Msg_N
("No legal primitive operation First for Iterable type", Aspect);
end if;
return Cursor;
end Get_Cursor_Type;
function Get_Cursor_Type (Typ : Entity_Id) return Entity_Id is
begin
return Etype (Get_Iterable_Type_Primitive (Typ, Name_First));
end Get_Cursor_Type;
-------------------------------
-- Get_Default_External_Name --
-------------------------------
function Get_Default_External_Name (E : Node_Or_Entity_Id) return Node_Id is
begin
Get_Decoded_Name_String (Chars (E));
if Opt.External_Name_Imp_Casing = Uppercase then
Set_Casing (All_Upper_Case);
else
Set_Casing (All_Lower_Case);
end if;
return
Make_String_Literal (Sloc (E),
Strval => String_From_Name_Buffer);
end Get_Default_External_Name;
--------------------------
-- Get_Enclosing_Object --
--------------------------
function Get_Enclosing_Object (N : Node_Id) return Entity_Id is
begin
if Is_Entity_Name (N) then
return Entity (N);
else
case Nkind (N) is
when N_Indexed_Component
| N_Selected_Component
| N_Slice
=>
-- If not generating code, a dereference may be left implicit.
-- In thoses cases, return Empty.
if Is_Access_Type (Etype (Prefix (N))) then
return Empty;
else
return Get_Enclosing_Object (Prefix (N));
end if;
when N_Type_Conversion =>
return Get_Enclosing_Object (Expression (N));
when others =>
return Empty;
end case;
end if;
end Get_Enclosing_Object;
---------------------------
-- Get_Enum_Lit_From_Pos --
---------------------------
function Get_Enum_Lit_From_Pos
(T : Entity_Id;
Pos : Uint;
Loc : Source_Ptr) return Node_Id
is
Btyp : Entity_Id := Base_Type (T);
Lit : Node_Id;
LLoc : Source_Ptr;
begin
-- In the case where the literal is of type Character, Wide_Character
-- or Wide_Wide_Character or of a type derived from them, there needs
-- to be some special handling since there is no explicit chain of
-- literals to search. Instead, an N_Character_Literal node is created
-- with the appropriate Char_Code and Chars fields.
if Is_Standard_Character_Type (T) then
Set_Character_Literal_Name (UI_To_CC (Pos));
return
Make_Character_Literal (Loc,
Chars => Name_Find,
Char_Literal_Value => Pos);
-- For all other cases, we have a complete table of literals, and
-- we simply iterate through the chain of literal until the one
-- with the desired position value is found.
else
if Is_Private_Type (Btyp) and then Present (Full_View (Btyp)) then
Btyp := Full_View (Btyp);
end if;
Lit := First_Literal (Btyp);
for J in 1 .. UI_To_Int (Pos) loop
Next_Literal (Lit);
-- If Lit is Empty, Pos is not in range, so raise Constraint_Error
-- inside the loop to avoid calling Next_Literal on Empty.
if No (Lit) then
raise Constraint_Error;
end if;
end loop;
-- Create a new node from Lit, with source location provided by Loc
-- if not equal to No_Location, or by copying the source location of
-- Lit otherwise.
LLoc := Loc;
if LLoc = No_Location then
LLoc := Sloc (Lit);
end if;
return New_Occurrence_Of (Lit, LLoc);
end if;
end Get_Enum_Lit_From_Pos;
------------------------
-- Get_Generic_Entity --
------------------------
function Get_Generic_Entity (N : Node_Id) return Entity_Id is
Ent : constant Entity_Id := Entity (Name (N));
begin
if Present (Renamed_Object (Ent)) then
return Renamed_Object (Ent);
else
return Ent;
end if;
end Get_Generic_Entity;
-------------------------------------
-- Get_Incomplete_View_Of_Ancestor --
-------------------------------------
function Get_Incomplete_View_Of_Ancestor (E : Entity_Id) return Entity_Id is
Cur_Unit : constant Entity_Id := Cunit_Entity (Current_Sem_Unit);
Par_Scope : Entity_Id;
Par_Type : Entity_Id;
begin
-- The incomplete view of an ancestor is only relevant for private
-- derived types in child units.
if not Is_Derived_Type (E)
or else not Is_Child_Unit (Cur_Unit)
then
return Empty;
else
Par_Scope := Scope (Cur_Unit);
if No (Par_Scope) then
return Empty;
end if;
Par_Type := Etype (Base_Type (E));
-- Traverse list of ancestor types until we find one declared in
-- a parent or grandparent unit (two levels seem sufficient).
while Present (Par_Type) loop
if Scope (Par_Type) = Par_Scope
or else Scope (Par_Type) = Scope (Par_Scope)
then
return Par_Type;
elsif not Is_Derived_Type (Par_Type) then
return Empty;
else
Par_Type := Etype (Base_Type (Par_Type));
end if;
end loop;
-- If none found, there is no relevant ancestor type.
return Empty;
end if;
end Get_Incomplete_View_Of_Ancestor;
----------------------
-- Get_Index_Bounds --
----------------------
procedure Get_Index_Bounds
(N : Node_Id;
L : out Node_Id;
H : out Node_Id;
Use_Full_View : Boolean := False)
is
function Scalar_Range_Of_Type (Typ : Entity_Id) return Node_Id;
-- Obtain the scalar range of type Typ. If flag Use_Full_View is set and
-- Typ qualifies, the scalar range is obtained from the full view of the
-- type.
--------------------------
-- Scalar_Range_Of_Type --
--------------------------
function Scalar_Range_Of_Type (Typ : Entity_Id) return Node_Id is
T : Entity_Id := Typ;
begin
if Use_Full_View and then Present (Full_View (T)) then
T := Full_View (T);
end if;
return Scalar_Range (T);
end Scalar_Range_Of_Type;
-- Local variables
Kind : constant Node_Kind := Nkind (N);
Rng : Node_Id;
-- Start of processing for Get_Index_Bounds
begin
if Kind = N_Range then
L := Low_Bound (N);
H := High_Bound (N);
elsif Kind = N_Subtype_Indication then
Rng := Range_Expression (Constraint (N));
if Rng = Error then
L := Error;
H := Error;
return;
else
L := Low_Bound (Range_Expression (Constraint (N)));
H := High_Bound (Range_Expression (Constraint (N)));
end if;
elsif Is_Entity_Name (N) and then Is_Type (Entity (N)) then
Rng := Scalar_Range_Of_Type (Entity (N));
if Error_Posted (Rng) then
L := Error;
H := Error;
elsif Nkind (Rng) = N_Subtype_Indication then
Get_Index_Bounds (Rng, L, H);
else
L := Low_Bound (Rng);
H := High_Bound (Rng);
end if;
else
-- N is an expression, indicating a range with one value
L := N;
H := N;
end if;
end Get_Index_Bounds;
---------------------------------
-- Get_Iterable_Type_Primitive --
---------------------------------
function Get_Iterable_Type_Primitive
(Typ : Entity_Id;
Nam : Name_Id) return Entity_Id
is
Funcs : constant Node_Id := Find_Value_Of_Aspect (Typ, Aspect_Iterable);
Assoc : Node_Id;
begin
if No (Funcs) then
return Empty;
else
Assoc := First (Component_Associations (Funcs));
while Present (Assoc) loop
if Chars (First (Choices (Assoc))) = Nam then
return Entity (Expression (Assoc));
end if;
Assoc := Next (Assoc);
end loop;
return Empty;
end if;
end Get_Iterable_Type_Primitive;
----------------------------------
-- Get_Library_Unit_Name_string --
----------------------------------
procedure Get_Library_Unit_Name_String (Decl_Node : Node_Id) is
Unit_Name_Id : constant Unit_Name_Type := Get_Unit_Name (Decl_Node);
begin
Get_Unit_Name_String (Unit_Name_Id);
-- Remove seven last character (" (spec)" or " (body)")
Name_Len := Name_Len - 7;
pragma Assert (Name_Buffer (Name_Len + 1) = ' ');
end Get_Library_Unit_Name_String;
--------------------------
-- Get_Max_Queue_Length --
--------------------------
function Get_Max_Queue_Length (Id : Entity_Id) return Uint is
pragma Assert (Is_Entry (Id));
Prag : constant Entity_Id := Get_Pragma (Id, Pragma_Max_Queue_Length);
begin
-- A value of 0 represents no maximum specified, and entries and entry
-- families with no Max_Queue_Length aspect or pragma default to it.
if not Present (Prag) then
return Uint_0;
end if;
return Intval (Expression (First (Pragma_Argument_Associations (Prag))));
end Get_Max_Queue_Length;
------------------------
-- Get_Name_Entity_Id --
------------------------
function Get_Name_Entity_Id (Id : Name_Id) return Entity_Id is
begin
return Entity_Id (Get_Name_Table_Int (Id));
end Get_Name_Entity_Id;
------------------------------
-- Get_Name_From_CTC_Pragma --
------------------------------
function Get_Name_From_CTC_Pragma (N : Node_Id) return String_Id is
Arg : constant Node_Id :=
Get_Pragma_Arg (First (Pragma_Argument_Associations (N)));
begin
return Strval (Expr_Value_S (Arg));
end Get_Name_From_CTC_Pragma;
-----------------------
-- Get_Parent_Entity --
-----------------------
function Get_Parent_Entity (Unit : Node_Id) return Entity_Id is
begin
if Nkind (Unit) = N_Package_Body
and then Nkind (Original_Node (Unit)) = N_Package_Instantiation
then
return Defining_Entity
(Specification (Instance_Spec (Original_Node (Unit))));
elsif Nkind (Unit) = N_Package_Instantiation then
return Defining_Entity (Specification (Instance_Spec (Unit)));
else
return Defining_Entity (Unit);
end if;
end Get_Parent_Entity;
-------------------
-- Get_Pragma_Id --
-------------------
function Get_Pragma_Id (N : Node_Id) return Pragma_Id is
begin
return Get_Pragma_Id (Pragma_Name_Unmapped (N));
end Get_Pragma_Id;
------------------------
-- Get_Qualified_Name --
------------------------
function Get_Qualified_Name
(Id : Entity_Id;
Suffix : Entity_Id := Empty) return Name_Id
is
Suffix_Nam : Name_Id := No_Name;
begin
if Present (Suffix) then
Suffix_Nam := Chars (Suffix);
end if;
return Get_Qualified_Name (Chars (Id), Suffix_Nam, Scope (Id));
end Get_Qualified_Name;
function Get_Qualified_Name
(Nam : Name_Id;
Suffix : Name_Id := No_Name;
Scop : Entity_Id := Current_Scope) return Name_Id
is
procedure Add_Scope (S : Entity_Id);
-- Add the fully qualified form of scope S to the name buffer. The
-- format is:
-- s-1__s__
---------------
-- Add_Scope --
---------------
procedure Add_Scope (S : Entity_Id) is
begin
if S = Empty then
null;
elsif S = Standard_Standard then
null;
else
Add_Scope (Scope (S));
Get_Name_String_And_Append (Chars (S));
Add_Str_To_Name_Buffer ("__");
end if;
end Add_Scope;
-- Start of processing for Get_Qualified_Name
begin
Name_Len := 0;
Add_Scope (Scop);
-- Append the base name after all scopes have been chained
Get_Name_String_And_Append (Nam);
-- Append the suffix (if present)
if Suffix /= No_Name then
Add_Str_To_Name_Buffer ("__");
Get_Name_String_And_Append (Suffix);
end if;
return Name_Find;
end Get_Qualified_Name;
-----------------------
-- Get_Reason_String --
-----------------------
procedure Get_Reason_String (N : Node_Id) is
begin
if Nkind (N) = N_String_Literal then
Store_String_Chars (Strval (N));
elsif Nkind (N) = N_Op_Concat then
Get_Reason_String (Left_Opnd (N));
Get_Reason_String (Right_Opnd (N));
-- If not of required form, error
else
Error_Msg_N
("Reason for pragma Warnings has wrong form", N);
Error_Msg_N
("\must be string literal or concatenation of string literals", N);
return;
end if;
end Get_Reason_String;
--------------------------------
-- Get_Reference_Discriminant --
--------------------------------
function Get_Reference_Discriminant (Typ : Entity_Id) return Entity_Id is
D : Entity_Id;
begin
D := First_Discriminant (Typ);
while Present (D) loop
if Has_Implicit_Dereference (D) then
return D;
end if;
Next_Discriminant (D);
end loop;
return Empty;
end Get_Reference_Discriminant;
---------------------------
-- Get_Referenced_Object --
---------------------------
function Get_Referenced_Object (N : Node_Id) return Node_Id is
R : Node_Id;
begin
R := N;
while Is_Entity_Name (R)
and then Present (Renamed_Object (Entity (R)))
loop
R := Renamed_Object (Entity (R));
end loop;
return R;
end Get_Referenced_Object;
------------------------
-- Get_Renamed_Entity --
------------------------
function Get_Renamed_Entity (E : Entity_Id) return Entity_Id is
R : Entity_Id;
begin
R := E;
while Present (Renamed_Entity (R)) loop
R := Renamed_Entity (R);
end loop;
return R;
end Get_Renamed_Entity;
-----------------------
-- Get_Return_Object --
-----------------------
function Get_Return_Object (N : Node_Id) return Entity_Id is
Decl : Node_Id;
begin
Decl := First (Return_Object_Declarations (N));
while Present (Decl) loop
exit when Nkind (Decl) = N_Object_Declaration
and then Is_Return_Object (Defining_Identifier (Decl));
Next (Decl);
end loop;
pragma Assert (Present (Decl));
return Defining_Identifier (Decl);
end Get_Return_Object;
---------------------------
-- Get_Subprogram_Entity --
---------------------------
function Get_Subprogram_Entity (Nod : Node_Id) return Entity_Id is
Subp : Node_Id;
Subp_Id : Entity_Id;
begin
if Nkind (Nod) = N_Accept_Statement then
Subp := Entry_Direct_Name (Nod);
elsif Nkind (Nod) = N_Slice then
Subp := Prefix (Nod);
else
Subp := Name (Nod);
end if;
-- Strip the subprogram call
loop
if Nkind_In (Subp, N_Explicit_Dereference,
N_Indexed_Component,
N_Selected_Component)
then
Subp := Prefix (Subp);
elsif Nkind_In (Subp, N_Type_Conversion,
N_Unchecked_Type_Conversion)
then
Subp := Expression (Subp);
else
exit;
end if;
end loop;
-- Extract the entity of the subprogram call
if Is_Entity_Name (Subp) then
Subp_Id := Entity (Subp);
if Ekind (Subp_Id) = E_Access_Subprogram_Type then
Subp_Id := Directly_Designated_Type (Subp_Id);
end if;
if Is_Subprogram (Subp_Id) then
return Subp_Id;
else
return Empty;
end if;
-- The search did not find a construct that denotes a subprogram
else
return Empty;
end if;
end Get_Subprogram_Entity;
-----------------------------
-- Get_Task_Body_Procedure --
-----------------------------
function Get_Task_Body_Procedure (E : Entity_Id) return Node_Id is
begin
-- Note: A task type may be the completion of a private type with
-- discriminants. When performing elaboration checks on a task
-- declaration, the current view of the type may be the private one,
-- and the procedure that holds the body of the task is held in its
-- underlying type.
-- This is an odd function, why not have Task_Body_Procedure do
-- the following digging???
return Task_Body_Procedure (Underlying_Type (Root_Type (E)));
end Get_Task_Body_Procedure;
-------------------------
-- Get_User_Defined_Eq --
-------------------------
function Get_User_Defined_Eq (E : Entity_Id) return Entity_Id is
Prim : Elmt_Id;
Op : Entity_Id;
begin
Prim := First_Elmt (Collect_Primitive_Operations (E));
while Present (Prim) loop
Op := Node (Prim);
if Chars (Op) = Name_Op_Eq
and then Etype (Op) = Standard_Boolean
and then Etype (First_Formal (Op)) = E
and then Etype (Next_Formal (First_Formal (Op))) = E
then
return Op;
end if;
Next_Elmt (Prim);
end loop;
return Empty;
end Get_User_Defined_Eq;
---------------
-- Get_Views --
---------------
procedure Get_Views
(Typ : Entity_Id;
Priv_Typ : out Entity_Id;
Full_Typ : out Entity_Id;
Full_Base : out Entity_Id;
CRec_Typ : out Entity_Id)
is
IP_View : Entity_Id;
begin
-- Assume that none of the views can be recovered
Priv_Typ := Empty;
Full_Typ := Empty;
Full_Base := Empty;
CRec_Typ := Empty;
-- The input type is the corresponding record type of a protected or a
-- task type.
if Ekind (Typ) = E_Record_Type
and then Is_Concurrent_Record_Type (Typ)
then
CRec_Typ := Typ;
Full_Typ := Corresponding_Concurrent_Type (CRec_Typ);
Full_Base := Base_Type (Full_Typ);
Priv_Typ := Incomplete_Or_Partial_View (Full_Typ);
-- Otherwise the input type denotes an arbitrary type
else
IP_View := Incomplete_Or_Partial_View (Typ);
-- The input type denotes the full view of a private type
if Present (IP_View) then
Priv_Typ := IP_View;
Full_Typ := Typ;
-- The input type is a private type
elsif Is_Private_Type (Typ) then
Priv_Typ := Typ;
Full_Typ := Full_View (Priv_Typ);
-- Otherwise the input type does not have any views
else
Full_Typ := Typ;
end if;
if Present (Full_Typ) then
Full_Base := Base_Type (Full_Typ);
if Ekind_In (Full_Typ, E_Protected_Type, E_Task_Type) then
CRec_Typ := Corresponding_Record_Type (Full_Typ);
end if;
end if;
end if;
end Get_Views;
-----------------------
-- Has_Access_Values --
-----------------------
function Has_Access_Values (T : Entity_Id) return Boolean is
Typ : constant Entity_Id := Underlying_Type (T);
begin
-- Case of a private type which is not completed yet. This can only
-- happen in the case of a generic format type appearing directly, or
-- as a component of the type to which this function is being applied
-- at the top level. Return False in this case, since we certainly do
-- not know that the type contains access types.
if No (Typ) then
return False;
elsif Is_Access_Type (Typ) then
return True;
elsif Is_Array_Type (Typ) then
return Has_Access_Values (Component_Type (Typ));
elsif Is_Record_Type (Typ) then
declare
Comp : Entity_Id;
begin
-- Loop to Check components
Comp := First_Component_Or_Discriminant (Typ);
while Present (Comp) loop
-- Check for access component, tag field does not count, even
-- though it is implemented internally using an access type.
if Has_Access_Values (Etype (Comp))
and then Chars (Comp) /= Name_uTag
then
return True;
end if;
Next_Component_Or_Discriminant (Comp);
end loop;
end;
return False;
else
return False;
end if;
end Has_Access_Values;
------------------------------
-- Has_Compatible_Alignment --
------------------------------
function Has_Compatible_Alignment
(Obj : Entity_Id;
Expr : Node_Id;
Layout_Done : Boolean) return Alignment_Result
is
function Has_Compatible_Alignment_Internal
(Obj : Entity_Id;
Expr : Node_Id;
Layout_Done : Boolean;
Default : Alignment_Result) return Alignment_Result;
-- This is the internal recursive function that actually does the work.
-- There is one additional parameter, which says what the result should
-- be if no alignment information is found, and there is no definite
-- indication of compatible alignments. At the outer level, this is set
-- to Unknown, but for internal recursive calls in the case where types
-- are known to be correct, it is set to Known_Compatible.
---------------------------------------
-- Has_Compatible_Alignment_Internal --
---------------------------------------
function Has_Compatible_Alignment_Internal
(Obj : Entity_Id;
Expr : Node_Id;
Layout_Done : Boolean;
Default : Alignment_Result) return Alignment_Result
is
Result : Alignment_Result := Known_Compatible;
-- Holds the current status of the result. Note that once a value of
-- Known_Incompatible is set, it is sticky and does not get changed
-- to Unknown (the value in Result only gets worse as we go along,
-- never better).
Offs : Uint := No_Uint;
-- Set to a factor of the offset from the base object when Expr is a
-- selected or indexed component, based on Component_Bit_Offset and
-- Component_Size respectively. A negative value is used to represent
-- a value which is not known at compile time.
procedure Check_Prefix;
-- Checks the prefix recursively in the case where the expression
-- is an indexed or selected component.
procedure Set_Result (R : Alignment_Result);
-- If R represents a worse outcome (unknown instead of known
-- compatible, or known incompatible), then set Result to R.
------------------
-- Check_Prefix --
------------------
procedure Check_Prefix is
begin
-- The subtlety here is that in doing a recursive call to check
-- the prefix, we have to decide what to do in the case where we
-- don't find any specific indication of an alignment problem.
-- At the outer level, we normally set Unknown as the result in
-- this case, since we can only set Known_Compatible if we really
-- know that the alignment value is OK, but for the recursive
-- call, in the case where the types match, and we have not
-- specified a peculiar alignment for the object, we are only
-- concerned about suspicious rep clauses, the default case does
-- not affect us, since the compiler will, in the absence of such
-- rep clauses, ensure that the alignment is correct.
if Default = Known_Compatible
or else
(Etype (Obj) = Etype (Expr)
and then (Unknown_Alignment (Obj)
or else
Alignment (Obj) = Alignment (Etype (Obj))))
then
Set_Result
(Has_Compatible_Alignment_Internal
(Obj, Prefix (Expr), Layout_Done, Known_Compatible));
-- In all other cases, we need a full check on the prefix
else
Set_Result
(Has_Compatible_Alignment_Internal
(Obj, Prefix (Expr), Layout_Done, Unknown));
end if;
end Check_Prefix;
----------------
-- Set_Result --
----------------
procedure Set_Result (R : Alignment_Result) is
begin
if R > Result then
Result := R;
end if;
end Set_Result;
-- Start of processing for Has_Compatible_Alignment_Internal
begin
-- If Expr is a selected component, we must make sure there is no
-- potentially troublesome component clause and that the record is
-- not packed if the layout is not done.
if Nkind (Expr) = N_Selected_Component then
-- Packing generates unknown alignment if layout is not done
if Is_Packed (Etype (Prefix (Expr))) and then not Layout_Done then
Set_Result (Unknown);
end if;
-- Check prefix and component offset
Check_Prefix;
Offs := Component_Bit_Offset (Entity (Selector_Name (Expr)));
-- If Expr is an indexed component, we must make sure there is no
-- potentially troublesome Component_Size clause and that the array
-- is not bit-packed if the layout is not done.
elsif Nkind (Expr) = N_Indexed_Component then
declare
Typ : constant Entity_Id := Etype (Prefix (Expr));
begin
-- Packing generates unknown alignment if layout is not done
if Is_Bit_Packed_Array (Typ) and then not Layout_Done then
Set_Result (Unknown);
end if;
-- Check prefix and component offset (or at least size)
Check_Prefix;
Offs := Indexed_Component_Bit_Offset (Expr);
if Offs = No_Uint then
Offs := Component_Size (Typ);
end if;
end;
end if;
-- If we have a null offset, the result is entirely determined by
-- the base object and has already been computed recursively.
if Offs = Uint_0 then
null;
-- Case where we know the alignment of the object
elsif Known_Alignment (Obj) then
declare
ObjA : constant Uint := Alignment (Obj);
ExpA : Uint := No_Uint;
SizA : Uint := No_Uint;
begin
-- If alignment of Obj is 1, then we are always OK
if ObjA = 1 then
Set_Result (Known_Compatible);
-- Alignment of Obj is greater than 1, so we need to check
else
-- If we have an offset, see if it is compatible
if Offs /= No_Uint and Offs > Uint_0 then
if Offs mod (System_Storage_Unit * ObjA) /= 0 then
Set_Result (Known_Incompatible);
end if;
-- See if Expr is an object with known alignment
elsif Is_Entity_Name (Expr)
and then Known_Alignment (Entity (Expr))
then
ExpA := Alignment (Entity (Expr));
-- Otherwise, we can use the alignment of the type of
-- Expr given that we already checked for
-- discombobulating rep clauses for the cases of indexed
-- and selected components above.
elsif Known_Alignment (Etype (Expr)) then
ExpA := Alignment (Etype (Expr));
-- Otherwise the alignment is unknown
else
Set_Result (Default);
end if;
-- If we got an alignment, see if it is acceptable
if ExpA /= No_Uint and then ExpA < ObjA then
Set_Result (Known_Incompatible);
end if;
-- If Expr is not a piece of a larger object, see if size
-- is given. If so, check that it is not too small for the
-- required alignment.
if Offs /= No_Uint then
null;
-- See if Expr is an object with known size
elsif Is_Entity_Name (Expr)
and then Known_Static_Esize (Entity (Expr))
then
SizA := Esize (Entity (Expr));
-- Otherwise, we check the object size of the Expr type
elsif Known_Static_Esize (Etype (Expr)) then
SizA := Esize (Etype (Expr));
end if;
-- If we got a size, see if it is a multiple of the Obj
-- alignment, if not, then the alignment cannot be
-- acceptable, since the size is always a multiple of the
-- alignment.
if SizA /= No_Uint then
if SizA mod (ObjA * Ttypes.System_Storage_Unit) /= 0 then
Set_Result (Known_Incompatible);
end if;
end if;
end if;
end;
-- If we do not know required alignment, any non-zero offset is a
-- potential problem (but certainly may be OK, so result is unknown).
elsif Offs /= No_Uint then
Set_Result (Unknown);
-- If we can't find the result by direct comparison of alignment
-- values, then there is still one case that we can determine known
-- result, and that is when we can determine that the types are the
-- same, and no alignments are specified. Then we known that the
-- alignments are compatible, even if we don't know the alignment
-- value in the front end.
elsif Etype (Obj) = Etype (Expr) then
-- Types are the same, but we have to check for possible size
-- and alignments on the Expr object that may make the alignment
-- different, even though the types are the same.
if Is_Entity_Name (Expr) then
-- First check alignment of the Expr object. Any alignment less
-- than Maximum_Alignment is worrisome since this is the case
-- where we do not know the alignment of Obj.
if Known_Alignment (Entity (Expr))
and then UI_To_Int (Alignment (Entity (Expr))) <
Ttypes.Maximum_Alignment
then
Set_Result (Unknown);
-- Now check size of Expr object. Any size that is not an
-- even multiple of Maximum_Alignment is also worrisome
-- since it may cause the alignment of the object to be less
-- than the alignment of the type.
elsif Known_Static_Esize (Entity (Expr))
and then
(UI_To_Int (Esize (Entity (Expr))) mod
(Ttypes.Maximum_Alignment * Ttypes.System_Storage_Unit))
/= 0
then
Set_Result (Unknown);
-- Otherwise same type is decisive
else
Set_Result (Known_Compatible);
end if;
end if;
-- Another case to deal with is when there is an explicit size or
-- alignment clause when the types are not the same. If so, then the
-- result is Unknown. We don't need to do this test if the Default is
-- Unknown, since that result will be set in any case.
elsif Default /= Unknown
and then (Has_Size_Clause (Etype (Expr))
or else
Has_Alignment_Clause (Etype (Expr)))
then
Set_Result (Unknown);
-- If no indication found, set default
else
Set_Result (Default);
end if;
-- Return worst result found
return Result;
end Has_Compatible_Alignment_Internal;
-- Start of processing for Has_Compatible_Alignment
begin
-- If Obj has no specified alignment, then set alignment from the type
-- alignment. Perhaps we should always do this, but for sure we should
-- do it when there is an address clause since we can do more if the
-- alignment is known.
if Unknown_Alignment (Obj) then
Set_Alignment (Obj, Alignment (Etype (Obj)));
end if;
-- Now do the internal call that does all the work
return
Has_Compatible_Alignment_Internal (Obj, Expr, Layout_Done, Unknown);
end Has_Compatible_Alignment;
----------------------
-- Has_Declarations --
----------------------
function Has_Declarations (N : Node_Id) return Boolean is
begin
return Nkind_In (Nkind (N), N_Accept_Statement,
N_Block_Statement,
N_Compilation_Unit_Aux,
N_Entry_Body,
N_Package_Body,
N_Protected_Body,
N_Subprogram_Body,
N_Task_Body,
N_Package_Specification);
end Has_Declarations;
---------------------------------
-- Has_Defaulted_Discriminants --
---------------------------------
function Has_Defaulted_Discriminants (Typ : Entity_Id) return Boolean is
begin
return Has_Discriminants (Typ)
and then Present (First_Discriminant (Typ))
and then Present (Discriminant_Default_Value
(First_Discriminant (Typ)));
end Has_Defaulted_Discriminants;
-------------------
-- Has_Denormals --
-------------------
function Has_Denormals (E : Entity_Id) return Boolean is
begin
return Is_Floating_Point_Type (E) and then Denorm_On_Target;
end Has_Denormals;
-------------------------------------------
-- Has_Discriminant_Dependent_Constraint --
-------------------------------------------
function Has_Discriminant_Dependent_Constraint
(Comp : Entity_Id) return Boolean
is
Comp_Decl : constant Node_Id := Parent (Comp);
Subt_Indic : Node_Id;
Constr : Node_Id;
Assn : Node_Id;
begin
-- Discriminants can't depend on discriminants
if Ekind (Comp) = E_Discriminant then
return False;
else
Subt_Indic := Subtype_Indication (Component_Definition (Comp_Decl));
if Nkind (Subt_Indic) = N_Subtype_Indication then
Constr := Constraint (Subt_Indic);
if Nkind (Constr) = N_Index_Or_Discriminant_Constraint then
Assn := First (Constraints (Constr));
while Present (Assn) loop
case Nkind (Assn) is
when N_Identifier
| N_Range
| N_Subtype_Indication
=>
if Depends_On_Discriminant (Assn) then
return True;
end if;
when N_Discriminant_Association =>
if Depends_On_Discriminant (Expression (Assn)) then
return True;
end if;
when others =>
null;
end case;
Next (Assn);
end loop;
end if;
end if;
end if;
return False;
end Has_Discriminant_Dependent_Constraint;
--------------------------------------
-- Has_Effectively_Volatile_Profile --
--------------------------------------
function Has_Effectively_Volatile_Profile
(Subp_Id : Entity_Id) return Boolean
is
Formal : Entity_Id;
begin
-- Inspect the formal parameters looking for an effectively volatile
-- type.
Formal := First_Formal (Subp_Id);
while Present (Formal) loop
if Is_Effectively_Volatile (Etype (Formal)) then
return True;
end if;
Next_Formal (Formal);
end loop;
-- Inspect the return type of functions
if Ekind_In (Subp_Id, E_Function, E_Generic_Function)
and then Is_Effectively_Volatile (Etype (Subp_Id))
then
return True;
end if;
return False;
end Has_Effectively_Volatile_Profile;
--------------------------
-- Has_Enabled_Property --
--------------------------
function Has_Enabled_Property
(Item_Id : Entity_Id;
Property : Name_Id) return Boolean
is
function Protected_Object_Has_Enabled_Property return Boolean;
-- Determine whether a protected object denoted by Item_Id has the
-- property enabled.
function State_Has_Enabled_Property return Boolean;
-- Determine whether a state denoted by Item_Id has the property enabled
function Variable_Has_Enabled_Property return Boolean;
-- Determine whether a variable denoted by Item_Id has the property
-- enabled.
-------------------------------------------
-- Protected_Object_Has_Enabled_Property --
-------------------------------------------
function Protected_Object_Has_Enabled_Property return Boolean is
Constits : constant Elist_Id := Part_Of_Constituents (Item_Id);
Constit_Elmt : Elmt_Id;
Constit_Id : Entity_Id;
begin
-- Protected objects always have the properties Async_Readers and
-- Async_Writers (SPARK RM 7.1.2(16)).
if Property = Name_Async_Readers
or else Property = Name_Async_Writers
then
return True;
-- Protected objects that have Part_Of components also inherit their
-- properties Effective_Reads and Effective_Writes
-- (SPARK RM 7.1.2(16)).
elsif Present (Constits) then
Constit_Elmt := First_Elmt (Constits);
while Present (Constit_Elmt) loop
Constit_Id := Node (Constit_Elmt);
if Has_Enabled_Property (Constit_Id, Property) then
return True;
end if;
Next_Elmt (Constit_Elmt);
end loop;
end if;
return False;
end Protected_Object_Has_Enabled_Property;
--------------------------------
-- State_Has_Enabled_Property --
--------------------------------
function State_Has_Enabled_Property return Boolean is
Decl : constant Node_Id := Parent (Item_Id);
Opt : Node_Id;
Opt_Nam : Node_Id;
Prop : Node_Id;
Prop_Nam : Node_Id;
Props : Node_Id;
begin
-- The declaration of an external abstract state appears as an
-- extension aggregate. If this is not the case, properties can never
-- be set.
if Nkind (Decl) /= N_Extension_Aggregate then
return False;
end if;
-- When External appears as a simple option, it automatically enables
-- all properties.
Opt := First (Expressions (Decl));
while Present (Opt) loop
if Nkind (Opt) = N_Identifier
and then Chars (Opt) = Name_External
then
return True;
end if;
Next (Opt);
end loop;
-- When External specifies particular properties, inspect those and
-- find the desired one (if any).
Opt := First (Component_Associations (Decl));
while Present (Opt) loop
Opt_Nam := First (Choices (Opt));
if Nkind (Opt_Nam) = N_Identifier
and then Chars (Opt_Nam) = Name_External
then
Props := Expression (Opt);
-- Multiple properties appear as an aggregate
if Nkind (Props) = N_Aggregate then
-- Simple property form
Prop := First (Expressions (Props));
while Present (Prop) loop
if Chars (Prop) = Property then
return True;
end if;
Next (Prop);
end loop;
-- Property with expression form
Prop := First (Component_Associations (Props));
while Present (Prop) loop
Prop_Nam := First (Choices (Prop));
-- The property can be represented in two ways:
-- others => <value>
-- <property> => <value>
if Nkind (Prop_Nam) = N_Others_Choice
or else (Nkind (Prop_Nam) = N_Identifier
and then Chars (Prop_Nam) = Property)
then
return Is_True (Expr_Value (Expression (Prop)));
end if;
Next (Prop);
end loop;
-- Single property
else
return Chars (Props) = Property;
end if;
end if;
Next (Opt);
end loop;
return False;
end State_Has_Enabled_Property;
-----------------------------------
-- Variable_Has_Enabled_Property --
-----------------------------------
function Variable_Has_Enabled_Property return Boolean is
function Is_Enabled (Prag : Node_Id) return Boolean;
-- Determine whether property pragma Prag (if present) denotes an
-- enabled property.
----------------
-- Is_Enabled --
----------------
function Is_Enabled (Prag : Node_Id) return Boolean is
Arg1 : Node_Id;
begin
if Present (Prag) then
Arg1 := First (Pragma_Argument_Associations (Prag));
-- The pragma has an optional Boolean expression, the related
-- property is enabled only when the expression evaluates to
-- True.
if Present (Arg1) then
return Is_True (Expr_Value (Get_Pragma_Arg (Arg1)));
-- Otherwise the lack of expression enables the property by
-- default.
else
return True;
end if;
-- The property was never set in the first place
else
return False;
end if;
end Is_Enabled;
-- Local variables
AR : constant Node_Id :=
Get_Pragma (Item_Id, Pragma_Async_Readers);
AW : constant Node_Id :=
Get_Pragma (Item_Id, Pragma_Async_Writers);
ER : constant Node_Id :=
Get_Pragma (Item_Id, Pragma_Effective_Reads);
EW : constant Node_Id :=
Get_Pragma (Item_Id, Pragma_Effective_Writes);
-- Start of processing for Variable_Has_Enabled_Property
begin
-- A non-effectively volatile object can never possess external
-- properties.
if not Is_Effectively_Volatile (Item_Id) then
return False;
-- External properties related to variables come in two flavors -
-- explicit and implicit. The explicit case is characterized by the
-- presence of a property pragma with an optional Boolean flag. The
-- property is enabled when the flag evaluates to True or the flag is
-- missing altogether.
elsif Property = Name_Async_Readers and then Is_Enabled (AR) then
return True;
elsif Property = Name_Async_Writers and then Is_Enabled (AW) then
return True;
elsif Property = Name_Effective_Reads and then Is_Enabled (ER) then
return True;
elsif Property = Name_Effective_Writes and then Is_Enabled (EW) then
return True;
-- The implicit case lacks all property pragmas
elsif No (AR) and then No (AW) and then No (ER) and then No (EW) then
if Is_Protected_Type (Etype (Item_Id)) then
return Protected_Object_Has_Enabled_Property;
else
return True;
end if;
else
return False;
end if;
end Variable_Has_Enabled_Property;
-- Start of processing for Has_Enabled_Property
begin
-- Abstract states and variables have a flexible scheme of specifying
-- external properties.
if Ekind (Item_Id) = E_Abstract_State then
return State_Has_Enabled_Property;
elsif Ekind (Item_Id) = E_Variable then
return Variable_Has_Enabled_Property;
-- By default, protected objects only have the properties Async_Readers
-- and Async_Writers. If they have Part_Of components, they also inherit
-- their properties Effective_Reads and Effective_Writes
-- (SPARK RM 7.1.2(16)).
elsif Ekind (Item_Id) = E_Protected_Object then
return Protected_Object_Has_Enabled_Property;
-- Otherwise a property is enabled when the related item is effectively
-- volatile.
else
return Is_Effectively_Volatile (Item_Id);
end if;
end Has_Enabled_Property;
-------------------------------------
-- Has_Full_Default_Initialization --
-------------------------------------
function Has_Full_Default_Initialization (Typ : Entity_Id) return Boolean is
Comp : Entity_Id;
Prag : Node_Id;
begin
-- A type subject to pragma Default_Initial_Condition is fully default
-- initialized when the pragma appears with a non-null argument. Since
-- any type may act as the full view of a private type, this check must
-- be performed prior to the specialized tests below.
if Has_DIC (Typ) then
Prag := Get_Pragma (Typ, Pragma_Default_Initial_Condition);
pragma Assert (Present (Prag));
return Is_Verifiable_DIC_Pragma (Prag);
end if;
-- A scalar type is fully default initialized if it is subject to aspect
-- Default_Value.
if Is_Scalar_Type (Typ) then
return Has_Default_Aspect (Typ);
-- An array type is fully default initialized if its element type is
-- scalar and the array type carries aspect Default_Component_Value or
-- the element type is fully default initialized.
elsif Is_Array_Type (Typ) then
return
Has_Default_Aspect (Typ)
or else Has_Full_Default_Initialization (Component_Type (Typ));
-- A protected type, record type, or type extension is fully default
-- initialized if all its components either carry an initialization
-- expression or have a type that is fully default initialized. The
-- parent type of a type extension must be fully default initialized.
elsif Is_Record_Type (Typ) or else Is_Protected_Type (Typ) then
-- Inspect all entities defined in the scope of the type, looking for
-- uninitialized components.
Comp := First_Entity (Typ);
while Present (Comp) loop
if Ekind (Comp) = E_Component
and then Comes_From_Source (Comp)
and then No (Expression (Parent (Comp)))
and then not Has_Full_Default_Initialization (Etype (Comp))
then
return False;
end if;
Next_Entity (Comp);
end loop;
-- Ensure that the parent type of a type extension is fully default
-- initialized.
if Etype (Typ) /= Typ
and then not Has_Full_Default_Initialization (Etype (Typ))
then
return False;
end if;
-- If we get here, then all components and parent portion are fully
-- default initialized.
return True;
-- A task type is fully default initialized by default
elsif Is_Task_Type (Typ) then
return True;
-- Otherwise the type is not fully default initialized
else
return False;
end if;
end Has_Full_Default_Initialization;
--------------------
-- Has_Infinities --
--------------------
function Has_Infinities (E : Entity_Id) return Boolean is
begin
return
Is_Floating_Point_Type (E)
and then Nkind (Scalar_Range (E)) = N_Range
and then Includes_Infinities (Scalar_Range (E));
end Has_Infinities;
--------------------
-- Has_Interfaces --
--------------------
function Has_Interfaces
(T : Entity_Id;
Use_Full_View : Boolean := True) return Boolean
is
Typ : Entity_Id := Base_Type (T);
begin
-- Handle concurrent types
if Is_Concurrent_Type (Typ) then
Typ := Corresponding_Record_Type (Typ);
end if;
if not Present (Typ)
or else not Is_Record_Type (Typ)
or else not Is_Tagged_Type (Typ)
then
return False;
end if;
-- Handle private types
if Use_Full_View and then Present (Full_View (Typ)) then
Typ := Full_View (Typ);
end if;
-- Handle concurrent record types
if Is_Concurrent_Record_Type (Typ)
and then Is_Non_Empty_List (Abstract_Interface_List (Typ))
then
return True;
end if;
loop
if Is_Interface (Typ)
or else
(Is_Record_Type (Typ)
and then Present (Interfaces (Typ))
and then not Is_Empty_Elmt_List (Interfaces (Typ)))
then
return True;
end if;
exit when Etype (Typ) = Typ
-- Handle private types
or else (Present (Full_View (Etype (Typ)))
and then Full_View (Etype (Typ)) = Typ)
-- Protect frontend against wrong sources with cyclic derivations
or else Etype (Typ) = T;
-- Climb to the ancestor type handling private types
if Present (Full_View (Etype (Typ))) then
Typ := Full_View (Etype (Typ));
else
Typ := Etype (Typ);
end if;
end loop;
return False;
end Has_Interfaces;
--------------------------
-- Has_Max_Queue_Length --
--------------------------
function Has_Max_Queue_Length (Id : Entity_Id) return Boolean is
begin
return
Ekind (Id) = E_Entry
and then Present (Get_Pragma (Id, Pragma_Max_Queue_Length));
end Has_Max_Queue_Length;
---------------------------------
-- Has_No_Obvious_Side_Effects --
---------------------------------
function Has_No_Obvious_Side_Effects (N : Node_Id) return Boolean is
begin
-- For now handle literals, constants, and non-volatile variables and
-- expressions combining these with operators or short circuit forms.
if Nkind (N) in N_Numeric_Or_String_Literal then
return True;
elsif Nkind (N) = N_Character_Literal then
return True;
elsif Nkind (N) in N_Unary_Op then
return Has_No_Obvious_Side_Effects (Right_Opnd (N));
elsif Nkind (N) in N_Binary_Op or else Nkind (N) in N_Short_Circuit then
return Has_No_Obvious_Side_Effects (Left_Opnd (N))
and then
Has_No_Obvious_Side_Effects (Right_Opnd (N));
elsif Nkind (N) = N_Expression_With_Actions
and then Is_Empty_List (Actions (N))
then
return Has_No_Obvious_Side_Effects (Expression (N));
elsif Nkind (N) in N_Has_Entity then
return Present (Entity (N))
and then Ekind_In (Entity (N), E_Variable,
E_Constant,
E_Enumeration_Literal,
E_In_Parameter,
E_Out_Parameter,
E_In_Out_Parameter)
and then not Is_Volatile (Entity (N));
else
return False;
end if;
end Has_No_Obvious_Side_Effects;
-----------------------------
-- Has_Non_Null_Refinement --
-----------------------------
function Has_Non_Null_Refinement (Id : Entity_Id) return Boolean is
Constits : Elist_Id;
begin
pragma Assert (Ekind (Id) = E_Abstract_State);
Constits := Refinement_Constituents (Id);
-- For a refinement to be non-null, the first constituent must be
-- anything other than null.
return
Present (Constits)
and then Nkind (Node (First_Elmt (Constits))) /= N_Null;
end Has_Non_Null_Refinement;
-------------------
-- Has_Null_Body --
-------------------
function Has_Null_Body (Proc_Id : Entity_Id) return Boolean is
Body_Id : Entity_Id;
Decl : Node_Id;
Spec : Node_Id;
Stmt1 : Node_Id;
Stmt2 : Node_Id;
begin
Spec := Parent (Proc_Id);
Decl := Parent (Spec);
-- Retrieve the entity of the procedure body (e.g. invariant proc).
if Nkind (Spec) = N_Procedure_Specification
and then Nkind (Decl) = N_Subprogram_Declaration
then
Body_Id := Corresponding_Body (Decl);
-- The body acts as a spec
else
Body_Id := Proc_Id;
end if;
-- The body will be generated later
if No (Body_Id) then
return False;
end if;
Spec := Parent (Body_Id);
Decl := Parent (Spec);
pragma Assert
(Nkind (Spec) = N_Procedure_Specification
and then Nkind (Decl) = N_Subprogram_Body);
Stmt1 := First (Statements (Handled_Statement_Sequence (Decl)));
-- Look for a null statement followed by an optional return
-- statement.
if Nkind (Stmt1) = N_Null_Statement then
Stmt2 := Next (Stmt1);
if Present (Stmt2) then
return Nkind (Stmt2) = N_Simple_Return_Statement;
else
return True;
end if;
end if;
return False;
end Has_Null_Body;
------------------------
-- Has_Null_Exclusion --
------------------------
function Has_Null_Exclusion (N : Node_Id) return Boolean is
begin
case Nkind (N) is
when N_Access_Definition
| N_Access_Function_Definition
| N_Access_Procedure_Definition
| N_Access_To_Object_Definition
| N_Allocator
| N_Derived_Type_Definition
| N_Function_Specification
| N_Subtype_Declaration
=>
return Null_Exclusion_Present (N);
when N_Component_Definition
| N_Formal_Object_Declaration
| N_Object_Renaming_Declaration
=>
if Present (Subtype_Mark (N)) then
return Null_Exclusion_Present (N);
else pragma Assert (Present (Access_Definition (N)));
return Null_Exclusion_Present (Access_Definition (N));
end if;
when N_Discriminant_Specification =>
if Nkind (Discriminant_Type (N)) = N_Access_Definition then
return Null_Exclusion_Present (Discriminant_Type (N));
else
return Null_Exclusion_Present (N);
end if;
when N_Object_Declaration =>
if Nkind (Object_Definition (N)) = N_Access_Definition then
return Null_Exclusion_Present (Object_Definition (N));
else
return Null_Exclusion_Present (N);
end if;
when N_Parameter_Specification =>
if Nkind (Parameter_Type (N)) = N_Access_Definition then
return Null_Exclusion_Present (Parameter_Type (N));
else
return Null_Exclusion_Present (N);
end if;
when others =>
return False;
end case;
end Has_Null_Exclusion;
------------------------
-- Has_Null_Extension --
------------------------
function Has_Null_Extension (T : Entity_Id) return Boolean is
B : constant Entity_Id := Base_Type (T);
Comps : Node_Id;
Ext : Node_Id;
begin
if Nkind (Parent (B)) = N_Full_Type_Declaration
and then Present (Record_Extension_Part (Type_Definition (Parent (B))))
then
Ext := Record_Extension_Part (Type_Definition (Parent (B)));
if Present (Ext) then
if Null_Present (Ext) then
return True;
else
Comps := Component_List (Ext);
-- The null component list is rewritten during analysis to
-- include the parent component. Any other component indicates
-- that the extension was not originally null.
return Null_Present (Comps)
or else No (Next (First (Component_Items (Comps))));
end if;
else
return False;
end if;
else
return False;
end if;
end Has_Null_Extension;
-------------------------
-- Has_Null_Refinement --
-------------------------
function Has_Null_Refinement (Id : Entity_Id) return Boolean is
Constits : Elist_Id;
begin
pragma Assert (Ekind (Id) = E_Abstract_State);
Constits := Refinement_Constituents (Id);
-- For a refinement to be null, the state's sole constituent must be a
-- null.
return
Present (Constits)
and then Nkind (Node (First_Elmt (Constits))) = N_Null;
end Has_Null_Refinement;
-------------------------------
-- Has_Overriding_Initialize --
-------------------------------
function Has_Overriding_Initialize (T : Entity_Id) return Boolean is
BT : constant Entity_Id := Base_Type (T);
P : Elmt_Id;
begin
if Is_Controlled (BT) then
if Is_RTU (Scope (BT), Ada_Finalization) then
return False;
elsif Present (Primitive_Operations (BT)) then
P := First_Elmt (Primitive_Operations (BT));
while Present (P) loop
declare
Init : constant Entity_Id := Node (P);
Formal : constant Entity_Id := First_Formal (Init);
begin
if Ekind (Init) = E_Procedure
and then Chars (Init) = Name_Initialize
and then Comes_From_Source (Init)
and then Present (Formal)
and then Etype (Formal) = BT
and then No (Next_Formal (Formal))
and then (Ada_Version < Ada_2012
or else not Null_Present (Parent (Init)))
then
return True;
end if;
end;
Next_Elmt (P);
end loop;
end if;
-- Here if type itself does not have a non-null Initialize operation:
-- check immediate ancestor.
if Is_Derived_Type (BT)
and then Has_Overriding_Initialize (Etype (BT))
then
return True;
end if;
end if;
return False;
end Has_Overriding_Initialize;
--------------------------------------
-- Has_Preelaborable_Initialization --
--------------------------------------
function Has_Preelaborable_Initialization (E : Entity_Id) return Boolean is
Has_PE : Boolean;
procedure Check_Components (E : Entity_Id);
-- Check component/discriminant chain, sets Has_PE False if a component
-- or discriminant does not meet the preelaborable initialization rules.
----------------------
-- Check_Components --
----------------------
procedure Check_Components (E : Entity_Id) is
Ent : Entity_Id;
Exp : Node_Id;
function Is_Preelaborable_Expression (N : Node_Id) return Boolean;
-- Returns True if and only if the expression denoted by N does not
-- violate restrictions on preelaborable constructs (RM-10.2.1(5-9)).
---------------------------------
-- Is_Preelaborable_Expression --
---------------------------------
function Is_Preelaborable_Expression (N : Node_Id) return Boolean is
Exp : Node_Id;
Assn : Node_Id;
Choice : Node_Id;
Comp_Type : Entity_Id;
Is_Array_Aggr : Boolean;
begin
if Is_OK_Static_Expression (N) then
return True;
elsif Nkind (N) = N_Null then
return True;
-- Attributes are allowed in general, even if their prefix is a
-- formal type. (It seems that certain attributes known not to be
-- static might not be allowed, but there are no rules to prevent
-- them.)
elsif Nkind (N) = N_Attribute_Reference then
return True;
-- The name of a discriminant evaluated within its parent type is
-- defined to be preelaborable (10.2.1(8)). Note that we test for
-- names that denote discriminals as well as discriminants to
-- catch references occurring within init procs.
elsif Is_Entity_Name (N)
and then
(Ekind (Entity (N)) = E_Discriminant
or else (Ekind_In (Entity (N), E_Constant, E_In_Parameter)
and then Present (Discriminal_Link (Entity (N)))))
then
return True;
elsif Nkind (N) = N_Qualified_Expression then
return Is_Preelaborable_Expression (Expression (N));
-- For aggregates we have to check that each of the associations
-- is preelaborable.
elsif Nkind_In (N, N_Aggregate, N_Extension_Aggregate) then
Is_Array_Aggr := Is_Array_Type (Etype (N));
if Is_Array_Aggr then
Comp_Type := Component_Type (Etype (N));
end if;
-- Check the ancestor part of extension aggregates, which must
-- be either the name of a type that has preelaborable init or
-- an expression that is preelaborable.
if Nkind (N) = N_Extension_Aggregate then
declare
Anc_Part : constant Node_Id := Ancestor_Part (N);
begin
if Is_Entity_Name (Anc_Part)
and then Is_Type (Entity (Anc_Part))
then
if not Has_Preelaborable_Initialization
(Entity (Anc_Part))
then
return False;
end if;
elsif not Is_Preelaborable_Expression (Anc_Part) then
return False;
end if;
end;
end if;
-- Check positional associations
Exp := First (Expressions (N));
while Present (Exp) loop
if not Is_Preelaborable_Expression (Exp) then
return False;
end if;
Next (Exp);
end loop;
-- Check named associations
Assn := First (Component_Associations (N));
while Present (Assn) loop
Choice := First (Choices (Assn));
while Present (Choice) loop
if Is_Array_Aggr then
if Nkind (Choice) = N_Others_Choice then
null;
elsif Nkind (Choice) = N_Range then
if not Is_OK_Static_Range (Choice) then
return False;
end if;
elsif not Is_OK_Static_Expression (Choice) then
return False;
end if;
else
Comp_Type := Etype (Choice);
end if;
Next (Choice);
end loop;
-- If the association has a <> at this point, then we have
-- to check whether the component's type has preelaborable
-- initialization. Note that this only occurs when the
-- association's corresponding component does not have a
-- default expression, the latter case having already been
-- expanded as an expression for the association.
if Box_Present (Assn) then
if not Has_Preelaborable_Initialization (Comp_Type) then
return False;
end if;
-- In the expression case we check whether the expression
-- is preelaborable.
elsif
not Is_Preelaborable_Expression (Expression (Assn))
then
return False;
end if;
Next (Assn);
end loop;
-- If we get here then aggregate as a whole is preelaborable
return True;
-- All other cases are not preelaborable
else
return False;
end if;
end Is_Preelaborable_Expression;
-- Start of processing for Check_Components
begin
-- Loop through entities of record or protected type
Ent := E;
while Present (Ent) loop
-- We are interested only in components and discriminants
Exp := Empty;
case Ekind (Ent) is
when E_Component =>
-- Get default expression if any. If there is no declaration
-- node, it means we have an internal entity. The parent and
-- tag fields are examples of such entities. For such cases,
-- we just test the type of the entity.
if Present (Declaration_Node (Ent)) then
Exp := Expression (Declaration_Node (Ent));
end if;
when E_Discriminant =>
-- Note: for a renamed discriminant, the Declaration_Node
-- may point to the one from the ancestor, and have a
-- different expression, so use the proper attribute to
-- retrieve the expression from the derived constraint.
Exp := Discriminant_Default_Value (Ent);
when others =>
goto Check_Next_Entity;
end case;
-- A component has PI if it has no default expression and the
-- component type has PI.
if No (Exp) then
if not Has_Preelaborable_Initialization (Etype (Ent)) then
Has_PE := False;
exit;
end if;
-- Require the default expression to be preelaborable
elsif not Is_Preelaborable_Expression (Exp) then
Has_PE := False;
exit;
end if;
<<Check_Next_Entity>>
Next_Entity (Ent);
end loop;
end Check_Components;
-- Start of processing for Has_Preelaborable_Initialization
begin
-- Immediate return if already marked as known preelaborable init. This
-- covers types for which this function has already been called once
-- and returned True (in which case the result is cached), and also
-- types to which a pragma Preelaborable_Initialization applies.
if Known_To_Have_Preelab_Init (E) then
return True;
end if;
-- If the type is a subtype representing a generic actual type, then
-- test whether its base type has preelaborable initialization since
-- the subtype representing the actual does not inherit this attribute
-- from the actual or formal. (but maybe it should???)
if Is_Generic_Actual_Type (E) then
return Has_Preelaborable_Initialization (Base_Type (E));
end if;
-- All elementary types have preelaborable initialization
if Is_Elementary_Type (E) then
Has_PE := True;
-- Array types have PI if the component type has PI
elsif Is_Array_Type (E) then
Has_PE := Has_Preelaborable_Initialization (Component_Type (E));
-- A derived type has preelaborable initialization if its parent type
-- has preelaborable initialization and (in the case of a derived record
-- extension) if the non-inherited components all have preelaborable
-- initialization. However, a user-defined controlled type with an
-- overriding Initialize procedure does not have preelaborable
-- initialization.
elsif Is_Derived_Type (E) then
-- If the derived type is a private extension then it doesn't have
-- preelaborable initialization.
if Ekind (Base_Type (E)) = E_Record_Type_With_Private then
return False;
end if;
-- First check whether ancestor type has preelaborable initialization
Has_PE := Has_Preelaborable_Initialization (Etype (Base_Type (E)));
-- If OK, check extension components (if any)
if Has_PE and then Is_Record_Type (E) then
Check_Components (First_Entity (E));
end if;
-- Check specifically for 10.2.1(11.4/2) exception: a controlled type
-- with a user defined Initialize procedure does not have PI. If
-- the type is untagged, the control primitives come from a component
-- that has already been checked.
if Has_PE
and then Is_Controlled (E)
and then Is_Tagged_Type (E)
and then Has_Overriding_Initialize (E)
then
Has_PE := False;
end if;
-- Private types not derived from a type having preelaborable init and
-- that are not marked with pragma Preelaborable_Initialization do not
-- have preelaborable initialization.
elsif Is_Private_Type (E) then
return False;
-- Record type has PI if it is non private and all components have PI
elsif Is_Record_Type (E) then
Has_PE := True;
Check_Components (First_Entity (E));
-- Protected types must not have entries, and components must meet
-- same set of rules as for record components.
elsif Is_Protected_Type (E) then
if Has_Entries (E) then
Has_PE := False;
else
Has_PE := True;
Check_Components (First_Entity (E));
Check_Components (First_Private_Entity (E));
end if;
-- Type System.Address always has preelaborable initialization
elsif Is_RTE (E, RE_Address) then
Has_PE := True;
-- In all other cases, type does not have preelaborable initialization
else
return False;
end if;
-- If type has preelaborable initialization, cache result
if Has_PE then
Set_Known_To_Have_Preelab_Init (E);
end if;
return Has_PE;
end Has_Preelaborable_Initialization;
---------------------------
-- Has_Private_Component --
---------------------------
function Has_Private_Component (Type_Id : Entity_Id) return Boolean is
Btype : Entity_Id := Base_Type (Type_Id);
Component : Entity_Id;
begin
if Error_Posted (Type_Id)
or else Error_Posted (Btype)
then
return False;
end if;
if Is_Class_Wide_Type (Btype) then
Btype := Root_Type (Btype);
end if;
if Is_Private_Type (Btype) then
declare
UT : constant Entity_Id := Underlying_Type (Btype);
begin
if No (UT) then
if No (Full_View (Btype)) then
return not Is_Generic_Type (Btype)
and then
not Is_Generic_Type (Root_Type (Btype));
else
return not Is_Generic_Type (Root_Type (Full_View (Btype)));
end if;
else
return not Is_Frozen (UT) and then Has_Private_Component (UT);
end if;
end;
elsif Is_Array_Type (Btype) then
return Has_Private_Component (Component_Type (Btype));
elsif Is_Record_Type (Btype) then
Component := First_Component (Btype);
while Present (Component) loop
if Has_Private_Component (Etype (Component)) then
return True;
end if;
Next_Component (Component);
end loop;
return False;
elsif Is_Protected_Type (Btype)
and then Present (Corresponding_Record_Type (Btype))
then
return Has_Private_Component (Corresponding_Record_Type (Btype));
else
return False;
end if;
end Has_Private_Component;
----------------------
-- Has_Signed_Zeros --
----------------------
function Has_Signed_Zeros (E : Entity_Id) return Boolean is
begin
return Is_Floating_Point_Type (E) and then Signed_Zeros_On_Target;
end Has_Signed_Zeros;
------------------------------
-- Has_Significant_Contract --
------------------------------
function Has_Significant_Contract (Subp_Id : Entity_Id) return Boolean is
Subp_Nam : constant Name_Id := Chars (Subp_Id);
begin
-- _Finalizer procedure
if Subp_Nam = Name_uFinalizer then
return False;
-- _Postconditions procedure
elsif Subp_Nam = Name_uPostconditions then
return False;
-- Predicate function
elsif Ekind (Subp_Id) = E_Function
and then Is_Predicate_Function (Subp_Id)
then
return False;
-- TSS subprogram
elsif Get_TSS_Name (Subp_Id) /= TSS_Null then
return False;
else
return True;
end if;
end Has_Significant_Contract;
-----------------------------
-- Has_Static_Array_Bounds --
-----------------------------
function Has_Static_Array_Bounds (Typ : Node_Id) return Boolean is
Ndims : constant Nat := Number_Dimensions (Typ);
Index : Node_Id;
Low : Node_Id;
High : Node_Id;
begin
-- Unconstrained types do not have static bounds
if not Is_Constrained (Typ) then
return False;
end if;
-- First treat string literals specially, as the lower bound and length
-- of string literals are not stored like those of arrays.
-- A string literal always has static bounds
if Ekind (Typ) = E_String_Literal_Subtype then
return True;
end if;
-- Treat all dimensions in turn
Index := First_Index (Typ);
for Indx in 1 .. Ndims loop
-- In case of an illegal index which is not a discrete type, return
-- that the type is not static.
if not Is_Discrete_Type (Etype (Index))
or else Etype (Index) = Any_Type
then
return False;
end if;
Get_Index_Bounds (Index, Low, High);
if Error_Posted (Low) or else Error_Posted (High) then
return False;
end if;
if Is_OK_Static_Expression (Low)
and then
Is_OK_Static_Expression (High)
then
null;
else
return False;
end if;
Next (Index);
end loop;
-- If we fall through the loop, all indexes matched
return True;
end Has_Static_Array_Bounds;
----------------
-- Has_Stream --
----------------
function Has_Stream (T : Entity_Id) return Boolean is
E : Entity_Id;
begin
if No (T) then
return False;
elsif Is_RTE (Root_Type (T), RE_Root_Stream_Type) then
return True;
elsif Is_Array_Type (T) then
return Has_Stream (Component_Type (T));
elsif Is_Record_Type (T) then
E := First_Component (T);
while Present (E) loop
if Has_Stream (Etype (E)) then
return True;
else
Next_Component (E);
end if;
end loop;
return False;
elsif Is_Private_Type (T) then
return Has_Stream (Underlying_Type (T));
else
return False;
end if;
end Has_Stream;
----------------
-- Has_Suffix --
----------------
function Has_Suffix (E : Entity_Id; Suffix : Character) return Boolean is
begin
Get_Name_String (Chars (E));
return Name_Buffer (Name_Len) = Suffix;
end Has_Suffix;
----------------
-- Add_Suffix --
----------------
function Add_Suffix (E : Entity_Id; Suffix : Character) return Name_Id is
begin
Get_Name_String (Chars (E));
Add_Char_To_Name_Buffer (Suffix);
return Name_Find;
end Add_Suffix;
-------------------
-- Remove_Suffix --
-------------------
function Remove_Suffix (E : Entity_Id; Suffix : Character) return Name_Id is
begin
pragma Assert (Has_Suffix (E, Suffix));
Get_Name_String (Chars (E));
Name_Len := Name_Len - 1;
return Name_Find;
end Remove_Suffix;
----------------------------------
-- Replace_Null_By_Null_Address --
----------------------------------
procedure Replace_Null_By_Null_Address (N : Node_Id) is
procedure Replace_Null_Operand (Op : Node_Id; Other_Op : Node_Id);
-- Replace operand Op with a reference to Null_Address when the operand
-- denotes a null Address. Other_Op denotes the other operand.
--------------------------
-- Replace_Null_Operand --
--------------------------
procedure Replace_Null_Operand (Op : Node_Id; Other_Op : Node_Id) is
begin
-- Check the type of the complementary operand since the N_Null node
-- has not been decorated yet.
if Nkind (Op) = N_Null
and then Is_Descendant_Of_Address (Etype (Other_Op))
then
Rewrite (Op, New_Occurrence_Of (RTE (RE_Null_Address), Sloc (Op)));
end if;
end Replace_Null_Operand;
-- Start of processing for Replace_Null_By_Null_Address
begin
pragma Assert (Relaxed_RM_Semantics);
pragma Assert (Nkind_In (N, N_Null,
N_Op_Eq,
N_Op_Ge,
N_Op_Gt,
N_Op_Le,
N_Op_Lt,
N_Op_Ne));
if Nkind (N) = N_Null then
Rewrite (N, New_Occurrence_Of (RTE (RE_Null_Address), Sloc (N)));
else
declare
L : constant Node_Id := Left_Opnd (N);
R : constant Node_Id := Right_Opnd (N);
begin
Replace_Null_Operand (L, Other_Op => R);
Replace_Null_Operand (R, Other_Op => L);
end;
end if;
end Replace_Null_By_Null_Address;
--------------------------
-- Has_Tagged_Component --
--------------------------
function Has_Tagged_Component (Typ : Entity_Id) return Boolean is
Comp : Entity_Id;
begin
if Is_Private_Type (Typ) and then Present (Underlying_Type (Typ)) then
return Has_Tagged_Component (Underlying_Type (Typ));
elsif Is_Array_Type (Typ) then
return Has_Tagged_Component (Component_Type (Typ));
elsif Is_Tagged_Type (Typ) then
return True;
elsif Is_Record_Type (Typ) then
Comp := First_Component (Typ);
while Present (Comp) loop
if Has_Tagged_Component (Etype (Comp)) then
return True;
end if;
Next_Component (Comp);
end loop;
return False;
else
return False;
end if;
end Has_Tagged_Component;
-----------------------------
-- Has_Undefined_Reference --
-----------------------------
function Has_Undefined_Reference (Expr : Node_Id) return Boolean is
Has_Undef_Ref : Boolean := False;
-- Flag set when expression Expr contains at least one undefined
-- reference.
function Is_Undefined_Reference (N : Node_Id) return Traverse_Result;
-- Determine whether N denotes a reference and if it does, whether it is
-- undefined.
----------------------------
-- Is_Undefined_Reference --
----------------------------
function Is_Undefined_Reference (N : Node_Id) return Traverse_Result is
begin
if Is_Entity_Name (N)
and then Present (Entity (N))
and then Entity (N) = Any_Id
then
Has_Undef_Ref := True;
return Abandon;
end if;
return OK;
end Is_Undefined_Reference;
procedure Find_Undefined_References is
new Traverse_Proc (Is_Undefined_Reference);
-- Start of processing for Has_Undefined_Reference
begin
Find_Undefined_References (Expr);
return Has_Undef_Ref;
end Has_Undefined_Reference;
----------------------------
-- Has_Volatile_Component --
----------------------------
function Has_Volatile_Component (Typ : Entity_Id) return Boolean is
Comp : Entity_Id;
begin
if Has_Volatile_Components (Typ) then
return True;
elsif Is_Array_Type (Typ) then
return Is_Volatile (Component_Type (Typ));
elsif Is_Record_Type (Typ) then
Comp := First_Component (Typ);
while Present (Comp) loop
if Is_Volatile_Object (Comp) then
return True;
end if;
Comp := Next_Component (Comp);
end loop;
end if;
return False;
end Has_Volatile_Component;
-------------------------
-- Implementation_Kind --
-------------------------
function Implementation_Kind (Subp : Entity_Id) return Name_Id is
Impl_Prag : constant Node_Id := Get_Rep_Pragma (Subp, Name_Implemented);
Arg : Node_Id;
begin
pragma Assert (Present (Impl_Prag));
Arg := Last (Pragma_Argument_Associations (Impl_Prag));
return Chars (Get_Pragma_Arg (Arg));
end Implementation_Kind;
--------------------------
-- Implements_Interface --
--------------------------
function Implements_Interface
(Typ_Ent : Entity_Id;
Iface_Ent : Entity_Id;
Exclude_Parents : Boolean := False) return Boolean
is
Ifaces_List : Elist_Id;
Elmt : Elmt_Id;
Iface : Entity_Id := Base_Type (Iface_Ent);
Typ : Entity_Id := Base_Type (Typ_Ent);
begin
if Is_Class_Wide_Type (Typ) then
Typ := Root_Type (Typ);
end if;
if not Has_Interfaces (Typ) then
return False;
end if;
if Is_Class_Wide_Type (Iface) then
Iface := Root_Type (Iface);
end if;
Collect_Interfaces (Typ, Ifaces_List);
Elmt := First_Elmt (Ifaces_List);
while Present (Elmt) loop
if Is_Ancestor (Node (Elmt), Typ, Use_Full_View => True)
and then Exclude_Parents
then
null;
elsif Node (Elmt) = Iface then
return True;
end if;
Next_Elmt (Elmt);
end loop;
return False;
end Implements_Interface;
------------------------------------
-- In_Assertion_Expression_Pragma --
------------------------------------
function In_Assertion_Expression_Pragma (N : Node_Id) return Boolean is
Par : Node_Id;
Prag : Node_Id := Empty;
begin
-- Climb the parent chain looking for an enclosing pragma
Par := N;
while Present (Par) loop
if Nkind (Par) = N_Pragma then
Prag := Par;
exit;
-- Precondition-like pragmas are expanded into if statements, check
-- the original node instead.
elsif Nkind (Original_Node (Par)) = N_Pragma then
Prag := Original_Node (Par);
exit;
-- The expansion of attribute 'Old generates a constant to capture
-- the result of the prefix. If the parent traversal reaches
-- one of these constants, then the node technically came from a
-- postcondition-like pragma. Note that the Ekind is not tested here
-- because N may be the expression of an object declaration which is
-- currently being analyzed. Such objects carry Ekind of E_Void.
elsif Nkind (Par) = N_Object_Declaration
and then Constant_Present (Par)
and then Stores_Attribute_Old_Prefix (Defining_Entity (Par))
then
return True;
-- Prevent the search from going too far
elsif Is_Body_Or_Package_Declaration (Par) then
return False;
end if;
Par := Parent (Par);
end loop;
return
Present (Prag)
and then Assertion_Expression_Pragma (Get_Pragma_Id (Prag));
end In_Assertion_Expression_Pragma;
----------------------
-- In_Generic_Scope --
----------------------
function In_Generic_Scope (E : Entity_Id) return Boolean is
S : Entity_Id;
begin
S := Scope (E);
while Present (S) and then S /= Standard_Standard loop
if Is_Generic_Unit (S) then
return True;
end if;
S := Scope (S);
end loop;
return False;
end In_Generic_Scope;
-----------------
-- In_Instance --
-----------------
function In_Instance return Boolean is
Curr_Unit : constant Entity_Id := Cunit_Entity (Current_Sem_Unit);
S : Entity_Id;
begin
S := Current_Scope;
while Present (S) and then S /= Standard_Standard loop
if Ekind_In (S, E_Function, E_Package, E_Procedure)
and then Is_Generic_Instance (S)
then
-- A child instance is always compiled in the context of a parent
-- instance. Nevertheless, the actuals are not analyzed in an
-- instance context. We detect this case by examining the current
-- compilation unit, which must be a child instance, and checking
-- that it is not currently on the scope stack.
if Is_Child_Unit (Curr_Unit)
and then Nkind (Unit (Cunit (Current_Sem_Unit))) =
N_Package_Instantiation
and then not In_Open_Scopes (Curr_Unit)
then
return False;
else
return True;
end if;
end if;
S := Scope (S);
end loop;
return False;
end In_Instance;
----------------------
-- In_Instance_Body --
----------------------
function In_Instance_Body return Boolean is
S : Entity_Id;
begin
S := Current_Scope;
while Present (S) and then S /= Standard_Standard loop
if Ekind_In (S, E_Function, E_Procedure)
and then Is_Generic_Instance (S)
then
return True;
elsif Ekind (S) = E_Package
and then In_Package_Body (S)
and then Is_Generic_Instance (S)
then
return True;
end if;
S := Scope (S);
end loop;
return False;
end In_Instance_Body;
-----------------------------
-- In_Instance_Not_Visible --
-----------------------------
function In_Instance_Not_Visible return Boolean is
S : Entity_Id;
begin
S := Current_Scope;
while Present (S) and then S /= Standard_Standard loop
if Ekind_In (S, E_Function, E_Procedure)
and then Is_Generic_Instance (S)
then
return True;
elsif Ekind (S) = E_Package
and then (In_Package_Body (S) or else In_Private_Part (S))
and then Is_Generic_Instance (S)
then
return True;
end if;
S := Scope (S);
end loop;
return False;
end In_Instance_Not_Visible;
------------------------------
-- In_Instance_Visible_Part --
------------------------------
function In_Instance_Visible_Part return Boolean is
S : Entity_Id;
begin
S := Current_Scope;
while Present (S) and then S /= Standard_Standard loop
if Ekind (S) = E_Package
and then Is_Generic_Instance (S)
and then not In_Package_Body (S)
and then not In_Private_Part (S)
then
return True;
end if;
S := Scope (S);
end loop;
return False;
end In_Instance_Visible_Part;
---------------------
-- In_Package_Body --
---------------------
function In_Package_Body return Boolean is
S : Entity_Id;
begin
S := Current_Scope;
while Present (S) and then S /= Standard_Standard loop
if Ekind (S) = E_Package and then In_Package_Body (S) then
return True;
else
S := Scope (S);
end if;
end loop;
return False;
end In_Package_Body;
--------------------------------
-- In_Parameter_Specification --
--------------------------------
function In_Parameter_Specification (N : Node_Id) return Boolean is
PN : Node_Id;
begin
PN := Parent (N);
while Present (PN) loop
if Nkind (PN) = N_Parameter_Specification then
return True;
end if;
PN := Parent (PN);
end loop;
return False;
end In_Parameter_Specification;
--------------------------
-- In_Pragma_Expression --
--------------------------
function In_Pragma_Expression (N : Node_Id; Nam : Name_Id) return Boolean is
P : Node_Id;
begin
P := Parent (N);
loop
if No (P) then
return False;
elsif Nkind (P) = N_Pragma and then Pragma_Name (P) = Nam then
return True;
else
P := Parent (P);
end if;
end loop;
end In_Pragma_Expression;
---------------------------
-- In_Pre_Post_Condition --
---------------------------
function In_Pre_Post_Condition (N : Node_Id) return Boolean is
Par : Node_Id;
Prag : Node_Id := Empty;
Prag_Id : Pragma_Id;
begin
-- Climb the parent chain looking for an enclosing pragma
Par := N;
while Present (Par) loop
if Nkind (Par) = N_Pragma then
Prag := Par;
exit;
-- Prevent the search from going too far
elsif Is_Body_Or_Package_Declaration (Par) then
exit;
end if;
Par := Parent (Par);
end loop;
if Present (Prag) then
Prag_Id := Get_Pragma_Id (Prag);
return
Prag_Id = Pragma_Post
or else Prag_Id = Pragma_Post_Class
or else Prag_Id = Pragma_Postcondition
or else Prag_Id = Pragma_Pre
or else Prag_Id = Pragma_Pre_Class
or else Prag_Id = Pragma_Precondition;
-- Otherwise the node is not enclosed by a pre/postcondition pragma
else
return False;
end if;
end In_Pre_Post_Condition;
-------------------------------------
-- In_Reverse_Storage_Order_Object --
-------------------------------------
function In_Reverse_Storage_Order_Object (N : Node_Id) return Boolean is
Pref : Node_Id;
Btyp : Entity_Id := Empty;
begin
-- Climb up indexed components
Pref := N;
loop
case Nkind (Pref) is
when N_Selected_Component =>
Pref := Prefix (Pref);
exit;
when N_Indexed_Component =>
Pref := Prefix (Pref);
when others =>
Pref := Empty;
exit;
end case;
end loop;
if Present (Pref) then
Btyp := Base_Type (Etype (Pref));
end if;
return Present (Btyp)
and then (Is_Record_Type (Btyp) or else Is_Array_Type (Btyp))
and then Reverse_Storage_Order (Btyp);
end In_Reverse_Storage_Order_Object;
--------------------------------------
-- In_Subprogram_Or_Concurrent_Unit --
--------------------------------------
function In_Subprogram_Or_Concurrent_Unit return Boolean is
E : Entity_Id;
K : Entity_Kind;
begin
-- Use scope chain to check successively outer scopes
E := Current_Scope;
loop
K := Ekind (E);
if K in Subprogram_Kind
or else K in Concurrent_Kind
or else K in Generic_Subprogram_Kind
then
return True;
elsif E = Standard_Standard then
return False;
end if;
E := Scope (E);
end loop;
end In_Subprogram_Or_Concurrent_Unit;
---------------------
-- In_Visible_Part --
---------------------
function In_Visible_Part (Scope_Id : Entity_Id) return Boolean is
begin
return Is_Package_Or_Generic_Package (Scope_Id)
and then In_Open_Scopes (Scope_Id)
and then not In_Package_Body (Scope_Id)
and then not In_Private_Part (Scope_Id);
end In_Visible_Part;
--------------------------------
-- Incomplete_Or_Partial_View --
--------------------------------
function Incomplete_Or_Partial_View (Id : Entity_Id) return Entity_Id is
function Inspect_Decls
(Decls : List_Id;
Taft : Boolean := False) return Entity_Id;
-- Check whether a declarative region contains the incomplete or partial
-- view of Id.
-------------------
-- Inspect_Decls --
-------------------
function Inspect_Decls
(Decls : List_Id;
Taft : Boolean := False) return Entity_Id
is
Decl : Node_Id;
Match : Node_Id;
begin
Decl := First (Decls);
while Present (Decl) loop
Match := Empty;
-- The partial view of a Taft-amendment type is an incomplete
-- type.
if Taft then
if Nkind (Decl) = N_Incomplete_Type_Declaration then
Match := Defining_Identifier (Decl);
end if;
-- Otherwise look for a private type whose full view matches the
-- input type. Note that this checks full_type_declaration nodes
-- to account for derivations from a private type where the type
-- declaration hold the partial view and the full view is an
-- itype.
elsif Nkind_In (Decl, N_Full_Type_Declaration,
N_Private_Extension_Declaration,
N_Private_Type_Declaration)
then
Match := Defining_Identifier (Decl);
end if;
-- Guard against unanalyzed entities
if Present (Match)
and then Is_Type (Match)
and then Present (Full_View (Match))
and then Full_View (Match) = Id
then
return Match;
end if;
Next (Decl);
end loop;
return Empty;
end Inspect_Decls;
-- Local variables
Prev : Entity_Id;
-- Start of processing for Incomplete_Or_Partial_View
begin
-- Deferred constant or incomplete type case
Prev := Current_Entity_In_Scope (Id);
if Present (Prev)
and then (Is_Incomplete_Type (Prev) or else Ekind (Prev) = E_Constant)
and then Present (Full_View (Prev))
and then Full_View (Prev) = Id
then
return Prev;
end if;
-- Private or Taft amendment type case
declare
Pkg : constant Entity_Id := Scope (Id);
Pkg_Decl : Node_Id := Pkg;
begin
if Present (Pkg)
and then Ekind_In (Pkg, E_Generic_Package, E_Package)
then
while Nkind (Pkg_Decl) /= N_Package_Specification loop
Pkg_Decl := Parent (Pkg_Decl);
end loop;
-- It is knows that Typ has a private view, look for it in the
-- visible declarations of the enclosing scope. A special case
-- of this is when the two views have been exchanged - the full
-- appears earlier than the private.
if Has_Private_Declaration (Id) then
Prev := Inspect_Decls (Visible_Declarations (Pkg_Decl));
-- Exchanged view case, look in the private declarations
if No (Prev) then
Prev := Inspect_Decls (Private_Declarations (Pkg_Decl));
end if;
return Prev;
-- Otherwise if this is the package body, then Typ is a potential
-- Taft amendment type. The incomplete view should be located in
-- the private declarations of the enclosing scope.
elsif In_Package_Body (Pkg) then
return Inspect_Decls (Private_Declarations (Pkg_Decl), True);
end if;
end if;
end;
-- The type has no incomplete or private view
return Empty;
end Incomplete_Or_Partial_View;
----------------------------------
-- Indexed_Component_Bit_Offset --
----------------------------------
function Indexed_Component_Bit_Offset (N : Node_Id) return Uint is
Exp : constant Node_Id := First (Expressions (N));
Typ : constant Entity_Id := Etype (Prefix (N));
Off : constant Uint := Component_Size (Typ);
Ind : Node_Id;
begin
-- Return early if the component size is not known or variable
if Off = No_Uint or else Off < Uint_0 then
return No_Uint;
end if;
-- Deal with the degenerate case of an empty component
if Off = Uint_0 then
return Off;
end if;
-- Check that both the index value and the low bound are known
if not Compile_Time_Known_Value (Exp) then
return No_Uint;
end if;
Ind := First_Index (Typ);
if No (Ind) then
return No_Uint;
end if;
if Nkind (Ind) = N_Subtype_Indication then
Ind := Constraint (Ind);
if Nkind (Ind) = N_Range_Constraint then
Ind := Range_Expression (Ind);
end if;
end if;
if Nkind (Ind) /= N_Range
or else not Compile_Time_Known_Value (Low_Bound (Ind))
then
return No_Uint;
end if;
-- Return the scaled offset
return Off * (Expr_Value (Exp) - Expr_Value (Low_Bound ((Ind))));
end Indexed_Component_Bit_Offset;
----------------------------
-- Inherit_Rep_Item_Chain --
----------------------------
procedure Inherit_Rep_Item_Chain (Typ : Entity_Id; From_Typ : Entity_Id) is
Item : Node_Id;
Next_Item : Node_Id;
begin
-- There are several inheritance scenarios to consider depending on
-- whether both types have rep item chains and whether the destination
-- type already inherits part of the source type's rep item chain.
-- 1) The source type lacks a rep item chain
-- From_Typ ---> Empty
--
-- Typ --------> Item (or Empty)
-- In this case inheritance cannot take place because there are no items
-- to inherit.
-- 2) The destination type lacks a rep item chain
-- From_Typ ---> Item ---> ...
--
-- Typ --------> Empty
-- Inheritance takes place by setting the First_Rep_Item of the
-- destination type to the First_Rep_Item of the source type.
-- From_Typ ---> Item ---> ...
-- ^
-- Typ -----------+
-- 3.1) Both source and destination types have at least one rep item.
-- The destination type does NOT inherit a rep item from the source
-- type.
-- From_Typ ---> Item ---> Item
--
-- Typ --------> Item ---> Item
-- Inheritance takes place by setting the Next_Rep_Item of the last item
-- of the destination type to the First_Rep_Item of the source type.
-- From_Typ -------------------> Item ---> Item
-- ^
-- Typ --------> Item ---> Item --+
-- 3.2) Both source and destination types have at least one rep item.
-- The destination type DOES inherit part of the rep item chain of the
-- source type.
-- From_Typ ---> Item ---> Item ---> Item
-- ^
-- Typ --------> Item ------+
-- This rare case arises when the full view of a private extension must
-- inherit the rep item chain from the full view of its parent type and
-- the full view of the parent type contains extra rep items. Currently
-- only invariants may lead to such form of inheritance.
-- type From_Typ is tagged private
-- with Type_Invariant'Class => Item_2;
-- type Typ is new From_Typ with private
-- with Type_Invariant => Item_4;
-- At this point the rep item chains contain the following items
-- From_Typ -----------> Item_2 ---> Item_3
-- ^
-- Typ --------> Item_4 --+
-- The full views of both types may introduce extra invariants
-- type From_Typ is tagged null record
-- with Type_Invariant => Item_1;
-- type Typ is new From_Typ with null record;
-- The full view of Typ would have to inherit any new rep items added to
-- the full view of From_Typ.
-- From_Typ -----------> Item_1 ---> Item_2 ---> Item_3
-- ^
-- Typ --------> Item_4 --+
-- To achieve this form of inheritance, the destination type must first
-- sever the link between its own rep chain and that of the source type,
-- then inheritance 3.1 takes place.
-- Case 1: The source type lacks a rep item chain
if No (First_Rep_Item (From_Typ)) then
return;
-- Case 2: The destination type lacks a rep item chain
elsif No (First_Rep_Item (Typ)) then
Set_First_Rep_Item (Typ, First_Rep_Item (From_Typ));
-- Case 3: Both the source and destination types have at least one rep
-- item. Traverse the rep item chain of the destination type to find the
-- last rep item.
else
Item := Empty;
Next_Item := First_Rep_Item (Typ);
while Present (Next_Item) loop
-- Detect a link between the destination type's rep chain and that
-- of the source type. There are two possibilities:
-- Variant 1
-- Next_Item
-- V
-- From_Typ ---> Item_1 --->
-- ^
-- Typ -----------+
--
-- Item is Empty
-- Variant 2
-- Next_Item
-- V
-- From_Typ ---> Item_1 ---> Item_2 --->
-- ^
-- Typ --------> Item_3 ------+
-- ^
-- Item
if Has_Rep_Item (From_Typ, Next_Item) then
exit;
end if;
Item := Next_Item;
Next_Item := Next_Rep_Item (Next_Item);
end loop;
-- Inherit the source type's rep item chain
if Present (Item) then
Set_Next_Rep_Item (Item, First_Rep_Item (From_Typ));
else
Set_First_Rep_Item (Typ, First_Rep_Item (From_Typ));
end if;
end if;
end Inherit_Rep_Item_Chain;
---------------------------------
-- Insert_Explicit_Dereference --
---------------------------------
procedure Insert_Explicit_Dereference (N : Node_Id) is
New_Prefix : constant Node_Id := Relocate_Node (N);
Ent : Entity_Id := Empty;
Pref : Node_Id;
I : Interp_Index;
It : Interp;
T : Entity_Id;
begin
Save_Interps (N, New_Prefix);
Rewrite (N,
Make_Explicit_Dereference (Sloc (Parent (N)),
Prefix => New_Prefix));
Set_Etype (N, Designated_Type (Etype (New_Prefix)));
if Is_Overloaded (New_Prefix) then
-- The dereference is also overloaded, and its interpretations are
-- the designated types of the interpretations of the original node.
Set_Etype (N, Any_Type);
Get_First_Interp (New_Prefix, I, It);
while Present (It.Nam) loop
T := It.Typ;
if Is_Access_Type (T) then
Add_One_Interp (N, Designated_Type (T), Designated_Type (T));
end if;
Get_Next_Interp (I, It);
end loop;
End_Interp_List;
else
-- Prefix is unambiguous: mark the original prefix (which might
-- Come_From_Source) as a reference, since the new (relocated) one
-- won't be taken into account.
if Is_Entity_Name (New_Prefix) then
Ent := Entity (New_Prefix);
Pref := New_Prefix;
-- For a retrieval of a subcomponent of some composite object,
-- retrieve the ultimate entity if there is one.
elsif Nkind_In (New_Prefix, N_Selected_Component,
N_Indexed_Component)
then
Pref := Prefix (New_Prefix);
while Present (Pref)
and then Nkind_In (Pref, N_Selected_Component,
N_Indexed_Component)
loop
Pref := Prefix (Pref);
end loop;
if Present (Pref) and then Is_Entity_Name (Pref) then
Ent := Entity (Pref);
end if;
end if;
-- Place the reference on the entity node
if Present (Ent) then
Generate_Reference (Ent, Pref);
end if;
end if;
end Insert_Explicit_Dereference;
------------------------------------------
-- Inspect_Deferred_Constant_Completion --
------------------------------------------
procedure Inspect_Deferred_Constant_Completion (Decls : List_Id) is
Decl : Node_Id;
begin
Decl := First (Decls);
while Present (Decl) loop
-- Deferred constant signature
if Nkind (Decl) = N_Object_Declaration
and then Constant_Present (Decl)
and then No (Expression (Decl))
-- No need to check internally generated constants
and then Comes_From_Source (Decl)
-- The constant is not completed. A full object declaration or a
-- pragma Import complete a deferred constant.
and then not Has_Completion (Defining_Identifier (Decl))
then
Error_Msg_N
("constant declaration requires initialization expression",
Defining_Identifier (Decl));
end if;
Decl := Next (Decl);
end loop;
end Inspect_Deferred_Constant_Completion;
-----------------------------
-- Install_Generic_Formals --
-----------------------------
procedure Install_Generic_Formals (Subp_Id : Entity_Id) is
E : Entity_Id;
begin
pragma Assert (Is_Generic_Subprogram (Subp_Id));
E := First_Entity (Subp_Id);
while Present (E) loop
Install_Entity (E);
Next_Entity (E);
end loop;
end Install_Generic_Formals;
-----------------------------
-- Is_Actual_Out_Parameter --
-----------------------------
function Is_Actual_Out_Parameter (N : Node_Id) return Boolean is
Formal : Entity_Id;
Call : Node_Id;
begin
Find_Actual (N, Formal, Call);
return Present (Formal) and then Ekind (Formal) = E_Out_Parameter;
end Is_Actual_Out_Parameter;
-------------------------
-- Is_Actual_Parameter --
-------------------------
function Is_Actual_Parameter (N : Node_Id) return Boolean is
PK : constant Node_Kind := Nkind (Parent (N));
begin
case PK is
when N_Parameter_Association =>
return N = Explicit_Actual_Parameter (Parent (N));
when N_Subprogram_Call =>
return Is_List_Member (N)
and then
List_Containing (N) = Parameter_Associations (Parent (N));
when others =>
return False;
end case;
end Is_Actual_Parameter;
--------------------------------
-- Is_Actual_Tagged_Parameter --
--------------------------------
function Is_Actual_Tagged_Parameter (N : Node_Id) return Boolean is
Formal : Entity_Id;
Call : Node_Id;
begin
Find_Actual (N, Formal, Call);
return Present (Formal) and then Is_Tagged_Type (Etype (Formal));
end Is_Actual_Tagged_Parameter;
---------------------
-- Is_Aliased_View --
---------------------
function Is_Aliased_View (Obj : Node_Id) return Boolean is
E : Entity_Id;
begin
if Is_Entity_Name (Obj) then
E := Entity (Obj);
return
(Is_Object (E)
and then
(Is_Aliased (E)
or else (Present (Renamed_Object (E))
and then Is_Aliased_View (Renamed_Object (E)))))
or else ((Is_Formal (E)
or else Ekind_In (E, E_Generic_In_Out_Parameter,
E_Generic_In_Parameter))
and then Is_Tagged_Type (Etype (E)))
or else (Is_Concurrent_Type (E) and then In_Open_Scopes (E))
-- Current instance of type, either directly or as rewritten
-- reference to the current object.
or else (Is_Entity_Name (Original_Node (Obj))
and then Present (Entity (Original_Node (Obj)))
and then Is_Type (Entity (Original_Node (Obj))))
or else (Is_Type (E) and then E = Current_Scope)
or else (Is_Incomplete_Or_Private_Type (E)
and then Full_View (E) = Current_Scope)
-- Ada 2012 AI05-0053: the return object of an extended return
-- statement is aliased if its type is immutably limited.
or else (Is_Return_Object (E)
and then Is_Limited_View (Etype (E)));
elsif Nkind (Obj) = N_Selected_Component then
return Is_Aliased (Entity (Selector_Name (Obj)));
elsif Nkind (Obj) = N_Indexed_Component then
return Has_Aliased_Components (Etype (Prefix (Obj)))
or else
(Is_Access_Type (Etype (Prefix (Obj)))
and then Has_Aliased_Components
(Designated_Type (Etype (Prefix (Obj)))));
elsif Nkind_In (Obj, N_Unchecked_Type_Conversion, N_Type_Conversion) then
return Is_Tagged_Type (Etype (Obj))
and then Is_Aliased_View (Expression (Obj));
elsif Nkind (Obj) = N_Explicit_Dereference then
return Nkind (Original_Node (Obj)) /= N_Function_Call;
else
return False;
end if;
end Is_Aliased_View;
-------------------------
-- Is_Ancestor_Package --
-------------------------
function Is_Ancestor_Package
(E1 : Entity_Id;
E2 : Entity_Id) return Boolean
is
Par : Entity_Id;
begin
Par := E2;
while Present (Par) and then Par /= Standard_Standard loop
if Par = E1 then
return True;
end if;
Par := Scope (Par);
end loop;
return False;
end Is_Ancestor_Package;
----------------------
-- Is_Atomic_Object --
----------------------
function Is_Atomic_Object (N : Node_Id) return Boolean is
function Object_Has_Atomic_Components (N : Node_Id) return Boolean;
-- Determines if given object has atomic components
function Is_Atomic_Prefix (N : Node_Id) return Boolean;
-- If prefix is an implicit dereference, examine designated type
----------------------
-- Is_Atomic_Prefix --
----------------------
function Is_Atomic_Prefix (N : Node_Id) return Boolean is
begin
if Is_Access_Type (Etype (N)) then
return
Has_Atomic_Components (Designated_Type (Etype (N)));
else
return Object_Has_Atomic_Components (N);
end if;
end Is_Atomic_Prefix;
----------------------------------
-- Object_Has_Atomic_Components --
----------------------------------
function Object_Has_Atomic_Components (N : Node_Id) return Boolean is
begin
if Has_Atomic_Components (Etype (N))
or else Is_Atomic (Etype (N))
then
return True;
elsif Is_Entity_Name (N)
and then (Has_Atomic_Components (Entity (N))
or else Is_Atomic (Entity (N)))
then
return True;
elsif Nkind (N) = N_Selected_Component
and then Is_Atomic (Entity (Selector_Name (N)))
then
return True;
elsif Nkind (N) = N_Indexed_Component
or else Nkind (N) = N_Selected_Component
then
return Is_Atomic_Prefix (Prefix (N));
else
return False;
end if;
end Object_Has_Atomic_Components;
-- Start of processing for Is_Atomic_Object
begin
-- Predicate is not relevant to subprograms
if Is_Entity_Name (N) and then Is_Overloadable (Entity (N)) then
return False;
elsif Is_Atomic (Etype (N))
or else (Is_Entity_Name (N) and then Is_Atomic (Entity (N)))
then
return True;
elsif Nkind (N) = N_Selected_Component
and then Is_Atomic (Entity (Selector_Name (N)))
then
return True;
elsif Nkind (N) = N_Indexed_Component
or else Nkind (N) = N_Selected_Component
then
return Is_Atomic_Prefix (Prefix (N));
else
return False;
end if;
end Is_Atomic_Object;
-----------------------------
-- Is_Atomic_Or_VFA_Object --
-----------------------------
function Is_Atomic_Or_VFA_Object (N : Node_Id) return Boolean is
begin
return Is_Atomic_Object (N)
or else (Is_Object_Reference (N)
and then Is_Entity_Name (N)
and then (Is_Volatile_Full_Access (Entity (N))
or else
Is_Volatile_Full_Access (Etype (Entity (N)))));
end Is_Atomic_Or_VFA_Object;
-------------------------
-- Is_Attribute_Result --
-------------------------
function Is_Attribute_Result (N : Node_Id) return Boolean is
begin
return Nkind (N) = N_Attribute_Reference
and then Attribute_Name (N) = Name_Result;
end Is_Attribute_Result;
-------------------------
-- Is_Attribute_Update --
-------------------------
function Is_Attribute_Update (N : Node_Id) return Boolean is
begin
return Nkind (N) = N_Attribute_Reference
and then Attribute_Name (N) = Name_Update;
end Is_Attribute_Update;
------------------------------------
-- Is_Body_Or_Package_Declaration --
------------------------------------
function Is_Body_Or_Package_Declaration (N : Node_Id) return Boolean is
begin
return Nkind_In (N, N_Entry_Body,
N_Package_Body,
N_Package_Declaration,
N_Protected_Body,
N_Subprogram_Body,
N_Task_Body);
end Is_Body_Or_Package_Declaration;
-----------------------
-- Is_Bounded_String --
-----------------------
function Is_Bounded_String (T : Entity_Id) return Boolean is
Under : constant Entity_Id := Underlying_Type (Root_Type (T));
begin
-- Check whether T is ultimately derived from Ada.Strings.Superbounded.
-- Super_String, or one of the [Wide_]Wide_ versions. This will
-- be True for all the Bounded_String types in instances of the
-- Generic_Bounded_Length generics, and for types derived from those.
return Present (Under)
and then (Is_RTE (Root_Type (Under), RO_SU_Super_String) or else
Is_RTE (Root_Type (Under), RO_WI_Super_String) or else
Is_RTE (Root_Type (Under), RO_WW_Super_String));
end Is_Bounded_String;
-------------------------
-- Is_Child_Or_Sibling --
-------------------------
function Is_Child_Or_Sibling
(Pack_1 : Entity_Id;
Pack_2 : Entity_Id) return Boolean
is
function Distance_From_Standard (Pack : Entity_Id) return Nat;
-- Given an arbitrary package, return the number of "climbs" necessary
-- to reach scope Standard_Standard.
procedure Equalize_Depths
(Pack : in out Entity_Id;
Depth : in out Nat;
Depth_To_Reach : Nat);
-- Given an arbitrary package, its depth and a target depth to reach,
-- climb the scope chain until the said depth is reached. The pointer
-- to the package and its depth a modified during the climb.
----------------------------
-- Distance_From_Standard --
----------------------------
function Distance_From_Standard (Pack : Entity_Id) return Nat is
Dist : Nat;
Scop : Entity_Id;
begin
Dist := 0;
Scop := Pack;
while Present (Scop) and then Scop /= Standard_Standard loop
Dist := Dist + 1;
Scop := Scope (Scop);
end loop;
return Dist;
end Distance_From_Standard;
---------------------
-- Equalize_Depths --
---------------------
procedure Equalize_Depths
(Pack : in out Entity_Id;
Depth : in out Nat;
Depth_To_Reach : Nat)
is
begin
-- The package must be at a greater or equal depth
if Depth < Depth_To_Reach then
raise Program_Error;
end if;
-- Climb the scope chain until the desired depth is reached
while Present (Pack) and then Depth /= Depth_To_Reach loop
Pack := Scope (Pack);
Depth := Depth - 1;
end loop;
end Equalize_Depths;
-- Local variables
P_1 : Entity_Id := Pack_1;
P_1_Child : Boolean := False;
P_1_Depth : Nat := Distance_From_Standard (P_1);
P_2 : Entity_Id := Pack_2;
P_2_Child : Boolean := False;
P_2_Depth : Nat := Distance_From_Standard (P_2);
-- Start of processing for Is_Child_Or_Sibling
begin
pragma Assert
(Ekind (Pack_1) = E_Package and then Ekind (Pack_2) = E_Package);
-- Both packages denote the same entity, therefore they cannot be
-- children or siblings.
if P_1 = P_2 then
return False;
-- One of the packages is at a deeper level than the other. Note that
-- both may still come from differen hierarchies.
-- (root) P_2
-- / \ :
-- X P_2 or X
-- : :
-- P_1 P_1
elsif P_1_Depth > P_2_Depth then
Equalize_Depths
(Pack => P_1,
Depth => P_1_Depth,
Depth_To_Reach => P_2_Depth);
P_1_Child := True;
-- (root) P_1
-- / \ :
-- P_1 X or X
-- : :
-- P_2 P_2
elsif P_2_Depth > P_1_Depth then
Equalize_Depths
(Pack => P_2,
Depth => P_2_Depth,
Depth_To_Reach => P_1_Depth);
P_2_Child := True;
end if;
-- At this stage the package pointers have been elevated to the same
-- depth. If the related entities are the same, then one package is a
-- potential child of the other:
-- P_1
-- :
-- X became P_1 P_2 or vica versa
-- :
-- P_2
if P_1 = P_2 then
if P_1_Child then
return Is_Child_Unit (Pack_1);
else pragma Assert (P_2_Child);
return Is_Child_Unit (Pack_2);
end if;
-- The packages may come from the same package chain or from entirely
-- different hierarcies. To determine this, climb the scope stack until
-- a common root is found.
-- (root) (root 1) (root 2)
-- / \ | |
-- P_1 P_2 P_1 P_2
else
while Present (P_1) and then Present (P_2) loop
-- The two packages may be siblings
if P_1 = P_2 then
return Is_Child_Unit (Pack_1) and then Is_Child_Unit (Pack_2);
end if;
P_1 := Scope (P_1);
P_2 := Scope (P_2);
end loop;
end if;
return False;
end Is_Child_Or_Sibling;
-----------------------------
-- Is_Concurrent_Interface --
-----------------------------
function Is_Concurrent_Interface (T : Entity_Id) return Boolean is
begin
return Is_Interface (T)
and then
(Is_Protected_Interface (T)
or else Is_Synchronized_Interface (T)
or else Is_Task_Interface (T));
end Is_Concurrent_Interface;
-----------------------
-- Is_Constant_Bound --
-----------------------
function Is_Constant_Bound (Exp : Node_Id) return Boolean is
begin
if Compile_Time_Known_Value (Exp) then
return True;
elsif Is_Entity_Name (Exp) and then Present (Entity (Exp)) then
return Is_Constant_Object (Entity (Exp))
or else Ekind (Entity (Exp)) = E_Enumeration_Literal;
elsif Nkind (Exp) in N_Binary_Op then
return Is_Constant_Bound (Left_Opnd (Exp))
and then Is_Constant_Bound (Right_Opnd (Exp))
and then Scope (Entity (Exp)) = Standard_Standard;
else
return False;
end if;
end Is_Constant_Bound;
---------------------------
-- Is_Container_Element --
---------------------------
function Is_Container_Element (Exp : Node_Id) return Boolean is
Loc : constant Source_Ptr := Sloc (Exp);
Pref : constant Node_Id := Prefix (Exp);
Call : Node_Id;
-- Call to an indexing aspect
Cont_Typ : Entity_Id;
-- The type of the container being accessed
Elem_Typ : Entity_Id;
-- Its element type
Indexing : Entity_Id;
Is_Const : Boolean;
-- Indicates that constant indexing is used, and the element is thus
-- a constant.
Ref_Typ : Entity_Id;
-- The reference type returned by the indexing operation
begin
-- If C is a container, in a context that imposes the element type of
-- that container, the indexing notation C (X) is rewritten as:
-- Indexing (C, X).Discr.all
-- where Indexing is one of the indexing aspects of the container.
-- If the context does not require a reference, the construct can be
-- rewritten as
-- Element (C, X)
-- First, verify that the construct has the proper form
if not Expander_Active then
return False;
elsif Nkind (Pref) /= N_Selected_Component then
return False;
elsif Nkind (Prefix (Pref)) /= N_Function_Call then
return False;
else
Call := Prefix (Pref);
Ref_Typ := Etype (Call);
end if;
if not Has_Implicit_Dereference (Ref_Typ)
or else No (First (Parameter_Associations (Call)))
or else not Is_Entity_Name (Name (Call))
then
return False;
end if;
-- Retrieve type of container object, and its iterator aspects
Cont_Typ := Etype (First (Parameter_Associations (Call)));
Indexing := Find_Value_Of_Aspect (Cont_Typ, Aspect_Constant_Indexing);
Is_Const := False;
if No (Indexing) then
-- Container should have at least one indexing operation
return False;
elsif Entity (Name (Call)) /= Entity (Indexing) then
-- This may be a variable indexing operation
Indexing := Find_Value_Of_Aspect (Cont_Typ, Aspect_Variable_Indexing);
if No (Indexing)
or else Entity (Name (Call)) /= Entity (Indexing)
then
return False;
end if;
else
Is_Const := True;
end if;
Elem_Typ := Find_Value_Of_Aspect (Cont_Typ, Aspect_Iterator_Element);
if No (Elem_Typ) or else Entity (Elem_Typ) /= Etype (Exp) then
return False;
end if;
-- Check that the expression is not the target of an assignment, in
-- which case the rewriting is not possible.
if not Is_Const then
declare
Par : Node_Id;
begin
Par := Exp;
while Present (Par)
loop
if Nkind (Parent (Par)) = N_Assignment_Statement
and then Par = Name (Parent (Par))
then
return False;
-- A renaming produces a reference, and the transformation
-- does not apply.
elsif Nkind (Parent (Par)) = N_Object_Renaming_Declaration then
return False;
elsif Nkind_In
(Nkind (Parent (Par)), N_Function_Call,
N_Procedure_Call_Statement,
N_Entry_Call_Statement)
then
-- Check that the element is not part of an actual for an
-- in-out parameter.
declare
F : Entity_Id;
A : Node_Id;
begin
F := First_Formal (Entity (Name (Parent (Par))));
A := First (Parameter_Associations (Parent (Par)));
while Present (F) loop
if A = Par and then Ekind (F) /= E_In_Parameter then
return False;
end if;
Next_Formal (F);
Next (A);
end loop;
end;
-- E_In_Parameter in a call: element is not modified.
exit;
end if;
Par := Parent (Par);
end loop;
end;
end if;
-- The expression has the proper form and the context requires the
-- element type. Retrieve the Element function of the container and
-- rewrite the construct as a call to it.
declare
Op : Elmt_Id;
begin
Op := First_Elmt (Primitive_Operations (Cont_Typ));
while Present (Op) loop
exit when Chars (Node (Op)) = Name_Element;
Next_Elmt (Op);
end loop;
if No (Op) then
return False;
else
Rewrite (Exp,
Make_Function_Call (Loc,
Name => New_Occurrence_Of (Node (Op), Loc),
Parameter_Associations => Parameter_Associations (Call)));
Analyze_And_Resolve (Exp, Entity (Elem_Typ));
return True;
end if;
end;
end Is_Container_Element;
----------------------------
-- Is_Contract_Annotation --
----------------------------
function Is_Contract_Annotation (Item : Node_Id) return Boolean is
begin
return Is_Package_Contract_Annotation (Item)
or else
Is_Subprogram_Contract_Annotation (Item);
end Is_Contract_Annotation;
--------------------------------------
-- Is_Controlling_Limited_Procedure --
--------------------------------------
function Is_Controlling_Limited_Procedure
(Proc_Nam : Entity_Id) return Boolean
is
Param_Typ : Entity_Id := Empty;
begin
if Ekind (Proc_Nam) = E_Procedure
and then Present (Parameter_Specifications (Parent (Proc_Nam)))
then
Param_Typ := Etype (Parameter_Type (First (
Parameter_Specifications (Parent (Proc_Nam)))));
-- In this case where an Itype was created, the procedure call has been
-- rewritten.
elsif Present (Associated_Node_For_Itype (Proc_Nam))
and then Present (Original_Node (Associated_Node_For_Itype (Proc_Nam)))
and then
Present (Parameter_Associations
(Associated_Node_For_Itype (Proc_Nam)))
then
Param_Typ :=
Etype (First (Parameter_Associations
(Associated_Node_For_Itype (Proc_Nam))));
end if;
if Present (Param_Typ) then
return
Is_Interface (Param_Typ)
and then Is_Limited_Record (Param_Typ);
end if;
return False;
end Is_Controlling_Limited_Procedure;
-----------------------------
-- Is_CPP_Constructor_Call --
-----------------------------
function Is_CPP_Constructor_Call (N : Node_Id) return Boolean is
begin
return Nkind (N) = N_Function_Call
and then Is_CPP_Class (Etype (Etype (N)))
and then Is_Constructor (Entity (Name (N)))
and then Is_Imported (Entity (Name (N)));
end Is_CPP_Constructor_Call;
-------------------------
-- Is_Current_Instance --
-------------------------
function Is_Current_Instance (N : Node_Id) return Boolean is
Typ : constant Entity_Id := Entity (N);
P : Node_Id;
begin
-- Simplest case: entity is a concurrent type and we are currently
-- inside the body. This will eventually be expanded into a
-- call to Self (for tasks) or _object (for protected objects).
if Is_Concurrent_Type (Typ) and then In_Open_Scopes (Typ) then
return True;
else
-- Check whether the context is a (sub)type declaration for the
-- type entity.
P := Parent (N);
while Present (P) loop
if Nkind_In (P, N_Full_Type_Declaration,
N_Private_Type_Declaration,
N_Subtype_Declaration)
and then Comes_From_Source (P)
and then Defining_Entity (P) = Typ
then
return True;
-- A subtype name may appear in an aspect specification for a
-- Predicate_Failure aspect, for which we do not construct a
-- wrapper procedure. The subtype will be replaced by the
-- expression being tested when the corresponding predicate
-- check is expanded.
elsif Nkind (P) = N_Aspect_Specification
and then Nkind (Parent (P)) = N_Subtype_Declaration
then
return True;
elsif Nkind (P) = N_Pragma
and then
Get_Pragma_Id (P) = Pragma_Predicate_Failure
then
return True;
end if;
P := Parent (P);
end loop;
end if;
-- In any other context this is not a current occurrence
return False;
end Is_Current_Instance;
--------------------
-- Is_Declaration --
--------------------
function Is_Declaration (N : Node_Id) return Boolean is
begin
return
Is_Declaration_Other_Than_Renaming (N)
or else Is_Renaming_Declaration (N);
end Is_Declaration;
----------------------------------------
-- Is_Declaration_Other_Than_Renaming --
----------------------------------------
function Is_Declaration_Other_Than_Renaming (N : Node_Id) return Boolean is
begin
case Nkind (N) is
when N_Abstract_Subprogram_Declaration
| N_Exception_Declaration
| N_Expression_Function
| N_Full_Type_Declaration
| N_Generic_Package_Declaration
| N_Generic_Subprogram_Declaration
| N_Number_Declaration
| N_Object_Declaration
| N_Package_Declaration
| N_Private_Extension_Declaration
| N_Private_Type_Declaration
| N_Subprogram_Declaration
| N_Subtype_Declaration
=>
return True;
when others =>
return False;
end case;
end Is_Declaration_Other_Than_Renaming;
--------------------------------
-- Is_Declared_Within_Variant --
--------------------------------
function Is_Declared_Within_Variant (Comp : Entity_Id) return Boolean is
Comp_Decl : constant Node_Id := Parent (Comp);
Comp_List : constant Node_Id := Parent (Comp_Decl);
begin
return Nkind (Parent (Comp_List)) = N_Variant;
end Is_Declared_Within_Variant;
----------------------------------------------
-- Is_Dependent_Component_Of_Mutable_Object --
----------------------------------------------
function Is_Dependent_Component_Of_Mutable_Object
(Object : Node_Id) return Boolean
is
P : Node_Id;
Prefix_Type : Entity_Id;
P_Aliased : Boolean := False;
Comp : Entity_Id;
Deref : Node_Id := Object;
-- Dereference node, in something like X.all.Y(2)
-- Start of processing for Is_Dependent_Component_Of_Mutable_Object
begin
-- Find the dereference node if any
while Nkind_In (Deref, N_Indexed_Component,
N_Selected_Component,
N_Slice)
loop
Deref := Prefix (Deref);
end loop;
-- Ada 2005: If we have a component or slice of a dereference,
-- something like X.all.Y (2), and the type of X is access-to-constant,
-- Is_Variable will return False, because it is indeed a constant
-- view. But it might be a view of a variable object, so we want the
-- following condition to be True in that case.
if Is_Variable (Object)
or else (Ada_Version >= Ada_2005
and then Nkind (Deref) = N_Explicit_Dereference)
then
if Nkind (Object) = N_Selected_Component then
P := Prefix (Object);
Prefix_Type := Etype (P);
if Is_Entity_Name (P) then
if Ekind (Entity (P)) = E_Generic_In_Out_Parameter then
Prefix_Type := Base_Type (Prefix_Type);
end if;
if Is_Aliased (Entity (P)) then
P_Aliased := True;
end if;
-- A discriminant check on a selected component may be expanded
-- into a dereference when removing side-effects. Recover the
-- original node and its type, which may be unconstrained.
elsif Nkind (P) = N_Explicit_Dereference
and then not (Comes_From_Source (P))
then
P := Original_Node (P);
Prefix_Type := Etype (P);
else
-- Check for prefix being an aliased component???
null;
end if;
-- A heap object is constrained by its initial value
-- Ada 2005 (AI-363): Always assume the object could be mutable in
-- the dereferenced case, since the access value might denote an
-- unconstrained aliased object, whereas in Ada 95 the designated
-- object is guaranteed to be constrained. A worst-case assumption
-- has to apply in Ada 2005 because we can't tell at compile
-- time whether the object is "constrained by its initial value"
-- (despite the fact that 3.10.2(26/2) and 8.5.1(5/2) are semantic
-- rules (these rules are acknowledged to need fixing).
if Ada_Version < Ada_2005 then
if Is_Access_Type (Prefix_Type)
or else Nkind (P) = N_Explicit_Dereference
then
return False;
end if;
else pragma Assert (Ada_Version >= Ada_2005);
if Is_Access_Type (Prefix_Type) then
-- If the access type is pool-specific, and there is no
-- constrained partial view of the designated type, then the
-- designated object is known to be constrained.
if Ekind (Prefix_Type) = E_Access_Type
and then not Object_Type_Has_Constrained_Partial_View
(Typ => Designated_Type (Prefix_Type),
Scop => Current_Scope)
then
return False;
-- Otherwise (general access type, or there is a constrained
-- partial view of the designated type), we need to check
-- based on the designated type.
else
Prefix_Type := Designated_Type (Prefix_Type);
end if;
end if;
end if;
Comp :=
Original_Record_Component (Entity (Selector_Name (Object)));
-- As per AI-0017, the renaming is illegal in a generic body, even
-- if the subtype is indefinite.
-- Ada 2005 (AI-363): In Ada 2005 an aliased object can be mutable
if not Is_Constrained (Prefix_Type)
and then (Is_Definite_Subtype (Prefix_Type)
or else
(Is_Generic_Type (Prefix_Type)
and then Ekind (Current_Scope) = E_Generic_Package
and then In_Package_Body (Current_Scope)))
and then (Is_Declared_Within_Variant (Comp)
or else Has_Discriminant_Dependent_Constraint (Comp))
and then (not P_Aliased or else Ada_Version >= Ada_2005)
then
return True;
-- If the prefix is of an access type at this point, then we want
-- to return False, rather than calling this function recursively
-- on the access object (which itself might be a discriminant-
-- dependent component of some other object, but that isn't
-- relevant to checking the object passed to us). This avoids
-- issuing wrong errors when compiling with -gnatc, where there
-- can be implicit dereferences that have not been expanded.
elsif Is_Access_Type (Etype (Prefix (Object))) then
return False;
else
return
Is_Dependent_Component_Of_Mutable_Object (Prefix (Object));
end if;
elsif Nkind (Object) = N_Indexed_Component
or else Nkind (Object) = N_Slice
then
return Is_Dependent_Component_Of_Mutable_Object (Prefix (Object));
-- A type conversion that Is_Variable is a view conversion:
-- go back to the denoted object.
elsif Nkind (Object) = N_Type_Conversion then
return
Is_Dependent_Component_Of_Mutable_Object (Expression (Object));
end if;
end if;
return False;
end Is_Dependent_Component_Of_Mutable_Object;
---------------------
-- Is_Dereferenced --
---------------------
function Is_Dereferenced (N : Node_Id) return Boolean is
P : constant Node_Id := Parent (N);
begin
return Nkind_In (P, N_Selected_Component,
N_Explicit_Dereference,
N_Indexed_Component,
N_Slice)
and then Prefix (P) = N;
end Is_Dereferenced;
----------------------
-- Is_Descendant_Of --
----------------------
function Is_Descendant_Of (T1 : Entity_Id; T2 : Entity_Id) return Boolean is
T : Entity_Id;
Etyp : Entity_Id;
begin
pragma Assert (Nkind (T1) in N_Entity);
pragma Assert (Nkind (T2) in N_Entity);
T := Base_Type (T1);
-- Immediate return if the types match
if T = T2 then
return True;
-- Comment needed here ???
elsif Ekind (T) = E_Class_Wide_Type then
return Etype (T) = T2;
-- All other cases
else
loop
Etyp := Etype (T);
-- Done if we found the type we are looking for
if Etyp = T2 then
return True;
-- Done if no more derivations to check
elsif T = T1
or else T = Etyp
then
return False;
-- Following test catches error cases resulting from prev errors
elsif No (Etyp) then
return False;
elsif Is_Private_Type (T) and then Etyp = Full_View (T) then
return False;
elsif Is_Private_Type (Etyp) and then Full_View (Etyp) = T then
return False;
end if;
T := Base_Type (Etyp);
end loop;
end if;
end Is_Descendant_Of;
----------------------------------------
-- Is_Descendant_Of_Suspension_Object --
----------------------------------------
function Is_Descendant_Of_Suspension_Object
(Typ : Entity_Id) return Boolean
is
Cur_Typ : Entity_Id;
Par_Typ : Entity_Id;
begin
-- Climb the type derivation chain checking each parent type against
-- Suspension_Object.
Cur_Typ := Base_Type (Typ);
while Present (Cur_Typ) loop
Par_Typ := Etype (Cur_Typ);
-- The current type is a match
if Is_Suspension_Object (Cur_Typ) then
return True;
-- Stop the traversal once the root of the derivation chain has been
-- reached. In that case the current type is its own base type.
elsif Cur_Typ = Par_Typ then
exit;
end if;
Cur_Typ := Base_Type (Par_Typ);
end loop;
return False;
end Is_Descendant_Of_Suspension_Object;
---------------------------------------------
-- Is_Double_Precision_Floating_Point_Type --
---------------------------------------------
function Is_Double_Precision_Floating_Point_Type
(E : Entity_Id) return Boolean is
begin
return Is_Floating_Point_Type (E)
and then Machine_Radix_Value (E) = Uint_2
and then Machine_Mantissa_Value (E) = UI_From_Int (53)
and then Machine_Emax_Value (E) = Uint_2 ** Uint_10
and then Machine_Emin_Value (E) = Uint_3 - (Uint_2 ** Uint_10);
end Is_Double_Precision_Floating_Point_Type;
-----------------------------
-- Is_Effectively_Volatile --
-----------------------------
function Is_Effectively_Volatile (Id : Entity_Id) return Boolean is
begin
if Is_Type (Id) then
-- An arbitrary type is effectively volatile when it is subject to
-- pragma Atomic or Volatile.
if Is_Volatile (Id) then
return True;
-- An array type is effectively volatile when it is subject to pragma
-- Atomic_Components or Volatile_Components or its component type is
-- effectively volatile.
elsif Is_Array_Type (Id) then
return
Has_Volatile_Components (Id)
or else
Is_Effectively_Volatile (Component_Type (Base_Type (Id)));
-- A protected type is always volatile
elsif Is_Protected_Type (Id) then
return True;
-- A descendant of Ada.Synchronous_Task_Control.Suspension_Object is
-- automatically volatile.
elsif Is_Descendant_Of_Suspension_Object (Id) then
return True;
-- Otherwise the type is not effectively volatile
else
return False;
end if;
-- Otherwise Id denotes an object
else
return
Is_Volatile (Id)
or else Has_Volatile_Components (Id)
or else Is_Effectively_Volatile (Etype (Id));
end if;
end Is_Effectively_Volatile;
------------------------------------
-- Is_Effectively_Volatile_Object --
------------------------------------
function Is_Effectively_Volatile_Object (N : Node_Id) return Boolean is
begin
if Is_Entity_Name (N) then
return Is_Effectively_Volatile (Entity (N));
elsif Nkind (N) = N_Indexed_Component then
return Is_Effectively_Volatile_Object (Prefix (N));
elsif Nkind (N) = N_Selected_Component then
return
Is_Effectively_Volatile_Object (Prefix (N))
or else
Is_Effectively_Volatile_Object (Selector_Name (N));
else
return False;
end if;
end Is_Effectively_Volatile_Object;
-------------------
-- Is_Entry_Body --
-------------------
function Is_Entry_Body (Id : Entity_Id) return Boolean is
begin
return
Ekind_In (Id, E_Entry, E_Entry_Family)
and then Nkind (Unit_Declaration_Node (Id)) = N_Entry_Body;
end Is_Entry_Body;
--------------------------
-- Is_Entry_Declaration --
--------------------------
function Is_Entry_Declaration (Id : Entity_Id) return Boolean is
begin
return
Ekind_In (Id, E_Entry, E_Entry_Family)
and then Nkind (Unit_Declaration_Node (Id)) = N_Entry_Declaration;
end Is_Entry_Declaration;
------------------------------------
-- Is_Expanded_Priority_Attribute --
------------------------------------
function Is_Expanded_Priority_Attribute (E : Entity_Id) return Boolean is
begin
return
Nkind (E) = N_Function_Call
and then not Configurable_Run_Time_Mode
and then (Entity (Name (E)) = RTE (RE_Get_Ceiling)
or else Entity (Name (E)) = RTE (RO_PE_Get_Ceiling));
end Is_Expanded_Priority_Attribute;
----------------------------
-- Is_Expression_Function --
----------------------------
function Is_Expression_Function (Subp : Entity_Id) return Boolean is
begin
if Ekind_In (Subp, E_Function, E_Subprogram_Body) then
return
Nkind (Original_Node (Unit_Declaration_Node (Subp))) =
N_Expression_Function;
else
return False;
end if;
end Is_Expression_Function;
------------------------------------------
-- Is_Expression_Function_Or_Completion --
------------------------------------------
function Is_Expression_Function_Or_Completion
(Subp : Entity_Id) return Boolean
is
Subp_Decl : Node_Id;
begin
if Ekind (Subp) = E_Function then
Subp_Decl := Unit_Declaration_Node (Subp);
-- The function declaration is either an expression function or is
-- completed by an expression function body.
return
Is_Expression_Function (Subp)
or else (Nkind (Subp_Decl) = N_Subprogram_Declaration
and then Present (Corresponding_Body (Subp_Decl))
and then Is_Expression_Function
(Corresponding_Body (Subp_Decl)));
elsif Ekind (Subp) = E_Subprogram_Body then
return Is_Expression_Function (Subp);
else
return False;
end if;
end Is_Expression_Function_Or_Completion;
-----------------------
-- Is_EVF_Expression --
-----------------------
function Is_EVF_Expression (N : Node_Id) return Boolean is
Orig_N : constant Node_Id := Original_Node (N);
Alt : Node_Id;
Expr : Node_Id;
Id : Entity_Id;
begin
-- Detect a reference to a formal parameter of a specific tagged type
-- whose related subprogram is subject to pragma Expresions_Visible with
-- value "False".
if Is_Entity_Name (N) and then Present (Entity (N)) then
Id := Entity (N);
return
Is_Formal (Id)
and then Is_Specific_Tagged_Type (Etype (Id))
and then Extensions_Visible_Status (Id) =
Extensions_Visible_False;
-- A case expression is an EVF expression when it contains at least one
-- EVF dependent_expression. Note that a case expression may have been
-- expanded, hence the use of Original_Node.
elsif Nkind (Orig_N) = N_Case_Expression then
Alt := First (Alternatives (Orig_N));
while Present (Alt) loop
if Is_EVF_Expression (Expression (Alt)) then
return True;
end if;
Next (Alt);
end loop;
-- An if expression is an EVF expression when it contains at least one
-- EVF dependent_expression. Note that an if expression may have been
-- expanded, hence the use of Original_Node.
elsif Nkind (Orig_N) = N_If_Expression then
Expr := Next (First (Expressions (Orig_N)));
while Present (Expr) loop
if Is_EVF_Expression (Expr) then
return True;
end if;
Next (Expr);
end loop;
-- A qualified expression or a type conversion is an EVF expression when
-- its operand is an EVF expression.
elsif Nkind_In (N, N_Qualified_Expression,
N_Unchecked_Type_Conversion,
N_Type_Conversion)
then
return Is_EVF_Expression (Expression (N));
-- Attributes 'Loop_Entry, 'Old, and 'Update are EVF expressions when
-- their prefix denotes an EVF expression.
elsif Nkind (N) = N_Attribute_Reference
and then Nam_In (Attribute_Name (N), Name_Loop_Entry,
Name_Old,
Name_Update)
then
return Is_EVF_Expression (Prefix (N));
end if;
return False;
end Is_EVF_Expression;
--------------
-- Is_False --
--------------
function Is_False (U : Uint) return Boolean is
begin
return (U = 0);
end Is_False;
---------------------------
-- Is_Fixed_Model_Number --
---------------------------
function Is_Fixed_Model_Number (U : Ureal; T : Entity_Id) return Boolean is
S : constant Ureal := Small_Value (T);
M : Urealp.Save_Mark;
R : Boolean;
begin
M := Urealp.Mark;
R := (U = UR_Trunc (U / S) * S);
Urealp.Release (M);
return R;
end Is_Fixed_Model_Number;
-------------------------------
-- Is_Fully_Initialized_Type --
-------------------------------
function Is_Fully_Initialized_Type (Typ : Entity_Id) return Boolean is
begin
-- Scalar types
if Is_Scalar_Type (Typ) then
-- A scalar type with an aspect Default_Value is fully initialized
-- Note: Iniitalize/Normalize_Scalars also ensure full initialization
-- of a scalar type, but we don't take that into account here, since
-- we don't want these to affect warnings.
return Has_Default_Aspect (Typ);
elsif Is_Access_Type (Typ) then
return True;
elsif Is_Array_Type (Typ) then
if Is_Fully_Initialized_Type (Component_Type (Typ))
or else (Ada_Version >= Ada_2012 and then Has_Default_Aspect (Typ))
then
return True;
end if;
-- An interesting case, if we have a constrained type one of whose
-- bounds is known to be null, then there are no elements to be
-- initialized, so all the elements are initialized.
if Is_Constrained (Typ) then
declare
Indx : Node_Id;
Indx_Typ : Entity_Id;
Lbd, Hbd : Node_Id;
begin
Indx := First_Index (Typ);
while Present (Indx) loop
if Etype (Indx) = Any_Type then
return False;
-- If index is a range, use directly
elsif Nkind (Indx) = N_Range then
Lbd := Low_Bound (Indx);
Hbd := High_Bound (Indx);
else
Indx_Typ := Etype (Indx);
if Is_Private_Type (Indx_Typ) then
Indx_Typ := Full_View (Indx_Typ);
end if;
if No (Indx_Typ) or else Etype (Indx_Typ) = Any_Type then
return False;
else
Lbd := Type_Low_Bound (Indx_Typ);
Hbd := Type_High_Bound (Indx_Typ);
end if;
end if;
if Compile_Time_Known_Value (Lbd)
and then
Compile_Time_Known_Value (Hbd)
then
if Expr_Value (Hbd) < Expr_Value (Lbd) then
return True;
end if;
end if;
Next_Index (Indx);
end loop;
end;
end if;
-- If no null indexes, then type is not fully initialized
return False;
-- Record types
elsif Is_Record_Type (Typ) then
if Has_Discriminants (Typ)
and then
Present (Discriminant_Default_Value (First_Discriminant (Typ)))
and then Is_Fully_Initialized_Variant (Typ)
then
return True;
end if;
-- We consider bounded string types to be fully initialized, because
-- otherwise we get false alarms when the Data component is not
-- default-initialized.
if Is_Bounded_String (Typ) then
return True;
end if;
-- Controlled records are considered to be fully initialized if
-- there is a user defined Initialize routine. This may not be
-- entirely correct, but as the spec notes, we are guessing here
-- what is best from the point of view of issuing warnings.
if Is_Controlled (Typ) then
declare
Utyp : constant Entity_Id := Underlying_Type (Typ);
begin
if Present (Utyp) then
declare
Init : constant Entity_Id :=
(Find_Optional_Prim_Op
(Underlying_Type (Typ), Name_Initialize));
begin
if Present (Init)
and then Comes_From_Source (Init)
and then not
Is_Predefined_File_Name
(File_Name (Get_Source_File_Index (Sloc (Init))))
then
return True;
elsif Has_Null_Extension (Typ)
and then
Is_Fully_Initialized_Type
(Etype (Base_Type (Typ)))
then
return True;
end if;
end;
end if;
end;
end if;
-- Otherwise see if all record components are initialized
declare
Ent : Entity_Id;
begin
Ent := First_Entity (Typ);
while Present (Ent) loop
if Ekind (Ent) = E_Component
and then (No (Parent (Ent))
or else No (Expression (Parent (Ent))))
and then not Is_Fully_Initialized_Type (Etype (Ent))
-- Special VM case for tag components, which need to be
-- defined in this case, but are never initialized as VMs
-- are using other dispatching mechanisms. Ignore this
-- uninitialized case. Note that this applies both to the
-- uTag entry and the main vtable pointer (CPP_Class case).
and then (Tagged_Type_Expansion or else not Is_Tag (Ent))
then
return False;
end if;
Next_Entity (Ent);
end loop;
end;
-- No uninitialized components, so type is fully initialized.
-- Note that this catches the case of no components as well.
return True;
elsif Is_Concurrent_Type (Typ) then
return True;
elsif Is_Private_Type (Typ) then
declare
U : constant Entity_Id := Underlying_Type (Typ);
begin
if No (U) then
return False;
else
return Is_Fully_Initialized_Type (U);
end if;
end;
else
return False;
end if;
end Is_Fully_Initialized_Type;
----------------------------------
-- Is_Fully_Initialized_Variant --
----------------------------------
function Is_Fully_Initialized_Variant (Typ : Entity_Id) return Boolean is
Loc : constant Source_Ptr := Sloc (Typ);
Constraints : constant List_Id := New_List;
Components : constant Elist_Id := New_Elmt_List;
Comp_Elmt : Elmt_Id;
Comp_Id : Node_Id;
Comp_List : Node_Id;
Discr : Entity_Id;
Discr_Val : Node_Id;
Report_Errors : Boolean;
pragma Warnings (Off, Report_Errors);
begin
if Serious_Errors_Detected > 0 then
return False;
end if;
if Is_Record_Type (Typ)
and then Nkind (Parent (Typ)) = N_Full_Type_Declaration
and then Nkind (Type_Definition (Parent (Typ))) = N_Record_Definition
then
Comp_List := Component_List (Type_Definition (Parent (Typ)));
Discr := First_Discriminant (Typ);
while Present (Discr) loop
if Nkind (Parent (Discr)) = N_Discriminant_Specification then
Discr_Val := Expression (Parent (Discr));
if Present (Discr_Val)
and then Is_OK_Static_Expression (Discr_Val)
then
Append_To (Constraints,
Make_Component_Association (Loc,
Choices => New_List (New_Occurrence_Of (Discr, Loc)),
Expression => New_Copy (Discr_Val)));
else
return False;
end if;
else
return False;
end if;
Next_Discriminant (Discr);
end loop;
Gather_Components
(Typ => Typ,
Comp_List => Comp_List,
Governed_By => Constraints,
Into => Components,
Report_Errors => Report_Errors);
-- Check that each component present is fully initialized
Comp_Elmt := First_Elmt (Components);
while Present (Comp_Elmt) loop
Comp_Id := Node (Comp_Elmt);
if Ekind (Comp_Id) = E_Component
and then (No (Parent (Comp_Id))
or else No (Expression (Parent (Comp_Id))))
and then not Is_Fully_Initialized_Type (Etype (Comp_Id))
then
return False;
end if;
Next_Elmt (Comp_Elmt);
end loop;
return True;
elsif Is_Private_Type (Typ) then
declare
U : constant Entity_Id := Underlying_Type (Typ);
begin
if No (U) then
return False;
else
return Is_Fully_Initialized_Variant (U);
end if;
end;
else
return False;
end if;
end Is_Fully_Initialized_Variant;
------------------------------------
-- Is_Generic_Declaration_Or_Body --
------------------------------------
function Is_Generic_Declaration_Or_Body (Decl : Node_Id) return Boolean is
Spec_Decl : Node_Id;
begin
-- Package/subprogram body
if Nkind_In (Decl, N_Package_Body, N_Subprogram_Body)
and then Present (Corresponding_Spec (Decl))
then
Spec_Decl := Unit_Declaration_Node (Corresponding_Spec (Decl));
-- Package/subprogram body stub
elsif Nkind_In (Decl, N_Package_Body_Stub, N_Subprogram_Body_Stub)
and then Present (Corresponding_Spec_Of_Stub (Decl))
then
Spec_Decl :=
Unit_Declaration_Node (Corresponding_Spec_Of_Stub (Decl));
-- All other cases
else
Spec_Decl := Decl;
end if;
-- Rather than inspecting the defining entity of the spec declaration,
-- look at its Nkind. This takes care of the case where the analysis of
-- a generic body modifies the Ekind of its spec to allow for recursive
-- calls.
return
Nkind_In (Spec_Decl, N_Generic_Package_Declaration,
N_Generic_Subprogram_Declaration);
end Is_Generic_Declaration_Or_Body;
----------------------------
-- Is_Inherited_Operation --
----------------------------
function Is_Inherited_Operation (E : Entity_Id) return Boolean is
pragma Assert (Is_Overloadable (E));
Kind : constant Node_Kind := Nkind (Parent (E));
begin
return Kind = N_Full_Type_Declaration
or else Kind = N_Private_Extension_Declaration
or else Kind = N_Subtype_Declaration
or else (Ekind (E) = E_Enumeration_Literal
and then Is_Derived_Type (Etype (E)));
end Is_Inherited_Operation;
-------------------------------------
-- Is_Inherited_Operation_For_Type --
-------------------------------------
function Is_Inherited_Operation_For_Type
(E : Entity_Id;
Typ : Entity_Id) return Boolean
is
begin
-- Check that the operation has been created by the type declaration
return Is_Inherited_Operation (E)
and then Defining_Identifier (Parent (E)) = Typ;
end Is_Inherited_Operation_For_Type;
--------------------------------------
-- Is_Inlinable_Expression_Function --
--------------------------------------
function Is_Inlinable_Expression_Function
(Subp : Entity_Id) return Boolean
is
Return_Expr : Node_Id;
begin
if Is_Expression_Function_Or_Completion (Subp)
and then Has_Pragma_Inline_Always (Subp)
and then Needs_No_Actuals (Subp)
and then No (Contract (Subp))
and then not Is_Dispatching_Operation (Subp)
and then Needs_Finalization (Etype (Subp))
and then not Is_Class_Wide_Type (Etype (Subp))
and then not (Has_Invariants (Etype (Subp)))
and then Present (Subprogram_Body (Subp))
and then Was_Expression_Function (Subprogram_Body (Subp))
then
Return_Expr := Expression_Of_Expression_Function (Subp);
-- The returned object must not have a qualified expression and its
-- nominal subtype must be statically compatible with the result
-- subtype of the expression function.
return
Nkind (Return_Expr) = N_Identifier
and then Etype (Return_Expr) = Etype (Subp);
end if;
return False;
end Is_Inlinable_Expression_Function;
-----------------
-- Is_Iterator --
-----------------
function Is_Iterator (Typ : Entity_Id) return Boolean is
function Denotes_Iterator (Iter_Typ : Entity_Id) return Boolean;
-- Determine whether type Iter_Typ is a predefined forward or reversible
-- iterator.
----------------------
-- Denotes_Iterator --
----------------------
function Denotes_Iterator (Iter_Typ : Entity_Id) return Boolean is
begin
-- Check that the name matches, and that the ultimate ancestor is in
-- a predefined unit, i.e the one that declares iterator interfaces.
return
Nam_In (Chars (Iter_Typ), Name_Forward_Iterator,
Name_Reversible_Iterator)
and then Is_Predefined_File_Name
(Unit_File_Name (Get_Source_Unit (Root_Type (Iter_Typ))));
end Denotes_Iterator;
-- Local variables
Iface_Elmt : Elmt_Id;
Ifaces : Elist_Id;
-- Start of processing for Is_Iterator
begin
-- The type may be a subtype of a descendant of the proper instance of
-- the predefined interface type, so we must use the root type of the
-- given type. The same is done for Is_Reversible_Iterator.
if Is_Class_Wide_Type (Typ)
and then Denotes_Iterator (Root_Type (Typ))
then
return True;
elsif not Is_Tagged_Type (Typ) or else not Is_Derived_Type (Typ) then
return False;
elsif Present (Find_Value_Of_Aspect (Typ, Aspect_Iterable)) then
return True;
else
Collect_Interfaces (Typ, Ifaces);
Iface_Elmt := First_Elmt (Ifaces);
while Present (Iface_Elmt) loop
if Denotes_Iterator (Node (Iface_Elmt)) then
return True;
end if;
Next_Elmt (Iface_Elmt);
end loop;
return False;
end if;
end Is_Iterator;
----------------------------
-- Is_Iterator_Over_Array --
----------------------------
function Is_Iterator_Over_Array (N : Node_Id) return Boolean is
Container : constant Node_Id := Name (N);
Container_Typ : constant Entity_Id := Base_Type (Etype (Container));
begin
return Is_Array_Type (Container_Typ);
end Is_Iterator_Over_Array;
------------
-- Is_LHS --
------------
-- We seem to have a lot of overlapping functions that do similar things
-- (testing for left hand sides or lvalues???).
function Is_LHS (N : Node_Id) return Is_LHS_Result is
P : constant Node_Id := Parent (N);
begin
-- Return True if we are the left hand side of an assignment statement
if Nkind (P) = N_Assignment_Statement then
if Name (P) = N then
return Yes;
else
return No;
end if;
-- Case of prefix of indexed or selected component or slice
elsif Nkind_In (P, N_Indexed_Component, N_Selected_Component, N_Slice)
and then N = Prefix (P)
then
-- Here we have the case where the parent P is N.Q or N(Q .. R).
-- If P is an LHS, then N is also effectively an LHS, but there
-- is an important exception. If N is of an access type, then
-- what we really have is N.all.Q (or N.all(Q .. R)). In either
-- case this makes N.all a left hand side but not N itself.
-- If we don't know the type yet, this is the case where we return
-- Unknown, since the answer depends on the type which is unknown.
if No (Etype (N)) then
return Unknown;
-- We have an Etype set, so we can check it
elsif Is_Access_Type (Etype (N)) then
return No;
-- OK, not access type case, so just test whole expression
else
return Is_LHS (P);
end if;
-- All other cases are not left hand sides
else
return No;
end if;
end Is_LHS;
-----------------------------
-- Is_Library_Level_Entity --
-----------------------------
function Is_Library_Level_Entity (E : Entity_Id) return Boolean is
begin
-- The following is a small optimization, and it also properly handles
-- discriminals, which in task bodies might appear in expressions before
-- the corresponding procedure has been created, and which therefore do
-- not have an assigned scope.
if Is_Formal (E) then
return False;
end if;
-- Normal test is simply that the enclosing dynamic scope is Standard
return Enclosing_Dynamic_Scope (E) = Standard_Standard;
end Is_Library_Level_Entity;
--------------------------------
-- Is_Limited_Class_Wide_Type --
--------------------------------
function Is_Limited_Class_Wide_Type (Typ : Entity_Id) return Boolean is
begin
return
Is_Class_Wide_Type (Typ)
and then (Is_Limited_Type (Typ) or else From_Limited_With (Typ));
end Is_Limited_Class_Wide_Type;
---------------------------------
-- Is_Local_Variable_Reference --
---------------------------------
function Is_Local_Variable_Reference (Expr : Node_Id) return Boolean is
begin
if not Is_Entity_Name (Expr) then
return False;
else
declare
Ent : constant Entity_Id := Entity (Expr);
Sub : constant Entity_Id := Enclosing_Subprogram (Ent);
begin
if not Ekind_In (Ent, E_Variable, E_In_Out_Parameter) then
return False;
else
return Present (Sub) and then Sub = Current_Subprogram;
end if;
end;
end if;
end Is_Local_Variable_Reference;
-----------------------
-- Is_Name_Reference --
-----------------------
function Is_Name_Reference (N : Node_Id) return Boolean is
begin
if Is_Entity_Name (N) then
return Present (Entity (N)) and then Is_Object (Entity (N));
end if;
case Nkind (N) is
when N_Indexed_Component
| N_Slice
=>
return
Is_Name_Reference (Prefix (N))
or else Is_Access_Type (Etype (Prefix (N)));
-- Attributes 'Input, 'Old and 'Result produce objects
when N_Attribute_Reference =>
return
Nam_In (Attribute_Name (N), Name_Input, Name_Old, Name_Result);
when N_Selected_Component =>
return
Is_Name_Reference (Selector_Name (N))
and then
(Is_Name_Reference (Prefix (N))
or else Is_Access_Type (Etype (Prefix (N))));
when N_Explicit_Dereference =>
return True;
-- A view conversion of a tagged name is a name reference
when N_Type_Conversion =>
return
Is_Tagged_Type (Etype (Subtype_Mark (N)))
and then Is_Tagged_Type (Etype (Expression (N)))
and then Is_Name_Reference (Expression (N));
-- An unchecked type conversion is considered to be a name if the
-- operand is a name (this construction arises only as a result of
-- expansion activities).
when N_Unchecked_Type_Conversion =>
return Is_Name_Reference (Expression (N));
when others =>
return False;
end case;
end Is_Name_Reference;
---------------------------------
-- Is_Nontrivial_DIC_Procedure --
---------------------------------
function Is_Nontrivial_DIC_Procedure (Id : Entity_Id) return Boolean is
Body_Decl : Node_Id;
Stmt : Node_Id;
begin
if Ekind (Id) = E_Procedure and then Is_DIC_Procedure (Id) then
Body_Decl :=
Unit_Declaration_Node
(Corresponding_Body (Unit_Declaration_Node (Id)));
-- The body of the Default_Initial_Condition procedure must contain
-- at least one statement, otherwise the generation of the subprogram
-- body failed.
pragma Assert (Present (Handled_Statement_Sequence (Body_Decl)));
-- To qualify as nontrivial, the first statement of the procedure
-- must be a check in the form of an if statement. If the original
-- Default_Initial_Condition expression was folded, then the first
-- statement is not a check.
Stmt := First (Statements (Handled_Statement_Sequence (Body_Decl)));
return
Nkind (Stmt) = N_If_Statement
and then Nkind (Original_Node (Stmt)) = N_Pragma;
end if;
return False;
end Is_Nontrivial_DIC_Procedure;
-------------------------
-- Is_Null_Record_Type --
-------------------------
function Is_Null_Record_Type (T : Entity_Id) return Boolean is
Decl : constant Node_Id := Parent (T);
begin
return Nkind (Decl) = N_Full_Type_Declaration
and then Nkind (Type_Definition (Decl)) = N_Record_Definition
and then
(No (Component_List (Type_Definition (Decl)))
or else Null_Present (Component_List (Type_Definition (Decl))));
end Is_Null_Record_Type;
-------------------------
-- Is_Object_Reference --
-------------------------
function Is_Object_Reference (N : Node_Id) return Boolean is
function Is_Internally_Generated_Renaming (N : Node_Id) return Boolean;
-- Determine whether N is the name of an internally-generated renaming
--------------------------------------
-- Is_Internally_Generated_Renaming --
--------------------------------------
function Is_Internally_Generated_Renaming (N : Node_Id) return Boolean is
P : Node_Id;
begin
P := N;
while Present (P) loop
if Nkind (P) = N_Object_Renaming_Declaration then
return not Comes_From_Source (P);
elsif Is_List_Member (P) then
return False;
end if;
P := Parent (P);
end loop;
return False;
end Is_Internally_Generated_Renaming;
-- Start of processing for Is_Object_Reference
begin
if Is_Entity_Name (N) then
return Present (Entity (N)) and then Is_Object (Entity (N));
else
case Nkind (N) is
when N_Indexed_Component
| N_Slice
=>
return
Is_Object_Reference (Prefix (N))
or else Is_Access_Type (Etype (Prefix (N)));
-- In Ada 95, a function call is a constant object; a procedure
-- call is not.
when N_Function_Call =>
return Etype (N) /= Standard_Void_Type;
-- Attributes 'Input, 'Loop_Entry, 'Old, and 'Result produce
-- objects.
when N_Attribute_Reference =>
return
Nam_In (Attribute_Name (N), Name_Input,
Name_Loop_Entry,
Name_Old,
Name_Result);
when N_Selected_Component =>
return
Is_Object_Reference (Selector_Name (N))
and then
(Is_Object_Reference (Prefix (N))
or else Is_Access_Type (Etype (Prefix (N))));
when N_Explicit_Dereference =>
return True;
-- A view conversion of a tagged object is an object reference
when N_Type_Conversion =>
return Is_Tagged_Type (Etype (Subtype_Mark (N)))
and then Is_Tagged_Type (Etype (Expression (N)))
and then Is_Object_Reference (Expression (N));
-- An unchecked type conversion is considered to be an object if
-- the operand is an object (this construction arises only as a
-- result of expansion activities).
when N_Unchecked_Type_Conversion =>
return True;
-- Allow string literals to act as objects as long as they appear
-- in internally-generated renamings. The expansion of iterators
-- may generate such renamings when the range involves a string
-- literal.
when N_String_Literal =>
return Is_Internally_Generated_Renaming (Parent (N));
-- AI05-0003: In Ada 2012 a qualified expression is a name.
-- This allows disambiguation of function calls and the use
-- of aggregates in more contexts.
when N_Qualified_Expression =>
if Ada_Version < Ada_2012 then
return False;
else
return Is_Object_Reference (Expression (N))
or else Nkind (Expression (N)) = N_Aggregate;
end if;
when others =>
return False;
end case;
end if;
end Is_Object_Reference;
-----------------------------------
-- Is_OK_Variable_For_Out_Formal --
-----------------------------------
function Is_OK_Variable_For_Out_Formal (AV : Node_Id) return Boolean is
begin
Note_Possible_Modification (AV, Sure => True);
-- We must reject parenthesized variable names. Comes_From_Source is
-- checked because there are currently cases where the compiler violates
-- this rule (e.g. passing a task object to its controlled Initialize
-- routine). This should be properly documented in sinfo???
if Paren_Count (AV) > 0 and then Comes_From_Source (AV) then
return False;
-- A variable is always allowed
elsif Is_Variable (AV) then
return True;
-- Generalized indexing operations are rewritten as explicit
-- dereferences, and it is only during resolution that we can
-- check whether the context requires an access_to_variable type.
elsif Nkind (AV) = N_Explicit_Dereference
and then Ada_Version >= Ada_2012
and then Nkind (Original_Node (AV)) = N_Indexed_Component
and then Present (Etype (Original_Node (AV)))
and then Has_Implicit_Dereference (Etype (Original_Node (AV)))
then
return not Is_Access_Constant (Etype (Prefix (AV)));
-- Unchecked conversions are allowed only if they come from the
-- generated code, which sometimes uses unchecked conversions for out
-- parameters in cases where code generation is unaffected. We tell
-- source unchecked conversions by seeing if they are rewrites of
-- an original Unchecked_Conversion function call, or of an explicit
-- conversion of a function call or an aggregate (as may happen in the
-- expansion of a packed array aggregate).
elsif Nkind (AV) = N_Unchecked_Type_Conversion then
if Nkind_In (Original_Node (AV), N_Function_Call, N_Aggregate) then
return False;
elsif Comes_From_Source (AV)
and then Nkind (Original_Node (Expression (AV))) = N_Function_Call
then
return False;
elsif Nkind (Original_Node (AV)) = N_Type_Conversion then
return Is_OK_Variable_For_Out_Formal (Expression (AV));
else
return True;
end if;
-- Normal type conversions are allowed if argument is a variable
elsif Nkind (AV) = N_Type_Conversion then
if Is_Variable (Expression (AV))
and then Paren_Count (Expression (AV)) = 0
then
Note_Possible_Modification (Expression (AV), Sure => True);
return True;
-- We also allow a non-parenthesized expression that raises
-- constraint error if it rewrites what used to be a variable
elsif Raises_Constraint_Error (Expression (AV))
and then Paren_Count (Expression (AV)) = 0
and then Is_Variable (Original_Node (Expression (AV)))
then
return True;
-- Type conversion of something other than a variable
else
return False;
end if;
-- If this node is rewritten, then test the original form, if that is
-- OK, then we consider the rewritten node OK (for example, if the
-- original node is a conversion, then Is_Variable will not be true
-- but we still want to allow the conversion if it converts a variable).
elsif Original_Node (AV) /= AV then
-- In Ada 2012, the explicit dereference may be a rewritten call to a
-- Reference function.
if Ada_Version >= Ada_2012
and then Nkind (Original_Node (AV)) = N_Function_Call
and then
Has_Implicit_Dereference (Etype (Name (Original_Node (AV))))
then
-- Check that this is not a constant reference.
return not Is_Access_Constant (Etype (Prefix (AV)));
elsif Has_Implicit_Dereference (Etype (Original_Node (AV))) then
return
not Is_Access_Constant (Etype
(Get_Reference_Discriminant (Etype (Original_Node (AV)))));
else
return Is_OK_Variable_For_Out_Formal (Original_Node (AV));
end if;
-- All other non-variables are rejected
else
return False;
end if;
end Is_OK_Variable_For_Out_Formal;
----------------------------
-- Is_OK_Volatile_Context --
----------------------------
function Is_OK_Volatile_Context
(Context : Node_Id;
Obj_Ref : Node_Id) return Boolean
is
function Is_Protected_Operation_Call (Nod : Node_Id) return Boolean;
-- Determine whether an arbitrary node denotes a call to a protected
-- entry, function, or procedure in prefixed form where the prefix is
-- Obj_Ref.
function Within_Check (Nod : Node_Id) return Boolean;
-- Determine whether an arbitrary node appears in a check node
function Within_Subprogram_Call (Nod : Node_Id) return Boolean;
-- Determine whether an arbitrary node appears in an entry, function, or
-- procedure call.
function Within_Volatile_Function (Id : Entity_Id) return Boolean;
-- Determine whether an arbitrary entity appears in a volatile function
---------------------------------
-- Is_Protected_Operation_Call --
---------------------------------
function Is_Protected_Operation_Call (Nod : Node_Id) return Boolean is
Pref : Node_Id;
Subp : Node_Id;
begin
-- A call to a protected operations retains its selected component
-- form as opposed to other prefixed calls that are transformed in
-- expanded names.
if Nkind (Nod) = N_Selected_Component then
Pref := Prefix (Nod);
Subp := Selector_Name (Nod);
return
Pref = Obj_Ref
and then Present (Etype (Pref))
and then Is_Protected_Type (Etype (Pref))
and then Is_Entity_Name (Subp)
and then Present (Entity (Subp))
and then Ekind_In (Entity (Subp), E_Entry,
E_Entry_Family,
E_Function,
E_Procedure);
else
return False;
end if;
end Is_Protected_Operation_Call;
------------------
-- Within_Check --
------------------
function Within_Check (Nod : Node_Id) return Boolean is
Par : Node_Id;
begin
-- Climb the parent chain looking for a check node
Par := Nod;
while Present (Par) loop
if Nkind (Par) in N_Raise_xxx_Error 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 Within_Check;
----------------------------
-- Within_Subprogram_Call --
----------------------------
function Within_Subprogram_Call (Nod : Node_Id) return Boolean is
Par : Node_Id;
begin
-- Climb the parent chain looking for a function or procedure call
Par := Nod;
while Present (Par) loop
if Nkind_In (Par, N_Entry_Call_Statement,
N_Function_Call,
N_Procedure_Call_Statement)
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 Within_Subprogram_Call;
------------------------------
-- Within_Volatile_Function --
------------------------------
function Within_Volatile_Function (Id : Entity_Id) return Boolean is
Func_Id : Entity_Id;
begin
-- Traverse the scope stack looking for a [generic] function
Func_Id := Id;
while Present (Func_Id) and then Func_Id /= Standard_Standard loop
if Ekind_In (Func_Id, E_Function, E_Generic_Function) then
return Is_Volatile_Function (Func_Id);
end if;
Func_Id := Scope (Func_Id);
end loop;
return False;
end Within_Volatile_Function;
-- Local variables
Obj_Id : Entity_Id;
-- Start of processing for Is_OK_Volatile_Context
begin
-- The volatile object appears on either side of an assignment
if Nkind (Context) = N_Assignment_Statement then
return True;
-- The volatile object is part of the initialization expression of
-- another object.
elsif Nkind (Context) = N_Object_Declaration
and then Present (Expression (Context))
and then Expression (Context) = Obj_Ref
then
Obj_Id := Defining_Entity (Context);
-- The volatile object acts as the initialization expression of an
-- extended return statement. This is valid context as long as the
-- function is volatile.
if Is_Return_Object (Obj_Id) then
return Within_Volatile_Function (Obj_Id);
-- Otherwise this is a normal object initialization
else
return True;
end if;
-- The volatile object acts as the name of a renaming declaration
elsif Nkind (Context) = N_Object_Renaming_Declaration
and then Name (Context) = Obj_Ref
then
return True;
-- The volatile object appears as an actual parameter in a call to an
-- instance of Unchecked_Conversion whose result is renamed.
elsif Nkind (Context) = N_Function_Call
and then Is_Entity_Name (Name (Context))
and then Is_Unchecked_Conversion_Instance (Entity (Name (Context)))
and then Nkind (Parent (Context)) = N_Object_Renaming_Declaration
then
return True;
-- The volatile object is actually the prefix in a protected entry,
-- function, or procedure call.
elsif Is_Protected_Operation_Call (Context) then
return True;
-- The volatile object appears as the expression of a simple return
-- statement that applies to a volatile function.
elsif Nkind (Context) = N_Simple_Return_Statement
and then Expression (Context) = Obj_Ref
then
return
Within_Volatile_Function (Return_Statement_Entity (Context));
-- The volatile object appears as the prefix of a name occurring in a
-- non-interfering context.
elsif Nkind_In (Context, N_Attribute_Reference,
N_Explicit_Dereference,
N_Indexed_Component,
N_Selected_Component,
N_Slice)
and then Prefix (Context) = Obj_Ref
and then Is_OK_Volatile_Context
(Context => Parent (Context),
Obj_Ref => Context)
then
return True;
-- The volatile object appears as the prefix of attributes Address,
-- Alignment, Component_Size, First_Bit, Last_Bit, Position, Size,
-- Storage_Size.
elsif Nkind (Context) = N_Attribute_Reference
and then Prefix (Context) = Obj_Ref
and then Nam_In (Attribute_Name (Context), Name_Address,
Name_Alignment,
Name_Component_Size,
Name_First_Bit,
Name_Last_Bit,
Name_Position,
Name_Size,
Name_Storage_Size)
then
return True;
-- The volatile object appears as the expression of a type conversion
-- occurring in a non-interfering context.
elsif Nkind_In (Context, N_Type_Conversion,
N_Unchecked_Type_Conversion)
and then Expression (Context) = Obj_Ref
and then Is_OK_Volatile_Context
(Context => Parent (Context),
Obj_Ref => Context)
then
return True;
-- The volatile object appears as the expression in a delay statement
elsif Nkind (Context) in N_Delay_Statement then
return True;
-- Allow references to volatile objects in various checks. This is not a
-- direct SPARK 2014 requirement.
elsif Within_Check (Context) then
return True;
-- Assume that references to effectively volatile objects that appear
-- as actual parameters in a subprogram call are always legal. A full
-- legality check is done when the actuals are resolved (see routine
-- Resolve_Actuals).
elsif Within_Subprogram_Call (Context) then
return True;
-- Otherwise the context is not suitable for an effectively volatile
-- object.
else
return False;
end if;
end Is_OK_Volatile_Context;
------------------------------------
-- Is_Package_Contract_Annotation --
------------------------------------
function Is_Package_Contract_Annotation (Item : Node_Id) return Boolean is
Nam : Name_Id;
begin
if Nkind (Item) = N_Aspect_Specification then
Nam := Chars (Identifier (Item));
else pragma Assert (Nkind (Item) = N_Pragma);
Nam := Pragma_Name (Item);
end if;
return Nam = Name_Abstract_State
or else Nam = Name_Initial_Condition
or else Nam = Name_Initializes
or else Nam = Name_Refined_State;
end Is_Package_Contract_Annotation;
-----------------------------------
-- Is_Partially_Initialized_Type --
-----------------------------------
function Is_Partially_Initialized_Type
(Typ : Entity_Id;
Include_Implicit : Boolean := True) return Boolean
is
begin
if Is_Scalar_Type (Typ) then
return False;
elsif Is_Access_Type (Typ) then
return Include_Implicit;
elsif Is_Array_Type (Typ) then
-- If component type is partially initialized, so is array type
if Is_Partially_Initialized_Type
(Component_Type (Typ), Include_Implicit)
then
return True;
-- Otherwise we are only partially initialized if we are fully
-- initialized (this is the empty array case, no point in us
-- duplicating that code here).
else
return Is_Fully_Initialized_Type (Typ);
end if;
elsif Is_Record_Type (Typ) then
-- A discriminated type is always partially initialized if in
-- all mode
if Has_Discriminants (Typ) and then Include_Implicit then
return True;
-- A tagged type is always partially initialized
elsif Is_Tagged_Type (Typ) then
return True;
-- Case of non-discriminated record
else
declare
Ent : Entity_Id;
Component_Present : Boolean := False;
-- Set True if at least one component is present. If no
-- components are present, then record type is fully
-- initialized (another odd case, like the null array).
begin
-- Loop through components
Ent := First_Entity (Typ);
while Present (Ent) loop
if Ekind (Ent) = E_Component then
Component_Present := True;
-- If a component has an initialization expression then
-- the enclosing record type is partially initialized
if Present (Parent (Ent))
and then Present (Expression (Parent (Ent)))
then
return True;
-- If a component is of a type which is itself partially
-- initialized, then the enclosing record type is also.
elsif Is_Partially_Initialized_Type
(Etype (Ent), Include_Implicit)
then
return True;
end if;
end if;
Next_Entity (Ent);
end loop;
-- No initialized components found. If we found any components
-- they were all uninitialized so the result is false.
if Component_Present then
return False;
-- But if we found no components, then all the components are
-- initialized so we consider the type to be initialized.
else
return True;
end if;
end;
end if;
-- Concurrent types are always fully initialized
elsif Is_Concurrent_Type (Typ) then
return True;
-- For a private type, go to underlying type. If there is no underlying
-- type then just assume this partially initialized. Not clear if this
-- can happen in a non-error case, but no harm in testing for this.
elsif Is_Private_Type (Typ) then
declare
U : constant Entity_Id := Underlying_Type (Typ);
begin
if No (U) then
return True;
else
return Is_Partially_Initialized_Type (U, Include_Implicit);
end if;
end;
-- For any other type (are there any?) assume partially initialized
else
return True;
end if;
end Is_Partially_Initialized_Type;
------------------------------------
-- Is_Potentially_Persistent_Type --
------------------------------------
function Is_Potentially_Persistent_Type (T : Entity_Id) return Boolean is
Comp : Entity_Id;
Indx : Node_Id;
begin
-- For private type, test corresponding full type
if Is_Private_Type (T) then
return Is_Potentially_Persistent_Type (Full_View (T));
-- Scalar types are potentially persistent
elsif Is_Scalar_Type (T) then
return True;
-- Record type is potentially persistent if not tagged and the types of
-- all it components are potentially persistent, and no component has
-- an initialization expression.
elsif Is_Record_Type (T)
and then not Is_Tagged_Type (T)
and then not Is_Partially_Initialized_Type (T)
then
Comp := First_Component (T);
while Present (Comp) loop
if not Is_Potentially_Persistent_Type (Etype (Comp)) then
return False;
else
Next_Entity (Comp);
end if;
end loop;
return True;
-- Array type is potentially persistent if its component type is
-- potentially persistent and if all its constraints are static.
elsif Is_Array_Type (T) then
if not Is_Potentially_Persistent_Type (Component_Type (T)) then
return False;
end if;
Indx := First_Index (T);
while Present (Indx) loop
if not Is_OK_Static_Subtype (Etype (Indx)) then
return False;
else
Next_Index (Indx);
end if;
end loop;
return True;
-- All other types are not potentially persistent
else
return False;
end if;
end Is_Potentially_Persistent_Type;
--------------------------------
-- Is_Potentially_Unevaluated --
--------------------------------
function Is_Potentially_Unevaluated (N : Node_Id) return Boolean is
Par : Node_Id;
Expr : Node_Id;
begin
Expr := N;
Par := Parent (N);
-- A postcondition whose expression is a short-circuit is broken down
-- into individual aspects for better exception reporting. The original
-- short-circuit expression is rewritten as the second operand, and an
-- occurrence of 'Old in that operand is potentially unevaluated.
-- See Sem_ch13.adb for details of this transformation.
if Nkind (Original_Node (Par)) = N_And_Then then
return True;
end if;
while not Nkind_In (Par, N_If_Expression,
N_Case_Expression,
N_And_Then,
N_Or_Else,
N_In,
N_Not_In)
loop
Expr := Par;
Par := Parent (Par);
-- If the context is not an expression, or if is the result of
-- expansion of an enclosing construct (such as another attribute)
-- the predicate does not apply.
if Nkind (Par) not in N_Subexpr
or else not Comes_From_Source (Par)
then
return False;
end if;
end loop;
if Nkind (Par) = N_If_Expression then
return Is_Elsif (Par) or else Expr /= First (Expressions (Par));
elsif Nkind (Par) = N_Case_Expression then
return Expr /= Expression (Par);
elsif Nkind_In (Par, N_And_Then, N_Or_Else) then
return Expr = Right_Opnd (Par);
elsif Nkind_In (Par, N_In, N_Not_In) then
return Expr /= Left_Opnd (Par);
else
return False;
end if;
end Is_Potentially_Unevaluated;
---------------------------------
-- Is_Protected_Self_Reference --
---------------------------------
function Is_Protected_Self_Reference (N : Node_Id) return Boolean is
function In_Access_Definition (N : Node_Id) return Boolean;
-- Returns true if N belongs to an access definition
--------------------------
-- In_Access_Definition --
--------------------------
function In_Access_Definition (N : Node_Id) return Boolean is
P : Node_Id;
begin
P := Parent (N);
while Present (P) loop
if Nkind (P) = N_Access_Definition then
return True;
end if;
P := Parent (P);
end loop;
return False;
end In_Access_Definition;
-- Start of processing for Is_Protected_Self_Reference
begin
-- Verify that prefix is analyzed and has the proper form. Note that
-- the attributes Elab_Spec, Elab_Body, and Elab_Subp_Body, which also
-- produce the address of an entity, do not analyze their prefix
-- because they denote entities that are not necessarily visible.
-- Neither of them can apply to a protected type.
return Ada_Version >= Ada_2005
and then Is_Entity_Name (N)
and then Present (Entity (N))
and then Is_Protected_Type (Entity (N))
and then In_Open_Scopes (Entity (N))
and then not In_Access_Definition (N);
end Is_Protected_Self_Reference;
-----------------------------
-- Is_RCI_Pkg_Spec_Or_Body --
-----------------------------
function Is_RCI_Pkg_Spec_Or_Body (Cunit : Node_Id) return Boolean is
function Is_RCI_Pkg_Decl_Cunit (Cunit : Node_Id) return Boolean;
-- Return True if the unit of Cunit is an RCI package declaration
---------------------------
-- Is_RCI_Pkg_Decl_Cunit --
---------------------------
function Is_RCI_Pkg_Decl_Cunit (Cunit : Node_Id) return Boolean is
The_Unit : constant Node_Id := Unit (Cunit);
begin
if Nkind (The_Unit) /= N_Package_Declaration then
return False;
end if;
return Is_Remote_Call_Interface (Defining_Entity (The_Unit));
end Is_RCI_Pkg_Decl_Cunit;
-- Start of processing for Is_RCI_Pkg_Spec_Or_Body
begin
return Is_RCI_Pkg_Decl_Cunit (Cunit)
or else
(Nkind (Unit (Cunit)) = N_Package_Body
and then Is_RCI_Pkg_Decl_Cunit (Library_Unit (Cunit)));
end Is_RCI_Pkg_Spec_Or_Body;
-----------------------------------------
-- Is_Remote_Access_To_Class_Wide_Type --
-----------------------------------------
function Is_Remote_Access_To_Class_Wide_Type
(E : Entity_Id) return Boolean
is
begin
-- A remote access to class-wide type is a general access to object type
-- declared in the visible part of a Remote_Types or Remote_Call_
-- Interface unit.
return Ekind (E) = E_General_Access_Type
and then (Is_Remote_Call_Interface (E) or else Is_Remote_Types (E));
end Is_Remote_Access_To_Class_Wide_Type;
-----------------------------------------
-- Is_Remote_Access_To_Subprogram_Type --
-----------------------------------------
function Is_Remote_Access_To_Subprogram_Type
(E : Entity_Id) return Boolean
is
begin
return (Ekind (E) = E_Access_Subprogram_Type
or else (Ekind (E) = E_Record_Type
and then Present (Corresponding_Remote_Type (E))))
and then (Is_Remote_Call_Interface (E) or else Is_Remote_Types (E));
end Is_Remote_Access_To_Subprogram_Type;
--------------------
-- Is_Remote_Call --
--------------------
function Is_Remote_Call (N : Node_Id) return Boolean is
begin
if Nkind (N) not in N_Subprogram_Call then
-- An entry call cannot be remote
return False;
elsif Nkind (Name (N)) in N_Has_Entity
and then Is_Remote_Call_Interface (Entity (Name (N)))
then
-- A subprogram declared in the spec of a RCI package is remote
return True;
elsif Nkind (Name (N)) = N_Explicit_Dereference
and then Is_Remote_Access_To_Subprogram_Type
(Etype (Prefix (Name (N))))
then
-- The dereference of a RAS is a remote call
return True;
elsif Present (Controlling_Argument (N))
and then Is_Remote_Access_To_Class_Wide_Type
(Etype (Controlling_Argument (N)))
then
-- Any primitive operation call with a controlling argument of
-- a RACW type is a remote call.
return True;
end if;
-- All other calls are local calls
return False;
end Is_Remote_Call;
----------------------
-- Is_Renamed_Entry --
----------------------
function Is_Renamed_Entry (Proc_Nam : Entity_Id) return Boolean is
Orig_Node : Node_Id := Empty;
Subp_Decl : Node_Id := Parent (Parent (Proc_Nam));
function Is_Entry (Nam : Node_Id) return Boolean;
-- Determine whether Nam is an entry. Traverse selectors if there are
-- nested selected components.
--------------
-- Is_Entry --
--------------
function Is_Entry (Nam : Node_Id) return Boolean is
begin
if Nkind (Nam) = N_Selected_Component then
return Is_Entry (Selector_Name (Nam));
end if;
return Ekind (Entity (Nam)) = E_Entry;
end Is_Entry;
-- Start of processing for Is_Renamed_Entry
begin
if Present (Alias (Proc_Nam)) then
Subp_Decl := Parent (Parent (Alias (Proc_Nam)));
end if;
-- Look for a rewritten subprogram renaming declaration
if Nkind (Subp_Decl) = N_Subprogram_Declaration
and then Present (Original_Node (Subp_Decl))
then
Orig_Node := Original_Node (Subp_Decl);
end if;
-- The rewritten subprogram is actually an entry
if Present (Orig_Node)
and then Nkind (Orig_Node) = N_Subprogram_Renaming_Declaration
and then Is_Entry (Name (Orig_Node))
then
return True;
end if;
return False;
end Is_Renamed_Entry;
-----------------------------
-- Is_Renaming_Declaration --
-----------------------------
function Is_Renaming_Declaration (N : Node_Id) return Boolean is
begin
case Nkind (N) is
when N_Exception_Renaming_Declaration
| N_Generic_Function_Renaming_Declaration
| N_Generic_Package_Renaming_Declaration
| N_Generic_Procedure_Renaming_Declaration
| N_Object_Renaming_Declaration
| N_Package_Renaming_Declaration
| N_Subprogram_Renaming_Declaration
=>
return True;
when others =>
return False;
end case;
end Is_Renaming_Declaration;
----------------------------
-- Is_Reversible_Iterator --
----------------------------
function Is_Reversible_Iterator (Typ : Entity_Id) return Boolean is
Ifaces_List : Elist_Id;
Iface_Elmt : Elmt_Id;
Iface : Entity_Id;
begin
if Is_Class_Wide_Type (Typ)
and then Chars (Root_Type (Typ)) = Name_Reversible_Iterator
and then Is_Predefined_File_Name
(Unit_File_Name (Get_Source_Unit (Root_Type (Typ))))
then
return True;
elsif not Is_Tagged_Type (Typ) or else not Is_Derived_Type (Typ) then
return False;
else
Collect_Interfaces (Typ, Ifaces_List);
Iface_Elmt := First_Elmt (Ifaces_List);
while Present (Iface_Elmt) loop
Iface := Node (Iface_Elmt);
if Chars (Iface) = Name_Reversible_Iterator
and then
Is_Predefined_File_Name
(Unit_File_Name (Get_Source_Unit (Iface)))
then
return True;
end if;
Next_Elmt (Iface_Elmt);
end loop;
end if;
return False;
end Is_Reversible_Iterator;
----------------------
-- Is_Selector_Name --
----------------------
function Is_Selector_Name (N : Node_Id) return Boolean is
begin
if not Is_List_Member (N) then
declare
P : constant Node_Id := Parent (N);
begin
return Nkind_In (P, N_Expanded_Name,
N_Generic_Association,
N_Parameter_Association,
N_Selected_Component)
and then Selector_Name (P) = N;
end;
else
declare
L : constant List_Id := List_Containing (N);
P : constant Node_Id := Parent (L);
begin
return (Nkind (P) = N_Discriminant_Association
and then Selector_Names (P) = L)
or else
(Nkind (P) = N_Component_Association
and then Choices (P) = L);
end;
end if;
end Is_Selector_Name;
---------------------------------
-- Is_Single_Concurrent_Object --
---------------------------------
function Is_Single_Concurrent_Object (Id : Entity_Id) return Boolean is
begin
return
Is_Single_Protected_Object (Id) or else Is_Single_Task_Object (Id);
end Is_Single_Concurrent_Object;
-------------------------------
-- Is_Single_Concurrent_Type --
-------------------------------
function Is_Single_Concurrent_Type (Id : Entity_Id) return Boolean is
begin
return
Ekind_In (Id, E_Protected_Type, E_Task_Type)
and then Is_Single_Concurrent_Type_Declaration
(Declaration_Node (Id));
end Is_Single_Concurrent_Type;
-------------------------------------------
-- Is_Single_Concurrent_Type_Declaration --
-------------------------------------------
function Is_Single_Concurrent_Type_Declaration
(N : Node_Id) return Boolean
is
begin
return Nkind_In (Original_Node (N), N_Single_Protected_Declaration,
N_Single_Task_Declaration);
end Is_Single_Concurrent_Type_Declaration;
---------------------------------------------
-- Is_Single_Precision_Floating_Point_Type --
---------------------------------------------
function Is_Single_Precision_Floating_Point_Type
(E : Entity_Id) return Boolean is
begin
return Is_Floating_Point_Type (E)
and then Machine_Radix_Value (E) = Uint_2
and then Machine_Mantissa_Value (E) = Uint_24
and then Machine_Emax_Value (E) = Uint_2 ** Uint_7
and then Machine_Emin_Value (E) = Uint_3 - (Uint_2 ** Uint_7);
end Is_Single_Precision_Floating_Point_Type;
--------------------------------
-- Is_Single_Protected_Object --
--------------------------------
function Is_Single_Protected_Object (Id : Entity_Id) return Boolean is
begin
return
Ekind (Id) = E_Variable
and then Ekind (Etype (Id)) = E_Protected_Type
and then Is_Single_Concurrent_Type (Etype (Id));
end Is_Single_Protected_Object;
---------------------------
-- Is_Single_Task_Object --
---------------------------
function Is_Single_Task_Object (Id : Entity_Id) return Boolean is
begin
return
Ekind (Id) = E_Variable
and then Ekind (Etype (Id)) = E_Task_Type
and then Is_Single_Concurrent_Type (Etype (Id));
end Is_Single_Task_Object;
-------------------------------------
-- Is_SPARK_05_Initialization_Expr --
-------------------------------------
function Is_SPARK_05_Initialization_Expr (N : Node_Id) return Boolean is
Is_Ok : Boolean;
Expr : Node_Id;
Comp_Assn : Node_Id;
Orig_N : constant Node_Id := Original_Node (N);
begin
Is_Ok := True;
if not Comes_From_Source (Orig_N) then
goto Done;
end if;
pragma Assert (Nkind (Orig_N) in N_Subexpr);
case Nkind (Orig_N) is
when N_Character_Literal
| N_Integer_Literal
| N_Real_Literal
| N_String_Literal
=>
null;
when N_Expanded_Name
| N_Identifier
=>
if Is_Entity_Name (Orig_N)
and then Present (Entity (Orig_N)) -- needed in some cases
then
case Ekind (Entity (Orig_N)) is
when E_Constant
| E_Enumeration_Literal
| E_Named_Integer
| E_Named_Real
=>
null;
when others =>
if Is_Type (Entity (Orig_N)) then
null;
else
Is_Ok := False;
end if;
end case;
end if;
when N_Qualified_Expression
| N_Type_Conversion
=>
Is_Ok := Is_SPARK_05_Initialization_Expr (Expression (Orig_N));
when N_Unary_Op =>
Is_Ok := Is_SPARK_05_Initialization_Expr (Right_Opnd (Orig_N));
when N_Binary_Op
| N_Membership_Test
| N_Short_Circuit
=>
Is_Ok := Is_SPARK_05_Initialization_Expr (Left_Opnd (Orig_N))
and then
Is_SPARK_05_Initialization_Expr (Right_Opnd (Orig_N));
when N_Aggregate
| N_Extension_Aggregate
=>
if Nkind (Orig_N) = N_Extension_Aggregate then
Is_Ok :=
Is_SPARK_05_Initialization_Expr (Ancestor_Part (Orig_N));
end if;
Expr := First (Expressions (Orig_N));
while Present (Expr) loop
if not Is_SPARK_05_Initialization_Expr (Expr) then
Is_Ok := False;
goto Done;
end if;
Next (Expr);
end loop;
Comp_Assn := First (Component_Associations (Orig_N));
while Present (Comp_Assn) loop
Expr := Expression (Comp_Assn);
-- Note: test for Present here needed for box assocation
if Present (Expr)
and then not Is_SPARK_05_Initialization_Expr (Expr)
then
Is_Ok := False;
goto Done;
end if;
Next (Comp_Assn);
end loop;
when N_Attribute_Reference =>
if Nkind (Prefix (Orig_N)) in N_Subexpr then
Is_Ok := Is_SPARK_05_Initialization_Expr (Prefix (Orig_N));
end if;
Expr := First (Expressions (Orig_N));
while Present (Expr) loop
if not Is_SPARK_05_Initialization_Expr (Expr) then
Is_Ok := False;
goto Done;
end if;
Next (Expr);
end loop;
-- Selected components might be expanded named not yet resolved, so
-- default on the safe side. (Eg on sparklex.ads)
when N_Selected_Component =>
null;
when others =>
Is_Ok := False;
end case;
<<Done>>
return Is_Ok;
end Is_SPARK_05_Initialization_Expr;
----------------------------------
-- Is_SPARK_05_Object_Reference --
----------------------------------
function Is_SPARK_05_Object_Reference (N : Node_Id) return Boolean is
begin
if Is_Entity_Name (N) then
return Present (Entity (N))
and then
(Ekind_In (Entity (N), E_Constant, E_Variable)
or else Ekind (Entity (N)) in Formal_Kind);
else
case Nkind (N) is
when N_Selected_Component =>
return Is_SPARK_05_Object_Reference (Prefix (N));
when others =>
return False;
end case;
end if;
end Is_SPARK_05_Object_Reference;
-----------------------------
-- Is_Specific_Tagged_Type --
-----------------------------
function Is_Specific_Tagged_Type (Typ : Entity_Id) return Boolean is
Full_Typ : Entity_Id;
begin
-- Handle private types
if Is_Private_Type (Typ) and then Present (Full_View (Typ)) then
Full_Typ := Full_View (Typ);
else
Full_Typ := Typ;
end if;
-- A specific tagged type is a non-class-wide tagged type
return Is_Tagged_Type (Full_Typ) and not Is_Class_Wide_Type (Full_Typ);
end Is_Specific_Tagged_Type;
------------------
-- Is_Statement --
------------------
function Is_Statement (N : Node_Id) return Boolean is
begin
return
Nkind (N) in N_Statement_Other_Than_Procedure_Call
or else Nkind (N) = N_Procedure_Call_Statement;
end Is_Statement;
---------------------------------------
-- Is_Subprogram_Contract_Annotation --
---------------------------------------
function Is_Subprogram_Contract_Annotation
(Item : Node_Id) return Boolean
is
Nam : Name_Id;
begin
if Nkind (Item) = N_Aspect_Specification then
Nam := Chars (Identifier (Item));
else pragma Assert (Nkind (Item) = N_Pragma);
Nam := Pragma_Name (Item);
end if;
return Nam = Name_Contract_Cases
or else Nam = Name_Depends
or else Nam = Name_Extensions_Visible
or else Nam = Name_Global
or else Nam = Name_Post
or else Nam = Name_Post_Class
or else Nam = Name_Postcondition
or else Nam = Name_Pre
or else Nam = Name_Pre_Class
or else Nam = Name_Precondition
or else Nam = Name_Refined_Depends
or else Nam = Name_Refined_Global
or else Nam = Name_Refined_Post
or else Nam = Name_Test_Case;
end Is_Subprogram_Contract_Annotation;
--------------------------------------------------
-- Is_Subprogram_Stub_Without_Prior_Declaration --
--------------------------------------------------
function Is_Subprogram_Stub_Without_Prior_Declaration
(N : Node_Id) return Boolean
is
begin
-- A subprogram stub without prior declaration serves as declaration for
-- the actual subprogram body. As such, it has an attached defining
-- entity of E_[Generic_]Function or E_[Generic_]Procedure.
return Nkind (N) = N_Subprogram_Body_Stub
and then Ekind (Defining_Entity (N)) /= E_Subprogram_Body;
end Is_Subprogram_Stub_Without_Prior_Declaration;
--------------------------
-- Is_Suspension_Object --
--------------------------
function Is_Suspension_Object (Id : Entity_Id) return Boolean is
begin
-- This approach does an exact name match rather than to rely on
-- RTSfind. Routine Is_Effectively_Volatile is used by clients of the
-- front end at point where all auxiliary tables are locked and any
-- modifications to them are treated as violations. Do not tamper with
-- the tables, instead examine the Chars fields of all the scopes of Id.
return
Chars (Id) = Name_Suspension_Object
and then Present (Scope (Id))
and then Chars (Scope (Id)) = Name_Synchronous_Task_Control
and then Present (Scope (Scope (Id)))
and then Chars (Scope (Scope (Id))) = Name_Ada
and then Present (Scope (Scope (Scope (Id))))
and then Scope (Scope (Scope (Id))) = Standard_Standard;
end Is_Suspension_Object;
----------------------------
-- Is_Synchronized_Object --
----------------------------
function Is_Synchronized_Object (Id : Entity_Id) return Boolean is
Prag : Node_Id;
begin
if Is_Object (Id) then
-- The object is synchronized if it is of a type that yields a
-- synchronized object.
if Yields_Synchronized_Object (Etype (Id)) then
return True;
-- The object is synchronized if it is atomic and Async_Writers is
-- enabled.
elsif Is_Atomic (Id) and then Async_Writers_Enabled (Id) then
return True;
-- A constant is a synchronized object by default
elsif Ekind (Id) = E_Constant then
return True;
-- A variable is a synchronized object if it is subject to pragma
-- Constant_After_Elaboration.
elsif Ekind (Id) = E_Variable then
Prag := Get_Pragma (Id, Pragma_Constant_After_Elaboration);
return Present (Prag) and then Is_Enabled_Pragma (Prag);
end if;
end if;
-- Otherwise the input is not an object or it does not qualify as a
-- synchronized object.
return False;
end Is_Synchronized_Object;
---------------------------------
-- Is_Synchronized_Tagged_Type --
---------------------------------
function Is_Synchronized_Tagged_Type (E : Entity_Id) return Boolean is
Kind : constant Entity_Kind := Ekind (Base_Type (E));
begin
-- A task or protected type derived from an interface is a tagged type.
-- Such a tagged type is called a synchronized tagged type, as are
-- synchronized interfaces and private extensions whose declaration
-- includes the reserved word synchronized.
return (Is_Tagged_Type (E)
and then (Kind = E_Task_Type
or else
Kind = E_Protected_Type))
or else
(Is_Interface (E)
and then Is_Synchronized_Interface (E))
or else
(Ekind (E) = E_Record_Type_With_Private
and then Nkind (Parent (E)) = N_Private_Extension_Declaration
and then (Synchronized_Present (Parent (E))
or else Is_Synchronized_Interface (Etype (E))));
end Is_Synchronized_Tagged_Type;
-----------------
-- Is_Transfer --
-----------------
function Is_Transfer (N : Node_Id) return Boolean is
Kind : constant Node_Kind := Nkind (N);
begin
if Kind = N_Simple_Return_Statement
or else
Kind = N_Extended_Return_Statement
or else
Kind = N_Goto_Statement
or else
Kind = N_Raise_Statement
or else
Kind = N_Requeue_Statement
then
return True;
elsif (Kind = N_Exit_Statement or else Kind in N_Raise_xxx_Error)
and then No (Condition (N))
then
return True;
elsif Kind = N_Procedure_Call_Statement
and then Is_Entity_Name (Name (N))
and then Present (Entity (Name (N)))
and then No_Return (Entity (Name (N)))
then
return True;
elsif Nkind (Original_Node (N)) = N_Raise_Statement then
return True;
else
return False;
end if;
end Is_Transfer;
-------------
-- Is_True --
-------------
function Is_True (U : Uint) return Boolean is
begin
return (U /= 0);
end Is_True;
--------------------------------------
-- Is_Unchecked_Conversion_Instance --
--------------------------------------
function Is_Unchecked_Conversion_Instance (Id : Entity_Id) return Boolean is
Par : Node_Id;
begin
-- Look for a function whose generic parent is the predefined intrinsic
-- function Unchecked_Conversion, or for one that renames such an
-- instance.
if Ekind (Id) = E_Function then
Par := Parent (Id);
if Nkind (Par) = N_Function_Specification then
Par := Generic_Parent (Par);
if Present (Par) then
return
Chars (Par) = Name_Unchecked_Conversion
and then Is_Intrinsic_Subprogram (Par)
and then Is_Predefined_File_Name
(Unit_File_Name (Get_Source_Unit (Par)));
else
return
Present (Alias (Id))
and then Is_Unchecked_Conversion_Instance (Alias (Id));
end if;
end if;
end if;
return False;
end Is_Unchecked_Conversion_Instance;
-------------------------------
-- Is_Universal_Numeric_Type --
-------------------------------
function Is_Universal_Numeric_Type (T : Entity_Id) return Boolean is
begin
return T = Universal_Integer or else T = Universal_Real;
end Is_Universal_Numeric_Type;
----------------------------
-- Is_Variable_Size_Array --
----------------------------
function Is_Variable_Size_Array (E : Entity_Id) return Boolean is
Idx : Node_Id;
begin
pragma Assert (Is_Array_Type (E));
-- Check if some index is initialized with a non-constant value
Idx := First_Index (E);
while Present (Idx) loop
if Nkind (Idx) = N_Range then
if not Is_Constant_Bound (Low_Bound (Idx))
or else not Is_Constant_Bound (High_Bound (Idx))
then
return True;
end if;
end if;
Idx := Next_Index (Idx);
end loop;
return False;
end Is_Variable_Size_Array;
-----------------------------
-- Is_Variable_Size_Record --
-----------------------------
function Is_Variable_Size_Record (E : Entity_Id) return Boolean is
Comp : Entity_Id;
Comp_Typ : Entity_Id;
begin
pragma Assert (Is_Record_Type (E));
Comp := First_Entity (E);
while Present (Comp) loop
Comp_Typ := Etype (Comp);
-- Recursive call if the record type has discriminants
if Is_Record_Type (Comp_Typ)
and then Has_Discriminants (Comp_Typ)
and then Is_Variable_Size_Record (Comp_Typ)
then
return True;
elsif Is_Array_Type (Comp_Typ)
and then Is_Variable_Size_Array (Comp_Typ)
then
return True;
end if;
Next_Entity (Comp);
end loop;
return False;
end Is_Variable_Size_Record;
-----------------
-- Is_Variable --
-----------------
function Is_Variable
(N : Node_Id;
Use_Original_Node : Boolean := True) return Boolean
is
Orig_Node : Node_Id;
function In_Protected_Function (E : Entity_Id) return Boolean;
-- Within a protected function, the private components of the enclosing
-- protected type are constants. A function nested within a (protected)
-- procedure is not itself protected. Within the body of a protected
-- function the current instance of the protected type is a constant.
function Is_Variable_Prefix (P : Node_Id) return Boolean;
-- Prefixes can involve implicit dereferences, in which case we must
-- test for the case of a reference of a constant access type, which can
-- can never be a variable.
---------------------------
-- In_Protected_Function --
---------------------------
function In_Protected_Function (E : Entity_Id) return Boolean is
Prot : Entity_Id;
S : Entity_Id;
begin
-- E is the current instance of a type
if Is_Type (E) then
Prot := E;
-- E is an object
else
Prot := Scope (E);
end if;
if not Is_Protected_Type (Prot) then
return False;
else
S := Current_Scope;
while Present (S) and then S /= Prot loop
if Ekind (S) = E_Function and then Scope (S) = Prot then
return True;
end if;
S := Scope (S);
end loop;
return False;
end if;
end In_Protected_Function;
------------------------
-- Is_Variable_Prefix --
------------------------
function Is_Variable_Prefix (P : Node_Id) return Boolean is
begin
if Is_Access_Type (Etype (P)) then
return not Is_Access_Constant (Root_Type (Etype (P)));
-- For the case of an indexed component whose prefix has a packed
-- array type, the prefix has been rewritten into a type conversion.
-- Determine variable-ness from the converted expression.
elsif Nkind (P) = N_Type_Conversion
and then not Comes_From_Source (P)
and then Is_Array_Type (Etype (P))
and then Is_Packed (Etype (P))
then
return Is_Variable (Expression (P));
else
return Is_Variable (P);
end if;
end Is_Variable_Prefix;
-- Start of processing for Is_Variable
begin
-- Special check, allow x'Deref(expr) as a variable
if Nkind (N) = N_Attribute_Reference
and then Attribute_Name (N) = Name_Deref
then
return True;
end if;
-- Check if we perform the test on the original node since this may be a
-- test of syntactic categories which must not be disturbed by whatever
-- rewriting might have occurred. For example, an aggregate, which is
-- certainly NOT a variable, could be turned into a variable by
-- expansion.
if Use_Original_Node then
Orig_Node := Original_Node (N);
else
Orig_Node := N;
end if;
-- Definitely OK if Assignment_OK is set. Since this is something that
-- only gets set for expanded nodes, the test is on N, not Orig_Node.
if Nkind (N) in N_Subexpr and then Assignment_OK (N) then
return True;
-- Normally we go to the original node, but there is one exception where
-- we use the rewritten node, namely when it is an explicit dereference.
-- The generated code may rewrite a prefix which is an access type with
-- an explicit dereference. The dereference is a variable, even though
-- the original node may not be (since it could be a constant of the
-- access type).
-- In Ada 2005 we have a further case to consider: the prefix may be a
-- function call given in prefix notation. The original node appears to
-- be a selected component, but we need to examine the call.
elsif Nkind (N) = N_Explicit_Dereference
and then Nkind (Orig_Node) /= N_Explicit_Dereference
and then Present (Etype (Orig_Node))
and then Is_Access_Type (Etype (Orig_Node))
then
-- Note that if the prefix is an explicit dereference that does not
-- come from source, we must check for a rewritten function call in
-- prefixed notation before other forms of rewriting, to prevent a
-- compiler crash.
return
(Nkind (Orig_Node) = N_Function_Call
and then not Is_Access_Constant (Etype (Prefix (N))))
or else
Is_Variable_Prefix (Original_Node (Prefix (N)));
-- in Ada 2012, the dereference may have been added for a type with
-- a declared implicit dereference aspect. Check that it is not an
-- access to constant.
elsif Nkind (N) = N_Explicit_Dereference
and then Present (Etype (Orig_Node))
and then Ada_Version >= Ada_2012
and then Has_Implicit_Dereference (Etype (Orig_Node))
then
return not Is_Access_Constant (Etype (Prefix (N)));
-- A function call is never a variable
elsif Nkind (N) = N_Function_Call then
return False;
-- All remaining checks use the original node
elsif Is_Entity_Name (Orig_Node)
and then Present (Entity (Orig_Node))
then
declare
E : constant Entity_Id := Entity (Orig_Node);
K : constant Entity_Kind := Ekind (E);
begin
return (K = E_Variable
and then Nkind (Parent (E)) /= N_Exception_Handler)
or else (K = E_Component
and then not In_Protected_Function (E))
or else K = E_Out_Parameter
or else K = E_In_Out_Parameter
or else K = E_Generic_In_Out_Parameter
-- Current instance of type. If this is a protected type, check
-- we are not within the body of one of its protected functions.
or else (Is_Type (E)
and then In_Open_Scopes (E)
and then not In_Protected_Function (E))
or else (Is_Incomplete_Or_Private_Type (E)
and then In_Open_Scopes (Full_View (E)));
end;
else
case Nkind (Orig_Node) is
when N_Indexed_Component
| N_Slice
=>
return Is_Variable_Prefix (Prefix (Orig_Node));
when N_Selected_Component =>
return (Is_Variable (Selector_Name (Orig_Node))
and then Is_Variable_Prefix (Prefix (Orig_Node)))
or else
(Nkind (N) = N_Expanded_Name
and then Scope (Entity (N)) = Entity (Prefix (N)));
-- For an explicit dereference, the type of the prefix cannot
-- be an access to constant or an access to subprogram.
when N_Explicit_Dereference =>
declare
Typ : constant Entity_Id := Etype (Prefix (Orig_Node));
begin
return Is_Access_Type (Typ)
and then not Is_Access_Constant (Root_Type (Typ))
and then Ekind (Typ) /= E_Access_Subprogram_Type;
end;
-- The type conversion is the case where we do not deal with the
-- context dependent special case of an actual parameter. Thus
-- the type conversion is only considered a variable for the
-- purposes of this routine if the target type is tagged. However,
-- a type conversion is considered to be a variable if it does not
-- come from source (this deals for example with the conversions
-- of expressions to their actual subtypes).
when N_Type_Conversion =>
return Is_Variable (Expression (Orig_Node))
and then
(not Comes_From_Source (Orig_Node)
or else
(Is_Tagged_Type (Etype (Subtype_Mark (Orig_Node)))
and then
Is_Tagged_Type (Etype (Expression (Orig_Node)))));
-- GNAT allows an unchecked type conversion as a variable. This
-- only affects the generation of internal expanded code, since
-- calls to instantiations of Unchecked_Conversion are never
-- considered variables (since they are function calls).
when N_Unchecked_Type_Conversion =>
return Is_Variable (Expression (Orig_Node));
when others =>
return False;
end case;
end if;
end Is_Variable;
------------------------------
-- Is_Verifiable_DIC_Pragma --
------------------------------
function Is_Verifiable_DIC_Pragma (Prag : Node_Id) return Boolean is
Args : constant List_Id := Pragma_Argument_Associations (Prag);
begin
-- To qualify as verifiable, a DIC pragma must have a non-null argument
return
Present (Args)
and then Nkind (Get_Pragma_Arg (First (Args))) /= N_Null;
end Is_Verifiable_DIC_Pragma;
---------------------------
-- Is_Visibly_Controlled --
---------------------------
function Is_Visibly_Controlled (T : Entity_Id) return Boolean is
Root : constant Entity_Id := Root_Type (T);
begin
return Chars (Scope (Root)) = Name_Finalization
and then Chars (Scope (Scope (Root))) = Name_Ada
and then Scope (Scope (Scope (Root))) = Standard_Standard;
end Is_Visibly_Controlled;
--------------------------
-- Is_Volatile_Function --
--------------------------
function Is_Volatile_Function (Func_Id : Entity_Id) return Boolean is
begin
pragma Assert (Ekind_In (Func_Id, E_Function, E_Generic_Function));
-- A function declared within a protected type is volatile
if Is_Protected_Type (Scope (Func_Id)) then
return True;
-- An instance of Ada.Unchecked_Conversion is a volatile function if
-- either the source or the target are effectively volatile.
elsif Is_Unchecked_Conversion_Instance (Func_Id)
and then Has_Effectively_Volatile_Profile (Func_Id)
then
return True;
-- Otherwise the function is treated as volatile if it is subject to
-- enabled pragma Volatile_Function.
else
return
Is_Enabled_Pragma (Get_Pragma (Func_Id, Pragma_Volatile_Function));
end if;
end Is_Volatile_Function;
------------------------
-- Is_Volatile_Object --
------------------------
function Is_Volatile_Object (N : Node_Id) return Boolean is
function Is_Volatile_Prefix (N : Node_Id) return Boolean;
-- If prefix is an implicit dereference, examine designated type
function Object_Has_Volatile_Components (N : Node_Id) return Boolean;
-- Determines if given object has volatile components
------------------------
-- Is_Volatile_Prefix --
------------------------
function Is_Volatile_Prefix (N : Node_Id) return Boolean is
Typ : constant Entity_Id := Etype (N);
begin
if Is_Access_Type (Typ) then
declare
Dtyp : constant Entity_Id := Designated_Type (Typ);
begin
return Is_Volatile (Dtyp)
or else Has_Volatile_Components (Dtyp);
end;
else
return Object_Has_Volatile_Components (N);
end if;
end Is_Volatile_Prefix;
------------------------------------
-- Object_Has_Volatile_Components --
------------------------------------
function Object_Has_Volatile_Components (N : Node_Id) return Boolean is
Typ : constant Entity_Id := Etype (N);
begin
if Is_Volatile (Typ)
or else Has_Volatile_Components (Typ)
then
return True;
elsif Is_Entity_Name (N)
and then (Has_Volatile_Components (Entity (N))
or else Is_Volatile (Entity (N)))
then
return True;
elsif Nkind (N) = N_Indexed_Component
or else Nkind (N) = N_Selected_Component
then
return Is_Volatile_Prefix (Prefix (N));
else
return False;
end if;
end Object_Has_Volatile_Components;
-- Start of processing for Is_Volatile_Object
begin
if Nkind (N) = N_Defining_Identifier then
return Is_Volatile (N) or else Is_Volatile (Etype (N));
elsif Nkind (N) = N_Expanded_Name then
return Is_Volatile_Object (Entity (N));
elsif Is_Volatile (Etype (N))
or else (Is_Entity_Name (N) and then Is_Volatile (Entity (N)))
then
return True;
elsif Nkind_In (N, N_Indexed_Component, N_Selected_Component)
and then Is_Volatile_Prefix (Prefix (N))
then
return True;
elsif Nkind (N) = N_Selected_Component
and then Is_Volatile (Entity (Selector_Name (N)))
then
return True;
else
return False;
end if;
end Is_Volatile_Object;
---------------------------
-- Itype_Has_Declaration --
---------------------------
function Itype_Has_Declaration (Id : Entity_Id) return Boolean is
begin
pragma Assert (Is_Itype (Id));
return Present (Parent (Id))
and then Nkind_In (Parent (Id), N_Full_Type_Declaration,
N_Subtype_Declaration)
and then Defining_Entity (Parent (Id)) = Id;
end Itype_Has_Declaration;
-------------------------
-- Kill_Current_Values --
-------------------------
procedure Kill_Current_Values
(Ent : Entity_Id;
Last_Assignment_Only : Boolean := False)
is
begin
if Is_Assignable (Ent) then
Set_Last_Assignment (Ent, Empty);
end if;
if Is_Object (Ent) then
if not Last_Assignment_Only then
Kill_Checks (Ent);
Set_Current_Value (Ent, Empty);
-- Do not reset the Is_Known_[Non_]Null and Is_Known_Valid flags
-- for a constant. Once the constant is elaborated, its value is
-- not changed, therefore the associated flags that describe the
-- value should not be modified either.
if Ekind (Ent) = E_Constant then
null;
-- Non-constant entities
else
if not Can_Never_Be_Null (Ent) then
Set_Is_Known_Non_Null (Ent, False);
end if;
Set_Is_Known_Null (Ent, False);
-- Reset the Is_Known_Valid flag unless the type is always
-- valid. This does not apply to a loop parameter because its
-- bounds are defined by the loop header and therefore always
-- valid.
if not Is_Known_Valid (Etype (Ent))
and then Ekind (Ent) /= E_Loop_Parameter
then
Set_Is_Known_Valid (Ent, False);
end if;
end if;
end if;
end if;
end Kill_Current_Values;
procedure Kill_Current_Values (Last_Assignment_Only : Boolean := False) is
S : Entity_Id;
procedure Kill_Current_Values_For_Entity_Chain (E : Entity_Id);
-- Clear current value for entity E and all entities chained to E
------------------------------------------
-- Kill_Current_Values_For_Entity_Chain --
------------------------------------------
procedure Kill_Current_Values_For_Entity_Chain (E : Entity_Id) is
Ent : Entity_Id;
begin
Ent := E;
while Present (Ent) loop
Kill_Current_Values (Ent, Last_Assignment_Only);
Next_Entity (Ent);
end loop;
end Kill_Current_Values_For_Entity_Chain;
-- Start of processing for Kill_Current_Values
begin
-- Kill all saved checks, a special case of killing saved values
if not Last_Assignment_Only then
Kill_All_Checks;
end if;
-- Loop through relevant scopes, which includes the current scope and
-- any parent scopes if the current scope is a block or a package.
S := Current_Scope;
Scope_Loop : loop
-- Clear current values of all entities in current scope
Kill_Current_Values_For_Entity_Chain (First_Entity (S));
-- If scope is a package, also clear current values of all private
-- entities in the scope.
if Is_Package_Or_Generic_Package (S)
or else Is_Concurrent_Type (S)
then
Kill_Current_Values_For_Entity_Chain (First_Private_Entity (S));
end if;
-- If this is a not a subprogram, deal with parents
if not Is_Subprogram (S) then
S := Scope (S);
exit Scope_Loop when S = Standard_Standard;
else
exit Scope_Loop;
end if;
end loop Scope_Loop;
end Kill_Current_Values;
--------------------------
-- Kill_Size_Check_Code --
--------------------------
procedure Kill_Size_Check_Code (E : Entity_Id) is
begin
if (Ekind (E) = E_Constant or else Ekind (E) = E_Variable)
and then Present (Size_Check_Code (E))
then
Remove (Size_Check_Code (E));
Set_Size_Check_Code (E, Empty);
end if;
end Kill_Size_Check_Code;
--------------------------
-- Known_To_Be_Assigned --
--------------------------
function Known_To_Be_Assigned (N : Node_Id) return Boolean is
P : constant Node_Id := Parent (N);
begin
case Nkind (P) is
-- Test left side of assignment
when N_Assignment_Statement =>
return N = Name (P);
-- Function call arguments are never lvalues
when N_Function_Call =>
return False;
-- Positional parameter for procedure or accept call
when N_Accept_Statement
| N_Procedure_Call_Statement
=>
declare
Proc : Entity_Id;
Form : Entity_Id;
Act : Node_Id;
begin
Proc := Get_Subprogram_Entity (P);
if No (Proc) then
return False;
end if;
-- If we are not a list member, something is strange, so
-- be conservative and return False.
if not Is_List_Member (N) then
return False;
end if;
-- We are going to find the right formal by stepping forward
-- through the formals, as we step backwards in the actuals.
Form := First_Formal (Proc);
Act := N;
loop
-- If no formal, something is weird, so be conservative
-- and return False.
if No (Form) then
return False;
end if;
Prev (Act);
exit when No (Act);
Next_Formal (Form);
end loop;
return Ekind (Form) /= E_In_Parameter;
end;
-- Named parameter for procedure or accept call
when N_Parameter_Association =>
declare
Proc : Entity_Id;
Form : Entity_Id;
begin
Proc := Get_Subprogram_Entity (Parent (P));
if No (Proc) then
return False;
end if;
-- Loop through formals to find the one that matches
Form := First_Formal (Proc);
loop
-- If no matching formal, that's peculiar, some kind of
-- previous error, so return False to be conservative.
-- Actually this also happens in legal code in the case
-- where P is a parameter association for an Extra_Formal???
if No (Form) then
return False;
end if;
-- Else test for match
if Chars (Form) = Chars (Selector_Name (P)) then
return Ekind (Form) /= E_In_Parameter;
end if;
Next_Formal (Form);
end loop;
end;
-- Test for appearing in a conversion that itself appears
-- in an lvalue context, since this should be an lvalue.
when N_Type_Conversion =>
return Known_To_Be_Assigned (P);
-- All other references are definitely not known to be modifications
when others =>
return False;
end case;
end Known_To_Be_Assigned;
---------------------------
-- Last_Source_Statement --
---------------------------
function Last_Source_Statement (HSS : Node_Id) return Node_Id is
N : Node_Id;
begin
N := Last (Statements (HSS));
while Present (N) loop
exit when Comes_From_Source (N);
Prev (N);
end loop;
return N;
end Last_Source_Statement;
----------------------------------
-- Matching_Static_Array_Bounds --
----------------------------------
function Matching_Static_Array_Bounds
(L_Typ : Node_Id;
R_Typ : Node_Id) return Boolean
is
L_Ndims : constant Nat := Number_Dimensions (L_Typ);
R_Ndims : constant Nat := Number_Dimensions (R_Typ);
L_Index : Node_Id;
R_Index : Node_Id;
L_Low : Node_Id;
L_High : Node_Id;
L_Len : Uint;
R_Low : Node_Id;
R_High : Node_Id;
R_Len : Uint;
begin
if L_Ndims /= R_Ndims then
return False;
end if;
-- Unconstrained types do not have static bounds
if not Is_Constrained (L_Typ) or else not Is_Constrained (R_Typ) then
return False;
end if;
-- First treat specially the first dimension, as the lower bound and
-- length of string literals are not stored like those of arrays.
if Ekind (L_Typ) = E_String_Literal_Subtype then
L_Low := String_Literal_Low_Bound (L_Typ);
L_Len := String_Literal_Length (L_Typ);
else
L_Index := First_Index (L_Typ);
Get_Index_Bounds (L_Index, L_Low, L_High);
if Is_OK_Static_Expression (L_Low)
and then
Is_OK_Static_Expression (L_High)
then
if Expr_Value (L_High) < Expr_Value (L_Low) then
L_Len := Uint_0;
else
L_Len := (Expr_Value (L_High) - Expr_Value (L_Low)) + 1;
end if;
else
return False;
end if;
end if;
if Ekind (R_Typ) = E_String_Literal_Subtype then
R_Low := String_Literal_Low_Bound (R_Typ);
R_Len := String_Literal_Length (R_Typ);
else
R_Index := First_Index (R_Typ);
Get_Index_Bounds (R_Index, R_Low, R_High);
if Is_OK_Static_Expression (R_Low)
and then
Is_OK_Static_Expression (R_High)
then
if Expr_Value (R_High) < Expr_Value (R_Low) then
R_Len := Uint_0;
else
R_Len := (Expr_Value (R_High) - Expr_Value (R_Low)) + 1;
end if;
else
return False;
end if;
end if;
if (Is_OK_Static_Expression (L_Low)
and then
Is_OK_Static_Expression (R_Low))
and then Expr_Value (L_Low) = Expr_Value (R_Low)
and then L_Len = R_Len
then
null;
else
return False;
end if;
-- Then treat all other dimensions
for Indx in 2 .. L_Ndims loop
Next (L_Index);
Next (R_Index);
Get_Index_Bounds (L_Index, L_Low, L_High);
Get_Index_Bounds (R_Index, R_Low, R_High);
if (Is_OK_Static_Expression (L_Low) and then
Is_OK_Static_Expression (L_High) and then
Is_OK_Static_Expression (R_Low) and then
Is_OK_Static_Expression (R_High))
and then (Expr_Value (L_Low) = Expr_Value (R_Low)
and then
Expr_Value (L_High) = Expr_Value (R_High))
then
null;
else
return False;
end if;
end loop;
-- If we fall through the loop, all indexes matched
return True;
end Matching_Static_Array_Bounds;
-------------------
-- May_Be_Lvalue --
-------------------
function May_Be_Lvalue (N : Node_Id) return Boolean is
P : constant Node_Id := Parent (N);
begin
case Nkind (P) is
-- Test left side of assignment
when N_Assignment_Statement =>
return N = Name (P);
-- Test prefix of component or attribute. Note that the prefix of an
-- explicit or implicit dereference cannot be an l-value. In the case
-- of a 'Read attribute, the reference can be an actual in the
-- argument list of the attribute.
when N_Attribute_Reference =>
return (N = Prefix (P)
and then Name_Implies_Lvalue_Prefix (Attribute_Name (P)))
or else
Attribute_Name (P) = Name_Read;
-- For an expanded name, the name is an lvalue if the expanded name
-- is an lvalue, but the prefix is never an lvalue, since it is just
-- the scope where the name is found.
when N_Expanded_Name =>
if N = Prefix (P) then
return May_Be_Lvalue (P);
else
return False;
end if;
-- For a selected component A.B, A is certainly an lvalue if A.B is.
-- B is a little interesting, if we have A.B := 3, there is some
-- discussion as to whether B is an lvalue or not, we choose to say
-- it is. Note however that A is not an lvalue if it is of an access
-- type since this is an implicit dereference.
when N_Selected_Component =>
if N = Prefix (P)
and then Present (Etype (N))
and then Is_Access_Type (Etype (N))
then
return False;
else
return May_Be_Lvalue (P);
end if;
-- For an indexed component or slice, the index or slice bounds is
-- never an lvalue. The prefix is an lvalue if the indexed component
-- or slice is an lvalue, except if it is an access type, where we
-- have an implicit dereference.
when N_Indexed_Component
| N_Slice
=>
if N /= Prefix (P)
or else (Present (Etype (N)) and then Is_Access_Type (Etype (N)))
then
return False;
else
return May_Be_Lvalue (P);
end if;
-- Prefix of a reference is an lvalue if the reference is an lvalue
when N_Reference =>
return May_Be_Lvalue (P);
-- Prefix of explicit dereference is never an lvalue
when N_Explicit_Dereference =>
return False;
-- Positional parameter for subprogram, entry, or accept call.
-- In older versions of Ada function call arguments are never
-- lvalues. In Ada 2012 functions can have in-out parameters.
when N_Accept_Statement
| N_Entry_Call_Statement
| N_Subprogram_Call
=>
if Nkind (P) = N_Function_Call and then Ada_Version < Ada_2012 then
return False;
end if;
-- The following mechanism is clumsy and fragile. A single flag
-- set in Resolve_Actuals would be preferable ???
declare
Proc : Entity_Id;
Form : Entity_Id;
Act : Node_Id;
begin
Proc := Get_Subprogram_Entity (P);
if No (Proc) then
return True;
end if;
-- If we are not a list member, something is strange, so be
-- conservative and return True.
if not Is_List_Member (N) then
return True;
end if;
-- We are going to find the right formal by stepping forward
-- through the formals, as we step backwards in the actuals.
Form := First_Formal (Proc);
Act := N;
loop
-- If no formal, something is weird, so be conservative and
-- return True.
if No (Form) then
return True;
end if;
Prev (Act);
exit when No (Act);
Next_Formal (Form);
end loop;
return Ekind (Form) /= E_In_Parameter;
end;
-- Named parameter for procedure or accept call
when N_Parameter_Association =>
declare
Proc : Entity_Id;
Form : Entity_Id;
begin
Proc := Get_Subprogram_Entity (Parent (P));
if No (Proc) then
return True;
end if;
-- Loop through formals to find the one that matches
Form := First_Formal (Proc);
loop
-- If no matching formal, that's peculiar, some kind of
-- previous error, so return True to be conservative.
-- Actually happens with legal code for an unresolved call
-- where we may get the wrong homonym???
if No (Form) then
return True;
end if;
-- Else test for match
if Chars (Form) = Chars (Selector_Name (P)) then
return Ekind (Form) /= E_In_Parameter;
end if;
Next_Formal (Form);
end loop;
end;
-- Test for appearing in a conversion that itself appears in an
-- lvalue context, since this should be an lvalue.
when N_Type_Conversion =>
return May_Be_Lvalue (P);
-- Test for appearance in object renaming declaration
when N_Object_Renaming_Declaration =>
return True;
-- All other references are definitely not lvalues
when others =>
return False;
end case;
end May_Be_Lvalue;
-----------------------
-- Mark_Coextensions --
-----------------------
procedure Mark_Coextensions (Context_Nod : Node_Id; Root_Nod : Node_Id) is
Is_Dynamic : Boolean;
-- Indicates whether the context causes nested coextensions to be
-- dynamic or static
function Mark_Allocator (N : Node_Id) return Traverse_Result;
-- Recognize an allocator node and label it as a dynamic coextension
--------------------
-- Mark_Allocator --
--------------------
function Mark_Allocator (N : Node_Id) return Traverse_Result is
begin
if Nkind (N) = N_Allocator then
if Is_Dynamic then
Set_Is_Dynamic_Coextension (N);
-- If the allocator expression is potentially dynamic, it may
-- be expanded out of order and require dynamic allocation
-- anyway, so we treat the coextension itself as dynamic.
-- Potential optimization ???
elsif Nkind (Expression (N)) = N_Qualified_Expression
and then Nkind (Expression (Expression (N))) = N_Op_Concat
then
Set_Is_Dynamic_Coextension (N);
else
Set_Is_Static_Coextension (N);
end if;
end if;
return OK;
end Mark_Allocator;
procedure Mark_Allocators is new Traverse_Proc (Mark_Allocator);
-- Start of processing for Mark_Coextensions
begin
-- An allocator that appears on the right-hand side of an assignment is
-- treated as a potentially dynamic coextension when the right-hand side
-- is an allocator or a qualified expression.
-- Obj := new ...'(new Coextension ...);
if Nkind (Context_Nod) = N_Assignment_Statement then
Is_Dynamic :=
Nkind_In (Expression (Context_Nod), N_Allocator,
N_Qualified_Expression);
-- An allocator that appears within the expression of a simple return
-- statement is treated as a potentially dynamic coextension when the
-- expression is either aggregate, allocator, or qualified expression.
-- return (new Coextension ...);
-- return new ...'(new Coextension ...);
elsif Nkind (Context_Nod) = N_Simple_Return_Statement then
Is_Dynamic :=
Nkind_In (Expression (Context_Nod), N_Aggregate,
N_Allocator,
N_Qualified_Expression);
-- An allocator that appears within the initialization expression of an
-- object declaration is considered a potentially dynamic coextension
-- when the initialization expression is an allocator or a qualified
-- expression.
-- Obj : ... := new ...'(new Coextension ...);
-- A similar case arises when the object declaration is part of an
-- extended return statement.
-- return Obj : ... := new ...'(new Coextension ...);
-- return Obj : ... := (new Coextension ...);
elsif Nkind (Context_Nod) = N_Object_Declaration then
Is_Dynamic :=
Nkind_In (Root_Nod, N_Allocator, N_Qualified_Expression)
or else
Nkind (Parent (Context_Nod)) = N_Extended_Return_Statement;
-- This routine should not be called with constructs that cannot contain
-- coextensions.
else
raise Program_Error;
end if;
Mark_Allocators (Root_Nod);
end Mark_Coextensions;
----------------------
-- Needs_One_Actual --
----------------------
function Needs_One_Actual (E : Entity_Id) return Boolean is
Formal : Entity_Id;
begin
-- Ada 2005 or later, and formals present
if Ada_Version >= Ada_2005
and then Present (First_Formal (E))
and then No (Default_Value (First_Formal (E)))
then
Formal := Next_Formal (First_Formal (E));
while Present (Formal) loop
if No (Default_Value (Formal)) then
return False;
end if;
Next_Formal (Formal);
end loop;
return True;
-- Ada 83/95 or no formals
else
return False;
end if;
end Needs_One_Actual;
------------------------
-- New_Copy_List_Tree --
------------------------
function New_Copy_List_Tree (List : List_Id) return List_Id is
NL : List_Id;
E : Node_Id;
begin
if List = No_List then
return No_List;
else
NL := New_List;
E := First (List);
while Present (E) loop
Append (New_Copy_Tree (E), NL);
E := Next (E);
end loop;
return NL;
end if;
end New_Copy_List_Tree;
-------------------
-- New_Copy_Tree --
-------------------
function New_Copy_Tree
(Source : Node_Id;
Map : Elist_Id := No_Elist;
New_Sloc : Source_Ptr := No_Location;
New_Scope : Entity_Id := Empty) return Node_Id
is
------------------------------------
-- Auxiliary Data and Subprograms --
------------------------------------
use Atree.Unchecked_Access;
use Atree_Private_Part;
-- Our approach here requires a two pass traversal of the tree. The
-- first pass visits all nodes that eventually will be copied looking
-- for defining Itypes. If any defining Itypes are found, then they are
-- copied, and an entry is added to the replacement map. In the second
-- phase, the tree is copied, using the replacement map to replace any
-- Itype references within the copied tree.
-- The following hash tables are used if the Map supplied has more than
-- hash threshold entries to speed up access to the map. If there are
-- fewer entries, then the map is searched sequentially (because setting
-- up a hash table for only a few entries takes more time than it saves.
subtype NCT_Header_Num is Int range 0 .. 511;
-- Defines range of headers in hash tables (512 headers)
function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num;
-- Hash function used for hash operations
---------------
-- NCT_Assoc --
---------------
-- The hash table NCT_Assoc associates old entities in the table with
-- their corresponding new entities (i.e. the pairs of entries presented
-- in the original Map argument are Key-Element pairs).
package NCT_Assoc is new Simple_HTable (
Header_Num => NCT_Header_Num,
Element => Entity_Id,
No_Element => Empty,
Key => Entity_Id,
Hash => New_Copy_Hash,
Equal => Types."=");
---------------------
-- NCT_Itype_Assoc --
---------------------
-- The hash table NCT_Itype_Assoc contains entries only for those old
-- nodes which have a non-empty Associated_Node_For_Itype set. The key
-- is the associated node, and the element is the new node itself (NOT
-- the associated node for the new node).
package NCT_Itype_Assoc is new Simple_HTable (
Header_Num => NCT_Header_Num,
Element => Entity_Id,
No_Element => Empty,
Key => Entity_Id,
Hash => New_Copy_Hash,
Equal => Types."=");
function Assoc (N : Node_Or_Entity_Id) return Node_Id;
-- Called during second phase to map entities into their corresponding
-- copies using the hash table. If the argument is not an entity, or is
-- not in the hash table, then it is returned unchanged.
procedure Build_NCT_Hash_Tables;
-- Builds hash tables.
function Copy_Elist_With_Replacement
(Old_Elist : Elist_Id) return Elist_Id;
-- Called during second phase to copy element list doing replacements
procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id);
-- Called during the second phase to process a copied Itype. The actual
-- copy happened during the first phase (so that we could make the entry
-- in the mapping), but we still have to deal with the descendants of
-- the copied Itype and copy them where necessary.
function Copy_List_With_Replacement (Old_List : List_Id) return List_Id;
-- Called during second phase to copy list doing replacements
function Copy_Node_With_Replacement (Old_Node : Node_Id) return Node_Id;
-- Called during second phase to copy node doing replacements
procedure Visit_Elist (E : Elist_Id);
-- Called during first phase to visit all elements of an Elist
procedure Visit_Field (F : Union_Id; N : Node_Id);
-- Visit a single field, recursing to call Visit_Node or Visit_List if
-- the field is a syntactic descendant of the current node (i.e. its
-- parent is Node N).
procedure Visit_Itype (Old_Itype : Entity_Id);
-- Called during first phase to visit subsidiary fields of a defining
-- Itype, and also create a copy and make an entry in the replacement
-- map for the new copy.
procedure Visit_List (L : List_Id);
-- Called during first phase to visit all elements of a List
procedure Visit_Node (N : Node_Or_Entity_Id);
-- Called during first phase to visit a node and all its subtrees
-----------
-- Assoc --
-----------
function Assoc (N : Node_Or_Entity_Id) return Node_Id is
Ent : Entity_Id;
begin
if Nkind (N) not in N_Entity then
return N;
else
Ent := NCT_Assoc.Get (Entity_Id (N));
if Present (Ent) then
return Ent;
end if;
end if;
return N;
end Assoc;
---------------------------
-- Build_NCT_Hash_Tables --
---------------------------
procedure Build_NCT_Hash_Tables is
Elmt : Elmt_Id;
Ent : Entity_Id;
begin
if No (Map) then
return;
end if;
Elmt := First_Elmt (Map);
while Present (Elmt) loop
Ent := Node (Elmt);
-- Get new entity, and associate old and new
Next_Elmt (Elmt);
NCT_Assoc.Set (Ent, Node (Elmt));
if Is_Type (Ent) then
declare
Anode : constant Entity_Id :=
Associated_Node_For_Itype (Ent);
begin
if Present (Anode) then
-- Enter a link between the associated node of the old
-- Itype and the new Itype, for updating later when node
-- is copied.
NCT_Itype_Assoc.Set (Anode, Node (Elmt));
end if;
end;
end if;
Next_Elmt (Elmt);
end loop;
end Build_NCT_Hash_Tables;
---------------------------------
-- Copy_Elist_With_Replacement --
---------------------------------
function Copy_Elist_With_Replacement
(Old_Elist : Elist_Id) return Elist_Id
is
M : Elmt_Id;
New_Elist : Elist_Id;
begin
if No (Old_Elist) then
return No_Elist;
else
New_Elist := New_Elmt_List;
M := First_Elmt (Old_Elist);
while Present (M) loop
Append_Elmt (Copy_Node_With_Replacement (Node (M)), New_Elist);
Next_Elmt (M);
end loop;
end if;
return New_Elist;
end Copy_Elist_With_Replacement;
---------------------------------
-- Copy_Itype_With_Replacement --
---------------------------------
-- This routine exactly parallels its phase one analog Visit_Itype,
procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id) is
begin
-- Translate Next_Entity, Scope, and Etype fields, in case they
-- reference entities that have been mapped into copies.
Set_Next_Entity (New_Itype, Assoc (Next_Entity (New_Itype)));
Set_Etype (New_Itype, Assoc (Etype (New_Itype)));
if Present (New_Scope) then
Set_Scope (New_Itype, New_Scope);
else
Set_Scope (New_Itype, Assoc (Scope (New_Itype)));
end if;
-- Copy referenced fields
if Is_Discrete_Type (New_Itype) then
Set_Scalar_Range (New_Itype,
Copy_Node_With_Replacement (Scalar_Range (New_Itype)));
elsif Has_Discriminants (Base_Type (New_Itype)) then
Set_Discriminant_Constraint (New_Itype,
Copy_Elist_With_Replacement
(Discriminant_Constraint (New_Itype)));
elsif Is_Array_Type (New_Itype) then
if Present (First_Index (New_Itype)) then
Set_First_Index (New_Itype,
First (Copy_List_With_Replacement
(List_Containing (First_Index (New_Itype)))));
end if;
if Is_Packed (New_Itype) then
Set_Packed_Array_Impl_Type (New_Itype,
Copy_Node_With_Replacement
(Packed_Array_Impl_Type (New_Itype)));
end if;
end if;
end Copy_Itype_With_Replacement;
--------------------------------
-- Copy_List_With_Replacement --
--------------------------------
function Copy_List_With_Replacement
(Old_List : List_Id) return List_Id
is
New_List : List_Id;
E : Node_Id;
begin
if Old_List = No_List then
return No_List;
else
New_List := Empty_List;
E := First (Old_List);
while Present (E) loop
Append (Copy_Node_With_Replacement (E), New_List);
Next (E);
end loop;
return New_List;
end if;
end Copy_List_With_Replacement;
--------------------------------
-- Copy_Node_With_Replacement --
--------------------------------
function Copy_Node_With_Replacement
(Old_Node : Node_Id) return Node_Id
is
New_Node : Node_Id;
procedure Adjust_Named_Associations
(Old_Node : Node_Id;
New_Node : Node_Id);
-- If a call node has named associations, these are chained through
-- the First_Named_Actual, Next_Named_Actual links. These must be
-- propagated separately to the new parameter list, because these
-- are not syntactic fields.
function Copy_Field_With_Replacement
(Field : Union_Id) return Union_Id;
-- Given Field, which is a field of Old_Node, return a copy of it
-- if it is a syntactic field (i.e. its parent is Node), setting
-- the parent of the copy to poit to New_Node. Otherwise returns
-- the field (possibly mapped if it is an entity).
-------------------------------
-- Adjust_Named_Associations --
-------------------------------
procedure Adjust_Named_Associations
(Old_Node : Node_Id;
New_Node : Node_Id)
is
Old_E : Node_Id;
New_E : Node_Id;
Old_Next : Node_Id;
New_Next : Node_Id;
begin
Old_E := First (Parameter_Associations (Old_Node));
New_E := First (Parameter_Associations (New_Node));
while Present (Old_E) loop
if Nkind (Old_E) = N_Parameter_Association
and then Present (Next_Named_Actual (Old_E))
then
if First_Named_Actual (Old_Node) =
Explicit_Actual_Parameter (Old_E)
then
Set_First_Named_Actual
(New_Node, Explicit_Actual_Parameter (New_E));
end if;
-- Now scan parameter list from the beginning, to locate
-- next named actual, which can be out of order.
Old_Next := First (Parameter_Associations (Old_Node));
New_Next := First (Parameter_Associations (New_Node));
while Nkind (Old_Next) /= N_Parameter_Association
or else Explicit_Actual_Parameter (Old_Next) /=
Next_Named_Actual (Old_E)
loop
Next (Old_Next);
Next (New_Next);
end loop;
Set_Next_Named_Actual
(New_E, Explicit_Actual_Parameter (New_Next));
end if;
Next (Old_E);
Next (New_E);
end loop;
end Adjust_Named_Associations;
---------------------------------
-- Copy_Field_With_Replacement --
---------------------------------
function Copy_Field_With_Replacement
(Field : Union_Id) return Union_Id
is
begin
if Field = Union_Id (Empty) then
return Field;
elsif Field in Node_Range then
declare
Old_N : constant Node_Id := Node_Id (Field);
New_N : Node_Id;
begin
-- If syntactic field, as indicated by the parent pointer
-- being set, then copy the referenced node recursively.
if Parent (Old_N) = Old_Node then
New_N := Copy_Node_With_Replacement (Old_N);
if New_N /= Old_N then
Set_Parent (New_N, New_Node);
end if;
-- For semantic fields, update possible entity reference
-- from the replacement map.
else
New_N := Assoc (Old_N);
end if;
return Union_Id (New_N);
end;
elsif Field in List_Range then
declare
Old_L : constant List_Id := List_Id (Field);
New_L : List_Id;
begin
-- If syntactic field, as indicated by the parent pointer,
-- then recursively copy the entire referenced list.
if Parent (Old_L) = Old_Node then
New_L := Copy_List_With_Replacement (Old_L);
Set_Parent (New_L, New_Node);
-- For semantic list, just returned unchanged
else
New_L := Old_L;
end if;
return Union_Id (New_L);
end;
-- Anything other than a list or a node is returned unchanged
else
return Field;
end if;
end Copy_Field_With_Replacement;
-- Start of processing for Copy_Node_With_Replacement
begin
if Old_Node <= Empty_Or_Error then
return Old_Node;
elsif Nkind (Old_Node) in N_Entity then
return Assoc (Old_Node);
else
New_Node := New_Copy (Old_Node);
-- If the node we are copying is the associated node of a
-- previously copied Itype, then adjust the associated node
-- of the copy of that Itype accordingly.
declare
Ent : constant Entity_Id := NCT_Itype_Assoc.Get (Old_Node);
begin
if Present (Ent) then
Set_Associated_Node_For_Itype (Ent, New_Node);
end if;
end;
-- Recursively copy descendants
Set_Field1
(New_Node, Copy_Field_With_Replacement (Field1 (New_Node)));
Set_Field2
(New_Node, Copy_Field_With_Replacement (Field2 (New_Node)));
Set_Field3
(New_Node, Copy_Field_With_Replacement (Field3 (New_Node)));
Set_Field4
(New_Node, Copy_Field_With_Replacement (Field4 (New_Node)));
Set_Field5
(New_Node, Copy_Field_With_Replacement (Field5 (New_Node)));
-- Adjust Sloc of new node if necessary
if New_Sloc /= No_Location then
Set_Sloc (New_Node, New_Sloc);
-- If we adjust the Sloc, then we are essentially making a
-- completely new node, so the Comes_From_Source flag should
-- be reset to the proper default value.
Set_Comes_From_Source
(New_Node, Default_Node.Comes_From_Source);
end if;
-- If the node is a call and has named associations, set the
-- corresponding links in the copy.
if Nkind_In (Old_Node, N_Entry_Call_Statement,
N_Function_Call,
N_Procedure_Call_Statement)
and then Present (First_Named_Actual (Old_Node))
then
Adjust_Named_Associations (Old_Node, New_Node);
end if;
-- Reset First_Real_Statement for Handled_Sequence_Of_Statements.
-- The replacement mechanism applies to entities, and is not used
-- here. Eventually we may need a more general graph-copying
-- routine. For now, do a sequential search to find desired node.
if Nkind (Old_Node) = N_Handled_Sequence_Of_Statements
and then Present (First_Real_Statement (Old_Node))
then
declare
Old_F : constant Node_Id := First_Real_Statement (Old_Node);
N1, N2 : Node_Id;
begin
N1 := First (Statements (Old_Node));
N2 := First (Statements (New_Node));
while N1 /= Old_F loop
Next (N1);
Next (N2);
end loop;
Set_First_Real_Statement (New_Node, N2);
end;
end if;
end if;
-- All done, return copied node
return New_Node;
end Copy_Node_With_Replacement;
-------------------
-- New_Copy_Hash --
-------------------
function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num is
begin
return Nat (E) mod (NCT_Header_Num'Last + 1);
end New_Copy_Hash;
-----------------
-- Visit_Elist --
-----------------
procedure Visit_Elist (E : Elist_Id) is
Elmt : Elmt_Id;
begin
if Present (E) then
Elmt := First_Elmt (E);
while Elmt /= No_Elmt loop
Visit_Node (Node (Elmt));
Next_Elmt (Elmt);
end loop;
end if;
end Visit_Elist;
-----------------
-- Visit_Field --
-----------------
procedure Visit_Field (F : Union_Id; N : Node_Id) is
begin
if F = Union_Id (Empty) then
return;
elsif F in Node_Range then
-- Copy node if it is syntactic, i.e. its parent pointer is
-- set to point to the field that referenced it (certain
-- Itypes will also meet this criterion, which is fine, since
-- these are clearly Itypes that do need to be copied, since
-- we are copying their parent.)
if Parent (Node_Id (F)) = N then
Visit_Node (Node_Id (F));
return;
-- Another case, if we are pointing to an Itype, then we want
-- to copy it if its associated node is somewhere in the tree
-- being copied.
-- Note: the exclusion of self-referential copies is just an
-- optimization, since the search of the already copied list
-- would catch it, but it is a common case (Etype pointing to
-- itself for an Itype that is a base type).
elsif Nkind (Node_Id (F)) in N_Entity
and then Is_Itype (Entity_Id (F))
and then Node_Id (F) /= N
then
declare
P : Node_Id;
begin
P := Associated_Node_For_Itype (Node_Id (F));
while Present (P) loop
if P = Source then
Visit_Node (Node_Id (F));
return;
else
P := Parent (P);
end if;
end loop;
-- An Itype whose parent is not being copied definitely
-- should NOT be copied, since it does not belong in any
-- sense to the copied subtree.
return;
end;
end if;
elsif F in List_Range and then Parent (List_Id (F)) = N then
Visit_List (List_Id (F));
return;
end if;
end Visit_Field;
-----------------
-- Visit_Itype --
-----------------
procedure Visit_Itype (Old_Itype : Entity_Id) is
New_Itype : Entity_Id;
Ent : Entity_Id;
begin
-- Itypes that describe the designated type of access to subprograms
-- have the structure of subprogram declarations, with signatures,
-- etc. Either we duplicate the signatures completely, or choose to
-- share such itypes, which is fine because their elaboration will
-- have no side effects.
if Ekind (Old_Itype) = E_Subprogram_Type then
return;
end if;
New_Itype := New_Copy (Old_Itype);
-- The new Itype has all the attributes of the old one, and we
-- just copy the contents of the entity. However, the back-end
-- needs different names for debugging purposes, so we create a
-- new internal name for it in all cases.
Set_Chars (New_Itype, New_Internal_Name ('T'));
-- If our associated node is an entity that has already been copied,
-- then set the associated node of the copy to point to the right
-- copy. If we have copied an Itype that is itself the associated
-- node of some previously copied Itype, then we set the right
-- pointer in the other direction.
Ent := NCT_Assoc.Get (Associated_Node_For_Itype (Old_Itype));
if Present (Ent) then
Set_Associated_Node_For_Itype (New_Itype, Ent);
end if;
Ent := NCT_Itype_Assoc.Get (Old_Itype);
if Present (Ent) then
Set_Associated_Node_For_Itype (Ent, New_Itype);
-- If the hash table has no association for this Itype and its
-- associated node, enter one now.
else
NCT_Itype_Assoc.Set
(Associated_Node_For_Itype (Old_Itype), New_Itype);
end if;
if Present (Freeze_Node (New_Itype)) then
Set_Is_Frozen (New_Itype, False);
Set_Freeze_Node (New_Itype, Empty);
end if;
-- Add new association to map
NCT_Assoc.Set (Old_Itype, New_Itype);
-- If a record subtype is simply copied, the entity list will be
-- shared. Thus cloned_Subtype must be set to indicate the sharing.
if Ekind_In (Old_Itype, E_Class_Wide_Subtype, E_Record_Subtype) then
Set_Cloned_Subtype (New_Itype, Old_Itype);
end if;
-- Visit descendants that eventually get copied
Visit_Field (Union_Id (Etype (Old_Itype)), Old_Itype);
if Is_Discrete_Type (Old_Itype) then
Visit_Field (Union_Id (Scalar_Range (Old_Itype)), Old_Itype);
elsif Has_Discriminants (Base_Type (Old_Itype)) then
-- ??? This should involve call to Visit_Field
Visit_Elist (Discriminant_Constraint (Old_Itype));
elsif Is_Array_Type (Old_Itype) then
if Present (First_Index (Old_Itype)) then
Visit_Field
(Union_Id (List_Containing (First_Index (Old_Itype))),
Old_Itype);
end if;
if Is_Packed (Old_Itype) then
Visit_Field
(Union_Id (Packed_Array_Impl_Type (Old_Itype)), Old_Itype);
end if;
end if;
end Visit_Itype;
----------------
-- Visit_List --
----------------
procedure Visit_List (L : List_Id) is
N : Node_Id;
begin
if L /= No_List then
N := First (L);
while Present (N) loop
Visit_Node (N);
Next (N);
end loop;
end if;
end Visit_List;
----------------
-- Visit_Node --
----------------
procedure Visit_Node (N : Node_Or_Entity_Id) is
begin
-- Handle case of an Itype, which must be copied
if Nkind (N) in N_Entity and then Is_Itype (N) then
-- Nothing to do if already in the list. This can happen with an
-- Itype entity that appears more than once in the tree. Note that
-- we do not want to visit descendants in this case.
if Present (NCT_Assoc.Get (Entity_Id (N))) then
return;
end if;
Visit_Itype (N);
end if;
-- Visit descendants
Visit_Field (Field1 (N), N);
Visit_Field (Field2 (N), N);
Visit_Field (Field3 (N), N);
Visit_Field (Field4 (N), N);
Visit_Field (Field5 (N), N);
end Visit_Node;
-- Start of processing for New_Copy_Tree
begin
Build_NCT_Hash_Tables;
-- Hash table set up if required, now start phase one by visiting top
-- node (we will recursively visit the descendants).
Visit_Node (Source);
-- Now the second phase of the copy can start. First we process all the
-- mapped entities, copying their descendants.
declare
Old_E : Entity_Id := Empty;
New_E : Entity_Id;
begin
NCT_Assoc.Get_First (Old_E, New_E);
while Present (New_E) loop
if Is_Itype (New_E) then
Copy_Itype_With_Replacement (New_E);
end if;
NCT_Assoc.Get_Next (Old_E, New_E);
end loop;
end;
-- Now we can copy the actual tree
declare
Result : constant Node_Id := Copy_Node_With_Replacement (Source);
begin
NCT_Assoc.Reset;
NCT_Itype_Assoc.Reset;
return Result;
end;
end New_Copy_Tree;
-------------------------
-- New_External_Entity --
-------------------------
function New_External_Entity
(Kind : Entity_Kind;
Scope_Id : Entity_Id;
Sloc_Value : Source_Ptr;
Related_Id : Entity_Id;
Suffix : Character;
Suffix_Index : Nat := 0;
Prefix : Character := ' ') return Entity_Id
is
N : constant Entity_Id :=
Make_Defining_Identifier (Sloc_Value,
New_External_Name
(Chars (Related_Id), Suffix, Suffix_Index, Prefix));
begin
Set_Ekind (N, Kind);
Set_Is_Internal (N, True);
Append_Entity (N, Scope_Id);
Set_Public_Status (N);
if Kind in Type_Kind then
Init_Size_Align (N);
end if;
return N;
end New_External_Entity;
-------------------------
-- New_Internal_Entity --
-------------------------
function New_Internal_Entity
(Kind : Entity_Kind;
Scope_Id : Entity_Id;
Sloc_Value : Source_Ptr;
Id_Char : Character) return Entity_Id
is
N : constant Entity_Id := Make_Temporary (Sloc_Value, Id_Char);
begin
Set_Ekind (N, Kind);
Set_Is_Internal (N, True);
Append_Entity (N, Scope_Id);
if Kind in Type_Kind then
Init_Size_Align (N);
end if;
return N;
end New_Internal_Entity;
-----------------
-- Next_Actual --
-----------------
function Next_Actual (Actual_Id : Node_Id) return Node_Id is
N : Node_Id;
begin
-- If we are pointing at a positional parameter, it is a member of a
-- node list (the list of parameters), and the next parameter is the
-- next node on the list, unless we hit a parameter association, then
-- we shift to using the chain whose head is the First_Named_Actual in
-- the parent, and then is threaded using the Next_Named_Actual of the
-- Parameter_Association. All this fiddling is because the original node
-- list is in the textual call order, and what we need is the
-- declaration order.
if Is_List_Member (Actual_Id) then
N := Next (Actual_Id);
if Nkind (N) = N_Parameter_Association then
return First_Named_Actual (Parent (Actual_Id));
else
return N;
end if;
else
return Next_Named_Actual (Parent (Actual_Id));
end if;
end Next_Actual;
procedure Next_Actual (Actual_Id : in out Node_Id) is
begin
Actual_Id := Next_Actual (Actual_Id);
end Next_Actual;
----------------------------------
-- New_Requires_Transient_Scope --
----------------------------------
function New_Requires_Transient_Scope (Id : Entity_Id) return Boolean is
function Caller_Known_Size_Record (Typ : Entity_Id) return Boolean;
-- This is called for untagged records and protected types, with
-- nondefaulted discriminants. Returns True if the size of function
-- results is known at the call site, False otherwise. Returns False
-- if there is a variant part that depends on the discriminants of
-- this type, or if there is an array constrained by the discriminants
-- of this type. ???Currently, this is overly conservative (the array
-- could be nested inside some other record that is constrained by
-- nondiscriminants). That is, the recursive calls are too conservative.
function Large_Max_Size_Mutable (Typ : Entity_Id) return Boolean;
-- Returns True if Typ is a nonlimited record with defaulted
-- discriminants whose max size makes it unsuitable for allocating on
-- the primary stack.
------------------------------
-- Caller_Known_Size_Record --
------------------------------
function Caller_Known_Size_Record (Typ : Entity_Id) return Boolean is
pragma Assert (Typ = Underlying_Type (Typ));
begin
if Has_Variant_Part (Typ) and then not Is_Definite_Subtype (Typ) then
return False;
end if;
declare
Comp : Entity_Id;
begin
Comp := First_Entity (Typ);
while Present (Comp) loop
-- Only look at E_Component entities. No need to look at
-- E_Discriminant entities, and we must ignore internal
-- subtypes generated for constrained components.
if Ekind (Comp) = E_Component then
declare
Comp_Type : constant Entity_Id :=
Underlying_Type (Etype (Comp));
begin
if Is_Record_Type (Comp_Type)
or else
Is_Protected_Type (Comp_Type)
then
if not Caller_Known_Size_Record (Comp_Type) then
return False;
end if;
elsif Is_Array_Type (Comp_Type) then
if Size_Depends_On_Discriminant (Comp_Type) then
return False;
end if;
end if;
end;
end if;
Next_Entity (Comp);
end loop;
end;
return True;
end Caller_Known_Size_Record;
------------------------------
-- Large_Max_Size_Mutable --
------------------------------
function Large_Max_Size_Mutable (Typ : Entity_Id) return Boolean is
pragma Assert (Typ = Underlying_Type (Typ));
function Is_Large_Discrete_Type (T : Entity_Id) return Boolean;
-- Returns true if the discrete type T has a large range
----------------------------
-- Is_Large_Discrete_Type --
----------------------------
function Is_Large_Discrete_Type (T : Entity_Id) return Boolean is
Threshold : constant Int := 16;
-- Arbitrary threshold above which we consider it "large". We want
-- a fairly large threshold, because these large types really
-- shouldn't have default discriminants in the first place, in
-- most cases.
begin
return UI_To_Int (RM_Size (T)) > Threshold;
end Is_Large_Discrete_Type;
-- Start of processing for Large_Max_Size_Mutable
begin
if Is_Record_Type (Typ)
and then not Is_Limited_View (Typ)
and then Has_Defaulted_Discriminants (Typ)
then
-- Loop through the components, looking for an array whose upper
-- bound(s) depends on discriminants, where both the subtype of
-- the discriminant and the index subtype are too large.
declare
Comp : Entity_Id;
begin
Comp := First_Entity (Typ);
while Present (Comp) loop
if Ekind (Comp) = E_Component then
declare
Comp_Type : constant Entity_Id :=
Underlying_Type (Etype (Comp));
Hi : Node_Id;
Indx : Node_Id;
Ityp : Entity_Id;
begin
if Is_Array_Type (Comp_Type) then
Indx := First_Index (Comp_Type);
while Present (Indx) loop
Ityp := Etype (Indx);
Hi := Type_High_Bound (Ityp);
if Nkind (Hi) = N_Identifier
and then Ekind (Entity (Hi)) = E_Discriminant
and then Is_Large_Discrete_Type (Ityp)
and then Is_Large_Discrete_Type
(Etype (Entity (Hi)))
then
return True;
end if;
Next_Index (Indx);
end loop;
end if;
end;
end if;
Next_Entity (Comp);
end loop;
end;
end if;
return False;
end Large_Max_Size_Mutable;
-- Local declarations
Typ : constant Entity_Id := Underlying_Type (Id);
-- Start of processing for New_Requires_Transient_Scope
begin
-- This is a private type which is not completed yet. This can only
-- happen in a default expression (of a formal parameter or of a
-- record component). Do not expand transient scope in this case.
if No (Typ) then
return False;
-- Do not expand transient scope for non-existent procedure return or
-- string literal types.
elsif Typ = Standard_Void_Type
or else Ekind (Typ) = E_String_Literal_Subtype
then
return False;
-- If Typ is a generic formal incomplete type, then we want to look at
-- the actual type.
elsif Ekind (Typ) = E_Record_Subtype
and then Present (Cloned_Subtype (Typ))
then
return New_Requires_Transient_Scope (Cloned_Subtype (Typ));
-- Functions returning specific tagged types may dispatch on result, so
-- their returned value is allocated on the secondary stack, even in the
-- definite case. We must treat nondispatching functions the same way,
-- because access-to-function types can point at both, so the calling
-- conventions must be compatible. Is_Tagged_Type includes controlled
-- types and class-wide types. Controlled type temporaries need
-- finalization.
-- ???It's not clear why we need to return noncontrolled types with
-- controlled components on the secondary stack.
elsif Is_Tagged_Type (Typ) or else Has_Controlled_Component (Typ) then
return True;
-- Untagged definite subtypes are known size. This includes all
-- elementary [sub]types. Tasks are known size even if they have
-- discriminants. So we return False here, with one exception:
-- For a type like:
-- type T (Last : Natural := 0) is
-- X : String (1 .. Last);
-- end record;
-- we return True. That's because for "P(F(...));", where F returns T,
-- we don't know the size of the result at the call site, so if we
-- allocated it on the primary stack, we would have to allocate the
-- maximum size, which is way too big.
elsif Is_Definite_Subtype (Typ) or else Is_Task_Type (Typ) then
return Large_Max_Size_Mutable (Typ);
-- Indefinite (discriminated) untagged record or protected type
elsif Is_Record_Type (Typ) or else Is_Protected_Type (Typ) then
return not Caller_Known_Size_Record (Typ);
-- Unconstrained array
else
pragma Assert (Is_Array_Type (Typ) and not Is_Definite_Subtype (Typ));
return True;
end if;
end New_Requires_Transient_Scope;
-----------------------
-- Normalize_Actuals --
-----------------------
-- Chain actuals according to formals of subprogram. If there are no named
-- associations, the chain is simply the list of Parameter Associations,
-- since the order is the same as the declaration order. If there are named
-- associations, then the First_Named_Actual field in the N_Function_Call
-- or N_Procedure_Call_Statement node points to the Parameter_Association
-- node for the parameter that comes first in declaration order. The
-- remaining named parameters are then chained in declaration order using
-- Next_Named_Actual.
-- This routine also verifies that the number of actuals is compatible with
-- the number and default values of formals, but performs no type checking
-- (type checking is done by the caller).
-- If the matching succeeds, Success is set to True and the caller proceeds
-- with type-checking. If the match is unsuccessful, then Success is set to
-- False, and the caller attempts a different interpretation, if there is
-- one.
-- If the flag Report is on, the call is not overloaded, and a failure to
-- match can be reported here, rather than in the caller.
procedure Normalize_Actuals
(N : Node_Id;
S : Entity_Id;
Report : Boolean;
Success : out Boolean)
is
Actuals : constant List_Id := Parameter_Associations (N);
Actual : Node_Id := Empty;
Formal : Entity_Id;
Last : Node_Id := Empty;
First_Named : Node_Id := Empty;
Found : Boolean;
Formals_To_Match : Integer := 0;
Actuals_To_Match : Integer := 0;
procedure Chain (A : Node_Id);
-- Add named actual at the proper place in the list, using the
-- Next_Named_Actual link.
function Reporting return Boolean;
-- Determines if an error is to be reported. To report an error, we
-- need Report to be True, and also we do not report errors caused
-- by calls to init procs that occur within other init procs. Such
-- errors must always be cascaded errors, since if all the types are
-- declared correctly, the compiler will certainly build decent calls.
-----------
-- Chain --
-----------
procedure Chain (A : Node_Id) is
begin
if No (Last) then
-- Call node points to first actual in list
Set_First_Named_Actual (N, Explicit_Actual_Parameter (A));
else
Set_Next_Named_Actual (Last, Explicit_Actual_Parameter (A));
end if;
Last := A;
Set_Next_Named_Actual (Last, Empty);
end Chain;
---------------
-- Reporting --
---------------
function Reporting return Boolean is
begin
if not Report then
return False;
elsif not Within_Init_Proc then
return True;
elsif Is_Init_Proc (Entity (Name (N))) then
return False;
else
return True;
end if;
end Reporting;
-- Start of processing for Normalize_Actuals
begin
if Is_Access_Type (S) then
-- The name in the call is a function call that returns an access
-- to subprogram. The designated type has the list of formals.
Formal := First_Formal (Designated_Type (S));
else
Formal := First_Formal (S);
end if;
while Present (Formal) loop
Formals_To_Match := Formals_To_Match + 1;
Next_Formal (Formal);
end loop;
-- Find if there is a named association, and verify that no positional
-- associations appear after named ones.
if Present (Actuals) then
Actual := First (Actuals);
end if;
while Present (Actual)
and then Nkind (Actual) /= N_Parameter_Association
loop
Actuals_To_Match := Actuals_To_Match + 1;
Next (Actual);
end loop;
if No (Actual) and Actuals_To_Match = Formals_To_Match then
-- Most common case: positional notation, no defaults
Success := True;
return;
elsif Actuals_To_Match > Formals_To_Match then
-- Too many actuals: will not work
if Reporting then
if Is_Entity_Name (Name (N)) then
Error_Msg_N ("too many arguments in call to&", Name (N));
else
Error_Msg_N ("too many arguments in call", N);
end if;
end if;
Success := False;
return;
end if;
First_Named := Actual;
while Present (Actual) loop
if Nkind (Actual) /= N_Parameter_Association then
Error_Msg_N
("positional parameters not allowed after named ones", Actual);
Success := False;
return;
else
Actuals_To_Match := Actuals_To_Match + 1;
end if;
Next (Actual);
end loop;
if Present (Actuals) then
Actual := First (Actuals);
end if;
Formal := First_Formal (S);
while Present (Formal) loop
-- Match the formals in order. If the corresponding actual is
-- positional, nothing to do. Else scan the list of named actuals
-- to find the one with the right name.
if Present (Actual)
and then Nkind (Actual) /= N_Parameter_Association
then
Next (Actual);
Actuals_To_Match := Actuals_To_Match - 1;
Formals_To_Match := Formals_To_Match - 1;
else
-- For named parameters, search the list of actuals to find
-- one that matches the next formal name.
Actual := First_Named;
Found := False;
while Present (Actual) loop
if Chars (Selector_Name (Actual)) = Chars (Formal) then
Found := True;
Chain (Actual);
Actuals_To_Match := Actuals_To_Match - 1;
Formals_To_Match := Formals_To_Match - 1;
exit;
end if;
Next (Actual);
end loop;
if not Found then
if Ekind (Formal) /= E_In_Parameter
or else No (Default_Value (Formal))
then
if Reporting then
if (Comes_From_Source (S)
or else Sloc (S) = Standard_Location)
and then Is_Overloadable (S)
then
if No (Actuals)
and then
Nkind_In (Parent (N), N_Procedure_Call_Statement,
N_Function_Call,
N_Parameter_Association)
and then Ekind (S) /= E_Function
then
Set_Etype (N, Etype (S));
else
Error_Msg_Name_1 := Chars (S);
Error_Msg_Sloc := Sloc (S);
Error_Msg_NE
("missing argument for parameter & "
& "in call to % declared #", N, Formal);
end if;
elsif Is_Overloadable (S) then
Error_Msg_Name_1 := Chars (S);
-- Point to type derivation that generated the
-- operation.
Error_Msg_Sloc := Sloc (Parent (S));
Error_Msg_NE
("missing argument for parameter & "
& "in call to % (inherited) #", N, Formal);
else
Error_Msg_NE
("missing argument for parameter &", N, Formal);
end if;
end if;
Success := False;
return;
else
Formals_To_Match := Formals_To_Match - 1;
end if;
end if;
end if;
Next_Formal (Formal);
end loop;
if Formals_To_Match = 0 and then Actuals_To_Match = 0 then
Success := True;
return;
else
if Reporting then
-- Find some superfluous named actual that did not get
-- attached to the list of associations.
Actual := First (Actuals);
while Present (Actual) loop
if Nkind (Actual) = N_Parameter_Association
and then Actual /= Last
and then No (Next_Named_Actual (Actual))
then
-- A validity check may introduce a copy of a call that
-- includes an extra actual (for example for an unrelated
-- accessibility check). Check that the extra actual matches
-- some extra formal, which must exist already because
-- subprogram must be frozen at this point.
if Present (Extra_Formals (S))
and then not Comes_From_Source (Actual)
and then Nkind (Actual) = N_Parameter_Association
and then Chars (Extra_Formals (S)) =
Chars (Selector_Name (Actual))
then
null;
else
Error_Msg_N
("unmatched actual & in call", Selector_Name (Actual));
exit;
end if;
end if;
Next (Actual);
end loop;
end if;
Success := False;
return;
end if;
end Normalize_Actuals;
--------------------------------
-- Note_Possible_Modification --
--------------------------------
procedure Note_Possible_Modification (N : Node_Id; Sure : Boolean) is
Modification_Comes_From_Source : constant Boolean :=
Comes_From_Source (Parent (N));
Ent : Entity_Id;
Exp : Node_Id;
begin
-- Loop to find referenced entity, if there is one
Exp := N;
loop
Ent := Empty;
if Is_Entity_Name (Exp) then
Ent := Entity (Exp);
-- If the entity is missing, it is an undeclared identifier,
-- and there is nothing to annotate.
if No (Ent) then
return;
end if;
elsif Nkind (Exp) = N_Explicit_Dereference then
declare
P : constant Node_Id := Prefix (Exp);
begin
-- In formal verification mode, keep track of all reads and
-- writes through explicit dereferences.
if GNATprove_Mode then
SPARK_Specific.Generate_Dereference (N, 'm');
end if;
if Nkind (P) = N_Selected_Component
and then Present (Entry_Formal (Entity (Selector_Name (P))))
then
-- Case of a reference to an entry formal
Ent := Entry_Formal (Entity (Selector_Name (P)));
elsif Nkind (P) = N_Identifier
and then Nkind (Parent (Entity (P))) = N_Object_Declaration
and then Present (Expression (Parent (Entity (P))))
and then Nkind (Expression (Parent (Entity (P)))) =
N_Reference
then
-- Case of a reference to a value on which side effects have
-- been removed.
Exp := Prefix (Expression (Parent (Entity (P))));
goto Continue;
else
return;
end if;
end;
elsif Nkind_In (Exp, N_Type_Conversion,
N_Unchecked_Type_Conversion)
then
Exp := Expression (Exp);
goto Continue;
elsif Nkind_In (Exp, N_Slice,
N_Indexed_Component,
N_Selected_Component)
then
-- Special check, if the prefix is an access type, then return
-- since we are modifying the thing pointed to, not the prefix.
-- When we are expanding, most usually the prefix is replaced
-- by an explicit dereference, and this test is not needed, but
-- in some cases (notably -gnatc mode and generics) when we do
-- not do full expansion, we need this special test.
if Is_Access_Type (Etype (Prefix (Exp))) then
return;
-- Otherwise go to prefix and keep going
else
Exp := Prefix (Exp);
goto Continue;
end if;
-- All other cases, not a modification
else
return;
end if;
-- Now look for entity being referenced
if Present (Ent) then
if Is_Object (Ent) then
if Comes_From_Source (Exp)
or else Modification_Comes_From_Source
then
-- Give warning if pragma unmodified is given and we are
-- sure this is a modification.
if Has_Pragma_Unmodified (Ent) and then Sure then
-- Note that the entity may be present only as a result
-- of pragma Unused.
if Has_Pragma_Unused (Ent) then
Error_Msg_NE ("??pragma Unused given for &!", N, Ent);
else
Error_Msg_NE
("??pragma Unmodified given for &!", N, Ent);
end if;
end if;
Set_Never_Set_In_Source (Ent, False);
end if;
Set_Is_True_Constant (Ent, False);
Set_Current_Value (Ent, Empty);
Set_Is_Known_Null (Ent, False);
if not Can_Never_Be_Null (Ent) then
Set_Is_Known_Non_Null (Ent, False);
end if;
-- Follow renaming chain
if (Ekind (Ent) = E_Variable or else Ekind (Ent) = E_Constant)
and then Present (Renamed_Object (Ent))
then
Exp := Renamed_Object (Ent);
-- If the entity is the loop variable in an iteration over
-- a container, retrieve container expression to indicate
-- possible modification.
if Present (Related_Expression (Ent))
and then Nkind (Parent (Related_Expression (Ent))) =
N_Iterator_Specification
then
Exp := Original_Node (Related_Expression (Ent));
end if;
goto Continue;
-- The expression may be the renaming of a subcomponent of an
-- array or container. The assignment to the subcomponent is
-- a modification of the container.
elsif Comes_From_Source (Original_Node (Exp))
and then Nkind_In (Original_Node (Exp), N_Selected_Component,
N_Indexed_Component)
then
Exp := Prefix (Original_Node (Exp));
goto Continue;
end if;
-- Generate a reference only if the assignment comes from
-- source. This excludes, for example, calls to a dispatching
-- assignment operation when the left-hand side is tagged. In
-- GNATprove mode, we need those references also on generated
-- code, as these are used to compute the local effects of
-- subprograms.
if Modification_Comes_From_Source or GNATprove_Mode then
Generate_Reference (Ent, Exp, 'm');
-- If the target of the assignment is the bound variable
-- in an iterator, indicate that the corresponding array
-- or container is also modified.
if Ada_Version >= Ada_2012
and then Nkind (Parent (Ent)) = N_Iterator_Specification
then
declare
Domain : constant Node_Id := Name (Parent (Ent));
begin
-- TBD : in the full version of the construct, the
-- domain of iteration can be given by an expression.
if Is_Entity_Name (Domain) then
Generate_Reference (Entity (Domain), Exp, 'm');
Set_Is_True_Constant (Entity (Domain), False);
Set_Never_Set_In_Source (Entity (Domain), False);
end if;
end;
end if;
end if;
end if;
Kill_Checks (Ent);
-- If we are sure this is a modification from source, and we know
-- this modifies a constant, then give an appropriate warning.
if Sure
and then Modification_Comes_From_Source
and then Overlays_Constant (Ent)
and then Address_Clause_Overlay_Warnings
then
declare
Addr : constant Node_Id := Address_Clause (Ent);
O_Ent : Entity_Id;
Off : Boolean;
begin
Find_Overlaid_Entity (Addr, O_Ent, Off);
Error_Msg_Sloc := Sloc (Addr);
Error_Msg_NE
("??constant& may be modified via address clause#",
N, O_Ent);
end;
end if;
return;
end if;
<<Continue>>
null;
end loop;
end Note_Possible_Modification;
--------------------------------------
-- Null_To_Null_Address_Convert_OK --
--------------------------------------
function Null_To_Null_Address_Convert_OK
(N : Node_Id;
Typ : Entity_Id := Empty) return Boolean
is
begin
if not Relaxed_RM_Semantics then
return False;
end if;
if Nkind (N) = N_Null then
return Present (Typ) and then Is_Descendant_Of_Address (Typ);
elsif Nkind_In (N, N_Op_Eq, N_Op_Ge, N_Op_Gt, N_Op_Le, N_Op_Lt, N_Op_Ne)
then
declare
L : constant Node_Id := Left_Opnd (N);
R : constant Node_Id := Right_Opnd (N);
begin
-- We check the Etype of the complementary operand since the
-- N_Null node is not decorated at this stage.
return
((Nkind (L) = N_Null
and then Is_Descendant_Of_Address (Etype (R)))
or else
(Nkind (R) = N_Null
and then Is_Descendant_Of_Address (Etype (L))));
end;
end if;
return False;
end Null_To_Null_Address_Convert_OK;
-------------------------
-- Object_Access_Level --
-------------------------
-- Returns the static accessibility level of the view denoted by Obj. Note
-- that the value returned is the result of a call to Scope_Depth. Only
-- scope depths associated with dynamic scopes can actually be returned.
-- Since only relative levels matter for accessibility checking, the fact
-- that the distance between successive levels of accessibility is not
-- always one is immaterial (invariant: if level(E2) is deeper than
-- level(E1), then Scope_Depth(E1) < Scope_Depth(E2)).
function Object_Access_Level (Obj : Node_Id) return Uint is
function Is_Interface_Conversion (N : Node_Id) return Boolean;
-- Determine whether N is a construct of the form
-- Some_Type (Operand._tag'Address)
-- This construct appears in the context of dispatching calls.
function Reference_To (Obj : Node_Id) return Node_Id;
-- An explicit dereference is created when removing side-effects from
-- expressions for constraint checking purposes. In this case a local
-- access type is created for it. The correct access level is that of
-- the original source node. We detect this case by noting that the
-- prefix of the dereference is created by an object declaration whose
-- initial expression is a reference.
-----------------------------
-- Is_Interface_Conversion --
-----------------------------
function Is_Interface_Conversion (N : Node_Id) return Boolean is
begin
return Nkind (N) = N_Unchecked_Type_Conversion
and then Nkind (Expression (N)) = N_Attribute_Reference
and then Attribute_Name (Expression (N)) = Name_Address;
end Is_Interface_Conversion;
------------------
-- Reference_To --
------------------
function Reference_To (Obj : Node_Id) return Node_Id is
Pref : constant Node_Id := Prefix (Obj);
begin
if Is_Entity_Name (Pref)
and then Nkind (Parent (Entity (Pref))) = N_Object_Declaration
and then Present (Expression (Parent (Entity (Pref))))
and then Nkind (Expression (Parent (Entity (Pref)))) = N_Reference
then
return (Prefix (Expression (Parent (Entity (Pref)))));
else
return Empty;
end if;
end Reference_To;
-- Local variables
E : Entity_Id;
-- Start of processing for Object_Access_Level
begin
if Nkind (Obj) = N_Defining_Identifier
or else Is_Entity_Name (Obj)
then
if Nkind (Obj) = N_Defining_Identifier then
E := Obj;
else
E := Entity (Obj);
end if;
if Is_Prival (E) then
E := Prival_Link (E);
end if;
-- If E is a type then it denotes a current instance. For this case
-- we add one to the normal accessibility level of the type to ensure
-- that current instances are treated as always being deeper than
-- than the level of any visible named access type (see 3.10.2(21)).
if Is_Type (E) then
return Type_Access_Level (E) + 1;
elsif Present (Renamed_Object (E)) then
return Object_Access_Level (Renamed_Object (E));
-- Similarly, if E is a component of the current instance of a
-- protected type, any instance of it is assumed to be at a deeper
-- level than the type. For a protected object (whose type is an
-- anonymous protected type) its components are at the same level
-- as the type itself.
elsif not Is_Overloadable (E)
and then Ekind (Scope (E)) = E_Protected_Type
and then Comes_From_Source (Scope (E))
then
return Type_Access_Level (Scope (E)) + 1;
else
-- Aliased formals of functions take their access level from the
-- point of call, i.e. require a dynamic check. For static check
-- purposes, this is smaller than the level of the subprogram
-- itself. For procedures the aliased makes no difference.
if Is_Formal (E)
and then Is_Aliased (E)
and then Ekind (Scope (E)) = E_Function
then
return Type_Access_Level (Etype (E));
else
return Scope_Depth (Enclosing_Dynamic_Scope (E));
end if;
end if;
elsif Nkind (Obj) = N_Selected_Component then
if Is_Access_Type (Etype (Prefix (Obj))) then
return Type_Access_Level (Etype (Prefix (Obj)));
else
return Object_Access_Level (Prefix (Obj));
end if;
elsif Nkind (Obj) = N_Indexed_Component then
if Is_Access_Type (Etype (Prefix (Obj))) then
return Type_Access_Level (Etype (Prefix (Obj)));
else
return Object_Access_Level (Prefix (Obj));
end if;
elsif Nkind (Obj) = N_Explicit_Dereference then
-- If the prefix is a selected access discriminant then we make a
-- recursive call on the prefix, which will in turn check the level
-- of the prefix object of the selected discriminant.
-- In Ada 2012, if the discriminant has implicit dereference and
-- the context is a selected component, treat this as an object of
-- unknown scope (see below). This is necessary in compile-only mode;
-- otherwise expansion will already have transformed the prefix into
-- a temporary.
if Nkind (Prefix (Obj)) = N_Selected_Component
and then Ekind (Etype (Prefix (Obj))) = E_Anonymous_Access_Type
and then
Ekind (Entity (Selector_Name (Prefix (Obj)))) = E_Discriminant
and then
(not Has_Implicit_Dereference
(Entity (Selector_Name (Prefix (Obj))))
or else Nkind (Parent (Obj)) /= N_Selected_Component)
then
return Object_Access_Level (Prefix (Obj));
-- Detect an interface conversion in the context of a dispatching
-- call. Use the original form of the conversion to find the access
-- level of the operand.
elsif Is_Interface (Etype (Obj))
and then Is_Interface_Conversion (Prefix (Obj))
and then Nkind (Original_Node (Obj)) = N_Type_Conversion
then
return Object_Access_Level (Original_Node (Obj));
elsif not Comes_From_Source (Obj) then
declare
Ref : constant Node_Id := Reference_To (Obj);
begin
if Present (Ref) then
return Object_Access_Level (Ref);
else
return Type_Access_Level (Etype (Prefix (Obj)));
end if;
end;
else
return Type_Access_Level (Etype (Prefix (Obj)));
end if;
elsif Nkind_In (Obj, N_Type_Conversion, N_Unchecked_Type_Conversion) then
return Object_Access_Level (Expression (Obj));
elsif Nkind (Obj) = N_Function_Call then
-- Function results are objects, so we get either the access level of
-- the function or, in the case of an indirect call, the level of the
-- access-to-subprogram type. (This code is used for Ada 95, but it
-- looks wrong, because it seems that we should be checking the level
-- of the call itself, even for Ada 95. However, using the Ada 2005
-- version of the code causes regressions in several tests that are
-- compiled with -gnat95. ???)
if Ada_Version < Ada_2005 then
if Is_Entity_Name (Name (Obj)) then
return Subprogram_Access_Level (Entity (Name (Obj)));
else
return Type_Access_Level (Etype (Prefix (Name (Obj))));
end if;
-- For Ada 2005, the level of the result object of a function call is
-- defined to be the level of the call's innermost enclosing master.
-- We determine that by querying the depth of the innermost enclosing
-- dynamic scope.
else
Return_Master_Scope_Depth_Of_Call : declare
function Innermost_Master_Scope_Depth
(N : Node_Id) return Uint;
-- Returns the scope depth of the given node's innermost
-- enclosing dynamic scope (effectively the accessibility
-- level of the innermost enclosing master).
----------------------------------
-- Innermost_Master_Scope_Depth --
----------------------------------
function Innermost_Master_Scope_Depth
(N : Node_Id) return Uint
is
Node_Par : Node_Id := Parent (N);
begin
-- Locate the nearest enclosing node (by traversing Parents)
-- that Defining_Entity can be applied to, and return the
-- depth of that entity's nearest enclosing dynamic scope.
while Present (Node_Par) loop
case Nkind (Node_Par) is
when N_Abstract_Subprogram_Declaration
| N_Block_Statement
| N_Body_Stub
| N_Component_Declaration
| N_Entry_Body
| N_Entry_Declaration
| N_Exception_Declaration
| N_Formal_Object_Declaration
| N_Formal_Package_Declaration
| N_Formal_Subprogram_Declaration
| N_Formal_Type_Declaration
| N_Full_Type_Declaration
| N_Function_Specification
| N_Generic_Declaration
| N_Generic_Instantiation
| N_Implicit_Label_Declaration
| N_Incomplete_Type_Declaration
| N_Loop_Parameter_Specification
| N_Number_Declaration
| N_Object_Declaration
| N_Package_Declaration
| N_Package_Specification
| N_Parameter_Specification
| N_Private_Extension_Declaration
| N_Private_Type_Declaration
| N_Procedure_Specification
| N_Proper_Body
| N_Protected_Type_Declaration
| N_Renaming_Declaration
| N_Single_Protected_Declaration
| N_Single_Task_Declaration
| N_Subprogram_Declaration
| N_Subtype_Declaration
| N_Subunit
| N_Task_Type_Declaration
=>
return Scope_Depth
(Nearest_Dynamic_Scope
(Defining_Entity (Node_Par)));
when others =>
null;
end case;
Node_Par := Parent (Node_Par);
end loop;
pragma Assert (False);
-- Should never reach the following return
return Scope_Depth (Current_Scope) + 1;
end Innermost_Master_Scope_Depth;
-- Start of processing for Return_Master_Scope_Depth_Of_Call
begin
return Innermost_Master_Scope_Depth (Obj);
end Return_Master_Scope_Depth_Of_Call;
end if;
-- For convenience we handle qualified expressions, even though they
-- aren't technically object names.
elsif Nkind (Obj) = N_Qualified_Expression then
return Object_Access_Level (Expression (Obj));
-- Ditto for aggregates. They have the level of the temporary that
-- will hold their value.
elsif Nkind (Obj) = N_Aggregate then
return Object_Access_Level (Current_Scope);
-- Otherwise return the scope level of Standard. (If there are cases
-- that fall through to this point they will be treated as having
-- global accessibility for now. ???)
else
return Scope_Depth (Standard_Standard);
end if;
end Object_Access_Level;
----------------------------------
-- Old_Requires_Transient_Scope --
----------------------------------
function Old_Requires_Transient_Scope (Id : Entity_Id) return Boolean is
Typ : constant Entity_Id := Underlying_Type (Id);
begin
-- This is a private type which is not completed yet. This can only
-- happen in a default expression (of a formal parameter or of a
-- record component). Do not expand transient scope in this case.
if No (Typ) then
return False;
-- Do not expand transient scope for non-existent procedure return
elsif Typ = Standard_Void_Type then
return False;
-- Elementary types do not require a transient scope
elsif Is_Elementary_Type (Typ) then
return False;
-- Generally, indefinite subtypes require a transient scope, since the
-- back end cannot generate temporaries, since this is not a valid type
-- for declaring an object. It might be possible to relax this in the
-- future, e.g. by declaring the maximum possible space for the type.
elsif not Is_Definite_Subtype (Typ) then
return True;
-- Functions returning tagged types may dispatch on result so their
-- returned value is allocated on the secondary stack. Controlled
-- type temporaries need finalization.
elsif Is_Tagged_Type (Typ) or else Has_Controlled_Component (Typ) then
return True;
-- Record type
elsif Is_Record_Type (Typ) then
declare
Comp : Entity_Id;
begin
Comp := First_Entity (Typ);
while Present (Comp) loop
if Ekind (Comp) = E_Component then
-- ???It's not clear we need a full recursive call to
-- Old_Requires_Transient_Scope here. Note that the
-- following can't happen.
pragma Assert (Is_Definite_Subtype (Etype (Comp)));
pragma Assert (not Has_Controlled_Component (Etype (Comp)));
if Old_Requires_Transient_Scope (Etype (Comp)) then
return True;
end if;
end if;
Next_Entity (Comp);
end loop;
end;
return False;
-- String literal types never require transient scope
elsif Ekind (Typ) = E_String_Literal_Subtype then
return False;
-- Array type. Note that we already know that this is a constrained
-- array, since unconstrained arrays will fail the indefinite test.
elsif Is_Array_Type (Typ) then
-- If component type requires a transient scope, the array does too
if Old_Requires_Transient_Scope (Component_Type (Typ)) then
return True;
-- Otherwise, we only need a transient scope if the size depends on
-- the value of one or more discriminants.
else
return Size_Depends_On_Discriminant (Typ);
end if;
-- All other cases do not require a transient scope
else
pragma Assert (Is_Protected_Type (Typ) or else Is_Task_Type (Typ));
return False;
end if;
end Old_Requires_Transient_Scope;
---------------------------------
-- Original_Aspect_Pragma_Name --
---------------------------------
function Original_Aspect_Pragma_Name (N : Node_Id) return Name_Id is
Item : Node_Id;
Item_Nam : Name_Id;
begin
pragma Assert (Nkind_In (N, N_Aspect_Specification, N_Pragma));
Item := N;
-- The pragma was generated to emulate an aspect, use the original
-- aspect specification.
if Nkind (Item) = N_Pragma and then From_Aspect_Specification (Item) then
Item := Corresponding_Aspect (Item);
end if;
-- Retrieve the name of the aspect/pragma. Note that Pre, Pre_Class,
-- Post and Post_Class rewrite their pragma identifier to preserve the
-- original name.
-- ??? this is kludgey
if Nkind (Item) = N_Pragma then
Item_Nam := Chars (Original_Node (Pragma_Identifier (Item)));
else
pragma Assert (Nkind (Item) = N_Aspect_Specification);
Item_Nam := Chars (Identifier (Item));
end if;
-- Deal with 'Class by converting the name to its _XXX form
if Class_Present (Item) then
if Item_Nam = Name_Invariant then
Item_Nam := Name_uInvariant;
elsif Item_Nam = Name_Post then
Item_Nam := Name_uPost;
elsif Item_Nam = Name_Pre then
Item_Nam := Name_uPre;
elsif Nam_In (Item_Nam, Name_Type_Invariant,
Name_Type_Invariant_Class)
then
Item_Nam := Name_uType_Invariant;
-- Nothing to do for other cases (e.g. a Check that derived from
-- Pre_Class and has the flag set). Also we do nothing if the name
-- is already in special _xxx form.
end if;
end if;
return Item_Nam;
end Original_Aspect_Pragma_Name;
--------------------------------------
-- Original_Corresponding_Operation --
--------------------------------------
function Original_Corresponding_Operation (S : Entity_Id) return Entity_Id
is
Typ : constant Entity_Id := Find_Dispatching_Type (S);
begin
-- If S is an inherited primitive S2 the original corresponding
-- operation of S is the original corresponding operation of S2
if Present (Alias (S))
and then Find_Dispatching_Type (Alias (S)) /= Typ
then
return Original_Corresponding_Operation (Alias (S));
-- If S overrides an inherited subprogram S2 the original corresponding
-- operation of S is the original corresponding operation of S2
elsif Present (Overridden_Operation (S)) then
return Original_Corresponding_Operation (Overridden_Operation (S));
-- otherwise it is S itself
else
return S;
end if;
end Original_Corresponding_Operation;
-------------------
-- Output_Entity --
-------------------
procedure Output_Entity (Id : Entity_Id) is
Scop : Entity_Id;
begin
Scop := Scope (Id);
-- The entity may lack a scope when it is in the process of being
-- analyzed. Use the current scope as an approximation.
if No (Scop) then
Scop := Current_Scope;
end if;
Output_Name (Chars (Id), Scop);
end Output_Entity;
-----------------
-- Output_Name --
-----------------
procedure Output_Name (Nam : Name_Id; Scop : Entity_Id := Current_Scope) is
begin
Write_Str
(Get_Name_String
(Get_Qualified_Name
(Nam => Nam,
Suffix => No_Name,
Scop => Scop)));
Write_Eol;
end Output_Name;
----------------------
-- Policy_In_Effect --
----------------------
function Policy_In_Effect (Policy : Name_Id) return Name_Id is
function Policy_In_List (List : Node_Id) return Name_Id;
-- Determine the mode of a policy in a N_Pragma list
--------------------
-- Policy_In_List --
--------------------
function Policy_In_List (List : Node_Id) return Name_Id is
Arg1 : Node_Id;
Arg2 : Node_Id;
Prag : Node_Id;
begin
Prag := List;
while Present (Prag) loop
Arg1 := First (Pragma_Argument_Associations (Prag));
Arg2 := Next (Arg1);
Arg1 := Get_Pragma_Arg (Arg1);
Arg2 := Get_Pragma_Arg (Arg2);
-- The current Check_Policy pragma matches the requested policy or
-- appears in the single argument form (Assertion, policy_id).
if Nam_In (Chars (Arg1), Name_Assertion, Policy) then
return Chars (Arg2);
end if;
Prag := Next_Pragma (Prag);
end loop;
return No_Name;
end Policy_In_List;
-- Local variables
Kind : Name_Id;
-- Start of processing for Policy_In_Effect
begin
if not Is_Valid_Assertion_Kind (Policy) then
raise Program_Error;
end if;
-- Inspect all policy pragmas that appear within scopes (if any)
Kind := Policy_In_List (Check_Policy_List);
-- Inspect all configuration policy pragmas (if any)
if Kind = No_Name then
Kind := Policy_In_List (Check_Policy_List_Config);
end if;
-- The context lacks policy pragmas, determine the mode based on whether
-- assertions are enabled at the configuration level. This ensures that
-- the policy is preserved when analyzing generics.
if Kind = No_Name then
if Assertions_Enabled_Config then
Kind := Name_Check;
else
Kind := Name_Ignore;
end if;
end if;
return Kind;
end Policy_In_Effect;
----------------------------------
-- Predicate_Tests_On_Arguments --
----------------------------------
function Predicate_Tests_On_Arguments (Subp : Entity_Id) return Boolean is
begin
-- Always test predicates on indirect call
if Ekind (Subp) = E_Subprogram_Type then
return True;
-- Do not test predicates on call to generated default Finalize, since
-- we are not interested in whether something we are finalizing (and
-- typically destroying) satisfies its predicates.
elsif Chars (Subp) = Name_Finalize
and then not Comes_From_Source (Subp)
then
return False;
-- Do not test predicates on any internally generated routines
elsif Is_Internal_Name (Chars (Subp)) then
return False;
-- Do not test predicates on call to Init_Proc, since if needed the
-- predicate test will occur at some other point.
elsif Is_Init_Proc (Subp) then
return False;
-- Do not test predicates on call to predicate function, since this
-- would cause infinite recursion.
elsif Ekind (Subp) = E_Function
and then (Is_Predicate_Function (Subp)
or else
Is_Predicate_Function_M (Subp))
then
return False;
-- For now, no other exceptions
else
return True;
end if;
end Predicate_Tests_On_Arguments;
-----------------------
-- Private_Component --
-----------------------
function Private_Component (Type_Id : Entity_Id) return Entity_Id is
Ancestor : constant Entity_Id := Base_Type (Type_Id);
function Trace_Components
(T : Entity_Id;
Check : Boolean) return Entity_Id;
-- Recursive function that does the work, and checks against circular
-- definition for each subcomponent type.
----------------------
-- Trace_Components --
----------------------
function Trace_Components
(T : Entity_Id;
Check : Boolean) return Entity_Id
is
Btype : constant Entity_Id := Base_Type (T);
Component : Entity_Id;
P : Entity_Id;
Candidate : Entity_Id := Empty;
begin
if Check and then Btype = Ancestor then
Error_Msg_N ("circular type definition", Type_Id);
return Any_Type;
end if;
if Is_Private_Type (Btype) and then not Is_Generic_Type (Btype) then
if Present (Full_View (Btype))
and then Is_Record_Type (Full_View (Btype))
and then not Is_Frozen (Btype)
then
-- To indicate that the ancestor depends on a private type, the
-- current Btype is sufficient. However, to check for circular
-- definition we must recurse on the full view.
Candidate := Trace_Components (Full_View (Btype), True);
if Candidate = Any_Type then
return Any_Type;
else
return Btype;
end if;
else
return Btype;
end if;
elsif Is_Array_Type (Btype) then
return Trace_Components (Component_Type (Btype), True);
elsif Is_Record_Type (Btype) then
Component := First_Entity (Btype);
while Present (Component)
and then Comes_From_Source (Component)
loop
-- Skip anonymous types generated by constrained components
if not Is_Type (Component) then
P := Trace_Components (Etype (Component), True);
if Present (P) then
if P = Any_Type then
return P;
else
Candidate := P;
end if;
end if;
end if;
Next_Entity (Component);
end loop;
return Candidate;
else
return Empty;
end if;
end Trace_Components;
-- Start of processing for Private_Component
begin
return Trace_Components (Type_Id, False);
end Private_Component;
---------------------------
-- Primitive_Names_Match --
---------------------------
function Primitive_Names_Match (E1, E2 : Entity_Id) return Boolean is
function Non_Internal_Name (E : Entity_Id) return Name_Id;
-- Given an internal name, returns the corresponding non-internal name
------------------------
-- Non_Internal_Name --
------------------------
function Non_Internal_Name (E : Entity_Id) return Name_Id is
begin
Get_Name_String (Chars (E));
Name_Len := Name_Len - 1;
return Name_Find;
end Non_Internal_Name;
-- Start of processing for Primitive_Names_Match
begin
pragma Assert (Present (E1) and then Present (E2));
return Chars (E1) = Chars (E2)
or else
(not Is_Internal_Name (Chars (E1))
and then Is_Internal_Name (Chars (E2))
and then Non_Internal_Name (E2) = Chars (E1))
or else
(not Is_Internal_Name (Chars (E2))
and then Is_Internal_Name (Chars (E1))
and then Non_Internal_Name (E1) = Chars (E2))
or else
(Is_Predefined_Dispatching_Operation (E1)
and then Is_Predefined_Dispatching_Operation (E2)
and then Same_TSS (E1, E2))
or else
(Is_Init_Proc (E1) and then Is_Init_Proc (E2));
end Primitive_Names_Match;
-----------------------
-- Process_End_Label --
-----------------------
procedure Process_End_Label
(N : Node_Id;
Typ : Character;
Ent : Entity_Id)
is
Loc : Source_Ptr;
Nam : Node_Id;
Scop : Entity_Id;
Label_Ref : Boolean;
-- Set True if reference to end label itself is required
Endl : Node_Id;
-- Gets set to the operator symbol or identifier that references the
-- entity Ent. For the child unit case, this is the identifier from the
-- designator. For other cases, this is simply Endl.
procedure Generate_Parent_Ref (N : Node_Id; E : Entity_Id);
-- N is an identifier node that appears as a parent unit reference in
-- the case where Ent is a child unit. This procedure generates an
-- appropriate cross-reference entry. E is the corresponding entity.
-------------------------
-- Generate_Parent_Ref --
-------------------------
procedure Generate_Parent_Ref (N : Node_Id; E : Entity_Id) is
begin
-- If names do not match, something weird, skip reference
if Chars (E) = Chars (N) then
-- Generate the reference. We do NOT consider this as a reference
-- for unreferenced symbol purposes.
Generate_Reference (E, N, 'r', Set_Ref => False, Force => True);
if Style_Check then
Style.Check_Identifier (N, E);
end if;
end if;
end Generate_Parent_Ref;
-- Start of processing for Process_End_Label
begin
-- If no node, ignore. This happens in some error situations, and
-- also for some internally generated structures where no end label
-- references are required in any case.
if No (N) then
return;
end if;
-- Nothing to do if no End_Label, happens for internally generated
-- constructs where we don't want an end label reference anyway. Also
-- nothing to do if Endl is a string literal, which means there was
-- some prior error (bad operator symbol)
Endl := End_Label (N);
if No (Endl) or else Nkind (Endl) = N_String_Literal then
return;
end if;
-- Reference node is not in extended main source unit
if not In_Extended_Main_Source_Unit (N) then
-- Generally we do not collect references except for the extended
-- main source unit. The one exception is the 'e' entry for a
-- package spec, where it is useful for a client to have the
-- ending information to define scopes.
if Typ /= 'e' then
return;
else
Label_Ref := False;
-- For this case, we can ignore any parent references, but we
-- need the package name itself for the 'e' entry.
if Nkind (Endl) = N_Designator then
Endl := Identifier (Endl);
end if;
end if;
-- Reference is in extended main source unit
else
Label_Ref := True;
-- For designator, generate references for the parent entries
if Nkind (Endl) = N_Designator then
-- Generate references for the prefix if the END line comes from
-- source (otherwise we do not need these references) We climb the
-- scope stack to find the expected entities.
if Comes_From_Source (Endl) then
Nam := Name (Endl);
Scop := Current_Scope;
while Nkind (Nam) = N_Selected_Component loop
Scop := Scope (Scop);
exit when No (Scop);
Generate_Parent_Ref (Selector_Name (Nam), Scop);
Nam := Prefix (Nam);
end loop;
if Present (Scop) then
Generate_Parent_Ref (Nam, Scope (Scop));
end if;
end if;
Endl := Identifier (Endl);
end if;
end if;
-- If the end label is not for the given entity, then either we have
-- some previous error, or this is a generic instantiation for which
-- we do not need to make a cross-reference in this case anyway. In
-- either case we simply ignore the call.
if Chars (Ent) /= Chars (Endl) then
return;
end if;
-- If label was really there, then generate a normal reference and then
-- adjust the location in the end label to point past the name (which
-- should almost always be the semicolon).
Loc := Sloc (Endl);
if Comes_From_Source (Endl) then
-- If a label reference is required, then do the style check and
-- generate an l-type cross-reference entry for the label
if Label_Ref then
if Style_Check then
Style.Check_Identifier (Endl, Ent);
end if;
Generate_Reference (Ent, Endl, 'l', Set_Ref => False);
end if;
-- Set the location to point past the label (normally this will
-- mean the semicolon immediately following the label). This is
-- done for the sake of the 'e' or 't' entry generated below.
Get_Decoded_Name_String (Chars (Endl));
Set_Sloc (Endl, Sloc (Endl) + Source_Ptr (Name_Len));
else
-- In SPARK mode, no missing label is allowed for packages and
-- subprogram bodies. Detect those cases by testing whether
-- Process_End_Label was called for a body (Typ = 't') or a package.
if Restriction_Check_Required (SPARK_05)
and then (Typ = 't' or else Ekind (Ent) = E_Package)
then
Error_Msg_Node_1 := Endl;
Check_SPARK_05_Restriction
("`END &` required", Endl, Force => True);
end if;
end if;
-- Now generate the e/t reference
Generate_Reference (Ent, Endl, Typ, Set_Ref => False, Force => True);
-- Restore Sloc, in case modified above, since we have an identifier
-- and the normal Sloc should be left set in the tree.
Set_Sloc (Endl, Loc);
end Process_End_Label;
--------------------------------
-- Propagate_Concurrent_Flags --
--------------------------------
procedure Propagate_Concurrent_Flags
(Typ : Entity_Id;
Comp_Typ : Entity_Id)
is
begin
if Has_Task (Comp_Typ) then
Set_Has_Task (Typ);
end if;
if Has_Protected (Comp_Typ) then
Set_Has_Protected (Typ);
end if;
if Has_Timing_Event (Comp_Typ) then
Set_Has_Timing_Event (Typ);
end if;
end Propagate_Concurrent_Flags;
------------------------------
-- Propagate_DIC_Attributes --
------------------------------
procedure Propagate_DIC_Attributes
(Typ : Entity_Id;
From_Typ : Entity_Id)
is
DIC_Proc : Entity_Id;
begin
if Present (Typ) and then Present (From_Typ) then
pragma Assert (Is_Type (Typ) and then Is_Type (From_Typ));
-- Nothing to do if both the source and the destination denote the
-- same type.
if From_Typ = Typ then
return;
end if;
DIC_Proc := DIC_Procedure (From_Typ);
-- The setting of the attributes is intentionally conservative. This
-- prevents accidental clobbering of enabled attributes.
if Has_Inherited_DIC (From_Typ)
and then not Has_Inherited_DIC (Typ)
then
Set_Has_Inherited_DIC (Typ);
end if;
if Has_Own_DIC (From_Typ) and then not Has_Own_DIC (Typ) then
Set_Has_Own_DIC (Typ);
end if;
if Present (DIC_Proc) and then No (DIC_Procedure (Typ)) then
Set_DIC_Procedure (Typ, DIC_Proc);
end if;
end if;
end Propagate_DIC_Attributes;
------------------------------------
-- Propagate_Invariant_Attributes --
------------------------------------
procedure Propagate_Invariant_Attributes
(Typ : Entity_Id;
From_Typ : Entity_Id)
is
Full_IP : Entity_Id;
Part_IP : Entity_Id;
begin
if Present (Typ) and then Present (From_Typ) then
pragma Assert (Is_Type (Typ) and then Is_Type (From_Typ));
-- Nothing to do if both the source and the destination denote the
-- same type.
if From_Typ = Typ then
return;
end if;
Full_IP := Invariant_Procedure (From_Typ);
Part_IP := Partial_Invariant_Procedure (From_Typ);
-- The setting of the attributes is intentionally conservative. This
-- prevents accidental clobbering of enabled attributes.
if Has_Inheritable_Invariants (From_Typ)
and then not Has_Inheritable_Invariants (Typ)
then
Set_Has_Inheritable_Invariants (Typ, True);
end if;
if Has_Inherited_Invariants (From_Typ)
and then not Has_Inherited_Invariants (Typ)
then
Set_Has_Inherited_Invariants (Typ, True);
end if;
if Has_Own_Invariants (From_Typ)
and then not Has_Own_Invariants (Typ)
then
Set_Has_Own_Invariants (Typ, True);
end if;
if Present (Full_IP) and then No (Invariant_Procedure (Typ)) then
Set_Invariant_Procedure (Typ, Full_IP);
end if;
if Present (Part_IP) and then No (Partial_Invariant_Procedure (Typ))
then
Set_Partial_Invariant_Procedure (Typ, Part_IP);
end if;
end if;
end Propagate_Invariant_Attributes;
---------------------------------------
-- Record_Possible_Part_Of_Reference --
---------------------------------------
procedure Record_Possible_Part_Of_Reference
(Var_Id : Entity_Id;
Ref : Node_Id)
is
Encap : constant Entity_Id := Encapsulating_State (Var_Id);
Refs : Elist_Id;
begin
-- The variable is a constituent of a single protected/task type. Such
-- a variable acts as a component of the type and must appear within a
-- specific region (SPARK RM 9.3). Instead of recording the reference,
-- verify its legality now.
if Present (Encap) and then Is_Single_Concurrent_Object (Encap) then
Check_Part_Of_Reference (Var_Id, Ref);
-- The variable is subject to pragma Part_Of and may eventually become a
-- constituent of a single protected/task type. Record the reference to
-- verify its placement when the contract of the variable is analyzed.
elsif Present (Get_Pragma (Var_Id, Pragma_Part_Of)) then
Refs := Part_Of_References (Var_Id);
if No (Refs) then
Refs := New_Elmt_List;
Set_Part_Of_References (Var_Id, Refs);
end if;
Append_Elmt (Ref, Refs);
end if;
end Record_Possible_Part_Of_Reference;
----------------
-- Referenced --
----------------
function Referenced (Id : Entity_Id; Expr : Node_Id) return Boolean is
Seen : Boolean := False;
function Is_Reference (N : Node_Id) return Traverse_Result;
-- Determine whether node N denotes a reference to Id. If this is the
-- case, set global flag Seen to True and stop the traversal.
------------------
-- Is_Reference --
------------------
function Is_Reference (N : Node_Id) return Traverse_Result is
begin
if Is_Entity_Name (N)
and then Present (Entity (N))
and then Entity (N) = Id
then
Seen := True;
return Abandon;
else
return OK;
end if;
end Is_Reference;
procedure Inspect_Expression is new Traverse_Proc (Is_Reference);
-- Start of processing for Referenced
begin
Inspect_Expression (Expr);
return Seen;
end Referenced;
------------------------------------
-- References_Generic_Formal_Type --
------------------------------------
function References_Generic_Formal_Type (N : Node_Id) return Boolean is
function Process (N : Node_Id) return Traverse_Result;
-- Process one node in search for generic formal type
-------------
-- Process --
-------------
function Process (N : Node_Id) return Traverse_Result is
begin
if Nkind (N) in N_Has_Entity then
declare
E : constant Entity_Id := Entity (N);
begin
if Present (E) then
if Is_Generic_Type (E) then
return Abandon;
elsif Present (Etype (E))
and then Is_Generic_Type (Etype (E))
then
return Abandon;
end if;
end if;
end;
end if;
return Atree.OK;
end Process;
function Traverse is new Traverse_Func (Process);
-- Traverse tree to look for generic type
begin
if Inside_A_Generic then
return Traverse (N) = Abandon;
else
return False;
end if;
end References_Generic_Formal_Type;
--------------------
-- Remove_Homonym --
--------------------
procedure Remove_Homonym (E : Entity_Id) is
Prev : Entity_Id := Empty;
H : Entity_Id;
begin
if E = Current_Entity (E) then
if Present (Homonym (E)) then
Set_Current_Entity (Homonym (E));
else
Set_Name_Entity_Id (Chars (E), Empty);
end if;
else
H := Current_Entity (E);
while Present (H) and then H /= E loop
Prev := H;
H := Homonym (H);
end loop;
-- If E is not on the homonym chain, nothing to do
if Present (H) then
Set_Homonym (Prev, Homonym (E));
end if;
end if;
end Remove_Homonym;
------------------------------
-- Remove_Overloaded_Entity --
------------------------------
procedure Remove_Overloaded_Entity (Id : Entity_Id) is
procedure Remove_Primitive_Of (Typ : Entity_Id);
-- Remove primitive subprogram Id from the list of primitives that
-- belong to type Typ.
-------------------------
-- Remove_Primitive_Of --
-------------------------
procedure Remove_Primitive_Of (Typ : Entity_Id) is
Prims : Elist_Id;
begin
if Is_Tagged_Type (Typ) then
Prims := Direct_Primitive_Operations (Typ);
if Present (Prims) then
Remove (Prims, Id);
end if;
end if;
end Remove_Primitive_Of;
-- Local variables
Scop : constant Entity_Id := Scope (Id);
Formal : Entity_Id;
Prev_Id : Entity_Id;
-- Start of processing for Remove_Overloaded_Entity
begin
-- Remove the entity from the homonym chain. When the entity is the
-- head of the chain, associate the entry in the name table with its
-- homonym effectively making it the new head of the chain.
if Current_Entity (Id) = Id then
Set_Name_Entity_Id (Chars (Id), Homonym (Id));
-- Otherwise link the previous and next homonyms
else
Prev_Id := Current_Entity (Id);
while Present (Prev_Id) and then Homonym (Prev_Id) /= Id loop
Prev_Id := Homonym (Prev_Id);
end loop;
Set_Homonym (Prev_Id, Homonym (Id));
end if;
-- Remove the entity from the scope entity chain. When the entity is
-- the head of the chain, set the next entity as the new head of the
-- chain.
if First_Entity (Scop) = Id then
Prev_Id := Empty;
Set_First_Entity (Scop, Next_Entity (Id));
-- Otherwise the entity is either in the middle of the chain or it acts
-- as its tail. Traverse and link the previous and next entities.
else
Prev_Id := First_Entity (Scop);
while Present (Prev_Id) and then Next_Entity (Prev_Id) /= Id loop
Next_Entity (Prev_Id);
end loop;
Set_Next_Entity (Prev_Id, Next_Entity (Id));
end if;
-- Handle the case where the entity acts as the tail of the scope entity
-- chain.
if Last_Entity (Scop) = Id then
Set_Last_Entity (Scop, Prev_Id);
end if;
-- The entity denotes a primitive subprogram. Remove it from the list of
-- primitives of the associated controlling type.
if Ekind_In (Id, E_Function, E_Procedure) and then Is_Primitive (Id) then
Formal := First_Formal (Id);
while Present (Formal) loop
if Is_Controlling_Formal (Formal) then
Remove_Primitive_Of (Etype (Formal));
exit;
end if;
Next_Formal (Formal);
end loop;
if Ekind (Id) = E_Function and then Has_Controlling_Result (Id) then
Remove_Primitive_Of (Etype (Id));
end if;
end if;
end Remove_Overloaded_Entity;
---------------------
-- Rep_To_Pos_Flag --
---------------------
function Rep_To_Pos_Flag (E : Entity_Id; Loc : Source_Ptr) return Node_Id is
begin
return New_Occurrence_Of
(Boolean_Literals (not Range_Checks_Suppressed (E)), Loc);
end Rep_To_Pos_Flag;
--------------------
-- Require_Entity --
--------------------
procedure Require_Entity (N : Node_Id) is
begin
if Is_Entity_Name (N) and then No (Entity (N)) then
if Total_Errors_Detected /= 0 then
Set_Entity (N, Any_Id);
else
raise Program_Error;
end if;
end if;
end Require_Entity;
------------------------------
-- Requires_Transient_Scope --
------------------------------
-- A transient scope is required when variable-sized temporaries are
-- allocated on the secondary stack, or when finalization actions must be
-- generated before the next instruction.
function Requires_Transient_Scope (Id : Entity_Id) return Boolean is
Old_Result : constant Boolean := Old_Requires_Transient_Scope (Id);
begin
if Debug_Flag_QQ then
return Old_Result;
end if;
declare
New_Result : constant Boolean := New_Requires_Transient_Scope (Id);
begin
-- Assert that we're not putting things on the secondary stack if we
-- didn't before; we are trying to AVOID secondary stack when
-- possible.
if not Old_Result then
pragma Assert (not New_Result);
null;
end if;
if New_Result /= Old_Result then
Results_Differ (Id, Old_Result, New_Result);
end if;
return New_Result;
end;
end Requires_Transient_Scope;
--------------------
-- Results_Differ --
--------------------
procedure Results_Differ
(Id : Entity_Id;
Old_Val : Boolean;
New_Val : Boolean)
is
begin
if False then -- False to disable; True for debugging
Treepr.Print_Tree_Node (Id);
if Old_Val = New_Val then
raise Program_Error;
end if;
end if;
end Results_Differ;
--------------------------
-- Reset_Analyzed_Flags --
--------------------------
procedure Reset_Analyzed_Flags (N : Node_Id) is
function Clear_Analyzed (N : Node_Id) return Traverse_Result;
-- Function used to reset Analyzed flags in tree. Note that we do
-- not reset Analyzed flags in entities, since there is no need to
-- reanalyze entities, and indeed, it is wrong to do so, since it
-- can result in generating auxiliary stuff more than once.
--------------------
-- Clear_Analyzed --
--------------------
function Clear_Analyzed (N : Node_Id) return Traverse_Result is
begin
if Nkind (N) not in N_Entity then
Set_Analyzed (N, False);
end if;
return OK;
end Clear_Analyzed;
procedure Reset_Analyzed is new Traverse_Proc (Clear_Analyzed);
-- Start of processing for Reset_Analyzed_Flags
begin
Reset_Analyzed (N);
end Reset_Analyzed_Flags;
------------------------
-- Restore_SPARK_Mode --
------------------------
procedure Restore_SPARK_Mode (Mode : SPARK_Mode_Type) is
begin
SPARK_Mode := Mode;
end Restore_SPARK_Mode;
--------------------------------
-- Returns_Unconstrained_Type --
--------------------------------
function Returns_Unconstrained_Type (Subp : Entity_Id) return Boolean is
begin
return Ekind (Subp) = E_Function
and then not Is_Scalar_Type (Etype (Subp))
and then not Is_Access_Type (Etype (Subp))
and then not Is_Constrained (Etype (Subp));
end Returns_Unconstrained_Type;
----------------------------
-- Root_Type_Of_Full_View --
----------------------------
function Root_Type_Of_Full_View (T : Entity_Id) return Entity_Id is
Rtyp : constant Entity_Id := Root_Type (T);
begin
-- The root type of the full view may itself be a private type. Keep
-- looking for the ultimate derivation parent.
if Is_Private_Type (Rtyp) and then Present (Full_View (Rtyp)) then
return Root_Type_Of_Full_View (Full_View (Rtyp));
else
return Rtyp;
end if;
end Root_Type_Of_Full_View;
---------------------------
-- Safe_To_Capture_Value --
---------------------------
function Safe_To_Capture_Value
(N : Node_Id;
Ent : Entity_Id;
Cond : Boolean := False) return Boolean
is
begin
-- The only entities for which we track constant values are variables
-- which are not renamings, constants, out parameters, and in out
-- parameters, so check if we have this case.
-- Note: it may seem odd to track constant values for constants, but in
-- fact this routine is used for other purposes than simply capturing
-- the value. In particular, the setting of Known[_Non]_Null.
if (Ekind (Ent) = E_Variable and then No (Renamed_Object (Ent)))
or else
Ekind_In (Ent, E_Constant, E_Out_Parameter, E_In_Out_Parameter)
then
null;
-- For conditionals, we also allow loop parameters and all formals,
-- including in parameters.
elsif Cond and then Ekind_In (Ent, E_Loop_Parameter, E_In_Parameter) then
null;
-- For all other cases, not just unsafe, but impossible to capture
-- Current_Value, since the above are the only entities which have
-- Current_Value fields.
else
return False;
end if;
-- Skip if volatile or aliased, since funny things might be going on in
-- these cases which we cannot necessarily track. Also skip any variable
-- for which an address clause is given, or whose address is taken. Also
-- never capture value of library level variables (an attempt to do so
-- can occur in the case of package elaboration code).
if Treat_As_Volatile (Ent)
or else Is_Aliased (Ent)
or else Present (Address_Clause (Ent))
or else Address_Taken (Ent)
or else (Is_Library_Level_Entity (Ent)
and then Ekind (Ent) = E_Variable)
then
return False;
end if;
-- OK, all above conditions are met. We also require that the scope of
-- the reference be the same as the scope of the entity, not counting
-- packages and blocks and loops.
declare
E_Scope : constant Entity_Id := Scope (Ent);
R_Scope : Entity_Id;
begin
R_Scope := Current_Scope;
while R_Scope /= Standard_Standard loop
exit when R_Scope = E_Scope;
if not Ekind_In (R_Scope, E_Package, E_Block, E_Loop) then
return False;
else
R_Scope := Scope (R_Scope);
end if;
end loop;
end;
-- We also require that the reference does not appear in a context
-- where it is not sure to be executed (i.e. a conditional context
-- or an exception handler). We skip this if Cond is True, since the
-- capturing of values from conditional tests handles this ok.
if Cond then
return True;
end if;
declare
Desc : Node_Id;
P : Node_Id;
begin
Desc := N;
-- Seems dubious that case expressions are not handled here ???
P := Parent (N);
while Present (P) loop
if Nkind (P) = N_If_Statement
or else Nkind (P) = N_Case_Statement
or else (Nkind (P) in N_Short_Circuit
and then Desc = Right_Opnd (P))
or else (Nkind (P) = N_If_Expression
and then Desc /= First (Expressions (P)))
or else Nkind (P) = N_Exception_Handler
or else Nkind (P) = N_Selective_Accept
or else Nkind (P) = N_Conditional_Entry_Call
or else Nkind (P) = N_Timed_Entry_Call
or else Nkind (P) = N_Asynchronous_Select
then
return False;
else
Desc := P;
P := Parent (P);
-- A special Ada 2012 case: the original node may be part
-- of the else_actions of a conditional expression, in which
-- case it might not have been expanded yet, and appears in
-- a non-syntactic list of actions. In that case it is clearly
-- not safe to save a value.
if No (P)
and then Is_List_Member (Desc)
and then No (Parent (List_Containing (Desc)))
then
return False;
end if;
end if;
end loop;
end;
-- OK, looks safe to set value
return True;
end Safe_To_Capture_Value;
---------------
-- Same_Name --
---------------
function Same_Name (N1, N2 : Node_Id) return Boolean is
K1 : constant Node_Kind := Nkind (N1);
K2 : constant Node_Kind := Nkind (N2);
begin
if (K1 = N_Identifier or else K1 = N_Defining_Identifier)
and then (K2 = N_Identifier or else K2 = N_Defining_Identifier)
then
return Chars (N1) = Chars (N2);
elsif (K1 = N_Selected_Component or else K1 = N_Expanded_Name)
and then (K2 = N_Selected_Component or else K2 = N_Expanded_Name)
then
return Same_Name (Selector_Name (N1), Selector_Name (N2))
and then Same_Name (Prefix (N1), Prefix (N2));
else
return False;
end if;
end Same_Name;
-----------------
-- Same_Object --
-----------------
function Same_Object (Node1, Node2 : Node_Id) return Boolean is
N1 : constant Node_Id := Original_Node (Node1);
N2 : constant Node_Id := Original_Node (Node2);
-- We do the tests on original nodes, since we are most interested
-- in the original source, not any expansion that got in the way.
K1 : constant Node_Kind := Nkind (N1);
K2 : constant Node_Kind := Nkind (N2);
begin
-- First case, both are entities with same entity
if K1 in N_Has_Entity and then K2 in N_Has_Entity then
declare
EN1 : constant Entity_Id := Entity (N1);
EN2 : constant Entity_Id := Entity (N2);
begin
if Present (EN1) and then Present (EN2)
and then (Ekind_In (EN1, E_Variable, E_Constant)
or else Is_Formal (EN1))
and then EN1 = EN2
then
return True;
end if;
end;
end if;
-- Second case, selected component with same selector, same record
if K1 = N_Selected_Component
and then K2 = N_Selected_Component
and then Chars (Selector_Name (N1)) = Chars (Selector_Name (N2))
then
return Same_Object (Prefix (N1), Prefix (N2));
-- Third case, indexed component with same subscripts, same array
elsif K1 = N_Indexed_Component
and then K2 = N_Indexed_Component
and then Same_Object (Prefix (N1), Prefix (N2))
then
declare
E1, E2 : Node_Id;
begin
E1 := First (Expressions (N1));
E2 := First (Expressions (N2));
while Present (E1) loop
if not Same_Value (E1, E2) then
return False;
else
Next (E1);
Next (E2);
end if;
end loop;
return True;
end;
-- Fourth case, slice of same array with same bounds
elsif K1 = N_Slice
and then K2 = N_Slice
and then Nkind (Discrete_Range (N1)) = N_Range
and then Nkind (Discrete_Range (N2)) = N_Range
and then Same_Value (Low_Bound (Discrete_Range (N1)),
Low_Bound (Discrete_Range (N2)))
and then Same_Value (High_Bound (Discrete_Range (N1)),
High_Bound (Discrete_Range (N2)))
then
return Same_Name (Prefix (N1), Prefix (N2));
-- All other cases, not clearly the same object
else
return False;
end if;
end Same_Object;
---------------
-- Same_Type --
---------------
function Same_Type (T1, T2 : Entity_Id) return Boolean is
begin
if T1 = T2 then
return True;
elsif not Is_Constrained (T1)
and then not Is_Constrained (T2)
and then Base_Type (T1) = Base_Type (T2)
then
return True;
-- For now don't bother with case of identical constraints, to be
-- fiddled with later on perhaps (this is only used for optimization
-- purposes, so it is not critical to do a best possible job)
else
return False;
end if;
end Same_Type;
----------------
-- Same_Value --
----------------
function Same_Value (Node1, Node2 : Node_Id) return Boolean is
begin
if Compile_Time_Known_Value (Node1)
and then Compile_Time_Known_Value (Node2)
and then Expr_Value (Node1) = Expr_Value (Node2)
then
return True;
elsif Same_Object (Node1, Node2) then
return True;
else
return False;
end if;
end Same_Value;
-----------------------------
-- Save_SPARK_Mode_And_Set --
-----------------------------
procedure Save_SPARK_Mode_And_Set
(Context : Entity_Id;
Mode : out SPARK_Mode_Type)
is
begin
-- Save the current mode in effect
Mode := SPARK_Mode;
-- Do not consider illegal or partially decorated constructs
if Ekind (Context) = E_Void or else Error_Posted (Context) then
null;
elsif Present (SPARK_Pragma (Context)) then
SPARK_Mode := Get_SPARK_Mode_From_Annotation (SPARK_Pragma (Context));
end if;
end Save_SPARK_Mode_And_Set;
-------------------------
-- Scalar_Part_Present --
-------------------------
function Scalar_Part_Present (T : Entity_Id) return Boolean is
C : Entity_Id;
begin
if Is_Scalar_Type (T) then
return True;
elsif Is_Array_Type (T) then
return Scalar_Part_Present (Component_Type (T));
elsif Is_Record_Type (T) or else Has_Discriminants (T) then
C := First_Component_Or_Discriminant (T);
while Present (C) loop
if Scalar_Part_Present (Etype (C)) then
return True;
else
Next_Component_Or_Discriminant (C);
end if;
end loop;
end if;
return False;
end Scalar_Part_Present;
------------------------
-- Scope_Is_Transient --
------------------------
function Scope_Is_Transient return Boolean is
begin
return Scope_Stack.Table (Scope_Stack.Last).Is_Transient;
end Scope_Is_Transient;
------------------
-- Scope_Within --
------------------
function Scope_Within (Scope1, Scope2 : Entity_Id) return Boolean is
Scop : Entity_Id;
begin
Scop := Scope1;
while Scop /= Standard_Standard loop
Scop := Scope (Scop);
if Scop = Scope2 then
return True;
end if;
end loop;
return False;
end Scope_Within;
--------------------------
-- Scope_Within_Or_Same --
--------------------------
function Scope_Within_Or_Same (Scope1, Scope2 : Entity_Id) return Boolean is
Scop : Entity_Id;
begin
Scop := Scope1;
while Scop /= Standard_Standard loop
if Scop = Scope2 then
return True;
else
Scop := Scope (Scop);
end if;
end loop;
return False;
end Scope_Within_Or_Same;
--------------------
-- Set_Convention --
--------------------
procedure Set_Convention (E : Entity_Id; Val : Snames.Convention_Id) is
begin
Basic_Set_Convention (E, Val);
if Is_Type (E)
and then Is_Access_Subprogram_Type (Base_Type (E))
and then Has_Foreign_Convention (E)
then
-- A pragma Convention in an instance may apply to the subtype
-- created for a formal, in which case we have already verified
-- that conventions of actual and formal match and there is nothing
-- to flag on the subtype.
if In_Instance then
null;
else
Set_Can_Use_Internal_Rep (E, False);
end if;
end if;
-- If E is an object or component, and the type of E is an anonymous
-- access type with no convention set, then also set the convention of
-- the anonymous access type. We do not do this for anonymous protected
-- types, since protected types always have the default convention.
if Present (Etype (E))
and then (Is_Object (E)
or else Ekind (E) = E_Component
-- Allow E_Void (happens for pragma Convention appearing
-- in the middle of a record applying to a component)
or else Ekind (E) = E_Void)
then
declare
Typ : constant Entity_Id := Etype (E);
begin
if Ekind_In (Typ, E_Anonymous_Access_Type,
E_Anonymous_Access_Subprogram_Type)
and then not Has_Convention_Pragma (Typ)
then
Basic_Set_Convention (Typ, Val);
Set_Has_Convention_Pragma (Typ);
-- And for the access subprogram type, deal similarly with the
-- designated E_Subprogram_Type if it is also internal (which
-- it always is?)
if Ekind (Typ) = E_Anonymous_Access_Subprogram_Type then
declare
Dtype : constant Entity_Id := Designated_Type (Typ);
begin
if Ekind (Dtype) = E_Subprogram_Type
and then Is_Itype (Dtype)
and then not Has_Convention_Pragma (Dtype)
then
Basic_Set_Convention (Dtype, Val);
Set_Has_Convention_Pragma (Dtype);
end if;
end;
end if;
end if;
end;
end if;
end Set_Convention;
------------------------
-- Set_Current_Entity --
------------------------
-- The given entity is to be set as the currently visible definition of its
-- associated name (i.e. the Node_Id associated with its name). All we have
-- to do is to get the name from the identifier, and then set the
-- associated Node_Id to point to the given entity.
procedure Set_Current_Entity (E : Entity_Id) is
begin
Set_Name_Entity_Id (Chars (E), E);
end Set_Current_Entity;
---------------------------
-- Set_Debug_Info_Needed --
---------------------------
procedure Set_Debug_Info_Needed (T : Entity_Id) is
procedure Set_Debug_Info_Needed_If_Not_Set (E : Entity_Id);
pragma Inline (Set_Debug_Info_Needed_If_Not_Set);
-- Used to set debug info in a related node if not set already
--------------------------------------
-- Set_Debug_Info_Needed_If_Not_Set --
--------------------------------------
procedure Set_Debug_Info_Needed_If_Not_Set (E : Entity_Id) is
begin
if Present (E) and then not Needs_Debug_Info (E) then
Set_Debug_Info_Needed (E);
-- For a private type, indicate that the full view also needs
-- debug information.
if Is_Type (E)
and then Is_Private_Type (E)
and then Present (Full_View (E))
then
Set_Debug_Info_Needed (Full_View (E));
end if;
end if;
end Set_Debug_Info_Needed_If_Not_Set;
-- Start of processing for Set_Debug_Info_Needed
begin
-- Nothing to do if argument is Empty or has Debug_Info_Off set, which
-- indicates that Debug_Info_Needed is never required for the entity.
-- Nothing to do if entity comes from a predefined file. Library files
-- are compiled without debug information, but inlined bodies of these
-- routines may appear in user code, and debug information on them ends
-- up complicating debugging the user code.
if No (T)
or else Debug_Info_Off (T)
then
return;
elsif In_Inlined_Body
and then Is_Predefined_File_Name
(Unit_File_Name (Get_Source_Unit (Sloc (T))))
then
Set_Needs_Debug_Info (T, False);
end if;
-- Set flag in entity itself. Note that we will go through the following
-- circuitry even if the flag is already set on T. That's intentional,
-- it makes sure that the flag will be set in subsidiary entities.
Set_Needs_Debug_Info (T);
-- Set flag on subsidiary entities if not set already
if Is_Object (T) then
Set_Debug_Info_Needed_If_Not_Set (Etype (T));
elsif Is_Type (T) then
Set_Debug_Info_Needed_If_Not_Set (Etype (T));
if Is_Record_Type (T) then
declare
Ent : Entity_Id := First_Entity (T);
begin
while Present (Ent) loop
Set_Debug_Info_Needed_If_Not_Set (Ent);
Next_Entity (Ent);
end loop;
end;
-- For a class wide subtype, we also need debug information
-- for the equivalent type.
if Ekind (T) = E_Class_Wide_Subtype then
Set_Debug_Info_Needed_If_Not_Set (Equivalent_Type (T));
end if;
elsif Is_Array_Type (T) then
Set_Debug_Info_Needed_If_Not_Set (Component_Type (T));
declare
Indx : Node_Id := First_Index (T);
begin
while Present (Indx) loop
Set_Debug_Info_Needed_If_Not_Set (Etype (Indx));
Indx := Next_Index (Indx);
end loop;
end;
-- For a packed array type, we also need debug information for
-- the type used to represent the packed array. Conversely, we
-- also need it for the former if we need it for the latter.
if Is_Packed (T) then
Set_Debug_Info_Needed_If_Not_Set (Packed_Array_Impl_Type (T));
end if;
if Is_Packed_Array_Impl_Type (T) then
Set_Debug_Info_Needed_If_Not_Set (Original_Array_Type (T));
end if;
elsif Is_Access_Type (T) then
Set_Debug_Info_Needed_If_Not_Set (Directly_Designated_Type (T));
elsif Is_Private_Type (T) then
declare
FV : constant Entity_Id := Full_View (T);
begin
Set_Debug_Info_Needed_If_Not_Set (FV);
-- If the full view is itself a derived private type, we need
-- debug information on its underlying type.
if Present (FV)
and then Is_Private_Type (FV)
and then Present (Underlying_Full_View (FV))
then
Set_Needs_Debug_Info (Underlying_Full_View (FV));
end if;
end;
elsif Is_Protected_Type (T) then
Set_Debug_Info_Needed_If_Not_Set (Corresponding_Record_Type (T));
elsif Is_Scalar_Type (T) then
-- If the subrange bounds are materialized by dedicated constant
-- objects, also include them in the debug info to make sure the
-- debugger can properly use them.
if Present (Scalar_Range (T))
and then Nkind (Scalar_Range (T)) = N_Range
then
declare
Low_Bnd : constant Node_Id := Type_Low_Bound (T);
High_Bnd : constant Node_Id := Type_High_Bound (T);
begin
if Is_Entity_Name (Low_Bnd) then
Set_Debug_Info_Needed_If_Not_Set (Entity (Low_Bnd));
end if;
if Is_Entity_Name (High_Bnd) then
Set_Debug_Info_Needed_If_Not_Set (Entity (High_Bnd));
end if;
end;
end if;
end if;
end if;
end Set_Debug_Info_Needed;
----------------------------
-- Set_Entity_With_Checks --
----------------------------
procedure Set_Entity_With_Checks (N : Node_Id; Val : Entity_Id) is
Val_Actual : Entity_Id;
Nod : Node_Id;
Post_Node : Node_Id;
begin
-- Unconditionally set the entity
Set_Entity (N, Val);
-- The node to post on is the selector in the case of an expanded name,
-- and otherwise the node itself.
if Nkind (N) = N_Expanded_Name then
Post_Node := Selector_Name (N);
else
Post_Node := N;
end if;
-- Check for violation of No_Fixed_IO
if Restriction_Check_Required (No_Fixed_IO)
and then
((RTU_Loaded (Ada_Text_IO)
and then (Is_RTE (Val, RE_Decimal_IO)
or else
Is_RTE (Val, RE_Fixed_IO)))
or else
(RTU_Loaded (Ada_Wide_Text_IO)
and then (Is_RTE (Val, RO_WT_Decimal_IO)
or else
Is_RTE (Val, RO_WT_Fixed_IO)))
or else
(RTU_Loaded (Ada_Wide_Wide_Text_IO)
and then (Is_RTE (Val, RO_WW_Decimal_IO)
or else
Is_RTE (Val, RO_WW_Fixed_IO))))
-- A special extra check, don't complain about a reference from within
-- the Ada.Interrupts package itself!
and then not In_Same_Extended_Unit (N, Val)
then
Check_Restriction (No_Fixed_IO, Post_Node);
end if;
-- Remaining checks are only done on source nodes. Note that we test
-- for violation of No_Fixed_IO even on non-source nodes, because the
-- cases for checking violations of this restriction are instantiations
-- where the reference in the instance has Comes_From_Source False.
if not Comes_From_Source (N) then
return;
end if;
-- Check for violation of No_Abort_Statements, which is triggered by
-- call to Ada.Task_Identification.Abort_Task.
if Restriction_Check_Required (No_Abort_Statements)
and then (Is_RTE (Val, RE_Abort_Task))
-- A special extra check, don't complain about a reference from within
-- the Ada.Task_Identification package itself!
and then not In_Same_Extended_Unit (N, Val)
then
Check_Restriction (No_Abort_Statements, Post_Node);
end if;
if Val = Standard_Long_Long_Integer then
Check_Restriction (No_Long_Long_Integers, Post_Node);
end if;
-- Check for violation of No_Dynamic_Attachment
if Restriction_Check_Required (No_Dynamic_Attachment)
and then RTU_Loaded (Ada_Interrupts)
and then (Is_RTE (Val, RE_Is_Reserved) or else
Is_RTE (Val, RE_Is_Attached) or else
Is_RTE (Val, RE_Current_Handler) or else
Is_RTE (Val, RE_Attach_Handler) or else
Is_RTE (Val, RE_Exchange_Handler) or else
Is_RTE (Val, RE_Detach_Handler) or else
Is_RTE (Val, RE_Reference))
-- A special extra check, don't complain about a reference from within
-- the Ada.Interrupts package itself!
and then not In_Same_Extended_Unit (N, Val)
then
Check_Restriction (No_Dynamic_Attachment, Post_Node);
end if;
-- Check for No_Implementation_Identifiers
if Restriction_Check_Required (No_Implementation_Identifiers) then
-- We have an implementation defined entity if it is marked as
-- implementation defined, or is defined in a package marked as
-- implementation defined. However, library packages themselves
-- are excluded (we don't want to flag Interfaces itself, just
-- the entities within it).
if (Is_Implementation_Defined (Val)
or else
(Present (Scope (Val))
and then Is_Implementation_Defined (Scope (Val))))
and then not (Ekind_In (Val, E_Package, E_Generic_Package)
and then Is_Library_Level_Entity (Val))
then
Check_Restriction (No_Implementation_Identifiers, Post_Node);
end if;
end if;
-- Do the style check
if Style_Check
and then not Suppress_Style_Checks (Val)
and then not In_Instance
then
if Nkind (N) = N_Identifier then
Nod := N;
elsif Nkind (N) = N_Expanded_Name then
Nod := Selector_Name (N);
else
return;
end if;
-- A special situation arises for derived operations, where we want
-- to do the check against the parent (since the Sloc of the derived
-- operation points to the derived type declaration itself).
Val_Actual := Val;
while not Comes_From_Source (Val_Actual)
and then Nkind (Val_Actual) in N_Entity
and then (Ekind (Val_Actual) = E_Enumeration_Literal
or else Is_Subprogram_Or_Generic_Subprogram (Val_Actual))
and then Present (Alias (Val_Actual))
loop
Val_Actual := Alias (Val_Actual);
end loop;
-- Renaming declarations for generic actuals do not come from source,
-- and have a different name from that of the entity they rename, so
-- there is no style check to perform here.
if Chars (Nod) = Chars (Val_Actual) then
Style.Check_Identifier (Nod, Val_Actual);
end if;
end if;
Set_Entity (N, Val);
end Set_Entity_With_Checks;
------------------------
-- Set_Name_Entity_Id --
------------------------
procedure Set_Name_Entity_Id (Id : Name_Id; Val : Entity_Id) is
begin
Set_Name_Table_Int (Id, Int (Val));
end Set_Name_Entity_Id;
---------------------
-- Set_Next_Actual --
---------------------
procedure Set_Next_Actual (Ass1_Id : Node_Id; Ass2_Id : Node_Id) is
begin
if Nkind (Parent (Ass1_Id)) = N_Parameter_Association then
Set_First_Named_Actual (Parent (Ass1_Id), Ass2_Id);
end if;
end Set_Next_Actual;
----------------------------------
-- Set_Optimize_Alignment_Flags --
----------------------------------
procedure Set_Optimize_Alignment_Flags (E : Entity_Id) is
begin
if Optimize_Alignment = 'S' then
Set_Optimize_Alignment_Space (E);
elsif Optimize_Alignment = 'T' then
Set_Optimize_Alignment_Time (E);
end if;
end Set_Optimize_Alignment_Flags;
-----------------------
-- Set_Public_Status --
-----------------------
procedure Set_Public_Status (Id : Entity_Id) is
S : constant Entity_Id := Current_Scope;
function Within_HSS_Or_If (E : Entity_Id) return Boolean;
-- Determines if E is defined within handled statement sequence or
-- an if statement, returns True if so, False otherwise.
----------------------
-- Within_HSS_Or_If --
----------------------
function Within_HSS_Or_If (E : Entity_Id) return Boolean is
N : Node_Id;
begin
N := Declaration_Node (E);
loop
N := Parent (N);
if No (N) then
return False;
elsif Nkind_In (N, N_Handled_Sequence_Of_Statements,
N_If_Statement)
then
return True;
end if;
end loop;
end Within_HSS_Or_If;
-- Start of processing for Set_Public_Status
begin
-- Everything in the scope of Standard is public
if S = Standard_Standard then
Set_Is_Public (Id);
-- Entity is definitely not public if enclosing scope is not public
elsif not Is_Public (S) then
return;
-- An object or function declaration that occurs in a handled sequence
-- of statements or within an if statement is the declaration for a
-- temporary object or local subprogram generated by the expander. It
-- never needs to be made public and furthermore, making it public can
-- cause back end problems.
elsif Nkind_In (Parent (Id), N_Object_Declaration,
N_Function_Specification)
and then Within_HSS_Or_If (Id)
then
return;
-- Entities in public packages or records are public
elsif Ekind (S) = E_Package or Is_Record_Type (S) then
Set_Is_Public (Id);
-- The bounds of an entry family declaration can generate object
-- declarations that are visible to the back-end, e.g. in the
-- the declaration of a composite type that contains tasks.
elsif Is_Concurrent_Type (S)
and then not Has_Completion (S)
and then Nkind (Parent (Id)) = N_Object_Declaration
then
Set_Is_Public (Id);
end if;
end Set_Public_Status;
-----------------------------
-- Set_Referenced_Modified --
-----------------------------
procedure Set_Referenced_Modified (N : Node_Id; Out_Param : Boolean) is
Pref : Node_Id;
begin
-- Deal with indexed or selected component where prefix is modified
if Nkind_In (N, N_Indexed_Component, N_Selected_Component) then
Pref := Prefix (N);
-- If prefix is access type, then it is the designated object that is
-- being modified, which means we have no entity to set the flag on.
if No (Etype (Pref)) or else Is_Access_Type (Etype (Pref)) then
return;
-- Otherwise chase the prefix
else
Set_Referenced_Modified (Pref, Out_Param);
end if;
-- Otherwise see if we have an entity name (only other case to process)
elsif Is_Entity_Name (N) and then Present (Entity (N)) then
Set_Referenced_As_LHS (Entity (N), not Out_Param);
Set_Referenced_As_Out_Parameter (Entity (N), Out_Param);
end if;
end Set_Referenced_Modified;
------------------
-- Set_Rep_Info --
------------------
procedure Set_Rep_Info (T1, T2 : Entity_Id) is
begin
Set_Is_Atomic (T1, Is_Atomic (T2));
Set_Is_Independent (T1, Is_Independent (T2));
Set_Is_Volatile_Full_Access (T1, Is_Volatile_Full_Access (T2));
if Is_Base_Type (T1) then
Set_Is_Volatile (T1, Is_Volatile (T2));
end if;
end Set_Rep_Info;
----------------------------
-- Set_Scope_Is_Transient --
----------------------------
procedure Set_Scope_Is_Transient (V : Boolean := True) is
begin
Scope_Stack.Table (Scope_Stack.Last).Is_Transient := V;
end Set_Scope_Is_Transient;
-------------------
-- Set_Size_Info --
-------------------
procedure Set_Size_Info (T1, T2 : Entity_Id) is
begin
-- We copy Esize, but not RM_Size, since in general RM_Size is
-- subtype specific and does not get inherited by all subtypes.
Set_Esize (T1, Esize (T2));
Set_Has_Biased_Representation (T1, Has_Biased_Representation (T2));
if Is_Discrete_Or_Fixed_Point_Type (T1)
and then
Is_Discrete_Or_Fixed_Point_Type (T2)
then
Set_Is_Unsigned_Type (T1, Is_Unsigned_Type (T2));
end if;
Set_Alignment (T1, Alignment (T2));
end Set_Size_Info;
--------------------
-- Static_Boolean --
--------------------
function Static_Boolean (N : Node_Id) return Uint is
begin
Analyze_And_Resolve (N, Standard_Boolean);
if N = Error
or else Error_Posted (N)
or else Etype (N) = Any_Type
then
return No_Uint;
end if;
if Is_OK_Static_Expression (N) then
if not Raises_Constraint_Error (N) then
return Expr_Value (N);
else
return No_Uint;
end if;
elsif Etype (N) = Any_Type then
return No_Uint;
else
Flag_Non_Static_Expr
("static boolean expression required here", N);
return No_Uint;
end if;
end Static_Boolean;
--------------------
-- Static_Integer --
--------------------
function Static_Integer (N : Node_Id) return Uint is
begin
Analyze_And_Resolve (N, Any_Integer);
if N = Error
or else Error_Posted (N)
or else Etype (N) = Any_Type
then
return No_Uint;
end if;
if Is_OK_Static_Expression (N) then
if not Raises_Constraint_Error (N) then
return Expr_Value (N);
else
return No_Uint;
end if;
elsif Etype (N) = Any_Type then
return No_Uint;
else
Flag_Non_Static_Expr
("static integer expression required here", N);
return No_Uint;
end if;
end Static_Integer;
--------------------------
-- Statically_Different --
--------------------------
function Statically_Different (E1, E2 : Node_Id) return Boolean is
R1 : constant Node_Id := Get_Referenced_Object (E1);
R2 : constant Node_Id := Get_Referenced_Object (E2);
begin
return Is_Entity_Name (R1)
and then Is_Entity_Name (R2)
and then Entity (R1) /= Entity (R2)
and then not Is_Formal (Entity (R1))
and then not Is_Formal (Entity (R2));
end Statically_Different;
--------------------------------------
-- Subject_To_Loop_Entry_Attributes --
--------------------------------------
function Subject_To_Loop_Entry_Attributes (N : Node_Id) return Boolean is
Stmt : Node_Id;
begin
Stmt := N;
-- The expansion mechanism transform a loop subject to at least one
-- 'Loop_Entry attribute into a conditional block. Infinite loops lack
-- the conditional part.
if Nkind_In (Stmt, N_Block_Statement, N_If_Statement)
and then Nkind (Original_Node (N)) = N_Loop_Statement
then
Stmt := Original_Node (N);
end if;
return
Nkind (Stmt) = N_Loop_Statement
and then Present (Identifier (Stmt))
and then Present (Entity (Identifier (Stmt)))
and then Has_Loop_Entry_Attributes (Entity (Identifier (Stmt)));
end Subject_To_Loop_Entry_Attributes;
-----------------------------
-- Subprogram_Access_Level --
-----------------------------
function Subprogram_Access_Level (Subp : Entity_Id) return Uint is
begin
if Present (Alias (Subp)) then
return Subprogram_Access_Level (Alias (Subp));
else
return Scope_Depth (Enclosing_Dynamic_Scope (Subp));
end if;
end Subprogram_Access_Level;
-------------------------------
-- Support_Atomic_Primitives --
-------------------------------
function Support_Atomic_Primitives (Typ : Entity_Id) return Boolean is
Size : Int;
begin
-- Verify the alignment of Typ is known
if not Known_Alignment (Typ) then
return False;
end if;
if Known_Static_Esize (Typ) then
Size := UI_To_Int (Esize (Typ));
-- If the Esize (Object_Size) is unknown at compile time, look at the
-- RM_Size (Value_Size) which may have been set by an explicit rep item.
elsif Known_Static_RM_Size (Typ) then
Size := UI_To_Int (RM_Size (Typ));
-- Otherwise, the size is considered to be unknown.
else
return False;
end if;
-- Check that the size of the component is 8, 16, 32, or 64 bits and
-- that Typ is properly aligned.
case Size is
when 8 | 16 | 32 | 64 =>
return Size = UI_To_Int (Alignment (Typ)) * 8;
when others =>
return False;
end case;
end Support_Atomic_Primitives;
-----------------
-- Trace_Scope --
-----------------
procedure Trace_Scope (N : Node_Id; E : Entity_Id; Msg : String) is
begin
if Debug_Flag_W then
for J in 0 .. Scope_Stack.Last loop
Write_Str (" ");
end loop;
Write_Str (Msg);
Write_Name (Chars (E));
Write_Str (" from ");
Write_Location (Sloc (N));
Write_Eol;
end if;
end Trace_Scope;
-----------------------
-- Transfer_Entities --
-----------------------
procedure Transfer_Entities (From : Entity_Id; To : Entity_Id) is
procedure Set_Public_Status_Of (Id : Entity_Id);
-- Set the Is_Public attribute of arbitrary entity Id by calling routine
-- Set_Public_Status. If successfull and Id denotes a record type, set
-- the Is_Public attribute of its fields.
--------------------------
-- Set_Public_Status_Of --
--------------------------
procedure Set_Public_Status_Of (Id : Entity_Id) is
Field : Entity_Id;
begin
if not Is_Public (Id) then
Set_Public_Status (Id);
-- When the input entity is a public record type, ensure that all
-- its internal fields are also exposed to the linker. The fields
-- of a class-wide type are never made public.
if Is_Public (Id)
and then Is_Record_Type (Id)
and then not Is_Class_Wide_Type (Id)
then
Field := First_Entity (Id);
while Present (Field) loop
Set_Is_Public (Field);
Next_Entity (Field);
end loop;
end if;
end if;
end Set_Public_Status_Of;
-- Local variables
Full_Id : Entity_Id;
Id : Entity_Id;
-- Start of processing for Transfer_Entities
begin
Id := First_Entity (From);
if Present (Id) then
-- Merge the entity chain of the source scope with that of the
-- destination scope.
if Present (Last_Entity (To)) then
Set_Next_Entity (Last_Entity (To), Id);
else
Set_First_Entity (To, Id);
end if;
Set_Last_Entity (To, Last_Entity (From));
-- Inspect the entities of the source scope and update their Scope
-- attribute.
while Present (Id) loop
Set_Scope (Id, To);
Set_Public_Status_Of (Id);
-- Handle an internally generated full view for a private type
if Is_Private_Type (Id)
and then Present (Full_View (Id))
and then Is_Itype (Full_View (Id))
then
Full_Id := Full_View (Id);
Set_Scope (Full_Id, To);
Set_Public_Status_Of (Full_Id);
end if;
Next_Entity (Id);
end loop;
Set_First_Entity (From, Empty);
Set_Last_Entity (From, Empty);
end if;
end Transfer_Entities;
-----------------------
-- Type_Access_Level --
-----------------------
function Type_Access_Level (Typ : Entity_Id) return Uint is
Btyp : Entity_Id;
begin
Btyp := Base_Type (Typ);
-- Ada 2005 (AI-230): For most cases of anonymous access types, we
-- simply use the level where the type is declared. This is true for
-- stand-alone object declarations, and for anonymous access types
-- associated with components the level is the same as that of the
-- enclosing composite type. However, special treatment is needed for
-- the cases of access parameters, return objects of an anonymous access
-- type, and, in Ada 95, access discriminants of limited types.
if Is_Access_Type (Btyp) then
if Ekind (Btyp) = E_Anonymous_Access_Type then
-- If the type is a nonlocal anonymous access type (such as for
-- an access parameter) we treat it as being declared at the
-- library level to ensure that names such as X.all'access don't
-- fail static accessibility checks.
if not Is_Local_Anonymous_Access (Typ) then
return Scope_Depth (Standard_Standard);
-- If this is a return object, the accessibility level is that of
-- the result subtype of the enclosing function. The test here is
-- little complicated, because we have to account for extended
-- return statements that have been rewritten as blocks, in which
-- case we have to find and the Is_Return_Object attribute of the
-- itype's associated object. It would be nice to find a way to
-- simplify this test, but it doesn't seem worthwhile to add a new
-- flag just for purposes of this test. ???
elsif Ekind (Scope (Btyp)) = E_Return_Statement
or else
(Is_Itype (Btyp)
and then Nkind (Associated_Node_For_Itype (Btyp)) =
N_Object_Declaration
and then Is_Return_Object
(Defining_Identifier
(Associated_Node_For_Itype (Btyp))))
then
declare
Scop : Entity_Id;
begin
Scop := Scope (Scope (Btyp));
while Present (Scop) loop
exit when Ekind (Scop) = E_Function;
Scop := Scope (Scop);
end loop;
-- Treat the return object's type as having the level of the
-- function's result subtype (as per RM05-6.5(5.3/2)).
return Type_Access_Level (Etype (Scop));
end;
end if;
end if;
Btyp := Root_Type (Btyp);
-- The accessibility level of anonymous access types associated with
-- discriminants is that of the current instance of the type, and
-- that's deeper than the type itself (AARM 3.10.2 (12.3.21)).
-- AI-402: access discriminants have accessibility based on the
-- object rather than the type in Ada 2005, so the above paragraph
-- doesn't apply.
-- ??? Needs completion with rules from AI-416
if Ada_Version <= Ada_95
and then Ekind (Typ) = E_Anonymous_Access_Type
and then Present (Associated_Node_For_Itype (Typ))
and then Nkind (Associated_Node_For_Itype (Typ)) =
N_Discriminant_Specification
then
return Scope_Depth (Enclosing_Dynamic_Scope (Btyp)) + 1;
end if;
end if;
-- Return library level for a generic formal type. This is done because
-- RM(10.3.2) says that "The statically deeper relationship does not
-- apply to ... a descendant of a generic formal type". Rather than
-- checking at each point where a static accessibility check is
-- performed to see if we are dealing with a formal type, this rule is
-- implemented by having Type_Access_Level and Deepest_Type_Access_Level
-- return extreme values for a formal type; Deepest_Type_Access_Level
-- returns Int'Last. By calling the appropriate function from among the
-- two, we ensure that the static accessibility check will pass if we
-- happen to run into a formal type. More specifically, we should call
-- Deepest_Type_Access_Level instead of Type_Access_Level whenever the
-- call occurs as part of a static accessibility check and the error
-- case is the case where the type's level is too shallow (as opposed
-- to too deep).
if Is_Generic_Type (Root_Type (Btyp)) then
return Scope_Depth (Standard_Standard);
end if;
return Scope_Depth (Enclosing_Dynamic_Scope (Btyp));
end Type_Access_Level;
------------------------------------
-- Type_Without_Stream_Operation --
------------------------------------
function Type_Without_Stream_Operation
(T : Entity_Id;
Op : TSS_Name_Type := TSS_Null) return Entity_Id
is
BT : constant Entity_Id := Base_Type (T);
Op_Missing : Boolean;
begin
if not Restriction_Active (No_Default_Stream_Attributes) then
return Empty;
end if;
if Is_Elementary_Type (T) then
if Op = TSS_Null then
Op_Missing :=
No (TSS (BT, TSS_Stream_Read))
or else No (TSS (BT, TSS_Stream_Write));
else
Op_Missing := No (TSS (BT, Op));
end if;
if Op_Missing then
return T;
else
return Empty;
end if;
elsif Is_Array_Type (T) then
return Type_Without_Stream_Operation (Component_Type (T), Op);
elsif Is_Record_Type (T) then
declare
Comp : Entity_Id;
C_Typ : Entity_Id;
begin
Comp := First_Component (T);
while Present (Comp) loop
C_Typ := Type_Without_Stream_Operation (Etype (Comp), Op);
if Present (C_Typ) then
return C_Typ;
end if;
Next_Component (Comp);
end loop;
return Empty;
end;
elsif Is_Private_Type (T) and then Present (Full_View (T)) then
return Type_Without_Stream_Operation (Full_View (T), Op);
else
return Empty;
end if;
end Type_Without_Stream_Operation;
----------------------------
-- Unique_Defining_Entity --
----------------------------
function Unique_Defining_Entity (N : Node_Id) return Entity_Id is
begin
return Unique_Entity (Defining_Entity (N));
end Unique_Defining_Entity;
-------------------
-- Unique_Entity --
-------------------
function Unique_Entity (E : Entity_Id) return Entity_Id is
U : Entity_Id := E;
P : Node_Id;
begin
case Ekind (E) is
when E_Constant =>
if Present (Full_View (E)) then
U := Full_View (E);
end if;
when Entry_Kind =>
if Nkind (Parent (E)) = N_Entry_Body then
declare
Prot_Item : Entity_Id;
Prot_Type : Entity_Id;
begin
if Ekind (E) = E_Entry then
Prot_Type := Scope (E);
-- Bodies of entry families are nested within an extra scope
-- that contains an entry index declaration
else
Prot_Type := Scope (Scope (E));
end if;
pragma Assert (Ekind (Prot_Type) = E_Protected_Type);
-- Traverse the entity list of the protected type and locate
-- an entry declaration which matches the entry body.
Prot_Item := First_Entity (Prot_Type);
while Present (Prot_Item) loop
if Ekind (Prot_Item) in Entry_Kind
and then Corresponding_Body (Parent (Prot_Item)) = E
then
U := Prot_Item;
exit;
end if;
Next_Entity (Prot_Item);
end loop;
end;
end if;
when Formal_Kind =>
if Present (Spec_Entity (E)) then
U := Spec_Entity (E);
end if;
when E_Package_Body =>
P := Parent (E);
if Nkind (P) = N_Defining_Program_Unit_Name then
P := Parent (P);
end if;
if Nkind (P) = N_Package_Body
and then Present (Corresponding_Spec (P))
then
U := Corresponding_Spec (P);
elsif Nkind (P) = N_Package_Body_Stub
and then Present (Corresponding_Spec_Of_Stub (P))
then
U := Corresponding_Spec_Of_Stub (P);
end if;
when E_Protected_Body =>
P := Parent (E);
if Nkind (P) = N_Protected_Body
and then Present (Corresponding_Spec (P))
then
U := Corresponding_Spec (P);
elsif Nkind (P) = N_Protected_Body_Stub
and then Present (Corresponding_Spec_Of_Stub (P))
then
U := Corresponding_Spec_Of_Stub (P);
if Is_Single_Protected_Object (U) then
U := Etype (U);
end if;
end if;
when E_Subprogram_Body =>
P := Parent (E);
if Nkind (P) = N_Defining_Program_Unit_Name then
P := Parent (P);
end if;
P := Parent (P);
if Nkind (P) = N_Subprogram_Body
and then Present (Corresponding_Spec (P))
then
U := Corresponding_Spec (P);
elsif Nkind (P) = N_Subprogram_Body_Stub
and then Present (Corresponding_Spec_Of_Stub (P))
then
U := Corresponding_Spec_Of_Stub (P);
elsif Nkind (P) = N_Subprogram_Renaming_Declaration then
U := Corresponding_Spec (P);
end if;
when E_Task_Body =>
P := Parent (E);
if Nkind (P) = N_Task_Body
and then Present (Corresponding_Spec (P))
then
U := Corresponding_Spec (P);
elsif Nkind (P) = N_Task_Body_Stub
and then Present (Corresponding_Spec_Of_Stub (P))
then
U := Corresponding_Spec_Of_Stub (P);
if Is_Single_Task_Object (U) then
U := Etype (U);
end if;
end if;
when Type_Kind =>
if Present (Full_View (E)) then
U := Full_View (E);
end if;
when others =>
null;
end case;
return U;
end Unique_Entity;
-----------------
-- Unique_Name --
-----------------
function Unique_Name (E : Entity_Id) return String is
-- Names in E_Subprogram_Body or E_Package_Body entities are not
-- reliable, as they may not include the overloading suffix. Instead,
-- when looking for the name of E or one of its enclosing scope, we get
-- the name of the corresponding Unique_Entity.
U : constant Entity_Id := Unique_Entity (E);
function This_Name return String;
---------------
-- This_Name --
---------------
function This_Name return String is
begin
return Get_Name_String (Chars (U));
end This_Name;
-- Start of processing for Unique_Name
begin
if E = Standard_Standard
or else Has_Fully_Qualified_Name (E)
then
return This_Name;
elsif Ekind (E) = E_Enumeration_Literal then
return Unique_Name (Etype (E)) & "__" & This_Name;
else
declare
S : constant Entity_Id := Scope (U);
pragma Assert (Present (S));
begin
-- Prefix names of predefined types with standard__, but leave
-- names of user-defined packages and subprograms without prefix
-- (even if technically they are nested in the Standard package).
if S = Standard_Standard then
if Ekind (U) = E_Package or else Is_Subprogram (U) then
return This_Name;
else
return Unique_Name (S) & "__" & This_Name;
end if;
-- For intances of generic subprograms use the name of the related
-- instace and skip the scope of its wrapper package.
elsif Is_Wrapper_Package (S) then
pragma Assert (Scope (S) = Scope (Related_Instance (S)));
-- Wrapper package and the instantiation are in the same scope
declare
Enclosing_Name : constant String :=
Unique_Name (Scope (S)) & "__" &
Get_Name_String (Chars (Related_Instance (S)));
begin
if Is_Subprogram (U)
and then not Is_Generic_Actual_Subprogram (U)
then
return Enclosing_Name;
else
return Enclosing_Name & "__" & This_Name;
end if;
end;
else
return Unique_Name (S) & "__" & This_Name;
end if;
end;
end if;
end Unique_Name;
---------------------
-- Unit_Is_Visible --
---------------------
function Unit_Is_Visible (U : Entity_Id) return Boolean is
Curr : constant Node_Id := Cunit (Current_Sem_Unit);
Curr_Entity : constant Entity_Id := Cunit_Entity (Current_Sem_Unit);
function Unit_In_Parent_Context (Par_Unit : Node_Id) return Boolean;
-- For a child unit, check whether unit appears in a with_clause
-- of a parent.
function Unit_In_Context (Comp_Unit : Node_Id) return Boolean;
-- Scan the context clause of one compilation unit looking for a
-- with_clause for the unit in question.
----------------------------
-- Unit_In_Parent_Context --
----------------------------
function Unit_In_Parent_Context (Par_Unit : Node_Id) return Boolean is
begin
if Unit_In_Context (Par_Unit) then
return True;
elsif Is_Child_Unit (Defining_Entity (Unit (Par_Unit))) then
return Unit_In_Parent_Context (Parent_Spec (Unit (Par_Unit)));
else
return False;
end if;
end Unit_In_Parent_Context;
---------------------
-- Unit_In_Context --
---------------------
function Unit_In_Context (Comp_Unit : Node_Id) return Boolean is
Clause : Node_Id;
begin
Clause := First (Context_Items (Comp_Unit));
while Present (Clause) loop
if Nkind (Clause) = N_With_Clause then
if Library_Unit (Clause) = U then
return True;
-- The with_clause may denote a renaming of the unit we are
-- looking for, eg. Text_IO which renames Ada.Text_IO.
elsif
Renamed_Entity (Entity (Name (Clause))) =
Defining_Entity (Unit (U))
then
return True;
end if;
end if;
Next (Clause);
end loop;
return False;
end Unit_In_Context;
-- Start of processing for Unit_Is_Visible
begin
-- The currrent unit is directly visible
if Curr = U then
return True;
elsif Unit_In_Context (Curr) then
return True;
-- If the current unit is a body, check the context of the spec
elsif Nkind (Unit (Curr)) = N_Package_Body
or else
(Nkind (Unit (Curr)) = N_Subprogram_Body
and then not Acts_As_Spec (Unit (Curr)))
then
if Unit_In_Context (Library_Unit (Curr)) then
return True;
end if;
end if;
-- If the spec is a child unit, examine the parents
if Is_Child_Unit (Curr_Entity) then
if Nkind (Unit (Curr)) in N_Unit_Body then
return
Unit_In_Parent_Context
(Parent_Spec (Unit (Library_Unit (Curr))));
else
return Unit_In_Parent_Context (Parent_Spec (Unit (Curr)));
end if;
else
return False;
end if;
end Unit_Is_Visible;
------------------------------
-- Universal_Interpretation --
------------------------------
function Universal_Interpretation (Opnd : Node_Id) return Entity_Id is
Index : Interp_Index;
It : Interp;
begin
-- The argument may be a formal parameter of an operator or subprogram
-- with multiple interpretations, or else an expression for an actual.
if Nkind (Opnd) = N_Defining_Identifier
or else not Is_Overloaded (Opnd)
then
if Etype (Opnd) = Universal_Integer
or else Etype (Opnd) = Universal_Real
then
return Etype (Opnd);
else
return Empty;
end if;
else
Get_First_Interp (Opnd, Index, It);
while Present (It.Typ) loop
if It.Typ = Universal_Integer
or else It.Typ = Universal_Real
then
return It.Typ;
end if;
Get_Next_Interp (Index, It);
end loop;
return Empty;
end if;
end Universal_Interpretation;
---------------
-- Unqualify --
---------------
function Unqualify (Expr : Node_Id) return Node_Id is
begin
-- Recurse to handle unlikely case of multiple levels of qualification
if Nkind (Expr) = N_Qualified_Expression then
return Unqualify (Expression (Expr));
-- Normal case, not a qualified expression
else
return Expr;
end if;
end Unqualify;
-----------------------
-- Visible_Ancestors --
-----------------------
function Visible_Ancestors (Typ : Entity_Id) return Elist_Id is
List_1 : Elist_Id;
List_2 : Elist_Id;
Elmt : Elmt_Id;
begin
pragma Assert (Is_Record_Type (Typ) and then Is_Tagged_Type (Typ));
-- Collect all the parents and progenitors of Typ. If the full-view of
-- private parents and progenitors is available then it is used to
-- generate the list of visible ancestors; otherwise their partial
-- view is added to the resulting list.
Collect_Parents
(T => Typ,
List => List_1,
Use_Full_View => True);
Collect_Interfaces
(T => Typ,
Ifaces_List => List_2,
Exclude_Parents => True,
Use_Full_View => True);
-- Join the two lists. Avoid duplications because an interface may
-- simultaneously be parent and progenitor of a type.
Elmt := First_Elmt (List_2);
while Present (Elmt) loop
Append_Unique_Elmt (Node (Elmt), List_1);
Next_Elmt (Elmt);
end loop;
return List_1;
end Visible_Ancestors;
----------------------
-- Within_Init_Proc --
----------------------
function Within_Init_Proc return Boolean is
S : Entity_Id;
begin
S := Current_Scope;
while not Is_Overloadable (S) loop
if S = Standard_Standard then
return False;
else
S := Scope (S);
end if;
end loop;
return Is_Init_Proc (S);
end Within_Init_Proc;
------------------
-- Within_Scope --
------------------
function Within_Scope (E : Entity_Id; S : Entity_Id) return Boolean is
begin
return Scope_Within_Or_Same (Scope (E), S);
end Within_Scope;
----------------
-- Wrong_Type --
----------------
procedure Wrong_Type (Expr : Node_Id; Expected_Type : Entity_Id) is
Found_Type : constant Entity_Id := First_Subtype (Etype (Expr));
Expec_Type : constant Entity_Id := First_Subtype (Expected_Type);
Matching_Field : Entity_Id;
-- Entity to give a more precise suggestion on how to write a one-
-- element positional aggregate.
function Has_One_Matching_Field return Boolean;
-- Determines if Expec_Type is a record type with a single component or
-- discriminant whose type matches the found type or is one dimensional
-- array whose component type matches the found type. In the case of
-- one discriminant, we ignore the variant parts. That's not accurate,
-- but good enough for the warning.
----------------------------
-- Has_One_Matching_Field --
----------------------------
function Has_One_Matching_Field return Boolean is
E : Entity_Id;
begin
Matching_Field := Empty;
if Is_Array_Type (Expec_Type)
and then Number_Dimensions (Expec_Type) = 1
and then Covers (Etype (Component_Type (Expec_Type)), Found_Type)
then
-- Use type name if available. This excludes multidimensional
-- arrays and anonymous arrays.
if Comes_From_Source (Expec_Type) then
Matching_Field := Expec_Type;
-- For an assignment, use name of target
elsif Nkind (Parent (Expr)) = N_Assignment_Statement
and then Is_Entity_Name (Name (Parent (Expr)))
then
Matching_Field := Entity (Name (Parent (Expr)));
end if;
return True;
elsif not Is_Record_Type (Expec_Type) then
return False;
else
E := First_Entity (Expec_Type);
loop
if No (E) then
return False;
elsif not Ekind_In (E, E_Discriminant, E_Component)
or else Nam_In (Chars (E), Name_uTag, Name_uParent)
then
Next_Entity (E);
else
exit;
end if;
end loop;
if not Covers (Etype (E), Found_Type) then
return False;
elsif Present (Next_Entity (E))
and then (Ekind (E) = E_Component
or else Ekind (Next_Entity (E)) = E_Discriminant)
then
return False;
else
Matching_Field := E;
return True;
end if;
end if;
end Has_One_Matching_Field;
-- Start of processing for Wrong_Type
begin
-- Don't output message if either type is Any_Type, or if a message
-- has already been posted for this node. We need to do the latter
-- check explicitly (it is ordinarily done in Errout), because we
-- are using ! to force the output of the error messages.
if Expec_Type = Any_Type
or else Found_Type = Any_Type
or else Error_Posted (Expr)
then
return;
-- If one of the types is a Taft-Amendment type and the other it its
-- completion, it must be an illegal use of a TAT in the spec, for
-- which an error was already emitted. Avoid cascaded errors.
elsif Is_Incomplete_Type (Expec_Type)
and then Has_Completion_In_Body (Expec_Type)
and then Full_View (Expec_Type) = Etype (Expr)
then
return;
elsif Is_Incomplete_Type (Etype (Expr))
and then Has_Completion_In_Body (Etype (Expr))
and then Full_View (Etype (Expr)) = Expec_Type
then
return;
-- In an instance, there is an ongoing problem with completion of
-- type derived from private types. Their structure is what Gigi
-- expects, but the Etype is the parent type rather than the
-- derived private type itself. Do not flag error in this case. The
-- private completion is an entity without a parent, like an Itype.
-- Similarly, full and partial views may be incorrect in the instance.
-- There is no simple way to insure that it is consistent ???
-- A similar view discrepancy can happen in an inlined body, for the
-- same reason: inserted body may be outside of the original package
-- and only partial views are visible at the point of insertion.
elsif In_Instance or else In_Inlined_Body then
if Etype (Etype (Expr)) = Etype (Expected_Type)
and then
(Has_Private_Declaration (Expected_Type)
or else Has_Private_Declaration (Etype (Expr)))
and then No (Parent (Expected_Type))
then
return;
elsif Nkind (Parent (Expr)) = N_Qualified_Expression
and then Entity (Subtype_Mark (Parent (Expr))) = Expected_Type
then
return;
elsif Is_Private_Type (Expected_Type)
and then Present (Full_View (Expected_Type))
and then Covers (Full_View (Expected_Type), Etype (Expr))
then
return;
-- Conversely, type of expression may be the private one
elsif Is_Private_Type (Base_Type (Etype (Expr)))
and then Full_View (Base_Type (Etype (Expr))) = Expected_Type
then
return;
end if;
end if;
-- An interesting special check. If the expression is parenthesized
-- and its type corresponds to the type of the sole component of the
-- expected record type, or to the component type of the expected one
-- dimensional array type, then assume we have a bad aggregate attempt.
if Nkind (Expr) in N_Subexpr
and then Paren_Count (Expr) /= 0
and then Has_One_Matching_Field
then
Error_Msg_N ("positional aggregate cannot have one component", Expr);
if Present (Matching_Field) then
if Is_Array_Type (Expec_Type) then
Error_Msg_NE
("\write instead `&''First ='> ...`", Expr, Matching_Field);
else
Error_Msg_NE
("\write instead `& ='> ...`", Expr, Matching_Field);
end if;
end if;
-- Another special check, if we are looking for a pool-specific access
-- type and we found an E_Access_Attribute_Type, then we have the case
-- of an Access attribute being used in a context which needs a pool-
-- specific type, which is never allowed. The one extra check we make
-- is that the expected designated type covers the Found_Type.
elsif Is_Access_Type (Expec_Type)
and then Ekind (Found_Type) = E_Access_Attribute_Type
and then Ekind (Base_Type (Expec_Type)) /= E_General_Access_Type
and then Ekind (Base_Type (Expec_Type)) /= E_Anonymous_Access_Type
and then Covers
(Designated_Type (Expec_Type), Designated_Type (Found_Type))
then
Error_Msg_N -- CODEFIX
("result must be general access type!", Expr);
Error_Msg_NE -- CODEFIX
("add ALL to }!", Expr, Expec_Type);
-- Another special check, if the expected type is an integer type,
-- but the expression is of type System.Address, and the parent is
-- an addition or subtraction operation whose left operand is the
-- expression in question and whose right operand is of an integral
-- type, then this is an attempt at address arithmetic, so give
-- appropriate message.
elsif Is_Integer_Type (Expec_Type)
and then Is_RTE (Found_Type, RE_Address)
and then Nkind_In (Parent (Expr), N_Op_Add, N_Op_Subtract)
and then Expr = Left_Opnd (Parent (Expr))
and then Is_Integer_Type (Etype (Right_Opnd (Parent (Expr))))
then
Error_Msg_N
("address arithmetic not predefined in package System",
Parent (Expr));
Error_Msg_N
("\possible missing with/use of System.Storage_Elements",
Parent (Expr));
return;
-- If the expected type is an anonymous access type, as for access
-- parameters and discriminants, the error is on the designated types.
elsif Ekind (Expec_Type) = E_Anonymous_Access_Type then
if Comes_From_Source (Expec_Type) then
Error_Msg_NE ("expected}!", Expr, Expec_Type);
else
Error_Msg_NE
("expected an access type with designated}",
Expr, Designated_Type (Expec_Type));
end if;
if Is_Access_Type (Found_Type)
and then not Comes_From_Source (Found_Type)
then
Error_Msg_NE
("\\found an access type with designated}!",
Expr, Designated_Type (Found_Type));
else
if From_Limited_With (Found_Type) then
Error_Msg_NE ("\\found incomplete}!", Expr, Found_Type);
Error_Msg_Qual_Level := 99;
Error_Msg_NE -- CODEFIX
("\\missing `WITH &;", Expr, Scope (Found_Type));
Error_Msg_Qual_Level := 0;
else
Error_Msg_NE ("found}!", Expr, Found_Type);
end if;
end if;
-- Normal case of one type found, some other type expected
else
-- If the names of the two types are the same, see if some number
-- of levels of qualification will help. Don't try more than three
-- levels, and if we get to standard, it's no use (and probably
-- represents an error in the compiler) Also do not bother with
-- internal scope names.
declare
Expec_Scope : Entity_Id;
Found_Scope : Entity_Id;
begin
Expec_Scope := Expec_Type;
Found_Scope := Found_Type;
for Levels in Nat range 0 .. 3 loop
if Chars (Expec_Scope) /= Chars (Found_Scope) then
Error_Msg_Qual_Level := Levels;
exit;
end if;
Expec_Scope := Scope (Expec_Scope);
Found_Scope := Scope (Found_Scope);
exit when Expec_Scope = Standard_Standard
or else Found_Scope = Standard_Standard
or else not Comes_From_Source (Expec_Scope)
or else not Comes_From_Source (Found_Scope);
end loop;
end;
if Is_Record_Type (Expec_Type)
and then Present (Corresponding_Remote_Type (Expec_Type))
then
Error_Msg_NE ("expected}!", Expr,
Corresponding_Remote_Type (Expec_Type));
else
Error_Msg_NE ("expected}!", Expr, Expec_Type);
end if;
if Is_Entity_Name (Expr)
and then Is_Package_Or_Generic_Package (Entity (Expr))
then
Error_Msg_N ("\\found package name!", Expr);
elsif Is_Entity_Name (Expr)
and then Ekind_In (Entity (Expr), E_Procedure, E_Generic_Procedure)
then
if Ekind (Expec_Type) = E_Access_Subprogram_Type then
Error_Msg_N
("found procedure name, possibly missing Access attribute!",
Expr);
else
Error_Msg_N
("\\found procedure name instead of function!", Expr);
end if;
elsif Nkind (Expr) = N_Function_Call
and then Ekind (Expec_Type) = E_Access_Subprogram_Type
and then Etype (Designated_Type (Expec_Type)) = Etype (Expr)
and then No (Parameter_Associations (Expr))
then
Error_Msg_N
("found function name, possibly missing Access attribute!",
Expr);
-- Catch common error: a prefix or infix operator which is not
-- directly visible because the type isn't.
elsif Nkind (Expr) in N_Op
and then Is_Overloaded (Expr)
and then not Is_Immediately_Visible (Expec_Type)
and then not Is_Potentially_Use_Visible (Expec_Type)
and then not In_Use (Expec_Type)
and then Has_Compatible_Type (Right_Opnd (Expr), Expec_Type)
then
Error_Msg_N
("operator of the type is not directly visible!", Expr);
elsif Ekind (Found_Type) = E_Void
and then Present (Parent (Found_Type))
and then Nkind (Parent (Found_Type)) = N_Full_Type_Declaration
then
Error_Msg_NE ("\\found premature usage of}!", Expr, Found_Type);
else
Error_Msg_NE ("\\found}!", Expr, Found_Type);
end if;
-- A special check for cases like M1 and M2 = 0 where M1 and M2 are
-- of the same modular type, and (M1 and M2) = 0 was intended.
if Expec_Type = Standard_Boolean
and then Is_Modular_Integer_Type (Found_Type)
and then Nkind_In (Parent (Expr), N_Op_And, N_Op_Or, N_Op_Xor)
and then Nkind (Right_Opnd (Parent (Expr))) in N_Op_Compare
then
declare
Op : constant Node_Id := Right_Opnd (Parent (Expr));
L : constant Node_Id := Left_Opnd (Op);
R : constant Node_Id := Right_Opnd (Op);
begin
-- The case for the message is when the left operand of the
-- comparison is the same modular type, or when it is an
-- integer literal (or other universal integer expression),
-- which would have been typed as the modular type if the
-- parens had been there.
if (Etype (L) = Found_Type
or else
Etype (L) = Universal_Integer)
and then Is_Integer_Type (Etype (R))
then
Error_Msg_N
("\\possible missing parens for modular operation", Expr);
end if;
end;
end if;
-- Reset error message qualification indication
Error_Msg_Qual_Level := 0;
end if;
end Wrong_Type;
--------------------------------
-- Yields_Synchronized_Object --
--------------------------------
function Yields_Synchronized_Object (Typ : Entity_Id) return Boolean is
Has_Sync_Comp : Boolean := False;
Id : Entity_Id;
begin
-- An array type yields a synchronized object if its component type
-- yields a synchronized object.
if Is_Array_Type (Typ) then
return Yields_Synchronized_Object (Component_Type (Typ));
-- A descendant of type Ada.Synchronous_Task_Control.Suspension_Object
-- yields a synchronized object by default.
elsif Is_Descendant_Of_Suspension_Object (Typ) then
return True;
-- A protected type yields a synchronized object by default
elsif Is_Protected_Type (Typ) then
return True;
-- A record type or type extension yields a synchronized object when its
-- discriminants (if any) lack default values and all components are of
-- a type that yelds a synchronized object.
elsif Is_Record_Type (Typ) then
-- Inspect all entities defined in the scope of the type, looking for
-- components of a type that does not yeld a synchronized object or
-- for discriminants with default values.
Id := First_Entity (Typ);
while Present (Id) loop
if Comes_From_Source (Id) then
if Ekind (Id) = E_Component then
if Yields_Synchronized_Object (Etype (Id)) then
Has_Sync_Comp := True;
-- The component does not yield a synchronized object
else
return False;
end if;
elsif Ekind (Id) = E_Discriminant
and then Present (Expression (Parent (Id)))
then
return False;
end if;
end if;
Next_Entity (Id);
end loop;
-- Ensure that the parent type of a type extension yields a
-- synchronized object.
if Etype (Typ) /= Typ
and then not Yields_Synchronized_Object (Etype (Typ))
then
return False;
end if;
-- If we get here, then all discriminants lack default values and all
-- components are of a type that yields a synchronized object.
return Has_Sync_Comp;
-- A synchronized interface type yields a synchronized object by default
elsif Is_Synchronized_Interface (Typ) then
return True;
-- A task type yelds a synchronized object by default
elsif Is_Task_Type (Typ) then
return True;
-- Otherwise the type does not yield a synchronized object
else
return False;
end if;
end Yields_Synchronized_Object;
---------------------------
-- Yields_Universal_Type --
---------------------------
function Yields_Universal_Type (N : Node_Id) return Boolean is
begin
-- Integer and real literals are of a universal type
if Nkind_In (N, N_Integer_Literal, N_Real_Literal) then
return True;
-- The values of certain attributes are of a universal type
elsif Nkind (N) = N_Attribute_Reference then
return
Universal_Type_Attribute (Get_Attribute_Id (Attribute_Name (N)));
-- ??? There are possibly other cases to consider
else
return False;
end if;
end Yields_Universal_Type;
end Sem_Util;
|
-----------------------------------------------------------------------
-- util-concurrent-arrays -- Concurrent Arrays
-- Copyright (C) 2012, 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.Unchecked_Deallocation;
package body Util.Concurrent.Arrays is
procedure Free is
new Ada.Unchecked_Deallocation (Object => Vector_Record,
Name => Vector_Record_Access);
-- ------------------------------
-- Returns True if the container is empty.
-- ------------------------------
function Is_Empty (Container : in Ref) return Boolean is
begin
return Container.Target = null;
end Is_Empty;
-- ------------------------------
-- Iterate over the vector elements and execute the <b>Process</b> procedure
-- with the element as parameter.
-- ------------------------------
procedure Iterate (Container : in Ref;
Process : not null access procedure (Item : in Element_Type)) is
Target : constant Vector_Record_Access := Container.Target;
begin
if Target /= null then
for I in Target.List'Range loop
Process (Target.List (I));
end loop;
end if;
end Iterate;
-- ------------------------------
-- Iterate over the vector elements in reverse order and execute the <b>Process</b> procedure
-- with the element as parameter.
-- ------------------------------
procedure Reverse_Iterate (Container : in Ref;
Process : not null access procedure (Item : in Element_Type)) is
Target : constant Vector_Record_Access := Container.Target;
begin
if Target /= null then
for I in reverse Target.List'Range loop
Process (Target.List (I));
end loop;
end if;
end Reverse_Iterate;
-- ------------------------------
-- Release the reference. Invoke <b>Finalize</b> and free the storage if it was
-- the last reference.
-- ------------------------------
overriding
procedure Finalize (Obj : in out Ref) is
Release : Boolean;
begin
if Obj.Target /= null then
Util.Concurrent.Counters.Decrement (Obj.Target.Ref_Counter, Release);
if Release then
Free (Obj.Target);
else
Obj.Target := null;
end if;
end if;
end Finalize;
-- ------------------------------
-- Update the reference counter after an assignment.
-- ------------------------------
overriding
procedure Adjust (Obj : in out Ref) is
begin
if Obj.Target /= null then
Util.Concurrent.Counters.Increment (Obj.Target.Ref_Counter);
end if;
end Adjust;
-- ------------------------------
-- Get a read-only reference to the vector elements. The referenced vector will never
-- be modified.
-- ------------------------------
function Get (Container : in Vector'Class) return Ref is
begin
return Container.List.Get;
end Get;
-- ------------------------------
-- Append the element to the vector. The modification will not be visible to readers
-- until they call the <b>Get</b> function.
-- ------------------------------
procedure Append (Container : in out Vector;
Item : in Element_Type) is
begin
Container.List.Append (Item);
end Append;
-- ------------------------------
-- Remove the element represented by <b>Item</b> from the vector. The modification will
-- not be visible to readers until they call the <b>Get</b> function.
-- ------------------------------
procedure Remove (Container : in out Vector;
Item : in Element_Type) is
begin
Container.List.Remove (Item);
end Remove;
-- Release the vector elements.
overriding
procedure Finalize (Object : in out Vector) is
begin
null;
end Finalize;
-- Vector of objects
protected body Protected_Vector is
-- ------------------------------
-- Get a readonly reference to the vector.
-- ------------------------------
function Get return Ref is
begin
return Elements;
end Get;
-- ------------------------------
-- Append the element to the vector.
-- ------------------------------
procedure Append (Item : in Element_Type) is
New_Items : Vector_Record_Access;
Len : Natural;
begin
if Elements.Target = null then
New_Items := new Vector_Record (Len => 1);
Len := 1;
else
Len := Elements.Target.Len + 1;
New_Items := new Vector_Record (Len => Len);
New_Items.List (1 .. Len - 1) := Elements.Target.List;
Finalize (Elements);
end if;
New_Items.List (Len) := Item;
Util.Concurrent.Counters.Increment (New_Items.Ref_Counter);
Elements.Target := New_Items;
end Append;
-- ------------------------------
-- Remove the element from the vector.
-- ------------------------------
procedure Remove (Item : in Element_Type) is
New_Items : Vector_Record_Access;
Items : constant Vector_Record_Access := Elements.Target;
begin
if Items = null then
return;
end if;
for I in Items.List'Range loop
if Items.List (I) = Item then
if Items.Len = 1 then
Finalize (Elements);
Elements.Target := null;
else
New_Items := new Vector_Record (Len => Items.Len - 1);
if I > 1 then
New_Items.List (1 .. I - 1) := Items.List (1 .. I - 1);
end if;
if I <= New_Items.List'Last then
New_Items.List (I .. New_Items.List'Last)
:= Items.List (I + 1 .. Items.List'Last);
end if;
Finalize (Elements);
Util.Concurrent.Counters.Increment (New_Items.Ref_Counter);
Elements.Target := New_Items;
end if;
return;
end if;
end loop;
end Remove;
end Protected_Vector;
end Util.Concurrent.Arrays;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Tools Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2010, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with Ada.Characters.Conversions;
with Ada.Characters.Handling;
with GNAT.Regpat;
with Asis.Declarations;
with Asis.Definitions;
with Asis.Elements;
with Asis.Expressions;
with Asis.Iterator;
with Asis.Statements;
with Asis.Text;
package body Token_Extractor is
type State_Information is null record;
procedure Process_Ordinary_Type_Declaration (Element : Asis.Element);
procedure Pre_Operation
(Element : Asis.Element;
Control : in out Asis.Traverse_Control;
State : in out State_Information);
procedure Post_Operation
(Element : Asis.Element;
Control : in out Asis.Traverse_Control;
State : in out State_Information) is null;
procedure Iterate is new Asis.Iterator.Traverse_Element (State_Information);
function To_Upper (Item : Wide_String) return Wide_String;
-------------
-- Extract --
-------------
procedure Extract (Element : Asis.Element) is
Control : Asis.Traverse_Control := Asis.Continue;
State : State_Information;
begin
Iterate (Element, Control, State);
end Extract;
-------------------
-- Pre_Operation --
-------------------
procedure Pre_Operation
(Element : Asis.Element;
Control : in out Asis.Traverse_Control;
State : in out State_Information) is
begin
case Asis.Elements.Element_Kind (Element) is
when Asis.A_Declaration =>
case Asis.Elements.Declaration_Kind (Element) is
when Asis.An_Ordinary_Type_Declaration =>
Process_Ordinary_Type_Declaration (Element);
when others =>
null;
end case;
when others =>
null;
end case;
end Pre_Operation;
---------------------------------------
-- Process_Ordinary_Type_Declaration --
---------------------------------------
procedure Process_Ordinary_Type_Declaration (Element : Asis.Element) is
Image : constant Wide_String :=
To_Upper
(Asis.Declarations.Defining_Name_Image
(Asis.Declarations.Names (Element) (1)));
begin
if Image = "TOKEN" then
declare
Literals : constant Asis.Element_List :=
Asis.Definitions.Enumeration_Literal_Declarations
(Asis.Declarations.Type_Declaration_View (Element));
begin
for J in Literals'Range loop
declare
Image : constant Wide_String :=
Asis.Declarations.Defining_Name_Image
(Asis.Declarations.Names (Literals (J)) (1));
begin
Tokens.Append
(Ada.Strings.Wide_Unbounded.To_Unbounded_Wide_String
(Image));
end;
end loop;
end;
end if;
end Process_Ordinary_Type_Declaration;
--------------
-- To_Upper --
--------------
function To_Upper (Item : Wide_String) return Wide_String is
begin
return
Ada.Characters.Conversions.To_Wide_String
(Ada.Characters.Handling.To_Upper
(Ada.Characters.Conversions.To_String (Item)));
end To_Upper;
end Token_Extractor;
|
-- { dg-do run }
with GNAT.Table;
with Ada.Text_IO; use Ada.Text_IO;
procedure test_table1 is
type Rec is record
A, B, C, D, E : Integer := 0;
F, G, H, I, J : Integer := 1;
K, L, M, N, O : Integer := 2;
end record;
R : Rec;
package Tab is new GNAT.Table (Rec, Positive, 1, 4, 30);
Last : Natural;
begin
R.O := 3;
Tab.Append (R);
for J in 1 .. 1_000_000 loop
Last := Tab.Last;
begin
Tab.Append (Tab.Table (Last));
exception
when others =>
Put_Line ("exception raise for J =" & J'Img);
raise;
end;
if Tab.Table (Tab.Last) /= R then
Put_Line ("Last is not what is expected");
Put_Line (J'Img);
return;
end if;
end loop;
end;
|
-- Copyright (c) 2017 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with LSP.Messages;
with Incr.Nodes.Tokens;
with Ada_LSP.Documents;
package Ada_LSP.Completions is
type Context is tagged limited private;
not overriding function Token
(Self : Context) return Incr.Nodes.Tokens.Token_Access;
not overriding function Document
(Self : Context) return Ada_LSP.Documents.Constant_Document_Access;
not overriding procedure Set_Token
(Self : in out Context;
Token : Incr.Nodes.Tokens.Token_Access;
Offset : Positive);
not overriding procedure Set_Document
(Self : in out Context;
Value : Ada_LSP.Documents.Constant_Document_Access);
type Handler is limited interface;
type Handler_Access is access all Handler'Class;
not overriding procedure Fill_Completion_List
(Self : Handler;
Context : Ada_LSP.Completions.Context'Class;
Result : in out LSP.Messages.CompletionList) is abstract;
private
type Context is tagged limited record
Document : Ada_LSP.Documents.Constant_Document_Access;
Token : Incr.Nodes.Tokens.Token_Access;
Offset : Positive := 1;
end record;
end Ada_LSP.Completions;
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2020, 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 AdaCore nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
package body PCD8544 is
-------------------
-- Chip_Select --
-------------------
procedure Chip_Select (This : PCD8544_Device; Enabled : in Boolean)
is
begin
if This.CS /= null then
if Enabled then
This.CS.Clear;
else
This.CS.Set;
end if;
end if;
end Chip_Select;
-------------
-- Reset --
-------------
procedure Reset (This : in out PCD8544_Device) is
begin
if This.RST /= null then
This.RST.Clear;
This.RST.Set;
-- The datasheet specifies 100ns minimum for reset but this was
-- unreliable in testing, so we use a longer delay.
This.Time.Delay_Microseconds (100);
end if;
end Reset;
----------------
-- Transmit --
----------------
procedure Transmit (This : PCD8544_Device; Data : in UInt8) is
Status : SPI_Status;
begin
This.Chip_Select (True);
This.DC.Clear;
This.Port.Transmit (SPI_Data_8b'(1 => Data), Status);
This.Chip_Select (False);
if Status /= Ok then
raise SPI_Error with "PCD8544 SPI command transmit failed: " & Status'Image;
end if;
end Transmit;
----------------
-- Transmit --
----------------
procedure Transmit (This : PCD8544_Device; Data : in UInt8_Array) is
Status : SPI_Status;
begin
This.Chip_Select (True);
This.DC.Set;
This.Port.Transmit (SPI_Data_8b (Data), Status);
This.Chip_Select (False);
if Status /= Ok then
raise SPI_Error with "PCD8544 SPI data transmit failed: " & Status'Image;
end if;
end Transmit;
---------------------
-- Extended_Mode --
---------------------
procedure Extended_Mode (This : in out PCD8544_Device) is
begin
if This.FR.Extended_Mode /= True then
This.FR.Extended_Mode := True;
This.Transmit (PCD8544_CMD_FUNCTION or Convert (This.FR));
end if;
end Extended_Mode;
------------------
-- Basic_Mode --
------------------
procedure Basic_Mode (This : in out PCD8544_Device) is
begin
if This.FR.Extended_Mode /= False then
This.FR.Extended_Mode := False;
This.Transmit (PCD8544_CMD_FUNCTION or Convert (This.FR));
end if;
end Basic_Mode;
--------------------
-- Set_Contrast --
--------------------
procedure Set_Contrast
(This : in out PCD8544_Device;
Contrast : in PCD8544_Contrast) is
begin
This.Extended_Mode;
This.Transmit (PCD8544_CMD_SET_VOP or Contrast);
end Set_Contrast;
----------------
-- Set_Bias --
----------------
procedure Set_Bias
(This : in out PCD8544_Device;
Bias : in PCD8544_Bias) is
begin
This.Extended_Mode;
This.Transmit (PCD8544_CMD_SET_BIAS or Bias);
end Set_Bias;
-----------------------
-- Set_Temperature --
-----------------------
procedure Set_Temperature
(This : in out PCD8544_Device;
TC : in PCD8544_Temperature_Coefficient) is
begin
This.Extended_Mode;
This.Transmit (PCD8544_CMD_SET_TC or TC);
end Set_Temperature;
------------------------
-- Set_Display_Mode --
------------------------
procedure Set_Display_Mode
(This : in out PCD8544_Device;
Enable : in Boolean;
Invert : in Boolean) is
begin
This.Basic_Mode;
This.DR.Enable := Enable;
This.DR.Invert := Invert;
This.Transmit (PCD8544_CMD_DISPLAY or Convert (This.DR));
end Set_Display_Mode;
------------------
-- Initialize --
------------------
procedure Initialize (This : in out PCD8544_Device) is
Default_FR : PCD8544_Function_Register;
Default_DR : PCD8544_Display_Register;
begin
This.DC.Clear;
This.Reset;
This.FR := Default_FR;
This.DR := Default_DR;
-- Power on must be separate from other commands.
This.FR.Power_Down := False;
This.Transmit (PCD8544_CMD_FUNCTION or Convert (This.FR));
This.Set_Contrast (PCD8544_Default_Contrast);
This.Set_Bias (PCD8544_Default_Bias);
This.Set_Temperature (PCD8544_Default_Temperature_Coefficient);
This.FR.Extended_Mode := False;
This.FR.Address_Mode := Vertical;
This.Transmit (PCD8544_CMD_FUNCTION or Convert (This.FR));
This.Set_Display_Mode
(Enable => True,
Invert => True);
This.Device_Initialized := True;
end Initialize;
------------------------
-- Write_Raw_Pixels --
------------------------
procedure Write_Raw_Pixels
(This : in out PCD8544_Device;
Data : UInt8_Array)
is
begin
This.Chip_Select (True);
This.Basic_Mode;
This.Transmit (PCD8544_CMD_SET_X or 0);
This.Transmit (PCD8544_CMD_SET_Y or 0);
This.Transmit (Data);
This.Chip_Select (False);
end Write_Raw_Pixels;
-------------------
-- Initialized --
-------------------
overriding function Initialized (This : PCD8544_Device) return Boolean is
(This.Device_Initialized);
------------------
-- Max_Layers --
------------------
overriding function Max_Layers (This : PCD8544_Device) return Positive is
(1);
-----------------
-- Supported --
-----------------
overriding function Supported
(This : PCD8544_Device; Mode : FB_Color_Mode) return Boolean is
(Mode = HAL.Bitmap.M_1);
-----------------------
-- Set_Orientation --
-----------------------
overriding procedure Set_Orientation
(This : in out PCD8544_Device; Orientation : Display_Orientation)
is
begin
null;
end Set_Orientation;
----------------
-- Set_Mode --
----------------
overriding procedure Set_Mode
(This : in out PCD8544_Device; Mode : Wait_Mode) is null;
-------------
-- Width --
-------------
overriding function Width (This : PCD8544_Device) return Positive is
(Device_Width);
--------------
-- Height --
--------------
overriding function Height (This : PCD8544_Device) return Positive is
(Device_Height);
---------------
-- Swapped --
---------------
overriding function Swapped (This : PCD8544_Device) return Boolean is
(False);
----------------------
-- Set_Background --
----------------------
overriding procedure Set_Background (This : PCD8544_Device; R, G, B : UInt8)
is
begin
raise Program_Error;
end Set_Background;
------------------------
-- Initialize_Layer --
------------------------
overriding procedure Initialize_Layer
(This : in out PCD8544_Device;
Layer : Positive;
Mode : FB_Color_Mode;
X, Y : Natural := 0;
Width : Positive := Positive'Last;
Height : Positive := Positive'Last)
is
pragma Unreferenced (X, Y, Width, Height);
begin
if Layer /= 1 or else Mode /= M_1 then
raise Program_Error;
end if;
This.Memory_Layer.Actual_Width := This.Width;
This.Memory_Layer.Actual_Height := This.Height;
This.Memory_Layer.Addr := This.Memory_Layer.Data'Address;
This.Memory_Layer.Actual_Color_Mode := Mode;
for I in This.Memory_Layer.Data'Range loop
This.Memory_Layer.Data (I) := 0;
end loop;
This.Layer_Initialized := True;
end Initialize_Layer;
-------------------
-- Initialized --
-------------------
overriding function Initialized
(This : PCD8544_Device;
Layer : Positive) return Boolean
is
begin
return Layer = 1 and then This.Layer_Initialized;
end Initialized;
--------------------
-- Update_Layer --
--------------------
overriding procedure Update_Layer
(This : in out PCD8544_Device;
Layer : Positive;
Copy_Back : Boolean := False)
is
pragma Unreferenced (Copy_Back);
begin
if Layer /= 1 then
raise Program_Error;
end if;
This.Write_Raw_Pixels (This.Memory_Layer.Data);
end Update_Layer;
------------------
-- Color_Mode --
------------------
overriding function Color_Mode
(This : PCD8544_Device; Layer : Positive) return FB_Color_Mode
is
pragma Unreferenced (This);
begin
if Layer /= 1 then
raise Program_Error;
end if;
return M_1;
end Color_Mode;
---------------------
-- Hidden_Buffer --
---------------------
overriding function Hidden_Buffer
(This : in out PCD8544_Device; Layer : Positive)
return not null HAL.Bitmap.Any_Bitmap_Buffer
is
begin
if Layer /= 1 then
raise Program_Error;
end if;
return This.Memory_Layer'Unchecked_Access;
end Hidden_Buffer;
---------------------
-- Update_Layers --
---------------------
overriding procedure Update_Layers (This : in out PCD8544_Device) is
begin
This.Update_Layer (1);
end Update_Layers;
------------------
-- Pixel_Size --
------------------
overriding function Pixel_Size
(Display : PCD8544_Device; Layer : Positive) return Positive is
(1);
end PCD8544;
|
-------------------------------------------------------------------------------
-- Copyright (C) 2020-2030, per.s.sandberg@bahnhof.se --
-- --
-- Permission is hereby granted, free of charge, to any person obtaining a --
-- copy of this software and associated documentation files --
-- (the "Software"), to deal in the Software without restriction, including --
-- without limitation the rights to use, copy, modify, merge, publish, --
-- distribute, sublicense, and / or sell copies of the Software, and to --
-- permit persons to whom the Software is furnished to do so, subject to --
-- the following conditions : --
-- --
-- The above copyright notice and this permission notice shall be included --
-- in all copies or substantial portions of the Software. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS --
-- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF --
-- MERCHANTABILITY, --
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL --
-- THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR --
-- OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, --
-- ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR --
-- OTHER DEALINGS IN THE SOFTWARE. --
-------------------------------------------------------------------------------
-- Hello World server in Ada
-- Binds REP socket to tcp:--*:5555
-- Expects "Hello" from client, replies with "World"
with ZMQ.Sockets;
with ZMQ.Contexts;
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with Ada.Text_IO.Unbounded_IO; use Ada.Text_IO.Unbounded_IO;
procedure ZMQ.Examples.HWServer is
Context : ZMQ.Contexts.Context;
Socket : ZMQ.Sockets.Socket;
Inbuffer : Ada.Strings.Unbounded.Unbounded_String;
begin
-- Prepare our context and socket
Socket.Initialize (Context, ZMQ.Sockets.REP);
Socket.Bind ("tcp://*:5555");
loop
-- Wait for next request from client
Inbuffer := Socket.Recv;
Put_Line ("Received request:" & Inbuffer);
-- Do some 'work'
delay 1.0;
-- Send reply back to client
Socket.Send ("World");
end loop;
end ZMQ.Examples.HWServer;
|
with Ada.Text_IO; use Ada.Text_IO;
procedure FreeCell is
type State is mod 2**31;
type Deck is array (0..51) of String(1..2);
package Random is
procedure Init(Seed: State);
function Rand return State;
end Random;
package body Random is
S : State := State'First;
procedure Init(Seed: State) is begin S := Seed; end Init;
function Rand return State is begin
S := S * 214013 + 2531011; return S / 2**16;
end Rand;
end Random;
procedure Deal (num : State) is
thedeck : Deck; pick : State;
Chars : constant String := "A23456789TJQKCDHS";
begin
for i in thedeck'Range loop
thedeck(i):= Chars(i/4+1) & Chars(i mod 4 + 14);
end loop;
Random.Init(num);
for i in 0..51 loop
pick := Random.Rand mod State(52-i);
Put(thedeck(Natural(pick))&' ');
if (i+1) mod 8 = 0 then New_Line; end if;
thedeck(Natural(pick)) := thedeck(51-i);
end loop; New_Line;
end Deal;
begin
Deal(1);
New_Line;
Deal(617);
end FreeCell;
|
---------------------------------------------------------------
-- Author: Matthew Bennett ---
-- Class: CSC410 Burgess ---
-- Date: 09-01-04 Modified: 9-05-04 ---
-- Desc: Assignment 1:DEKKER's ALGORITHM ---
-- a simple implementation of ---
-- Dekker's algorithm which describes mutual exclusion for ---
-- two processes (TASKS) assuming fair hardware. ---
-- Dekker's algorithm as described in ---
-- "Algorithms for Mutual Exclusion", M. Raynal ---
-- MIT PRESS Cambridge, 1974 ISBN: 0-262-18119-3 ---
----------------------------------------------------------------
-- dependencies
WITH ADA.TEXT_IO; USE ADA.TEXT_IO;
WITH ADA.NUMERICS.FLOAT_RANDOM; --USE ADA.NUMERICS.FLOAT_RANDOM;
WITH ADA.INTEGER_TEXT_IO; USE ADA.INTEGER_TEXT_IO;
--WITH ADA.INTEGER_IO; USE ADA.INTEGER_IO;
WITH ADA.CALENDAR; USE ADA.CALENDAR;
-- (provides cast: natural -> time for input into delay)
--WITH ADA.STRINGS; USE ADA.STRINGS;
WITH ADA.STRINGS.UNBOUNDED; USE ADA.STRINGS.UNBOUNDED;
----------------------------------------------------------------
----------------------------------------------------------------
-- specifications
PACKAGE BODY as1 IS
PROCEDURE dekker IS
--implementation of the driver and user interface
turn : Integer RANGE 0..1 := 0; --called for by dekker's
flag : ARRAY(0..1) OF Boolean := (OTHERS => FALSE);--dekker's
tempString : Unbounded_String; --buffer used to hold the output for a task
tempString0 : Unbounded_String := To_Unbounded_String("");
--buffer used to make the spaces for indents
--user defined at runtime--
iterations_user : Integer RANGE 0..100 := 10; -- iterations per task
tasks_user : Integer RANGE 0..100 := 2; -- num proccesses
TASK TYPE single_task IS
-- "an ENTRY is a TASK's version of a PROCEDURE or FUNCTION"
ENTRY start (id_self : IN Integer; id_other : IN Integer; iterations_in : IN Integer);
END single_task;
--we have to use a pointer every time we throw off a new task
TYPE p_ptr IS ACCESS single_task; --reference type
ptr : ARRAY(0..tasks_user) OF p_ptr; --how do we allocate dynamically?
-- "since TASK TYPE single_task is part of PROCEDURE dekker,
-- we must define it here or in a specifications file "
TASK BODY single_task IS
i,j : Integer := 0; -- identity, other task' identity
iterations : Integer := 0; -- # of iterations
G : Ada.Numerics.Float_Random.Generator; -- yields a random Natural after seed
BEGIN --single_task
-- this is Dekker's algorithm implementation, the tasks themselves
ACCEPT Start (id_self : IN Integer; id_other : IN Integer; iterations_in : IN Integer) DO
i := id_self;
j := id_other;
iterations := iterations_user;
END Start;
FOR x IN 1 .. iterations LOOP
Ada.Numerics.Float_Random.Reset(G); --like seed_rand(time(0)) in c
delay (Standard.Duration( (Ada.Numerics.Float_Random.Random(G) ) ) );
-- Begin Dekker's Algorithm
flag(i) := TRUE; --"requesting & in-CS" combined
WHILE flag(j) LOOP
IF turn = j THEN
BEGIN
flag(i) := FALSE; --fell in
WHILE turn = j LOOP
null; --event loop, do nothing
END loop;
flag(i) := TRUE;
END; -- for begin
END IF;
END LOOP;
-- Critical Section
FOR x IN 0..8*i LOOP
tempString0 := tempString0 & To_UnBounded_String(" "); --build up indent
END LOOP;
tempString := tempString0 & To_Unbounded_String(Integer'Image(i) & " in CS");
Put_Line( To_String(tempString) );
tempString0 := To_UnBounded_String("");
DELAY Standard.Duration( ( (Ada.Numerics.Float_Random.random(G) ) ));
FOR x IN 0..8*i LOOP
tempString0 := tempString0 & To_UnBounded_String(" "); --build up indent
END LOOP;
tempString := tempString0 & To_Unbounded_String(Integer'Image(i) & " out CS");
Put_Line( To_String(tempString) );
tempString0 := To_UnBounded_String("");
-- end Critical Section
turn := j; --"next process"
flag(i) := FALSE; --"finished with my critical section"
END LOOP;
END single_task;
----------------------------------------------------------------
----------------------------------------------------------------
-- implementation
BEGIN --procedure dekker
--sanity checking on the input
LOOP
put("# tasks[1-2]: ");
get(tasks_user);
EXIT WHEN (tasks_user > 0 AND tasks_user <= 2);
END LOOP;
LOOP
put("# iterations[1-20]: ");
get(iterations_user);
EXIT WHEN (iterations_user > 0 AND iterations_user <= 20);
END LOOP;
-- For each proccess, start it and pass them their id's
FOR x IN 0 .. (tasks_user-1)
LOOP
ptr(x) := NEW single_task;
ptr(x).Start(x,1-x, iterations_user);
END LOOP;
END dekker;
END as1;
|
---------------------------------------------------------------------------------
-- Copyright 2004-2005 © Luke A. Guest
--
-- This code is to be used for tutorial purposes only.
-- You may not redistribute this code in any form without my express permission.
---------------------------------------------------------------------------------
with GL;
with Torus;
with Cylinder;
with AABB;
with OBB;
with Sphere;
with Matrix3x3;
with Vector3;
package Mesh is
subtype ColourRange is Integer range 1 .. 4;
subtype VectorRange is Integer range 1 .. 3;
subtype TCRange is Integer range 1 .. 2;
type ColourArray is array(ColourRange) of aliased GL.GLfloat;
type VectorArray is array(VectorRange) of aliased GL.GLfloat;
type TCArray is array(TCRange) of aliased GL.GLfloat;
type VectorArrayPtr is access all VectorArray;
type ColourArrayPtr is access all ColourArray;
type IntegerPtr is access all Integer;
type TCArrayPtr is access all TCArray;
type VertexArray is array(Integer range <>) of aliased VectorArray;
type NormalArray is array(Integer range <>) of aliased VectorArray;
type IndexArray is array(Integer range <>) of aliased Integer;
type VertexColourArray is array(Integer range <>) of aliased ColourArray;
type TexCoordArray is array(Integer range <>) of aliased TCArray;
type VertexArrayPtr is access all VertexArray;
type NormalArrayPtr is access all NormalArray;
type IndexArrayPtr is access all IndexArray;
type VertexColourArrayPtr is access all VertexColourArray;
type TexCoordArrayPtr is access all TexCoordArray;
type Object is
record
Primitive : GL.PrimitiveType := GL.GL_TRIANGLES;
Vertices : VertexArrayPtr := null;
Normals : NormalArrayPtr := null;
Indices : IndexArrayPtr := null;
TexCoords : TexCoordArrayPtr := null;
AABB_Bounds : AABB.Object;
OBB_Bounds : OBB.Object;
Sphere_Bounds : Sphere.Object;
Transform : Matrix3x3.Object := Matrix3x3.Identity;
Translation : Vector3.Object := Vector3.ZERO;
end record;
function GetVertices(MeshData : in Object) return GL.GLpointer;
function GetNormals(MeshData : in Object) return GL.GLpointer;
function GetIndices(MeshData : in Object) return GL.GLpointer;
function GetTextureCoords(MeshData : in Object) return GL.GLpointer;
function Create(Data : in Torus.Object) return Object;
function Create(Data : in Cylinder.Object) return Object;
procedure Update_AABB(Self : in out Object);
procedure Update_OBB(Self : in out Object);
procedure Update_Sphere(Self : in out Object);
end Mesh;
|
-- Copyright (C) 2019 Thierry Rascle <thierr26@free.fr>
-- MIT license. Please refer to the LICENSE file.
package Apsepp.Test_Reporter_Class.Stub is
type Test_Reporter_Stub is limited new Test_Reporter_Interfa with private;
overriding
function Is_Conflicting_Node_Tag (Obj : Test_Reporter_Stub;
Node_Tag : Tag) return Boolean
is (False);
overriding
procedure Provide_Node_Lineage (Obj : in out Test_Reporter_Stub;
Node_Lineage : Tag_Array) is null;
private
type Test_Reporter_Stub
is limited new Test_Reporter_Interfa with null record;
end Apsepp.Test_Reporter_Class.Stub;
|
with ada.text_io, ada.Integer_text_IO, Ada.Text_IO.Text_Streams, Ada.Strings.Fixed, Interfaces.C;
use ada.text_io, ada.Integer_text_IO, Ada.Strings, Ada.Strings.Fixed, Interfaces.C;
procedure dichoexp is
type stringptr is access all char_array;
procedure PInt(i : in Integer) is
begin
String'Write (Text_Streams.Stream (Current_Output), Trim(Integer'Image(i), Left));
end;
procedure SkipSpaces is
C : Character;
Eol : Boolean;
begin
loop
Look_Ahead(C, Eol);
exit when Eol or C /= ' ';
Get(C);
end loop;
end;
function exp0(a : in Integer; b : in Integer) return Integer is
o : Integer;
begin
if b = 0
then
return 1;
end if;
if b rem 2 = 0
then
o := exp0(a, b / 2);
return o * o;
else
return a * exp0(a, b - 1);
end if;
end;
b : Integer;
a : Integer;
begin
a := 0;
b := 0;
Get(a);
SkipSpaces;
Get(b);
PInt(exp0(a, b));
end;
|
-- Galois Linear Feedback Shift Register
-- https://en.wikipedia.org/wiki/Linear-feedback_shift_register#Galois_LFSRs
package body Random is
State : UInt16 := 16#DEAD#;
function Next
return UInt16
is
Taps : constant UInt16 := 16#B400#;
LFSR : UInt16 := State;
LSB : UInt16;
begin
loop
LSB := LFSR and 1;
LFSR := Shift_Right (LFSR, 1);
LFSR := LFSR xor ((-LSB) and Taps);
exit when LFSR /= State;
end loop;
State := LFSR;
return LFSR;
end Next;
function In_Range
(First, Last : Natural)
return Natural
is (First + (Natural (Next) mod (Last - First + 1)));
end Random;
|
pragma Ada_2012;
pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
with bits_types_struct_timespec_h;
package bits_types_struct_itimerspec_h is
-- POSIX.1b structure for timer start values and intervals.
type itimerspec is record
it_interval : aliased bits_types_struct_timespec_h.timespec; -- /usr/include/bits/types/struct_itimerspec.h:10
it_value : aliased bits_types_struct_timespec_h.timespec; -- /usr/include/bits/types/struct_itimerspec.h:11
end record
with Convention => C_Pass_By_Copy; -- /usr/include/bits/types/struct_itimerspec.h:8
end bits_types_struct_itimerspec_h;
|
PACKAGE TTY IS
PROCEDURE OutS;
END TTY;
PACKAGE BODY TTY IS
PROCEDURE OutS is
BEGIN
null;
END OutS;
END TTY;
WITH TTY;
PROCEDURE Test IS
PACKAGE IO RENAMES TTY;
BEGIN
IO.OutS;
END Test;
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2015, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of STMicroelectronics nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
-- --
-- This file is based on: --
-- --
-- @file stm32f4xx_hal_dsi.c --
-- @author MCD Application Team --
-- @version V1.4.2 --
-- @date 10-November-2015 --
-- --
-- COPYRIGHT(c) 2015 STMicroelectronics --
------------------------------------------------------------------------------
with Ada.Real_Time; use Ada.Real_Time;
with Ada.Unchecked_Conversion;
pragma Warnings (Off, "* is an internal GNAT unit");
with System.BB.Parameters; use System.BB.Parameters;
pragma Warnings (On, "* is an internal GNAT unit");
with HAL.DSI; use HAL.DSI;
with STM32_SVD.DSI; use STM32_SVD.DSI;
with STM32_SVD.RCC; use STM32_SVD.RCC;
package body STM32.DSI is
DSI_Data_Type_Encoding : constant array (DSI_Pkt_Data_Type) of UInt6 :=
(DCS_Short_Pkt_Write_P0 => 16#05#,
DCS_Short_Pkt_Write_P1 => 16#15#,
Gen_Short_Pkt_Write_P0 => 16#03#,
Gen_Short_Pkt_Write_P1 => 16#13#,
Gen_Short_Pkt_Write_P2 => 16#23#,
DCS_Long_Pkt_Write => 16#39#,
Gen_Long_Pkt_Write => 16#29#,
DCS_Short_Pkt_Read => 16#06#,
Gen_Short_Pkg_Read_P0 => 16#04#,
Gen_Short_Pkg_Read_P1 => 16#14#,
Gen_Short_Pkg_Read_P2 => 16#24#);
procedure DSI_Config_Packet_Header
(This : in out DSI_Host;
Channel_ID : DSI_Virtual_Channel_ID;
Data_Type : DSI_Pkt_Data_Type;
Data0 : UInt8;
Data1 : UInt8);
------------------------------
-- DSI_Config_Packet_Header --
------------------------------
procedure DSI_Config_Packet_Header
(This : in out DSI_Host;
Channel_ID : DSI_Virtual_Channel_ID;
Data_Type : DSI_Pkt_Data_Type;
Data0 : UInt8;
Data1 : UInt8)
is
begin
This.Periph.DSI_GHCR :=
(DT => DSI_Data_Type_Encoding (Data_Type),
VCID => Channel_ID,
WCLSB => Data0,
WCMSB => Data1,
others => <>);
end DSI_Config_Packet_Header;
--------------------
-- DSI_Initialize --
--------------------
procedure DSI_Initialize
(This : in out DSI_Host;
PLL_N_Div : DSI_PLLN_Div;
PLL_IN_Div : DSI_PLL_IDF;
PLL_OUT_Div : DSI_PLL_ODF;
Auto_Clock_Lane_Control : Boolean;
TX_Escape_Clock_Division : UInt8;
-- The TX_ESC clock division. 0 or 1 stops the clock.
Number_Of_Lanes : DSI_Number_Of_Lanes)
is
Start : Time;
begin
-- Enable the regulator
This.Periph.DSI_WRPCR.REGEN := True;
Start := Clock;
-- Wait for the Regulator Ready Status
while not This.Periph.DSI_WISR.RRS loop
if Clock > (Start + Milliseconds (1000)) then
raise Program_Error with "Timeout during DSI initialisation";
end if;
end loop;
-- Enable the DSI clock
RCC_Periph.APB2ENR.DSIEN := True;
-- Make sure the DSI peripheral is OFF
This.DSI_Stop;
---------------------------
-- Configure the DSI PLL --
---------------------------
This.Periph.DSI_WRPCR.IDF := PLL_IN_Div;
This.Periph.DSI_WRPCR.NDIV := PLL_N_Div;
This.Periph.DSI_WRPCR.ODF := DSI_PLL_ODF'Enum_Rep (PLL_OUT_Div);
-- Enable the DSI PLL
This.Periph.DSI_WRPCR.PLLEN := True;
-- Wait for the lock of the PLL
Start := Clock;
while not This.Periph.DSI_WISR.PLLLS loop
if Clock > (Start + Milliseconds (1000)) then
raise Program_Error with "Timeout during DSI PLL setup";
end if;
end loop;
----------------------------
-- Set the PHY parameters --
----------------------------
-- Enable D-PHY clock and digital
This.Periph.DSI_PCTLR.CKE := True;
This.Periph.DSI_PCTLR.DEN := True;
-- Clock lane configuration
This.Periph.DSI_CLCR.DPCC := True;
This.Periph.DSI_CLCR.ACR := Auto_Clock_Lane_Control;
-- Configure the number of active data lanes
This.Periph.DSI_PCONFR.NL :=
DSI_Number_Of_Lanes'Enum_Rep (Number_Of_Lanes);
----------------------------------
-- Set the DSI Clock parameters --
----------------------------------
This.Periph.DSI_CCR.TXECKDIV := TX_Escape_Clock_Division;
-- Calculate the bit period in high-speed mode in unit of 0.25 ns.
-- The equation is UIX4 = IntegerPart ((1000/F_PHY_Mhz) * 4)
-- Where F_PHY_Mhz = (PLLNDIV * HSE_MHz) / (IDF * ODF)
-- => UIX4 = 4_000 * IDF * ODV / (PLLNDIV * HSE_MHz)
declare
HSE_MHz : constant UInt32 := HSE_Clock / 1_000_000;
IDF : constant UInt32 := UInt32 (PLL_IN_Div);
ODF : constant UInt32 :=
Shift_Left
(1, DSI_PLL_ODF'Enum_Rep (PLL_OUT_Div));
PLLN : constant UInt32 := UInt32 (PLL_N_Div);
Unit_Interval_x4 : constant UInt32 :=
((4_000 * IDF * ODF) / (PLLN * HSE_MHz));
begin
This.Periph.DSI_WPCR1.UIX4 := UInt6 (Unit_Interval_x4);
end;
----------------------
-- Error Management --
----------------------
-- Disable error interrupts
This.Periph.DSI_IER0 := (others => <>);
This.Periph.DSI_IER1 := (others => <>);
end DSI_Initialize;
----------------
-- DSI_Deinit --
----------------
procedure DSI_Deinit (This : in out DSI_Host) is
begin
-- Disable the DSI wrapper and host
This.DSI_Stop;
-- D-PHY clock and digital disable
This.Periph.DSI_PCTLR.DEN := False;
This.Periph.DSI_PCTLR.CKE := False;
-- Turn off the DSI PLL
This.Periph.DSI_WRPCR.PLLEN := False;
-- Disable the regulator
This.Periph.DSI_WRPCR.REGEN := False;
end DSI_Deinit;
--------------------------
-- DSI_Setup_Video_Mode --
--------------------------
procedure DSI_Setup_Video_Mode
(This : in out DSI_Host;
Virtual_Channel : HAL.DSI.DSI_Virtual_Channel_ID;
Color_Coding : DSI_Color_Mode;
Loosely_Packed : Boolean;
Video_Mode : DSI_Video_Mode;
Packet_Size : UInt14;
Number_Of_Chunks : UInt13;
Null_Packet_Size : UInt13;
HSync_Polarity : DSI_Polarity;
VSync_Polarity : DSI_Polarity;
DataEn_Polarity : DSI_Polarity;
HSync_Active_Duration : UInt12;
Horizontal_BackPorch : UInt12;
Horizontal_Line : UInt15;
VSync_Active_Duration : UInt10;
Vertical_BackPorch : UInt10;
Vertical_FrontPorch : UInt10;
Vertical_Active : UInt14;
LP_Command_Enabled : Boolean;
LP_Largest_Packet_Size : UInt8;
LP_VACT_Largest_Packet_Size : UInt8;
LP_H_Front_Porch_Enable : Boolean;
LP_H_Back_Porch_Enable : Boolean;
LP_V_Active_Enable : Boolean;
LP_V_Front_Porch_Enable : Boolean;
LP_V_Back_Porch_Enable : Boolean;
LP_V_Sync_Active_Enable : Boolean;
Frame_BTA_Ack_Enable : Boolean)
is
function To_Bool is new Ada.Unchecked_Conversion
(DSI_Polarity, Boolean);
begin
-- Select video mode by resetting CMDM and SDIM bits
This.Periph.DSI_MCR.CMDM := False;
This.Periph.DSI_WCFGR.DSIM := False;
-- Configure the video mode transmission type
This.Periph.DSI_VMCR.VMT := DSI_Video_Mode'Enum_Rep (Video_Mode);
-- Configure the video packet size
This.Periph.DSI_VPCR.VPSIZE := Packet_Size;
-- Set the chunks number to be transmitted through the DSI link
This.Periph.DSI_VCCR.NUMC := Number_Of_Chunks;
-- Set the size of the null packet
This.Periph.DSI_VNPCR.NPSIZE := Null_Packet_Size;
-- Select the virtual channel for the LTDC interface traffic
This.Periph.DSI_LVCIDR.VCID := Virtual_Channel;
-- Configure the polarity of control signals
This.Periph.DSI_LPCR.HSP := To_Bool (HSync_Polarity);
This.Periph.DSI_LPCR.VSP := To_Bool (VSync_Polarity);
This.Periph.DSI_LPCR.DEP := To_Bool (DataEn_Polarity);
-- Select the color coding for the host
This.Periph.DSI_LCOLCR.COLC := DSI_Color_Mode'Enum_Rep (Color_Coding);
-- ... and for the wrapper
This.Periph.DSI_WCFGR.COLMUX := DSI_Color_Mode'Enum_Rep (Color_Coding);
-- Enable/disable the loosely packed variant to 18-bit configuration
if Color_Coding = RGB666 then
This.Periph.DSI_LCOLCR.LPE := Loosely_Packed;
end if;
-- Set the Horizontal Synchronization Active (HSA) in lane byte clock
-- cycles
This.Periph.DSI_VHSACR.HSA := HSync_Active_Duration;
-- Set the Horizontal Back Porch
This.Periph.DSI_VHBPCR.HBP := Horizontal_BackPorch;
-- Total line time (HSA+HBP+HACT+HFP
This.Periph.DSI_VLCR.HLINE := Horizontal_Line;
-- Set the Vertical Synchronization Active
This.Periph.DSI_VVSACR.VSA := VSync_Active_Duration;
-- VBP
This.Periph.DSI_VVBPCR.VBP := Vertical_BackPorch;
-- VFP
This.Periph.DSI_VVFPCR.VFP := Vertical_FrontPorch;
-- Vertical Active Period
This.Periph.DSI_VVACR.VA := Vertical_Active;
-- Configure the command transmission mode
This.Periph.DSI_VMCR.LPCE := LP_Command_Enabled;
-- Low power configuration:
This.Periph.DSI_LPMCR.LPSIZE := LP_Largest_Packet_Size;
This.Periph.DSI_LPMCR.VLPSIZE := LP_VACT_Largest_Packet_Size;
This.Periph.DSI_VMCR.LPHFE := LP_H_Front_Porch_Enable;
This.Periph.DSI_VMCR.LPHBPE := LP_H_Back_Porch_Enable;
This.Periph.DSI_VMCR.LPVAE := LP_V_Active_Enable;
This.Periph.DSI_VMCR.LPVFPE := LP_V_Front_Porch_Enable;
This.Periph.DSI_VMCR.LPVBPE := LP_V_Back_Porch_Enable;
This.Periph.DSI_VMCR.LPVSAE := LP_V_Sync_Active_Enable;
This.Periph.DSI_VMCR.FBTAAE := Frame_BTA_Ack_Enable;
end DSI_Setup_Video_Mode;
------------------------------------
-- DSI_Setup_Adapted_Command_Mode --
------------------------------------
procedure DSI_Setup_Adapted_Command_Mode
(This : in out DSI_Host;
Virtual_Channel : DSI_Virtual_Channel_ID;
Color_Coding : DSI_Color_Mode;
Command_Size : UInt16;
Tearing_Effect_Source : DSI_Tearing_Effect_Source;
Tearing_Effect_Polarity : DSI_TE_Polarity;
HSync_Polarity : DSI_Polarity;
VSync_Polarity : DSI_Polarity;
DataEn_Polarity : DSI_Polarity;
VSync_Edge : DSI_Edge;
Automatic_Refresh : Boolean;
TE_Acknowledge_Request : Boolean)
is
function To_Bool is new Ada.Unchecked_Conversion
(DSI_Polarity, Boolean);
function To_Bool is new Ada.Unchecked_Conversion
(DSI_TE_Polarity, Boolean);
function To_Bool is new Ada.Unchecked_Conversion
(DSI_Edge, Boolean);
begin
-- Select the command mode by setting CMDM and DSIM bits
This.Periph.DSI_MCR.CMDM := True;
This.Periph.DSI_WCFGR.DSIM := True;
-- Select the virtual channel for the LTDC interface traffic
This.Periph.DSI_LVCIDR.VCID := Virtual_Channel;
-- Configure the polarity of control signals
This.Periph.DSI_LPCR.HSP := To_Bool (HSync_Polarity);
This.Periph.DSI_LPCR.VSP := To_Bool (VSync_Polarity);
This.Periph.DSI_LPCR.DEP := To_Bool (DataEn_Polarity);
-- Select the color coding for the host
This.Periph.DSI_LCOLCR.COLC := DSI_Color_Mode'Enum_Rep (Color_Coding);
-- ... and for the wrapper
This.Periph.DSI_WCFGR.COLMUX :=
DSI_Color_Mode'Enum_Rep (Color_Coding);
-- Configure the maximum allowed size for write memory command
This.Periph.DSI_LCCR.CMDSIZE := Command_Size;
-- Configure the tearing effect source and polarity
This.Periph.DSI_WCFGR.TESRC := Tearing_Effect_Source = TE_External;
This.Periph.DSI_WCFGR.TEPOL := To_Bool (Tearing_Effect_Polarity);
This.Periph.DSI_WCFGR.AR := Automatic_Refresh;
This.Periph.DSI_WCFGR.VSPOL := To_Bool (VSync_Edge);
-- Tearing effect acknowledge request
This.Periph.DSI_CMCR.TEARE := TE_Acknowledge_Request;
-- Enable the TE interrupt
This.Periph.DSI_WIER.TEIE := True;
-- Enable the End-of-refresh interrupt
This.Periph.DSI_WIER.ERIE := True;
end DSI_Setup_Adapted_Command_Mode;
-----------------------
-- DSI_Setup_Command --
-----------------------
procedure DSI_Setup_Command
(This : in out DSI_Host;
LP_Gen_Short_Write_No_P : Boolean := True;
LP_Gen_Short_Write_One_P : Boolean := True;
LP_Gen_Short_Write_Two_P : Boolean := True;
LP_Gen_Short_Read_No_P : Boolean := True;
LP_Gen_Short_Read_One_P : Boolean := True;
LP_Gen_Short_Read_Two_P : Boolean := True;
LP_Gen_Long_Write : Boolean := True;
LP_DCS_Short_Write_No_P : Boolean := True;
LP_DCS_Short_Write_One_P : Boolean := True;
LP_DCS_Short_Read_No_P : Boolean := True;
LP_DCS_Long_Write : Boolean := True;
LP_Max_Read_Packet : Boolean := False;
Acknowledge_Request : Boolean := False)
is
begin
This.Periph.DSI_CMCR.GSW0TX := LP_Gen_Short_Write_No_P;
This.Periph.DSI_CMCR.GSW1TX := LP_Gen_Short_Write_One_P;
This.Periph.DSI_CMCR.GSW2TX := LP_Gen_Short_Write_Two_P;
This.Periph.DSI_CMCR.GSR0TX := LP_Gen_Short_Read_No_P;
This.Periph.DSI_CMCR.GSR1TX := LP_Gen_Short_Read_One_P;
This.Periph.DSI_CMCR.GSR2TX := LP_Gen_Short_Read_Two_P;
This.Periph.DSI_CMCR.GLWTX := LP_Gen_Long_Write;
This.Periph.DSI_CMCR.DSW0TX := LP_DCS_Short_Write_No_P;
This.Periph.DSI_CMCR.DSW1TX := LP_DCS_Short_Write_One_P;
This.Periph.DSI_CMCR.DSR0TX := LP_DCS_Short_Read_No_P;
This.Periph.DSI_CMCR.DLWTX := LP_DCS_Long_Write;
This.Periph.DSI_CMCR.MRDPS := LP_Max_Read_Packet;
This.Periph.DSI_CMCR.ARE := Acknowledge_Request;
end DSI_Setup_Command;
----------------------------
-- DSI_Setup_Flow_Control --
----------------------------
procedure DSI_Setup_Flow_Control
(This : in out DSI_Host;
Flow_Control : DSI_Flow_Control)
is
begin
This.Periph.DSI_PCR := (others => <>);
case Flow_Control is
when Flow_Control_CRC_RX =>
This.Periph.DSI_PCR.CRCRXE := True;
when Flow_Control_ECC_RX =>
This.Periph.DSI_PCR.ECCRXE := True;
when Flow_Control_BTA =>
This.Periph.DSI_PCR.BTAE := True;
when Flow_Control_EOTP_RX =>
This.Periph.DSI_PCR.ETRXE := True;
when Flow_Control_EOTP_TX =>
This.Periph.DSI_PCR.ETTXE := True;
end case;
end DSI_Setup_Flow_Control;
---------------
-- DSI_Start --
---------------
procedure DSI_Start (This : in out DSI_Host) is
begin
-- Enable the DSI Host
This.Periph.DSI_CR.EN := True;
-- Enable the DSI wrapper
This.DSI_Wrapper_Enable;
end DSI_Start;
--------------
-- DSI_Stop --
--------------
procedure DSI_Stop (This : in out DSI_Host) is
begin
-- Disable the DSI Host
This.Periph.DSI_CR.EN := False;
-- Disable the DSI wrapper
This.Periph.DSI_WCR.DSIEN := False;
end DSI_Stop;
------------------------
-- DSI_Wrapper_Enable --
------------------------
procedure DSI_Wrapper_Enable (This : in out DSI_Host) is
begin
This.Periph.DSI_WCR.DSIEN := True;
end DSI_Wrapper_Enable;
-------------------------
-- DSI_Wrapper_Disable --
-------------------------
procedure DSI_Wrapper_Disable (This : in out DSI_Host) is
begin
This.Periph.DSI_WCR.DSIEN := False;
end DSI_Wrapper_Disable;
-----------------
-- DSI_Refresh --
-----------------
procedure DSI_Refresh (This : in out DSI_Host) is
begin
This.Periph.DSI_WCR.LTDCEN := True;
end DSI_Refresh;
---------------------
-- DSI_Short_Write --
---------------------
overriding
procedure DSI_Short_Write
(This : in out DSI_Host;
Channel_ID : DSI_Virtual_Channel_ID;
Mode : DSI_Short_Write_Packet_Data_Type;
Param1 : UInt8;
Param2 : UInt8)
is
Start : Time;
begin
-- Wait for FIFO empty
Start := Clock;
while not This.Periph.DSI_GPSR.CMDFE loop
if Clock > Start + Milliseconds (1000) then
raise Program_Error with
"Timeout while waiting for DSI FIFO empty";
end if;
end loop;
-- Configure the packet to send a short DCS command with 0 or 1
-- parameter
This.DSI_Config_Packet_Header (Channel_ID, Mode, Param1, Param2);
end DSI_Short_Write;
--------------------
-- DSI_Long_Write --
--------------------
overriding
procedure DSI_Long_Write
(This : in out DSI_Host;
Channel_Id : DSI_Virtual_Channel_ID;
Mode : DSI_Long_Write_Packet_Data_Type;
Param1 : UInt8;
Parameters : DSI_Data)
is
Start : Time;
Off : Natural := 0;
Value : DSI_GPDR_Register;
Val1 : UInt32;
Val2 : UInt32;
begin
-- Wait for FIFO empty
Start := Clock;
while not This.Periph.DSI_GPSR.CMDFE loop
if Clock > Start + Milliseconds (1000) then
raise Program_Error with
"Timeout while waiting for DSI FIFO empty";
end if;
end loop;
Value.Arr (Value.Arr'First) := Param1;
Off := Value.Arr'First + 1;
for Param of Parameters loop
Value.Arr (Off) := Param;
Off := Off + 1;
if Off > Value.Arr'Last then
This.Periph.DSI_GPDR := Value;
Value.Val := 0;
Off := Value.Arr'First;
end if;
end loop;
if Off /= Value.Arr'First then
This.Periph.DSI_GPDR := Value;
end if;
Val1 := UInt32 (Parameters'Length + 1) and 16#FF#;
Val2 := Shift_Right (UInt32 (Parameters'Length + 1) and 16#FF00#, 8);
This.DSI_Config_Packet_Header
(Channel_Id, Mode, UInt8 (Val1), UInt8 (Val2));
end DSI_Long_Write;
end STM32.DSI;
|
-----------------------------------------------------------------------
-- ado-queries-tests -- Test loading of database queries
-- Copyright (C) 2011, 2012, 2013, 2014 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Test_Caller;
with Util.Properties;
with ADO.Drivers.Connections;
with ADO.Queries.Loaders;
package body ADO.Queries.Tests is
use Util.Tests;
package Caller is new Util.Test_Caller (Test, "ADO.Queries");
procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite) is
begin
Caller.Add_Test (Suite, "Test ADO.Queries.Read_Query",
Test_Load_Queries'Access);
Caller.Add_Test (Suite, "Test ADO.Queries.Initialize",
Test_Initialize'Access);
end Add_Tests;
package Simple_Query_File is
new ADO.Queries.Loaders.File (Path => "regtests/files/simple-query.xml",
Sha1 => "");
package Multi_Query_File is
new ADO.Queries.Loaders.File (Path => "regtests/files/multi-query.xml",
Sha1 => "");
package Simple_Query is
new ADO.Queries.Loaders.Query (Name => "simple-query",
File => Simple_Query_File.File'Access);
package Simple_Query_2 is
new ADO.Queries.Loaders.Query (Name => "simple-query",
File => Multi_Query_File.File'Access);
package Index_Query is
new ADO.Queries.Loaders.Query (Name => "index",
File => Multi_Query_File.File'Access);
package Value_Query is
new ADO.Queries.Loaders.Query (Name => "value",
File => Multi_Query_File.File'Access);
pragma Warnings (Off, Simple_Query_2);
pragma Warnings (Off, Value_Query);
procedure Test_Load_Queries (T : in out Test) is
use ADO.Drivers.Connections;
Mysql_Driver : constant Driver_Access := ADO.Drivers.Connections.Get_Driver ("mysql");
Sqlite_Driver : constant Driver_Access := ADO.Drivers.Connections.Get_Driver ("sqlite");
Props : constant Util.Properties.Manager := Util.Tests.Get_Properties;
begin
-- Configure the XML query loader.
ADO.Queries.Loaders.Initialize (Props.Get ("ado.queries.paths", ".;db"),
Props.Get ("ado.queries.load", "false") = "true");
declare
SQL : constant String := ADO.Queries.Get_SQL (Simple_Query.Query'Access, 0, False);
begin
Assert_Equals (T, "select count(*) from user", SQL, "Invalid query for 'simple-query'");
end;
declare
SQL : constant String := ADO.Queries.Get_SQL (Index_Query.Query'Access, 0, False);
begin
Assert_Equals (T, "select 0", SQL, "Invalid query for 'index'");
end;
if Mysql_Driver /= null then
declare
SQL : constant String := ADO.Queries.Get_SQL (Index_Query.Query'Access,
Mysql_Driver.Get_Driver_Index,
False);
begin
Assert_Equals (T, "select 1", SQL, "Invalid query for 'index' (MySQL driver)");
end;
end if;
if Sqlite_Driver /= null then
declare
SQL : constant String := ADO.Queries.Get_SQL (Index_Query.Query'Access,
Sqlite_Driver.Get_Driver_Index, False);
begin
Assert_Equals (T, "select 0", SQL, "Invalid query for 'index' (SQLite driver)");
end;
end if;
end Test_Load_Queries;
-- ------------------------------
-- Test the Initialize operation called several times
-- ------------------------------
procedure Test_Initialize (T : in out Test) is
use ADO.Drivers.Connections;
Props : constant Util.Properties.Manager := Util.Tests.Get_Properties;
Info : Query_Info_Ref.Ref;
begin
-- Configure and load the XML queries.
ADO.Queries.Loaders.Initialize (Props.Get ("ado.queries.paths", ".;db"), True);
T.Assert (not Simple_Query.Query.Query.Get.Is_Null, "The simple query was not loaded");
T.Assert (not Index_Query.Query.Query.Get.Is_Null, "The index query was not loaded");
Info := Simple_Query.Query.Query.Get;
-- Re-configure but do not reload.
ADO.Queries.Loaders.Initialize (Props.Get ("ado.queries.paths", ".;db"), False);
T.Assert (Info.Value = Simple_Query.Query.Query.Get.Value,
"The simple query instance was not changed");
-- Configure again and reload. The query info must have changed.
ADO.Queries.Loaders.Initialize (Props.Get ("ado.queries.paths", ".;db"), True);
T.Assert (Info.Value /= Simple_Query.Query.Query.Get.Value,
"The simple query instance was not changed");
-- Due to the reference held by 'Info', it refers to the data loaded first.
T.Assert (Length (Info.Value.Main_Query (0).SQL) > 0, "The old query is not valid");
end Test_Initialize;
end ADO.Queries.Tests;
|
with Raylib;
package Surface.Window is
type Instance is abstract new Actor with private;
procedure Attach (Application : in out Reference);
procedure Run (Self : in out Instance'Class);
procedure Title (Self : in out Instance ; Title : String);
procedure Background_Color (Self : in out Instance ; Tint : raylib.Color);
procedure Size (Self : in out Instance ; Width, Height : Integer);
procedure Setup (self : in out Instance);
procedure Update (self : in out Instance ; dt : Float) is null;
private
type instance is new Actor with record
Window_Title : String (1..42);
Window_Width : Integer;
Window_Height : Integer;
Border_Width : integer;
Border_Color : raylib.Color;
Background_Color : Raylib.Color;
end record;
end Surface.Window;
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2017-2019, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with System.Storage_Elements; use System.Storage_Elements;
with HAL; use HAL;
with HAL.GPIO; use HAL.GPIO;
package body SiFive.GPIO is
function Pin_Bit (This : GPIO_Point'Class) return UInt32
with Inline_Always;
-------------
-- Pin_Bit --
-------------
function Pin_Bit (This : GPIO_Point'Class) return UInt32
is (Shift_Left (1, Natural (This.Pin)));
------------
-- Invert --
------------
procedure Invert (This : in out GPIO_Point;
Enabled : Boolean := True)
is
Out_Xor : UInt32
with Volatile,
Address => To_Address (This.Controller.Base_Address + 16#40#);
begin
if Enabled then
Out_Xor := Out_Xor or This.Pin_Bit;
else
Out_Xor := Out_Xor and (not This.Pin_Bit);
end if;
end Invert;
-- Invert the output level
function Inverted (This : GPIO_Point) return Boolean is
Out_Xor : UInt32
with Volatile,
Address => To_Address (This.Controller.Base_Address + 16#40#);
begin
return (Out_Xor and This.Pin_Bit) /= 0;
end Inverted;
----------
-- Mode --
----------
overriding
function Mode (This : GPIO_Point) return HAL.GPIO.GPIO_Mode is
Output_Enable : UInt32
with Volatile,
Address => To_Address (This.Controller.Base_Address + 16#08#);
begin
if (Output_Enable and This.Pin_Bit) /= 0 then
return Output;
else
return Input;
end if;
end Mode;
--------------
-- Set_Mode --
--------------
overriding
procedure Set_Mode (This : in out GPIO_Point;
Mode : HAL.GPIO.GPIO_Config_Mode)
is
Output_Enable : UInt32
with Volatile,
Address => To_Address (This.Controller.Base_Address + 16#08#);
Input_Enable : UInt32
with Volatile,
Address => To_Address (This.Controller.Base_Address + 16#04#);
begin
-- Input mode is always on to make sure we can read IO state even in
-- output mode.
Input_Enable := Input_Enable or This.Pin_Bit;
if Mode = Output then
Output_Enable := Output_Enable or This.Pin_Bit;
else
Output_Enable := Output_Enable and (not This.Pin_Bit);
end if;
end Set_Mode;
-------------------
-- Pull_Resistor --
-------------------
overriding
function Pull_Resistor (This : GPIO_Point)
return HAL.GPIO.GPIO_Pull_Resistor
is
Pullup_Enable : UInt32
with Volatile,
Address => To_Address (This.Controller.Base_Address + 16#10#);
begin
if (Pullup_Enable and This.Pin_Bit) /= 0 then
return Pull_Up;
else
return Floating;
end if;
end Pull_Resistor;
-----------------------
-- Set_Pull_Resistor --
-----------------------
overriding
procedure Set_Pull_Resistor (This : in out GPIO_Point;
Pull : HAL.GPIO.GPIO_Pull_Resistor)
is
Pullup_Enable : UInt32
with Volatile,
Address => To_Address (This.Controller.Base_Address + 16#10#);
begin
if Pull = Pull_Up then
Pullup_Enable := Pullup_Enable or This.Pin_Bit;
else
Pullup_Enable := Pullup_Enable and (not This.Pin_Bit);
end if;
end Set_Pull_Resistor;
---------
-- Set --
---------
overriding
function Set (This : GPIO_Point) return Boolean is
Input_Val : UInt32
with Volatile,
Address => To_Address (This.Controller.Base_Address + 16#00#);
begin
return (Input_Val and This.Pin_Bit) /= 0;
end Set;
---------
-- Set --
---------
overriding
procedure Set (This : in out GPIO_Point) is
Output_Val : UInt32
with Volatile,
Address => To_Address (This.Controller.Base_Address + 16#0C#);
begin
Output_Val := Output_Val or This.Pin_Bit;
end Set;
-----------
-- Clear --
-----------
overriding
procedure Clear (This : in out GPIO_Point) is
Output_Val : UInt32
with Volatile,
Address => To_Address (This.Controller.Base_Address + 16#0C#);
begin
Output_Val := Output_Val and (not This.Pin_Bit);
end Clear;
------------
-- Toggle --
------------
overriding
procedure Toggle (This : in out GPIO_Point) is
begin
if This.Set then
This.Clear;
else
This.Set;
end if;
end Toggle;
end SiFive.GPIO;
|
--*****************************************************************************
--*
--* PROJECT: BingAda
--*
--* FILE: q_csv.ads
--*
--* AUTHOR: Javier Fuica Fernandez
--*
--* NOTES: This code was taken from Rosetta Code and modifyied to fix
-- BingAda needs and Style Guide.
--*
--*****************************************************************************
package Q_Csv is
type T_Row (<>) is tagged private;
function F_Line (V_Line : String;
V_Separator : Character := ';') return T_Row;
function F_Next (V_Row: in out T_Row) return Boolean;
-- if there is still an item in R, Next advances to it and returns True
function F_Item (V_Row: T_Row) return String;
-- after calling R.Next i times, this returns the i'th item (if any)
private
type T_Row (V_Length : Natural) is tagged record
R_Str : String (1 .. V_Length);
R_First : Positive;
R_Last : Natural;
R_Next : Positive;
R_Sep : Character;
end record;
end Q_Csv;
|
package body System.Storage_Pools is
pragma Suppress (All_Checks);
procedure Allocate_Any (
Pool : in out Root_Storage_Pool'Class;
Storage_Address : out Address;
Size_In_Storage_Elements : Storage_Elements.Storage_Count;
Alignment : Storage_Elements.Storage_Count) is
begin
Allocate (Pool, Storage_Address, Size_In_Storage_Elements, Alignment);
end Allocate_Any;
procedure Deallocate_Any (
Pool : in out Root_Storage_Pool'Class;
Storage_Address : Address;
Size_In_Storage_Elements : Storage_Elements.Storage_Count;
Alignment : Storage_Elements.Storage_Count) is
begin
Deallocate (Pool, Storage_Address, Size_In_Storage_Elements, Alignment);
end Deallocate_Any;
end System.Storage_Pools;
|
separate (JSA.Generic_Optional_Value)
protected body Buffer is
procedure Clear is
begin
if Stored.Set then
Stored := (Set => False);
Changed := True;
end if;
end Clear;
entry Get (Item : out Instance) when Changed is
begin
Item := Stored;
Changed := False;
end Get;
procedure Set (Item : in Element) is
begin
if Stored.Set and then Stored.Value = Item then
null;
else
Stored := (Set => True,
Value => Item);
Changed := True;
end if;
end Set;
end Buffer;
|
-- { dg-do compile }
-- { dg-options "-gnato" }
with Namet; use Namet;
function Overflow_Sum2 return Hash_Index_Type is
Even_Name_Len : Integer;
begin
if Name_Len > 12 then
Even_Name_Len := (Name_Len) / 2 * 2;
return ((((((((((((
Character'Pos (Name_Buffer (01))) * 2 +
Character'Pos (Name_Buffer (Even_Name_Len - 10))) * 2 +
Character'Pos (Name_Buffer (03))) * 2 +
Character'Pos (Name_Buffer (Even_Name_Len - 08))) * 2 +
Character'Pos (Name_Buffer (05))) * 2 +
Character'Pos (Name_Buffer (Even_Name_Len - 06))) * 2 +
Character'Pos (Name_Buffer (07))) * 2 +
Character'Pos (Name_Buffer (Even_Name_Len - 04))) * 2 +
Character'Pos (Name_Buffer (09))) * 2 +
Character'Pos (Name_Buffer (Even_Name_Len - 02))) * 2 +
Character'Pos (Name_Buffer (11))) * 2 +
Character'Pos (Name_Buffer (Even_Name_Len))) mod Hash_Num;
end if;
return 0;
end;
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.