-- --
-- B o d y --
-- --
--- Copyright (C) 1992-2004, Free Software Foundation, Inc. --
+-- Copyright (C) 1992-2010, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
--- ware Foundation; either version 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, 59 Temple Place - Suite 330, Boston, --
--- MA 02111-1307, USA. --
+-- or FITNESS FOR A PARTICULAR PURPOSE. --
+-- --
+-- You should have received a copy of the GNU General Public License along --
+-- with this program; see file COPYING3. If not see --
+-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
with Einfo; use Einfo;
with Elists; use Elists;
with Errout; use Errout;
+with Exp_Ch3; use Exp_Ch3;
with Exp_Ch7; use Exp_Ch7;
-with Exp_Ch11; use Exp_Ch11;
+with Exp_Disp; use Exp_Disp;
with Exp_Pakd; use Exp_Pakd;
with Exp_Util; use Exp_Util;
with Exp_Tss; use Exp_Tss;
with Layout; use Layout;
-with Lib.Xref; use Lib.Xref;
+with Lib; use Lib;
+with Namet; use Namet;
with Nlists; use Nlists;
with Nmake; use Nmake;
with Opt; use Opt;
with Restrict; use Restrict;
with Rident; use Rident;
with Sem; use Sem;
+with Sem_Aux; use Sem_Aux;
with Sem_Cat; use Sem_Cat;
with Sem_Ch6; use Sem_Ch6;
with Sem_Ch7; use Sem_Ch7;
(Decl : Node_Id;
New_S : Entity_Id;
After : in out Node_Id);
- -- Build body for a renaming declaration, insert in tree and analyze.
+ -- Build body for a renaming declaration, insert in tree and analyze
procedure Check_Address_Clause (E : Entity_Id);
-- Apply legality checks to address clauses for object declarations,
-- setting of Debug_Info_Needed for the entity. This flag is set if
-- the entity comes from source, or if we are in Debug_Generated_Code
-- mode or if the -gnatdV debug flag is set. However, it never sets
- -- the flag if Debug_Info_Off is set.
+ -- the flag if Debug_Info_Off is set. This procedure also ensures that
+ -- subsidiary entities have the flag set as required.
- procedure Set_Debug_Info_Needed (T : Entity_Id);
- -- Sets the Debug_Info_Needed flag on entity T if not already set, and
- -- also on any entities that are needed by T (for an object, the type
- -- of the object is needed, and for a type, the subsidiary types are
- -- needed -- see body for details). Never has any effect on T if the
- -- Debug_Info_Off flag is set.
+ procedure Undelay_Type (T : Entity_Id);
+ -- T is a type of a component that we know to be an Itype.
+ -- We don't want this to have a Freeze_Node, so ensure it doesn't.
+ -- Do the same for any Full_View or Corresponding_Record_Type.
procedure Warn_Overlay
(Expr : Node_Id;
New_S : Entity_Id;
After : in out Node_Id)
is
- Body_Node : constant Node_Id := Build_Renamed_Body (Decl, New_S);
+ Body_Decl : constant Node_Id := Unit_Declaration_Node (New_S);
+ Ent : constant Entity_Id := Defining_Entity (Decl);
+ Body_Node : Node_Id;
+ Renamed_Subp : Entity_Id;
begin
- Insert_After (After, Body_Node);
- Mark_Rewrite_Insertion (Body_Node);
- Analyze (Body_Node);
- After := Body_Node;
+ -- If the renamed subprogram is intrinsic, there is no need for a
+ -- wrapper body: we set the alias that will be called and expanded which
+ -- completes the declaration. This transformation is only legal if the
+ -- renamed entity has already been elaborated.
+
+ -- Note that it is legal for a renaming_as_body to rename an intrinsic
+ -- subprogram, as long as the renaming occurs before the new entity
+ -- is frozen. See RM 8.5.4 (5).
+
+ if Nkind (Body_Decl) = N_Subprogram_Renaming_Declaration
+ and then Is_Entity_Name (Name (Body_Decl))
+ then
+ Renamed_Subp := Entity (Name (Body_Decl));
+ else
+ Renamed_Subp := Empty;
+ end if;
+
+ if Present (Renamed_Subp)
+ and then Is_Intrinsic_Subprogram (Renamed_Subp)
+ and then
+ (not In_Same_Source_Unit (Renamed_Subp, Ent)
+ or else Sloc (Renamed_Subp) < Sloc (Ent))
+
+ -- We can make the renaming entity intrisic if the renamed function
+ -- has an interface name, or if it is one of the shift/rotate
+ -- operations known to the compiler.
+
+ and then (Present (Interface_Name (Renamed_Subp))
+ or else Chars (Renamed_Subp) = Name_Rotate_Left
+ or else Chars (Renamed_Subp) = Name_Rotate_Right
+ or else Chars (Renamed_Subp) = Name_Shift_Left
+ or else Chars (Renamed_Subp) = Name_Shift_Right
+ or else Chars (Renamed_Subp) = Name_Shift_Right_Arithmetic)
+ then
+ Set_Interface_Name (Ent, Interface_Name (Renamed_Subp));
+
+ if Present (Alias (Renamed_Subp)) then
+ Set_Alias (Ent, Alias (Renamed_Subp));
+ else
+ Set_Alias (Ent, Renamed_Subp);
+ end if;
+
+ Set_Is_Intrinsic_Subprogram (Ent);
+ Set_Has_Completion (Ent);
+
+ else
+ Body_Node := Build_Renamed_Body (Decl, New_S);
+ Insert_After (After, Body_Node);
+ Mark_Rewrite_Insertion (Body_Node);
+ Analyze (Body_Node);
+ After := Body_Node;
+ end if;
end Build_And_Analyze_Renamed_Body;
------------------------
New_S : Entity_Id) return Node_Id
is
Loc : constant Source_Ptr := Sloc (New_S);
- -- We use for the source location of the renamed body, the location
- -- of the spec entity. It might seem more natural to use the location
- -- of the renaming declaration itself, but that would be wrong, since
- -- then the body we create would look as though it was created far
- -- too late, and this could cause problems with elaboration order
- -- analysis, particularly in connection with instantiations.
+ -- We use for the source location of the renamed body, the location of
+ -- the spec entity. It might seem more natural to use the location of
+ -- the renaming declaration itself, but that would be wrong, since then
+ -- the body we create would look as though it was created far too late,
+ -- and this could cause problems with elaboration order analysis,
+ -- particularly in connection with instantiations.
N : constant Node_Id := Unit_Declaration_Node (New_S);
Nam : constant Node_Id := Name (N);
O_Formal : Entity_Id;
Param_Spec : Node_Id;
+ Pref : Node_Id := Empty;
+ -- If the renamed entity is a primitive operation given in prefix form,
+ -- the prefix is the target object and it has to be added as the first
+ -- actual in the generated call.
+
begin
- -- Determine the entity being renamed, which is the target of the
- -- call statement. If the name is an explicit dereference, this is
- -- a renaming of a subprogram type rather than a subprogram. The
- -- name itself is fully analyzed.
+ -- Determine the entity being renamed, which is the target of the call
+ -- statement. If the name is an explicit dereference, this is a renaming
+ -- of a subprogram type rather than a subprogram. The name itself is
+ -- fully analyzed.
if Nkind (Nam) = N_Selected_Component then
Old_S := Entity (Selector_Name (Nam));
if Is_Entity_Name (Nam) then
- -- If the renamed entity is a predefined operator, retain full
- -- name to ensure its visibility.
+ -- If the renamed entity is a predefined operator, retain full name
+ -- to ensure its visibility.
if Ekind (Old_S) = E_Operator
and then Nkind (Nam) = N_Expanded_Name
end if;
else
- Call_Name := New_Copy (Name (N));
+ if Nkind (Nam) = N_Selected_Component
+ and then Present (First_Formal (Old_S))
+ and then
+ (Is_Controlling_Formal (First_Formal (Old_S))
+ or else Is_Class_Wide_Type (Etype (First_Formal (Old_S))))
+ then
+
+ -- Retrieve the target object, to be added as a first actual
+ -- in the call.
+
+ Call_Name := New_Occurrence_Of (Old_S, Loc);
+ Pref := Prefix (Nam);
+
+ else
+ Call_Name := New_Copy (Name (N));
+ end if;
- -- The original name may have been overloaded, but
- -- is fully resolved now.
+ -- Original name may have been overloaded, but is fully resolved now
Set_Is_Overloaded (Call_Name, False);
end if;
- -- For simple renamings, subsequent calls can be expanded directly
- -- as called to the renamed entity. The body must be generated in
- -- any case for calls they may appear elsewhere.
+ -- For simple renamings, subsequent calls can be expanded directly as
+ -- calls to the renamed entity. The body must be generated in any case
+ -- for calls that may appear elsewhere.
- if (Ekind (Old_S) = E_Function
- or else Ekind (Old_S) = E_Procedure)
+ if Ekind_In (Old_S, E_Function, E_Procedure)
and then Nkind (Decl) = N_Subprogram_Declaration
then
Set_Body_To_Inline (Decl, Old_S);
Formal := First_Formal (Defining_Entity (Decl));
- if Present (Formal) then
+ if Present (Pref) then
+ declare
+ Pref_Type : constant Entity_Id := Etype (Pref);
+ Form_Type : constant Entity_Id := Etype (First_Formal (Old_S));
+
+ begin
+ -- The controlling formal may be an access parameter, or the
+ -- actual may be an access value, so adjust accordingly.
+
+ if Is_Access_Type (Pref_Type)
+ and then not Is_Access_Type (Form_Type)
+ then
+ Actuals := New_List
+ (Make_Explicit_Dereference (Loc, Relocate_Node (Pref)));
+
+ elsif Is_Access_Type (Form_Type)
+ and then not Is_Access_Type (Pref)
+ then
+ Actuals := New_List
+ (Make_Attribute_Reference (Loc,
+ Attribute_Name => Name_Access,
+ Prefix => Relocate_Node (Pref)));
+ else
+ Actuals := New_List (Pref);
+ end if;
+ end;
+
+ elsif Present (Formal) then
Actuals := New_List;
+ else
+ Actuals := No_List;
+ end if;
+
+ if Present (Formal) then
while Present (Formal) loop
Append (New_Reference_To (Formal, Loc), Actuals);
Next_Formal (Formal);
end loop;
end if;
- -- If the renamed entity is an entry, inherit its profile. For
- -- other renamings as bodies, both profiles must be subtype
- -- conformant, so it is not necessary to replace the profile given
- -- in the declaration. However, default values that are aggregates
- -- are rewritten when partially analyzed, so we recover the original
- -- aggregate to insure that subsequent conformity checking works.
- -- Similarly, if the default expression was constant-folded, recover
- -- the original expression.
+ -- If the renamed entity is an entry, inherit its profile. For other
+ -- renamings as bodies, both profiles must be subtype conformant, so it
+ -- is not necessary to replace the profile given in the declaration.
+ -- However, default values that are aggregates are rewritten when
+ -- partially analyzed, so we recover the original aggregate to insure
+ -- that subsequent conformity checking works. Similarly, if the default
+ -- expression was constant-folded, recover the original expression.
Formal := First_Formal (Defining_Entity (Decl));
if Present (Formal) then
O_Formal := First_Formal (Old_S);
Param_Spec := First (Parameter_Specifications (Spec));
-
while Present (Formal) loop
if Is_Entry (Old_S) then
-
if Nkind (Parameter_Type (Param_Spec)) /=
N_Access_Definition
then
and then Etype (Old_S) /= Standard_Void_Type)
then
Call_Node :=
- Make_Return_Statement (Loc,
+ Make_Simple_Return_Statement (Loc,
Expression =>
Make_Function_Call (Loc,
Name => Call_Name,
elsif Ekind (Old_S) = E_Enumeration_Literal then
Call_Node :=
- Make_Return_Statement (Loc,
+ Make_Simple_Return_Statement (Loc,
Expression => New_Occurrence_Of (Old_S, Loc));
elsif Nkind (Nam) = N_Character_Literal then
Call_Node :=
- Make_Return_Statement (Loc,
+ Make_Simple_Return_Statement (Loc,
Expression => Call_Name);
else
Parameter_Associations => Actuals);
end if;
- -- Create entities for subprogram body and formals.
+ -- Create entities for subprogram body and formals
Set_Defining_Unit_Name (Spec,
Make_Defining_Identifier (Loc, Chars => Chars (New_S)));
Param_Spec := First (Parameter_Specifications (Spec));
-
while Present (Param_Spec) loop
Set_Defining_Identifier (Param_Spec,
Make_Defining_Identifier (Loc,
end if;
-- Link the body to the entity whose declaration it completes. If
- -- the body is analyzed when the renamed entity is frozen, it may be
- -- necessary to restore the proper scope (see package Exp_Ch13).
+ -- the body is analyzed when the renamed entity is frozen, it may
+ -- be necessary to restore the proper scope (see package Exp_Ch13).
if Nkind (N) = N_Subprogram_Renaming_Declaration
and then Present (Corresponding_Spec (N))
if Present (Addr) then
Expr := Expression (Addr);
- -- If we have no initialization of any kind, then we don't
- -- need to place any restrictions on the address clause, because
- -- the object will be elaborated after the address clause is
- -- evaluated. This happens if the declaration has no initial
- -- expression, or the type has no implicit initialization, or
- -- the object is imported.
-
- -- The same holds for 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.
-
- -- If the type is controlled, code to attach the object to a
- -- finalization chain is generated at the point of declaration,
- -- and therefore the elaboration of the object cannot be delayed:
- -- the address expression must be a constant.
-
- if (No (Expression (Decl))
- and then not Controlled_Type (Typ)
- and then
- (not Has_Non_Null_Base_Init_Proc (Typ)
- or else Is_Imported (E)))
+ if Needs_Constant_Address (Decl, Typ) then
+ Check_Constant_Address_Clause (Expr, E);
- or else
- (Present (Expression (Decl))
- and then Is_Scalar_Type (Typ))
+ -- Has_Delayed_Freeze was set on E when the address clause was
+ -- analyzed. Reset the flag now unless freeze actions were
+ -- attached to it in the mean time.
- or else
- Is_Access_Type (Typ)
+ if No (Freeze_Node (E)) then
+ Set_Has_Delayed_Freeze (E, False);
+ end if;
+ end if;
- or else
- (Is_Bit_Packed_Array (Typ)
- and then
- Is_Modular_Integer_Type (Packed_Array_Type (Typ)))
- then
- null;
+ -- If Rep_Clauses are to be ignored, remove address clause from
+ -- list attached to entity, because it may be illegal for gigi,
+ -- for example by breaking order of elaboration..
- -- Otherwise, we require the address clause to be constant
- -- because the call to the initialization procedure (or the
- -- attach code) has to happen at the point of the declaration.
+ if Ignore_Rep_Clauses then
+ declare
+ Rep : Node_Id;
- else
- Check_Constant_Address_Clause (Expr, E);
- Set_Has_Delayed_Freeze (E, False);
- end if;
+ begin
+ Rep := First_Rep_Item (E);
+
+ if Rep = Addr then
+ Set_First_Rep_Item (E, Next_Rep_Item (Addr));
+
+ else
+ while Present (Rep)
+ and then Next_Rep_Item (Rep) /= Addr
+ loop
+ Rep := Next_Rep_Item (Rep);
+ end loop;
+ end if;
+
+ if Present (Rep) then
+ Set_Next_Rep_Item (Rep, Next_Rep_Item (Addr));
+ end if;
+ end;
- if not Error_Posted (Expr)
- and then not Controlled_Type (Typ)
+ Rewrite (Addr, Make_Null_Statement (Sloc (E)));
+
+ elsif not Error_Posted (Expr)
+ and then not Needs_Finalization (Typ)
then
Warn_Overlay (Expr, Typ, Name (Addr));
end if;
procedure Check_Compile_Time_Size (T : Entity_Id) is
- procedure Set_Small_Size (S : Uint);
+ procedure Set_Small_Size (T : Entity_Id; S : Uint);
-- Sets the compile time known size (32 bits or less) in the Esize
- -- field, checking for a size clause that was given which attempts
- -- to give a smaller size.
+ -- field, of T checking for a size clause that was given which attempts
+ -- to give a smaller size, and also checking for an alignment clause.
function Size_Known (T : Entity_Id) return Boolean;
-- Recursive function that does all the work
-- Set_Small_Size --
--------------------
- procedure Set_Small_Size (S : Uint) is
+ procedure Set_Small_Size (T : Entity_Id; S : Uint) is
begin
if S > 32 then
return;
+ -- Don't bother if alignment clause with a value other than 1 is
+ -- present, because size may be padded up to meet back end alignment
+ -- requirements, and only the back end knows the rules!
+
+ elsif Known_Alignment (T) and then Alignment (T) /= 1 then
+ return;
+
+ -- Check for bad size clause given
+
elsif Has_Size_Clause (T) then
if RM_Size (T) < S then
Error_Msg_Uint_1 := S;
Error_Msg_NE
- ("size for & is too small, minimum is ^",
+ ("size for& too small, minimum allowed is ^",
Size_Clause (T), T);
elsif Unknown_Esize (T) then
if Size_Known_At_Compile_Time (T) then
return True;
+ -- Always True for scalar types. This is true even for generic formal
+ -- scalar types. We used to return False in the latter case, but the
+ -- size is known at compile time, even in the template, we just do
+ -- not know the exact size but that's not the point of this routine.
+
elsif Is_Scalar_Type (T)
or else Is_Task_Type (T)
then
- return not Is_Generic_Type (T);
+ return True;
+
+ -- Array types
elsif Is_Array_Type (T) then
+
+ -- String literals always have known size, and we can set it
+
if Ekind (T) = E_String_Literal_Subtype then
- Set_Small_Size (Component_Size (T) * String_Literal_Length (T));
+ Set_Small_Size (T, Component_Size (T)
+ * String_Literal_Length (T));
return True;
+ -- Unconstrained types never have known at compile time size
+
elsif not Is_Constrained (T) then
return False;
- -- Don't do any recursion on type with error posted, since
- -- we may have a malformed type that leads us into a loop
+ -- Don't do any recursion on type with error posted, since we may
+ -- have a malformed type that leads us into a loop.
elsif Error_Posted (T) then
return False;
+ -- Otherwise if component size unknown, then array size unknown
+
elsif not Size_Known (Component_Type (T)) then
return False;
end if;
- -- Check for all indexes static, and also compute possible
- -- size (in case it is less than 32 and may be packable).
+ -- Check for all indexes static, and also compute possible size
+ -- (in case it is less than 32 and may be packable).
declare
Esiz : Uint := Component_Size (T);
Next_Index (Index);
end loop;
- Set_Small_Size (Esiz);
+ Set_Small_Size (T, Esiz);
return True;
end;
+ -- Access types always have known at compile time sizes
+
elsif Is_Access_Type (T) then
return True;
+ -- For non-generic private types, go to underlying type if present
+
elsif Is_Private_Type (T)
and then not Is_Generic_Type (T)
and then Present (Underlying_Type (T))
then
- -- Don't do any recursion on type with error posted, since
- -- we may have a malformed type that leads us into a loop
+ -- Don't do any recursion on type with error posted, since we may
+ -- have a malformed type that leads us into a loop.
if Error_Posted (T) then
return False;
return Size_Known (Underlying_Type (T));
end if;
+ -- Record types
+
elsif Is_Record_Type (T) then
-- A class-wide type is never considered to have a known size
then
return False;
- -- Don't do any recursion on type with error posted, since
- -- we may have a malformed type that leads us into a loop
+ -- Don't do any recursion on type with error posted, since we may
+ -- have a malformed type that leads us into a loop.
elsif Error_Posted (T) then
return False;
-- Now look at the components of the record
declare
- -- The following two variables are used to keep track of
- -- the size of packed records if we can tell the size of
- -- the packed record in the front end. Packed_Size_Known
- -- is True if so far we can figure out the size. It is
- -- initialized to True for a packed record, unless the
- -- record has discriminants. The reason we eliminate the
- -- discriminated case is that we don't know the way the
- -- back end lays out discriminated packed records. If
- -- Packed_Size_Known is True, then Packed_Size is the
- -- size in bits so far.
+ -- The following two variables are used to keep track of the
+ -- size of packed records if we can tell the size of the packed
+ -- record in the front end. Packed_Size_Known is True if so far
+ -- we can figure out the size. It is initialized to True for a
+ -- packed record, unless the record has discriminants. The
+ -- reason we eliminate the discriminated case is that we don't
+ -- know the way the back end lays out discriminated packed
+ -- records. If Packed_Size_Known is True, then Packed_Size is
+ -- the size in bits so far.
Packed_Size_Known : Boolean :=
Is_Packed (T)
and then Present (Parent (T))
and then Nkind (Parent (T)) = N_Full_Type_Declaration
and then Nkind (Type_Definition (Parent (T))) =
- N_Record_Definition
+ N_Record_Definition
and then not Null_Present (Type_Definition (Parent (T)))
and then Present (Variant_Part
(Component_List (Type_Definition (Parent (T)))))
if not Is_Constrained (T)
and then
- No (Discriminant_Default_Value
- (First_Discriminant (T)))
+ No (Discriminant_Default_Value (First_Discriminant (T)))
and then Unknown_Esize (T)
then
return False;
-- Loop through components
- Comp := First_Entity (T);
+ Comp := First_Component_Or_Discriminant (T);
while Present (Comp) loop
- if Ekind (Comp) = E_Component
- or else
- Ekind (Comp) = E_Discriminant
- then
- Ctyp := Etype (Comp);
+ Ctyp := Etype (Comp);
- -- We do not know the packed size if there is a
- -- component clause present (we possibly could,
- -- but this would only help in the case of a record
- -- with partial rep clauses. That's because in the
- -- case of full rep clauses, the size gets figured
- -- out anyway by a different circuit).
+ -- We do not know the packed size if there is a component
+ -- clause present (we possibly could, but this would only
+ -- help in the case of a record with partial rep clauses.
+ -- That's because in the case of full rep clauses, the
+ -- size gets figured out anyway by a different circuit).
- if Present (Component_Clause (Comp)) then
- Packed_Size_Known := False;
- end if;
+ if Present (Component_Clause (Comp)) then
+ Packed_Size_Known := False;
+ end if;
- -- We need to identify a component that is an array
- -- where the index type is an enumeration type with
- -- non-standard representation, and some bound of the
- -- type depends on a discriminant.
-
- -- This is because gigi computes the size by doing a
- -- substituation of the appropriate discriminant value
- -- in the size expression for the base type, and gigi
- -- is not clever enough to evaluate the resulting
- -- expression (which involves a call to rep_to_pos)
- -- at compile time.
-
- -- It would be nice if gigi would either recognize that
- -- this expression can be computed at compile time, or
- -- alternatively figured out the size from the subtype
- -- directly, where all the information is at hand ???
-
- if Is_Array_Type (Etype (Comp))
- and then Present (Packed_Array_Type (Etype (Comp)))
- then
- declare
- Ocomp : constant Entity_Id :=
- Original_Record_Component (Comp);
- OCtyp : constant Entity_Id := Etype (Ocomp);
- Ind : Node_Id;
- Indtyp : Entity_Id;
- Lo, Hi : Node_Id;
+ -- We need to identify a component that is an array where
+ -- the index type is an enumeration type with non-standard
+ -- representation, and some bound of the type depends on a
+ -- discriminant.
- begin
- Ind := First_Index (OCtyp);
- while Present (Ind) loop
- Indtyp := Etype (Ind);
+ -- This is because gigi computes the size by doing a
+ -- substitution of the appropriate discriminant value in
+ -- the size expression for the base type, and gigi is not
+ -- clever enough to evaluate the resulting expression (which
+ -- involves a call to rep_to_pos) at compile time.
- if Is_Enumeration_Type (Indtyp)
- and then Has_Non_Standard_Rep (Indtyp)
- then
- Lo := Type_Low_Bound (Indtyp);
- Hi := Type_High_Bound (Indtyp);
-
- if Is_Entity_Name (Lo)
- and then
- Ekind (Entity (Lo)) = E_Discriminant
- then
- return False;
-
- elsif Is_Entity_Name (Hi)
- and then
- Ekind (Entity (Hi)) = E_Discriminant
- then
- return False;
- end if;
- end if;
+ -- It would be nice if gigi would either recognize that
+ -- this expression can be computed at compile time, or
+ -- alternatively figured out the size from the subtype
+ -- directly, where all the information is at hand ???
- Next_Index (Ind);
- end loop;
- end;
- end if;
+ if Is_Array_Type (Etype (Comp))
+ and then Present (Packed_Array_Type (Etype (Comp)))
+ then
+ declare
+ Ocomp : constant Entity_Id :=
+ Original_Record_Component (Comp);
+ OCtyp : constant Entity_Id := Etype (Ocomp);
+ Ind : Node_Id;
+ Indtyp : Entity_Id;
+ Lo, Hi : Node_Id;
- -- Clearly size of record is not known if the size of
- -- one of the components is not known.
+ begin
+ Ind := First_Index (OCtyp);
+ while Present (Ind) loop
+ Indtyp := Etype (Ind);
- if not Size_Known (Ctyp) then
- return False;
- end if;
+ if Is_Enumeration_Type (Indtyp)
+ and then Has_Non_Standard_Rep (Indtyp)
+ then
+ Lo := Type_Low_Bound (Indtyp);
+ Hi := Type_High_Bound (Indtyp);
+
+ if Is_Entity_Name (Lo)
+ and then Ekind (Entity (Lo)) = E_Discriminant
+ then
+ return False;
- -- Accumulate packed size if possible
+ elsif Is_Entity_Name (Hi)
+ and then Ekind (Entity (Hi)) = E_Discriminant
+ then
+ return False;
+ end if;
+ end if;
- if Packed_Size_Known then
+ Next_Index (Ind);
+ end loop;
+ end;
+ end if;
- -- We can only deal with elementary types, since for
- -- non-elementary components, alignment enters into
- -- the picture, and we don't know enough to handle
- -- proper alignment in this context. Packed arrays
- -- count as elementary if the representation is a
- -- modular type.
+ -- Clearly size of record is not known if the size of one of
+ -- the components is not known.
- if Is_Elementary_Type (Ctyp)
- or else (Is_Array_Type (Ctyp)
- and then
- Present (Packed_Array_Type (Ctyp))
- and then
- Is_Modular_Integer_Type
- (Packed_Array_Type (Ctyp)))
- then
- -- If RM_Size is known and static, then we can
- -- keep accumulating the packed size.
+ if not Size_Known (Ctyp) then
+ return False;
+ end if;
- if Known_Static_RM_Size (Ctyp) then
+ -- Accumulate packed size if possible
- -- A little glitch, to be removed sometime ???
- -- gigi does not understand zero sizes yet.
+ if Packed_Size_Known then
- if RM_Size (Ctyp) = Uint_0 then
- Packed_Size_Known := False;
+ -- We can only deal with elementary types, since for
+ -- non-elementary components, alignment enters into the
+ -- picture, and we don't know enough to handle proper
+ -- alignment in this context. Packed arrays count as
+ -- elementary if the representation is a modular type.
- -- Normal case where we can keep accumulating
- -- the packed array size.
+ if Is_Elementary_Type (Ctyp)
+ or else (Is_Array_Type (Ctyp)
+ and then Present (Packed_Array_Type (Ctyp))
+ and then Is_Modular_Integer_Type
+ (Packed_Array_Type (Ctyp)))
+ then
+ -- If RM_Size is known and static, then we can keep
+ -- accumulating the packed size.
- else
- Packed_Size := Packed_Size + RM_Size (Ctyp);
- end if;
+ if Known_Static_RM_Size (Ctyp) then
- -- If we have a field whose RM_Size is not known
- -- then we can't figure out the packed size here.
+ -- A little glitch, to be removed sometime ???
+ -- gigi does not understand zero sizes yet.
- else
+ if RM_Size (Ctyp) = Uint_0 then
Packed_Size_Known := False;
+
+ -- Normal case where we can keep accumulating the
+ -- packed array size.
+
+ else
+ Packed_Size := Packed_Size + RM_Size (Ctyp);
end if;
- -- If we have a non-elementary type we can't figure
- -- out the packed array size (alignment issues).
+ -- If we have a field whose RM_Size is not known then
+ -- we can't figure out the packed size here.
else
Packed_Size_Known := False;
end if;
+
+ -- If we have a non-elementary type we can't figure out
+ -- the packed array size (alignment issues).
+
+ else
+ Packed_Size_Known := False;
end if;
end if;
- Next_Entity (Comp);
+ Next_Component_Or_Discriminant (Comp);
end loop;
if Packed_Size_Known then
- Set_Small_Size (Packed_Size);
+ Set_Small_Size (T, Packed_Size);
end if;
return True;
end;
+ -- All other cases, size not known at compile time
+
else
return False;
end if;
procedure Check_Debug_Info_Needed (T : Entity_Id) is
begin
- if Needs_Debug_Info (T) or else Debug_Info_Off (T) then
+ if Debug_Info_Off (T) then
return;
elsif Comes_From_Source (T)
or else Debug_Generated_Code
or else Debug_Flag_VV
+ or else Needs_Debug_Info (T)
then
Set_Debug_Info_Needed (T);
end if;
-- Do not attempt to analyze case where range was in error
- if Error_Posted (Scalar_Range (E)) then
+ if No (Scalar_Range (E))
+ or else Error_Posted (Scalar_Range (E))
+ then
return;
end if;
end loop;
end Check_Unsigned_Type;
- -----------------------------
- -- Expand_Atomic_Aggregate --
- -----------------------------
+ -------------------------
+ -- Is_Atomic_Aggregate --
+ -------------------------
- procedure Expand_Atomic_Aggregate (E : Entity_Id; Typ : Entity_Id) is
+ function Is_Atomic_Aggregate
+ (E : Entity_Id;
+ Typ : Entity_Id) return Boolean
+ is
Loc : constant Source_Ptr := Sloc (E);
New_N : Node_Id;
+ Par : Node_Id;
Temp : Entity_Id;
begin
- if (Nkind (Parent (E)) = N_Object_Declaration
- or else Nkind (Parent (E)) = N_Assignment_Statement)
- and then Comes_From_Source (Parent (E))
- and then Nkind (E) = N_Aggregate
- then
- Temp :=
- Make_Defining_Identifier (Loc,
- New_Internal_Name ('T'));
+ Par := Parent (E);
+
+ -- Array may be qualified, so find outer context
+ if Nkind (Par) = N_Qualified_Expression then
+ Par := Parent (Par);
+ end if;
+
+ if Nkind_In (Par, N_Object_Declaration, N_Assignment_Statement)
+ and then Comes_From_Source (Par)
+ then
+ Temp := Make_Temporary (Loc, 'T', E);
New_N :=
Make_Object_Declaration (Loc,
Defining_Identifier => Temp,
- Object_definition => New_Occurrence_Of (Typ, Loc),
- Expression => Relocate_Node (E));
- Insert_Before (Parent (E), New_N);
+ Object_Definition => New_Occurrence_Of (Typ, Loc),
+ Expression => Relocate_Node (E));
+ Insert_Before (Par, New_N);
Analyze (New_N);
- Set_Expression (Parent (E), New_Occurrence_Of (Temp, Loc));
-
- -- To prevent the temporary from being constant-folded (which
- -- would lead to the same piecemeal assignment on the original
- -- target) indicate to the back-end that the temporary is a
- -- variable with real storage. See description of this flag
- -- in Einfo, and the notes on N_Assignment_Statement and
- -- N_Object_Declaration in Sinfo.
+ Set_Expression (Par, New_Occurrence_Of (Temp, Loc));
+ return True;
- Set_Is_True_Constant (Temp, False);
+ else
+ return False;
end if;
- end Expand_Atomic_Aggregate;
+ end Is_Atomic_Aggregate;
----------------
-- Freeze_All --
Decl : Node_Id;
procedure Freeze_All_Ent (From : Entity_Id; After : in out Node_Id);
- -- This is the internal recursive routine that does freezing of
- -- entities (but NOT the analysis of default expressions, which
- -- should not be recursive, we don't want to analyze those till
- -- we are sure that ALL the types are frozen).
+ -- This is the internal recursive routine that does freezing of entities
+ -- (but NOT the analysis of default expressions, which should not be
+ -- recursive, we don't want to analyze those till we are sure that ALL
+ -- the types are frozen).
--------------------
-- Freeze_All_Ent --
--------------------
- procedure Freeze_All_Ent
- (From : Entity_Id;
- After : in out Node_Id)
- is
+ procedure Freeze_All_Ent (From : Entity_Id; After : in out Node_Id) is
E : Entity_Id;
Flist : List_Id;
Lastn : Node_Id;
procedure Process_Flist;
- -- If freeze nodes are present, insert and analyze, and reset
- -- cursor for next insertion.
+ -- If freeze nodes are present, insert and analyze, and reset cursor
+ -- for next insertion.
-------------------
-- Process_Flist --
while Present (E) loop
-- If the entity is an inner package which is not a package
- -- renaming, then its entities must be frozen at this point.
- -- Note that such entities do NOT get frozen at the end of
- -- the nested package itself (only library packages freeze).
+ -- renaming, then its entities must be frozen at this point. Note
+ -- that such entities do NOT get frozen at the end of the nested
+ -- package itself (only library packages freeze).
-- Same is true for task declarations, where anonymous records
-- created for entry parameters must be frozen.
and then not Is_Child_Unit (E)
and then not Is_Frozen (E)
then
- New_Scope (E);
+ Push_Scope (E);
Install_Visible_Declarations (E);
Install_Private_Declarations (E);
or else
Nkind (Parent (E)) = N_Single_Task_Declaration)
then
- New_Scope (E);
+ Push_Scope (E);
Freeze_All (First_Entity (E), After);
End_Scope;
-- For a derived tagged type, we must ensure that all the
- -- primitive operations of the parent have been frozen, so
- -- that their addresses will be in the parent's dispatch table
- -- at the point it is inherited.
+ -- primitive operations of the parent have been frozen, so that
+ -- their addresses will be in the parent's dispatch table at the
+ -- point it is inherited.
elsif Ekind (E) = E_Record_Type
and then Is_Tagged_Type (E)
begin
Prim := First_Elmt (Prim_List);
-
while Present (Prim) loop
Subp := Node (Prim);
Process_Flist;
end if;
- -- If an incomplete type is still not frozen, this may be
- -- a premature freezing because of a body declaration that
- -- follows. Indicate where the freezing took place.
+ -- If an incomplete type is still not frozen, this may be a
+ -- premature freezing because of a body declaration that follows.
+ -- Indicate where the freezing took place.
- -- If the freezing is caused by the end of the current
- -- declarative part, it is a Taft Amendment type, and there
- -- is no error.
+ -- If the freezing is caused by the end of the current declarative
+ -- part, it is a Taft Amendment type, and there is no error.
if not Is_Frozen (E)
and then Ekind (E) = E_Incomplete_Type
Bod : constant Node_Id := Next (After);
begin
- if (Nkind (Bod) = N_Subprogram_Body
- or else Nkind (Bod) = N_Entry_Body
- or else Nkind (Bod) = N_Package_Body
- or else Nkind (Bod) = N_Protected_Body
- or else Nkind (Bod) = N_Task_Body
+ if (Nkind_In (Bod, N_Subprogram_Body,
+ N_Entry_Body,
+ N_Package_Body,
+ N_Protected_Body,
+ N_Task_Body)
or else Nkind (Bod) in N_Body_Stub)
and then
List_Containing (After) = List_Containing (Parent (E))
-- point at which such functions are constructed (after all types that
-- might be used in such expressions have been frozen).
+ -- For subprograms that are renaming_as_body, we create the wrapper
+ -- bodies as needed.
+
-- We also add finalization chains to access types whose designated
-- types are controlled. This is normally done when freezing the type,
-- but this misses recursive type definitions where the later members
- -- of the recursion introduce controlled components (e.g. 5624-001).
+ -- of the recursion introduce controlled components.
-- Loop through entities
then
declare
Ent : Entity_Id;
+
begin
Ent := First_Entity (E);
-
while Present (Ent) loop
-
if Is_Entry (Ent)
and then not Default_Expressions_Processed (Ent)
then
elsif Is_Access_Type (E)
and then Comes_From_Source (E)
and then Ekind (Directly_Designated_Type (E)) = E_Incomplete_Type
- and then Controlled_Type (Designated_Type (E))
+ and then Needs_Finalization (Designated_Type (E))
and then No (Associated_Final_Chain (E))
then
Build_Final_List (Parent (E), E);
-------------------
function Freeze_Entity (E : Entity_Id; Loc : Source_Ptr) return List_Id is
+ Test_E : Entity_Id := E;
Comp : Entity_Id;
F_Node : Node_Id;
Result : List_Id;
Formal : Entity_Id;
Atype : Entity_Id;
+ Has_Default_Initialization : Boolean := False;
+ -- This flag gets set to true for a variable with default initialization
+
procedure Check_Current_Instance (Comp_Decl : Node_Id);
- -- Check that an Access or Unchecked_Access attribute with
- -- a prefix which is the current instance type can only be
- -- applied when the type is limited.
+ -- Check that an Access or Unchecked_Access attribute with a prefix
+ -- which is the current instance type can only be applied when the type
+ -- is limited.
+
+ procedure Check_Suspicious_Modulus (Utype : Entity_Id);
+ -- Give warning for modulus of 8, 16, 32, or 64 given as an explicit
+ -- integer literal without an explicit corresponding size clause. The
+ -- caller has checked that Utype is a modular integer type.
function After_Last_Declaration return Boolean;
-- If Loc is a freeze_entity that appears after the last declaration
-- in the scope, inhibit error messages on late completion.
procedure Freeze_Record_Type (Rec : Entity_Id);
- -- Freeze each component, handle some representation clauses, and
- -- freeze primitive operations if this is a tagged type.
+ -- Freeze each component, handle some representation clauses, and freeze
+ -- primitive operations if this is a tagged type.
----------------------------
-- After_Last_Declaration --
----------------------------
function After_Last_Declaration return Boolean is
- Spec : constant Node_Id := Parent (Current_Scope);
-
+ Spec : constant Node_Id := Parent (Current_Scope);
begin
if Nkind (Spec) = N_Package_Specification then
if Present (Private_Declarations (Spec)) then
return Loc >= Sloc (Last (Private_Declarations (Spec)));
-
elsif Present (Visible_Declarations (Spec)) then
return Loc >= Sloc (Last (Visible_Declarations (Spec)));
else
return False;
end if;
-
else
return False;
end if;
procedure Check_Current_Instance (Comp_Decl : Node_Id) is
+ Rec_Type : constant Entity_Id :=
+ Scope (Defining_Identifier (Comp_Decl));
+
+ Decl : constant Node_Id := Parent (Rec_Type);
+
function Process (N : Node_Id) return Traverse_Result;
- -- Process routine to apply check to given node.
+ -- Process routine to apply check to given node
-------------
-- Process --
begin
case Nkind (N) is
when N_Attribute_Reference =>
- if (Attribute_Name (N) = Name_Access
+ if (Attribute_Name (N) = Name_Access
or else
Attribute_Name (N) = Name_Unchecked_Access)
and then Is_Entity_Name (Prefix (N))
-- Start of processing for Check_Current_Instance
begin
- Traverse (Comp_Decl);
+ -- In Ada95, the (imprecise) rule is that the current instance of a
+ -- limited type is aliased. In Ada2005, limitedness must be explicit:
+ -- either a tagged type, or a limited record.
+
+ if Is_Limited_Type (Rec_Type)
+ and then (Ada_Version < Ada_05 or else Is_Tagged_Type (Rec_Type))
+ then
+ return;
+
+ elsif Nkind (Decl) = N_Full_Type_Declaration
+ and then Limited_Present (Type_Definition (Decl))
+ then
+ return;
+
+ else
+ Traverse (Comp_Decl);
+ end if;
end Check_Current_Instance;
+ ------------------------------
+ -- Check_Suspicious_Modulus --
+ ------------------------------
+
+ procedure Check_Suspicious_Modulus (Utype : Entity_Id) is
+ Decl : constant Node_Id := Declaration_Node (Underlying_Type (Utype));
+
+ begin
+ if Nkind (Decl) = N_Full_Type_Declaration then
+ declare
+ Tdef : constant Node_Id := Type_Definition (Decl);
+ begin
+ if Nkind (Tdef) = N_Modular_Type_Definition then
+ declare
+ Modulus : constant Node_Id :=
+ Original_Node (Expression (Tdef));
+ begin
+ if Nkind (Modulus) = N_Integer_Literal then
+ declare
+ Modv : constant Uint := Intval (Modulus);
+ Sizv : constant Uint := RM_Size (Utype);
+
+ begin
+ -- First case, modulus and size are the same. This
+ -- happens if you have something like mod 32, with
+ -- an explicit size of 32, this is for sure a case
+ -- where the warning is given, since it is seems
+ -- very unlikely that someone would want e.g. a
+ -- five bit type stored in 32 bits. It is much
+ -- more likely they wanted a 32-bit type.
+
+ if Modv = Sizv then
+ null;
+
+ -- Second case, the modulus is 32 or 64 and no
+ -- size clause is present. This is a less clear
+ -- case for giving the warning, but in the case
+ -- of 32/64 (5-bit or 6-bit types) these seem rare
+ -- enough that it is a likely error (and in any
+ -- case using 2**5 or 2**6 in these cases seems
+ -- clearer. We don't include 8 or 16 here, simply
+ -- because in practice 3-bit and 4-bit types are
+ -- more common and too many false positives if
+ -- we warn in these cases.
+
+ elsif not Has_Size_Clause (Utype)
+ and then (Modv = Uint_32 or else Modv = Uint_64)
+ then
+ null;
+
+ -- No warning needed
+
+ else
+ return;
+ end if;
+
+ -- If we fall through, give warning
+
+ Error_Msg_Uint_1 := Modv;
+ Error_Msg_N
+ ("?2 '*'*^' may have been intended here",
+ Modulus);
+ end;
+ end if;
+ end;
+ end if;
+ end;
+ end if;
+ end Check_Suspicious_Modulus;
+
------------------------
-- Freeze_Record_Type --
------------------------
procedure Freeze_Record_Type (Rec : Entity_Id) is
Comp : Entity_Id;
IR : Node_Id;
- Junk : Boolean;
ADC : Node_Id;
+ Prev : Entity_Id;
+
+ Junk : Boolean;
+ pragma Warnings (Off, Junk);
Unplaced_Component : Boolean := False;
-- Set True if we find at least one component with no component
Placed_Component : Boolean := False;
-- Set True if we find at least one component with a component
- -- clause (used to warn about useless Bit_Order pragmas).
-
- procedure Check_Itype (Desig : Entity_Id);
- -- If the component subtype is an access to a constrained subtype
- -- of an already frozen type, make the subtype frozen as well. It
- -- might otherwise be frozen in the wrong scope, and a freeze node
- -- on subtype has no effect.
+ -- clause (used to warn about useless Bit_Order pragmas, and also
+ -- to detect cases where Implicit_Packing may have an effect).
+
+ All_Scalar_Components : Boolean := True;
+ -- Set False if we encounter a component of a non-scalar type
+
+ Scalar_Component_Total_RM_Size : Uint := Uint_0;
+ Scalar_Component_Total_Esize : Uint := Uint_0;
+ -- Accumulates total RM_Size values and total Esize values of all
+ -- scalar components. Used for processing of Implicit_Packing.
+
+ function Check_Allocator (N : Node_Id) return Node_Id;
+ -- If N is an allocator, possibly wrapped in one or more level of
+ -- qualified expression(s), return the inner allocator node, else
+ -- return Empty.
+
+ procedure Check_Itype (Typ : Entity_Id);
+ -- If the component subtype is an access to a constrained subtype of
+ -- an already frozen type, make the subtype frozen as well. It might
+ -- otherwise be frozen in the wrong scope, and a freeze node on
+ -- subtype has no effect. Similarly, if the component subtype is a
+ -- regular (not protected) access to subprogram, set the anonymous
+ -- subprogram type to frozen as well, to prevent an out-of-scope
+ -- freeze node at some eventual point of call. Protected operations
+ -- are handled elsewhere.
+
+ ---------------------
+ -- Check_Allocator --
+ ---------------------
+
+ function Check_Allocator (N : Node_Id) return Node_Id is
+ Inner : Node_Id;
+ begin
+ Inner := N;
+ loop
+ if Nkind (Inner) = N_Allocator then
+ return Inner;
+ elsif Nkind (Inner) = N_Qualified_Expression then
+ Inner := Expression (Inner);
+ else
+ return Empty;
+ end if;
+ end loop;
+ end Check_Allocator;
-----------------
-- Check_Itype --
-----------------
- procedure Check_Itype (Desig : Entity_Id) is
+ procedure Check_Itype (Typ : Entity_Id) is
+ Desig : constant Entity_Id := Designated_Type (Typ);
+
begin
if not Is_Frozen (Desig)
and then Is_Frozen (Base_Type (Desig))
Set_Is_Frozen (Desig);
-- In addition, add an Itype_Reference to ensure that the
- -- access subtype is elaborated early enough. This cannot
- -- be done if the subtype may depend on discriminants.
+ -- access subtype is elaborated early enough. This cannot be
+ -- done if the subtype may depend on discriminants.
if Ekind (Comp) = E_Component
and then Is_Itype (Etype (Comp))
Append (IR, Result);
end if;
end if;
+
+ elsif Ekind (Typ) = E_Anonymous_Access_Subprogram_Type
+ and then Convention (Desig) /= Convention_Protected
+ then
+ Set_Is_Frozen (Desig);
end if;
end Check_Itype;
-- Start of processing for Freeze_Record_Type
begin
- -- If this is a subtype of a controlled type, declared without
- -- a constraint, the _controller may not appear in the component
- -- list if the parent was not frozen at the point of subtype
- -- declaration. Inherit the _controller component now.
+ -- If this is a subtype of a controlled type, declared without a
+ -- constraint, the _controller may not appear in the component list
+ -- if the parent was not frozen at the point of subtype declaration.
+ -- Inherit the _controller component now.
if Rec /= Base_Type (Rec)
and then Has_Controlled_Component (Rec)
then
Set_First_Entity (Rec, First_Entity (Base_Type (Rec)));
- -- If this is an internal type without a declaration, as for a
+ -- If this is an internal type without a declaration, as for
-- record component, the base type may not yet be frozen, and its
-- controller has not been created. Add an explicit freeze node
- -- for the itype, so it will be frozen after the base type.
+ -- for the itype, so it will be frozen after the base type. This
+ -- freeze node is used to communicate with the expander, in order
+ -- to create the controller for the enclosing record, and it is
+ -- deleted afterwards (see exp_ch3). It must not be created when
+ -- expansion is off, because it might appear in the wrong context
+ -- for the back end.
elsif Is_Itype (Rec)
and then Has_Delayed_Freeze (Base_Type (Rec))
and then
Nkind (Associated_Node_For_Itype (Rec)) =
- N_Component_Declaration
+ N_Component_Declaration
+ and then Expander_Active
then
Ensure_Freeze_Node (Rec);
end if;
-- Freeze components and embedded subtypes
Comp := First_Entity (Rec);
+ Prev := Empty;
while Present (Comp) loop
- if not Is_Type (Comp) then
- Freeze_And_Append (Etype (Comp), Loc, Result);
- end if;
-
- -- If the component is an access type with an allocator
- -- as default value, the designated type will be frozen
- -- by the corresponding expression in init_proc. In order
- -- to place the freeze node for the designated type before
- -- that for the current record type, freeze it now.
-
- -- Same process if the component is an array of access types,
- -- initialized with an aggregate. If the designated type is
- -- private, it cannot contain allocators, and it is premature
- -- to freeze the type, so we check for this as well.
-
- if Is_Access_Type (Etype (Comp))
- and then Present (Parent (Comp))
- and then Present (Expression (Parent (Comp)))
- and then Nkind (Expression (Parent (Comp))) = N_Allocator
- then
- declare
- Alloc : constant Node_Id := Expression (Parent (Comp));
-
- begin
- -- If component is pointer to a classwide type, freeze
- -- the specific type in the expression being allocated.
- -- The expression may be a subtype indication, in which
- -- case freeze the subtype mark.
-
- if Is_Class_Wide_Type (Designated_Type (Etype (Comp))) then
- if Is_Entity_Name (Expression (Alloc)) then
- Freeze_And_Append
- (Entity (Expression (Alloc)), Loc, Result);
- elsif
- Nkind (Expression (Alloc)) = N_Subtype_Indication
- then
- Freeze_And_Append
- (Entity (Subtype_Mark (Expression (Alloc))),
- Loc, Result);
- end if;
-
- elsif Is_Itype (Designated_Type (Etype (Comp))) then
- Check_Itype (Designated_Type (Etype (Comp)));
-
- else
- Freeze_And_Append
- (Designated_Type (Etype (Comp)), Loc, Result);
- end if;
- end;
-
- elsif Is_Access_Type (Etype (Comp))
- and then Is_Itype (Designated_Type (Etype (Comp)))
- then
- Check_Itype (Designated_Type (Etype (Comp)));
-
- elsif Is_Array_Type (Etype (Comp))
- and then Is_Access_Type (Component_Type (Etype (Comp)))
- and then Present (Parent (Comp))
- and then Nkind (Parent (Comp)) = N_Component_Declaration
- and then Present (Expression (Parent (Comp)))
- and then Nkind (Expression (Parent (Comp))) = N_Aggregate
- and then Is_Fully_Defined
- (Designated_Type (Component_Type (Etype (Comp))))
- then
- Freeze_And_Append
- (Designated_Type
- (Component_Type (Etype (Comp))), Loc, Result);
- end if;
- -- Processing for real components (exclude anonymous subtypes)
+ -- First handle the component case
if Ekind (Comp) = E_Component
or else Ekind (Comp) = E_Discriminant
CC : constant Node_Id := Component_Clause (Comp);
begin
+ -- Freezing a record type freezes the type of each of its
+ -- components. However, if the type of the component is
+ -- part of this record, we do not want or need a separate
+ -- Freeze_Node. Note that Is_Itype is wrong because that's
+ -- also set in private type cases. We also can't check for
+ -- the Scope being exactly Rec because of private types and
+ -- record extensions.
+
+ if Is_Itype (Etype (Comp))
+ and then Is_Record_Type (Underlying_Type
+ (Scope (Etype (Comp))))
+ then
+ Undelay_Type (Etype (Comp));
+ end if;
+
+ Freeze_And_Append (Etype (Comp), Loc, Result);
+
-- Check for error of component clause given for variable
-- sized type. We have to delay this test till this point,
-- since the component type has to be frozen for us to know
if Inside_A_Generic then
null;
- elsif not Size_Known_At_Compile_Time
- (Underlying_Type (Etype (Comp)))
+ elsif not
+ Size_Known_At_Compile_Time
+ (Underlying_Type (Etype (Comp)))
then
Error_Msg_N
("component clause not allowed for variable " &
Set_Must_Be_On_Byte_Boundary (Rec);
- -- Check for component clause that is inconsistent
- -- with the required byte boundary alignment.
+ -- Check for component clause that is inconsistent with
+ -- the required byte boundary alignment.
if Present (CC)
and then Normalized_First_Bit (Comp) mod
Component_Name (Component_Clause (Comp)));
end if;
end if;
+ end;
+ end if;
- -- If component clause is present, then deal with the
- -- non-default bit order case. We cannot do this before
- -- the freeze point, because there is no required order
- -- for the component clause and the bit_order clause.
+ -- Gather data for possible Implicit_Packing later. Note that at
+ -- this stage we might be dealing with a real component, or with
+ -- an implicit subtype declaration.
- -- We only do this processing for the base type, and in
- -- fact that's important, since otherwise if there are
- -- record subtypes, we could reverse the bits once for
- -- each subtype, which would be incorrect.
+ if not Is_Scalar_Type (Etype (Comp)) then
+ All_Scalar_Components := False;
+ else
+ Scalar_Component_Total_RM_Size :=
+ Scalar_Component_Total_RM_Size + RM_Size (Etype (Comp));
+ Scalar_Component_Total_Esize :=
+ Scalar_Component_Total_Esize + Esize (Etype (Comp));
+ end if;
- if Present (CC)
- and then Reverse_Bit_Order (Rec)
- and then Ekind (E) = E_Record_Type
- then
- declare
- CFB : constant Uint := Component_Bit_Offset (Comp);
- CSZ : constant Uint := Esize (Comp);
- CLC : constant Node_Id := Component_Clause (Comp);
- Pos : constant Node_Id := Position (CLC);
- FB : constant Node_Id := First_Bit (CLC);
+ -- If the component is an Itype with Delayed_Freeze and is either
+ -- a record or array subtype and its base type has not yet been
+ -- frozen, we must remove this from the entity list of this record
+ -- and put it on the entity list of the scope of its base type.
+ -- Note that we know that this is not the type of a component
+ -- since we cleared Has_Delayed_Freeze for it in the previous
+ -- loop. Thus this must be the Designated_Type of an access type,
+ -- which is the type of a component.
+
+ if Is_Itype (Comp)
+ and then Is_Type (Scope (Comp))
+ and then Is_Composite_Type (Comp)
+ and then Base_Type (Comp) /= Comp
+ and then Has_Delayed_Freeze (Comp)
+ and then not Is_Frozen (Base_Type (Comp))
+ then
+ declare
+ Will_Be_Frozen : Boolean := False;
+ S : Entity_Id;
- Storage_Unit_Offset : constant Uint :=
- CFB / System_Storage_Unit;
+ begin
+ -- We have a pretty bad kludge here. Suppose Rec is subtype
+ -- being defined in a subprogram that's created as part of
+ -- the freezing of Rec'Base. In that case, we know that
+ -- Comp'Base must have already been frozen by the time we
+ -- get to elaborate this because Gigi doesn't elaborate any
+ -- bodies until it has elaborated all of the declarative
+ -- part. But Is_Frozen will not be set at this point because
+ -- we are processing code in lexical order.
+
+ -- We detect this case by going up the Scope chain of Rec
+ -- and seeing if we have a subprogram scope before reaching
+ -- the top of the scope chain or that of Comp'Base. If we
+ -- do, then mark that Comp'Base will actually be frozen. If
+ -- so, we merely undelay it.
+
+ S := Scope (Rec);
+ while Present (S) loop
+ if Is_Subprogram (S) then
+ Will_Be_Frozen := True;
+ exit;
+ elsif S = Scope (Base_Type (Comp)) then
+ exit;
+ end if;
- Start_Bit : constant Uint :=
- CFB mod System_Storage_Unit;
+ S := Scope (S);
+ end loop;
- begin
- -- Cases where field goes over storage unit boundary
+ if Will_Be_Frozen then
+ Undelay_Type (Comp);
+ else
+ if Present (Prev) then
+ Set_Next_Entity (Prev, Next_Entity (Comp));
+ else
+ Set_First_Entity (Rec, Next_Entity (Comp));
+ end if;
- if Start_Bit + CSZ > System_Storage_Unit then
+ -- Insert in entity list of scope of base type (which
+ -- must be an enclosing scope, because still unfrozen).
- -- Allow multi-byte field but generate warning
+ Append_Entity (Comp, Scope (Base_Type (Comp)));
+ end if;
+ end;
- if Start_Bit mod System_Storage_Unit = 0
- and then CSZ mod System_Storage_Unit = 0
- then
- Error_Msg_N
- ("multi-byte field specified with non-standard"
- & " Bit_Order?", CLC);
+ -- If the component is an access type with an allocator as default
+ -- value, the designated type will be frozen by the corresponding
+ -- expression in init_proc. In order to place the freeze node for
+ -- the designated type before that for the current record type,
+ -- freeze it now.
- if Bytes_Big_Endian then
- Error_Msg_N
- ("bytes are not reversed "
- & "(component is big-endian)?", CLC);
- else
- Error_Msg_N
- ("bytes are not reversed "
- & "(component is little-endian)?", CLC);
- end if;
+ -- Same process if the component is an array of access types,
+ -- initialized with an aggregate. If the designated type is
+ -- private, it cannot contain allocators, and it is premature
+ -- to freeze the type, so we check for this as well.
- -- Do not allow non-contiguous field
+ elsif Is_Access_Type (Etype (Comp))
+ and then Present (Parent (Comp))
+ and then Present (Expression (Parent (Comp)))
+ then
+ declare
+ Alloc : constant Node_Id :=
+ Check_Allocator (Expression (Parent (Comp)));
- else
- Error_Msg_N
- ("attempt to specify non-contiguous field"
- & " not permitted", CLC);
- Error_Msg_N
- ("\(caused by non-standard Bit_Order "
- & "specified)", CLC);
- end if;
+ begin
+ if Present (Alloc) then
- -- Case where field fits in one storage unit
+ -- If component is pointer to a classwide type, freeze
+ -- the specific type in the expression being allocated.
+ -- The expression may be a subtype indication, in which
+ -- case freeze the subtype mark.
- else
- -- Give warning if suspicious component clause
+ if Is_Class_Wide_Type
+ (Designated_Type (Etype (Comp)))
+ then
+ if Is_Entity_Name (Expression (Alloc)) then
+ Freeze_And_Append
+ (Entity (Expression (Alloc)), Loc, Result);
+ elsif
+ Nkind (Expression (Alloc)) = N_Subtype_Indication
+ then
+ Freeze_And_Append
+ (Entity (Subtype_Mark (Expression (Alloc))),
+ Loc, Result);
+ end if;
- if Intval (FB) >= System_Storage_Unit then
- Error_Msg_N
- ("?Bit_Order clause does not affect " &
- "byte ordering", Pos);
- Error_Msg_Uint_1 :=
- Intval (Pos) + Intval (FB) /
- System_Storage_Unit;
- Error_Msg_N
- ("?position normalized to ^ before bit " &
- "order interpreted", Pos);
- end if;
+ elsif Is_Itype (Designated_Type (Etype (Comp))) then
+ Check_Itype (Etype (Comp));
- -- 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 are:
+ else
+ Freeze_And_Append
+ (Designated_Type (Etype (Comp)), Loc, Result);
+ end if;
+ end if;
+ end;
- -- First_Bit .. Last_Bit Component_Bit_Offset
- -- old new old new
+ elsif Is_Access_Type (Etype (Comp))
+ and then Is_Itype (Designated_Type (Etype (Comp)))
+ then
+ Check_Itype (Etype (Comp));
- -- 0 .. 0 7 .. 7 0 7
- -- 0 .. 1 6 .. 7 0 6
- -- 0 .. 2 5 .. 7 0 5
- -- 0 .. 7 0 .. 7 0 4
+ elsif Is_Array_Type (Etype (Comp))
+ and then Is_Access_Type (Component_Type (Etype (Comp)))
+ and then Present (Parent (Comp))
+ and then Nkind (Parent (Comp)) = N_Component_Declaration
+ and then Present (Expression (Parent (Comp)))
+ and then Nkind (Expression (Parent (Comp))) = N_Aggregate
+ and then Is_Fully_Defined
+ (Designated_Type (Component_Type (Etype (Comp))))
+ then
+ Freeze_And_Append
+ (Designated_Type
+ (Component_Type (Etype (Comp))), Loc, Result);
+ end if;
- -- 1 .. 1 6 .. 6 1 6
- -- 1 .. 4 3 .. 6 1 3
- -- 4 .. 7 0 .. 3 4 0
+ Prev := Comp;
+ Next_Entity (Comp);
+ end loop;
- -- The general rule is that the first bit is
- -- is obtained by subtracting the old ending bit
- -- from storage_unit - 1.
+ -- Deal with pragma Bit_Order setting non-standard bit order
- Set_Component_Bit_Offset
- (Comp,
- (Storage_Unit_Offset * System_Storage_Unit) +
- (System_Storage_Unit - 1) -
- (Start_Bit + CSZ - 1));
+ if Reverse_Bit_Order (Rec) and then Base_Type (Rec) = Rec then
+ if not Placed_Component then
+ ADC :=
+ Get_Attribute_Definition_Clause (Rec, Attribute_Bit_Order);
+ Error_Msg_N ("?Bit_Order specification has no effect", ADC);
+ Error_Msg_N
+ ("\?since no component clauses were specified", ADC);
- Set_Normalized_First_Bit
- (Comp,
- Component_Bit_Offset (Comp) mod
- System_Storage_Unit);
- end if;
- end;
- end if;
- end;
+ -- Here is where we do the processing for reversed bit order
+
+ else
+ Adjust_Record_For_Reverse_Bit_Order (Rec);
end if;
+ end if;
- Next_Entity (Comp);
- end loop;
+ -- Complete error checking on record representation clause (e.g.
+ -- overlap of components). This is called after adjusting the
+ -- record for reverse bit order.
- -- Check for useless pragma Bit_Order
+ declare
+ RRC : constant Node_Id := Get_Record_Representation_Clause (Rec);
+ begin
+ if Present (RRC) then
+ Check_Record_Representation_Clause (RRC);
+ end if;
+ end;
+
+ -- Set OK_To_Reorder_Components depending on debug flags
- if not Placed_Component and then Reverse_Bit_Order (Rec) then
- ADC := Get_Attribute_Definition_Clause (Rec, Attribute_Bit_Order);
- Error_Msg_N ("?Bit_Order specification has no effect", ADC);
- Error_Msg_N ("\?since no component clauses were specified", ADC);
+ if Rec = Base_Type (Rec)
+ and then Convention (Rec) = Convention_Ada
+ then
+ if (Has_Discriminants (Rec) and then Debug_Flag_Dot_V)
+ or else
+ (not Has_Discriminants (Rec) and then Debug_Flag_Dot_R)
+ then
+ Set_OK_To_Reorder_Components (Rec);
+ end if;
end if;
- -- Check for useless pragma Pack when all components placed
+ -- Check for useless pragma Pack when all components placed. We only
+ -- do this check for record types, not subtypes, since a subtype may
+ -- have all its components placed, and it still makes perfectly good
+ -- sense to pack other subtypes or the parent type. We do not give
+ -- this warning if Optimize_Alignment is set to Space, since the
+ -- pragma Pack does have an effect in this case (it always resets
+ -- the alignment to one).
- if Is_Packed (Rec)
+ if Ekind (Rec) = E_Record_Type
+ and then Is_Packed (Rec)
and then not Unplaced_Component
- and then Warn_On_Redundant_Constructs
+ and then Optimize_Alignment /= 'S'
then
- Error_Msg_N
- ("?pragma Pack has no effect, no unplaced components",
- Get_Rep_Pragma (Rec, Name_Pack));
+ -- Reset packed status. Probably not necessary, but we do it so
+ -- that there is no chance of the back end doing something strange
+ -- with this redundant indication of packing.
+
Set_Is_Packed (Rec, False);
+
+ -- Give warning if redundant constructs warnings on
+
+ if Warn_On_Redundant_Constructs then
+ Error_Msg_N -- CODEFIX
+ ("?pragma Pack has no effect, no unplaced components",
+ Get_Rep_Pragma (Rec, Name_Pack));
+ end if;
end if;
- -- If this is the record corresponding to a remote type,
- -- freeze the remote type here since that is what we are
- -- semantically freezing. This prevents having the freeze
- -- node for that type in an inner scope.
+ -- If this is the record corresponding to a remote type, freeze the
+ -- remote type here since that is what we are semantically freezing.
+ -- This prevents the freeze node for that type in an inner scope.
-- Also, Check for controlled components and unchecked unions.
- -- Finally, enforce the restriction that access attributes with
- -- a current instance prefix can only apply to limited types.
+ -- Finally, enforce the restriction that access attributes with a
+ -- current instance prefix can only apply to limited types.
- if Ekind (Rec) = E_Record_Type then
+ if Ekind (Rec) = E_Record_Type then
if Present (Corresponding_Remote_Type (Rec)) then
Freeze_And_Append
(Corresponding_Remote_Type (Rec), Loc, Result);
Comp := First_Component (Rec);
while Present (Comp) loop
- if Has_Controlled_Component (Etype (Comp))
- or else (Chars (Comp) /= Name_uParent
- and then Is_Controlled (Etype (Comp)))
- or else (Is_Protected_Type (Etype (Comp))
- and then Present
- (Corresponding_Record_Type (Etype (Comp)))
- and then Has_Controlled_Component
- (Corresponding_Record_Type (Etype (Comp))))
+
+ -- Do not set Has_Controlled_Component on a class-wide
+ -- equivalent type. See Make_CW_Equivalent_Type.
+
+ if not Is_Class_Wide_Equivalent_Type (Rec)
+ and then (Has_Controlled_Component (Etype (Comp))
+ or else (Chars (Comp) /= Name_uParent
+ and then Is_Controlled (Etype (Comp)))
+ or else (Is_Protected_Type (Etype (Comp))
+ and then Present
+ (Corresponding_Record_Type
+ (Etype (Comp)))
+ and then Has_Controlled_Component
+ (Corresponding_Record_Type
+ (Etype (Comp)))))
then
Set_Has_Controlled_Component (Rec);
exit;
Set_Has_Unchecked_Union (Rec);
end if;
- if Has_Per_Object_Constraint (Comp)
- and then not Is_Limited_Type (Rec)
- then
- -- Scan component declaration for likely misuses of
- -- current instance, either in a constraint or in a
- -- default expression.
+ if Has_Per_Object_Constraint (Comp) then
+
+ -- Scan component declaration for likely misuses of current
+ -- instance, either in a constraint or a default expression.
Check_Current_Instance (Parent (Comp));
end if;
Set_Component_Alignment_If_Not_Set (Rec);
- -- For first subtypes, check if there are any fixed-point
- -- fields with component clauses, where we must check the size.
- -- This is not done till the freeze point, since for fixed-point
- -- types, we do not know the size until the type is frozen.
- -- Similar processing applies to bit packed arrays.
+ -- For first subtypes, check if there are any fixed-point fields with
+ -- component clauses, where we must check the size. This is not done
+ -- till the freeze point, since for fixed-point types, we do not know
+ -- the size until the type is frozen. Similar processing applies to
+ -- bit packed arrays.
if Is_First_Subtype (Rec) then
Comp := First_Component (Rec);
Next_Component (Comp);
end loop;
end if;
+
+ -- Generate warning for applying C or C++ convention to a record
+ -- with discriminants. This is suppressed for the unchecked union
+ -- case, since the whole point in this case is interface C. We also
+ -- do not generate this within instantiations, since we will have
+ -- generated a message on the template.
+
+ if Has_Discriminants (E)
+ and then not Is_Unchecked_Union (E)
+ and then (Convention (E) = Convention_C
+ or else
+ Convention (E) = Convention_CPP)
+ and then Comes_From_Source (E)
+ and then not In_Instance
+ and then not Has_Warnings_Off (E)
+ and then not Has_Warnings_Off (Base_Type (E))
+ then
+ declare
+ Cprag : constant Node_Id := Get_Rep_Pragma (E, Name_Convention);
+ A2 : Node_Id;
+
+ begin
+ if Present (Cprag) then
+ A2 := Next (First (Pragma_Argument_Associations (Cprag)));
+
+ if Convention (E) = Convention_C then
+ Error_Msg_N
+ ("?variant record has no direct equivalent in C", A2);
+ else
+ Error_Msg_N
+ ("?variant record has no direct equivalent in C++", A2);
+ end if;
+
+ Error_Msg_NE
+ ("\?use of convention for type& is dubious", A2, E);
+ end if;
+ end;
+ end if;
+
+ -- See if Size is too small as is (and implicit packing might help)
+
+ if not Is_Packed (Rec)
+
+ -- No implicit packing if even one component is explicitly placed
+
+ and then not Placed_Component
+
+ -- Must have size clause and all scalar components
+
+ and then Has_Size_Clause (Rec)
+ and then All_Scalar_Components
+
+ -- Do not try implicit packing on records with discriminants, too
+ -- complicated, especially in the variant record case.
+
+ and then not Has_Discriminants (Rec)
+
+ -- We can implicitly pack if the specified size of the record is
+ -- less than the sum of the object sizes (no point in packing if
+ -- this is not the case).
+
+ and then Esize (Rec) < Scalar_Component_Total_Esize
+
+ -- And the total RM size cannot be greater than the specified size
+ -- since otherwise packing will not get us where we have to be!
+
+ and then Esize (Rec) >= Scalar_Component_Total_RM_Size
+
+ -- Never do implicit packing in CodePeer mode since we don't do
+ -- any packing ever in this mode (why not???)
+
+ and then not CodePeer_Mode
+ then
+ -- If implicit packing enabled, do it
+
+ if Implicit_Packing then
+ Set_Is_Packed (Rec);
+
+ -- Otherwise flag the size clause
+
+ else
+ declare
+ Sz : constant Node_Id := Size_Clause (Rec);
+ begin
+ Error_Msg_NE -- CODEFIX
+ ("size given for& too small", Sz, Rec);
+ Error_Msg_N -- CODEFIX
+ ("\use explicit pragma Pack "
+ & "or use pragma Implicit_Packing", Sz);
+ end;
+ end if;
+ end if;
end Freeze_Record_Type;
-- Start of processing for Freeze_Entity
begin
+ -- We are going to test for various reasons why this entity need not be
+ -- frozen here, but in the case of an Itype that's defined within a
+ -- record, that test actually applies to the record.
+
+ if Is_Itype (E) and then Is_Record_Type (Scope (E)) then
+ Test_E := Scope (E);
+ elsif Is_Itype (E) and then Present (Underlying_Type (Scope (E)))
+ and then Is_Record_Type (Underlying_Type (Scope (E)))
+ then
+ Test_E := Underlying_Type (Scope (E));
+ end if;
+
-- Do not freeze if already frozen since we only need one freeze node
if Is_Frozen (E) then
return No_List;
- -- It is improper to freeze an external entity within a generic
- -- because its freeze node will appear in a non-valid context.
- -- The entity will be frozen in the proper scope after the current
- -- generic is analyzed.
+ -- It is improper to freeze an external entity within a generic because
+ -- its freeze node will appear in a non-valid context. The entity will
+ -- be frozen in the proper scope after the current generic is analyzed.
- elsif Inside_A_Generic and then External_Ref_In_Generic (E) then
+ elsif Inside_A_Generic and then External_Ref_In_Generic (Test_E) then
return No_List;
-- Do not freeze a global entity within an inner scope created during
-- The two-pass elaboration mechanism in gigi guarantees that E will
-- be frozen before the inner call is elaborated. We exclude constants
-- from this test, because deferred constants may be frozen early, and
- -- must be diagnosed (see e.g. 1522-005). If the enclosing subprogram
- -- comes from source, or is a generic instance, then the freeze point
- -- is the one mandated by the language. and we freze the entity.
-
- elsif In_Open_Scopes (Scope (E))
- and then Scope (E) /= Current_Scope
- and then Ekind (E) /= E_Constant
+ -- must be diagnosed (e.g. in the case of a deferred constant being used
+ -- in a default expression). If the enclosing subprogram comes from
+ -- source, or is a generic instance, then the freeze point is the one
+ -- mandated by the language, and we freeze the entity. A subprogram that
+ -- is a child unit body that acts as a spec does not have a spec that
+ -- comes from source, but can only come from source.
+
+ elsif In_Open_Scopes (Scope (Test_E))
+ and then Scope (Test_E) /= Current_Scope
+ and then Ekind (Test_E) /= E_Constant
then
declare
S : Entity_Id := Current_Scope;
begin
+
while Present (S) loop
if Is_Overloadable (S) then
if Comes_From_Source (S)
or else Is_Generic_Instance (S)
+ or else Is_Child_Unit (S)
then
exit;
else
-- Similarly, an inlined instance body may make reference to global
-- entities, but these references cannot be the proper freezing point
- -- for them, and the the absence of inlining freezing will take place
- -- in their own scope. Normally instance bodies are analyzed after
- -- the enclosing compilation, and everything has been frozen at the
- -- proper place, but with front-end inlining an instance body is
- -- compiled before the end of the enclosing scope, and as a result
- -- out-of-order freezing must be prevented.
+ -- for them, and in the absence of inlining freezing will take place in
+ -- their own scope. Normally instance bodies are analyzed after the
+ -- enclosing compilation, and everything has been frozen at the proper
+ -- place, but with front-end inlining an instance body is compiled
+ -- before the end of the enclosing scope, and as a result out-of-order
+ -- freezing must be prevented.
elsif Front_End_Inlining
- and then In_Instance_Body
- and then Present (Scope (E))
+ and then In_Instance_Body
+ and then Present (Scope (Test_E))
then
declare
- S : Entity_Id := Scope (E);
+ S : Entity_Id := Scope (Test_E);
+
begin
while Present (S) loop
if Is_Generic_Instance (S) then
-- If entity is exported or imported and does not have an external
-- name, now is the time to provide the appropriate default name.
-- Skip this if the entity is stubbed, since we don't need a name
- -- for any stubbed routine.
+ -- for any stubbed routine. For the case on intrinsics, if no
+ -- external name is specified, then calls will be handled in
+ -- Exp_Intr.Expand_Intrinsic_Call, and no name is needed. If an
+ -- external name is provided, then Expand_Intrinsic_Call leaves
+ -- calls in place for expansion by GIGI.
if (Is_Imported (E) or else Is_Exported (E))
and then No (Interface_Name (E))
and then Convention (E) /= Convention_Stubbed
+ and then Convention (E) /= Convention_Intrinsic
then
Set_Encoded_Interface_Name
(E, Get_Default_External_Name (E));
- -- Special processing for atomic objects appearing in object decls
+ -- If entity is an atomic object appearing in a declaration and
+ -- the expression is an aggregate, assign it to a temporary to
+ -- ensure that the actual assignment is done atomically rather
+ -- than component-wise (the assignment to the temp may be done
+ -- component-wise, but that is harmless).
elsif Is_Atomic (E)
and then Nkind (Parent (E)) = N_Object_Declaration
and then Present (Expression (Parent (E)))
+ and then Nkind (Expression (Parent (E))) = N_Aggregate
+ and then
+ Is_Atomic_Aggregate (Expression (Parent (E)), Etype (E))
then
- declare
- Expr : constant Node_Id := Expression (Parent (E));
-
- begin
- -- If expression is an aggregate, assign to a temporary to
- -- ensure that the actual assignment is done atomically rather
- -- than component-wise (the assignment to the temp may be done
- -- component-wise, but that is harmless.
-
- if Nkind (Expr) = N_Aggregate then
- Expand_Atomic_Aggregate (Expr, Etype (E));
-
- -- If the expression is a reference to a record or array
- -- object entity, then reset Is_True_Constant to False so
- -- that the compiler will not optimize away the intermediate
- -- object, which we need in this case for the same reason
- -- (to ensure that the actual assignment is atomic, rather
- -- than component-wise).
-
- elsif Is_Entity_Name (Expr)
- and then (Is_Record_Type (Etype (Expr))
- or else
- Is_Array_Type (Etype (Expr)))
- then
- Set_Is_True_Constant (Entity (Expr), False);
- end if;
- end;
+ null;
end if;
-- For a subprogram, freeze all parameter types and also the return
-- type (RM 13.14(14)). However skip this for internal subprograms.
-- This is also the point where any extra formal parameters are
- -- created since we now know whether the subprogram will use
- -- a foreign convention.
+ -- created since we now know whether the subprogram will use a
+ -- foreign convention.
if Is_Subprogram (E) then
if not Is_Internal (E) then
declare
F_Type : Entity_Id;
+ R_Type : Entity_Id;
Warn_Node : Node_Id;
- function Is_Fat_C_Ptr_Type (T : Entity_Id) return Boolean;
- -- Determines if given type entity is a fat pointer type
- -- used as an argument type or return type to a subprogram
- -- with C or C++ convention set.
-
- --------------------------
- -- Is_Fat_C_Access_Type --
- --------------------------
-
- function Is_Fat_C_Ptr_Type (T : Entity_Id) return Boolean is
- begin
- return (Convention (E) = Convention_C
- or else
- Convention (E) = Convention_CPP)
- and then Is_Access_Type (T)
- and then Esize (T) > Ttypes.System_Address_Size;
- end Is_Fat_C_Ptr_Type;
-
begin
-- Loop through formals
-- If the type of a formal is incomplete, subprogram
-- is being frozen prematurely. Within an instance
-- (but not within a wrapper package) this is an
- -- an artifact of our need to regard the end of an
+ -- artifact of our need to regard the end of an
-- instantiation as a freeze point. Otherwise it is
-- a definite error.
- -- and then not Is_Wrapper_Package (Current_Scope) ???
-
if In_Instance then
Set_Is_Frozen (E, False);
return No_List;
- elsif not After_Last_Declaration then
+ elsif not After_Last_Declaration
+ and then not Freezing_Library_Level_Tagged_Type
+ then
Error_Msg_Node_1 := F_Type;
Error_Msg
("type& must be fully defined before this point",
end if;
end if;
- -- Check bad use of fat C pointer
+ -- Check suspicious parameter for C function. These tests
+ -- apply only to exported/imported subprograms.
- if Warn_On_Export_Import and then
- Is_Fat_C_Ptr_Type (F_Type)
+ if Warn_On_Export_Import
+ and then Comes_From_Source (E)
+ and then (Convention (E) = Convention_C
+ or else
+ Convention (E) = Convention_CPP)
+ and then (Is_Imported (E) or else Is_Exported (E))
+ and then Convention (E) /= Convention (Formal)
+ and then not Has_Warnings_Off (E)
+ and then not Has_Warnings_Off (F_Type)
+ and then not Has_Warnings_Off (Formal)
then
+ -- Qualify mention of formals with subprogram name
+
Error_Msg_Qual_Level := 1;
- Error_Msg_N
- ("?type of & does not correspond to C pointer",
- Formal);
+
+ -- Check suspicious use of fat C pointer
+
+ if Is_Access_Type (F_Type)
+ and then Esize (F_Type) > Ttypes.System_Address_Size
+ then
+ Error_Msg_N
+ ("?type of & does not correspond to C pointer!",
+ Formal);
+
+ -- Check suspicious return of boolean
+
+ elsif Root_Type (F_Type) = Standard_Boolean
+ and then Convention (F_Type) = Convention_Ada
+ and then not Has_Warnings_Off (F_Type)
+ and then not Has_Size_Clause (F_Type)
+ and then VM_Target = No_VM
+ then
+ Error_Msg_N ("& is an 8-bit Ada Boolean?", Formal);
+ Error_Msg_N
+ ("\use appropriate corresponding type in C "
+ & "(e.g. char)?", Formal);
+
+ -- Check suspicious tagged type
+
+ elsif (Is_Tagged_Type (F_Type)
+ or else (Is_Access_Type (F_Type)
+ and then
+ Is_Tagged_Type
+ (Designated_Type (F_Type))))
+ and then Convention (E) = Convention_C
+ then
+ Error_Msg_N
+ ("?& involves a tagged type which does not "
+ & "correspond to any C type!", Formal);
+
+ -- Check wrong convention subprogram pointer
+
+ elsif Ekind (F_Type) = E_Access_Subprogram_Type
+ and then not Has_Foreign_Convention (F_Type)
+ then
+ Error_Msg_N
+ ("?subprogram pointer & should "
+ & "have foreign convention!", Formal);
+ Error_Msg_Sloc := Sloc (F_Type);
+ Error_Msg_NE
+ ("\?add Convention pragma to declaration of &#",
+ Formal, F_Type);
+ end if;
+
+ -- Turn off name qualification after message output
+
Error_Msg_Qual_Level := 0;
end if;
-- Check for unconstrained array in exported foreign
-- convention case.
- if Convention (E) in Foreign_Convention
+ if Has_Foreign_Convention (E)
and then not Is_Imported (E)
and then Is_Array_Type (F_Type)
and then not Is_Constrained (F_Type)
and then Warn_On_Export_Import
+
+ -- Exclude VM case, since both .NET and JVM can handle
+ -- unconstrained arrays without a problem.
+
+ and then VM_Target = No_VM
then
Error_Msg_Qual_Level := 1;
if Formal = First_Formal (E) then
Error_Msg_NE
- ("?in inherited operation&!", Warn_Node, E);
+ ("?in inherited operation&", Warn_Node, E);
end if;
else
Warn_Node := Formal;
Error_Msg_Qual_Level := 0;
end if;
+ if not From_With_Type (F_Type) then
+ if Is_Access_Type (F_Type) then
+ F_Type := Designated_Type (F_Type);
+ end if;
+
+ -- If the formal is an anonymous_access_to_subprogram
+ -- freeze the subprogram type as well, to prevent
+ -- scope anomalies in gigi, because there is no other
+ -- clear point at which it could be frozen.
+
+ if Is_Itype (Etype (Formal))
+ and then Ekind (F_Type) = E_Subprogram_Type
+ then
+ Freeze_And_Append (F_Type, Loc, Result);
+ end if;
+ end if;
+
Next_Formal (Formal);
end loop;
- -- Check return type
+ -- Case of function: similar checks on return type
if Ekind (E) = E_Function then
- Freeze_And_Append (Etype (E), Loc, Result);
+
+ -- Freeze return type
+
+ R_Type := Etype (E);
+ Freeze_And_Append (R_Type, Loc, Result);
+
+ -- Check suspicious return type for C function
if Warn_On_Export_Import
- and then Is_Fat_C_Ptr_Type (Etype (E))
+ and then (Convention (E) = Convention_C
+ or else
+ Convention (E) = Convention_CPP)
+ and then (Is_Imported (E) or else Is_Exported (E))
then
- Error_Msg_N
- ("?return type of& does not correspond to C pointer",
- E);
+ -- Check suspicious return of fat C pointer
+
+ if Is_Access_Type (R_Type)
+ and then Esize (R_Type) > Ttypes.System_Address_Size
+ and then not Has_Warnings_Off (E)
+ and then not Has_Warnings_Off (R_Type)
+ then
+ Error_Msg_N
+ ("?return type of& does not "
+ & "correspond to C pointer!", E);
+
+ -- Check suspicious return of boolean
+
+ elsif Root_Type (R_Type) = Standard_Boolean
+ and then Convention (R_Type) = Convention_Ada
+ and then VM_Target = No_VM
+ and then not Has_Warnings_Off (E)
+ and then not Has_Warnings_Off (R_Type)
+ and then not Has_Size_Clause (R_Type)
+ then
+ declare
+ N : constant Node_Id :=
+ Result_Definition (Declaration_Node (E));
+ begin
+ Error_Msg_NE
+ ("return type of & is an 8-bit Ada Boolean?",
+ N, E);
+ Error_Msg_NE
+ ("\use appropriate corresponding type in C "
+ & "(e.g. char)?", N, E);
+ end;
+
+ -- Check suspicious return tagged type
+
+ elsif (Is_Tagged_Type (R_Type)
+ or else (Is_Access_Type (R_Type)
+ and then
+ Is_Tagged_Type
+ (Designated_Type (R_Type))))
+ and then Convention (E) = Convention_C
+ and then not Has_Warnings_Off (E)
+ and then not Has_Warnings_Off (R_Type)
+ then
+ Error_Msg_N
+ ("?return type of & does not "
+ & "correspond to C type!", E);
+
+ -- Check return of wrong convention subprogram pointer
+
+ elsif Ekind (R_Type) = E_Access_Subprogram_Type
+ and then not Has_Foreign_Convention (R_Type)
+ and then not Has_Warnings_Off (E)
+ and then not Has_Warnings_Off (R_Type)
+ then
+ Error_Msg_N
+ ("?& should return a foreign "
+ & "convention subprogram pointer", E);
+ Error_Msg_Sloc := Sloc (R_Type);
+ Error_Msg_NE
+ ("\?add Convention pragma to declaration of& #",
+ E, R_Type);
+ end if;
+ end if;
+
+ -- Give warning for suspicous return of a result of an
+ -- unconstrained array type in a foreign convention
+ -- function.
+
+ if Has_Foreign_Convention (E)
+
+ -- We are looking for a return of unconstrained array
+
+ and then Is_Array_Type (R_Type)
+ and then not Is_Constrained (R_Type)
+
+ -- Exclude imported routines, the warning does not
+ -- belong on the import, but on the routine definition.
- elsif Is_Array_Type (Etype (E))
- and then not Is_Constrained (Etype (E))
and then not Is_Imported (E)
- and then Convention (E) in Foreign_Convention
+
+ -- Exclude VM case, since both .NET and JVM can handle
+ -- return of unconstrained arrays without a problem.
+
+ and then VM_Target = No_VM
+
+ -- Check that general warning is enabled, and that it
+ -- is not suppressed for this particular case.
+
and then Warn_On_Export_Import
+ and then not Has_Warnings_Off (E)
+ and then not Has_Warnings_Off (R_Type)
then
Error_Msg_N
("?foreign convention function& should not " &
- "return unconstrained array", E);
+ "return unconstrained array!", E);
end if;
end if;
end;
Freeze_And_Append (Alias (E), Loc, Result);
end if;
- -- If the return type requires a transient scope, and we are on
- -- a target allowing functions to return with a depressed stack
- -- pointer, then we mark the function as requiring this treatment.
+ -- We don't freeze internal subprograms, because we don't normally
+ -- want addition of extra formals or mechanism setting to happen
+ -- for those. However we do pass through predefined dispatching
+ -- cases, since extra formals may be needed in some cases, such as
+ -- for the stream 'Input function (build-in-place formals).
- if Ekind (E) = E_Function
- and then Functions_Return_By_DSP_On_Target
- and then Requires_Transient_Scope (Etype (E))
+ if not Is_Internal (E)
+ or else Is_Predefined_Dispatching_Operation (E)
then
- Set_Function_Returns_With_DSP (E);
- end if;
-
- if not Is_Internal (E) then
Freeze_Subprogram (E);
end if;
else
-- If entity has a type, and it is not a generic unit, then
- -- freeze it first (RM 13.14(10))
+ -- freeze it first (RM 13.14(10)).
if Present (Etype (E))
and then Ekind (E) /= E_Generic_Function
Freeze_And_Append (Etype (E), Loc, Result);
end if;
- -- For object created by object declaration, perform required
- -- categorization (preelaborate and pure) checks. Defer these
- -- checks to freeze time since pragma Import inhibits default
- -- initialization and thus pragma Import affects these checks.
+ -- Special processing for objects created by object declaration
if Nkind (Declaration_Node (E)) = N_Object_Declaration then
+
+ -- Abstract type allowed only for C++ imported variables or
+ -- constants.
+
+ -- Note: we inhibit this check for objects that do not come
+ -- from source because there is at least one case (the
+ -- expansion of x'class'input where x is abstract) where we
+ -- legitimately generate an abstract object.
+
+ if Is_Abstract_Type (Etype (E))
+ and then Comes_From_Source (Parent (E))
+ and then not (Is_Imported (E)
+ and then Is_CPP_Class (Etype (E)))
+ then
+ Error_Msg_N ("type of object cannot be abstract",
+ Object_Definition (Parent (E)));
+
+ if Is_CPP_Class (Etype (E)) then
+ Error_Msg_NE
+ ("\} may need a cpp_constructor",
+ Object_Definition (Parent (E)), Etype (E));
+ end if;
+ end if;
+
+ -- For object created by object declaration, perform required
+ -- categorization (preelaborate and pure) checks. Defer these
+ -- checks to freeze time since pragma Import inhibits default
+ -- initialization and thus pragma Import affects these checks.
+
Validate_Object_Declaration (Declaration_Node (E));
+
+ -- If there is an address clause, check that it is valid
+
Check_Address_Clause (E);
+
+ -- If the object needs any kind of default initialization, an
+ -- error must be issued if No_Default_Initialization applies.
+ -- The check doesn't apply to imported objects, which are not
+ -- ever default initialized, and is why the check is deferred
+ -- until freezing, at which point we know if Import applies.
+ -- Deferred constants are also exempted from this test because
+ -- their completion is explicit, or through an import pragma.
+
+ if Ekind (E) = E_Constant
+ and then Present (Full_View (E))
+ then
+ null;
+
+ elsif Comes_From_Source (E)
+ and then not Is_Imported (E)
+ and then not Has_Init_Expression (Declaration_Node (E))
+ and then
+ ((Has_Non_Null_Base_Init_Proc (Etype (E))
+ and then not No_Initialization (Declaration_Node (E))
+ and then not Is_Value_Type (Etype (E))
+ and then not Suppress_Init_Proc (Etype (E)))
+ or else
+ (Needs_Simple_Initialization (Etype (E))
+ and then not Is_Internal (E)))
+ then
+ Has_Default_Initialization := True;
+ Check_Restriction
+ (No_Default_Initialization, Declaration_Node (E));
+ end if;
+
+ -- Check that a Thread_Local_Storage variable does not have
+ -- default initialization, and any explicit initialization must
+ -- either be the null constant or a static constant.
+
+ if Has_Pragma_Thread_Local_Storage (E) then
+ declare
+ Decl : constant Node_Id := Declaration_Node (E);
+ begin
+ if Has_Default_Initialization
+ or else
+ (Has_Init_Expression (Decl)
+ and then
+ (No (Expression (Decl))
+ or else not
+ (Is_Static_Expression (Expression (Decl))
+ or else
+ Nkind (Expression (Decl)) = N_Null)))
+ then
+ Error_Msg_NE
+ ("Thread_Local_Storage variable& is "
+ & "improperly initialized", Decl, E);
+ Error_Msg_NE
+ ("\only allowed initialization is explicit "
+ & "NULL or static expression", Decl, E);
+ end if;
+ end;
+ end if;
+
+ -- For imported objects, set Is_Public unless there is also an
+ -- address clause, which means that there is no external symbol
+ -- needed for the Import (Is_Public may still be set for other
+ -- unrelated reasons). Note that we delayed this processing
+ -- till freeze time so that we can be sure not to set the flag
+ -- if there is an address clause. If there is such a clause,
+ -- then the only purpose of the Import pragma is to suppress
+ -- implicit initialization.
+
+ if Is_Imported (E)
+ and then No (Address_Clause (E))
+ then
+ Set_Is_Public (E);
+ end if;
+
+ -- For convention C objects of an enumeration type, warn if
+ -- the size is not integer size and no explicit size given.
+ -- Skip warning for Boolean, and Character, assume programmer
+ -- expects 8-bit sizes for these cases.
+
+ if (Convention (E) = Convention_C
+ or else
+ Convention (E) = Convention_CPP)
+ and then Is_Enumeration_Type (Etype (E))
+ and then not Is_Character_Type (Etype (E))
+ and then not Is_Boolean_Type (Etype (E))
+ and then Esize (Etype (E)) < Standard_Integer_Size
+ and then not Has_Size_Clause (E)
+ then
+ Error_Msg_Uint_1 := UI_From_Int (Standard_Integer_Size);
+ Error_Msg_N
+ ("?convention C enumeration object has size less than ^",
+ E);
+ Error_Msg_N ("\?use explicit size clause to set size", E);
+ end if;
end if;
-- Check that a constant which has a pragma Volatile[_Components]
- -- or Atomic[_Components] also has a pragma Import (RM C.6(13))
+ -- or Atomic[_Components] also has a pragma Import (RM C.6(13)).
-- Note: Atomic[_Components] also sets Volatile[_Components]
-- inherited the indication from elsewhere (e.g. an address
-- clause, which is not good enough in RM terms!)
- if Present (Get_Rep_Pragma (E, Name_Atomic))
+ if Has_Rep_Pragma (E, Name_Atomic)
or else
- Present (Get_Rep_Pragma (E, Name_Atomic_Components))
+ Has_Rep_Pragma (E, Name_Atomic_Components)
then
Error_Msg_N
("stand alone atomic constant must be " &
- "imported ('R'M 'C.6(13))", E);
+ "imported (RM C.6(13))", E);
- elsif Present (Get_Rep_Pragma (E, Name_Volatile))
+ elsif Has_Rep_Pragma (E, Name_Volatile)
or else
- Present (Get_Rep_Pragma (E, Name_Volatile_Components))
+ Has_Rep_Pragma (E, Name_Volatile_Components)
then
Error_Msg_N
("stand alone volatile constant must be " &
- "imported ('R'M 'C.6(13))", E);
+ "imported (RM C.6(13))", E);
end if;
end if;
-- Case of a type or subtype being frozen
else
+ -- We used to check here that a full type must have preelaborable
+ -- initialization if it completes a private type specified with
+ -- pragma Preelaborable_Intialization, but that missed cases where
+ -- the types occur within a generic package, since the freezing
+ -- that occurs within a containing scope generally skips traversal
+ -- of a generic unit's declarations (those will be frozen within
+ -- instances). This check was moved to Analyze_Package_Specification.
+
-- The type may be defined in a generic unit. This can occur when
-- freezing a generic function that returns the type (which is
-- defined in a parent unit). It is clearly meaningless to freeze
if E /= Base_Type (E) then
- -- If ancestor subtype present, freeze that first.
- -- Note that this will also get the base type frozen.
+ -- Before we do anything else, a specialized test for the case of
+ -- a size given for an array where the array needs to be packed,
+ -- but was not so the size cannot be honored. This would of course
+ -- be caught by the backend, and indeed we don't catch all cases.
+ -- The point is that we can give a better error message in those
+ -- cases that we do catch with the circuitry here. Also if pragma
+ -- Implicit_Packing is set, this is where the packing occurs.
+
+ -- The reason we do this so early is that the processing in the
+ -- automatic packing case affects the layout of the base type, so
+ -- it must be done before we freeze the base type.
+
+ if Is_Array_Type (E) then
+ declare
+ Lo, Hi : Node_Id;
+ Ctyp : constant Entity_Id := Component_Type (E);
+
+ begin
+ -- Check enabling conditions. These are straightforward
+ -- except for the test for a limited composite type. This
+ -- eliminates the rare case of a array of limited components
+ -- where there are issues of whether or not we can go ahead
+ -- and pack the array (since we can't freely pack and unpack
+ -- arrays if they are limited).
+
+ -- Note that we check the root type explicitly because the
+ -- whole point is we are doing this test before we have had
+ -- a chance to freeze the base type (and it is that freeze
+ -- action that causes stuff to be inherited).
+
+ if Present (Size_Clause (E))
+ and then Known_Static_Esize (E)
+ and then not Is_Packed (E)
+ and then not Has_Pragma_Pack (E)
+ and then Number_Dimensions (E) = 1
+ and then not Has_Component_Size_Clause (E)
+ and then Known_Static_Esize (Ctyp)
+ and then not Is_Limited_Composite (E)
+ and then not Is_Packed (Root_Type (E))
+ and then not Has_Component_Size_Clause (Root_Type (E))
+ and then not CodePeer_Mode
+ then
+ Get_Index_Bounds (First_Index (E), Lo, Hi);
+
+ if Compile_Time_Known_Value (Lo)
+ and then Compile_Time_Known_Value (Hi)
+ and then Known_Static_RM_Size (Ctyp)
+ and then RM_Size (Ctyp) < 64
+ then
+ declare
+ Lov : constant Uint := Expr_Value (Lo);
+ Hiv : constant Uint := Expr_Value (Hi);
+ Len : constant Uint := UI_Max
+ (Uint_0,
+ Hiv - Lov + 1);
+ Rsiz : constant Uint := RM_Size (Ctyp);
+ SZ : constant Node_Id := Size_Clause (E);
+ Btyp : constant Entity_Id := Base_Type (E);
+
+ -- What we are looking for here is the situation where
+ -- the RM_Size given would be exactly right if there
+ -- was a pragma Pack (resulting in the component size
+ -- being the same as the RM_Size). Furthermore, the
+ -- component type size must be an odd size (not a
+ -- multiple of storage unit). If the component RM size
+ -- is an exact number of storage units that is a power
+ -- of two, the array is not packed and has a standard
+ -- representation.
+
+ begin
+ if RM_Size (E) = Len * Rsiz
+ and then Rsiz mod System_Storage_Unit /= 0
+ then
+ -- For implicit packing mode, just set the
+ -- component size silently.
+
+ if Implicit_Packing then
+ Set_Component_Size (Btyp, Rsiz);
+ Set_Is_Bit_Packed_Array (Btyp);
+ Set_Is_Packed (Btyp);
+ Set_Has_Non_Standard_Rep (Btyp);
+
+ -- Otherwise give an error message
+
+ else
+ Error_Msg_NE
+ ("size given for& too small", SZ, E);
+ Error_Msg_N -- CODEFIX
+ ("\use explicit pragma Pack "
+ & "or use pragma Implicit_Packing", SZ);
+ end if;
+
+ elsif RM_Size (E) = Len * Rsiz
+ and then Implicit_Packing
+ and then
+ (Rsiz / System_Storage_Unit = 1
+ or else Rsiz / System_Storage_Unit = 2
+ or else Rsiz / System_Storage_Unit = 4)
+ then
+
+ -- Not a packed array, but indicate the desired
+ -- component size, for the back-end.
+
+ Set_Component_Size (Btyp, Rsiz);
+ end if;
+ end;
+ end if;
+ end if;
+ end;
+ end if;
+
+ -- If ancestor subtype present, freeze that first. Note that this
+ -- will also get the base type frozen.
Atype := Ancestor_Subtype (E);
if Present (Atype) then
Freeze_And_Append (Atype, Loc, Result);
- -- Otherwise freeze the base type of the entity before
- -- freezing the entity itself, (RM 13.14(15)).
+ -- Otherwise freeze the base type of the entity before freezing
+ -- the entity itself (RM 13.14(15)).
elsif E /= Base_Type (E) then
Freeze_And_Append (Base_Type (E), Loc, Result);
if Is_Array_Type (E) then
declare
Ctyp : constant Entity_Id := Component_Type (E);
- Pnod : Node_Id;
Non_Standard_Enum : Boolean := False;
- -- Set true if any of the index types is an enumeration
- -- type with a non-standard representation.
+ -- Set true if any of the index types is an enumeration type
+ -- with a non-standard representation.
begin
Freeze_And_Append (Ctyp, Loc, Result);
-- processing is only done for base types, since all the
-- representation aspects involved are type-related. This
-- is not just an optimization, if we start processing the
- -- subtypes, they intefere with the settings on the base
+ -- subtypes, they interfere with the settings on the base
-- type (this is because Is_Packed has a slightly different
-- meaning before and after freezing).
Csiz := Uint_0;
end if;
- -- Set component size up to match alignment if
- -- it would otherwise be less than the alignment.
- -- This deals with cases of types whose alignment
- -- exceeds their sizes (padded types).
+ -- Set component size up to match alignment if it
+ -- would otherwise be less than the alignment. This
+ -- deals with cases of types whose alignment exceeds
+ -- their size (padded types).
if Csiz /= 0 then
declare
A : constant Uint := Alignment_In_Bits (Ctyp);
-
begin
if Csiz < A then
Csiz := A;
end if;
end;
end if;
-
end if;
+ -- Case of component size that may result in packing
+
if 1 <= Csiz and then Csiz <= 64 then
+ declare
+ Ent : constant Entity_Id :=
+ First_Subtype (E);
+ Pack_Pragma : constant Node_Id :=
+ Get_Rep_Pragma (Ent, Name_Pack);
+ Comp_Size_C : constant Node_Id :=
+ Get_Attribute_Definition_Clause
+ (Ent, Attribute_Component_Size);
+ begin
+ -- Warn if we have pack and component size so that
+ -- the pack is ignored.
- -- We set the component size for all cases 1-64
+ -- Note: here we must check for the presence of a
+ -- component size before checking for a Pack pragma
+ -- to deal with the case where the array type is a
+ -- derived type whose parent is currently private.
- Set_Component_Size (Base_Type (E), Csiz);
+ if Present (Comp_Size_C)
+ and then Has_Pragma_Pack (Ent)
+ then
+ Error_Msg_Sloc := Sloc (Comp_Size_C);
+ Error_Msg_NE
+ ("?pragma Pack for& ignored!",
+ Pack_Pragma, Ent);
+ Error_Msg_N
+ ("\?explicit component size given#!",
+ Pack_Pragma);
+ end if;
- -- Check for base type of 8,16,32 bits, where the
- -- subtype has a length one less than the base type
- -- and is unsigned (e.g. Natural subtype of Integer)
+ -- Set component size if not already set by a
+ -- component size clause.
- -- In such cases, if a component size was not set
- -- explicitly, then generate a warning.
+ if not Present (Comp_Size_C) then
+ Set_Component_Size (E, Csiz);
+ end if;
- if Has_Pragma_Pack (E)
- and then not Has_Component_Size_Clause (E)
- and then
- (Csiz = 7 or else Csiz = 15 or else Csiz = 31)
- and then Esize (Base_Type (Ctyp)) = Csiz + 1
- then
- Error_Msg_Uint_1 := Csiz;
- Pnod :=
- Get_Rep_Pragma (First_Subtype (E), Name_Pack);
+ -- Check for base type of 8, 16, 32 bits, where an
+ -- unsigned subtype has a length one less than the
+ -- base type (e.g. Natural subtype of Integer).
- if Present (Pnod) then
- Error_Msg_N
- ("pragma Pack causes component size to be ^?",
- Pnod);
- Error_Msg_N
- ("\use Component_Size to set desired value",
- Pnod);
+ -- In such cases, if a component size was not set
+ -- explicitly, then generate a warning.
+
+ if Has_Pragma_Pack (E)
+ and then not Present (Comp_Size_C)
+ and then
+ (Csiz = 7 or else Csiz = 15 or else Csiz = 31)
+ and then Esize (Base_Type (Ctyp)) = Csiz + 1
+ then
+ Error_Msg_Uint_1 := Csiz;
+
+ if Present (Pack_Pragma) then
+ Error_Msg_N
+ ("?pragma Pack causes component size "
+ & "to be ^!", Pack_Pragma);
+ Error_Msg_N
+ ("\?use Component_Size to set "
+ & "desired value!", Pack_Pragma);
+ end if;
end if;
- end if;
- -- Actual packing is not needed for 8,16,32,64
- -- Also not needed for 24 if alignment is 1
+ -- Actual packing is not needed for 8, 16, 32, 64.
+ -- Also not needed for 24 if alignment is 1.
- if Csiz = 8
- or else Csiz = 16
- or else Csiz = 32
- or else Csiz = 64
- or else (Csiz = 24 and then Alignment (Ctyp) = 1)
- then
- -- Here the array was requested to be packed, but
- -- the packing request had no effect, so Is_Packed
- -- is reset.
+ if Csiz = 8
+ or else Csiz = 16
+ or else Csiz = 32
+ or else Csiz = 64
+ or else (Csiz = 24 and then Alignment (Ctyp) = 1)
+ then
+ -- Here the array was requested to be packed,
+ -- but the packing request had no effect, so
+ -- Is_Packed is reset.
- -- Note: semantically this means that we lose
- -- track of the fact that a derived type inherited
- -- a pack pragma that was non-effective, but that
- -- seems fine.
+ -- Note: semantically this means that we lose
+ -- track of the fact that a derived type
+ -- inherited a pragma Pack that was non-
+ -- effective, but that seems fine.
- -- We regard a Pack pragma as a request to set a
- -- representation characteristic, and this request
- -- may be ignored.
+ -- We regard a Pack pragma as a request to set
+ -- a representation characteristic, and this
+ -- request may be ignored.
- Set_Is_Packed (Base_Type (E), False);
+ Set_Is_Packed (Base_Type (E), False);
- -- In all other cases, packing is indeed needed
+ -- In all other cases, packing is indeed needed
- else
- Set_Has_Non_Standard_Rep (Base_Type (E));
- Set_Is_Bit_Packed_Array (Base_Type (E));
- Set_Is_Packed (Base_Type (E));
- end if;
+ else
+ Set_Has_Non_Standard_Rep (Base_Type (E));
+ Set_Is_Bit_Packed_Array (Base_Type (E));
+ Set_Is_Packed (Base_Type (E));
+ end if;
+ end;
end if;
end;
if Unknown_Alignment (E) then
Set_Alignment (E, Alignment (Base_Type (E)));
+ Adjust_Esize_Alignment (E);
end if;
end if;
-- For bit-packed arrays, check the size
- if Is_Bit_Packed_Array (E)
- and then Known_Esize (E)
- then
+ if Is_Bit_Packed_Array (E) and then Known_RM_Size (E) then
declare
+ SizC : constant Node_Id := Size_Clause (E);
+
Discard : Boolean;
- SizC : constant Node_Id := Size_Clause (E);
+ pragma Warnings (Off, Discard);
begin
-- It is not clear if it is possible to have no size
- -- clause at this stage, but this is not worth worrying
- -- about. Post the error on the entity name in the size
+ -- clause at this stage, but it is not worth worrying
+ -- about. Post error on the entity name in the size
-- clause if present, else on the type entity itself.
if Present (SizC) then
- Check_Size (Name (SizC), E, Esize (E), Discard);
+ Check_Size (Name (SizC), E, RM_Size (E), Discard);
else
- Check_Size (E, E, Esize (E), Discard);
+ Check_Size (E, E, RM_Size (E), Discard);
end if;
end;
end if;
- -- Check one common case of a size given where the array
- -- needs to be packed, but was not so the size cannot be
- -- honored. This would of course be caught by the backend,
- -- and indeed we don't catch all cases. The point is that
- -- we can give a better error message in those cases that
- -- we do catch with the circuitry here.
-
- declare
- Lo, Hi : Node_Id;
- Ctyp : constant Entity_Id := Component_Type (E);
-
- begin
- if Present (Size_Clause (E))
- and then Known_Static_Esize (E)
- and then not Is_Bit_Packed_Array (E)
- and then not Has_Pragma_Pack (E)
- and then Number_Dimensions (E) = 1
- and then not Has_Component_Size_Clause (E)
- and then Known_Static_Esize (Ctyp)
- then
- Get_Index_Bounds (First_Index (E), Lo, Hi);
-
- if Compile_Time_Known_Value (Lo)
- and then Compile_Time_Known_Value (Hi)
- and then Known_Static_RM_Size (Ctyp)
- and then RM_Size (Ctyp) < 64
- then
- declare
- Lov : constant Uint := Expr_Value (Lo);
- Hiv : constant Uint := Expr_Value (Hi);
- Len : constant Uint :=
- UI_Max (Uint_0, Hiv - Lov + 1);
- Rsiz : constant Uint := RM_Size (Ctyp);
-
- -- What we are looking for here is the situation
- -- where the Esize given would be exactly right
- -- if there was a pragma Pack (resulting in the
- -- component size being the same as the RM_Size).
- -- Furthermore, the component type size must be
- -- an odd size (not a multiple of storage unit)
-
- begin
- if Esize (E) = Len * Rsiz
- and then Rsiz mod System_Storage_Unit /= 0
- then
- Error_Msg_NE
- ("size given for& too small",
- Size_Clause (E), E);
- Error_Msg_N
- ("\explicit pragma Pack is required",
- Size_Clause (E));
- end if;
- end;
- end if;
- end if;
- end;
-
-- If any of the index types was an enumeration type with
-- a non-standard rep clause, then we indicate that the
-- array type is always packed (even if it is not bit packed).
Freeze_And_Append (Packed_Array_Type (E), Loc, Result);
-- Size information of packed array type is copied to the
- -- array type, since this is really the representation.
+ -- array type, since this is really the representation. But
+ -- do not override explicit existing size values. If the
+ -- ancestor subtype is constrained the packed_array_type
+ -- will be inherited from it, but the size may have been
+ -- provided already, and must not be overridden either.
+
+ if not Has_Size_Clause (E)
+ and then
+ (No (Ancestor_Subtype (E))
+ or else not Has_Size_Clause (Ancestor_Subtype (E)))
+ then
+ Set_Esize (E, Esize (Packed_Array_Type (E)));
+ Set_RM_Size (E, RM_Size (Packed_Array_Type (E)));
+ end if;
- Set_Size_Info (E, Packed_Array_Type (E));
- Set_RM_Size (E, RM_Size (Packed_Array_Type (E)));
+ if not Has_Alignment_Clause (E) then
+ Set_Alignment (E, Alignment (Packed_Array_Type (E)));
+ end if;
end if;
- -- For non-packed arrays set the alignment of the array
- -- to the alignment of the component type if it is unknown.
- -- Skip this in the atomic case, since atomic arrays may
- -- need larger alignments.
+ -- For non-packed arrays set the alignment of the array to the
+ -- alignment of the component type if it is unknown. Skip this
+ -- in atomic case (atomic arrays may need larger alignments).
if not Is_Packed (E)
and then Unknown_Alignment (E)
elsif Is_Class_Wide_Type (E) then
Freeze_And_Append (Root_Type (E), Loc, Result);
+ -- If the base type of the class-wide type is still incomplete,
+ -- the class-wide remains unfrozen as well. This is legal when
+ -- E is the formal of a primitive operation of some other type
+ -- which is being frozen.
+
+ if not Is_Frozen (Root_Type (E)) then
+ Set_Is_Frozen (E, False);
+ return Result;
+ end if;
+
-- If the Class_Wide_Type is an Itype (when type is the anonymous
-- parent of a derived type) and it is a library-level entity,
-- generate an itype reference for it. Otherwise, its first
end;
end if;
- -- The equivalent type associated with a class-wide subtype
- -- needs to be frozen to ensure that its layout is done.
- -- Class-wide subtypes are currently only frozen on targets
- -- requiring front-end layout (see New_Class_Wide_Subtype
- -- and Make_CW_Equivalent_Type in exp_util.adb).
+ -- The equivalent type associated with a class-wide subtype needs
+ -- to be frozen to ensure that its layout is done.
if Ekind (E) = E_Class_Wide_Subtype
and then Present (Equivalent_Type (E))
end if;
-- For a record (sub)type, freeze all the component types (RM
- -- 13.14(15). We test for E_Record_(sub)Type here, rather than
- -- using Is_Record_Type, because we don't want to attempt the
- -- freeze for the case of a private type with record extension
- -- (we will do that later when the full type is frozen).
+ -- 13.14(15). We test for E_Record_(sub)Type here, rather than using
+ -- Is_Record_Type, because we don't want to attempt the freeze for
+ -- the case of a private type with record extension (we will do that
+ -- later when the full type is frozen).
elsif Ekind (E) = E_Record_Type
- or else Ekind (E) = E_Record_Subtype
+ or else Ekind (E) = E_Record_Subtype
then
Freeze_Record_Type (E);
-- For a concurrent type, freeze corresponding record type. This
- -- does not correpond to any specific rule in the RM, but the
+ -- does not correspond to any specific rule in the RM, but the
-- record type is essentially part of the concurrent type.
-- Freeze as well all local entities. This includes record types
-- created for entry parameter blocks, and whatever local entities
end if;
Comp := First_Entity (E);
-
while Present (Comp) loop
if Is_Type (Comp) then
Freeze_And_Append (Comp, Loc, Result);
elsif (Ekind (Comp)) /= E_Function then
+ if Is_Itype (Etype (Comp))
+ and then Underlying_Type (Scope (Etype (Comp))) = E
+ then
+ Undelay_Type (Etype (Comp));
+ end if;
+
Freeze_And_Append (Etype (Comp), Loc, Result);
end if;
Next_Entity (Comp);
end loop;
- -- Private types are required to point to the same freeze node
- -- as their corresponding full views. The freeze node itself
- -- has to point to the partial view of the entity (because
- -- from the partial view, we can retrieve the full view, but
- -- not the reverse). However, in order to freeze correctly,
- -- we need to freeze the full view. If we are freezing at the
- -- end of a scope (or within the scope of the private type),
- -- the partial and full views will have been swapped, the
- -- full view appears first in the entity chain and the swapping
- -- mechanism ensures that the pointers are properly set (on
- -- scope exit).
-
- -- If we encounter the partial view before the full view
- -- (e.g. when freezing from another scope), we freeze the
- -- full view, and then set the pointers appropriately since
- -- we cannot rely on swapping to fix things up (subtypes in an
- -- outer scope might not get swapped).
+ -- Private types are required to point to the same freeze node as
+ -- their corresponding full views. The freeze node itself has to
+ -- point to the partial view of the entity (because from the partial
+ -- view, we can retrieve the full view, but not the reverse).
+ -- However, in order to freeze correctly, we need to freeze the full
+ -- view. If we are freezing at the end of a scope (or within the
+ -- scope of the private type), the partial and full views will have
+ -- been swapped, the full view appears first in the entity chain and
+ -- the swapping mechanism ensures that the pointers are properly set
+ -- (on scope exit).
+
+ -- If we encounter the partial view before the full view (e.g. when
+ -- freezing from another scope), we freeze the full view, and then
+ -- set the pointers appropriately since we cannot rely on swapping to
+ -- fix things up (subtypes in an outer scope might not get swapped).
elsif Is_Incomplete_Or_Private_Type (E)
and then not Is_Generic_Type (E)
then
+ -- The construction of the dispatch table associated with library
+ -- level tagged types forces freezing of all the primitives of the
+ -- type, which may cause premature freezing of the partial view.
+ -- For example:
+
+ -- package Pkg is
+ -- type T is tagged private;
+ -- type DT is new T with private;
+ -- procedure Prim (X : in out T; Y : in out DT'class);
+ -- private
+ -- type T is tagged null record;
+ -- Obj : T;
+ -- type DT is new T with null record;
+ -- end;
+
+ -- In this case the type will be frozen later by the usual
+ -- mechanism: an object declaration, an instantiation, or the
+ -- end of a declarative part.
+
+ if Is_Library_Level_Tagged_Type (E)
+ and then not Present (Full_View (E))
+ then
+ Set_Is_Frozen (E, False);
+ return Result;
+
-- Case of full view present
- if Present (Full_View (E)) then
+ elsif Present (Full_View (E)) then
- -- If full view has already been frozen, then no
- -- further processing is required
+ -- If full view has already been frozen, then no further
+ -- processing is required
if Is_Frozen (Full_View (E)) then
Set_Freeze_Node (E, Empty);
Check_Debug_Info_Needed (E);
- -- Otherwise freeze full view and patch the pointers
- -- so that the freeze node will elaborate both views
- -- in the back-end.
+ -- Otherwise freeze full view and patch the pointers so that
+ -- the freeze node will elaborate both views in the back-end.
else
declare
Set_Entity (F_Node, E);
else
- -- {Incomplete,Private}_Subtypes
- -- with Full_Views constrained by discriminants
+ -- {Incomplete,Private}_Subtypes with Full_Views
+ -- constrained by discriminants.
Set_Has_Delayed_Freeze (E, False);
Set_Freeze_Node (E, Empty);
Check_Debug_Info_Needed (E);
end if;
- -- AI-117 requires that the convention of a partial view
- -- be the same as the convention of the full view. Note
- -- that this is a recognized breach of privacy, but it's
- -- essential for logical consistency of representation,
- -- and the lack of a rule in RM95 was an oversight.
+ -- AI-117 requires that the convention of a partial view be the
+ -- same as the convention of the full view. Note that this is a
+ -- recognized breach of privacy, but it's essential for logical
+ -- consistency of representation, and the lack of a rule in
+ -- RM95 was an oversight.
Set_Convention (E, Convention (Full_View (E)));
Size_Known_At_Compile_Time (Full_View (E)));
-- Size information is copied from the full view to the
- -- incomplete or private view for consistency
+ -- incomplete or private view for consistency.
- -- We skip this is the full view is not a type. This is
- -- very strange of course, and can only happen as a result
- -- of certain illegalities, such as a premature attempt to
- -- derive from an incomplete type.
+ -- We skip this is the full view is not a type. This is very
+ -- strange of course, and can only happen as a result of
+ -- certain illegalities, such as a premature attempt to derive
+ -- from an incomplete type.
if Is_Type (Full_View (E)) then
Set_Size_Info (E, Full_View (E));
-- For access subprogram, freeze types of all formals, the return
-- type was already frozen, since it is the Etype of the function.
+ -- Formal types can be tagged Taft amendment types, but otherwise
+ -- they cannot be incomplete.
elsif Ekind (E) = E_Subprogram_Type then
Formal := First_Formal (E);
+
while Present (Formal) loop
+ if Ekind (Etype (Formal)) = E_Incomplete_Type
+ and then No (Full_View (Etype (Formal)))
+ and then not Is_Value_Type (Etype (Formal))
+ then
+ if Is_Tagged_Type (Etype (Formal)) then
+ null;
+ else
+ Error_Msg_NE
+ ("invalid use of incomplete type&", E, Etype (Formal));
+ end if;
+ end if;
+
Freeze_And_Append (Etype (Formal), Loc, Result);
Next_Formal (Formal);
end loop;
- -- If the return type requires a transient scope, and we are on
- -- a target allowing functions to return with a depressed stack
- -- pointer, then we mark the function as requiring this treatment.
-
- if Functions_Return_By_DSP_On_Target
- and then Requires_Transient_Scope (Etype (E))
- then
- Set_Function_Returns_With_DSP (E);
- end if;
-
Freeze_Subprogram (E);
- -- For access to a protected subprogram, freeze the equivalent
- -- type (however this is not set if we are not generating code)
- -- or if this is an anonymous type used just for resolution).
+ -- For access to a protected subprogram, freeze the equivalent type
+ -- (however this is not set if we are not generating code or if this
+ -- is an anonymous type used just for resolution).
- elsif Ekind (E) = E_Access_Protected_Subprogram_Type
- and then Operating_Mode = Generate_Code
- and then Present (Equivalent_Type (E))
- then
- Freeze_And_Append (Equivalent_Type (E), Loc, Result);
+ elsif Is_Access_Protected_Subprogram_Type (E) then
+ if Present (Equivalent_Type (E)) then
+ Freeze_And_Append (Equivalent_Type (E), Loc, Result);
+ end if;
end if;
-- Generic types are never seen by the back-end, and are also not
if Is_Fixed_Point_Type (E) then
Freeze_Fixed_Point_Type (E);
- -- Some error checks required for ordinary fixed-point type.
- -- Defer these till the freeze-point since we need the small
- -- and range values. We only do these checks for base types
+ -- Some error checks required for ordinary fixed-point type. Defer
+ -- these till the freeze-point since we need the small and range
+ -- values. We only do these checks for base types
if Is_Ordinary_Fixed_Point_Type (E)
and then E = Base_Type (E)
if Small_Value (E) < Ureal_2_M_80 then
Error_Msg_Name_1 := Name_Small;
Error_Msg_N
- ("`&''%` is too small, minimum is 2.0'*'*(-80)", E);
+ ("`&''%` too small, minimum allowed is 2.0'*'*(-80)", E);
elsif Small_Value (E) > Ureal_2_80 then
Error_Msg_Name_1 := Name_Small;
Error_Msg_N
- ("`&''%` is too large, maximum is 2.0'*'*80", E);
+ ("`&''%` too large, maximum allowed is 2.0'*'*80", E);
end if;
if Expr_Value_R (Type_Low_Bound (E)) < Ureal_M_10_36 then
Error_Msg_Name_1 := Name_First;
Error_Msg_N
- ("`&''%` is too small, minimum is -10.0'*'*36", E);
+ ("`&''%` too small, minimum allowed is -10.0'*'*36", E);
end if;
if Expr_Value_R (Type_High_Bound (E)) > Ureal_10_36 then
Error_Msg_Name_1 := Name_Last;
Error_Msg_N
- ("`&''%` is too large, maximum is 10.0'*'*36", E);
+ ("`&''%` too large, maximum allowed is 10.0'*'*36", E);
end if;
end if;
elsif Is_Integer_Type (E) then
Adjust_Esize_For_Alignment (E);
- elsif Is_Access_Type (E)
- and then No (Associated_Storage_Pool (E))
- then
- Check_Restriction (No_Standard_Storage_Pools, E);
- end if;
+ if Is_Modular_Integer_Type (E)
+ and then Warn_On_Suspicious_Modulus_Value
+ then
+ Check_Suspicious_Modulus (E);
+ end if;
- -- If the current entity is an array or record subtype and has
- -- discriminants used to constrain it, it must not freeze, because
- -- Freeze_Entity nodes force Gigi to process the frozen type.
+ elsif Is_Access_Type (E) then
- if Is_Composite_Type (E) then
+ -- Check restriction for standard storage pool
- if Is_Array_Type (E) then
- declare
- Index : Node_Id := First_Index (E);
- Expr1 : Node_Id;
- Expr2 : Node_Id;
+ if No (Associated_Storage_Pool (E)) then
+ Check_Restriction (No_Standard_Storage_Pools, E);
+ end if;
- begin
- while Present (Index) loop
- if Etype (Index) /= Any_Type then
- Get_Index_Bounds (Index, Expr1, Expr2);
+ -- Deal with error message for pure access type. This is not an
+ -- error in Ada 2005 if there is no pool (see AI-366).
- for J in 1 .. 2 loop
- if Nkind (Expr1) = N_Identifier
- and then Ekind (Entity (Expr1)) = E_Discriminant
- then
- Set_Has_Delayed_Freeze (E, False);
- Set_Freeze_Node (E, Empty);
- Check_Debug_Info_Needed (E);
- return Result;
- end if;
+ if Is_Pure_Unit_Access_Type (E)
+ and then (Ada_Version < Ada_05
+ or else not No_Pool_Assigned (E))
+ then
+ Error_Msg_N ("named access type not allowed in pure unit", E);
- Expr1 := Expr2;
- end loop;
- end if;
+ if Ada_Version >= Ada_05 then
+ Error_Msg_N
+ ("\would be legal if Storage_Size of 0 given?", E);
- Next_Index (Index);
- end loop;
- end;
+ elsif No_Pool_Assigned (E) then
+ Error_Msg_N
+ ("\would be legal in Ada 2005?", E);
- elsif Has_Discriminants (E)
- and Is_Constrained (E)
- then
- declare
- Constraint : Elmt_Id;
- Expr : Node_Id;
+ else
+ Error_Msg_N
+ ("\would be legal in Ada 2005 if "
+ & "Storage_Size of 0 given?", E);
+ end if;
+ end if;
+ end if;
- begin
- Constraint := First_Elmt (Discriminant_Constraint (E));
- while Present (Constraint) loop
- Expr := Node (Constraint);
- if Nkind (Expr) = N_Identifier
- and then Ekind (Entity (Expr)) = E_Discriminant
- then
- Set_Has_Delayed_Freeze (E, False);
- Set_Freeze_Node (E, Empty);
- Check_Debug_Info_Needed (E);
- return Result;
- end if;
+ -- Case of composite types
- Next_Elmt (Constraint);
- end loop;
- end;
- end if;
+ if Is_Composite_Type (E) then
- -- AI-117 requires that all new primitives of a tagged type
- -- must inherit the convention of the full view of the type.
- -- Inherited and overriding operations are defined to inherit
- -- the convention of their parent or overridden subprogram
- -- (also specified in AI-117), and that will have occurred
- -- earlier (in Derive_Subprogram and New_Overloaded_Entity).
- -- Here we set the convention of primitives that are still
- -- convention Ada, which will ensure that any new primitives
- -- inherit the type's convention. Class-wide types can have
- -- a foreign convention inherited from their specific type,
- -- but are excluded from this since they don't have any
- -- associated primitives.
+ -- AI-117 requires that all new primitives of a tagged type must
+ -- inherit the convention of the full view of the type. Inherited
+ -- and overriding operations are defined to inherit the convention
+ -- of their parent or overridden subprogram (also specified in
+ -- AI-117), which will have occurred earlier (in Derive_Subprogram
+ -- and New_Overloaded_Entity). Here we set the convention of
+ -- primitives that are still convention Ada, which will ensure
+ -- that any new primitives inherit the type's convention. Class-
+ -- wide types can have a foreign convention inherited from their
+ -- specific type, but are excluded from this since they don't have
+ -- any associated primitives.
if Is_Tagged_Type (E)
and then not Is_Class_Wide_Type (E)
end if;
end if;
- -- Generate primitive operation references for a tagged type
-
- if Is_Tagged_Type (E)
- and then not Is_Class_Wide_Type (E)
- then
- declare
- Prim_List : constant Elist_Id := Primitive_Operations (E);
- Prim : Elmt_Id;
- Ent : Entity_Id;
-
- begin
- Prim := First_Elmt (Prim_List);
- while Present (Prim) loop
- Ent := Node (Prim);
-
- -- If the operation is derived, get the original for
- -- cross-reference purposes (it is the original for
- -- which we want the xref, and for which the comes
- -- from source test needs to be performed).
-
- while Present (Alias (Ent)) loop
- Ent := Alias (Ent);
- end loop;
-
- Generate_Reference (E, Ent, 'p', Set_Ref => False);
- Next_Elmt (Prim);
- end loop;
-
- -- If we get an exception, then something peculiar has happened
- -- probably as a result of a previous error. Since this is only
- -- for non-critical cross-references, ignore the error.
-
- exception
- when others => null;
- end;
- end if;
-
- -- Now that all types from which E may depend are frozen, see
- -- if the size is known at compile time, if it must be unsigned,
- -- or if strict alignent is required
+ -- Now that all types from which E may depend are frozen, see if the
+ -- size is known at compile time, if it must be unsigned, or if
+ -- strict alignment is required
Check_Compile_Time_Size (E);
Check_Unsigned_Type (E);
if Has_Size_Clause (E)
and then not Size_Known_At_Compile_Time (E)
then
- -- Supress this message if errors posted on E, even if we are
+ -- Suppress this message if errors posted on E, even if we are
-- in all errors mode, since this is often a junk message
if not Error_Posted (E) then
-- in particular the size and alignment values. This processing is
-- not required for generic types, since generic types do not play
-- any part in code generation, and so the size and alignment values
- -- for suhc types are irrelevant.
+ -- for such types are irrelevant.
if Is_Generic_Type (E) then
return Result;
if Result = No_List then
Result := Empty_List;
end if;
-
- Generate_Subprogram_Descriptor_For_Imported_Subprogram
- (E, Result);
end if;
end if;
procedure Freeze_Enumeration_Type (Typ : Entity_Id) is
begin
+ -- By default, if no size clause is present, an enumeration type with
+ -- Convention C is assumed to interface to a C enum, and has integer
+ -- size. This applies to types. For subtypes, verify that its base
+ -- type has no size clause either.
+
if Has_Foreign_Convention (Typ)
and then not Has_Size_Clause (Typ)
+ and then not Has_Size_Clause (Base_Type (Typ))
and then Esize (Typ) < Standard_Integer_Size
then
Init_Esize (Typ, Standard_Integer_Size);
+
else
+ -- If the enumeration type interfaces to C, and it has a size clause
+ -- that specifies less than int size, it warrants a warning. The
+ -- user may intend the C type to be an enum or a char, so this is
+ -- not by itself an error that the Ada compiler can detect, but it
+ -- it is a worth a heads-up. For Boolean and Character types we
+ -- assume that the programmer has the proper C type in mind.
+
+ if Convention (Typ) = Convention_C
+ and then Has_Size_Clause (Typ)
+ and then Esize (Typ) /= Esize (Standard_Integer)
+ and then not Is_Boolean_Type (Typ)
+ and then not Is_Character_Type (Typ)
+ then
+ Error_Msg_N
+ ("C enum types have the size of a C int?", Size_Clause (Typ));
+ end if;
+
Adjust_Esize_For_Alignment (Typ);
end if;
end Freeze_Enumeration_Type;
-----------------------
procedure Freeze_Expression (N : Node_Id) is
- In_Def_Exp : constant Boolean := In_Default_Expression;
- Typ : Entity_Id;
- Nam : Entity_Id;
- Desig_Typ : Entity_Id;
- P : Node_Id;
- Parent_P : Node_Id;
+ In_Spec_Exp : constant Boolean := In_Spec_Expression;
+ Typ : Entity_Id;
+ Nam : Entity_Id;
+ Desig_Typ : Entity_Id;
+ P : Node_Id;
+ Parent_P : Node_Id;
Freeze_Outside : Boolean := False;
-- This flag is set true if the entity must be frozen outside the
function In_Exp_Body (N : Node_Id) return Boolean;
-- Given an N_Handled_Sequence_Of_Statements node N, determines whether
- -- it is the handled statement sequence of an expander generated
- -- subprogram (init proc, or stream subprogram). If so, it returns
- -- True, otherwise False.
+ -- it is the handled statement sequence of an expander-generated
+ -- subprogram (init proc, stream subprogram, or renaming as body).
+ -- If so, this is not a freezing context.
-----------------
-- In_Exp_Body --
-----------------
function In_Exp_Body (N : Node_Id) return Boolean is
- P : Node_Id;
+ P : Node_Id;
+ Id : Entity_Id;
begin
if Nkind (N) = N_Subprogram_Body then
return False;
else
- P := Defining_Unit_Name (Specification (P));
-
- if Nkind (P) = N_Defining_Identifier
- and then (Is_Init_Proc (P) or else
- Is_TSS (P, TSS_Stream_Input) or else
- Is_TSS (P, TSS_Stream_Output) or else
- Is_TSS (P, TSS_Stream_Read) or else
- Is_TSS (P, TSS_Stream_Write))
+ Id := Defining_Unit_Name (Specification (P));
+
+ if Nkind (Id) = N_Defining_Identifier
+ and then (Is_Init_Proc (Id) or else
+ Is_TSS (Id, TSS_Stream_Input) or else
+ Is_TSS (Id, TSS_Stream_Output) or else
+ Is_TSS (Id, TSS_Stream_Read) or else
+ Is_TSS (Id, TSS_Stream_Write) or else
+ Nkind (Original_Node (P)) =
+ N_Subprogram_Renaming_Declaration)
then
return True;
else
-- Start of processing for Freeze_Expression
begin
- -- Immediate return if freezing is inhibited. This flag is set by
- -- the analyzer to stop freezing on generated expressions that would
- -- cause freezing if they were in the source program, but which are
- -- not supposed to freeze, since they are created.
+ -- Immediate return if freezing is inhibited. This flag is set by the
+ -- analyzer to stop freezing on generated expressions that would cause
+ -- freezing if they were in the source program, but which are not
+ -- supposed to freeze, since they are created.
if Must_Not_Freeze (N) then
return;
-- make sure that we actually have a real expression (if we have
-- a subtype indication, we can't test Is_Static_Expression!)
- if In_Def_Exp
+ if In_Spec_Exp
and then Nkind (N) in N_Subexpr
and then not Is_Static_Expression (N)
then
Nam := Empty;
end if;
- -- For an allocator freeze designated type if not frozen already.
+ -- For an allocator freeze designated type if not frozen already
+
+ -- For an aggregate whose component type is an access type, freeze the
+ -- designated type now, so that its freeze does not appear within the
+ -- loop that might be created in the expansion of the aggregate. If the
+ -- designated type is a private type without full view, the expression
+ -- cannot contain an allocator, so the type is not frozen.
- -- For an aggregate whose component type is an access type, freeze
- -- the designated type now, so that its freeze does not appear within
- -- the loop that might be created in the expansion of the aggregate.
- -- If the designated type is a private type without full view, the
- -- expression cannot contain an allocator, so the type is not frozen.
+ -- For a function, we freeze the entity when the subprogram declaration
+ -- is frozen, but a function call may appear in an initialization proc.
+ -- before the declaration is frozen. We need to generate the extra
+ -- formals, if any, to ensure that the expansion of the call includes
+ -- the proper actuals. This only applies to Ada subprograms, not to
+ -- imported ones.
Desig_Typ := Empty;
Desig_Typ := Designated_Type (Etype (Prefix (N)));
end if;
+ when N_Identifier =>
+ if Present (Nam)
+ and then Ekind (Nam) = E_Function
+ and then Nkind (Parent (N)) = N_Function_Call
+ and then Convention (Nam) = Convention_Ada
+ then
+ Create_Extra_Formals (Nam);
+ end if;
+
when others =>
null;
end case;
return;
end if;
- -- Loop for looking at the right place to insert the freeze nodes
+ -- Loop for looking at the right place to insert the freeze nodes,
-- exiting from the loop when it is appropriate to insert the freeze
-- node before the current node P.
loop
Parent_P := Parent (P);
- -- If we don't have a parent, then we are not in a well-formed
- -- tree. This is an unusual case, but there are some legitimate
- -- situations in which this occurs, notably when the expressions
- -- in the range of a type declaration are resolved. We simply
- -- ignore the freeze request in this case. Is this right ???
+ -- If we don't have a parent, then we are not in a well-formed tree.
+ -- This is an unusual case, but there are some legitimate situations
+ -- in which this occurs, notably when the expressions in the range of
+ -- a type declaration are resolved. We simply ignore the freeze
+ -- request in this case. Is this right ???
if No (Parent_P) then
return;
case Nkind (Parent_P) is
- -- A special test for the exception of (RM 13.14(8)) for the
- -- case of per-object expressions (RM 3.8(18)) occurring in a
- -- component definition or a discrete subtype definition. Note
- -- that we test for a component declaration which includes both
- -- cases we are interested in, and furthermore the tree does not
- -- have explicit nodes for either of these two constructs.
+ -- A special test for the exception of (RM 13.14(8)) for the case
+ -- of per-object expressions (RM 3.8(18)) occurring in component
+ -- definition or a discrete subtype definition. Note that we test
+ -- for a component declaration which includes both cases we are
+ -- interested in, and furthermore the tree does not have explicit
+ -- nodes for either of these two constructs.
when N_Component_Declaration =>
-- For either of these cases, we skip the freezing
- if not In_Default_Expression
+ if not In_Spec_Expression
and then Nkind (N) = N_Identifier
and then (Present (Entity (N)))
then
end if;
end if;
- -- If we have an enumeration literal that appears as the
- -- choice in the aggregate of an enumeration representation
- -- clause, then freezing does not occur (RM 13.14(10)).
+ -- If we have an enumeration literal that appears as the choice in
+ -- the aggregate of an enumeration representation clause, then
+ -- freezing does not occur (RM 13.14(10)).
when N_Enumeration_Representation_Clause =>
and then Is_Enumeration_Type (Etype (N))
then
-- If enumeration literal appears directly as the choice,
- -- do not freeze (this is the normal non-overloade case)
+ -- do not freeze (this is the normal non-overloaded case)
if Nkind (Parent (N)) = N_Component_Association
and then First (Choices (Parent (N))) = N
then
return;
- -- If enumeration literal appears as the name of a
- -- function which is the choice, then also do not freeze.
- -- This happens in the overloaded literal case, where the
+ -- If enumeration literal appears as the name of function
+ -- which is the choice, then also do not freeze. This
+ -- happens in the overloaded literal case, where the
-- enumeration literal is temporarily changed to a function
-- call for overloading analysis purposes.
when N_Handled_Sequence_Of_Statements =>
- -- An exception occurs when the sequence of statements is
- -- for an expander generated body that did not do the usual
- -- freeze all operation. In this case we usually want to
- -- freeze outside this body, not inside it, and we skip
- -- past the subprogram body that we are inside.
+ -- An exception occurs when the sequence of statements is for
+ -- an expander generated body that did not do the usual freeze
+ -- all operation. In this case we usually want to freeze
+ -- outside this body, not inside it, and we skip past the
+ -- subprogram body that we are inside.
if In_Exp_Body (Parent_P) then
exit;
end if;
- -- If parent is a body or a spec or a block, then the current
- -- node is a statement or declaration and we can insert the
- -- freeze node before it.
+ -- If parent is a body or a spec or a block, then the current node
+ -- is a statement or declaration and we can insert the freeze node
+ -- before it.
when N_Package_Specification |
N_Package_Body |
N_Entry_Call_Alternative |
N_Triggering_Alternative |
N_Abortable_Part |
+ N_And_Then |
+ N_Or_Else |
N_Freeze_Entity =>
exit when Is_List_Member (P);
-- Note: The N_Loop_Statement is a special case. A type that
-- appears in the source can never be frozen in a loop (this
- -- occurs only because of a loop expanded by the expander),
- -- so we keep on going. Otherwise we terminate the search.
- -- Same is true of any entity which comes from source. (if they
- -- have a predefined type, that type does not appear to come
- -- from source, but the entity should not be frozen here).
+ -- occurs only because of a loop expanded by the expander), so we
+ -- keep on going. Otherwise we terminate the search. Same is true
+ -- of any entity which comes from source. (if they have predefined
+ -- type, that type does not appear to come from source, but the
+ -- entity should not be frozen here).
when N_Loop_Statement =>
exit when not Comes_From_Source (Etype (N))
P := Parent_P;
end loop;
- -- If the expression appears in a record or an initialization
- -- procedure, the freeze nodes are collected and attached to
- -- the current scope, to be inserted and analyzed on exit from
- -- the scope, to insure that generated entities appear in the
- -- correct scope. If the expression is a default for a discriminant
- -- specification, the scope is still void. The expression can also
- -- appear in the discriminant part of a private or concurrent type.
-
- -- The other case requiring this special handling is if we are in
- -- a default expression, since in that case we are about to freeze
- -- a static type, and the freeze scope needs to be the outer scope,
- -- not the scope of the subprogram with the default parameter.
-
- -- For default expressions in generic units, the Move_Freeze_Nodes
- -- mechanism (see sem_ch12.adb) takes care of placing them at the
- -- proper place, after the generic unit.
-
- if (In_Def_Exp and not Inside_A_Generic)
+ -- If the expression appears in a record or an initialization procedure,
+ -- the freeze nodes are collected and attached to the current scope, to
+ -- be inserted and analyzed on exit from the scope, to insure that
+ -- generated entities appear in the correct scope. If the expression is
+ -- a default for a discriminant specification, the scope is still void.
+ -- The expression can also appear in the discriminant part of a private
+ -- or concurrent type.
+
+ -- If the expression appears in a constrained subcomponent of an
+ -- enclosing record declaration, the freeze nodes must be attached to
+ -- the outer record type so they can eventually be placed in the
+ -- enclosing declaration list.
+
+ -- The other case requiring this special handling is if we are in a
+ -- default expression, since in that case we are about to freeze a
+ -- static type, and the freeze scope needs to be the outer scope, not
+ -- the scope of the subprogram with the default parameter.
+
+ -- For default expressions and other spec expressions in generic units,
+ -- the Move_Freeze_Nodes mechanism (see sem_ch12.adb) takes care of
+ -- placing them at the proper place, after the generic unit.
+
+ if (In_Spec_Exp and not Inside_A_Generic)
or else Freeze_Outside
or else (Is_Type (Current_Scope)
and then (not Is_Concurrent_Type (Current_Scope)
declare
Loc : constant Source_Ptr := Sloc (Current_Scope);
Freeze_Nodes : List_Id := No_List;
+ Pos : Int := Scope_Stack.Last;
begin
if Present (Desig_Typ) then
Freeze_And_Append (Nam, Loc, Freeze_Nodes);
end if;
+ -- The current scope may be that of a constrained component of
+ -- an enclosing record declaration, which is above the current
+ -- scope in the scope stack.
+
+ if Is_Record_Type (Scope (Current_Scope)) then
+ Pos := Pos - 1;
+ end if;
+
if Is_Non_Empty_List (Freeze_Nodes) then
- if No (Scope_Stack.Table
- (Scope_Stack.Last).Pending_Freeze_Actions)
- then
- Scope_Stack.Table
- (Scope_Stack.Last).Pending_Freeze_Actions :=
+ if No (Scope_Stack.Table (Pos).Pending_Freeze_Actions) then
+ Scope_Stack.Table (Pos).Pending_Freeze_Actions :=
Freeze_Nodes;
else
- Append_List (Freeze_Nodes, Scope_Stack.Table
- (Scope_Stack.Last).Pending_Freeze_Actions);
+ Append_List (Freeze_Nodes,
+ Scope_Stack.Table (Pos).Pending_Freeze_Actions);
end if;
end if;
end;
end if;
-- Now we have the right place to do the freezing. First, a special
- -- adjustment, if we are in default expression analysis mode, these
- -- freeze actions must not be thrown away (normally all inserted
- -- actions are thrown away in this mode. However, the freeze actions
- -- are from static expressions and one of the important reasons we
- -- are doing this special analysis is to get these freeze actions.
- -- Therefore we turn off the In_Default_Expression mode to propagate
- -- these freeze actions. This also means they get properly analyzed
- -- and expanded.
+ -- adjustment, if we are in spec-expression analysis mode, these freeze
+ -- actions must not be thrown away (normally all inserted actions are
+ -- thrown away in this mode. However, the freeze actions are from static
+ -- expressions and one of the important reasons we are doing this
+ -- special analysis is to get these freeze actions. Therefore we turn
+ -- off the In_Spec_Expression mode to propagate these freeze actions.
+ -- This also means they get properly analyzed and expanded.
- In_Default_Expression := False;
+ In_Spec_Expression := False;
-- Freeze the designated type of an allocator (RM 13.14(13))
Freeze_Before (P, Nam);
end if;
- In_Default_Expression := In_Def_Exp;
+ -- Restore In_Spec_Expression flag
+
+ In_Spec_Expression := In_Spec_Exp;
end Freeze_Expression;
-----------------------------
-- Freeze_Fixed_Point_Type --
-----------------------------
- -- Certain fixed-point types and subtypes, including implicit base
- -- types and declared first subtypes, have not yet set up a range.
- -- This is because the range cannot be set until the Small and Size
- -- values are known, and these are not known till the type is frozen.
+ -- Certain fixed-point types and subtypes, including implicit base types
+ -- and declared first subtypes, have not yet set up a range. This is
+ -- because the range cannot be set until the Small and Size values are
+ -- known, and these are not known till the type is frozen.
- -- To signal this case, Scalar_Range contains an unanalyzed syntactic
- -- range whose bounds are unanalyzed real literals. This routine will
- -- recognize this case, and transform this range node into a properly
- -- typed range with properly analyzed and resolved values.
+ -- To signal this case, Scalar_Range contains an unanalyzed syntactic range
+ -- whose bounds are unanalyzed real literals. This routine will recognize
+ -- this case, and transform this range node into a properly typed range
+ -- with properly analyzed and resolved values.
procedure Freeze_Fixed_Point_Type (Typ : Entity_Id) is
Rng : constant Node_Id := Scalar_Range (Typ);
end if;
end if;
- -- Immediate return if the range is already analyzed. This means
- -- that the range is already set, and does not need to be computed
- -- by this routine.
+ -- Immediate return if the range is already analyzed. This means that
+ -- the range is already set, and does not need to be computed by this
+ -- routine.
if Analyzed (Rng) then
return;
if Is_Ordinary_Fixed_Point_Type (Typ) then
-- For the ordinary fixed-point case, we are allowed to fudge the
- -- end-points up or down by small. Generally we prefer to fudge
- -- up, i.e. widen the bounds for non-model numbers so that the
- -- end points are included. However there are cases in which this
- -- cannot be done, and indeed cases in which we may need to narrow
- -- the bounds. The following circuit makes the decision.
+ -- end-points up or down by small. Generally we prefer to fudge up,
+ -- i.e. widen the bounds for non-model numbers so that the end points
+ -- are included. However there are cases in which this cannot be
+ -- done, and indeed cases in which we may need to narrow the bounds.
+ -- The following circuit makes the decision.
- -- Note: our terminology here is that Incl_EP means that the
- -- bounds are widened by Small if necessary to include the end
- -- points, and Excl_EP means that the bounds are narrowed by
- -- Small to exclude the end-points if this reduces the size.
+ -- Note: our terminology here is that Incl_EP means that the bounds
+ -- are widened by Small if necessary to include the end points, and
+ -- Excl_EP means that the bounds are narrowed by Small to exclude the
+ -- end-points if this reduces the size.
-- Note that in the Incl case, all we care about is including the
-- end-points. In the Excl case, we want to narrow the bounds as
-- case of both bounds negative, because the sign will be dealt
-- with anyway. Furthermore we can't just go making such a bound
-- symmetrical, since in a twos-complement system, there is an
- -- extra negative value which could not be accomodated on the
+ -- extra negative value which could not be accommodated on the
-- positive side.
if Typ = Btyp
end if;
-- Compute the fudged bounds. If the number is a model number,
- -- then we do nothing to include it, but we are allowed to
- -- backoff to the next adjacent model number when we exclude
- -- it. If it is not a model number then we straddle the two
- -- values with the model numbers on either side.
+ -- then we do nothing to include it, but we are allowed to backoff
+ -- to the next adjacent model number when we exclude it. If it is
+ -- not a model number then we straddle the two values with the
+ -- model numbers on either side.
Model_Num := UR_Trunc (Loval / Small) * Small;
if UR_Is_Negative (Loval_Incl_EP) then
Loval_Excl_EP := Loval_Incl_EP + Small;
+
+ -- If the value went from negative to zero, then we have the
+ -- case where Loval_Incl_EP is the model number just below
+ -- zero, so we want to stick to the negative value for the
+ -- base type to maintain the condition that the size will
+ -- include signed values.
+
+ if Typ = Btyp
+ and then UR_Is_Zero (Loval_Excl_EP)
+ then
+ Loval_Excl_EP := Loval_Incl_EP;
+ end if;
+
else
Loval_Excl_EP := Loval_Incl_EP;
end if;
Hival_Excl_EP := Hival_Incl_EP;
end if;
- -- One further adjustment is needed. In the case of subtypes,
- -- we cannot go outside the range of the base type, or we get
+ -- One further adjustment is needed. In the case of subtypes, we
+ -- cannot go outside the range of the base type, or we get
-- peculiarities, and the base type range is already set. This
- -- only applies to the Incl values, since clearly the Excl
- -- values are already as restricted as they are allowed to be.
+ -- only applies to the Incl values, since clearly the Excl values
+ -- are already as restricted as they are allowed to be.
if Typ /= Btyp then
Loval_Incl_EP := UR_Max (Loval_Incl_EP, Realval (BLo));
Actual_Hi := Hival_Incl_EP;
end if;
- -- One pathological case: normally we never fudge a low
- -- bound down, since it would seem to increase the size
- -- (if it has any effect), but for ranges containing a
- -- single value, or no values, the high bound can be
- -- small too large. Consider:
+ -- One pathological case: normally we never fudge a low bound
+ -- down, since it would seem to increase the size (if it has
+ -- any effect), but for ranges containing single value, or no
+ -- values, the high bound can be small too large. Consider:
-- type t is delta 2.0**(-14)
-- range 131072.0 .. 0;
- -- That lower bound is *just* outside the range of 32
- -- bits, and does need fudging down in this case. Note
- -- that the bounds will always have crossed here, since
- -- the high bound will be fudged down if necessary, as
- -- in the case of:
+ -- That lower bound is *just* outside the range of 32 bits, and
+ -- does need fudging down in this case. Note that the bounds
+ -- will always have crossed here, since the high bound will be
+ -- fudged down if necessary, as in the case of:
-- type t is delta 2.0**(-14)
-- range 131072.0 .. 131072.0;
- -- So we can detect the situation by looking for crossed
- -- bounds, and if the bounds are crossed, and the low
- -- bound is greater than zero, we will always back it
- -- off by small, since this is completely harmless.
+ -- So we detect the situation by looking for crossed bounds,
+ -- and if the bounds are crossed, and the low bound is greater
+ -- than zero, we will always back it off by small, since this
+ -- is completely harmless.
if Actual_Lo > Actual_Hi then
if UR_Is_Positive (Actual_Lo) then
if Actual_Size > 64 then
Error_Msg_Uint_1 := UI_From_Int (Actual_Size);
Error_Msg_N
- ("size required (^) for type& too large, maximum is 64", Typ);
+ ("size required (^) for type& too large, maximum allowed is 64",
+ Typ);
Actual_Size := 64;
end if;
Error_Msg_Uint_1 := RM_Size (Typ);
Error_Msg_Uint_2 := UI_From_Int (Actual_Size);
Error_Msg_NE
- ("size given (^) for type& too small, minimum is ^",
+ ("size given (^) for type& too small, minimum allowed is ^",
Size_Clause (Typ), Typ);
else
Adjust_Esize_For_Alignment (Typ);
end if;
- -- If we have a base type, then expand the bounds so that they
- -- extend to the full width of the allocated size in bits, to
- -- avoid junk range checks on intermediate computations.
+ -- If we have a base type, then expand the bounds so that they extend to
+ -- the full width of the allocated size in bits, to avoid junk range
+ -- checks on intermediate computations.
if Base_Type (Typ) = Typ then
Set_Realval (Lo, -(Small * (Uint_2 ** (Actual_Size - 1))));
Set_Analyzed (Lo, False);
Analyze (Lo);
- -- Resolve with universal fixed if the base type, and the base
- -- type if it is a subtype. Note we can't resolve the base type
- -- with itself, that would be a reference before definition.
+ -- Resolve with universal fixed if the base type, and the base type if
+ -- it is a subtype. Note we can't resolve the base type with itself,
+ -- that would be a reference before definition.
if Typ = Btyp then
Resolve (Lo, Universal_Fixed);
Error_Msg_Uint_1 := RM_Size (Typ);
Error_Msg_Uint_2 := Minsiz;
Error_Msg_NE
- ("size given (^) for type& too small, minimum is ^",
+ ("size given (^) for type& too small, minimum allowed is ^",
Size_Clause (Typ), Typ);
end if;
-- static. This happens if the type depends on non-global objects.
procedure Ensure_Expression_Is_SA (N : Node_Id);
- -- Called to ensure that an expression used as part of a type
- -- definition is statically allocatable, which means that the type
- -- of the expression is statically allocatable, and the expression
- -- is either static, or a reference to a library level constant.
+ -- Called to ensure that an expression used as part of a type definition
+ -- is statically allocatable, which means that the expression type is
+ -- statically allocatable, and the expression is either static, or a
+ -- reference to a library level constant.
procedure Ensure_Type_Is_SA (Typ : Entity_Id);
-- Called to mark a type as static, checking that it is possible
return;
end if;
- -- We are also OK if the type is already marked as statically
- -- allocated, which means we processed it before.
+ -- We are also OK if the type already marked as statically allocated,
+ -- which means we processed it before.
if Is_Statically_Allocated (Typ) then
return;
elsif Is_Record_Type (Typ) then
C := First_Entity (Typ);
-
while Present (C) loop
if Ekind (C) = E_Discriminant
or else Ekind (C) = E_Component
begin
Ensure_Type_Is_SA (Etype (E));
- -- Reset True_Constant flag, since something strange is going on
- -- with the scoping here, and our simple value traceing may not
- -- be sufficient for this indication to be reliable. We kill the
- -- Constant_Value indication for the same reason.
-
- Set_Is_True_Constant (E, False);
- Set_Current_Value (E, Empty);
-
exception
when Cannot_Be_Static =>
- -- If the object that cannot be static is imported or exported,
- -- then we give an error message saying that this object cannot
- -- be imported or exported.
+ -- If the object that cannot be static is imported or exported, then
+ -- issue an error message saying that this object cannot be imported
+ -- or exported. If it has an address clause it is an overlay in the
+ -- current partition and the static requirement is not relevant.
+ -- Do not issue any error message when ignoring rep clauses.
- if Is_Imported (E) then
- Error_Msg_N
- ("& cannot be imported (local type is not constant)", E);
+ if Ignore_Rep_Clauses then
+ null;
+
+ elsif Is_Imported (E) then
+ if No (Address_Clause (E)) then
+ Error_Msg_N
+ ("& cannot be imported (local type is not constant)", E);
+ end if;
-- Otherwise must be exported, something is wrong if compiler
-- is marking something as statically allocated which cannot be).
-- Reset the Pure indication on an imported subprogram unless an
-- explicit Pure_Function pragma was present. We do this because
- -- otherwise it is an insidious error to call a non-pure function
- -- from a pure unit and have calls mysteriously optimized away.
- -- What happens here is that the Import can bypass the normal
- -- check to ensure that pure units call only pure subprograms.
+ -- otherwise it is an insidious error to call a non-pure function from
+ -- pure unit and have calls mysteriously optimized away. What happens
+ -- here is that the Import can bypass the normal check to ensure that
+ -- pure units call only pure subprograms.
if Is_Imported (E)
and then Is_Pure (E)
null;
-- If the return type is generic, we have emitted a warning
- -- earlier on, and there is nothing else to check here.
- -- Specific instantiations may lead to erroneous behavior.
+ -- earlier on, and there is nothing else to check here. Specific
+ -- instantiations may lead to erroneous behavior.
elsif Is_Generic_Type (Etype (E)) then
null;
+ -- Display warning if returning unconstrained array
+
elsif Is_Array_Type (Retype)
and then not Is_Constrained (Retype)
+
+ -- Exclude cases where descriptor mechanism is set, since the
+ -- VMS descriptor mechanisms allow such unconstrained returns.
+
and then Mechanism (E) not in Descriptor_Codes
+
+ -- Check appropriate warning is enabled (should we check for
+ -- Warnings (Off) on specific entities here, probably so???)
+
and then Warn_On_Export_Import
+
+ -- Exclude the VM case, since return of unconstrained arrays
+ -- is properly handled in both the JVM and .NET cases.
+
+ and then VM_Target = No_VM
then
Error_Msg_N
("?foreign convention function& should not return " &
end if;
-- If any of the formals for an exported foreign convention
- -- subprogram have defaults, then emit an appropriate warning
- -- since this is odd (default cannot be used from non-Ada code)
+ -- subprogram have defaults, then emit an appropriate warning since
+ -- this is odd (default cannot be used from non-Ada code)
if Is_Exported (E) then
F := First_Formal (E);
end if;
end if;
- -- For VMS, descriptor mechanisms for parameters are allowed only
- -- for imported subprograms.
+ -- For VMS, descriptor mechanisms for parameters are allowed only for
+ -- imported/exported subprograms. Moreover, the NCA descriptor is not
+ -- allowed for parameters of exported subprograms.
if OpenVMS_On_Target then
- if not Is_Imported (E) then
+ if Is_Exported (E) then
+ F := First_Formal (E);
+ while Present (F) loop
+ if Mechanism (F) = By_Descriptor_NCA then
+ Error_Msg_N
+ ("'N'C'A' descriptor for parameter not permitted", F);
+ Error_Msg_N
+ ("\can only be used for imported subprogram", F);
+ end if;
+
+ Next_Formal (F);
+ end loop;
+
+ elsif not Is_Imported (E) then
F := First_Formal (E);
while Present (F) loop
if Mechanism (F) in Descriptor_Codes then
Error_Msg_N
("descriptor mechanism for parameter not permitted", F);
Error_Msg_N
- ("\can only be used for imported subprogram", F);
+ ("\can only be used for imported/exported subprogram", F);
end if;
Next_Formal (F);
end loop;
end if;
end if;
+
+ -- Pragma Inline_Always is disallowed for dispatching subprograms
+ -- because the address of such subprograms is saved in the dispatch
+ -- table to support dispatching calls, and dispatching calls cannot
+ -- be inlined. This is consistent with the restriction against using
+ -- 'Access or 'Address on an Inline_Always subprogram.
+
+ if Is_Dispatching_Operation (E)
+ and then Has_Pragma_Inline_Always (E)
+ then
+ Error_Msg_N
+ ("pragma Inline_Always not allowed for dispatching subprograms", E);
+ end if;
+
+ -- Because of the implicit representation of inherited predefined
+ -- operators in the front-end, the overriding status of the operation
+ -- may be affected when a full view of a type is analyzed, and this is
+ -- not captured by the analysis of the corresponding type declaration.
+ -- Therefore the correctness of a not-overriding indicator must be
+ -- rechecked when the subprogram is frozen.
+
+ if Nkind (E) = N_Defining_Operator_Symbol
+ and then not Error_Posted (Parent (E))
+ then
+ Check_Overriding_Indicator (E, Empty, Is_Primitive (E));
+ end if;
end Freeze_Subprogram;
----------------------
elsif Is_Record_Type (T)
and not Is_Private_Type (T)
then
- -- Verify that the record type has no components with
- -- private types without completion.
+ -- Verify that the record type has no components with private types
+ -- without completion.
declare
Comp : Entity_Id;
return True;
end;
- else return not Is_Private_Type (T)
- or else Present (Full_View (Base_Type (T)));
+ -- For the designated type of an access to subprogram, all types in
+ -- the profile must be fully defined.
+
+ elsif Ekind (T) = E_Subprogram_Type then
+ declare
+ F : Entity_Id;
+
+ begin
+ F := First_Formal (T);
+ while Present (F) loop
+ if not Is_Fully_Defined (Etype (F)) then
+ return False;
+ end if;
+
+ Next_Formal (F);
+ end loop;
+
+ return Is_Fully_Defined (Etype (T));
+ end;
+
+ else
+ return not Is_Private_Type (T)
+ or else Present (Full_View (Base_Type (T)));
end if;
end Is_Fully_Defined;
begin
Set_Default_Expressions_Processed (E);
- -- A subprogram instance and its associated anonymous subprogram
- -- share their signature. The default expression functions are defined
- -- in the wrapper packages for the anonymous subprogram, and should
- -- not be generated again for the instance.
+ -- A subprogram instance and its associated anonymous subprogram share
+ -- their signature. The default expression functions are defined in the
+ -- wrapper packages for the anonymous subprogram, and should not be
+ -- generated again for the instance.
if Is_Generic_Instance (E)
and then Present (Alias (E))
end if;
Formal := First_Formal (E);
-
while Present (Formal) loop
if Present (Default_Value (Formal)) then
and then not Vax_Float (Etype (Dcopy)))
or else Nkind (Dcopy) = N_Character_Literal
or else Nkind (Dcopy) = N_String_Literal
- or else Nkind (Dcopy) = N_Null
+ or else Known_Null (Dcopy)
or else (Nkind (Dcopy) = N_Attribute_Reference
and then
Attribute_Name (Dcopy) = Name_Null_Parameter)
then
-- If there is no default function, we must still do a full
- -- analyze call on the default value, to ensure that all
- -- error checks are performed, e.g. those associated with
- -- static evaluation. Note that this branch will always be
- -- taken if the analyzer is turned off (but we still need the
- -- error checks).
+ -- analyze call on the default value, to ensure that all error
+ -- checks are performed, e.g. those associated with static
+ -- evaluation. Note: this branch will always be taken if the
+ -- analyzer is turned off (but we still need the error checks).
-- Note: the setting of parent here is to meet the requirement
-- that we can only analyze the expression while attached to
-- involve secondary stack expansion.
else
- Dnam :=
- Make_Defining_Identifier (Loc, New_Internal_Name ('D'));
+ Dnam := Make_Temporary (Loc, 'D');
Dbody :=
Make_Subprogram_Body (Loc,
Next_Formal (Formal);
end loop;
-
end Process_Default_Expressions;
----------------------------------------
end if;
end Set_Component_Alignment_If_Not_Set;
- ---------------------------
- -- Set_Debug_Info_Needed --
- ---------------------------
+ ------------------
+ -- Undelay_Type --
+ ------------------
- procedure Set_Debug_Info_Needed (T : Entity_Id) is
+ procedure Undelay_Type (T : Entity_Id) is
begin
- if No (T)
- or else Needs_Debug_Info (T)
- or else Debug_Info_Off (T)
+ Set_Has_Delayed_Freeze (T, False);
+ Set_Freeze_Node (T, Empty);
+
+ -- Since we don't want T to have a Freeze_Node, we don't want its
+ -- Full_View or Corresponding_Record_Type to have one either.
+
+ -- ??? Fundamentally, this whole handling is a kludge. What we really
+ -- want is to be sure that for an Itype that's part of record R and is a
+ -- subtype of type T, that it's frozen after the later of the freeze
+ -- points of R and T. We have no way of doing that directly, so what we
+ -- do is force most such Itypes to be frozen as part of freezing R via
+ -- this procedure and only delay the ones that need to be delayed
+ -- (mostly the designated types of access types that are defined as part
+ -- of the record).
+
+ if Is_Private_Type (T)
+ and then Present (Full_View (T))
+ and then Is_Itype (Full_View (T))
+ and then Is_Record_Type (Scope (Full_View (T)))
then
- return;
- else
- Set_Needs_Debug_Info (T);
+ Undelay_Type (Full_View (T));
end if;
- if Is_Object (T) then
- Set_Debug_Info_Needed (Etype (T));
-
- elsif Is_Type (T) then
- Set_Debug_Info_Needed (Etype (T));
-
- if Is_Record_Type (T) then
- declare
- Ent : Entity_Id := First_Entity (T);
- begin
- while Present (Ent) loop
- Set_Debug_Info_Needed (Ent);
- Next_Entity (Ent);
- end loop;
- end;
-
- elsif Is_Array_Type (T) then
- Set_Debug_Info_Needed (Component_Type (T));
-
- declare
- Indx : Node_Id := First_Index (T);
- begin
- while Present (Indx) loop
- Set_Debug_Info_Needed (Etype (Indx));
- Indx := Next_Index (Indx);
- end loop;
- end;
-
- if Is_Packed (T) then
- Set_Debug_Info_Needed (Packed_Array_Type (T));
- end if;
-
- elsif Is_Access_Type (T) then
- Set_Debug_Info_Needed (Directly_Designated_Type (T));
-
- elsif Is_Private_Type (T) then
- Set_Debug_Info_Needed (Full_View (T));
-
- elsif Is_Protected_Type (T) then
- Set_Debug_Info_Needed (Corresponding_Record_Type (T));
- end if;
+ if Is_Concurrent_Type (T)
+ and then Present (Corresponding_Record_Type (T))
+ and then Is_Itype (Corresponding_Record_Type (T))
+ and then Is_Record_Type (Scope (Corresponding_Record_Type (T)))
+ then
+ Undelay_Type (Corresponding_Record_Type (T));
end if;
- end Set_Debug_Info_Needed;
+ end Undelay_Type;
------------------
-- Warn_Overlay --
Nam : Entity_Id)
is
Ent : constant Entity_Id := Entity (Nam);
- -- The object to which the address clause applies.
+ -- The object to which the address clause applies
Init : Node_Id;
Old : Entity_Id := Empty;
return;
end if;
- -- We only give the warning for non-imported entities of a type
- -- for which a non-null base init proc is defined (or for access
- -- types which have implicit null initialization).
+ -- We only give the warning for non-imported entities of a type for
+ -- which a non-null base init proc is defined, or for objects of access
+ -- types with implicit null initialization, or when Normalize_Scalars
+ -- applies and the type is scalar or a string type (the latter being
+ -- tested for because predefined String types are initialized by inline
+ -- code rather than by an init_proc). Note that we do not give the
+ -- warning for Initialize_Scalars, since we suppressed initialization
+ -- in this case.
if Present (Expr)
- and then (Has_Non_Null_Base_Init_Proc (Typ)
- or else Is_Access_Type (Typ))
and then not Is_Imported (Ent)
+ and then (Has_Non_Null_Base_Init_Proc (Typ)
+ or else Is_Access_Type (Typ)
+ or else (Normalize_Scalars
+ and then (Is_Scalar_Type (Typ)
+ or else Is_String_Type (Typ))))
then
if Nkind (Expr) = N_Attribute_Reference
and then Is_Entity_Name (Prefix (Expr))
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.
+ -- 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;
if Present (Decl)
and then Nkind (Decl) = N_Pragma
- and then Chars (Decl) = Name_Import
+ and then Pragma_Name (Decl) = Name_Import
then
return;
end if;
and then Present (Packed_Array_Type (Etype (Comp)))
then
Error_Msg_NE
- ("packed array component& will be initialized to zero?",
- Nam, Comp);
+ ("\packed array component& " &
+ "will be initialized to zero?",
+ Nam, Comp);
exit;
else
Next_Component (Comp);
end if;
Error_Msg_N
- ("use pragma Import for & to " &
- "suppress initialization ('R'M B.1(24))?",
- Nam);
+ ("\use pragma Import for & to " &
+ "suppress initialization (RM B.1(24))?",
+ Nam);
end if;
end Warn_Overlay;