-- --
-- B o d y --
-- --
--- Copyright (C) 1992-2006, Free Software Foundation, Inc. --
+-- Copyright (C) 1992-2009, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
--- ware Foundation; either version 2, or (at your option) any later ver- --
+-- 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 COPYING. If not, write --
--- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
--- Boston, MA 02110-1301, USA. --
+-- 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 Exp_Tss; use Exp_Tss;
with Exp_Util; use Exp_Util;
with Lib; use Lib;
+with Lib.Xref; use Lib.Xref;
+with Namet; use Namet;
with Nlists; use Nlists;
with Nmake; use Nmake;
with Opt; use Opt;
with Rident; use Rident;
with Rtsfind; use Rtsfind;
with Sem; use Sem;
+with Sem_Aux; use Sem_Aux;
+with Sem_Ch3; use Sem_Ch3;
with Sem_Ch8; use Sem_Ch8;
with Sem_Eval; use Sem_Eval;
with Sem_Res; use Sem_Res;
with Sem_Type; use Sem_Type;
with Sem_Util; use Sem_Util;
+with Sem_Warn; use Sem_Warn;
with Snames; use Snames;
with Stand; use Stand;
with Sinfo; use Sinfo;
with Tbuild; use Tbuild;
with Urealp; use Urealp;
-with GNAT.Heap_Sort_A; use GNAT.Heap_Sort_A;
+with GNAT.Heap_Sort_G;
package body Sem_Ch13 is
procedure Alignment_Check_For_Esize_Change (Typ : Entity_Id);
-- This routine is called after setting the Esize of type entity Typ.
- -- The purpose is to deal with the situation where an aligment has been
+ -- The purpose is to deal with the situation where an alignment has been
-- inherited from a derived type that is no longer appropriate for the
-- new Esize value. In this case, we reset the Alignment to unknown.
procedure Check_Component_Overlap (C1_Ent, C2_Ent : Entity_Id);
-- Given two entities for record components or discriminants, checks
- -- if they hav overlapping component clauses and issues errors if so.
+ -- if they have overlapping component clauses and issues errors if so.
function Get_Alignment_Value (Expr : Node_Id) return Uint;
-- Given the expression for an alignment value, returns the corresponding
-- Attributes that do not specify a representation characteristic are
-- operational attributes.
- function Address_Aliased_Entity (N : Node_Id) return Entity_Id;
- -- If expression N is of the form E'Address, return E
-
- procedure Mark_Aliased_Address_As_Volatile (N : Node_Id);
- -- This is used for processing of an address representation clause. If
- -- the expression N is of the form of K'Address, then the entity that
- -- is associated with K is marked as volatile.
-
- procedure New_Stream_Function
+ procedure New_Stream_Subprogram
(N : Node_Id;
Ent : Entity_Id;
Subp : Entity_Id;
Nam : TSS_Name_Type);
- -- Create a function renaming of a given stream attribute to the
- -- designated subprogram and then in the tagged case, provide this as
- -- a primitive operation, or in the non-tagged case make an appropriate
- -- TSS entry. Used for Input. This is more properly an expansion activity
- -- than just semantics, but the presence of user-defined stream functions
- -- for limited types is a legality check, which is why this takes place
- -- here rather than in exp_ch13, where it was previously. Nam indicates
- -- the name of the TSS function to be generated.
+ -- Create a subprogram renaming of a given stream attribute to the
+ -- designated subprogram and then in the tagged case, provide this as a
+ -- primitive operation, or in the non-tagged case make an appropriate TSS
+ -- entry. This is more properly an expansion activity than just semantics,
+ -- but the presence of user-defined stream functions for limited types is a
+ -- legality check, which is why this takes place here rather than in
+ -- exp_ch13, where it was previously. Nam indicates the name of the TSS
+ -- function to be generated.
--
-- To avoid elaboration anomalies with freeze nodes, for untagged types
-- we generate both a subprogram declaration and a subprogram renaming
-- renaming_as_body. For tagged types, the specification is one of the
-- primitive specs.
- procedure New_Stream_Procedure
- (N : Node_Id;
- Ent : Entity_Id;
- Subp : Entity_Id;
- Nam : TSS_Name_Type;
- Out_P : Boolean := False);
- -- Create a procedure renaming of a given stream attribute to the
- -- designated subprogram and then in the tagged case, provide this as
- -- a primitive operation, or in the non-tagged case make an appropriate
- -- TSS entry. Used for Read, Output, Write. Nam indicates the name of
- -- the TSS procedure to be generated.
-
----------------------------------------------
-- Table for Validate_Unchecked_Conversions --
----------------------------------------------
-- call to Validate_Unchecked_Conversions does the actual error
-- checking and posting of warnings. The reason for this delayed
-- processing is to take advantage of back-annotations of size and
- -- alignment values peformed by the back end.
+ -- alignment values performed by the back end.
+
+ -- Note: the reason we store a Source_Ptr value instead of a Node_Id
+ -- is that by the time Validate_Unchecked_Conversions is called, Sprint
+ -- will already have modified all Sloc values if the -gnatD option is set.
type UC_Entry is record
- Enode : Node_Id; -- node used for posting warnings
- Source : Entity_Id; -- source type for unchecked conversion
- Target : Entity_Id; -- target type for unchecked conversion
+ Eloc : Source_Ptr; -- node used for posting warnings
+ Source : Entity_Id; -- source type for unchecked conversion
+ Target : Entity_Id; -- target type for unchecked conversion
end record;
package Unchecked_Conversions is new Table.Table (
Table_Increment => 200,
Table_Name => "Unchecked_Conversions");
- ----------------------------
- -- Address_Aliased_Entity --
- ----------------------------
+ ----------------------------------------
+ -- Table for Validate_Address_Clauses --
+ ----------------------------------------
+
+ -- If an address clause has the form
+
+ -- for X'Address use Expr
+
+ -- where Expr is of the form Y'Address or recursively is a reference
+ -- to a constant of either of these forms, and X and Y are entities of
+ -- objects, then if Y has a smaller alignment than X, that merits a
+ -- warning about possible bad alignment. The following table collects
+ -- address clauses of this kind. We put these in a table so that they
+ -- can be checked after the back end has completed annotation of the
+ -- alignments of objects, since we can catch more cases that way.
+
+ type Address_Clause_Check_Record is record
+ N : Node_Id;
+ -- The address clause
+
+ X : Entity_Id;
+ -- The entity of the object overlaying Y
+
+ Y : Entity_Id;
+ -- The entity of the object being overlaid
+
+ Off : Boolean;
+ -- Whether the address is offseted within Y
+ end record;
+
+ package Address_Clause_Checks is new Table.Table (
+ Table_Component_Type => Address_Clause_Check_Record,
+ Table_Index_Type => Int,
+ Table_Low_Bound => 1,
+ Table_Initial => 20,
+ Table_Increment => 200,
+ Table_Name => "Address_Clause_Checks");
+
+ -----------------------------------------
+ -- Adjust_Record_For_Reverse_Bit_Order --
+ -----------------------------------------
+
+ procedure Adjust_Record_For_Reverse_Bit_Order (R : Entity_Id) is
+ Max_Machine_Scalar_Size : constant Uint :=
+ UI_From_Int
+ (Standard_Long_Long_Integer_Size);
+ -- We use this as the maximum machine scalar size in the sense of AI-133
+
+ Num_CC : Natural;
+ Comp : Entity_Id;
+ SSU : constant Uint := UI_From_Int (System_Storage_Unit);
- function Address_Aliased_Entity (N : Node_Id) return Entity_Id is
begin
- if Nkind (N) = N_Attribute_Reference
- and then Attribute_Name (N) = Name_Address
- then
+ -- This first loop through components does two things. First it deals
+ -- with the case of components with component clauses whose length is
+ -- greater than the maximum machine scalar size (either accepting them
+ -- or rejecting as needed). Second, it counts the number of components
+ -- with component clauses whose length does not exceed this maximum for
+ -- later processing.
+
+ Num_CC := 0;
+ Comp := First_Component_Or_Discriminant (R);
+ while Present (Comp) loop
declare
- Nam : Node_Id := Prefix (N);
+ CC : constant Node_Id := Component_Clause (Comp);
+
begin
- while False
- or else Nkind (Nam) = N_Selected_Component
- or else Nkind (Nam) = N_Indexed_Component
- loop
- Nam := Prefix (Nam);
- end loop;
+ if Present (CC) then
+ declare
+ Fbit : constant Uint := Static_Integer (First_Bit (CC));
+
+ begin
+ -- Case of component with size > max machine scalar
+
+ if Esize (Comp) > Max_Machine_Scalar_Size then
+
+ -- Must begin on byte boundary
+
+ if Fbit mod SSU /= 0 then
+ Error_Msg_N
+ ("illegal first bit value for reverse bit order",
+ First_Bit (CC));
+ Error_Msg_Uint_1 := SSU;
+ Error_Msg_Uint_2 := Max_Machine_Scalar_Size;
+
+ Error_Msg_N
+ ("\must be a multiple of ^ if size greater than ^",
+ First_Bit (CC));
+
+ -- Must end on byte boundary
+
+ elsif Esize (Comp) mod SSU /= 0 then
+ Error_Msg_N
+ ("illegal last bit value for reverse bit order",
+ Last_Bit (CC));
+ Error_Msg_Uint_1 := SSU;
+ Error_Msg_Uint_2 := Max_Machine_Scalar_Size;
+
+ Error_Msg_N
+ ("\must be a multiple of ^ if size greater than ^",
+ Last_Bit (CC));
+
+ -- OK, give warning if enabled
- if Is_Entity_Name (Nam) then
- return Entity (Nam);
+ elsif Warn_On_Reverse_Bit_Order then
+ Error_Msg_N
+ ("multi-byte field specified with non-standard"
+ & " Bit_Order?", CC);
+
+ if Bytes_Big_Endian then
+ Error_Msg_N
+ ("\bytes are not reversed "
+ & "(component is big-endian)?", CC);
+ else
+ Error_Msg_N
+ ("\bytes are not reversed "
+ & "(component is little-endian)?", CC);
+ end if;
+ end if;
+
+ -- Case where size is not greater than max machine
+ -- scalar. For now, we just count these.
+
+ else
+ Num_CC := Num_CC + 1;
+ end if;
+ end;
end if;
end;
- end if;
- return Empty;
- end Address_Aliased_Entity;
+ Next_Component_Or_Discriminant (Comp);
+ end loop;
+
+ -- We need to sort the component clauses on the basis of the Position
+ -- values in the clause, so we can group clauses with the same Position.
+ -- together to determine the relevant machine scalar size.
+
+ declare
+ Comps : array (0 .. Num_CC) of Entity_Id;
+ -- Array to collect component and discriminant entities. The data
+ -- starts at index 1, the 0'th entry is for the sort routine.
+
+ function CP_Lt (Op1, Op2 : Natural) return Boolean;
+ -- Compare routine for Sort
+
+ procedure CP_Move (From : Natural; To : Natural);
+ -- Move routine for Sort
+
+ package Sorting is new GNAT.Heap_Sort_G (CP_Move, CP_Lt);
+
+ Start : Natural;
+ Stop : Natural;
+ -- Start and stop positions in component list of set of components
+ -- with the same starting position (that constitute components in
+ -- a single machine scalar).
+
+ MaxL : Uint;
+ -- Maximum last bit value of any component in this set
+
+ MSS : Uint;
+ -- Corresponding machine scalar size
+
+ -----------
+ -- CP_Lt --
+ -----------
+
+ function CP_Lt (Op1, Op2 : Natural) return Boolean is
+ begin
+ return Position (Component_Clause (Comps (Op1))) <
+ Position (Component_Clause (Comps (Op2)));
+ end CP_Lt;
+
+ -------------
+ -- CP_Move --
+ -------------
+
+ procedure CP_Move (From : Natural; To : Natural) is
+ begin
+ Comps (To) := Comps (From);
+ end CP_Move;
+
+ begin
+ -- Collect the component clauses
+
+ Num_CC := 0;
+ Comp := First_Component_Or_Discriminant (R);
+ while Present (Comp) loop
+ if Present (Component_Clause (Comp))
+ and then Esize (Comp) <= Max_Machine_Scalar_Size
+ then
+ Num_CC := Num_CC + 1;
+ Comps (Num_CC) := Comp;
+ end if;
+
+ Next_Component_Or_Discriminant (Comp);
+ end loop;
+
+ -- Sort by ascending position number
+
+ Sorting.Sort (Num_CC);
+
+ -- We now have all the components whose size does not exceed the max
+ -- machine scalar value, sorted by starting position. In this loop
+ -- we gather groups of clauses starting at the same position, to
+ -- process them in accordance with Ada 2005 AI-133.
+
+ Stop := 0;
+ while Stop < Num_CC loop
+ Start := Stop + 1;
+ Stop := Start;
+ MaxL :=
+ Static_Integer (Last_Bit (Component_Clause (Comps (Start))));
+ while Stop < Num_CC loop
+ if Static_Integer
+ (Position (Component_Clause (Comps (Stop + 1)))) =
+ Static_Integer
+ (Position (Component_Clause (Comps (Stop))))
+ then
+ Stop := Stop + 1;
+ MaxL :=
+ UI_Max
+ (MaxL,
+ Static_Integer
+ (Last_Bit (Component_Clause (Comps (Stop)))));
+ else
+ exit;
+ end if;
+ end loop;
+
+ -- Now we have a group of component clauses from Start to Stop
+ -- whose positions are identical, and MaxL is the maximum last bit
+ -- value of any of these components.
+
+ -- We need to determine the corresponding machine scalar size.
+ -- This loop assumes that machine scalar sizes are even, and that
+ -- each possible machine scalar has twice as many bits as the
+ -- next smaller one.
+
+ MSS := Max_Machine_Scalar_Size;
+ while MSS mod 2 = 0
+ and then (MSS / 2) >= SSU
+ and then (MSS / 2) > MaxL
+ loop
+ MSS := MSS / 2;
+ end loop;
+
+ -- Here is where we fix up the Component_Bit_Offset value to
+ -- account for the reverse bit order. Some examples of what needs
+ -- to be done for the case of a machine scalar size of 8 are:
+
+ -- First_Bit .. Last_Bit Component_Bit_Offset
+ -- old new old new
+
+ -- 0 .. 0 7 .. 7 0 7
+ -- 0 .. 1 6 .. 7 0 6
+ -- 0 .. 2 5 .. 7 0 5
+ -- 0 .. 7 0 .. 7 0 4
+
+ -- 1 .. 1 6 .. 6 1 6
+ -- 1 .. 4 3 .. 6 1 3
+ -- 4 .. 7 0 .. 3 4 0
+
+ -- The general rule is that the first bit is obtained by
+ -- subtracting the old ending bit from machine scalar size - 1.
+
+ for C in Start .. Stop loop
+ declare
+ Comp : constant Entity_Id := Comps (C);
+ CC : constant Node_Id := Component_Clause (Comp);
+ LB : constant Uint := Static_Integer (Last_Bit (CC));
+ NFB : constant Uint := MSS - Uint_1 - LB;
+ NLB : constant Uint := NFB + Esize (Comp) - 1;
+ Pos : constant Uint := Static_Integer (Position (CC));
+
+ begin
+ if Warn_On_Reverse_Bit_Order then
+ Error_Msg_Uint_1 := MSS;
+ Error_Msg_N
+ ("info: reverse bit order in machine " &
+ "scalar of length^?", First_Bit (CC));
+ Error_Msg_Uint_1 := NFB;
+ Error_Msg_Uint_2 := NLB;
+
+ if Bytes_Big_Endian then
+ Error_Msg_NE
+ ("?\info: big-endian range for "
+ & "component & is ^ .. ^",
+ First_Bit (CC), Comp);
+ else
+ Error_Msg_NE
+ ("?\info: little-endian range "
+ & "for component & is ^ .. ^",
+ First_Bit (CC), Comp);
+ end if;
+ end if;
+
+ Set_Component_Bit_Offset (Comp, Pos * SSU + NFB);
+ Set_Normalized_First_Bit (Comp, NFB mod SSU);
+ end;
+ end loop;
+ end loop;
+ end;
+ end Adjust_Record_For_Reverse_Bit_Order;
--------------------------------------
-- Alignment_Check_For_Esize_Change --
-- definition clause that is the preferred approach in Ada 95.
procedure Analyze_At_Clause (N : Node_Id) is
+ CS : constant Boolean := Comes_From_Source (N);
+
begin
+ -- This is an obsolescent feature
+
Check_Restriction (No_Obsolescent_Features, N);
if Warn_On_Obsolescent_Feature then
Error_Msg_N
- ("at clause is an obsolescent feature ('R'M 'J.7(2))?", N);
+ ("at clause is an obsolescent feature (RM J.7(2))?", N);
Error_Msg_N
("\use address attribute definition clause instead?", N);
end if;
+ -- Rewrite as address clause
+
Rewrite (N,
Make_Attribute_Definition_Clause (Sloc (N),
Name => Identifier (N),
Chars => Name_Address,
Expression => Expression (N)));
+
+ -- We preserve Comes_From_Source, since logically the clause still
+ -- comes from the source program even though it is changed in form.
+
+ Set_Comes_From_Source (N, CS);
+
+ -- Analyze rewritten clause
+
Analyze_Attribute_Definition_Clause (N);
end Analyze_At_Clause;
-- Common processing for 'Read, 'Write, 'Input and 'Output attribute
-- definition clauses.
+ -----------------------------------
+ -- Analyze_Stream_TSS_Definition --
+ -----------------------------------
+
procedure Analyze_Stream_TSS_Definition (TSS_Nam : TSS_Name_Type) is
Subp : Entity_Id := Empty;
I : Interp_Index;
return Base_Type (Typ) = Base_Type (Ent)
and then No (Next_Formal (F));
-
end Has_Good_Profile;
-- Start of processing for Analyze_Stream_TSS_Definition
Pnam := TSS (Base_Type (U_Ent), TSS_Nam);
- if Present (Pnam) and then Has_Good_Profile (Pnam) then
+ -- If Pnam is present, it can be either inherited from an ancestor
+ -- type (in which case it is legal to redefine it for this type), or
+ -- be a previous definition of the attribute for the same type (in
+ -- which case it is illegal).
+
+ -- In the first case, it will have been analyzed already, and we
+ -- can check that its profile does not match the expected profile
+ -- for a stream attribute of U_Ent. In the second case, either Pnam
+ -- has been analyzed (and has the expected profile), or it has not
+ -- been analyzed yet (case of a type that has not been frozen yet
+ -- and for which the stream attribute has been set using Set_TSS).
+
+ if Present (Pnam)
+ and then (No (First_Entity (Pnam)) or else Has_Good_Profile (Pnam))
+ then
Error_Msg_Sloc := Sloc (Pnam);
Error_Msg_Name_1 := Attr;
Error_Msg_N ("% attribute already defined #", Nam);
else
Get_First_Interp (Expr, I, It);
-
while Present (It.Nam) loop
if Has_Good_Profile (It.Nam) then
Subp := It.Nam;
end if;
if Present (Subp) then
- if Is_Abstract (Subp) then
+ if Is_Abstract_Subprogram (Subp) then
Error_Msg_N ("stream subprogram must not be abstract", Expr);
return;
end if;
Set_Entity (Expr, Subp);
Set_Etype (Expr, Etype (Subp));
- if TSS_Nam = TSS_Stream_Input then
- New_Stream_Function (N, U_Ent, Subp, TSS_Nam);
- else
- New_Stream_Procedure (N, U_Ent, Subp, TSS_Nam,
- Out_P => Is_Read);
- end if;
+ New_Stream_Subprogram (N, U_Ent, Subp, TSS_Nam);
else
Error_Msg_Name_1 := Attr;
-- Start of processing for Analyze_Attribute_Definition_Clause
begin
+ -- Process Ignore_Rep_Clauses option
+
+ if Ignore_Rep_Clauses then
+ case Id is
+
+ -- The following should be ignored. They do not affect legality
+ -- and may be target dependent. The basic idea of -gnatI is to
+ -- ignore any rep clauses that may be target dependent but do not
+ -- affect legality (except possibly to be rejected because they
+ -- are incompatible with the compilation target).
+
+ when Attribute_Alignment |
+ Attribute_Bit_Order |
+ Attribute_Component_Size |
+ Attribute_Machine_Radix |
+ Attribute_Object_Size |
+ Attribute_Size |
+ Attribute_Small |
+ Attribute_Stream_Size |
+ Attribute_Value_Size =>
+
+ Rewrite (N, Make_Null_Statement (Sloc (N)));
+ return;
+
+ -- The following should not be ignored, because in the first place
+ -- they are reasonably portable, and should not cause problems in
+ -- compiling code from another target, and also they do affect
+ -- legality, e.g. failing to provide a stream attribute for a
+ -- type may make a program illegal.
+
+ when Attribute_External_Tag |
+ Attribute_Input |
+ Attribute_Output |
+ Attribute_Read |
+ Attribute_Storage_Pool |
+ Attribute_Storage_Size |
+ Attribute_Write =>
+ null;
+
+ -- Other cases are errors, which will be caught below
+
+ when others =>
+ null;
+ end case;
+ end if;
+
Analyze (Nam);
Ent := Entity (Nam);
-- Address attribute definition clause
when Attribute_Address => Address : begin
+
+ -- A little error check, catch for X'Address use X'Address;
+
+ if Nkind (Nam) = N_Identifier
+ and then Nkind (Expr) = N_Attribute_Reference
+ and then Attribute_Name (Expr) = Name_Address
+ and then Nkind (Prefix (Expr)) = N_Identifier
+ and then Chars (Nam) = Chars (Prefix (Expr))
+ then
+ Error_Msg_NE
+ ("address for & is self-referencing", Prefix (Expr), Ent);
+ return;
+ end if;
+
+ -- Not that special case, carry on with analysis of expression
+
Analyze_And_Resolve (Expr, RTE (RE_Address));
+ -- Even when ignoring rep clauses we need to indicate that the
+ -- entity has an address clause and thus it is legal to declare
+ -- it imported.
+
+ if Ignore_Rep_Clauses then
+ if Ekind (U_Ent) = E_Variable
+ or else Ekind (U_Ent) = E_Constant
+ then
+ Record_Rep_Item (U_Ent, N);
+ end if;
+
+ return;
+ end if;
+
if Present (Address_Clause (U_Ent)) then
Error_Msg_N ("address already given for &", Nam);
("address clause cannot be given " &
"for overloaded subprogram",
Nam);
+ return;
end if;
- -- For subprograms, all address clauses are permitted,
- -- and we mark the subprogram as having a deferred freeze
- -- so that Gigi will not elaborate it too soon.
+ -- For subprograms, all address clauses are permitted, and we
+ -- mark the subprogram as having a deferred freeze so that Gigi
+ -- will not elaborate it too soon.
-- Above needs more comments, what is too soon about???
if Nkind (Parent (N)) = N_Task_Body then
Error_Msg_N
("entry address must be specified in task spec", Nam);
+ return;
end if;
-- For entries, we require a constant address
Check_Constant_Address_Clause (Expr, U_Ent);
+ -- Special checks for task types
+
if Is_Task_Type (Scope (U_Ent))
and then Comes_From_Source (Scope (U_Ent))
then
("\?only one task can be declared of this type", N);
end if;
+ -- Entry address clauses are obsolescent
+
Check_Restriction (No_Obsolescent_Features, N);
if Warn_On_Obsolescent_Feature then
Error_Msg_N
("attaching interrupt to task entry is an " &
- "obsolescent feature ('R'M 'J.7.1)?", N);
+ "obsolescent feature (RM J.7.1)?", N);
Error_Msg_N
("\use interrupt procedure instead?", N);
end if;
- -- Case of an address clause for a controlled object:
- -- erroneous execution.
+ -- Case of an address clause for a controlled object which we
+ -- consider to be erroneous.
- elsif Is_Controlled (Etype (U_Ent)) then
+ elsif Is_Controlled (Etype (U_Ent))
+ or else Has_Controlled_Component (Etype (U_Ent))
+ then
Error_Msg_NE
("?controlled object& must not be overlaid", Nam, U_Ent);
Error_Msg_N
Insert_Action (Declaration_Node (U_Ent),
Make_Raise_Program_Error (Loc,
Reason => PE_Overlaid_Controlled_Object));
+ return;
-- Case of address clause for a (non-controlled) object
Ekind (U_Ent) = E_Constant
then
declare
- Expr : constant Node_Id := Expression (N);
- Aent : constant Entity_Id := Address_Aliased_Entity (Expr);
+ Expr : constant Node_Id := Expression (N);
+ O_Ent : Entity_Id;
+ Off : Boolean;
begin
- -- Exported variables cannot have an address clause,
- -- because this cancels the effect of the pragma Export
+ -- Exported variables cannot have an address clause, because
+ -- this cancels the effect of the pragma Export.
if Is_Exported (U_Ent) then
Error_Msg_N
("cannot export object with address clause", Nam);
+ return;
+ end if;
+
+ Find_Overlaid_Entity (N, O_Ent, Off);
-- Overlaying controlled objects is erroneous
- elsif Present (Aent)
- and then Is_Controlled (Etype (Aent))
+ if Present (O_Ent)
+ and then (Has_Controlled_Component (Etype (O_Ent))
+ or else Is_Controlled (Etype (O_Ent)))
then
Error_Msg_N
- ("?controlled object must not be overlaid", Expr);
+ ("?cannot overlay with controlled object", Expr);
Error_Msg_N
("\?Program_Error will be raised at run time", Expr);
Insert_Action (Declaration_Node (U_Ent),
Make_Raise_Program_Error (Loc,
Reason => PE_Overlaid_Controlled_Object));
+ return;
- elsif Present (Aent)
+ elsif Present (O_Ent)
and then Ekind (U_Ent) = E_Constant
- and then Ekind (Aent) /= E_Constant
+ and then not Is_Constant_Object (O_Ent)
then
Error_Msg_N ("constant overlays a variable?", Expr);
elsif Present (Renamed_Object (U_Ent)) then
Error_Msg_N
("address clause not allowed"
- & " for a renaming declaration ('R'M 13.1(6))", Nam);
+ & " for a renaming declaration (RM 13.1(6))", Nam);
+ return;
-- Imported variables can have an address clause, but then
-- the import is pretty meaningless except to suppress
-- We mark a possible modification of a variable with an
-- address clause, since it is likely aliasing is occurring.
- Note_Possible_Modification (Nam);
-
- -- Here we are checking for explicit overlap of one
- -- variable by another, and if we find this, then we
- -- mark the overlapped variable as also being aliased.
-
- -- First case is where we have an explicit
-
- -- for J'Address use K'Address;
-
- -- In this case, we mark K as volatile
+ Note_Possible_Modification (Nam, Sure => False);
- Mark_Aliased_Address_As_Volatile (Expr);
+ -- Here we are checking for explicit overlap of one variable
+ -- by another, and if we find this then mark the overlapped
+ -- variable as also being volatile to prevent unwanted
+ -- optimizations. This is a significant pessimization so
+ -- avoid it when there is an offset, i.e. when the object
+ -- is composite; they cannot be optimized easily anyway.
- -- Second case is where we have a constant whose
- -- definition is of the form of an adress as in:
-
- -- A : constant Address := K'Address;
- -- ...
- -- for B'Address use A;
-
- -- In this case we also mark K as volatile
-
- if Is_Entity_Name (Expr) then
- declare
- Ent : constant Entity_Id := Entity (Expr);
- Decl : constant Node_Id := Declaration_Node (Ent);
-
- begin
- if Ekind (Ent) = E_Constant
- and then Nkind (Decl) = N_Object_Declaration
- and then Present (Expression (Decl))
- then
- Mark_Aliased_Address_As_Volatile
- (Expression (Decl));
- end if;
- end;
+ if Present (O_Ent)
+ and then Is_Object (O_Ent)
+ and then not Off
+ then
+ Set_Treat_As_Volatile (O_Ent);
end if;
-- Legality checks on the address clause for initialized
Set_Has_Delayed_Freeze (U_Ent);
+ -- If an initialization call has been generated for this
+ -- object, it needs to be deferred to after the freeze node
+ -- we have just now added, otherwise GIGI will see a
+ -- reference to the variable (as actual to the IP call)
+ -- before its definition.
+
+ declare
+ Init_Call : constant Node_Id := Find_Init_Call (U_Ent, N);
+ begin
+ if Present (Init_Call) then
+ Remove (Init_Call);
+ Append_Freeze_Action (U_Ent, Init_Call);
+ end if;
+ end;
+
if Is_Exported (U_Ent) then
Error_Msg_N
("& cannot be exported if an address clause is given",
Nam);
end if;
- -- Entity has delayed freeze, so we will generate
- -- an alignment check at the freeze point.
+ -- Entity has delayed freeze, so we will generate an
+ -- alignment check at the freeze point unless suppressed.
- Set_Check_Address_Alignment
- (N, not Range_Checks_Suppressed (U_Ent));
+ if not Range_Checks_Suppressed (U_Ent)
+ and then not Alignment_Checks_Suppressed (U_Ent)
+ then
+ Set_Check_Address_Alignment (N);
+ end if;
-- Kill the size check code, since we are not allocating
-- the variable, it is somewhere else.
Kill_Size_Check_Code (U_Ent);
+
+ -- If the address clause is of the form:
+
+ -- for Y'Address use X'Address
+
+ -- or
+
+ -- Const : constant Address := X'Address;
+ -- ...
+ -- for Y'Address use Const;
+
+ -- then we make an entry in the table for checking the size
+ -- and alignment of the overlaying variable. We defer this
+ -- check till after code generation to take full advantage
+ -- of the annotation done by the back end. This entry is
+ -- only made if the address clause comes from source.
+
+ if Address_Clause_Overlay_Warnings
+ and then Comes_From_Source (N)
+ and then Present (O_Ent)
+ and then Is_Object (O_Ent)
+ then
+ Address_Clause_Checks.Append ((N, U_Ent, O_Ent, Off));
+
+ -- If variable overlays a constant view, and we are
+ -- warning on overlays, then mark the variable as
+ -- overlaying a constant (we will give warnings later
+ -- if this variable is assigned).
+
+ if Is_Constant_Object (O_Ent)
+ and then Ekind (U_Ent) = E_Variable
+ then
+ Set_Overlays_Constant (U_Ent);
+ end if;
+ end if;
end;
-- Not a valid entity for an address clause
-- Alignment attribute definition clause
- when Attribute_Alignment => Alignment_Block : declare
+ when Attribute_Alignment => Alignment : declare
Align : constant Uint := Get_Alignment_Value (Expr);
begin
elsif Align /= No_Uint then
Set_Has_Alignment_Clause (U_Ent);
Set_Alignment (U_Ent, Align);
+
+ -- For an array type, U_Ent is the first subtype. In that case,
+ -- also set the alignment of the anonymous base type so that
+ -- other subtypes (such as the itypes for aggregates of the
+ -- type) also receive the expected alignment.
+
+ if Is_Array_Type (U_Ent) then
+ Set_Alignment (Base_Type (U_Ent), Align);
+ end if;
end if;
- end Alignment_Block;
+ end Alignment;
---------------
-- Bit_Order --
if Has_Component_Size_Clause (Btype) then
Error_Msg_N
- ("component size clase for& previously given", Nam);
+ ("component size clause for& previously given", Nam);
elsif Csize /= No_Uint then
Check_Size (Expr, Component_Type (Btype), Csize, Biased);
-- that will be used to represent the biased subtype that
-- reflects the biased representation of components. We need
-- this subtype to get proper conversions on referencing
- -- elements of the array.
-
- if Biased then
- New_Ctyp :=
- Make_Defining_Identifier (Loc,
- Chars => New_External_Name (Chars (U_Ent), 'C', 0, 'T'));
-
- Decl :=
- Make_Subtype_Declaration (Loc,
- Defining_Identifier => New_Ctyp,
- Subtype_Indication =>
- New_Occurrence_Of (Component_Type (Btype), Loc));
-
- Set_Parent (Decl, N);
- Analyze (Decl, Suppress => All_Checks);
-
- Set_Has_Delayed_Freeze (New_Ctyp, False);
- Set_Esize (New_Ctyp, Csize);
- Set_RM_Size (New_Ctyp, Csize);
- Init_Alignment (New_Ctyp);
- Set_Has_Biased_Representation (New_Ctyp, True);
- Set_Is_Itype (New_Ctyp, True);
- Set_Associated_Node_For_Itype (New_Ctyp, U_Ent);
-
- Set_Component_Type (Btype, New_Ctyp);
+ -- elements of the array. Note that component size clauses
+ -- are ignored in VM mode.
+
+ if VM_Target = No_VM then
+ if Biased then
+ New_Ctyp :=
+ Make_Defining_Identifier (Loc,
+ Chars =>
+ New_External_Name (Chars (U_Ent), 'C', 0, 'T'));
+
+ Decl :=
+ Make_Subtype_Declaration (Loc,
+ Defining_Identifier => New_Ctyp,
+ Subtype_Indication =>
+ New_Occurrence_Of (Component_Type (Btype), Loc));
+
+ Set_Parent (Decl, N);
+ Analyze (Decl, Suppress => All_Checks);
+
+ Set_Has_Delayed_Freeze (New_Ctyp, False);
+ Set_Esize (New_Ctyp, Csize);
+ Set_RM_Size (New_Ctyp, Csize);
+ Init_Alignment (New_Ctyp);
+ Set_Has_Biased_Representation (New_Ctyp, True);
+ Set_Is_Itype (New_Ctyp, True);
+ Set_Associated_Node_For_Itype (New_Ctyp, U_Ent);
+
+ Set_Component_Type (Btype, New_Ctyp);
+
+ if Warn_On_Biased_Representation then
+ Error_Msg_N
+ ("?component size clause forces biased "
+ & "representation", N);
+ end if;
+ end if;
+
+ Set_Component_Size (Btype, Csize);
+
+ -- For VM case, we ignore component size clauses
+
+ else
+ -- Give a warning unless we are in GNAT mode, in which case
+ -- the warning is suppressed since it is not useful.
+
+ if not GNAT_Mode then
+ Error_Msg_N
+ ("?component size ignored in this configuration", N);
+ end if;
end if;
- Set_Component_Size (Btype, Csize);
Set_Has_Component_Size_Clause (Btype, True);
Set_Has_Non_Standard_Rep (Btype, True);
end if;
("static string required for tag name!", Nam);
end if;
- Set_Has_External_Tag_Rep_Clause (U_Ent);
+ if VM_Target = No_VM then
+ Set_Has_External_Tag_Rep_Clause (U_Ent);
+ else
+ Error_Msg_Name_1 := Attr;
+ Error_Msg_N
+ ("% attribute unsupported in this configuration", Nam);
+ end if;
+
+ if not Is_Library_Level_Entity (U_Ent) then
+ Error_Msg_NE
+ ("?non-unique external tag supplied for &", N, U_Ent);
+ Error_Msg_N
+ ("?\same external tag applies to all subprogram calls", N);
+ Error_Msg_N
+ ("?\corresponding internal tag cannot be obtained", N);
+ end if;
end External_Tag;
-----------
-- Object_Size attribute definition clause
when Attribute_Object_Size => Object_Size : declare
- Size : constant Uint := Static_Integer (Expr);
+ Size : constant Uint := Static_Integer (Expr);
+
Biased : Boolean;
+ pragma Warnings (Off, Biased);
begin
if not Is_Type (U_Ent) then
Etyp := Etype (U_Ent);
end if;
- -- Check size, note that Gigi is in charge of checking
- -- that the size of an array or record type is OK. Also
- -- we do not check the size in the ordinary fixed-point
- -- case, since it is too early to do so (there may be a
- -- subsequent small clause that affects the size). We can
- -- check the size if a small clause has already been given.
+ -- Check size, note that Gigi is in charge of checking that the
+ -- size of an array or record type is OK. Also we do not check
+ -- the size in the ordinary fixed-point case, since it is too
+ -- early to do so (there may be subsequent small clause that
+ -- affects the size). We can check the size if a small clause
+ -- has already been given.
if not Is_Ordinary_Fixed_Point_Type (U_Ent)
or else Has_Small_Clause (U_Ent)
then
Check_Size (Expr, Etyp, Size, Biased);
- Set_Has_Biased_Representation (U_Ent, Biased);
+ Set_Has_Biased_Representation (U_Ent, Biased);
+
+ if Biased and Warn_On_Biased_Representation then
+ Error_Msg_N
+ ("?size clause forces biased representation", N);
+ end if;
end if;
-- For types set RM_Size and Esize if possible
if Is_Type (U_Ent) then
Set_RM_Size (U_Ent, Size);
- -- For scalar types, increase Object_Size to power of 2,
- -- but not less than a storage unit in any case (i.e.,
- -- normally this means it will be byte addressable).
+ -- For scalar types, increase Object_Size to power of 2, but
+ -- not less than a storage unit in any case (i.e., normally
+ -- this means it will be byte addressable).
if Is_Scalar_Type (U_Ent) then
if Size <= System_Storage_Unit then
end Small;
------------------
- -- Storage_Size --
- ------------------
-
- -- Storage_Size attribute definition clause
-
- when Attribute_Storage_Size => Storage_Size : declare
- Btype : constant Entity_Id := Base_Type (U_Ent);
- Sprag : Node_Id;
-
- begin
- if Is_Task_Type (U_Ent) then
- Check_Restriction (No_Obsolescent_Features, N);
-
- if Warn_On_Obsolescent_Feature then
- Error_Msg_N
- ("storage size clause for task is an " &
- "obsolescent feature ('R'M 'J.9)?", N);
- Error_Msg_N
- ("\use Storage_Size pragma instead?", N);
- end if;
-
- FOnly := True;
- end if;
-
- if not Is_Access_Type (U_Ent)
- and then Ekind (U_Ent) /= E_Task_Type
- then
- Error_Msg_N ("storage size cannot be given for &", Nam);
-
- elsif Is_Access_Type (U_Ent) and Is_Derived_Type (U_Ent) then
- Error_Msg_N
- ("storage size cannot be given for a derived access type",
- Nam);
-
- elsif Has_Storage_Size_Clause (Btype) then
- Error_Msg_N ("storage size already given for &", Nam);
-
- else
- Analyze_And_Resolve (Expr, Any_Integer);
-
- if Is_Access_Type (U_Ent) then
-
- if Present (Associated_Storage_Pool (U_Ent)) then
- Error_Msg_N ("storage pool already given for &", Nam);
- return;
- end if;
-
- if Compile_Time_Known_Value (Expr)
- and then Expr_Value (Expr) = 0
- then
- Set_No_Pool_Assigned (Btype);
- end if;
-
- else -- Is_Task_Type (U_Ent)
- Sprag := Get_Rep_Pragma (Btype, Name_Storage_Size);
-
- if Present (Sprag) then
- Error_Msg_Sloc := Sloc (Sprag);
- Error_Msg_N
- ("Storage_Size already specified#", Nam);
- return;
- end if;
- end if;
-
- Set_Has_Storage_Size_Clause (Btype);
- end if;
- end Storage_Size;
-
- ------------------
-- Storage_Pool --
------------------
T : Entity_Id;
begin
- if Ekind (U_Ent) /= E_Access_Type
+ if Ekind (U_Ent) = E_Access_Subprogram_Type then
+ Error_Msg_N
+ ("storage pool cannot be given for access-to-subprogram type",
+ Nam);
+ return;
+
+ elsif Ekind (U_Ent) /= E_Access_Type
and then Ekind (U_Ent) /= E_General_Access_Type
then
- Error_Msg_N (
- "storage pool can only be given for access types", Nam);
+ Error_Msg_N
+ ("storage pool can only be given for access types", Nam);
return;
elsif Is_Derived_Type (U_Ent) then
Analyze_And_Resolve
(Expr, Class_Wide_Type (RTE (RE_Root_Storage_Pool)));
+ if not Denotes_Variable (Expr) then
+ Error_Msg_N ("storage pool must be a variable", Expr);
+ return;
+ end if;
+
if Nkind (Expr) = N_Type_Conversion then
T := Etype (Expression (Expr));
else
-- The Stack_Bounded_Pool is used internally for implementing
-- access types with a Storage_Size. Since it only work
-- properly when used on one specific type, we need to check
- -- that it is not highjacked improperly:
+ -- that it is not hijacked improperly:
-- type T is access Integer;
-- for T'Storage_Size use n;
-- type Q is access Float;
-- for Q'Storage_Size use T'Storage_Size; -- incorrect
- if Base_Type (T) = RTE (RE_Stack_Bounded_Pool) then
- Error_Msg_N ("non-sharable internal Pool", Expr);
+ if RTE_Available (RE_Stack_Bounded_Pool)
+ and then Base_Type (T) = RTE (RE_Stack_Bounded_Pool)
+ then
+ Error_Msg_N ("non-shareable internal Pool", Expr);
return;
end if;
end if;
end Storage_Pool;
+ ------------------
+ -- Storage_Size --
+ ------------------
+
+ -- Storage_Size attribute definition clause
+
+ when Attribute_Storage_Size => Storage_Size : declare
+ Btype : constant Entity_Id := Base_Type (U_Ent);
+ Sprag : Node_Id;
+
+ begin
+ if Is_Task_Type (U_Ent) then
+ Check_Restriction (No_Obsolescent_Features, N);
+
+ if Warn_On_Obsolescent_Feature then
+ Error_Msg_N
+ ("storage size clause for task is an " &
+ "obsolescent feature (RM J.9)?", N);
+ Error_Msg_N
+ ("\use Storage_Size pragma instead?", N);
+ end if;
+
+ FOnly := True;
+ end if;
+
+ if not Is_Access_Type (U_Ent)
+ and then Ekind (U_Ent) /= E_Task_Type
+ then
+ Error_Msg_N ("storage size cannot be given for &", Nam);
+
+ elsif Is_Access_Type (U_Ent) and Is_Derived_Type (U_Ent) then
+ Error_Msg_N
+ ("storage size cannot be given for a derived access type",
+ Nam);
+
+ elsif Has_Storage_Size_Clause (Btype) then
+ Error_Msg_N ("storage size already given for &", Nam);
+
+ else
+ Analyze_And_Resolve (Expr, Any_Integer);
+
+ if Is_Access_Type (U_Ent) then
+ if Present (Associated_Storage_Pool (U_Ent)) then
+ Error_Msg_N ("storage pool already given for &", Nam);
+ return;
+ end if;
+
+ if Compile_Time_Known_Value (Expr)
+ and then Expr_Value (Expr) = 0
+ then
+ Set_No_Pool_Assigned (Btype);
+ end if;
+
+ else -- Is_Task_Type (U_Ent)
+ Sprag := Get_Rep_Pragma (Btype, Name_Storage_Size);
+
+ if Present (Sprag) then
+ Error_Msg_Sloc := Sloc (Sprag);
+ Error_Msg_N
+ ("Storage_Size already specified#", Nam);
+ return;
+ end if;
+ end if;
+
+ Set_Has_Storage_Size_Clause (Btype);
+ end if;
+ end Storage_Size;
+
-----------------
-- Stream_Size --
-----------------
Size : constant Uint := Static_Integer (Expr);
begin
+ if Ada_Version <= Ada_95 then
+ Check_Restriction (No_Implementation_Attributes, N);
+ end if;
+
if Has_Stream_Size_Clause (U_Ent) then
Error_Msg_N ("Stream_Size already given for &", Nam);
then
Error_Msg_N ("Value_Size already given for &", Nam);
+ elsif Is_Array_Type (U_Ent)
+ and then not Is_Constrained (U_Ent)
+ then
+ Error_Msg_N
+ ("Value_Size cannot be given for unconstrained array", Nam);
+
else
if Is_Elementary_Type (U_Ent) then
Check_Size (Expr, U_Ent, Size, Biased);
Set_Has_Biased_Representation (U_Ent, Biased);
+
+ if Biased and Warn_On_Biased_Representation then
+ Error_Msg_N
+ ("?value size clause forces biased representation", N);
+ end if;
end if;
Set_RM_Size (U_Ent, Size);
return;
end if;
+ Check_Code_Statement (N);
+
-- Make sure we appear in the handled statement sequence of a
-- subprogram (RM 13.8(3)).
while Present (Decl) loop
DeclO := Original_Node (Decl);
if Comes_From_Source (DeclO)
- and then Nkind (DeclO) /= N_Pragma
- and then Nkind (DeclO) /= N_Use_Package_Clause
- and then Nkind (DeclO) /= N_Use_Type_Clause
- and then Nkind (DeclO) /= N_Implicit_Label_Declaration
+ and not Nkind_In (DeclO, N_Pragma,
+ N_Use_Package_Clause,
+ N_Use_Type_Clause,
+ N_Implicit_Label_Declaration)
then
Error_Msg_N
("this declaration not allowed in machine code subprogram",
while Present (Stmt) loop
StmtO := Original_Node (Stmt);
if Comes_From_Source (StmtO)
- and then Nkind (StmtO) /= N_Pragma
- and then Nkind (StmtO) /= N_Label
- and then Nkind (StmtO) /= N_Code_Statement
+ and then not Nkind_In (StmtO, N_Pragma,
+ N_Label,
+ N_Code_Statement)
then
Error_Msg_N
("this statement is not allowed in machine code subprogram",
Max : Uint;
begin
+ if Ignore_Rep_Clauses then
+ return;
+ end if;
+
-- First some basic error checks
Find_Type (Ident);
-- Don't allow rep clause for standard [wide_[wide_]]character
- elsif Root_Type (Enumtype) = Standard_Character
- or else Root_Type (Enumtype) = Standard_Wide_Character
- or else Root_Type (Enumtype) = Standard_Wide_Wide_Character
- then
+ elsif Is_Standard_Character_Type (Enumtype) then
Error_Msg_N ("enumeration rep clause not allowed for this type", N);
return;
Analyze (Expression (N));
end Analyze_Free_Statement;
+ ---------------------------
+ -- Analyze_Freeze_Entity --
+ ---------------------------
+
+ procedure Analyze_Freeze_Entity (N : Node_Id) is
+ E : constant Entity_Id := Entity (N);
+
+ begin
+ -- For tagged types covering interfaces add internal entities that link
+ -- the primitives of the interfaces with the primitives that cover them.
+
+ -- Note: These entities were originally generated only when generating
+ -- code because their main purpose was to provide support to initialize
+ -- the secondary dispatch tables. They are now generated also when
+ -- compiling with no code generation to provide ASIS the relationship
+ -- between interface primitives and tagged type primitives.
+
+ if Ada_Version >= Ada_05
+ and then Ekind (E) = E_Record_Type
+ and then Is_Tagged_Type (E)
+ and then not Is_Interface (E)
+ and then Has_Interfaces (E)
+ then
+ Add_Internal_Interface_Entities (E);
+ end if;
+ end Analyze_Freeze_Entity;
+
------------------------------------------
-- Analyze_Record_Representation_Clause --
------------------------------------------
Hbit : Uint := Uint_0;
Comp : Entity_Id;
Ocomp : Entity_Id;
+ Pcomp : Entity_Id;
Biased : Boolean;
Max_Bit_So_Far : Uint;
-- are monotonically increasing, then we can skip the circuit for
-- checking for overlap, since no overlap is possible.
+ Tagged_Parent : Entity_Id := Empty;
+ -- This is set in the case of a derived tagged type for which we have
+ -- Is_Fully_Repped_Tagged_Type True (indicating that all components are
+ -- positioned by record representation clauses). In this case we must
+ -- check for overlap between components of this tagged type, and the
+ -- components of its parent. Tagged_Parent will point to this parent
+ -- type. For all other cases Tagged_Parent is left set to Empty.
+
+ Parent_Last_Bit : Uint;
+ -- Relevant only if Tagged_Parent is set, Parent_Last_Bit indicates the
+ -- last bit position for any field in the parent type. We only need to
+ -- check overlap for fields starting below this point.
+
Overlap_Check_Required : Boolean;
-- Used to keep track of whether or not an overlap check is required
-- Points to N_Pragma node if Complete_Representation pragma present
begin
+ if Ignore_Rep_Clauses then
+ return;
+ end if;
+
Find_Type (Ident);
Rectype := Entity (Ident);
if Warn_On_Obsolescent_Feature then
Error_Msg_N
- ("mod clause is an obsolescent feature ('R'M 'J.8)?", N);
+ ("mod clause is an obsolescent feature (RM J.8)?", N);
Error_Msg_N
("\use alignment attribute definition clause instead?", N);
end if;
Analyze_List (P);
end if;
- -- In ASIS_Mode mode, expansion is disabled, but we must
- -- convert the Mod clause into an alignment clause anyway, so
- -- that the back-end can compute and back-annotate properly the
- -- size and alignment of types that may include this record.
+ -- In ASIS_Mode mode, expansion is disabled, but we must convert
+ -- the Mod clause into an alignment clause anyway, so that the
+ -- back-end can compute and back-annotate properly the size and
+ -- alignment of types that may include this record.
+
+ -- This seems dubious, this destroys the source tree in a manner
+ -- not detectable by ASIS ???
if Operating_Mode = Check_Semantics
and then ASIS_Mode
end;
end if;
- -- Clear any existing component clauses for the type (this happens
- -- with derived types, where we are now overriding the original)
-
- Fent := First_Entity (Rectype);
+ -- For untagged types, clear any existing component clauses for the
+ -- type. If the type is derived, this is what allows us to override
+ -- a rep clause for the parent. For type extensions, the representation
+ -- of the inherited components is inherited, so we want to keep previous
+ -- component clauses for completeness.
- Comp := Fent;
- while Present (Comp) loop
- if Ekind (Comp) = E_Component
- or else Ekind (Comp) = E_Discriminant
- then
+ if not Is_Tagged_Type (Rectype) then
+ Comp := First_Component_Or_Discriminant (Rectype);
+ while Present (Comp) loop
Set_Component_Clause (Comp, Empty);
- end if;
+ Next_Component_Or_Discriminant (Comp);
+ end loop;
+ end if;
- Next_Entity (Comp);
- end loop;
+ -- See if we have a fully repped derived tagged type
+
+ declare
+ PS : constant Entity_Id := Parent_Subtype (Rectype);
+
+ begin
+ if Present (PS) and then Is_Fully_Repped_Tagged_Type (PS) then
+ Tagged_Parent := PS;
+
+ -- Find maximum bit of any component of the parent type
+
+ Parent_Last_Bit := UI_From_Int (System_Address_Size - 1);
+ Pcomp := First_Entity (Tagged_Parent);
+ while Present (Pcomp) loop
+ if Ekind (Pcomp) = E_Discriminant
+ or else
+ Ekind (Pcomp) = E_Component
+ then
+ if Component_Bit_Offset (Pcomp) /= No_Uint
+ and then Known_Static_Esize (Pcomp)
+ then
+ Parent_Last_Bit :=
+ UI_Max
+ (Parent_Last_Bit,
+ Component_Bit_Offset (Pcomp) + Esize (Pcomp) - 1);
+ end if;
+
+ Next_Entity (Pcomp);
+ end if;
+ end loop;
+ end if;
+ end;
-- All done if no component clauses
return;
end if;
- -- If a tag is present, then create a component clause that places
- -- it at the start of the record (otherwise gigi may place it after
- -- other fields that have rep clauses).
+ -- If a tag is present, then create a component clause that places it
+ -- at the start of the record (otherwise gigi may place it after other
+ -- fields that have rep clauses).
+
+ Fent := First_Entity (Rectype);
if Nkind (Fent) = N_Defining_Identifier
and then Chars (Fent) = Name_uTag
Set_Normalized_Position_Max (Fent, Uint_0);
Init_Esize (Fent, System_Address_Size);
- Set_Component_Clause (Fent,
+ Set_Component_Clause (Fent,
Make_Component_Clause (Loc,
Component_Name =>
Make_Identifier (Loc,
-- The only pragma of interest is Complete_Representation
- if Chars (CC) = Name_Complete_Representation then
+ if Pragma_Name (CC) = Name_Complete_Representation then
CR_Pragma := CC;
end if;
Error_Msg_N
("first bit cannot be negative", First_Bit (CC));
+ -- The Last_Bit specified in a component clause must not be
+ -- less than the First_Bit minus one (RM-13.5.1(10)).
+
+ elsif Lbit < Fbit - 1 then
+ Error_Msg_N
+ ("last bit cannot be less than first bit minus one",
+ Last_Bit (CC));
+
-- Values look OK, so find the corresponding record component
-- Even though the syntax allows an attribute reference for
-- implementation-defined components, GNAT does not allow the
("component clause is for non-existent field", CC);
elsif Present (Component_Clause (Comp)) then
- Error_Msg_Sloc := Sloc (Component_Clause (Comp));
- Error_Msg_N
- ("component clause previously given#", CC);
+
+ -- Diagnose duplicate rep clause, or check consistency
+ -- if this is an inherited component. In a double fault,
+ -- there may be a duplicate inconsistent clause for an
+ -- inherited component.
+
+ if Scope (Original_Record_Component (Comp)) = Rectype
+ or else Parent (Component_Clause (Comp)) = N
+ then
+ Error_Msg_Sloc := Sloc (Component_Clause (Comp));
+ Error_Msg_N ("component clause previously given#", CC);
+
+ else
+ declare
+ Rep1 : constant Node_Id := Component_Clause (Comp);
+ begin
+ if Intval (Position (Rep1)) /=
+ Intval (Position (CC))
+ or else Intval (First_Bit (Rep1)) /=
+ Intval (First_Bit (CC))
+ or else Intval (Last_Bit (Rep1)) /=
+ Intval (Last_Bit (CC))
+ then
+ Error_Msg_N ("component clause inconsistent "
+ & "with representation of ancestor", CC);
+ elsif Warn_On_Redundant_Constructs then
+ Error_Msg_N ("?redundant component clause "
+ & "for inherited component!", CC);
+ end if;
+ end;
+ end if;
+
+ -- Normal case where this is the first component clause we
+ -- have seen for this entity, so set it up properly.
else
+ -- Make reference for field in record rep clause and set
+ -- appropriate entity field in the field identifier.
+
+ Generate_Reference
+ (Comp, Component_Name (CC), Set_Ref => False);
+ Set_Entity (Component_Name (CC), Comp);
+
-- Update Fbit and Lbit to the actual bit number
Fbit := Fbit + UI_From_Int (SSU) * Posit;
then
Error_Msg_NE
("component overlaps tag field of&",
- CC, Rectype);
+ Component_Name (CC), Rectype);
end if;
-- This information is also set in the corresponding
Set_Has_Biased_Representation (Comp, Biased);
+ if Biased and Warn_On_Biased_Representation then
+ Error_Msg_F
+ ("?component clause forces biased "
+ & "representation", CC);
+ end if;
+
if Present (Ocomp) then
Set_Component_Clause (Ocomp, CC);
Set_Component_Bit_Offset (Ocomp, Fbit);
Error_Msg_N ("component size is negative", CC);
end if;
end if;
+
+ -- If OK component size, check parent type overlap if
+ -- this component might overlap a parent field.
+
+ if Present (Tagged_Parent)
+ and then Fbit <= Parent_Last_Bit
+ then
+ Pcomp := First_Entity (Tagged_Parent);
+ while Present (Pcomp) loop
+ if (Ekind (Pcomp) = E_Discriminant
+ or else
+ Ekind (Pcomp) = E_Component)
+ and then not Is_Tag (Pcomp)
+ and then Chars (Pcomp) /= Name_uParent
+ then
+ Check_Component_Overlap (Comp, Pcomp);
+ end if;
+
+ Next_Entity (Pcomp);
+ end loop;
+ end if;
end if;
end if;
end if;
end loop;
-- Now that we have processed all the component clauses, check for
- -- overlap. We have to leave this till last, since the components
- -- can appear in any arbitrary order in the representation clause.
+ -- overlap. We have to leave this till last, since the components can
+ -- appear in any arbitrary order in the representation clause.
-- We do not need this check if all specified ranges were monotonic,
-- as recorded by Overlap_Check_Required being False at this stage.
- -- This first section checks if there are any overlapping entries
- -- at all. It does this by sorting all entries and then seeing if
- -- there are any overlaps. If there are none, then that is decisive,
- -- but if there are overlaps, they may still be OK (they may result
- -- from fields in different variants).
+ -- This first section checks if there are any overlapping entries at
+ -- all. It does this by sorting all entries and then seeing if there are
+ -- any overlaps. If there are none, then that is decisive, but if there
+ -- are overlaps, they may still be OK (they may result from fields in
+ -- different variants).
if Overlap_Check_Required then
Overlap_Check1 : declare
OC_Fbit : array (0 .. Ccount) of Uint;
- -- First-bit values for component clauses, the value is the
- -- offset of the first bit of the field from start of record.
- -- The zero entry is for use in sorting.
+ -- First-bit values for component clauses, the value is the offset
+ -- of the first bit of the field from start of record. The zero
+ -- entry is for use in sorting.
OC_Lbit : array (0 .. Ccount) of Uint;
- -- Last-bit values for component clauses, the value is the
- -- offset of the last bit of the field from start of record.
- -- The zero entry is for use in sorting.
+ -- Last-bit values for component clauses, the value is the offset
+ -- of the last bit of the field from start of record. The zero
+ -- entry is for use in sorting.
OC_Count : Natural := 0;
-- Count of entries in OC_Fbit and OC_Lbit
function OC_Lt (Op1, Op2 : Natural) return Boolean;
- -- Compare routine for Sort (See GNAT.Heap_Sort_A)
+ -- Compare routine for Sort
procedure OC_Move (From : Natural; To : Natural);
- -- Move routine for Sort (see GNAT.Heap_Sort_A)
+ -- Move routine for Sort
+
+ package Sorting is new GNAT.Heap_Sort_G (OC_Move, OC_Lt);
+
+ -----------
+ -- OC_Lt --
+ -----------
function OC_Lt (Op1, Op2 : Natural) return Boolean is
begin
return OC_Fbit (Op1) < OC_Fbit (Op2);
end OC_Lt;
+ -------------
+ -- OC_Move --
+ -------------
+
procedure OC_Move (From : Natural; To : Natural) is
begin
OC_Fbit (To) := OC_Fbit (From);
OC_Lbit (To) := OC_Lbit (From);
end OC_Move;
+ -- Start of processing for Overlap_Check
+
begin
CC := First (Component_Clauses (N));
while Present (CC) loop
Next (CC);
end loop;
- Sort
- (OC_Count,
- OC_Move'Unrestricted_Access,
- OC_Lt'Unrestricted_Access);
+ Sorting.Sort (OC_Count);
Overlap_Check_Required := False;
for J in 1 .. OC_Count - 1 loop
end Overlap_Check1;
end if;
- -- If Overlap_Check_Required is still True, then we have to do
- -- the full scale overlap check, since we have at least two fields
- -- that do overlap, and we need to know if that is OK since they
- -- are in the same variant, or whether we have a definite problem
+ -- If Overlap_Check_Required is still True, then we have to do the full
+ -- scale overlap check, since we have at least two fields that do
+ -- overlap, and we need to know if that is OK since they are in
+ -- different variant, or whether we have a definite problem.
if Overlap_Check_Required then
Overlap_Check2 : declare
-- Loop through all components in record. For each component check
-- for overlap with any of the preceding elements on the component
- -- list containing the component, and also, if the component is in
+ -- list containing the component and also, if the component is in
-- a variant, check against components outside the case structure.
-- This latter test is repeated recursively up the variant tree.
Component_List_Loop : loop
-- If derived type definition, go to full declaration
- -- If at outer level, check discriminants if there are any
+ -- If at outer level, check discriminants if there are any.
if Nkind (Clist) = N_Derived_Type_Definition then
Clist := Parent (Clist);
-- Outer level of record definition, check discriminants
- if Nkind (Clist) = N_Full_Type_Declaration
- or else Nkind (Clist) = N_Private_Type_Declaration
+ if Nkind_In (Clist, N_Full_Type_Declaration,
+ N_Private_Type_Declaration)
then
if Has_Discriminants (Defining_Identifier (Clist)) then
C2_Ent :=
First_Discriminant (Defining_Identifier (Clist));
-
while Present (C2_Ent) loop
exit when C1_Ent = C2_Ent;
Check_Component_Overlap (C1_Ent, C2_Ent);
-- be a variant, in which case its parent is a variant part,
-- and the parent of the variant part is a component list
-- whose components must all be checked against the current
- -- component for overlap.
+ -- component for overlap).
if Nkind (Parent (Clist)) = N_Variant then
Clist := Parent (Parent (Parent (Clist)));
-- Check for possible discriminant part in record, this is
-- treated essentially as another level in the recursion.
- -- For this case we have the parent of the component list
- -- is the record definition, and its parent is the full
- -- type declaration which contains the discriminant
- -- specifications.
+ -- For this case the parent of the component list is the
+ -- record definition, and its parent is the full type
+ -- declaration containing the discriminant specifications.
elsif Nkind (Parent (Clist)) = N_Record_Definition then
Clist := Parent (Parent ((Clist)));
-- If neither of these two cases, we are at the top of
- -- the tree
+ -- the tree.
else
exit Component_List_Loop;
end Overlap_Check2;
end if;
- -- For records that have component clauses for all components, and
- -- whose size is less than or equal to 32, we need to know the size
- -- in the front end to activate possible packed array processing
- -- where the component type is a record.
+ -- For records that have component clauses for all components, and whose
+ -- size is less than or equal to 32, we need to know the size in the
+ -- front end to activate possible packed array processing where the
+ -- component type is a record.
- -- At this stage Hbit + 1 represents the first unused bit from all
- -- the component clauses processed, so if the component clauses are
+ -- At this stage Hbit + 1 represents the first unused bit from all the
+ -- component clauses processed, so if the component clauses are
-- complete, then this is the length of the record.
- -- For records longer than System.Storage_Unit, and for those where
- -- not all components have component clauses, the back end determines
- -- the length (it may for example be appopriate to round up the size
- -- to some convenient boundary, based on alignment considerations etc).
+ -- For records longer than System.Storage_Unit, and for those where not
+ -- all components have component clauses, the back end determines the
+ -- length (it may for example be appropriate to round up the size
+ -- to some convenient boundary, based on alignment considerations, etc).
- if Unknown_RM_Size (Rectype)
- and then Hbit + 1 <= 32
- then
- -- Nothing to do if at least one component with no component clause
+ if Unknown_RM_Size (Rectype) and then Hbit + 1 <= 32 then
- Comp := First_Entity (Rectype);
- while Present (Comp) loop
- if Ekind (Comp) = E_Component
- or else Ekind (Comp) = E_Discriminant
- then
- exit when No (Component_Clause (Comp));
- end if;
+ -- Nothing to do if at least one component has no component clause
- Next_Entity (Comp);
+ Comp := First_Component_Or_Discriminant (Rectype);
+ while Present (Comp) loop
+ exit when No (Component_Clause (Comp));
+ Next_Component_Or_Discriminant (Comp);
end loop;
-- If we fall out of loop, all components have component clauses
-- Check missing components if Complete_Representation pragma appeared
if Present (CR_Pragma) then
- Comp := First_Entity (Rectype);
+ Comp := First_Component_Or_Discriminant (Rectype);
while Present (Comp) loop
- if Ekind (Comp) = E_Component
- or else
- Ekind (Comp) = E_Discriminant
- then
- if No (Component_Clause (Comp)) then
- Error_Msg_NE
- ("missing component clause for &", CR_Pragma, Comp);
- end if;
+ if No (Component_Clause (Comp)) then
+ Error_Msg_NE
+ ("missing component clause for &", CR_Pragma, Comp);
end if;
- Next_Entity (Comp);
+ Next_Component_Or_Discriminant (Comp);
end loop;
+
+ -- If no Complete_Representation pragma, warn if missing components
+
+ elsif Warn_On_Unrepped_Components then
+ declare
+ Num_Repped_Components : Nat := 0;
+ Num_Unrepped_Components : Nat := 0;
+
+ begin
+ -- First count number of repped and unrepped components
+
+ Comp := First_Component_Or_Discriminant (Rectype);
+ while Present (Comp) loop
+ if Present (Component_Clause (Comp)) then
+ Num_Repped_Components := Num_Repped_Components + 1;
+ else
+ Num_Unrepped_Components := Num_Unrepped_Components + 1;
+ end if;
+
+ Next_Component_Or_Discriminant (Comp);
+ end loop;
+
+ -- We are only interested in the case where there is at least one
+ -- unrepped component, and at least half the components have rep
+ -- clauses. We figure that if less than half have them, then the
+ -- partial rep clause is really intentional. If the component
+ -- type has no underlying type set at this point (as for a generic
+ -- formal type), we don't know enough to give a warning on the
+ -- component.
+
+ if Num_Unrepped_Components > 0
+ and then Num_Unrepped_Components < Num_Repped_Components
+ then
+ Comp := First_Component_Or_Discriminant (Rectype);
+ while Present (Comp) loop
+ if No (Component_Clause (Comp))
+ and then Comes_From_Source (Comp)
+ and then Present (Underlying_Type (Etype (Comp)))
+ and then (Is_Scalar_Type (Underlying_Type (Etype (Comp)))
+ or else Size_Known_At_Compile_Time
+ (Underlying_Type (Etype (Comp))))
+ and then not Has_Warnings_Off (Rectype)
+ then
+ Error_Msg_Sloc := Sloc (Comp);
+ Error_Msg_NE
+ ("?no component clause given for & declared #",
+ N, Comp);
+ end if;
+
+ Next_Component_Or_Discriminant (Comp);
+ end loop;
+ end if;
+ end;
end if;
end Analyze_Record_Representation_Clause;
if Present (Component_Clause (C1_Ent))
and then Present (Component_Clause (C2_Ent))
then
- -- Exclude odd case where we have two tag fields in the same
- -- record, both at location zero. This seems a bit strange,
- -- but it seems to happen in some circumstances ???
+ -- Exclude odd case where we have two tag fields in the same record,
+ -- both at location zero. This seems a bit strange, but it seems to
+ -- happen in some circumstances ???
if Chars (C1_Ent) = Name_uTag
and then Chars (C2_Ent) = Name_uTag
U_Ent : Entity_Id)
is
procedure Check_At_Constant_Address (Nod : Node_Id);
- -- Checks that the given node N represents a name whose 'Address
- -- is constant (in the same sense as OK_Constant_Address_Clause,
- -- i.e. the address value is the same at the point of declaration
- -- of U_Ent and at the time of elaboration of the address clause.
+ -- Checks that the given node N represents a name whose 'Address is
+ -- constant (in the same sense as OK_Constant_Address_Clause, i.e. the
+ -- address value is the same at the point of declaration of U_Ent and at
+ -- the time of elaboration of the address clause.
procedure Check_Expr_Constants (Nod : Node_Id);
- -- Checks that Nod meets the requirements for a constant address
- -- clause in the sense of the enclosing procedure.
+ -- Checks that Nod meets the requirements for a constant address clause
+ -- in the sense of the enclosing procedure.
procedure Check_List_Constants (Lst : List_Id);
-- Check that all elements of list Lst meet the requirements for a
Nod, U_Ent);
Error_Msg_NE
("address for& cannot" &
- " depend on another address clause! ('R'M 13.1(22))!",
+ " depend on another address clause! (RM 13.1(22))!",
Nod, U_Ent);
elsif In_Same_Source_Unit (Entity (Nod), U_Ent)
Error_Msg_NE
("invalid address clause for initialized object &!",
Nod, U_Ent);
- Error_Msg_Name_1 := Chars (Entity (Nod));
- Error_Msg_Name_2 := Chars (U_Ent);
- Error_Msg_N
- ("\% must be defined before % ('R'M 13.1(22))!",
- Nod);
+ Error_Msg_Node_2 := U_Ent;
+ Error_Msg_NE
+ ("\& must be defined before & (RM 13.1(22))!",
+ Nod, Entity (Nod));
end if;
elsif Nkind (Nod) = N_Selected_Component then
Nod, U_Ent);
Error_Msg_N
("\address cannot depend on component" &
- " of discriminated record ('R'M 13.1(22))!",
+ " of discriminated record (RM 13.1(22))!",
Nod);
else
Check_At_Constant_Address (Prefix (Nod));
-- If the node is an object declaration without initial
-- value, some code has been expanded, and the expression
-- is not constant, even if the constituents might be
- -- acceptable, as in A'Address + offset.
+ -- acceptable, as in A'Address + offset.
if Ekind (Ent) = E_Variable
- and then Nkind (Declaration_Node (Ent))
- = N_Object_Declaration
+ and then
+ Nkind (Declaration_Node (Ent)) = N_Object_Declaration
and then
No (Expression (Declaration_Node (Ent)))
then
or else
Ekind (Ent) = E_In_Parameter
then
- -- This is the case where we must have Ent defined
- -- before U_Ent. Clearly if they are in different
- -- units this requirement is met since the unit
- -- containing Ent is already processed.
+ -- This is the case where we must have Ent defined before
+ -- U_Ent. Clearly if they are in different units this
+ -- requirement is met since the unit containing Ent is
+ -- already processed.
if not In_Same_Source_Unit (Ent, U_Ent) then
return;
- -- Otherwise location of Ent must be before the
- -- location of U_Ent, that's what prior defined means.
+ -- Otherwise location of Ent must be before the location
+ -- of U_Ent, that's what prior defined means.
elsif Sloc (Ent) < Loc_U_Ent then
return;
Error_Msg_NE
("invalid address clause for initialized object &!",
Nod, U_Ent);
- Error_Msg_Name_1 := Chars (Ent);
- Error_Msg_Name_2 := Chars (U_Ent);
- Error_Msg_N
- ("\% must be defined before % ('R'M 13.1(22))!",
- Nod);
+ Error_Msg_Node_2 := U_Ent;
+ Error_Msg_NE
+ ("\& must be defined before & (RM 13.1(22))!",
+ Nod, Ent);
end if;
elsif Nkind (Original_Node (Nod)) = N_Function_Call then
Nod, U_Ent);
if Comes_From_Source (Ent) then
- Error_Msg_Name_1 := Chars (Ent);
- Error_Msg_N
- ("\reference to variable% not allowed"
- & " ('R'M 13.1(22))!", Nod);
+ Error_Msg_NE
+ ("\reference to variable& not allowed"
+ & " (RM 13.1(22))!", Nod, Ent);
else
Error_Msg_N
("non-static expression not allowed"
- & " ('R'M 13.1(22))!", Nod);
+ & " (RM 13.1(22))!", Nod);
end if;
end if;
when N_Null =>
return;
- when N_Binary_Op | N_And_Then | N_Or_Else | N_In | N_Not_In =>
+ when N_Binary_Op | N_Short_Circuit | N_Membership_Test =>
Check_Expr_Constants (Left_Opnd (Nod));
Check_Expr_Constants (Right_Opnd (Nod));
when N_Unchecked_Type_Conversion =>
Check_Expr_Constants (Expression (Nod));
- -- If this is a rewritten unchecked conversion, subtypes
- -- in this node are those created within the instance.
- -- To avoid order of elaboration issues, replace them
- -- with their base types. Note that address clauses can
- -- cause order of elaboration problems because they are
- -- elaborated by the back-end at the point of definition,
- -- and may mention entities declared in between (as long
- -- as everything is static). It is user-friendly to allow
- -- unchecked conversions in this context.
+ -- If this is a rewritten unchecked conversion, subtypes in
+ -- this node are those created within the instance. To avoid
+ -- order of elaboration issues, replace them with their base
+ -- types. Note that address clauses can cause order of
+ -- elaboration problems because they are elaborated by the
+ -- back-end at the point of definition, and may mention
+ -- entities declared in between (as long as everything is
+ -- static). It is user-friendly to allow unchecked conversions
+ -- in this context.
if Nkind (Original_Node (Nod)) = N_Function_Call then
Set_Etype (Expression (Nod),
Nod, U_Ent);
Error_Msg_NE
- ("\function & is not pure ('R'M 13.1(22))!",
+ ("\function & is not pure (RM 13.1(22))!",
Nod, Entity (Name (Nod)));
else
("invalid address clause for initialized object &!",
Nod, U_Ent);
Error_Msg_NE
- ("\must be constant defined before& ('R'M 13.1(22))!",
+ ("\must be constant defined before& (RM 13.1(22))!",
Nod, U_Ent);
end case;
end Check_Expr_Constants;
if Siz < M then
-- Size is less than minimum size, but one possibility remains
- -- that we can manage with the new size if we bias the type
+ -- that we can manage with the new size if we bias the type.
M := UI_From_Int (Minimum_Size (UT, Biased => True));
else
declare
Id : constant Attribute_Id := Get_Attribute_Id (Chars (N));
-
begin
- return Id = Attribute_Input
+ return Id = Attribute_Input
or else Id = Attribute_Output
or else Id = Attribute_Read
or else Id = Attribute_Write
end if;
end Is_Operational_Item;
- --------------------------------------
- -- Mark_Aliased_Address_As_Volatile --
- --------------------------------------
-
- procedure Mark_Aliased_Address_As_Volatile (N : Node_Id) is
- Ent : constant Entity_Id := Address_Aliased_Entity (N);
-
- begin
- if Present (Ent) then
- Set_Treat_As_Volatile (Ent);
- end if;
- end Mark_Aliased_Address_As_Volatile;
-
------------------
-- Minimum_Size --
------------------
-- we have short and long addresses, and it is possible for an access
-- type to have a short address size (and thus be less than the size
-- of System.Address itself). We simply skip the check for VMS, and
- -- leave the back end to do the check.
+ -- leave it to the back end to do the check.
elsif Is_Access_Type (T) then
if OpenVMS_On_Target then
elsif Is_Discrete_Type (T) then
- -- The following loop is looking for the nearest compile time
- -- known bounds following the ancestor subtype chain. The idea
- -- is to find the most restrictive known bounds information.
+ -- The following loop is looking for the nearest compile time known
+ -- bounds following the ancestor subtype chain. The idea is to find
+ -- the most restrictive known bounds information.
Ancest := T;
loop
end loop;
-- Fixed-point types. We can't simply use Expr_Value to get the
- -- Corresponding_Integer_Value values of the bounds, since these
- -- do not get set till the type is frozen, and this routine can
- -- be called before the type is frozen. Similarly the test for
- -- bounds being static needs to include the case where we have
- -- unanalyzed real literals for the same reason.
+ -- Corresponding_Integer_Value values of the bounds, since these do not
+ -- get set till the type is frozen, and this routine can be called
+ -- before the type is frozen. Similarly the test for bounds being static
+ -- needs to include the case where we have unanalyzed real literals for
+ -- the same reason.
elsif Is_Fixed_Point_Type (T) then
- -- The following loop is looking for the nearest compile time
- -- known bounds following the ancestor subtype chain. The idea
- -- is to find the most restrictive known bounds information.
+ -- The following loop is looking for the nearest compile time known
+ -- bounds following the ancestor subtype chain. The idea is to find
+ -- the most restrictive known bounds information.
Ancest := T;
loop
return 0;
end if;
+ -- Note: In the following two tests for LoSet and HiSet, it may
+ -- seem redundant to test for N_Real_Literal here since normally
+ -- one would assume that the test for the value being known at
+ -- compile time includes this case. However, there is a glitch.
+ -- If the real literal comes from folding a non-static expression,
+ -- then we don't consider any non- static expression to be known
+ -- at compile time if we are in configurable run time mode (needed
+ -- in some cases to give a clearer definition of what is and what
+ -- is not accepted). So the test is indeed needed. Without it, we
+ -- would set neither Lo_Set nor Hi_Set and get an infinite loop.
+
if not LoSet then
if Nkind (Type_Low_Bound (Ancest)) = N_Real_Literal
or else Compile_Time_Known_Value (Type_Low_Bound (Ancest))
-- Fall through with Hi and Lo set. Deal with biased case
- if (Biased and then not Is_Fixed_Point_Type (T))
+ if (Biased
+ and then not Is_Fixed_Point_Type (T)
+ and then not (Is_Enumeration_Type (T)
+ and then Has_Non_Standard_Rep (T)))
or else Has_Biased_Representation (T)
then
Hi := Hi - Lo;
end if;
-- Signed case. Note that we consider types like range 1 .. -1 to be
- -- signed for the purpose of computing the size, since the bounds
- -- have to be accomodated in the base type.
+ -- signed for the purpose of computing the size, since the bounds have
+ -- to be accommodated in the base type.
if Lo < 0 or else Hi < 0 then
S := 1;
return S;
end Minimum_Size;
- -------------------------
- -- New_Stream_Function --
- -------------------------
+ ---------------------------
+ -- New_Stream_Subprogram --
+ ---------------------------
- procedure New_Stream_Function
- (N : Node_Id;
- Ent : Entity_Id;
- Subp : Entity_Id;
- Nam : TSS_Name_Type)
+ procedure New_Stream_Subprogram
+ (N : Node_Id;
+ Ent : Entity_Id;
+ Subp : Entity_Id;
+ Nam : TSS_Name_Type)
is
Loc : constant Source_Ptr := Sloc (N);
Sname : constant Name_Id := Make_TSS_Name (Base_Type (Ent), Nam);
F : Entity_Id;
Etyp : Entity_Id;
+ Defer_Declaration : constant Boolean :=
+ Is_Tagged_Type (Ent) or else Is_Private_Type (Ent);
+ -- For a tagged type, there is a declaration for each stream attribute
+ -- at the freeze point, and we must generate only a completion of this
+ -- declaration. We do the same for private types, because the full view
+ -- might be tagged. Otherwise we generate a declaration at the point of
+ -- the attribute definition clause.
+
function Build_Spec return Node_Id;
-- Used for declaration and renaming declaration, so that this is
-- treated as a renaming_as_body.
----------------
function Build_Spec return Node_Id is
+ Out_P : constant Boolean := (Nam = TSS_Stream_Read);
+ Formals : List_Id;
+ Spec : Node_Id;
+ T_Ref : constant Node_Id := New_Reference_To (Etyp, Loc);
+
begin
Subp_Id := Make_Defining_Identifier (Loc, Sname);
- return
- Make_Function_Specification (Loc,
- Defining_Unit_Name => Subp_Id,
- Parameter_Specifications =>
- New_List (
- Make_Parameter_Specification (Loc,
- Defining_Identifier =>
- Make_Defining_Identifier (Loc, Name_S),
- Parameter_Type =>
- Make_Access_Definition (Loc,
- Subtype_Mark =>
- New_Reference_To (
- Designated_Type (Etype (F)), Loc)))),
-
- Result_Definition =>
- New_Reference_To (Etyp, Loc));
- end Build_Spec;
+ -- S : access Root_Stream_Type'Class
+
+ Formals := New_List (
+ Make_Parameter_Specification (Loc,
+ Defining_Identifier =>
+ Make_Defining_Identifier (Loc, Name_S),
+ Parameter_Type =>
+ Make_Access_Definition (Loc,
+ Subtype_Mark =>
+ New_Reference_To (
+ Designated_Type (Etype (F)), Loc))));
+
+ if Nam = TSS_Stream_Input then
+ Spec := Make_Function_Specification (Loc,
+ Defining_Unit_Name => Subp_Id,
+ Parameter_Specifications => Formals,
+ Result_Definition => T_Ref);
+ else
+ -- V : [out] T
- -- Start of processing for New_Stream_Function
+ Append_To (Formals,
+ Make_Parameter_Specification (Loc,
+ Defining_Identifier => Make_Defining_Identifier (Loc, Name_V),
+ Out_Present => Out_P,
+ Parameter_Type => T_Ref));
- begin
- F := First_Formal (Subp);
- Etyp := Etype (Subp);
+ Spec := Make_Procedure_Specification (Loc,
+ Defining_Unit_Name => Subp_Id,
+ Parameter_Specifications => Formals);
+ end if;
- if not Is_Tagged_Type (Ent) then
- Subp_Decl :=
- Make_Subprogram_Declaration (Loc,
- Specification => Build_Spec);
- Insert_Action (N, Subp_Decl);
- end if;
+ return Spec;
+ end Build_Spec;
- Subp_Decl :=
- Make_Subprogram_Renaming_Declaration (Loc,
- Specification => Build_Spec,
- Name => New_Reference_To (Subp, Loc));
+ -- Start of processing for New_Stream_Subprogram
- if Is_Tagged_Type (Ent) then
- Set_TSS (Base_Type (Ent), Subp_Id);
+ begin
+ F := First_Formal (Subp);
+
+ if Ekind (Subp) = E_Procedure then
+ Etyp := Etype (Next_Formal (F));
else
- Insert_Action (N, Subp_Decl);
- Copy_TSS (Subp_Id, Base_Type (Ent));
+ Etyp := Etype (Subp);
end if;
- end New_Stream_Function;
-
- --------------------------
- -- New_Stream_Procedure --
- --------------------------
-
- procedure New_Stream_Procedure
- (N : Node_Id;
- Ent : Entity_Id;
- Subp : Entity_Id;
- Nam : TSS_Name_Type;
- Out_P : Boolean := False)
- is
- Loc : constant Source_Ptr := Sloc (N);
- Sname : constant Name_Id := Make_TSS_Name (Base_Type (Ent), Nam);
- Subp_Id : Entity_Id;
- Subp_Decl : Node_Id;
- F : Entity_Id;
- Etyp : Entity_Id;
-
- function Build_Spec return Node_Id;
- -- Used for declaration and renaming declaration, so that this is
- -- treated as a renaming_as_body.
-
- ----------------
- -- Build_Spec --
- ----------------
-
- function Build_Spec return Node_Id is
- begin
- Subp_Id := Make_Defining_Identifier (Loc, Sname);
-
- return
- Make_Procedure_Specification (Loc,
- Defining_Unit_Name => Subp_Id,
- Parameter_Specifications =>
- New_List (
- Make_Parameter_Specification (Loc,
- Defining_Identifier =>
- Make_Defining_Identifier (Loc, Name_S),
- Parameter_Type =>
- Make_Access_Definition (Loc,
- Subtype_Mark =>
- New_Reference_To (
- Designated_Type (Etype (F)), Loc))),
-
- Make_Parameter_Specification (Loc,
- Defining_Identifier =>
- Make_Defining_Identifier (Loc, Name_V),
- Out_Present => Out_P,
- Parameter_Type =>
- New_Reference_To (Etyp, Loc))));
- end Build_Spec;
-
- -- Start of processing for New_Stream_Procedure
- begin
- F := First_Formal (Subp);
- Etyp := Etype (Next_Formal (F));
+ -- Prepare subprogram declaration and insert it as an action on the
+ -- clause node. The visibility for this entity is used to test for
+ -- visibility of the attribute definition clause (in the sense of
+ -- 8.3(23) as amended by AI-195).
- if not Is_Tagged_Type (Ent) then
+ if not Defer_Declaration then
Subp_Decl :=
Make_Subprogram_Declaration (Loc,
Specification => Build_Spec);
- Insert_Action (N, Subp_Decl);
+
+ -- For a tagged type, there is always a visible declaration for each
+ -- stream TSS (it is a predefined primitive operation), and the
+ -- completion of this declaration occurs at the freeze point, which is
+ -- not always visible at places where the attribute definition clause is
+ -- visible. So, we create a dummy entity here for the purpose of
+ -- tracking the visibility of the attribute definition clause itself.
+
+ else
+ Subp_Id :=
+ Make_Defining_Identifier (Loc,
+ Chars => New_External_Name (Sname, 'V'));
+ Subp_Decl :=
+ Make_Object_Declaration (Loc,
+ Defining_Identifier => Subp_Id,
+ Object_Definition => New_Occurrence_Of (Standard_Boolean, Loc));
end if;
+ Insert_Action (N, Subp_Decl);
+ Set_Entity (N, Subp_Id);
+
Subp_Decl :=
Make_Subprogram_Renaming_Declaration (Loc,
Specification => Build_Spec,
Name => New_Reference_To (Subp, Loc));
- if Is_Tagged_Type (Ent) then
+ if Defer_Declaration then
Set_TSS (Base_Type (Ent), Subp_Id);
else
Insert_Action (N, Subp_Decl);
Copy_TSS (Subp_Id, Base_Type (Ent));
end if;
- end New_Stream_Procedure;
+ end New_Stream_Subprogram;
------------------------
-- Rep_Item_Too_Early --
function Rep_Item_Too_Early (T : Entity_Id; N : Node_Id) return Boolean is
begin
- -- Cannot apply rep items that are not operational items
- -- to generic types
+ -- Cannot apply non-operational rep items to generic types
if Is_Operational_Item (N) then
return False;
return True;
end if;
- -- Otherwise check for incompleted type
+ -- Otherwise check for incomplete type
if Is_Incomplete_Or_Private_Type (T)
and then No (Underlying_Type (T))
("representation item must be after full type declaration", N);
return True;
- -- If the type has incompleted components, a representation clause is
+ -- If the type has incomplete components, a representation clause is
-- illegal but stream attributes and Convention pragmas are correct.
elsif Has_Private_Component (T) then
end if;
end if;
- -- No error, link item into head of chain of rep items for the entity
+ -- No error, link item into head of chain of rep items for the entity,
+ -- but avoid chaining if we have an overloadable entity, and the pragma
+ -- is one that can apply to multiple overloaded entities.
+
+ if Is_Overloadable (T)
+ and then Nkind (N) = N_Pragma
+ then
+ declare
+ Pname : constant Name_Id := Pragma_Name (N);
+ begin
+ if Pname = Name_Convention or else
+ Pname = Name_Import or else
+ Pname = Name_Export or else
+ Pname = Name_External or else
+ Pname = Name_Interface
+ then
+ return False;
+ end if;
+ end;
+ end if;
Record_Rep_Item (T, N);
return False;
return not Has_Non_Standard_Rep (T2);
end if;
- -- Here the two types both have non-standard representation, and we
- -- need to determine if they have the same non-standard representation
+ -- Here the two types both have non-standard representation, and we need
+ -- to determine if they have the same non-standard representation.
-- For arrays, we simply need to test if the component sizes are the
-- same. Pragma Pack is reflected in modified component sizes, so this
end if;
end Same_Rep;
- -- Start processing for Record_Case
+ -- Start of processing for Record_Case
begin
if Has_Discriminants (T1) then
-- For enumeration types, we must check each literal to see if the
-- representation is the same. Note that we do not permit enumeration
- -- reprsentation clauses for Character and Wide_Character, so these
+ -- representation clauses for Character and Wide_Character, so these
-- cases were already dealt with.
elsif Is_Enumeration_Type (T1) then
and then Esize (T) < Standard_Integer_Size
then
Init_Esize (T, Standard_Integer_Size);
-
else
Init_Esize (T, Sz);
end if;
end Set_Enum_Esize;
+ ------------------------------
+ -- Validate_Address_Clauses --
+ ------------------------------
+
+ procedure Validate_Address_Clauses is
+ begin
+ for J in Address_Clause_Checks.First .. Address_Clause_Checks.Last loop
+ declare
+ ACCR : Address_Clause_Check_Record
+ renames Address_Clause_Checks.Table (J);
+
+ Expr : Node_Id;
+
+ X_Alignment : Uint;
+ Y_Alignment : Uint;
+
+ X_Size : Uint;
+ Y_Size : Uint;
+
+ begin
+ -- Skip processing of this entry if warning already posted
+
+ if not Address_Warning_Posted (ACCR.N) then
+
+ Expr := Original_Node (Expression (ACCR.N));
+
+ -- Get alignments
+
+ X_Alignment := Alignment (ACCR.X);
+ Y_Alignment := Alignment (ACCR.Y);
+
+ -- Similarly obtain sizes
+
+ X_Size := Esize (ACCR.X);
+ Y_Size := Esize (ACCR.Y);
+
+ -- Check for large object overlaying smaller one
+
+ if Y_Size > Uint_0
+ and then X_Size > Uint_0
+ and then X_Size > Y_Size
+ then
+ Error_Msg_NE
+ ("?& overlays smaller object", ACCR.N, ACCR.X);
+ Error_Msg_N
+ ("\?program execution may be erroneous", ACCR.N);
+ Error_Msg_Uint_1 := X_Size;
+ Error_Msg_NE
+ ("\?size of & is ^", ACCR.N, ACCR.X);
+ Error_Msg_Uint_1 := Y_Size;
+ Error_Msg_NE
+ ("\?size of & is ^", ACCR.N, ACCR.Y);
+
+ -- Check for inadequate alignment, both of the base object
+ -- and of the offset, if any.
+
+ -- Note: we do not check the alignment if we gave a size
+ -- warning, since it would likely be redundant.
+
+ elsif Y_Alignment /= Uint_0
+ and then (Y_Alignment < X_Alignment
+ or else (ACCR.Off
+ and then
+ Nkind (Expr) = N_Attribute_Reference
+ and then
+ Attribute_Name (Expr) = Name_Address
+ and then
+ Has_Compatible_Alignment
+ (ACCR.X, Prefix (Expr))
+ /= Known_Compatible))
+ then
+ Error_Msg_NE
+ ("?specified address for& may be inconsistent "
+ & "with alignment",
+ ACCR.N, ACCR.X);
+ Error_Msg_N
+ ("\?program execution may be erroneous (RM 13.3(27))",
+ ACCR.N);
+ Error_Msg_Uint_1 := X_Alignment;
+ Error_Msg_NE
+ ("\?alignment of & is ^",
+ ACCR.N, ACCR.X);
+ Error_Msg_Uint_1 := Y_Alignment;
+ Error_Msg_NE
+ ("\?alignment of & is ^",
+ ACCR.N, ACCR.Y);
+ if Y_Alignment >= X_Alignment then
+ Error_Msg_N
+ ("\?but offset is not multiple of alignment",
+ ACCR.N);
+ end if;
+ end if;
+ end if;
+ end;
+ end loop;
+ end Validate_Address_Clauses;
+
-----------------------------------
-- Validate_Unchecked_Conversion --
-----------------------------------
Target := Ancestor_Subtype (Etype (Act_Unit));
- -- If either type is generic, the instantiation happens within a
- -- generic unit, and there is nothing to check. The proper check
+ -- If either type is generic, the instantiation happens within a generic
+ -- unit, and there is nothing to check. The proper check
-- will happen when the enclosing generic is instantiated.
if Is_Generic_Type (Source) or else Is_Generic_Type (Target) then
return;
end if;
- -- Make entry in unchecked conversion table for later processing
- -- by Validate_Unchecked_Conversions, which will check sizes and
- -- alignments (using values set by the back-end where possible).
- -- This is only done if the appropriate warning is active
+ -- Warn if conversion between two different convention pointers
+
+ if Is_Access_Type (Target)
+ and then Is_Access_Type (Source)
+ and then Convention (Target) /= Convention (Source)
+ and then Warn_On_Unchecked_Conversion
+ then
+ -- Give warnings for subprogram pointers only on most targets. The
+ -- exception is VMS, where data pointers can have different lengths
+ -- depending on the pointer convention.
+
+ if Is_Access_Subprogram_Type (Target)
+ or else Is_Access_Subprogram_Type (Source)
+ or else OpenVMS_On_Target
+ then
+ Error_Msg_N
+ ("?conversion between pointers with different conventions!", N);
+ end if;
+ end if;
+
+ -- Warn if one of the operands is Ada.Calendar.Time. Do not emit a
+ -- warning when compiling GNAT-related sources.
+
+ if Warn_On_Unchecked_Conversion
+ and then not In_Predefined_Unit (N)
+ and then RTU_Loaded (Ada_Calendar)
+ and then
+ (Chars (Source) = Name_Time
+ or else
+ Chars (Target) = Name_Time)
+ then
+ -- If Ada.Calendar is loaded and the name of one of the operands is
+ -- Time, there is a good chance that this is Ada.Calendar.Time.
+
+ declare
+ Calendar_Time : constant Entity_Id :=
+ Full_View (RTE (RO_CA_Time));
+ begin
+ pragma Assert (Present (Calendar_Time));
+
+ if Source = Calendar_Time
+ or else Target = Calendar_Time
+ then
+ Error_Msg_N
+ ("?representation of 'Time values may change between " &
+ "'G'N'A'T versions", N);
+ end if;
+ end;
+ end if;
+
+ -- Make entry in unchecked conversion table for later processing by
+ -- Validate_Unchecked_Conversions, which will check sizes and alignments
+ -- (using values set by the back-end where possible). This is only done
+ -- if the appropriate warning is active.
if Warn_On_Unchecked_Conversion then
Unchecked_Conversions.Append
(New_Val => UC_Entry'
- (Enode => N,
+ (Eloc => Sloc (N),
Source => Source,
Target => Target));
end if;
end if;
- -- If unchecked conversion to access type, and access type is
- -- declared in the same unit as the unchecked conversion, then
- -- set the No_Strict_Aliasing flag (no strict aliasing is
- -- implicit in this situation).
+ -- If unchecked conversion to access type, and access type is declared
+ -- in the same unit as the unchecked conversion, then set the
+ -- No_Strict_Aliasing flag (no strict aliasing is implicit in this
+ -- situation).
if Is_Access_Type (Target) and then
In_Same_Source_Unit (Target, N)
-- Generate N_Validate_Unchecked_Conversion node for back end in
-- case the back end needs to perform special validation checks.
- -- Shouldn't this be in exp_ch13, since the check only gets done
+ -- Shouldn't this be in Exp_Ch13, since the check only gets done
-- if we have full expansion and the back end is called ???
Vnode :=
Set_Source_Type (Vnode, Source);
Set_Target_Type (Vnode, Target);
- -- If the unchecked conversion node is in a list, just insert before
- -- it. If not we have some strange case, not worth bothering about.
+ -- If the unchecked conversion node is in a list, just insert before it.
+ -- If not we have some strange case, not worth bothering about.
if Is_List_Member (N) then
Insert_After (N, Vnode);
declare
T : UC_Entry renames Unchecked_Conversions.Table (N);
- Enode : constant Node_Id := T.Enode;
- Source : constant Entity_Id := T.Source;
- Target : constant Entity_Id := T.Target;
+ Eloc : constant Source_Ptr := T.Eloc;
+ Source : constant Entity_Id := T.Source;
+ Target : constant Entity_Id := T.Target;
Source_Siz : Uint;
Target_Siz : Uint;
begin
- -- This validation check, which warns if we have unequal sizes
- -- for unchecked conversion, and thus potentially implementation
+ -- This validation check, which warns if we have unequal sizes for
+ -- unchecked conversion, and thus potentially implementation
-- dependent semantics, is one of the few occasions on which we
- -- use the official RM size instead of Esize. See description
- -- in Einfo "Handling of Type'Size Values" for details.
+ -- use the official RM size instead of Esize. See description in
+ -- Einfo "Handling of Type'Size Values" for details.
if Serious_Errors_Detected = 0
and then Known_Static_RM_Size (Source)
and then Known_Static_RM_Size (Target)
+
+ -- Don't do the check if warnings off for either type, note the
+ -- deliberate use of OR here instead of OR ELSE to get the flag
+ -- Warnings_Off_Used set for both types if appropriate.
+
+ and then not (Has_Warnings_Off (Source)
+ or
+ Has_Warnings_Off (Target))
then
Source_Siz := RM_Size (Source);
Target_Siz := RM_Size (Target);
if Source_Siz /= Target_Siz then
- Error_Msg_N
- ("types for unchecked conversion have different sizes?",
- Enode);
+ Error_Msg
+ ("?types for unchecked conversion have different sizes!",
+ Eloc);
if All_Errors_Mode then
Error_Msg_Name_1 := Chars (Source);
Error_Msg_Uint_1 := Source_Siz;
Error_Msg_Name_2 := Chars (Target);
Error_Msg_Uint_2 := Target_Siz;
- Error_Msg_N
- ("\size of % is ^, size of % is ^?", Enode);
+ Error_Msg ("\size of % is ^, size of % is ^?", Eloc);
Error_Msg_Uint_1 := UI_Abs (Source_Siz - Target_Siz);
and then Is_Discrete_Type (Target)
then
if Source_Siz > Target_Siz then
- Error_Msg_N
- ("\^ high order bits of source will be ignored?",
- Enode);
+ Error_Msg
+ ("\?^ high order bits of source will be ignored!",
+ Eloc);
elsif Is_Unsigned_Type (Source) then
- Error_Msg_N
- ("\source will be extended with ^ high order " &
- "zero bits?", Enode);
+ Error_Msg
+ ("\?source will be extended with ^ high order " &
+ "zero bits?!", Eloc);
else
- Error_Msg_N
- ("\source will be extended with ^ high order " &
- "sign bits?",
- Enode);
+ Error_Msg
+ ("\?source will be extended with ^ high order " &
+ "sign bits!",
+ Eloc);
end if;
elsif Source_Siz < Target_Siz then
if Is_Discrete_Type (Target) then
if Bytes_Big_Endian then
- Error_Msg_N
- ("\target value will include ^ undefined " &
- "low order bits?",
- Enode);
+ Error_Msg
+ ("\?target value will include ^ undefined " &
+ "low order bits!",
+ Eloc);
else
- Error_Msg_N
- ("\target value will include ^ undefined " &
- "high order bits?",
- Enode);
+ Error_Msg
+ ("\?target value will include ^ undefined " &
+ "high order bits!",
+ Eloc);
end if;
else
- Error_Msg_N
- ("\^ trailing bits of target value will be " &
- "undefined?", Enode);
+ Error_Msg
+ ("\?^ trailing bits of target value will be " &
+ "undefined!", Eloc);
end if;
else pragma Assert (Source_Siz > Target_Siz);
- Error_Msg_N
- ("\^ trailing bits of source will be ignored?",
- Enode);
+ Error_Msg
+ ("\?^ trailing bits of source will be ignored!",
+ Eloc);
end if;
end if;
end if;
begin
if Source_Align < Target_Align
and then not Is_Tagged_Type (D_Source)
+
+ -- Suppress warning if warnings suppressed on either
+ -- type or either designated type. Note the use of
+ -- OR here instead of OR ELSE. That is intentional,
+ -- we would like to set flag Warnings_Off_Used in
+ -- all types for which warnings are suppressed.
+
+ and then not (Has_Warnings_Off (D_Source)
+ or
+ Has_Warnings_Off (D_Target)
+ or
+ Has_Warnings_Off (Source)
+ or
+ Has_Warnings_Off (Target))
then
Error_Msg_Uint_1 := Target_Align;
Error_Msg_Uint_2 := Source_Align;
+ Error_Msg_Node_1 := D_Target;
Error_Msg_Node_2 := D_Source;
- Error_Msg_NE
- ("alignment of & (^) is stricter than " &
- "alignment of & (^)?", Enode, D_Target);
-
- if All_Errors_Mode then
- Error_Msg_N
- ("\resulting access value may have invalid " &
- "alignment?", Enode);
- end if;
+ Error_Msg
+ ("?alignment of & (^) is stricter than " &
+ "alignment of & (^)!", Eloc);
+ Error_Msg
+ ("\?resulting access value may have invalid " &
+ "alignment!", Eloc);
end if;
end;
end if;
OSDN Git Service
