-- --
-- B o d y --
-- --
--- --
--- Copyright (C) 1992-2002, Free Software Foundation, Inc. --
+-- Copyright (C) 1992-2006, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- 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. --
+-- 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. --
with Errout; use Errout;
with Exp_Tss; use Exp_Tss;
with Exp_Util; use Exp_Util;
-with Hostparm; use Hostparm;
with Lib; use Lib;
with Nlists; use Nlists;
with Nmake; use Nmake;
with Opt; use Opt;
+with Restrict; use Restrict;
+with Rident; use Rident;
with Rtsfind; use Rtsfind;
with Sem; use Sem;
with Sem_Ch8; use Sem_Ch8;
with Sem_Res; use Sem_Res;
with Sem_Type; use Sem_Type;
with Sem_Util; use Sem_Util;
-with Snames; use Snames;
+with Sem_Warn; use Sem_Warn;
+with Snames; use Snames;
with Stand; use Stand;
with Sinfo; use Sinfo;
with Table;
+with Targparm; use Targparm;
with Ttypes; use Ttypes;
with Tbuild; use Tbuild;
with Urealp; use Urealp;
-- Attributes that do not specify a representation characteristic are
-- operational attributes.
- procedure New_Stream_Function
+ 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_Subprogram
(N : Node_Id;
Ent : Entity_Id;
Subp : Entity_Id;
- Nam : Name_Id);
- -- 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 : TSS_Name_Type);
+ -- 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
-- declaration, so that the attribute specification is handled as a
-- 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 : Name_Id;
- 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.
-
- procedure Check_Constant_Address_Clause (Expr : Node_Id; U_Ent : Entity_Id);
- -- Expr is an expression for an address clause. This procedure checks
- -- that the expression is constant, in the limited sense that it is safe
- -- to evaluate it at the point the object U_Ent is declared, rather than
- -- at the point of the address clause. The condition for this to be true
- -- is that the expression has no variables, no constants declared after
- -- U_Ent, and no calls to non-pure functions. If this condition is not
- -- met, then an appropriate error message is posted.
-
- procedure Warn_Overlay
- (Expr : Node_Id;
- Typ : Entity_Id;
- Nam : Node_Id);
- -- Expr is the expression for an address clause for entity Nam whose type
- -- is Typ. If Typ has a default initialization, check whether the address
- -- clause might overlay two entities, and emit a warning on the side effect
- -- that the initialization will cause.
-
----------------------------------------------
-- Table for Validate_Unchecked_Conversions --
----------------------------------------------
Table_Increment => 200,
Table_Name => "Unchecked_Conversions");
+ ----------------------------
+ -- Address_Aliased_Entity --
+ ----------------------------
+
+ 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
+ declare
+ Nam : Node_Id := Prefix (N);
+ begin
+ while False
+ or else Nkind (Nam) = N_Selected_Component
+ or else Nkind (Nam) = N_Indexed_Component
+ loop
+ Nam := Prefix (Nam);
+ end loop;
+
+ if Is_Entity_Name (Nam) then
+ return Entity (Nam);
+ end if;
+ end;
+ end if;
+
+ return Empty;
+ end Address_Aliased_Entity;
+
+ -----------------------------------------
+ -- 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);
+
+ begin
+ -- 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
+ CC : constant Node_Id := Component_Clause (Comp);
+ Fbit : constant Uint := Static_Integer (First_Bit (CC));
+
+ begin
+ if Present (CC) then
+
+ -- 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
+
+ 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 if;
+ end;
+
+ 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 discrimninant entities. The data
+ -- starts at index 1, the 0'th entry is for GNAT.Heap_Sort_A.
+
+ function CP_Lt (Op1, Op2 : Natural) return Boolean;
+ -- Compare routine for Sort (See GNAT.Heap_Sort_A)
+
+ procedure CP_Move (From : Natural; To : Natural);
+ -- Move routine for Sort (see GNAT.Heap_Sort_A)
+
+ 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
+
+ Sort (Num_CC, CP_Move'Unrestricted_Access, CP_Lt'Unrestricted_Access);
+
+ -- 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 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
+ ("?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
+ ("?\big-endian range for component & is ^ .. ^",
+ First_Bit (CC), Comp);
+ else
+ Error_Msg_NE
+ ("?\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 --
--------------------------------------
procedure Analyze_At_Clause (N : Node_Id) is
begin
+ 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);
+ Error_Msg_N
+ ("\use address attribute definition clause instead?", N);
+ end if;
+
Rewrite (N,
Make_Attribute_Definition_Clause (Sloc (N),
Name => Identifier (N),
-- disallow Storage_Size for derived task types, but that is also
-- clearly unintentional.
+ procedure Analyze_Stream_TSS_Definition (TSS_Nam : TSS_Name_Type);
+ -- Common processing for 'Read, 'Write, 'Input and 'Output attribute
+ -- definition clauses.
+
+ procedure Analyze_Stream_TSS_Definition (TSS_Nam : TSS_Name_Type) is
+ Subp : Entity_Id := Empty;
+ I : Interp_Index;
+ It : Interp;
+ Pnam : Entity_Id;
+
+ Is_Read : constant Boolean := (TSS_Nam = TSS_Stream_Read);
+
+ function Has_Good_Profile (Subp : Entity_Id) return Boolean;
+ -- Return true if the entity is a subprogram with an appropriate
+ -- profile for the attribute being defined.
+
+ ----------------------
+ -- Has_Good_Profile --
+ ----------------------
+
+ function Has_Good_Profile (Subp : Entity_Id) return Boolean is
+ F : Entity_Id;
+ Is_Function : constant Boolean := (TSS_Nam = TSS_Stream_Input);
+ Expected_Ekind : constant array (Boolean) of Entity_Kind :=
+ (False => E_Procedure, True => E_Function);
+ Typ : Entity_Id;
+
+ begin
+ if Ekind (Subp) /= Expected_Ekind (Is_Function) then
+ return False;
+ end if;
+
+ F := First_Formal (Subp);
+
+ if No (F)
+ or else Ekind (Etype (F)) /= E_Anonymous_Access_Type
+ or else Designated_Type (Etype (F)) /=
+ Class_Wide_Type (RTE (RE_Root_Stream_Type))
+ then
+ return False;
+ end if;
+
+ if not Is_Function then
+ Next_Formal (F);
+
+ declare
+ Expected_Mode : constant array (Boolean) of Entity_Kind :=
+ (False => E_In_Parameter,
+ True => E_Out_Parameter);
+ begin
+ if Parameter_Mode (F) /= Expected_Mode (Is_Read) then
+ return False;
+ end if;
+ end;
+
+ Typ := Etype (F);
+
+ else
+ Typ := Etype (Subp);
+ end if;
+
+ 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
+
+ begin
+ FOnly := True;
+
+ if not Is_Type (U_Ent) then
+ Error_Msg_N ("local name must be a subtype", Nam);
+ return;
+ end if;
+
+ Pnam := TSS (Base_Type (U_Ent), TSS_Nam);
+
+ -- 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);
+ return;
+ end if;
+
+ Analyze (Expr);
+
+ if Is_Entity_Name (Expr) then
+ if not Is_Overloaded (Expr) then
+ if Has_Good_Profile (Entity (Expr)) then
+ Subp := Entity (Expr);
+ end if;
+
+ else
+ Get_First_Interp (Expr, I, It);
+
+ while Present (It.Nam) loop
+ if Has_Good_Profile (It.Nam) then
+ Subp := It.Nam;
+ exit;
+ end if;
+
+ Get_Next_Interp (I, It);
+ end loop;
+ end if;
+ end if;
+
+ if Present (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));
+
+ New_Stream_Subprogram (N, U_Ent, Subp, TSS_Nam);
+
+ else
+ Error_Msg_Name_1 := Attr;
+ Error_Msg_N ("incorrect expression for% attribute", Expr);
+ end if;
+ end Analyze_Stream_TSS_Definition;
+
+ -- Start of processing for Analyze_Attribute_Definition_Clause
+
begin
Analyze (Nam);
Ent := Entity (Nam);
return;
end if;
- -- Rep clause applies to full view of incomplete type or private type
- -- if we have one (if not, this is a premature use of the type).
- -- However, certain semantic checks need to be done on the specified
- -- entity (i.e. the private view), so we save it in Ent.
+ -- Rep clause applies to full view of incomplete type or private type if
+ -- we have one (if not, this is a premature use of the type). However,
+ -- certain semantic checks need to be done on the specified entity (i.e.
+ -- the private view), so we save it in Ent.
if Is_Private_Type (Ent)
and then Is_Derived_Type (Ent)
and then not Is_Tagged_Type (Ent)
and then No (Full_View (Ent))
then
- -- If this is a private type whose completion is a derivation
- -- from another private type, there is no full view, and the
- -- attribute belongs to the type itself, not its underlying parent.
+ -- If this is a private type whose completion is a derivation from
+ -- another private type, there is no full view, and the attribute
+ -- belongs to the type itself, not its underlying parent.
U_Ent := Ent;
elsif Ekind (Ent) = E_Incomplete_Type then
+
+ -- The attribute applies to the full view, set the entity of the
+ -- attribute definition accordingly.
+
Ent := Underlying_Type (Ent);
U_Ent := Ent;
+ Set_Entity (Nam, Ent);
+
else
U_Ent := Underlying_Type (Ent);
end if;
then
Error_Msg_N ("cannot specify attribute for subtype", Nam);
return;
-
end if;
-- Switch on particular attribute
-- Case of address clause for subprogram
elsif Is_Subprogram (U_Ent) then
-
if Has_Homonym (U_Ent) then
Error_Msg_N
("address clause cannot be given " &
-- Case of address clause for entry
elsif Ekind (U_Ent) = E_Entry then
-
if Nkind (Parent (N)) = N_Task_Body then
Error_Msg_N
("entry address must be specified in task spec", Nam);
("\?only one task can be declared of this type", N);
end if;
- -- Case of address clause for an object
+ 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);
+ Error_Msg_N
+ ("\use interrupt procedure instead?", N);
+ end if;
+
+ -- Case of an address clause for a controlled object:
+ -- erroneous execution.
+
+ elsif Is_Controlled (Etype (U_Ent)) then
+ Error_Msg_NE
+ ("?controlled object& must not be overlaid", Nam, U_Ent);
+ Error_Msg_N
+ ("\?Program_Error will be raised at run time", Nam);
+ Insert_Action (Declaration_Node (U_Ent),
+ Make_Raise_Program_Error (Loc,
+ Reason => PE_Overlaid_Controlled_Object));
+
+ -- Case of address clause for a (non-controlled) object
elsif
Ekind (U_Ent) = E_Variable
Ekind (U_Ent) = E_Constant
then
declare
- Decl : constant Node_Id := Declaration_Node (U_Ent);
Expr : constant Node_Id := Expression (N);
- Typ : constant Entity_Id := Etype (U_Ent);
+ Aent : constant Entity_Id := Address_Aliased_Entity (Expr);
begin
-- Exported variables cannot have an address clause,
Error_Msg_N
("cannot export object with address clause", Nam);
+ -- Overlaying controlled objects is erroneous
+
+ elsif Present (Aent)
+ and then Is_Controlled (Etype (Aent))
+ then
+ Error_Msg_N
+ ("?controlled object must not be overlaid", 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));
+
+ elsif Present (Aent)
+ and then Ekind (U_Ent) = E_Constant
+ and then Ekind (Aent) /= E_Constant
+ 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);
+
-- Imported variables can have an address clause, but then
-- the import is pretty meaningless except to suppress
-- initializations, so we do not need such variables to
Note_Possible_Modification (Nam);
- -- If we have no initialization of any kind, then we can
- -- safely defer the elaboration of the variable to its
- -- freezing point, so that the address clause will be
- -- computed at the proper point.
+ -- 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.
- -- The same processing applies to all initialized scalar
- -- types and all access types. Packed bit arrays of size
- -- up to 64 are represented using a modular type with an
- -- initialization (to zero) and can be processed like
- -- other initialized scalar types.
+ -- First case is where we have an explicit
- if (No (Expression (Decl))
- and then not Has_Non_Null_Base_Init_Proc (Typ))
+ -- for J'Address use K'Address;
- or else
- (Present (Expression (Decl))
- and then Is_Scalar_Type (Typ))
+ -- In this case, we mark K as volatile
- or else
- Is_Access_Type (Typ)
+ Mark_Aliased_Address_As_Volatile (Expr);
- or else
- (Is_Bit_Packed_Array (Base_Type (Typ))
- and then
- Is_Modular_Integer_Type (Packed_Array_Type (Typ)))
- then
- Set_Has_Delayed_Freeze (U_Ent);
+ -- Second case is where we have a constant whose
+ -- definition is of the form of an address as in:
- -- Otherwise, we require the address clause to be constant
+ -- A : constant Address := K'Address;
+ -- ...
+ -- for B'Address use A;
- else
- Check_Constant_Address_Clause (Expr, U_Ent);
+ -- 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;
end if;
+ -- Legality checks on the address clause for initialized
+ -- objects is deferred until the freeze point, because
+ -- a subsequent pragma might indicate that the object is
+ -- imported and thus not initialized.
+
+ Set_Has_Delayed_Freeze (U_Ent);
+
if Is_Exported (U_Ent) then
Error_Msg_N
("& cannot be exported if an address clause is given",
Nam);
end if;
- if not Error_Posted (Expr) then
- Warn_Overlay (Expr, Typ, Nam);
- end if;
-
- -- If entity has delayed freeze then we will generate
- -- an alignment check at the freeze point. If there is
- -- no delayed freeze we can do it right now.
+ -- Entity has delayed freeze, so we will generate an
+ -- alignment check at the freeze point unless suppressed.
- if not Has_Delayed_Freeze (U_Ent) then
- Apply_Alignment_Check (U_Ent, N);
+ 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
-- Alignment attribute definition clause
when Attribute_Alignment => Alignment_Block : declare
- Align : Uint := Get_Alignment_Value (Expr);
+ Align : constant Uint := Get_Alignment_Value (Expr);
begin
FOnly := True;
return;
elsif not Is_Static_Expression (Expr) then
- Error_Msg_N ("Bit_Order requires static expression", Expr);
+ Flag_Non_Static_Expr
+ ("Bit_Order requires static expression!", Expr);
else
if (Expr_Value (Expr) = 0) /= Bytes_Big_Endian then
Analyze_And_Resolve (Expr, Standard_String);
if not Is_Static_Expression (Expr) then
- Error_Msg_N ("must be a static string", Nam);
+ Flag_Non_Static_Expr
+ ("static string required for tag name!", Nam);
end if;
Set_Has_External_Tag_Rep_Clause (U_Ent);
-- Input --
-----------
- when Attribute_Input => Input : declare
- Subp : Entity_Id := Empty;
- I : Interp_Index;
- It : Interp;
- Pnam : Entity_Id;
-
- function Has_Good_Profile (Subp : Entity_Id) return Boolean;
- -- Return true if the entity is a function with an appropriate
- -- profile for the Input attribute.
-
- function Has_Good_Profile (Subp : Entity_Id) return Boolean is
- F : Entity_Id;
- Ok : Boolean := False;
-
- begin
- if Ekind (Subp) = E_Function then
- F := First_Formal (Subp);
-
- if Present (F) and then No (Next_Formal (F)) then
- if Ekind (Etype (F)) = E_Anonymous_Access_Type
- and then
- Designated_Type (Etype (F)) =
- Class_Wide_Type (RTE (RE_Root_Stream_Type))
- then
- Ok := Base_Type (Etype (Subp)) = Base_Type (Ent);
- end if;
- end if;
- end if;
-
- return Ok;
- end Has_Good_Profile;
-
- -- Start of processing for Input attribute definition
-
- begin
- FOnly := True;
-
- if not Is_Type (U_Ent) then
- Error_Msg_N ("local name must be a subtype", Nam);
- return;
-
- else
- Pnam := TSS (Base_Type (U_Ent), Name_uInput);
-
- if Present (Pnam)
- and then Base_Type (Etype (Pnam)) = Base_Type (U_Ent)
- then
- Error_Msg_Sloc := Sloc (Pnam);
- Error_Msg_N ("input attribute already defined #", Nam);
- return;
- end if;
- end if;
-
- Analyze (Expr);
-
- if Is_Entity_Name (Expr) then
- if not Is_Overloaded (Expr) then
- if Has_Good_Profile (Entity (Expr)) then
- Subp := Entity (Expr);
- end if;
-
- else
- Get_First_Interp (Expr, I, It);
-
- while Present (It.Nam) loop
- if Has_Good_Profile (It.Nam) then
- Subp := It.Nam;
- exit;
- end if;
-
- Get_Next_Interp (I, It);
- end loop;
- end if;
- end if;
-
- if Present (Subp) then
- Set_Entity (Expr, Subp);
- Set_Etype (Expr, Etype (Subp));
- New_Stream_Function (N, U_Ent, Subp, Name_uInput);
- else
- Error_Msg_N ("incorrect expression for input attribute", Expr);
- return;
- end if;
- end Input;
+ when Attribute_Input =>
+ Analyze_Stream_TSS_Definition (TSS_Stream_Input);
+ Set_Has_Specified_Stream_Input (Ent);
-------------------
-- Machine_Radix --
end if;
end Object_Size;
- ------------
- -- Output --
- ------------
-
- when Attribute_Output => Output : declare
- Subp : Entity_Id := Empty;
- I : Interp_Index;
- It : Interp;
- Pnam : Entity_Id;
-
- function Has_Good_Profile (Subp : Entity_Id) return Boolean;
- -- Return true if the entity is a procedure with an
- -- appropriate profile for the output attribute.
-
- function Has_Good_Profile (Subp : Entity_Id) return Boolean is
- F : Entity_Id;
- Ok : Boolean := False;
-
- begin
- if Ekind (Subp) = E_Procedure then
- F := First_Formal (Subp);
-
- if Present (F) then
- if Ekind (Etype (F)) = E_Anonymous_Access_Type
- and then
- Designated_Type (Etype (F)) =
- Class_Wide_Type (RTE (RE_Root_Stream_Type))
- then
- Next_Formal (F);
- Ok := Present (F)
- and then Parameter_Mode (F) = E_In_Parameter
- and then Base_Type (Etype (F)) = Base_Type (Ent)
- and then No (Next_Formal (F));
- end if;
- end if;
- end if;
-
- return Ok;
- end Has_Good_Profile;
-
- begin
- FOnly := True;
-
- if not Is_Type (U_Ent) then
- Error_Msg_N ("local name must be a subtype", Nam);
- return;
-
- else
- Pnam := TSS (Base_Type (U_Ent), Name_uOutput);
-
- if Present (Pnam)
- and then
- Base_Type (Etype (Next_Formal (First_Formal (Pnam))))
- = Base_Type (U_Ent)
- then
- Error_Msg_Sloc := Sloc (Pnam);
- Error_Msg_N ("output attribute already defined #", Nam);
- return;
- end if;
- end if;
-
- Analyze (Expr);
-
- if Is_Entity_Name (Expr) then
- if not Is_Overloaded (Expr) then
- if Has_Good_Profile (Entity (Expr)) then
- Subp := Entity (Expr);
- end if;
-
- else
- Get_First_Interp (Expr, I, It);
-
- while Present (It.Nam) loop
- if Has_Good_Profile (It.Nam) then
- Subp := It.Nam;
- exit;
- end if;
-
- Get_Next_Interp (I, It);
- end loop;
- end if;
- end if;
-
- if Present (Subp) then
- Set_Entity (Expr, Subp);
- Set_Etype (Expr, Etype (Subp));
- New_Stream_Procedure (N, U_Ent, Subp, Name_uOutput);
- else
- Error_Msg_N ("incorrect expression for output attribute", Expr);
- return;
- end if;
- end Output;
-
- ----------
- -- Read --
- ----------
-
- when Attribute_Read => Read : declare
- Subp : Entity_Id := Empty;
- I : Interp_Index;
- It : Interp;
- Pnam : Entity_Id;
-
- function Has_Good_Profile (Subp : Entity_Id) return Boolean;
- -- Return true if the entity is a procedure with an appropriate
- -- profile for the Read attribute.
-
- function Has_Good_Profile (Subp : Entity_Id) return Boolean is
- F : Entity_Id;
- Ok : Boolean := False;
-
- begin
- if Ekind (Subp) = E_Procedure then
- F := First_Formal (Subp);
-
- if Present (F) then
- if Ekind (Etype (F)) = E_Anonymous_Access_Type
- and then
- Designated_Type (Etype (F)) =
- Class_Wide_Type (RTE (RE_Root_Stream_Type))
- then
- Next_Formal (F);
- Ok := Present (F)
- and then Parameter_Mode (F) = E_Out_Parameter
- and then Base_Type (Etype (F)) = Base_Type (Ent)
- and then No (Next_Formal (F));
- end if;
- end if;
- end if;
-
- return Ok;
- end Has_Good_Profile;
-
- -- Start of processing for Read attribute definition
-
- begin
- FOnly := True;
-
- if not Is_Type (U_Ent) then
- Error_Msg_N ("local name must be a subtype", Nam);
- return;
-
- else
- Pnam := TSS (Base_Type (U_Ent), Name_uRead);
-
- if Present (Pnam)
- and then Base_Type (Etype (Next_Formal (First_Formal (Pnam))))
- = Base_Type (U_Ent)
- then
- Error_Msg_Sloc := Sloc (Pnam);
- Error_Msg_N ("read attribute already defined #", Nam);
- return;
- end if;
- end if;
-
- Analyze (Expr);
-
- if Is_Entity_Name (Expr) then
- if not Is_Overloaded (Expr) then
- if Has_Good_Profile (Entity (Expr)) then
- Subp := Entity (Expr);
- end if;
-
- else
- Get_First_Interp (Expr, I, It);
+ ------------
+ -- Output --
+ ------------
- while Present (It.Nam) loop
- if Has_Good_Profile (It.Nam) then
- Subp := It.Nam;
- exit;
- end if;
+ when Attribute_Output =>
+ Analyze_Stream_TSS_Definition (TSS_Stream_Output);
+ Set_Has_Specified_Stream_Output (Ent);
- Get_Next_Interp (I, It);
- end loop;
- end if;
- end if;
+ ----------
+ -- Read --
+ ----------
- if Present (Subp) then
- Set_Entity (Expr, Subp);
- Set_Etype (Expr, Etype (Subp));
- New_Stream_Procedure (N, U_Ent, Subp, Name_uRead, True);
- else
- Error_Msg_N ("incorrect expression for read attribute", Expr);
- return;
- end if;
- end Read;
+ when Attribute_Read =>
+ Analyze_Stream_TSS_Definition (TSS_Stream_Read);
+ Set_Has_Specified_Stream_Read (Ent);
----------
-- Size --
("size cannot be given for unconstrained array", Nam);
elsif Size /= No_Uint then
-
if Is_Type (U_Ent) then
Etyp := U_Ent;
else
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)
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
-- For objects, set Esize only
else
+ if Is_Elementary_Type (Etyp) then
+ if Size /= System_Storage_Unit
+ and then
+ Size /= System_Storage_Unit * 2
+ and then
+ Size /= System_Storage_Unit * 4
+ and then
+ Size /= System_Storage_Unit * 8
+ then
+ Error_Msg_Uint_1 := UI_From_Int (System_Storage_Unit);
+ Error_Msg_Uint_2 := Error_Msg_Uint_1 * 8;
+ Error_Msg_N
+ ("size for primitive object must be a power of 2"
+ & " in the range ^-^", N);
+ end if;
+ end if;
+
Set_Esize (U_Ent, Size);
end if;
return;
elsif not Is_Static_Expression (Expr) then
- Error_Msg_N ("small requires static expression", Expr);
+ Flag_Non_Static_Expr
+ ("small requires static expression!", Expr);
return;
else
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
- 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 --
------------------
when Attribute_Storage_Pool => Storage_Pool : declare
Pool : Entity_Id;
+ 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 Nkind (Expr) = N_Type_Conversion then
+ T := Etype (Expression (Expr));
+ else
+ T := Etype (Expr);
+ end if;
+
+ -- 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:
+ -- 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);
+ return;
+ end if;
+
-- If the argument is a name that is not an entity name, then
-- we construct a renaming operation to define an entity of
-- type storage pool.
Pool := Entity (Expression (Renamed_Object (Pool)));
end if;
- if Present (Etype (Pool))
- and then Etype (Pool) /= RTE (RE_Stack_Bounded_Pool)
- and then Etype (Pool) /= RTE (RE_Unbounded_Reclaim_Pool)
- then
- Set_Associated_Storage_Pool (U_Ent, Pool);
- else
- Error_Msg_N ("Non sharable GNAT Pool", Expr);
- end if;
-
- -- The pool may be specified as the Storage_Pool of some other
- -- type. It is rewritten as a class_wide conversion of the
- -- corresponding pool entity.
+ Set_Associated_Storage_Pool (U_Ent, Pool);
elsif Nkind (Expr) = N_Type_Conversion
and then Is_Entity_Name (Expression (Expr))
and then Nkind (Original_Node (Expr)) = N_Attribute_Reference
then
Pool := Entity (Expression (Expr));
-
- if Present (Etype (Pool))
- and then Etype (Pool) /= RTE (RE_Stack_Bounded_Pool)
- and then Etype (Pool) /= RTE (RE_Unbounded_Reclaim_Pool)
- then
- Set_Associated_Storage_Pool (U_Ent, Pool);
- else
- Error_Msg_N ("Non sharable GNAT Pool", Expr);
- end if;
+ Set_Associated_Storage_Pool (U_Ent, Pool);
else
Error_Msg_N ("incorrect reference to a Storage Pool", Expr);
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 ('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;
+
+ -----------------
+ -- Stream_Size --
+ -----------------
+
+ when Attribute_Stream_Size => Stream_Size : declare
+ Size : constant Uint := Static_Integer (Expr);
+
+ begin
+ if Has_Stream_Size_Clause (U_Ent) then
+ Error_Msg_N ("Stream_Size already given for &", Nam);
+
+ elsif Is_Elementary_Type (U_Ent) then
+ if Size /= System_Storage_Unit
+ and then
+ Size /= System_Storage_Unit * 2
+ and then
+ Size /= System_Storage_Unit * 4
+ and then
+ Size /= System_Storage_Unit * 8
+ then
+ Error_Msg_Uint_1 := UI_From_Int (System_Storage_Unit);
+ Error_Msg_N
+ ("stream size for elementary type must be a"
+ & " power of 2 and at least ^", N);
+
+ elsif RM_Size (U_Ent) > Size then
+ Error_Msg_Uint_1 := RM_Size (U_Ent);
+ Error_Msg_N
+ ("stream size for elementary type must be a"
+ & " power of 2 and at least ^", N);
+ end if;
+
+ Set_Has_Stream_Size_Clause (U_Ent);
+
+ else
+ Error_Msg_N ("Stream_Size cannot be given for &", Nam);
+ end if;
+ end Stream_Size;
+
----------------
-- Value_Size --
----------------
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);
-- Write --
-----------
- -- Write attribute definition clause
- -- check for class-wide case will be performed later
-
- when Attribute_Write => Write : declare
- Subp : Entity_Id := Empty;
- I : Interp_Index;
- It : Interp;
- Pnam : Entity_Id;
-
- function Has_Good_Profile (Subp : Entity_Id) return Boolean;
- -- Return true if the entity is a procedure with an
- -- appropriate profile for the write attribute.
-
- function Has_Good_Profile (Subp : Entity_Id) return Boolean is
- F : Entity_Id;
- Ok : Boolean := False;
-
- begin
- if Ekind (Subp) = E_Procedure then
- F := First_Formal (Subp);
-
- if Present (F) then
- if Ekind (Etype (F)) = E_Anonymous_Access_Type
- and then
- Designated_Type (Etype (F)) =
- Class_Wide_Type (RTE (RE_Root_Stream_Type))
- then
- Next_Formal (F);
- Ok := Present (F)
- and then Parameter_Mode (F) = E_In_Parameter
- and then Base_Type (Etype (F)) = Base_Type (Ent)
- and then No (Next_Formal (F));
- end if;
- end if;
- end if;
-
- return Ok;
- end Has_Good_Profile;
-
- -- Start of processing for Write attribute definition
-
- begin
- FOnly := True;
-
- if not Is_Type (U_Ent) then
- Error_Msg_N ("local name must be a subtype", Nam);
- return;
- end if;
-
- Pnam := TSS (Base_Type (U_Ent), Name_uWrite);
-
- if Present (Pnam)
- and then Base_Type (Etype (Next_Formal (First_Formal (Pnam))))
- = Base_Type (U_Ent)
- then
- Error_Msg_Sloc := Sloc (Pnam);
- Error_Msg_N ("write attribute already defined #", Nam);
- return;
- end if;
-
- Analyze (Expr);
-
- if Is_Entity_Name (Expr) then
- if not Is_Overloaded (Expr) then
- if Has_Good_Profile (Entity (Expr)) then
- Subp := Entity (Expr);
- end if;
-
- else
- Get_First_Interp (Expr, I, It);
-
- while Present (It.Nam) loop
- if Has_Good_Profile (It.Nam) then
- Subp := It.Nam;
- exit;
- end if;
-
- Get_Next_Interp (I, It);
- end loop;
- end if;
- end if;
-
- if Present (Subp) then
- Set_Entity (Expr, Subp);
- Set_Etype (Expr, Etype (Subp));
- New_Stream_Procedure (N, U_Ent, Subp, Name_uWrite);
- else
- Error_Msg_N ("incorrect expression for write attribute", Expr);
- return;
- end if;
- end Write;
+ when Attribute_Write =>
+ Analyze_Stream_TSS_Definition (TSS_Stream_Write);
+ Set_Has_Specified_Stream_Write (Ent);
-- All other attributes cannot be set
when others =>
Error_Msg_N
("attribute& cannot be set with definition clause", N);
-
end case;
-- The test for the type being frozen must be performed after
return;
end if;
+ Check_Code_Statement (N);
+
-- Make sure we appear in the handled statement sequence of a
-- subprogram (RM 13.8(3)).
Next (Stmt);
end loop;
end if;
-
end Analyze_Code_Statement;
-----------------------------------------------
return;
end if;
- if Scope (Enumtype) /= Current_Scope then
+ -- Ignore rep clause on generic actual type. This will already have
+ -- been flagged on the template as an error, and this is the safest
+ -- way to ensure we don't get a junk cascaded message in the instance.
+
+ if Is_Generic_Actual_Type (Enumtype) then
+ return;
+
+ -- Type must be in current scope
+
+ elsif Scope (Enumtype) /= Current_Scope then
Error_Msg_N ("type must be declared in this scope", Ident);
return;
+ -- Type must be a first subtype
+
elsif not Is_First_Subtype (Enumtype) then
Error_Msg_N ("cannot give enumeration rep clause for subtype", N);
return;
+ -- Ignore duplicate rep clause
+
elsif Has_Enumeration_Rep_Clause (Enumtype) then
Error_Msg_N ("duplicate enumeration rep clause ignored", N);
return;
+ -- 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
Error_Msg_N ("enumeration rep clause not allowed for this type", N);
+ return;
+
+ -- Check that the expression is a proper aggregate (no parentheses)
+
+ elsif Paren_Count (Aggr) /= 0 then
+ Error_Msg
+ ("extra parentheses surrounding aggregate not allowed",
+ First_Sloc (Aggr));
+ return;
+
+ -- All tests passed, so set rep clause in place
else
Set_Has_Enumeration_Rep_Clause (Enumtype);
-- normal expansion activities, and a number of special semantic
-- rules apply (including the component type being any integer type)
- -- Badent signals that we found some incorrect entries processing
- -- the list. The final checks for completeness and ordering are
- -- skipped in this case.
-
Elit := First_Literal (Enumtype);
-- First the positional entries if any
Val := Static_Integer (Expr);
+ -- Err signals that we found some incorrect entries processing
+ -- the list. The final checks for completeness and ordering are
+ -- skipped in this case.
+
if Val = No_Uint then
Err := True;
-
elsif Val < Lo or else Hi < Val then
Error_Msg_N ("value outside permitted range", Expr);
Err := True;
elsif Etype (Choice) = Base_Type (Enumtype) then
if not Is_Static_Expression (Choice) then
- Error_Msg_N
- ("non-static expression used for choice", Choice);
+ Flag_Non_Static_Expr
+ ("non-static expression used for choice!", Choice);
Err := True;
else
if Rep_Item_Too_Late (Enumtype, N) then
null;
end if;
-
end Analyze_Enumeration_Representation_Clause;
----------------------------
Biased : Boolean;
Max_Bit_So_Far : Uint;
- -- Records the maximum bit position so far. If all field positoins
+ -- Records the maximum bit position so far. If all field positions
-- are monotonically increasing, then we can skip the circuit for
-- checking for overlap, since no overlap is possible.
Ccount : Natural := 0;
-- Number of component clauses in record rep clause
+ CR_Pragma : Node_Id := Empty;
+ -- Points to N_Pragma node if Complete_Representation pragma present
+
begin
Find_Type (Ident);
Rectype := Entity (Ident);
Loc : constant Source_Ptr := Sloc (N);
M : constant Node_Id := Mod_Clause (N);
P : constant List_Id := Pragmas_Before (M);
- Mod_Val : Uint;
AtM_Nod : Node_Id;
+ Mod_Val : Uint;
+ pragma Warnings (Off, Mod_Val);
+
begin
+ Check_Restriction (No_Obsolescent_Features, Mod_Clause (N));
+
+ if Warn_On_Obsolescent_Feature then
+ Error_Msg_N
+ ("mod clause is an obsolescent feature ('R'M 'J.8)?", N);
+ Error_Msg_N
+ ("\use alignment attribute definition clause instead?", N);
+ end if;
+
if Present (P) then
Analyze_List (P);
end if;
- -- In Tree_Output mode, expansion is disabled, but we must
+ -- 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.
if Operating_Mode = Check_Semantics
- and then Tree_Output
+ and then ASIS_Mode
then
AtM_Nod :=
Make_Attribute_Definition_Clause (Loc,
-- Clear any existing component clauses for the type (this happens
-- with derived types, where we are now overriding the original)
- Fent := First_Entity (Rectype);
-
- Comp := Fent;
+ Comp := First_Component_Or_Discriminant (Rectype);
while Present (Comp) loop
- if Ekind (Comp) = E_Component
- or else Ekind (Comp) = E_Discriminant
- then
- Set_Component_Clause (Comp, Empty);
- end if;
-
- Next_Entity (Comp);
+ Set_Component_Clause (Comp, Empty);
+ Next_Component_Or_Discriminant (Comp);
end loop;
-- All done if no component clauses
-- 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
then
while Present (CC) loop
- -- If pragma, just analyze it
+ -- Pragma
if Nkind (CC) = N_Pragma then
Analyze (CC);
+ -- The only pragma of interest is Complete_Representation
+
+ if Chars (CC) = Name_Complete_Representation then
+ CR_Pragma := CC;
+ end if;
+
-- Processing for real component clause
else
-- tag to get an explicit position.
elsif Nkind (Component_Name (CC)) = N_Attribute_Reference then
-
if Attribute_Name (Component_Name (CC)) = Name_Tag then
Error_Msg_N ("position of tag cannot be specified", CC);
else
("component clause previously given#", CC);
else
- -- Update Fbit and Lbit to the actual bit number.
+ -- Update Fbit and Lbit to the actual bit number
Fbit := Fbit + UI_From_Int (SSU) * Posit;
Lbit := Lbit + UI_From_Int (SSU) * Posit;
CC, Rectype);
end if;
- -- Test for large object that is not on a byte
- -- boundary, defined as a large packed array not
- -- represented by a modular type, or an object for
- -- which a size of greater than 64 bits is specified.
-
- if Fbit mod SSU /= 0 then
- if (Is_Packed_Array_Type (Etype (Comp))
- and then Is_Array_Type
- (Packed_Array_Type (Etype (Comp))))
- or else Esize (Etype (Comp)) > 64
- then
- Error_Msg_N
- ("large component must be on byte boundary",
- First_Bit (CC));
- end if;
- end if;
-
- -- This information is also set in the
- -- corresponding component of the base type,
- -- found by accessing the Original_Record_Component
- -- link if it is present.
+ -- This information is also set in the corresponding
+ -- component of the base type, found by accessing the
+ -- Original_Record_Component link if it is present.
Ocomp := Original_Record_Component (Comp);
then
-- Nothing to do if at least one component with no component clause
- 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
- return;
- end if;
- end if;
-
- Next_Entity (Comp);
+ exit when No (Component_Clause (Comp));
+ Next_Component_Or_Discriminant (Comp);
end loop;
-- If we fall out of loop, all components have component clauses
-- and so we can set the size to the maximum value.
- Set_RM_Size (Rectype, Hbit + 1);
+ if No (Comp) then
+ Set_RM_Size (Rectype, Hbit + 1);
+ end if;
end if;
+ -- Check missing components if Complete_Representation pragma appeared
+
+ if Present (CR_Pragma) then
+ Comp := First_Component_Or_Discriminant (Rectype);
+ while Present (Comp) loop
+ if No (Component_Clause (Comp)) then
+ Error_Msg_NE
+ ("missing component clause for &", CR_Pragma, Comp);
+ end if;
+
+ Next_Component_Or_Discriminant (Comp);
+ end loop;
+ end if;
end Analyze_Record_Representation_Clause;
-----------------------------
--------------------------
procedure Check_Expr_Constants (Nod : Node_Id) is
+ Loc_U_Ent : constant Source_Ptr := Sloc (U_Ent);
+ Ent : Entity_Id := Empty;
+
begin
if Nkind (Nod) in N_Has_Etype
and then Etype (Nod) = Any_Type
return;
when N_Identifier | N_Expanded_Name =>
- declare
- Ent : constant Entity_Id := Entity (Nod);
- Loc_Ent : constant Source_Ptr := Sloc (Ent);
- Loc_U_Ent : constant Source_Ptr := Sloc (U_Ent);
+ Ent := Entity (Nod);
- begin
- if Ekind (Ent) = E_Named_Integer
- or else
- Ekind (Ent) = E_Named_Real
- or else
- Is_Type (Ent)
+ -- We need to look at the original node if it is different
+ -- from the node, since we may have rewritten things and
+ -- substituted an identifier representing the rewrite.
+
+ if Original_Node (Nod) /= Nod then
+ Check_Expr_Constants (Original_Node (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.
+
+ if Ekind (Ent) = E_Variable
+ and then Nkind (Declaration_Node (Ent))
+ = N_Object_Declaration
+ and then
+ No (Expression (Declaration_Node (Ent)))
then
- return;
+ Error_Msg_NE
+ ("invalid address clause for initialized object &!",
+ Nod, U_Ent);
+
+ -- If entity is constant, it may be the result of expanding
+ -- a check. We must verify that its declaration appears
+ -- before the object in question, else we also reject the
+ -- address clause.
- elsif
- Ekind (Ent) = E_Constant
- or else
- Ekind (Ent) = E_In_Parameter
+ elsif Ekind (Ent) = E_Constant
+ and then In_Same_Source_Unit (Ent, U_Ent)
+ and then Sloc (Ent) > Loc_U_Ent
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.
+ Error_Msg_NE
+ ("invalid address clause for initialized object &!",
+ Nod, U_Ent);
+ end if;
+
+ return;
+ end if;
+
+ -- Otherwise look at the identifier and see if it is OK
- if not In_Same_Source_Unit (Ent, U_Ent) then
- return;
+ if Ekind (Ent) = E_Named_Integer
+ or else
+ Ekind (Ent) = E_Named_Real
+ or else
+ Is_Type (Ent)
+ then
+ return;
- -- Otherwise location of Ent must be before the
- -- location of U_Ent, that's what prior defined means.
+ elsif
+ Ekind (Ent) = E_Constant
+ 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.
- elsif Loc_Ent < Loc_U_Ent then
- return;
+ if not In_Same_Source_Unit (Ent, U_Ent) then
+ return;
- else
- 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);
- end if;
+ -- Otherwise location of Ent must be before the
+ -- location of U_Ent, that's what prior defined means.
- elsif Nkind (Original_Node (Nod)) = N_Function_Call then
- Check_Expr_Constants (Original_Node (Nod));
+ elsif Sloc (Ent) < Loc_U_Ent then
+ return;
else
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
- ("\reference to variable% not allowed ('R'M 13.1(22))!",
+ ("\% must be defined before % ('R'M 13.1(22))!",
Nod);
end if;
- end;
- when N_Integer_Literal |
- N_Real_Literal |
+ elsif Nkind (Original_Node (Nod)) = N_Function_Call then
+ Check_Expr_Constants (Original_Node (Nod));
+
+ else
+ Error_Msg_NE
+ ("invalid address clause for initialized object &!",
+ 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);
+ else
+ Error_Msg_N
+ ("non-static expression not allowed"
+ & " ('R'M 13.1(22))!", Nod);
+ end if;
+ end if;
+
+ when N_Integer_Literal =>
+
+ -- If this is a rewritten unchecked conversion, in a system
+ -- where Address is an integer type, always use the base type
+ -- for a literal value. This is user-friendly and prevents
+ -- order-of-elaboration issues with instances of unchecked
+ -- conversion.
+
+ if Nkind (Original_Node (Nod)) = N_Function_Call then
+ Set_Etype (Nod, Base_Type (Etype (Nod)));
+ end if;
+
+ when N_Real_Literal |
N_String_Literal |
N_Character_Literal =>
return;
Check_Expr_Constants (Prefix (Nod));
when N_Attribute_Reference =>
-
- if (Attribute_Name (Nod) = Name_Address
+ if Attribute_Name (Nod) = Name_Address
+ or else
+ Attribute_Name (Nod) = Name_Access
or else
- Attribute_Name (Nod) = Name_Access
+ Attribute_Name (Nod) = Name_Unchecked_Access
or else
- Attribute_Name (Nod) = Name_Unchecked_Access
- or else
- Attribute_Name (Nod) = Name_Unrestricted_Access)
+ Attribute_Name (Nod) = Name_Unrestricted_Access
then
Check_At_Constant_Address (Prefix (Nod));
when N_Null =>
return;
- when N_Binary_Op | N_And_Then | N_Or_Else | N_In | N_Not_In =>
+ when N_Binary_Op | N_And_Then | N_Or_Else | N_Membership_Test =>
Check_Expr_Constants (Left_Opnd (Nod));
Check_Expr_Constants (Right_Opnd (Nod));
begin
Biased := False;
- -- Immediate return if size is same as standard size or if composite
- -- item, or generic type, or type with previous errors.
+ -- Dismiss cases for generic types or types with previous errors
if No (UT)
or else UT = Any_Type
or else Is_Generic_Type (UT)
or else Is_Generic_Type (Root_Type (UT))
- or else Is_Composite_Type (UT)
- or else (Known_Esize (UT) and then Siz = Esize (UT))
then
return;
+ -- Check case of bit packed array
+
+ elsif Is_Array_Type (UT)
+ and then Known_Static_Component_Size (UT)
+ and then Is_Bit_Packed_Array (UT)
+ then
+ declare
+ Asiz : Uint;
+ Indx : Node_Id;
+ Ityp : Entity_Id;
+
+ begin
+ Asiz := Component_Size (UT);
+ Indx := First_Index (UT);
+ loop
+ Ityp := Etype (Indx);
+
+ -- If non-static bound, then we are not in the business of
+ -- trying to check the length, and indeed an error will be
+ -- issued elsewhere, since sizes of non-static array types
+ -- cannot be set implicitly or explicitly.
+
+ if not Is_Static_Subtype (Ityp) then
+ return;
+ end if;
+
+ -- Otherwise accumulate next dimension
+
+ Asiz := Asiz * (Expr_Value (Type_High_Bound (Ityp)) -
+ Expr_Value (Type_Low_Bound (Ityp)) +
+ Uint_1);
+
+ Next_Index (Indx);
+ exit when No (Indx);
+ end loop;
+
+ if Asiz <= Siz then
+ return;
+ else
+ Error_Msg_Uint_1 := Asiz;
+ Error_Msg_NE
+ ("size for& too small, minimum allowed is ^", N, T);
+ Set_Esize (T, Asiz);
+ Set_RM_Size (T, Asiz);
+ end if;
+ end;
+
+ -- All other composite types are ignored
+
+ elsif Is_Composite_Type (UT) then
+ return;
+
-- For fixed-point types, don't check minimum if type is not frozen,
- -- since type is not known till then
- -- at freeze time.
+ -- since we don't know all the characteristics of the type that can
+ -- affect the size (e.g. a specified small) till freeze time.
elsif Is_Fixed_Point_Type (UT)
and then not Is_Frozen (UT)
-- Cases for which a minimum check is required
else
+ -- Ignore if specified size is correct for the type
+
+ if Known_Esize (UT) and then Siz = Esize (UT) then
+ return;
+ end if;
+
+ -- Otherwise get minimum size
+
M := UI_From_Int (Minimum_Size (UT));
if Siz < M then
Error_Msg_Uint_1 := M;
Error_Msg_NE
("size for& too small, minimum allowed is ^", N, T);
+ Set_Esize (T, M);
+ Set_RM_Size (T, M);
else
Biased := True;
end if;
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 --
------------------
function Minimum_Size
(T : Entity_Id;
- Biased : Boolean := False)
- return Nat
+ Biased : Boolean := False) return Nat
is
Lo : Uint := No_Uint;
Hi : Uint := No_Uint;
then
return 0;
- -- Access types
+ -- Access types. Normally an access type cannot have a size smaller
+ -- than the size of System.Address. The exception is on VMS, where
+ -- 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.
elsif Is_Access_Type (T) then
- return System_Address_Size;
+ if OpenVMS_On_Target then
+ return 0;
+ else
+ return System_Address_Size;
+ end if;
-- Floating-point types
raise Program_Error;
end if;
- -- Fall through with Hi and Lo set. Deal with biased case.
+ -- Fall through with Hi and Lo set. Deal with biased case
if (Biased and then not Is_Fixed_Point_Type (T))
or else Has_Biased_Representation (T)
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 : Name_Id)
+ 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);
Subp_Id : Entity_Id;
Subp_Decl : Node_Id;
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.
-- Build_Spec --
----------------
- function Build_Spec return Node_Id is
+ 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, Nam);
-
- 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)))),
-
- Subtype_Mark =>
- New_Reference_To (Etyp, Loc));
- end Build_Spec;
+ Subp_Id := Make_Defining_Identifier (Loc, Sname);
+
+ -- 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) and then not Is_Limited_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 : Name_Id;
- Out_P : Boolean := False)
- is
- Loc : constant Source_Ptr := Sloc (N);
- 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.
-
- function Build_Spec return Node_Id is
- begin
- Subp_Id := Make_Defining_Identifier (Loc, Nam);
-
- 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_Function
-
- 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 for 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) and then not Is_Limited_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;
-
- ---------------------
- -- Record_Rep_Item --
- ---------------------
-
- procedure Record_Rep_Item (T : Entity_Id; N : Node_Id) is
- begin
- Set_Next_Rep_Item (N, First_Rep_Item (T));
- Set_First_Rep_Item (T, N);
- end Record_Rep_Item;
+ end New_Stream_Subprogram;
------------------------
-- Rep_Item_Too_Early --
------------------------
- function Rep_Item_Too_Early
- (T : Entity_Id;
- N : Node_Id)
- return Boolean
- is
+ 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;
function Rep_Item_Too_Late
(T : Entity_Id;
N : Node_Id;
- FOnly : Boolean := False)
- return Boolean
+ FOnly : Boolean := False) return Boolean
is
S : Entity_Id;
Parent_Type : Entity_Id;
procedure Too_Late;
- -- Output the too late message
+ -- Output the too late message. Note that this is not considered a
+ -- serious error, since the effect is simply that we ignore the
+ -- representation clause in this case.
+
+ --------------
+ -- Too_Late --
+ --------------
procedure Too_Late is
begin
- Error_Msg_N ("representation item appears too late!", N);
+ Error_Msg_N ("|representation item appears too late!", N);
end Too_Late;
-- Start of processing for Rep_Item_Too_Late
if Present (Freeze_Node (S)) then
Error_Msg_NE
- ("?no more representation items for }!", Freeze_Node (S), S);
+ ("?no more representation items for }", Freeze_Node (S), S);
end if;
return True;
-- CD1 and CD2 are either components or discriminants. This
-- function tests whether the two have the same representation
+ --------------
+ -- Same_Rep --
+ --------------
+
function Same_Rep return Boolean is
begin
if No (Component_Clause (CD1)) then
CD1 := First_Discriminant (T1);
CD2 := First_Discriminant (T2);
- while Present (CD1) loop
+ -- The number of discriminants may be different if the
+ -- derived type has fewer (constrained by values). The
+ -- invisible discriminants retain the representation of
+ -- the original, so the discrepancy does not per se
+ -- indicate a different representation.
+
+ while Present (CD1)
+ and then Present (CD2)
+ loop
if not Same_Rep then
return False;
else
-- For enumeration types, we must check each literal to see if the
-- representation is the same. Note that we do not permit enumeration
- -- representation clauses for Character and Wide_Character, so these
+ -- reprsentation clauses for Character and Wide_Character, so these
-- cases were already dealt with.
elsif Is_Enumeration_Type (T1) then
else
return True;
end if;
-
end Same_Representation;
--------------------
else
Init_Esize (T, Sz);
end if;
-
end Set_Enum_Esize;
-----------------------------------
-- 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,
+ Source => Source,
+ Target => Target));
+
+ -- If both sizes are known statically now, then back end annotation
+ -- is not required to do a proper check but if either size is not
+ -- known statically, then we need the annotation.
+
+ if Known_Static_RM_Size (Source)
+ and then Known_Static_RM_Size (Target)
+ then
+ null;
+ else
+ Back_Annotate_Rep_Info := True;
+ 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 Is_Access_Type (Target) and then
+ In_Same_Source_Unit (Target, N)
+ then
+ Set_No_Strict_Aliasing (Implementation_Base_Type (Target));
+ end if;
+
+ -- 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
+ -- if we have full expansion and the back end is called ???
+
+ Vnode :=
+ Make_Validate_Unchecked_Conversion (Sloc (N));
+ Set_Source_Type (Vnode, Source);
+ Set_Target_Type (Vnode, Target);
- Unchecked_Conversions.Append
- (New_Val => UC_Entry'
- (Enode => N,
- Source => Source,
- Target => Target));
-
- -- Generate N_Validate_Unchecked_Conversion node for back end if
- -- the back end needs to perform special validation checks. At the
- -- current time, only the JVM version requires such checks.
-
- if Java_VM then
- Vnode :=
- Make_Validate_Unchecked_Conversion (Sloc (N));
- 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 Is_List_Member (N) then
Insert_After (N, Vnode);
end if;
end Validate_Unchecked_Conversion;
Target_Siz := RM_Size (Target);
if Source_Siz /= Target_Siz then
- Warn_On_Instance := True;
Error_Msg_N
("types for unchecked conversion have different sizes?",
Enode);
("\^ high order bits of source will be ignored?",
Enode);
- elsif Is_Modular_Integer_Type (Source) then
+ elsif Is_Unsigned_Type (Source) then
Error_Msg_N
("\source will be extended with ^ high order " &
"zero bits?", Enode);
Enode);
end if;
end if;
-
- Warn_On_Instance := False;
end if;
end if;
if Source_Align < Target_Align
and then not Is_Tagged_Type (D_Source)
then
- Warn_On_Instance := True;
Error_Msg_Uint_1 := Target_Align;
Error_Msg_Uint_2 := Source_Align;
Error_Msg_Node_2 := D_Source;
("\resulting access value may have invalid " &
"alignment?", Enode);
end if;
-
- Warn_On_Instance := False;
end if;
end;
end if;
end loop;
end Validate_Unchecked_Conversions;
- ------------------
- -- Warn_Overlay --
- ------------------
-
- procedure Warn_Overlay
- (Expr : Node_Id;
- Typ : Entity_Id;
- Nam : Node_Id)
- is
- Old : Entity_Id := Empty;
- Decl : Node_Id;
-
- begin
- if not Address_Clause_Overlay_Warnings then
- return;
- end if;
-
- if Present (Expr)
- and then (Has_Non_Null_Base_Init_Proc (Typ)
- or else Is_Access_Type (Typ))
- and then not Is_Imported (Entity (Nam))
- then
- if Nkind (Expr) = N_Attribute_Reference
- and then Is_Entity_Name (Prefix (Expr))
- then
- Old := Entity (Prefix (Expr));
-
- elsif Is_Entity_Name (Expr)
- and then Ekind (Entity (Expr)) = E_Constant
- then
- Decl := Declaration_Node (Entity (Expr));
-
- if Nkind (Decl) = N_Object_Declaration
- and then Present (Expression (Decl))
- and then Nkind (Expression (Decl)) = N_Attribute_Reference
- and then Is_Entity_Name (Prefix (Expression (Decl)))
- then
- Old := Entity (Prefix (Expression (Decl)));
-
- elsif Nkind (Expr) = N_Function_Call then
- return;
- end if;
-
- -- A function call (most likely to To_Address) is probably not
- -- an overlay, so skip warning. Ditto if the function call was
- -- inlined and transformed into an entity.
-
- elsif Nkind (Original_Node (Expr)) = N_Function_Call then
- return;
- end if;
-
- Decl := Next (Parent (Expr));
-
- -- If a pragma Import follows, we assume that it is for the current
- -- target of the address clause, and skip the warning.
-
- if Present (Decl)
- and then Nkind (Decl) = N_Pragma
- and then Chars (Decl) = Name_Import
- then
- return;
- end if;
-
- if Present (Old) then
- Error_Msg_Node_2 := Old;
- Error_Msg_N
- ("default initialization of & may modify &?",
- Nam);
- else
- Error_Msg_N
- ("default initialization of & may modify overlaid storage?",
- Nam);
- end if;
-
- -- Add friendly warning if initialization comes from a packed array
- -- component.
-
- if Is_Record_Type (Typ) then
- declare
- Comp : Entity_Id;
-
- begin
- Comp := First_Component (Typ);
-
- while Present (Comp) loop
- if Nkind (Parent (Comp)) = N_Component_Declaration
- and then Present (Expression (Parent (Comp)))
- then
- exit;
- elsif Is_Array_Type (Etype (Comp))
- and then Present (Packed_Array_Type (Etype (Comp)))
- then
- Error_Msg_NE
- ("packed array component& will be initialized to zero?",
- Nam, Comp);
- exit;
- else
- Next_Component (Comp);
- end if;
- end loop;
- end;
- end if;
-
- Error_Msg_N
- ("use pragma Import for & to " &
- "suppress initialization ('R'M B.1(24))?",
- Nam);
- end if;
- end Warn_Overlay;
-
end Sem_Ch13;
OSDN Git Service
